| 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 9188 | . . 3 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∪ 𝐴 ∈ 𝐴) | |
| 2 | suceq 6383 | . . . 4 ⊢ (𝑥 = ∪ 𝐴 → suc 𝑥 = suc ∪ 𝐴) | |
| 3 | 2 | ssiun2s 5002 | . . 3 ⊢ (∪ 𝐴 ∈ 𝐴 → suc ∪ 𝐴 ⊆ ∪ 𝑥 ∈ 𝐴 suc 𝑥) |
| 4 | 1, 3 | syl 17 | . 2 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → suc ∪ 𝐴 ⊆ ∪ 𝑥 ∈ 𝐴 suc 𝑥) |
| 5 | ssorduni 7722 | . . . . . 6 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴) | |
| 6 | ordsuci 7751 | . . . . . 6 ⊢ (Ord ∪ 𝐴 → Ord suc ∪ 𝐴) | |
| 7 | 5, 6 | syl 17 | . . . . 5 ⊢ (𝐴 ⊆ On → Ord suc ∪ 𝐴) |
| 8 | onsucuni 7768 | . . . . . 6 ⊢ (𝐴 ⊆ On → 𝐴 ⊆ suc ∪ 𝐴) | |
| 9 | 8 | sselda 3931 | . . . . 5 ⊢ ((𝐴 ⊆ On ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ suc ∪ 𝐴) |
| 10 | ordsucss 7758 | . . . . . 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 5004 | . . 3 ⊢ (𝐴 ⊆ On → ∪ 𝑥 ∈ 𝐴 suc 𝑥 ⊆ suc ∪ 𝐴) |
| 14 | 13 | 3ad2ant1 1133 | . 2 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∪ 𝑥 ∈ 𝐴 suc 𝑥 ⊆ suc ∪ 𝐴) |
| 15 | 4, 14 | eqssd 3949 | 1 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → suc ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 suc 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ⊆ wss 3899 ∅c0 4283 ∪ cuni 4861 ∪ ciun 4944 Ord word 6314 Oncon0 6315 suc csuc 6317 Fincfn 8881 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-om 7807 df-en 8882 df-fin 8885 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |