| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > orduniorsuc | Structured version Visualization version GIF version | ||
| Description: An ordinal class is either its union or the successor of its union. If we adopt the view that zero is a limit ordinal, this means every ordinal class is either a limit or a successor. (Contributed by NM, 13-Sep-2003.) |
| Ref | Expression |
|---|---|
| orduniorsuc | ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ∨ 𝐴 = suc ∪ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orduniss 6401 | . . . . . 6 ⊢ (Ord 𝐴 → ∪ 𝐴 ⊆ 𝐴) | |
| 2 | orduni 7717 | . . . . . . . 8 ⊢ (Ord 𝐴 → Ord ∪ 𝐴) | |
| 3 | ordelssne 6329 | . . . . . . . 8 ⊢ ((Ord ∪ 𝐴 ∧ Ord 𝐴) → (∪ 𝐴 ∈ 𝐴 ↔ (∪ 𝐴 ⊆ 𝐴 ∧ ∪ 𝐴 ≠ 𝐴))) | |
| 4 | 2, 3 | mpancom 688 | . . . . . . 7 ⊢ (Ord 𝐴 → (∪ 𝐴 ∈ 𝐴 ↔ (∪ 𝐴 ⊆ 𝐴 ∧ ∪ 𝐴 ≠ 𝐴))) |
| 5 | 4 | biimprd 248 | . . . . . 6 ⊢ (Ord 𝐴 → ((∪ 𝐴 ⊆ 𝐴 ∧ ∪ 𝐴 ≠ 𝐴) → ∪ 𝐴 ∈ 𝐴)) |
| 6 | 1, 5 | mpand 695 | . . . . 5 ⊢ (Ord 𝐴 → (∪ 𝐴 ≠ 𝐴 → ∪ 𝐴 ∈ 𝐴)) |
| 7 | ordsucss 7743 | . . . . 5 ⊢ (Ord 𝐴 → (∪ 𝐴 ∈ 𝐴 → suc ∪ 𝐴 ⊆ 𝐴)) | |
| 8 | 6, 7 | syld 47 | . . . 4 ⊢ (Ord 𝐴 → (∪ 𝐴 ≠ 𝐴 → suc ∪ 𝐴 ⊆ 𝐴)) |
| 9 | ordsucuni 7754 | . . . 4 ⊢ (Ord 𝐴 → 𝐴 ⊆ suc ∪ 𝐴) | |
| 10 | 8, 9 | jctild 525 | . . 3 ⊢ (Ord 𝐴 → (∪ 𝐴 ≠ 𝐴 → (𝐴 ⊆ suc ∪ 𝐴 ∧ suc ∪ 𝐴 ⊆ 𝐴))) |
| 11 | df-ne 2927 | . . . 4 ⊢ (𝐴 ≠ ∪ 𝐴 ↔ ¬ 𝐴 = ∪ 𝐴) | |
| 12 | necom 2979 | . . . 4 ⊢ (𝐴 ≠ ∪ 𝐴 ↔ ∪ 𝐴 ≠ 𝐴) | |
| 13 | 11, 12 | bitr3i 277 | . . 3 ⊢ (¬ 𝐴 = ∪ 𝐴 ↔ ∪ 𝐴 ≠ 𝐴) |
| 14 | eqss 3948 | . . 3 ⊢ (𝐴 = suc ∪ 𝐴 ↔ (𝐴 ⊆ suc ∪ 𝐴 ∧ suc ∪ 𝐴 ⊆ 𝐴)) | |
| 15 | 10, 13, 14 | 3imtr4g 296 | . 2 ⊢ (Ord 𝐴 → (¬ 𝐴 = ∪ 𝐴 → 𝐴 = suc ∪ 𝐴)) |
| 16 | 15 | orrd 863 | 1 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ∨ 𝐴 = suc ∪ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1541 ∈ wcel 2110 ≠ wne 2926 ⊆ wss 3900 ∪ cuni 4857 Ord word 6301 suc csuc 6304 |
| 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 2112 ax-9 2120 ax-ext 2702 ax-sep 5232 ax-nul 5242 ax-pr 5368 |
| 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 2067 df-clab 2709 df-cleq 2722 df-clel 2804 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3394 df-v 3436 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 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 6305 df-on 6306 df-suc 6308 |
| This theorem is referenced by: onuniorsuc 7762 oeeulem 8511 cantnfp1lem2 9564 cantnflem1 9574 cnfcom2lem 9586 dfac12lem1 10027 dfac12lem2 10028 ttukeylem3 10394 ttukeylem5 10396 ttukeylem6 10397 ordtoplem 36448 ordcmp 36460 onsucuni3 37380 aomclem5 43070 omlimcl2 43254 onov0suclim 43286 dflim5 43341 onsetreclem3 49718 |
| Copyright terms: Public domain | W3C validator |