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

Theorem onzsl 7890
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 3474 . . 3 (𝐴 ∈ On → 𝐴 ∈ V)
2 eloni 6397 . . 3 (𝐴 ∈ On → Ord 𝐴)
3 ordzsl 7889 . . . 4 (Ord 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴))
4 3mix1 1351 . . . . . 6 (𝐴 = ∅ → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
54adantl 487 . . . . 5 ((𝐴 ∈ V ∧ 𝐴 = ∅) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
6 3mix2 1352 . . . . . 6 (∃𝑥 ∈ On 𝐴 = suc 𝑥 → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
76adantl 487 . . . . 5 ((𝐴 ∈ V ∧ ∃𝑥 ∈ On 𝐴 = suc 𝑥) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
8 3mix3 1353 . . . . 5 ((𝐴 ∈ V ∧ Lim 𝐴) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
95, 7, 83jaodan 1461 . . . 4 ((𝐴 ∈ V ∧ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
103, 9sylan2b 606 . . 3 ((𝐴 ∈ V ∧ Ord 𝐴) → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
111, 2, 10syl2anc 596 . 2 (𝐴 ∈ On → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
12 0elon 6443 . . . 4 ∅ ∈ On
13 eleq1 2855 . . . 4 (𝐴 = ∅ → (𝐴 ∈ On ↔ ∅ ∈ On))
1412, 13mpbiri 261 . . 3 (𝐴 = ∅ → 𝐴 ∈ On)
15 onsuc 7857 . . . . 5 (𝑥 ∈ On → suc 𝑥 ∈ On)
16 eleq1 2855 . . . . 5 (𝐴 = suc 𝑥 → (𝐴 ∈ On ↔ suc 𝑥 ∈ On))
1715, 16syl5ibrcom 250 . . . 4 (𝑥 ∈ On → (𝐴 = suc 𝑥 → 𝐴 ∈ On))
1817rexlimiv 3163 . . 3 (∃𝑥 ∈ On 𝐴 = suc 𝑥 → 𝐴 ∈ On)
19 limelon 6453 . . 3 ((𝐴 ∈ V ∧ Lim 𝐴) → 𝐴 ∈ On)
2014, 18, 193jaoi 1457 . 2 ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)) → 𝐴 ∈ On)
2111, 20impbii 212 1 (𝐴 ∈ On ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 ∈ V ∧ Lim 𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∨ w3o 1103   = wceq 1572   ∈ wcel 2150  ∃wrex 3093  Vcvv 3453  ∅c0 4280  Ord word 6386  Oncon0 6387  Lim wlim 6388  suc csuc 6389
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-tr 5218  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393
This theorem is used by:  oawordeulem  8599  r1pwss  9827  r1val1  9829  pwcfsdom  10706  winalim2  10819  rankcf  10900  dfrdg4  36931  naddwordnexlem4  44724
  Copyright terms: Public domain W3C validator