| 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 6356 | . . . . 5 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
| 2 | 1 | 3ad2ant1 1146 | . . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → Ord 𝐵) |
| 3 | orduniorsuc 7810 | . . . 4 ⊢ (Ord 𝐵 → (𝐵 = ∪ 𝐵 ∨ 𝐵 = suc ∪ 𝐵)) | |
| 4 | 2, 3 | syl 17 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (𝐵 = ∪ 𝐵 ∨ 𝐵 = suc ∪ 𝐵)) |
| 5 | 4 | orcomd 882 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (𝐵 = suc ∪ 𝐵 ∨ 𝐵 = ∪ 𝐵)) |
| 6 | simp2 1150 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → 𝐵 ≠ ∅) | |
| 7 | df-lim 6351 | . . . . . . . 8 ⊢ (Lim 𝐵 ↔ (Ord 𝐵 ∧ 𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵)) | |
| 8 | 7 | biimpri 230 | . . . . . . 7 ⊢ ((Ord 𝐵 ∧ 𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵) → Lim 𝐵) |
| 9 | 8 | 3expb 1133 | . . . . . 6 ⊢ ((Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵)) → Lim 𝐵) |
| 10 | 9 | con3i 154 | . . . . 5 ⊢ (¬ Lim 𝐵 → ¬ (Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵))) |
| 11 | 10 | 3ad2ant3 1148 | . . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ (Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵))) |
| 12 | 2, 11 | mpnanrd 413 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ (𝐵 ≠ ∅ ∧ 𝐵 = ∪ 𝐵)) |
| 13 | 6, 12 | mpnanrd 413 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ 𝐵 = ∪ 𝐵) |
| 14 | orcom 881 | . . 3 ⊢ ((𝐵 = suc ∪ 𝐵 ∨ 𝐵 = ∪ 𝐵) ↔ (𝐵 = ∪ 𝐵 ∨ 𝐵 = suc ∪ 𝐵)) | |
| 15 | df-or 859 | . . 3 ⊢ ((𝐵 = ∪ 𝐵 ∨ 𝐵 = suc ∪ 𝐵) ↔ (¬ 𝐵 = ∪ 𝐵 → 𝐵 = suc ∪ 𝐵)) | |
| 16 | 14, 15 | sylbb 221 | . 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 399 ∨ wo 858 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 ≠ wne 2957 ∅c0 4285 ∪ cuni 4865 Ord word 6345 Oncon0 6346 Lim wlim 6347 suc csuc 6348 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5246 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-tr 5208 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 |
| This theorem is referenced by: 1oequni2o 37862 rdgsucuni 37863 finxpreclem4 37888 |
| Copyright terms: Public domain | W3C validator |