| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > onsucunifi | Structured version Visualization version GIF version | ||
| Description: The successor to the union of any non-empty, finite subset of ordinals is the union of the successors of the elements. (Contributed by RP, 12-Feb-2025.) |
| Ref | Expression |
|---|---|
| onsucunifi | ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → suc ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 suc 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordunifi 9292 | . . 3 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∪ 𝐴 ∈ 𝐴) | |
| 2 | suceq 6437 | . . . 4 ⊢ (𝑥 = ∪ 𝐴 → suc 𝑥 = suc ∪ 𝐴) | |
| 3 | 2 | ssiun2s 5009 | . . 3 ⊢ (∪ 𝐴 ∈ 𝐴 → suc ∪ 𝐴 ⊆ ∪ 𝑥 ∈ 𝐴 suc 𝑥) |
| 4 | 1, 3 | syl 18 | . 2 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → suc ∪ 𝐴 ⊆ ∪ 𝑥 ∈ 𝐴 suc 𝑥) |
| 5 | ssorduni 7800 | . . . . . 6 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴) | |
| 6 | ordsuci 7829 | . . . . . 6 ⊢ (Ord ∪ 𝐴 → Ord suc ∪ 𝐴) | |
| 7 | 5, 6 | syl 18 | . . . . 5 ⊢ (𝐴 ⊆ On → Ord suc ∪ 𝐴) |
| 8 | onsucuni 7846 | . . . . . 6 ⊢ (𝐴 ⊆ On → 𝐴 ⊆ suc ∪ 𝐴) | |
| 9 | 8 | sselda 3912 | . . . . 5 ⊢ ((𝐴 ⊆ On ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ suc ∪ 𝐴) |
| 10 | ordsucss 7836 | . . . . . 6 ⊢ (Ord suc ∪ 𝐴 → (𝑥 ∈ suc ∪ 𝐴 → suc 𝑥 ⊆ suc ∪ 𝐴)) | |
| 11 | 10 | imp 412 | . . . . 5 ⊢ ((Ord suc ∪ 𝐴 ∧ 𝑥 ∈ suc ∪ 𝐴) → suc 𝑥 ⊆ suc ∪ 𝐴) |
| 12 | 7, 9, 11 | syl2an2r 698 | . . . 4 ⊢ ((𝐴 ⊆ On ∧ 𝑥 ∈ 𝐴) → suc 𝑥 ⊆ suc ∪ 𝐴) |
| 13 | 12 | iunssd 5011 | . . 3 ⊢ (𝐴 ⊆ On → ∪ 𝑥 ∈ 𝐴 suc 𝑥 ⊆ suc ∪ 𝐴) |
| 14 | 13 | 3ad2ant1 1151 | . 2 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∪ 𝑥 ∈ 𝐴 suc 𝑥 ⊆ suc ∪ 𝐴) |
| 15 | 4, 14 | eqssd 3929 | 1 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → suc ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 suc 𝑥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1569 ∈ wcel 2146 ≠ wne 2958 ⊆ wss 3899 ∅c0 4280 ∪ cuni 4869 ∪ ciun 4953 Ord word 6367 Oncon0 6368 suc csuc 6370 Fincfn 8984 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-nul 5262 ax-pr 5394 ax-un 7758 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-om 7885 df-en 8985 df-fin 8988 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |