| 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 4849 | . . . 4 ⊢ (𝑆 = ∅ → ∪ 𝑆 = ∪ ∅) | |
| 2 | uni0 4866 | . . . . 5 ⊢ ∪ ∅ = ∅ | |
| 3 | peano1 7829 | . . . . 5 ⊢ ∅ ∈ ω | |
| 4 | 2, 3 | eqeltri 2835 | . . . 4 ⊢ ∪ ∅ ∈ ω |
| 5 | 1, 4 | eqeltrdi 2847 | . . 3 ⊢ (𝑆 = ∅ → ∪ 𝑆 ∈ ω) |
| 6 | 5 | adantl 482 | . 2 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 = ∅) → ∪ 𝑆 ∈ ω) |
| 7 | simpll 772 | . . 3 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → 𝑆 ⊆ ω) | |
| 8 | omsson 7810 | . . . . 5 ⊢ ω ⊆ On | |
| 9 | 7, 8 | sstrdi 3927 | . . . 4 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → 𝑆 ⊆ On) |
| 10 | simplr 774 | . . . 4 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → 𝑆 ∈ Fin) | |
| 11 | simpr 485 | . . . 4 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → 𝑆 ≠ ∅) | |
| 12 | ordunifi 9190 | . . . 4 ⊢ ((𝑆 ⊆ On ∧ 𝑆 ∈ Fin ∧ 𝑆 ≠ ∅) → ∪ 𝑆 ∈ 𝑆) | |
| 13 | 9, 10, 11, 12 | syl3anc 1379 | . . 3 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → ∪ 𝑆 ∈ 𝑆) |
| 14 | 7, 13 | sseldd 3916 | . 2 ⊢ (((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) ∧ 𝑆 ≠ ∅) → ∪ 𝑆 ∈ ω) |
| 15 | 6, 14 | pm2.61dane 3021 | 1 ⊢ ((𝑆 ⊆ ω ∧ 𝑆 ∈ Fin) → ∪ 𝑆 ∈ ω) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ≠ wne 2934 ⊆ wss 3883 ∅c0 4261 ∪ cuni 4838 Oncon0 6310 ωcom 7806 Fincfn 8883 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-om 7807 df-en 8884 df-fin 8887 |
| This theorem is referenced by: ackbij1lem16 10147 isf32lem5 10270 fineqvnttrclselem1 35302 finxpreclem4 37756 |
| Copyright terms: Public domain | W3C validator |