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

Theorem ordzsl 7796
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 7794 . . . . . 6 (Ord 𝐴 → (𝐴 = 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
21biimprd 248 . . . . 5 (Ord 𝐴 → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥𝐴 = 𝐴))
3 unizlim 6447 . . . . 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 6377 . . . 4 Ord ∅
11 ordeq 6330 . . . 4 (𝐴 = ∅ → (Ord 𝐴 ↔ Ord ∅))
1210, 11mpbiri 258 . . 3 (𝐴 = ∅ → Ord 𝐴)
13 onsuc 7764 . . . . . 6 (𝑥 ∈ On → suc 𝑥 ∈ On)
14 eleq1 2824 . . . . . 6 (𝐴 = suc 𝑥 → (𝐴 ∈ On ↔ suc 𝑥 ∈ On))
1513, 14imbitrrid 246 . . . . 5 (𝐴 = suc 𝑥 → (𝑥 ∈ On → 𝐴 ∈ On))
16 eloni 6333 . . . . 5 (𝐴 ∈ On → Ord 𝐴)
1715, 16syl6com 37 . . . 4 (𝑥 ∈ On → (𝐴 = suc 𝑥 → Ord 𝐴))
1817rexlimiv 3131 . . 3 (∃𝑥 ∈ On 𝐴 = suc 𝑥 → Ord 𝐴)
19 limord 6384 . . 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 3061  c0 4273   cuni 4850  Ord word 6322  Oncon0 6323  Lim wlim 6324  suc csuc 6325
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 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689
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 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-tr 5193  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329
This theorem is referenced by:  onzsl  7797  tfrlem16  8332  omeulem1  8517  oaabs2  8585  rankxplim3  9805  rankxpsuc  9806  cardlim  9896  cardaleph  10011  cflim2  10185  dfrdg2  35975
  Copyright terms: Public domain W3C validator