Theorem swoord1 6158

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
swoord1	|- ( ph -> ( A .< C <-> B .< C ) )

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 swoord1

Step	Hyp	Ref	Expression
1		id 19	. . . 4 |- ( ph -> ph )
2		swoord.6	. . . . 5 |- ( ph -> A R B )
3		swoer.1	. . . . . . 7 |- R = ( ( X X. X ) \ ( .< u. `' .< ) )
4		difss 3098	. . . . . . 7 |- ( ( X X. X ) \ ( .< u. `' .< ) ) C_ ( X X. X )
5	3, 4	eqsstri 3029	. . . . . 6 |- R C_ ( X X. X )
6	5	ssbri 3827	. . . . 5 |- ( A R B -> A ( X X. X ) B )
7		df-br 3786	. . . . . 6 |- ( A ( X X. X ) B <-> <. A , B >. e. ( X X. X ) )
8		opelxp1 4395	. . . . . 6 |- ( <. A , B >. e. ( X X. X ) -> A e. X )
9	7, 8	sylbi 119	. . . . 5 |- ( A ( X X. X ) B -> A e. X )
10	2, 6, 9	3syl 17	. . . 4 |- ( ph -> A e. X )
11		swoord.5	. . . 4 |- ( ph -> C 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 4060	. . . 4 |- ( ( ph /\ ( A e. X /\ C e. X /\ B e. X ) ) -> ( A .< C -> ( A .< B \/ B .< C ) ) )
15	1, 10, 11, 12, 14	syl13anc 1171	. . 3 |- ( ph -> ( A .< C -> ( A .< B \/ B .< C ) ) )
16	3	brdifun 6156	. . . . . . 7 |- ( ( A e. X /\ B e. X ) -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
17	10, 12, 16	syl2anc 403	. . . . . 6 |- ( ph -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
18	2, 17	mpbid 145	. . . . 5 |- ( ph -> -. ( A .< B \/ B .< A ) )
19		orc 665	. . . . 5 |- ( A .< B -> ( A .< B \/ B .< A ) )
20	18, 19	nsyl 590	. . . 4 |- ( ph -> -. A .< B )
21		biorf 695	. . . 4 |- ( -. A .< B -> ( B .< C <-> ( A .< B \/ B .< C ) ) )
22	20, 21	syl 14	. . 3 |- ( ph -> ( B .< C <-> ( A .< B \/ B .< C ) ) )
23	15, 22	sylibrd 167	. 2 |- ( ph -> ( A .< C -> B .< C ) )
24	13	swopolem 4060	. . . 4 |- ( ( ph /\ ( B e. X /\ C e. X /\ A e. X ) ) -> ( B .< C -> ( B .< A \/ A .< C ) ) )
25	1, 12, 11, 10, 24	syl13anc 1171	. . 3 |- ( ph -> ( B .< C -> ( B .< A \/ A .< C ) ) )
26		olc 664	. . . . 5 |- ( B .< A -> ( A .< B \/ B .< A ) )
27	18, 26	nsyl 590	. . . 4 |- ( ph -> -. B .< A )
28		biorf 695	. . . 4 |- ( -. B .< A -> ( A .< C <-> ( B .< A \/ A .< C ) ) )
29	27, 28	syl 14	. . 3 |- ( ph -> ( A .< C <-> ( B .< A \/ A .< C ) ) )
30	25, 29	sylibrd 167	. 2 |- ( ph -> ( B .< C -> A .< C ) )
31	23, 30	impbid 127	1 |- ( ph -> ( A .< C <-> B .< C ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 102   <-> wb 103   \/ wo 661   /\ w3a 919   = wceq 1284   e. wcel 1433   \ cdif 2970   u. cun 2971   <.cop 3401   class class class wbr 3785   X. cxp 4361   `'ccnv 4362

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964

This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-xp 4369  df-cnv 4371

This theorem is referenced by: (None)