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

Theorem ordzsl 3927
Description: An ordinal is zero, a successor ordinal, or a limit ordinal.
Assertion
Ref Expression
ordzsl |- (Ord A <-> (A = (/) \/ E.x e. On A = suc x \/ Lim A))
Distinct variable group:   x,A

Proof of Theorem ordzsl
StepHypRef Expression
1 orduninsuc 3925 . . . . . 6 |- (Ord A -> (A = U.A <-> -. E.x e. On A = suc x))
21biimprd 171 . . . . 5 |- (Ord A -> (-. E.x e. On A = suc x -> A = U.A))
3 unizlim 3786 . . . . 5 |- (Ord A -> (A = U.A <-> (A = (/) \/ Lim A)))
42, 3sylibd 219 . . . 4 |- (Ord A -> (-. E.x e. On A = suc x -> (A = (/) \/ Lim A)))
54orrd 250 . . 3 |- (Ord A -> (E.x e. On A = suc x \/ (A = (/) \/ Lim A)))
6 3orass 861 . . . 4 |- ((A = (/) \/ E.x e. On A = suc x \/ Lim A) <-> (A = (/) \/ (E.x e. On A = suc x \/ Lim A)))
7 or12 278 . . . 4 |- ((A = (/) \/ (E.x e. On A = suc x \/ Lim A)) <-> (E.x e. On A = suc x \/ (A = (/) \/ Lim A)))
86, 7bitri 190 . . 3 |- ((A = (/) \/ E.x e. On A = suc x \/ Lim A) <-> (E.x e. On A = suc x \/ (A = (/) \/ Lim A)))
95, 8sylibr 217 . 2 |- (Ord A -> (A = (/) \/ E.x e. On A = suc x \/ Lim A))
10 ord0 3715 . . . 4 |- Ord (/)
11 ordeq 3664 . . . 4 |- (A = (/) -> (Ord A <-> Ord (/)))
1210, 11mpbiri 211 . . 3 |- (A = (/) -> Ord A)
13 eleq1 1957 . . . . . 6 |- (A = suc x -> (A e. On <-> suc x e. On))
14 suceloni 3894 . . . . . 6 |- (x e. On -> suc x e. On)
1513, 14syl5bir 227 . . . . 5 |- (A = suc x -> (x e. On -> A e. On))
16 eloni 3667 . . . . 5 |- (A e. On -> Ord A)
1715, 16syl6com 64 . . . 4 |- (x e. On -> (A = suc x -> Ord A))
1817r19.23aiv 2211 . . 3 |- (E.x e. On A = suc x -> Ord A)
19 limord 3723 . . 3 |- (Lim A -> Ord A)
2012, 18, 193jaoi 1160 . 2 |- ((A = (/) \/ E.x e. On A = suc x \/ Lim A) -> Ord A)
219, 20impbii 174 1 |- (Ord A <-> (A = (/) \/ E.x e. On A = suc x \/ Lim A))
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 163   \/ wo 239   \/ w3o 857   = wceq 1298   e. wcel 1300  E.wrex 2106  (/)c0 2875  U.cuni 3177  Ord word 3656  Oncon0 3657  Lim wlim 3658  suc csuc 3659
This theorem is referenced by:  onzsl 3928  onzslOLD 3929  dflim3OLD 3931  rankr1 5785  rankxplim3 5825  rankxpsuc 5826  infenomsub 5889  cardlim 6003  cardaleph 6033  ordsucuniel 13863  axfelem11 14041  infenomsubOLD 15398
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-13 1311  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  ax-un 3790
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-if 2983  df-pw 3035  df-sn 3049  df-pr 3050  df-tp 3052  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  df-on 3661  df-lim 3662  df-suc 3663
Copyright terms: Public domain