| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ordzsl | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| ordzsl | ⊢ (Ord 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orduninsuc 7887 | . . . . . 6 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) | |
| 2 | 1 | biimprd 251 | . . . . 5 ⊢ (Ord 𝐴 → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → 𝐴 = ∪ 𝐴)) |
| 3 | unizlim 6512 | . . . . 5 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ (𝐴 = ∅ ∨ Lim 𝐴))) | |
| 4 | 2, 3 | sylibd 242 | . . . 4 ⊢ (Ord 𝐴 → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → (𝐴 = ∅ ∨ Lim 𝐴))) |
| 5 | 4 | orrd 877 | . . 3 ⊢ (Ord 𝐴 → (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 = ∅ ∨ Lim 𝐴))) |
| 6 | 3orass 1107 | . . . 4 ⊢ ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) ↔ (𝐴 = ∅ ∨ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴))) | |
| 7 | or12 934 | . . . 4 ⊢ ((𝐴 = ∅ ∨ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) ↔ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 = ∅ ∨ Lim 𝐴))) | |
| 8 | 6, 7 | bitri 278 | . . 3 ⊢ ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) ↔ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 = ∅ ∨ Lim 𝐴))) |
| 9 | 5, 8 | sylibr 237 | . 2 ⊢ (Ord 𝐴 → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) |
| 10 | ord0 6442 | . . . 4 ⊢ Ord ∅ | |
| 11 | ordeq 6394 | . . . 4 ⊢ (𝐴 = ∅ → (Ord 𝐴 ↔ Ord ∅)) | |
| 12 | 10, 11 | mpbiri 261 | . . 3 ⊢ (𝐴 = ∅ → Ord 𝐴) |
| 13 | onsuc 7857 | . . . . . 6 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On) | |
| 14 | eleq1 2855 | . . . . . 6 ⊢ (𝐴 = suc 𝑥 → (𝐴 ∈ On ↔ suc 𝑥 ∈ On)) | |
| 15 | 13, 14 | imbitrrid 249 | . . . . 5 ⊢ (𝐴 = suc 𝑥 → (𝑥 ∈ On → 𝐴 ∈ On)) |
| 16 | eloni 6397 | . . . . 5 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
| 17 | 15, 16 | syl6com 38 | . . . 4 ⊢ (𝑥 ∈ On → (𝐴 = suc 𝑥 → Ord 𝐴)) |
| 18 | 17 | rexlimiv 3163 | . . 3 ⊢ (∃𝑥 ∈ On 𝐴 = suc 𝑥 → Ord 𝐴) |
| 19 | limord 6449 | . . 3 ⊢ (Lim 𝐴 → Ord 𝐴) | |
| 20 | 12, 18, 19 | 3jaoi 1457 | . 2 ⊢ ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) → Ord 𝐴) |
| 21 | 9, 20 | impbii 212 | 1 ⊢ (Ord 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∨ wo 861 ∨ w3o 1103 = wceq 1572 ∈ wcel 2150 ∃wrex 3093 ∅c0 4280 ∪ cuni 4871 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: onzsl 7890 tfrlem16 8438 omeulem1 8627 oaabs2 8695 rankxplim3 9934 rankxpsuc 9935 cardlim 10089 cardaleph 10206 cflim2 10379 dfrdg2 36773 |
| Copyright terms: Public domain | W3C validator |