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

Theorem ordzsl 7775
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 7773 . . . . . 6 (Ord 𝐴 → (𝐴 = 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
21biimprd 248 . . . . 5 (Ord 𝐴 → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥𝐴 = 𝐴))
3 unizlim 6430 . . . . 5 (Ord 𝐴 → (𝐴 = 𝐴 ↔ (𝐴 = ∅ ∨ Lim 𝐴)))
42, 3sylibd 239 . . . 4 (Ord 𝐴 → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → (𝐴 = ∅ ∨ Lim 𝐴)))
54orrd 863 . . 3 (Ord 𝐴 → (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 = ∅ ∨ Lim 𝐴)))
6 3orass 1089 . . . 4 ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) ↔ (𝐴 = ∅ ∨ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)))
7 or12 920 . . . 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 6360 . . . 4 Ord ∅
11 ordeq 6313 . . . 4 (𝐴 = ∅ → (Ord 𝐴 ↔ Ord ∅))
1210, 11mpbiri 258 . . 3 (𝐴 = ∅ → Ord 𝐴)
13 onsuc 7743 . . . . . 6 (𝑥 ∈ On → suc 𝑥 ∈ On)
14 eleq1 2819 . . . . . 6 (𝐴 = suc 𝑥 → (𝐴 ∈ On ↔ suc 𝑥 ∈ On))
1513, 14imbitrrid 246 . . . . 5 (𝐴 = suc 𝑥 → (𝑥 ∈ On → 𝐴 ∈ On))
16 eloni 6316 . . . . 5 (𝐴 ∈ On → Ord 𝐴)
1715, 16syl6com 37 . . . 4 (𝑥 ∈ On → (𝐴 = suc 𝑥 → Ord 𝐴))
1817rexlimiv 3126 . . 3 (∃𝑥 ∈ On 𝐴 = suc 𝑥 → Ord 𝐴)
19 limord 6367 . . 3 (Lim 𝐴 → Ord 𝐴)
2012, 18, 193jaoi 1430 . 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 847  w3o 1085   = wceq 1541  wcel 2111  wrex 3056  c0 4280   cuni 4856  Ord word 6305  Oncon0 6306  Lim wlim 6307  suc csuc 6308
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-tr 5197  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312
This theorem is referenced by:  onzsl  7776  tfrlem16  8312  omeulem1  8497  oaabs2  8564  rankxplim3  9774  rankxpsuc  9775  cardlim  9865  cardaleph  9980  cflim2  10154  dfrdg2  35837
  Copyright terms: Public domain W3C validator