| 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 6345 | . . . . 5 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
| 2 | 1 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → Ord 𝐵) |
| 3 | orduniorsuc 7808 | . . . 4 ⊢ (Ord 𝐵 → (𝐵 = ∪ 𝐵 ∨ 𝐵 = suc ∪ 𝐵)) | |
| 4 | 2, 3 | syl 17 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (𝐵 = ∪ 𝐵 ∨ 𝐵 = suc ∪ 𝐵)) |
| 5 | 4 | orcomd 871 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (𝐵 = suc ∪ 𝐵 ∨ 𝐵 = ∪ 𝐵)) |
| 6 | simp2 1137 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → 𝐵 ≠ ∅) | |
| 7 | df-lim 6340 | . . . . . . . 8 ⊢ (Lim 𝐵 ↔ (Ord 𝐵 ∧ 𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵)) | |
| 8 | 7 | biimpri 228 | . . . . . . 7 ⊢ ((Ord 𝐵 ∧ 𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵) → Lim 𝐵) |
| 9 | 8 | 3expb 1120 | . . . . . 6 ⊢ ((Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵)) → Lim 𝐵) |
| 10 | 9 | con3i 154 | . . . . 5 ⊢ (¬ Lim 𝐵 → ¬ (Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵))) |
| 11 | 10 | 3ad2ant3 1135 | . . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ (Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵))) |
| 12 | 2, 11 | mpnanrd 409 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵)) |
| 13 | 6, 12 | mpnanrd 409 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ 𝐵 = ∪ 𝐵) |
| 14 | orcom 870 | . . 3 ⊢ ((𝐵 = suc ∪ 𝐵 ∨ 𝐵 = ∪ 𝐵) ↔ (𝐵 = ∪ 𝐵 ∨ 𝐵 = suc ∪ 𝐵)) | |
| 15 | df-or 848 | . . 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 847 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 ∅c0 4299 ∪ cuni 4874 Ord word 6334 Oncon0 6335 Lim wlim 6336 suc csuc 6337 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-tr 5218 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 |
| This theorem is referenced by: 1oequni2o 37363 rdgsucuni 37364 finxpreclem4 37389 |
| Copyright terms: Public domain | W3C validator |