| 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 9244 | . . 3 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∪ 𝐴 ∈ 𝐴) | |
| 2 | suceq 6403 | . . . 4 ⊢ (𝑥 = ∪ 𝐴 → suc 𝑥 = suc ∪ 𝐴) | |
| 3 | 2 | ssiun2s 5015 | . . 3 ⊢ (∪ 𝐴 ∈ 𝐴 → suc ∪ 𝐴 ⊆ ∪ 𝑥 ∈ 𝐴 suc 𝑥) |
| 4 | 1, 3 | syl 17 | . 2 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → suc ∪ 𝐴 ⊆ ∪ 𝑥 ∈ 𝐴 suc 𝑥) |
| 5 | ssorduni 7758 | . . . . . 6 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴) | |
| 6 | ordsuci 7787 | . . . . . 6 ⊢ (Ord ∪ 𝐴 → Ord suc ∪ 𝐴) | |
| 7 | 5, 6 | syl 17 | . . . . 5 ⊢ (𝐴 ⊆ On → Ord suc ∪ 𝐴) |
| 8 | onsucuni 7806 | . . . . . 6 ⊢ (𝐴 ⊆ On → 𝐴 ⊆ suc ∪ 𝐴) | |
| 9 | 8 | sselda 3949 | . . . . 5 ⊢ ((𝐴 ⊆ On ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ suc ∪ 𝐴) |
| 10 | ordsucss 7796 | . . . . . 6 ⊢ (Ord suc ∪ 𝐴 → (𝑥 ∈ suc ∪ 𝐴 → suc 𝑥 ⊆ suc ∪ 𝐴)) | |
| 11 | 10 | imp 406 | . . . . 5 ⊢ ((Ord suc ∪ 𝐴 ∧ 𝑥 ∈ suc ∪ 𝐴) → suc 𝑥 ⊆ suc ∪ 𝐴) |
| 12 | 7, 9, 11 | syl2an2r 685 | . . . 4 ⊢ ((𝐴 ⊆ On ∧ 𝑥 ∈ 𝐴) → suc 𝑥 ⊆ suc ∪ 𝐴) |
| 13 | 12 | iunssd 5017 | . . 3 ⊢ (𝐴 ⊆ On → ∪ 𝑥 ∈ 𝐴 suc 𝑥 ⊆ suc ∪ 𝐴) |
| 14 | 13 | 3ad2ant1 1133 | . 2 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∪ 𝑥 ∈ 𝐴 suc 𝑥 ⊆ suc ∪ 𝐴) |
| 15 | 4, 14 | eqssd 3967 | 1 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → suc ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 suc 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 ⊆ wss 3917 ∅c0 4299 ∪ cuni 4874 ∪ ciun 4958 Ord word 6334 Oncon0 6335 suc csuc 6337 Fincfn 8921 |
| 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-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 ax-un 7714 |
| 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-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 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-iun 4960 df-br 5111 df-opab 5173 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-om 7846 df-en 8922 df-fin 8925 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |