Theorem swoord2 6827

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 19	. . . 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 3355	. . . . . . 7 |- ( ( X X. X ) \ ( .< u. `' .< ) ) C_ ( X X. X )
6	4, 5	eqsstri 3280	. . . . . 6 |- R C_ ( X X. X )
7	6	ssbri 4170	. . . . 5 |- ( A R B -> A ( X X. X ) B )
8		df-br 4126	. . . . . 6 |- ( A ( X X. X ) B <-> <. A , B >. e. ( X X. X ) )
9		opelxp1 4803	. . . . . 6 |- ( <. A , B >. e. ( X X. X ) -> A e. X )
10	8, 9	sylbi 121	. . . . 5 |- ( A ( X X. X ) B -> A e. X )
11	3, 7, 10	3syl 17	. . . 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 4445	. . . 4 |- ( ( ph /\ ( C e. X /\ A e. X /\ B e. X ) ) -> ( C .< A -> ( C .< B \/ B .< A ) ) )
15	1, 2, 11, 12, 14	syl13anc 1280	. . 3 |- ( ph -> ( C .< A -> ( C .< B \/ B .< A ) ) )
16		idd 21	. . . 4 |- ( ph -> ( C .< B -> C .< B ) )
17	4	brdifun 6824	. . . . . . . 8 |- ( ( A e. X /\ B e. X ) -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
18	11, 12, 17	syl2anc 415	. . . . . . 7 |- ( ph -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
19	3, 18	mpbid 147	. . . . . 6 |- ( ph -> -. ( A .< B \/ B .< A ) )
20		olc 723	. . . . . 6 |- ( B .< A -> ( A .< B \/ B .< A ) )
21	19, 20	nsyl 637	. . . . 5 |- ( ph -> -. B .< A )
22	21	pm2.21d 628	. . . 4 |- ( ph -> ( B .< A -> C .< B ) )
23	16, 22	jaod 729	. . 3 |- ( ph -> ( ( C .< B \/ B .< A ) -> C .< B ) )
24	15, 23	syld 45	. 2 |- ( ph -> ( C .< A -> C .< B ) )
25	13	swopolem 4445	. . . 4 |- ( ( ph /\ ( C e. X /\ B e. X /\ A e. X ) ) -> ( C .< B -> ( C .< A \/ A .< B ) ) )
26	1, 2, 12, 11, 25	syl13anc 1280	. . 3 |- ( ph -> ( C .< B -> ( C .< A \/ A .< B ) ) )
27		idd 21	. . . 4 |- ( ph -> ( C .< A -> C .< A ) )
28		orc 724	. . . . . 6 |- ( A .< B -> ( A .< B \/ B .< A ) )
29	19, 28	nsyl 637	. . . . 5 |- ( ph -> -. A .< B )
30	29	pm2.21d 628	. . . 4 |- ( ph -> ( A .< B -> C .< A ) )
31	27, 30	jaod 729	. . 3 |- ( ph -> ( ( C .< A \/ A .< B ) -> C .< A ) )
32	26, 31	syld 45	. 2 |- ( ph -> ( C .< B -> C .< A ) )
33	24, 32	impbid 129	1 |- ( ph -> ( C .< A <-> C .< B ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   /\ w3a 1009   = wceq 1402   e. wcel 2209   \ cdif 3217   u. cun 3218   <.cop 3708   class class class wbr 4125   X. cxp 4767   `'ccnv 4768

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-xp 4775  df-cnv 4777

This theorem is referenced by: (None)