HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ordtri3orOLD 3692
Description: A trichotomy law for ordinals. Proposition 7.10 of [TakeutiZaring] p. 38.
Assertion
Ref Expression
ordtri3orOLD |- ((Ord A /\ Ord B) -> (A e. B \/ A = B \/ B e. A))

Proof of Theorem ordtri3orOLD
StepHypRef Expression
1 ordin 3689 . . . . . 6 |- ((Ord A /\ Ord B) -> Ord (A i^i B))
2 ordirr 3676 . . . . . 6 |- (Ord (A i^i B) -> -. (A i^i B) e. (A i^i B))
31, 2syl 12 . . . . 5 |- ((Ord A /\ Ord B) -> -. (A i^i B) e. (A i^i B))
4 elin 2786 . . . . . . . 8 |- ((A i^i B) e. (A i^i B) <-> ((A i^i B) e. A /\ (A i^i B) e. B))
5 incom 2787 . . . . . . . . . 10 |- (A i^i B) = (B i^i A)
65eleq1i 1960 . . . . . . . . 9 |- ((A i^i B) e. B <-> (B i^i A) e. B)
76anbi2i 538 . . . . . . . 8 |- (((A i^i B) e. A /\ (A i^i B) e. B) <-> ((A i^i B) e. A /\ (B i^i A) e. B))
84, 7bitri 190 . . . . . . 7 |- ((A i^i B) e. (A i^i B) <-> ((A i^i B) e. A /\ (B i^i A) e. B))
98notbii 204 . . . . . 6 |- (-. (A i^i B) e. (A i^i B) <-> -. ((A i^i B) e. A /\ (B i^i A) e. B))
10 ianor 329 . . . . . 6 |- (-. ((A i^i B) e. A /\ (B i^i A) e. B) <-> (-. (A i^i B) e. A \/ -. (B i^i A) e. B))
119, 10bitri 190 . . . . 5 |- (-. (A i^i B) e. (A i^i B) <-> (-. (A i^i B) e. A \/ -. (B i^i A) e. B))
123, 11sylib 215 . . . 4 |- ((Ord A /\ Ord B) -> (-. (A i^i B) e. A \/ -. (B i^i A) e. B))
13 inss1 2812 . . . . . . . . . 10 |- (A i^i B) C_ A
14 ordsseleq 3687 . . . . . . . . . 10 |- ((Ord (A i^i B) /\ Ord A) -> ((A i^i B) C_ A <-> ((A i^i B) e. A \/ (A i^i B) = A)))
1513, 14mpbii 210 . . . . . . . . 9 |- ((Ord (A i^i B) /\ Ord A) -> ((A i^i B) e. A \/ (A i^i B) = A))
1615, 1sylan 497 . . . . . . . 8 |- (((Ord A /\ Ord B) /\ Ord A) -> ((A i^i B) e. A \/ (A i^i B) = A))
1716anabss1 557 . . . . . . 7 |- ((Ord A /\ Ord B) -> ((A i^i B) e. A \/ (A i^i B) = A))
1817ord 249 . . . . . 6 |- ((Ord A /\ Ord B) -> (-. (A i^i B) e. A -> (A i^i B) = A))
19 df-ss 2605 . . . . . 6 |- (A C_ B <-> (A i^i B) = A)
2018, 19syl6ibr 230 . . . . 5 |- ((Ord A /\ Ord B) -> (-. (A i^i B) e. A -> A C_ B))
21 inss1 2812 . . . . . . . . . 10 |- (B i^i A) C_ B
22 ordsseleq 3687 . . . . . . . . . 10 |- ((Ord (B i^i A) /\ Ord B) -> ((B i^i A) C_ B <-> ((B i^i A) e. B \/ (B i^i A) = B)))
2321, 22mpbii 210 . . . . . . . . 9 |- ((Ord (B i^i A) /\ Ord B) -> ((B i^i A) e. B \/ (B i^i A) = B))
24 ordin 3689 . . . . . . . . 9 |- ((Ord B /\ Ord A) -> Ord (B i^i A))
2523, 24sylan 497 . . . . . . . 8 |- (((Ord B /\ Ord A) /\ Ord B) -> ((B i^i A) e. B \/ (B i^i A) = B))
2625anabss4 559 . . . . . . 7 |- ((Ord A /\ Ord B) -> ((B i^i A) e. B \/ (B i^i A) = B))
2726ord 249 . . . . . 6 |- ((Ord A /\ Ord B) -> (-. (B i^i A) e. B -> (B i^i A) = B))
28 df-ss 2605 . . . . . 6 |- (B C_ A <-> (B i^i A) = B)
2927, 28syl6ibr 230 . . . . 5 |- ((Ord A /\ Ord B) -> (-. (B i^i A) e. B -> B C_ A))
3020, 29orim12d 624 . . . 4 |- ((Ord A /\ Ord B) -> ((-. (A i^i B) e. A \/ -. (B i^i A) e. B) -> (A C_ B \/ B C_ A)))
3112, 30mpd 29 . . 3 |- ((Ord A /\ Ord B) -> (A C_ B \/ B C_ A))
32 ordsseleq 3687 . . . 4 |- ((Ord A /\ Ord B) -> (A C_ B <-> (A e. B \/ A = B)))
33 ordsseleq 3687 . . . . 5 |- ((Ord B /\ Ord A) -> (B C_ A <-> (B e. A \/ B = A)))
3433ancoms 484 . . . 4 |- ((Ord A /\ Ord B) -> (B C_ A <-> (B e. A \/ B = A)))
3532, 34orbi12d 689 . . 3 |- ((Ord A /\ Ord B) -> ((A C_ B \/ B C_ A) <-> ((A e. B \/ A = B) \/ (B e. A \/ B = A))))
3631, 35mpbid 212 . 2 |- ((Ord A /\ Ord B) -> ((A e. B \/ A = B) \/ (B e. A \/ B = A)))
37 df-3or 859 . . . 4 |- ((A e. B \/ A = B \/ B e. A) <-> ((A e. B \/ A = B) \/ B e. A))
38 or23 284 . . . 4 |- (((A e. B \/ A = B) \/ B e. A) <-> ((A e. B \/ B e. A) \/ A = B))
3937, 38bitri 190 . . 3 |- ((A e. B \/ A = B \/ B e. A) <-> ((A e. B \/ B e. A) \/ A = B))
40 orordir 289 . . 3 |- (((A e. B \/ B e. A) \/ A = B) <-> ((A e. B \/ A = B) \/ (B e. A \/ A = B)))
41 eqcom 1886 . . . . 5 |- (A = B <-> B = A)
4241orbi2i 275 . . . 4 |- ((B e. A \/ A = B) <-> (B e. A \/ B = A))
4342orbi2i 275 . . 3 |- (((A e. B \/ A = B) \/ (B e. A \/ A = B)) <-> ((A e. B \/ A = B) \/ (B e. A \/ B = A)))
4439, 40, 433bitri 194 . 2 |- ((A e. B \/ A = B \/ B e. A) <-> ((A e. B \/ A = B) \/ (B e. A \/ B = A)))
4536, 44sylibr 217 1 |- ((Ord A /\ Ord B) -> (A e. B \/ A = B \/ B e. A))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 163   \/ wo 239   /\ wa 240   \/ w3o 857   = wceq 1298   e. wcel 1300   i^i cin 2592   C_ wss 2593  Ord word 3656
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-3or 859  df-3an 860  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-ral 2109  df-rex 2110  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-pss 2607  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-uni 3178  df-br 3339  df-opab 3396  df-tr 3412  df-eprel 3583  df-po 3591  df-so 3604  df-fr 3625  df-we 3644  df-ord 3660
Copyright terms: Public domain