Theorem swoord1 6542

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 3253	. . . . . . 7 |- ( ( X X. X ) \ ( .< u. `' .< ) ) C_ ( X X. X )
5	3, 4	eqsstri 3179	. . . . . 6 |- R C_ ( X X. X )
6	5	ssbri 4033	. . . . 5 |- ( A R B -> A ( X X. X ) B )
7		df-br 3990	. . . . . 6 |- ( A ( X X. X ) B <-> <. A , B >. e. ( X X. X ) )
8		opelxp1 4645	. . . . . 6 |- ( <. A , B >. e. ( X X. X ) -> A e. X )
9	7, 8	sylbi 120	. . . . 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 4290	. . . 4 |- ( ( ph /\ ( A e. X /\ C e. X /\ B e. X ) ) -> ( A .< C -> ( A .< B \/ B .< C ) ) )
15	1, 10, 11, 12, 14	syl13anc 1235	. . 3 |- ( ph -> ( A .< C -> ( A .< B \/ B .< C ) ) )
16	3	brdifun 6540	. . . . . . 7 |- ( ( A e. X /\ B e. X ) -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
17	10, 12, 16	syl2anc 409	. . . . . 6 |- ( ph -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
18	2, 17	mpbid 146	. . . . 5 |- ( ph -> -. ( A .< B \/ B .< A ) )
19		orc 707	. . . . 5 |- ( A .< B -> ( A .< B \/ B .< A ) )
20	18, 19	nsyl 623	. . . 4 |- ( ph -> -. A .< B )
21		biorf 739	. . . 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 168	. 2 |- ( ph -> ( A .< C -> B .< C ) )
24	13	swopolem 4290	. . . 4 |- ( ( ph /\ ( B e. X /\ C e. X /\ A e. X ) ) -> ( B .< C -> ( B .< A \/ A .< C ) ) )
25	1, 12, 11, 10, 24	syl13anc 1235	. . 3 |- ( ph -> ( B .< C -> ( B .< A \/ A .< C ) ) )
26		olc 706	. . . . 5 |- ( B .< A -> ( A .< B \/ B .< A ) )
27	18, 26	nsyl 623	. . . 4 |- ( ph -> -. B .< A )
28		biorf 739	. . . 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 168	. 2 |- ( ph -> ( B .< C -> A .< C ) )
31	23, 30	impbid 128	1 |- ( ph -> ( A .< C <-> B .< C ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 103   <-> wb 104   \/ wo 703   /\ w3a 973   = wceq 1348   e. wcel 2141   \ cdif 3118   u. cun 3119   <.cop 3586   class class class wbr 3989   X. cxp 4609   `'ccnv 4610

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-xp 4617  df-cnv 4619

This theorem is referenced by: (None)