| Mathbox for ML |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > onsucuni3 | Structured version Visualization version GIF version | ||
| Description: If an ordinal number has a predecessor, then it is successor of that predecessor. (Contributed by ML, 17-Oct-2020.) |
| Ref | Expression |
|---|---|
| onsucuni3 | ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → 𝐵 = suc ∪ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eloni 6333 | . . . . 5 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
| 2 | 1 | 3ad2ant1 1134 | . . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → Ord 𝐵) |
| 3 | orduniorsuc 7781 | . . . 4 ⊢ (Ord 𝐵 → (𝐵 = ∪ 𝐵 ∨ 𝐵 = suc ∪ 𝐵)) | |
| 4 | 2, 3 | syl 17 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (𝐵 = ∪ 𝐵 ∨ 𝐵 = suc ∪ 𝐵)) |
| 5 | 4 | orcomd 872 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (𝐵 = suc ∪ 𝐵 ∨ 𝐵 = ∪ 𝐵)) |
| 6 | simp2 1138 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → 𝐵 ≠ ∅) | |
| 7 | df-lim 6328 | . . . . . . . 8 ⊢ (Lim 𝐵 ↔ (Ord 𝐵 ∧ 𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵)) | |
| 8 | 7 | biimpri 228 | . . . . . . 7 ⊢ ((Ord 𝐵 ∧ 𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵) → Lim 𝐵) |
| 9 | 8 | 3expb 1121 | . . . . . 6 ⊢ ((Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵)) → Lim 𝐵) |
| 10 | 9 | con3i 154 | . . . . 5 ⊢ (¬ Lim 𝐵 → ¬ (Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵))) |
| 11 | 10 | 3ad2ant3 1136 | . . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ (Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵))) |
| 12 | 2, 11 | mpnanrd 409 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵)) |
| 13 | 6, 12 | mpnanrd 409 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ 𝐵 = ∪ 𝐵) |
| 14 | orcom 871 | . . 3 ⊢ ((𝐵 = suc ∪ 𝐵 ∨ 𝐵 = ∪ 𝐵) ↔ (𝐵 = ∪ 𝐵 ∨ 𝐵 = suc ∪ 𝐵)) | |
| 15 | df-or 849 | . . 3 ⊢ ((𝐵 = ∪ 𝐵 ∨ 𝐵 = suc ∪ 𝐵) ↔ (¬ 𝐵 = ∪ 𝐵 → 𝐵 = suc ∪ 𝐵)) | |
| 16 | 14, 15 | sylbb 219 | . 2 ⊢ ((𝐵 = suc ∪ 𝐵 ∨ 𝐵 = ∪ 𝐵) → (¬ 𝐵 = ∪ 𝐵 → 𝐵 = suc ∪ 𝐵)) |
| 17 | 5, 13, 16 | sylc 65 | 1 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → 𝐵 = suc ∪ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 848 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∅c0 4273 ∪ cuni 4850 Ord word 6322 Oncon0 6323 Lim wlim 6324 suc csuc 6325 |
| 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 2708 ax-sep 5231 ax-pr 5375 |
| 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 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-tr 5193 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 |
| This theorem is referenced by: 1oequni2o 37684 rdgsucuni 37685 finxpreclem4 37710 |
| Copyright terms: Public domain | W3C validator |