Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  onzsl Structured version   Visualization version   GIF version

Theorem onzsl 6993
 Description: An ordinal number is zero, a successor ordinal, or a limit ordinal number. (Contributed by NM, 1-Oct-2003.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
onzsl (𝐴 ∈ On ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
Distinct variable group:   𝑥,𝐴

Proof of Theorem onzsl
StepHypRef Expression
1 elex 3198 . . 3 (𝐴 ∈ On → 𝐴 ∈ V)
2 eloni 5692 . . 3 (𝐴 ∈ On → Ord 𝐴)
3 ordzsl 6992 . . . 4 (Ord 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴))
4 3mix1 1228 . . . . . 6 (𝐴 = ∅ → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
54adantl 482 . . . . 5 ((𝐴 ∈ V ∧ 𝐴 = ∅) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
6 3mix2 1229 . . . . . 6 (∃𝑥 ∈ On 𝐴 = suc 𝑥 → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
76adantl 482 . . . . 5 ((𝐴 ∈ V ∧ ∃𝑥 ∈ On 𝐴 = suc 𝑥) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
8 3mix3 1230 . . . . 5 ((𝐴 ∈ V ∧ Lim 𝐴) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
95, 7, 83jaodan 1391 . . . 4 ((𝐴 ∈ V ∧ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
103, 9sylan2b 492 . . 3 ((𝐴 ∈ V ∧ Ord 𝐴) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
111, 2, 10syl2anc 692 . 2 (𝐴 ∈ On → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
12 0elon 5737 . . . 4 ∅ ∈ On
13 eleq1 2686 . . . 4 (𝐴 = ∅ → (𝐴 ∈ On ↔ ∅ ∈ On))
1412, 13mpbiri 248 . . 3 (𝐴 = ∅ → 𝐴 ∈ On)
15 suceloni 6960 . . . . 5 (𝑥 ∈ On → suc 𝑥 ∈ On)
16 eleq1 2686 . . . . 5 (𝐴 = suc 𝑥 → (𝐴 ∈ On ↔ suc 𝑥 ∈ On))
1715, 16syl5ibrcom 237 . . . 4 (𝑥 ∈ On → (𝐴 = suc 𝑥𝐴 ∈ On))
1817rexlimiv 3020 . . 3 (∃𝑥 ∈ On 𝐴 = suc 𝑥𝐴 ∈ On)
19 limelon 5747 . . 3 ((𝐴 ∈ V ∧ Lim 𝐴) → 𝐴 ∈ On)
2014, 18, 193jaoi 1388 . 2 ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)) → 𝐴 ∈ On)
2111, 20impbii 199 1 (𝐴 ∈ On ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 384   ∨ w3o 1035   = wceq 1480   ∈ wcel 1987  ∃wrex 2908  Vcvv 3186  ∅c0 3891  Ord word 5681  Oncon0 5682  Lim wlim 5683  suc csuc 5684 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pr 4867  ax-un 6902 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3418  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-pss 3571  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-tp 4153  df-op 4155  df-uni 4403  df-br 4614  df-opab 4674  df-tr 4713  df-eprel 4985  df-po 4995  df-so 4996  df-fr 5033  df-we 5035  df-ord 5685  df-on 5686  df-lim 5687  df-suc 5688 This theorem is referenced by:  oawordeulem  7579  r1pwss  8591  r1val1  8593  pwcfsdom  9349  winalim2  9462  rankcf  9543  dfrdg4  31697
 Copyright terms: Public domain W3C validator