Theorem swoord1 6616

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 3285	. . . . . . 7 |- ( ( X X. X ) \ ( .< u. `' .< ) ) C_ ( X X. X )
5	3, 4	eqsstri 3211	. . . . . 6 |- R C_ ( X X. X )
6	5	ssbri 4073	. . . . 5 |- ( A R B -> A ( X X. X ) B )
7		df-br 4030	. . . . . 6 |- ( A ( X X. X ) B <-> <. A , B >. e. ( X X. X ) )
8		opelxp1 4693	. . . . . 6 |- ( <. A , B >. e. ( X X. X ) -> A e. X )
9	7, 8	sylbi 121	. . . . 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 4336	. . . 4 |- ( ( ph /\ ( A e. X /\ C e. X /\ B e. X ) ) -> ( A .< C -> ( A .< B \/ B .< C ) ) )
15	1, 10, 11, 12, 14	syl13anc 1251	. . 3 |- ( ph -> ( A .< C -> ( A .< B \/ B .< C ) ) )
16	3	brdifun 6614	. . . . . . 7 |- ( ( A e. X /\ B e. X ) -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
17	10, 12, 16	syl2anc 411	. . . . . 6 |- ( ph -> ( A R B <-> -. ( A .< B \/ B .< A ) ) )
18	2, 17	mpbid 147	. . . . 5 |- ( ph -> -. ( A .< B \/ B .< A ) )
19		orc 713	. . . . 5 |- ( A .< B -> ( A .< B \/ B .< A ) )
20	18, 19	nsyl 629	. . . 4 |- ( ph -> -. A .< B )
21		biorf 745	. . . 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 169	. 2 |- ( ph -> ( A .< C -> B .< C ) )
24	13	swopolem 4336	. . . 4 |- ( ( ph /\ ( B e. X /\ C e. X /\ A e. X ) ) -> ( B .< C -> ( B .< A \/ A .< C ) ) )
25	1, 12, 11, 10, 24	syl13anc 1251	. . 3 |- ( ph -> ( B .< C -> ( B .< A \/ A .< C ) ) )
26		olc 712	. . . . 5 |- ( B .< A -> ( A .< B \/ B .< A ) )
27	18, 26	nsyl 629	. . . 4 |- ( ph -> -. B .< A )
28		biorf 745	. . . 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 169	. 2 |- ( ph -> ( B .< C -> A .< C ) )
31	23, 30	impbid 129	1 |- ( ph -> ( A .< C <-> B .< C ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 709   /\ w3a 980   = wceq 1364   e. wcel 2164   \ cdif 3150   u. cun 3151   <.cop 3621   class class class wbr 4029   X. cxp 4657   `'ccnv 4658

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-br 4030  df-opab 4091  df-xp 4665  df-cnv 4667

This theorem is referenced by: (None)