| 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 6416 | . . . . . 6 ⊢ (Ord 𝐴 → ∪ 𝐴 ⊆ 𝐴) | |
| 2 | orduni 7739 | . . . . . . . 8 ⊢ (Ord 𝐴 → Ord ∪ 𝐴) | |
| 3 | ordelssne 6344 | . . . . . . . 8 ⊢ ((Ord ∪ 𝐴 ∧ Ord 𝐴) → (∪ 𝐴 ∈ 𝐴 ↔ (∪ 𝐴 ⊆ 𝐴 ∧ ∪ 𝐴 ≠ 𝐴))) | |
| 4 | 2, 3 | mpancom 694 | . . . . . . 7 ⊢ (Ord 𝐴 → (∪ 𝐴 ∈ 𝐴 ↔ (∪ 𝐴 ⊆ 𝐴 ∧ ∪ 𝐴 ≠ 𝐴))) |
| 5 | 4 | biimprd 249 | . . . . . 6 ⊢ (Ord 𝐴 → ((∪ 𝐴 ⊆ 𝐴 ∧ ∪ 𝐴 ≠ 𝐴) → ∪ 𝐴 ∈ 𝐴)) |
| 6 | 1, 5 | mpand 701 | . . . . 5 ⊢ (Ord 𝐴 → (∪ 𝐴 ≠ 𝐴 → ∪ 𝐴 ∈ 𝐴)) |
| 7 | ordsucss 7765 | . . . . 5 ⊢ (Ord 𝐴 → (∪ 𝐴 ∈ 𝐴 → suc ∪ 𝐴 ⊆ 𝐴)) | |
| 8 | 6, 7 | syld 47 | . . . 4 ⊢ (Ord 𝐴 → (∪ 𝐴 ≠ 𝐴 → suc ∪ 𝐴 ⊆ 𝐴)) |
| 9 | ordsucuni 7776 | . . . 4 ⊢ (Ord 𝐴 → 𝐴 ⊆ suc ∪ 𝐴) | |
| 10 | 8, 9 | jctild 530 | . . 3 ⊢ (Ord 𝐴 → (∪ 𝐴 ≠ 𝐴 → (𝐴 ⊆ suc ∪ 𝐴 ∧ suc ∪ 𝐴 ⊆ 𝐴))) |
| 11 | df-ne 2936 | . . . 4 ⊢ (𝐴 ≠ ∪ 𝐴 ↔ ¬ 𝐴 = ∪ 𝐴) | |
| 12 | necom 2988 | . . . 4 ⊢ (𝐴 ≠ ∪ 𝐴 ↔ ∪ 𝐴 ≠ 𝐴) | |
| 13 | 11, 12 | bitr3i 278 | . . 3 ⊢ (¬ 𝐴 = ∪ 𝐴 ↔ ∪ 𝐴 ≠ 𝐴) |
| 14 | eqss 3937 | . . 3 ⊢ (𝐴 = suc ∪ 𝐴 ↔ (𝐴 ⊆ suc ∪ 𝐴 ∧ suc ∪ 𝐴 ⊆ 𝐴)) | |
| 15 | 10, 13, 14 | 3imtr4g 297 | . 2 ⊢ (Ord 𝐴 → (¬ 𝐴 = ∪ 𝐴 → 𝐴 = suc ∪ 𝐴)) |
| 16 | 15 | orrd 869 | 1 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ∨ 𝐴 = suc ∪ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∨ wo 853 = wceq 1547 ∈ wcel 2119 ≠ wne 2935 ⊆ wss 3890 ∪ cuni 4845 Ord word 6316 suc csuc 6319 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 ax-sep 5225 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-ne 2936 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-tr 5187 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-ord 6320 df-on 6321 df-suc 6323 |
| This theorem is referenced by: onuniorsuc 7784 oeeulem 8534 cantnfp1lem2 9598 cantnflem1 9608 cnfcom2lem 9620 dfac12lem1 10064 dfac12lem2 10065 ttukeylem3 10431 ttukeylem5 10433 ttukeylem6 10434 ordtoplem 36664 ordcmp 36676 onsucuni3 37730 aomclem5 43504 omlimcl2 43688 onov0suclim 43720 dflim5 43775 onsetreclem3 50198 |
| Copyright terms: Public domain | W3C validator |