Theorem swoord2 6136

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 3070	. . . . . . 7 |- ( ( X X. X ) \ ( .< u. `' .< ) ) C_ ( X X. X )
6	4, 5	eqsstri 2975	. . . . . 6 |- R C_ ( X X. X )
7	6	ssbri 3806	. . . . 5 |- ( A R B -> A ( X X. X ) B )
8		df-br 3765	. . . . . 6 |- ( A ( X X. X ) B <-> <. A , B >. e. ( X X. X ) )
9		opelxp1 4377	. . . . . 6 |- ( <. A , B >. e. ( X X. X ) -> A e. X )
10	8, 9	sylbi 114	. . . . 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 4042	. . . 4 |- ( ( ph /\ ( C e. X /\ A e. X /\ B e. X ) ) -> ( C .< A -> ( C .< B \/ B .< A ) ) )
15	1, 2, 11, 12, 14	syl13anc 1137	. . 3 |- ( ph -> ( C .< A -> ( C .< B \/ B .< A ) ) )
16		idd 21	. . . 4 |- ( ph -> ( C .< B -> C .< B ) )
17	4	brdifun 6133	. . . . . . . 8 |- ( ( A e. X /\ B e. X ) -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
18	11, 12, 17	syl2anc 391	. . . . . . 7 |- ( ph -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
19	3, 18	mpbid 135	. . . . . 6 |- ( ph -> -. ( A .< B \/ B .< A ) )
20		olc 632	. . . . . 6 |- ( B .< A -> ( A .< B \/ B .< A ) )
21	19, 20	nsyl 558	. . . . 5 |- ( ph -> -. B .< A )
22	21	pm2.21d 549	. . . 4 |- ( ph -> ( B .< A -> C .< B ) )
23	16, 22	jaod 637	. . 3 |- ( ph -> ( ( C .< B \/ B .< A ) -> C .< B ) )
24	15, 23	syld 40	. 2 |- ( ph -> ( C .< A -> C .< B ) )
25	13	swopolem 4042	. . . 4 |- ( ( ph /\ ( C e. X /\ B e. X /\ A e. X ) ) -> ( C .< B -> ( C .< A \/ A .< B ) ) )
26	1, 2, 12, 11, 25	syl13anc 1137	. . 3 |- ( ph -> ( C .< B -> ( C .< A \/ A .< B ) ) )
27		idd 21	. . . 4 |- ( ph -> ( C .< A -> C .< A ) )
28		orc 633	. . . . . 6 |- ( A .< B -> ( A .< B \/ B .< A ) )
29	19, 28	nsyl 558	. . . . 5 |- ( ph -> -. A .< B )
30	29	pm2.21d 549	. . . 4 |- ( ph -> ( A .< B -> C .< A ) )
31	27, 30	jaod 637	. . 3 |- ( ph -> ( ( C .< A \/ A .< B ) -> C .< A ) )
32	26, 31	syld 40	. 2 |- ( ph -> ( C .< B -> C .< A ) )
33	24, 32	impbid 120	1 |- ( ph -> ( C .< A <-> C .< B ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 97   <-> wb 98   \/ wo 629   /\ w3a 885   = wceq 1243   e. wcel 1393   \ cdif 2914   u. cun 2915   <.cop 3378   class class class wbr 3764   X. cxp 4343   `'ccnv 4344

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-opab 3819  df-xp 4351  df-cnv 4353

This theorem is referenced by: (None)