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

Theorem ordzsl 7791
Description: An ordinal is zero, a successor ordinal, or a limit ordinal. Remark 1.12 of [Schloeder] p. 2. (Contributed by NM, 1-Oct-2003.)
Assertion
Ref Expression
ordzsl (Ord 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴))
Distinct variable group:   𝑥,𝐴

Proof of Theorem ordzsl
StepHypRef Expression
1 orduninsuc 7789 . . . . . 6 (Ord 𝐴 → (𝐴 = 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
21biimprd 248 . . . . 5 (Ord 𝐴 → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥𝐴 = 𝐴))
3 unizlim 6443 . . . . 5 (Ord 𝐴 → (𝐴 = 𝐴 ↔ (𝐴 = ∅ ∨ Lim 𝐴)))
42, 3sylibd 239 . . . 4 (Ord 𝐴 → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → (𝐴 = ∅ ∨ Lim 𝐴)))
54orrd 864 . . 3 (Ord 𝐴 → (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 = ∅ ∨ Lim 𝐴)))
6 3orass 1090 . . . 4 ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) ↔ (𝐴 = ∅ ∨ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)))
7 or12 921 . . . 4 ((𝐴 = ∅ ∨ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) ↔ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 = ∅ ∨ Lim 𝐴)))
86, 7bitri 275 . . 3 ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) ↔ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 = ∅ ∨ Lim 𝐴)))
95, 8sylibr 234 . 2 (Ord 𝐴 → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴))
10 ord0 6373 . . . 4 Ord ∅
11 ordeq 6326 . . . 4 (𝐴 = ∅ → (Ord 𝐴 ↔ Ord ∅))
1210, 11mpbiri 258 . . 3 (𝐴 = ∅ → Ord 𝐴)
13 onsuc 7759 . . . . . 6 (𝑥 ∈ On → suc 𝑥 ∈ On)
14 eleq1 2825 . . . . . 6 (𝐴 = suc 𝑥 → (𝐴 ∈ On ↔ suc 𝑥 ∈ On))
1513, 14imbitrrid 246 . . . . 5 (𝐴 = suc 𝑥 → (𝑥 ∈ On → 𝐴 ∈ On))
16 eloni 6329 . . . . 5 (𝐴 ∈ On → Ord 𝐴)
1715, 16syl6com 37 . . . 4 (𝑥 ∈ On → (𝐴 = suc 𝑥 → Ord 𝐴))
1817rexlimiv 3132 . . 3 (∃𝑥 ∈ On 𝐴 = suc 𝑥 → Ord 𝐴)
19 limord 6380 . . 3 (Lim 𝐴 → Ord 𝐴)
2012, 18, 193jaoi 1431 . 2 ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) → Ord 𝐴)
219, 20impbii 209 1 (Ord 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 206  wo 848  w3o 1086   = wceq 1542  wcel 2114  wrex 3062  c0 4274   cuni 4851  Ord word 6318  Oncon0 6319  Lim wlim 6320  suc csuc 6321
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pr 5372  ax-un 7684
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-tr 5194  df-eprel 5526  df-po 5534  df-so 5535  df-fr 5579  df-we 5581  df-ord 6322  df-on 6323  df-lim 6324  df-suc 6325
This theorem is referenced by:  onzsl  7792  tfrlem16  8327  omeulem1  8512  oaabs2  8580  rankxplim3  9800  rankxpsuc  9801  cardlim  9891  cardaleph  10006  cflim2  10180  dfrdg2  35995
  Copyright terms: Public domain W3C validator