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. (Contributed by NM, 1-Oct-2003.) |
Ref | Expression |
---|---|
ordzsl | ⊢ (Ord 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | orduninsuc 7560 | . . . . . 6 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) | |
2 | 1 | biimprd 250 | . . . . 5 ⊢ (Ord 𝐴 → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → 𝐴 = ∪ 𝐴)) |
3 | unizlim 6309 | . . . . 5 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ (𝐴 = ∅ ∨ Lim 𝐴))) | |
4 | 2, 3 | sylibd 241 | . . . 4 ⊢ (Ord 𝐴 → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 → (𝐴 = ∅ ∨ Lim 𝐴))) |
5 | 4 | orrd 859 | . . 3 ⊢ (Ord 𝐴 → (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 = ∅ ∨ Lim 𝐴))) |
6 | 3orass 1086 | . . . 4 ⊢ ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) ↔ (𝐴 = ∅ ∨ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴))) | |
7 | or12 917 | . . . 4 ⊢ ((𝐴 = ∅ ∨ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) ↔ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 = ∅ ∨ Lim 𝐴))) | |
8 | 6, 7 | bitri 277 | . . 3 ⊢ ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) ↔ (∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ (𝐴 = ∅ ∨ Lim 𝐴))) |
9 | 5, 8 | sylibr 236 | . 2 ⊢ (Ord 𝐴 → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) |
10 | ord0 6245 | . . . 4 ⊢ Ord ∅ | |
11 | ordeq 6200 | . . . 4 ⊢ (𝐴 = ∅ → (Ord 𝐴 ↔ Ord ∅)) | |
12 | 10, 11 | mpbiri 260 | . . 3 ⊢ (𝐴 = ∅ → Ord 𝐴) |
13 | suceloni 7530 | . . . . . 6 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On) | |
14 | eleq1 2902 | . . . . . 6 ⊢ (𝐴 = suc 𝑥 → (𝐴 ∈ On ↔ suc 𝑥 ∈ On)) | |
15 | 13, 14 | syl5ibr 248 | . . . . 5 ⊢ (𝐴 = suc 𝑥 → (𝑥 ∈ On → 𝐴 ∈ On)) |
16 | eloni 6203 | . . . . 5 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
17 | 15, 16 | syl6com 37 | . . . 4 ⊢ (𝑥 ∈ On → (𝐴 = suc 𝑥 → Ord 𝐴)) |
18 | 17 | rexlimiv 3282 | . . 3 ⊢ (∃𝑥 ∈ On 𝐴 = suc 𝑥 → Ord 𝐴) |
19 | limord 6252 | . . 3 ⊢ (Lim 𝐴 → Ord 𝐴) | |
20 | 12, 18, 19 | 3jaoi 1423 | . 2 ⊢ ((𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴) → Ord 𝐴) |
21 | 9, 20 | impbii 211 | 1 ⊢ (Ord 𝐴 ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ∨ Lim 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 208 ∨ wo 843 ∨ w3o 1082 = wceq 1537 ∈ wcel 2114 ∃wrex 3141 ∅c0 4293 ∪ cuni 4840 Ord word 6192 Oncon0 6193 Lim wlim 6194 suc csuc 6195 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-tr 5175 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 |
This theorem is referenced by: onzsl 7563 tfrlem16 8031 omeulem1 8210 oaabs2 8274 rankxplim3 9312 rankxpsuc 9313 cardlim 9403 cardaleph 9517 cflim2 9687 dfrdg2 33042 |
Copyright terms: Public domain | W3C validator |