| 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 7787 | . . . . . 6 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) | |
| 2 | 1 | biimprd 248 | . . . . 5 ⊢ (Ord 𝐴 → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → 𝐴 = ∪ 𝐴)) |
| 3 | unizlim 6442 | . . . . 5 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ (𝐴 = ∅ ∨ Lim 𝐴))) | |
| 4 | 2, 3 | sylibd 239 | . . . 4 ⊢ (Ord 𝐴 → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → (𝐴 = ∅ ∨ Lim 𝐴))) |
| 5 | 4 | orrd 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 𝐴))) | |
| 8 | 6, 7 | bitri 275 | . . 3 ⊢ ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) ↔ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 = ∅ ∨ Lim 𝐴))) |
| 9 | 5, 8 | sylibr 234 | . 2 ⊢ (Ord 𝐴 → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) |
| 10 | ord0 6372 | . . . 4 ⊢ Ord ∅ | |
| 11 | ordeq 6325 | . . . 4 ⊢ (𝐴 = ∅ → (Ord 𝐴 ↔ Ord ∅)) | |
| 12 | 10, 11 | mpbiri 258 | . . 3 ⊢ (𝐴 = ∅ → Ord 𝐴) |
| 13 | onsuc 7757 | . . . . . 6 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On) | |
| 14 | eleq1 2825 | . . . . . 6 ⊢ (𝐴 = suc 𝑥 → (𝐴 ∈ On ↔ suc 𝑥 ∈ On)) | |
| 15 | 13, 14 | imbitrrid 246 | . . . . 5 ⊢ (𝐴 = suc 𝑥 → (𝑥 ∈ On → 𝐴 ∈ On)) |
| 16 | eloni 6328 | . . . . 5 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
| 17 | 15, 16 | syl6com 37 | . . . 4 ⊢ (𝑥 ∈ On → (𝐴 = suc 𝑥 → Ord 𝐴)) |
| 18 | 17 | rexlimiv 3131 | . . 3 ⊢ (∃𝑥 ∈ On 𝐴 = suc 𝑥 → Ord 𝐴) |
| 19 | limord 6379 | . . 3 ⊢ (Lim 𝐴 → Ord 𝐴) | |
| 20 | 12, 18, 19 | 3jaoi 1431 | . 2 ⊢ ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) → Ord 𝐴) |
| 21 | 9, 20 | impbii 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 4286 ∪ cuni 4864 Ord word 6317 Oncon0 6318 Lim wlim 6319 suc csuc 6320 |
| 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 5242 ax-nul 5252 ax-pr 5378 ax-un 7682 |
| 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 3062 df-rab 3401 df-v 3443 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-tr 5207 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 |
| This theorem is referenced by: onzsl 7790 tfrlem16 8326 omeulem1 8511 oaabs2 8579 rankxplim3 9797 rankxpsuc 9798 cardlim 9888 cardaleph 10003 cflim2 10177 dfrdg2 35989 |
| Copyright terms: Public domain | W3C validator |