Theorem swoord2 7774

Description: The incomparability equivalence relation is compatible with the original order. (Contributed by Mario Carneiro, 31-Dec-2014.)

Hypotheses

Ref	Expression
swoer.1	|- R = ( ( X X. X ) \ ( .< u. `' .< ) )
swoer.2	|- ( ( ph /\ ( y e. X /\ z e. X ) ) -> ( y .< z -> -. z .< y ) )
swoer.3	|- ( ( ph /\ ( x e. X /\ y e. X /\ z e. X ) ) -> ( x .< y -> ( x .< z \/ z .< y ) ) )
swoord.4	|- ( ph -> B e. X )
swoord.5	|- ( ph -> C e. X )
swoord.6	|- ( ph -> A R B )

Assertion

Ref	Expression
swoord2	|- ( ph -> ( C .< A <-> C .< B ) )

Distinct variable groups:   x, y, z, .<   x, A, y, z   x, B, y, z   x, C, y, z   ph, x, y, z   x, X, y, z

Allowed substitution hints:   R( x, y, z)

Proof of Theorem swoord2

Step	Hyp	Ref	Expression
1		id 22	. . . 4 |- ( ph -> ph )
2		swoord.5	. . . 4 |- ( ph -> C e. X )
3		swoord.6	. . . . 5 |- ( ph -> A R B )
4		swoer.1	. . . . . . 7 |- R = ( ( X X. X ) \ ( .< u. `' .< ) )
5		difss 3737	. . . . . . 7 |- ( ( X X. X ) \ ( .< u. `' .< ) ) C_ ( X X. X )
6	4, 5	eqsstri 3635	. . . . . 6 |- R C_ ( X X. X )
7	6	ssbri 4697	. . . . 5 |- ( A R B -> A ( X X. X ) B )
8		df-br 4654	. . . . . 6 |- ( A ( X X. X ) B <-> <. A , B >. e. ( X X. X ) )
9		opelxp1 5150	. . . . . 6 |- ( <. A , B >. e. ( X X. X ) -> A e. X )
10	8, 9	sylbi 207	. . . . 5 |- ( A ( X X. X ) B -> A e. X )
11	3, 7, 10	3syl 18	. . . 4 |- ( ph -> A e. X )
12		swoord.4	. . . 4 |- ( ph -> B e. X )
13		swoer.3	. . . . 5 |- ( ( ph /\ ( x e. X /\ y e. X /\ z e. X ) ) -> ( x .< y -> ( x .< z \/ z .< y ) ) )
14	13	swopolem 5044	. . . 4 |- ( ( ph /\ ( C e. X /\ A e. X /\ B e. X ) ) -> ( C .< A -> ( C .< B \/ B .< A ) ) )
15	1, 2, 11, 12, 14	syl13anc 1328	. . 3 |- ( ph -> ( C .< A -> ( C .< B \/ B .< A ) ) )
16		idd 24	. . . 4 |- ( ph -> ( C .< B -> C .< B ) )
17	4	brdifun 7771	. . . . . . . 8 |- ( ( A e. X /\ B e. X ) -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
18	11, 12, 17	syl2anc 693	. . . . . . 7 |- ( ph -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
19	3, 18	mpbid 222	. . . . . 6 |- ( ph -> -. ( A .< B \/ B .< A ) )
20		olc 399	. . . . . 6 |- ( B .< A -> ( A .< B \/ B .< A ) )
21	19, 20	nsyl 135	. . . . 5 |- ( ph -> -. B .< A )
22	21	pm2.21d 118	. . . 4 |- ( ph -> ( B .< A -> C .< B ) )
23	16, 22	jaod 395	. . 3 |- ( ph -> ( ( C .< B \/ B .< A ) -> C .< B ) )
24	15, 23	syld 47	. 2 |- ( ph -> ( C .< A -> C .< B ) )
25	13	swopolem 5044	. . . 4 |- ( ( ph /\ ( C e. X /\ B e. X /\ A e. X ) ) -> ( C .< B -> ( C .< A \/ A .< B ) ) )
26	1, 2, 12, 11, 25	syl13anc 1328	. . 3 |- ( ph -> ( C .< B -> ( C .< A \/ A .< B ) ) )
27		idd 24	. . . 4 |- ( ph -> ( C .< A -> C .< A ) )
28		orc 400	. . . . . 6 |- ( A .< B -> ( A .< B \/ B .< A ) )
29	19, 28	nsyl 135	. . . . 5 |- ( ph -> -. A .< B )
30	29	pm2.21d 118	. . . 4 |- ( ph -> ( A .< B -> C .< A ) )
31	27, 30	jaod 395	. . 3 |- ( ph -> ( ( C .< A \/ A .< B ) -> C .< A ) )
32	26, 31	syld 47	. 2 |- ( ph -> ( C .< B -> C .< A ) )
33	24, 32	impbid 202	1 |- ( ph -> ( C .< A <-> C .< B ) )

Syntax hints:   -. wn 3   -> wi 4   <-> wb 196   \/ wo 383   /\ wa 384   /\ w3a 1037   = wceq 1483   e. wcel 1990   \ cdif 3571   u. cun 3572   <.cop 4183   class class class wbr 4653   X. cxp 5112   `'ccnv 5113

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-xp 5120  df-cnv 5122

This theorem is referenced by: (None)