| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nnunifi | Structured version Visualization version GIF version | ||
| Description: The union (supremum) of a finite set of finite ordinals is a finite ordinal. (Contributed by Stefan O'Rear, 5-Nov-2014.) |
| Ref | Expression |
|---|---|
| nnunifi | ⊢ ((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) → ∪ 𝑆 ∈ ω) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unieq 4887 | . . . 4 ⊢ (𝑆 = ∅ → ∪ 𝑆 = ∪ ∅) | |
| 2 | uni0 4905 | . . . . 5 ⊢ ∪ ∅ = ∅ | |
| 3 | peano1 7885 | . . . . 5 ⊢ ∅ ∈ ω | |
| 4 | 2, 3 | eqeltri 2865 | . . . 4 ⊢ ∪ ∅ ∈ ω |
| 5 | 1, 4 | eqeltrdi 2877 | . . 3 ⊢ (𝑆 = ∅ → ∪ 𝑆 ∈ ω) |
| 6 | 5 | adantl 486 | . 2 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 = ∅) → ∪ 𝑆 ∈ ω) |
| 7 | simpll 778 | . . 3 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → 𝑆 ⊆ ω) | |
| 8 | omsson 7866 | . . . . 5 ⊢ ω ⊆ On | |
| 9 | 7, 8 | sstrdi 3957 | . . . 4 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → 𝑆 ⊆ On) |
| 10 | simplr 780 | . . . 4 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → 𝑆 ∈ Fin) | |
| 11 | simpr 489 | . . . 4 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → 𝑆 ≠ ∅) | |
| 12 | ordunifi 9250 | . . . 4 ⊢ ((𝑆 ⊆ On ∧ 𝑆 ∈ Fin ∧ 𝑆 ≠ ∅) → ∪ 𝑆 ∈ 𝑆) | |
| 13 | 9, 10, 11, 12 | syl3anc 1396 | . . 3 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → ∪ 𝑆 ∈ 𝑆) |
| 14 | 7, 13 | sseldd 3946 | . 2 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → ∪ 𝑆 ∈ ω) |
| 15 | 6, 14 | pm2.61dane 3051 | 1 ⊢ ((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) → ∪ 𝑆 ∈ ω) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ⊆ wss 3913 ∅c0 4294 ∪ cuni 4876 Oncon0 6361 ωcom 7862 Fincfn 8943 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-om 7863 df-en 8944 df-fin 8947 |
| This theorem is referenced by: ackbij1lem16 10217 isf32lem5 10341 fineqvnttrclselem1 35457 finxpreclem4 37928 |
| Copyright terms: Public domain | W3C validator |