| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssonuni | Structured version Visualization version GIF version | ||
| Description: The union of a set of ordinal numbers is an ordinal number. Theorem 9 of [Suppes] p. 132. Lemma 2.7 of [Schloeder] p. 4. (Contributed by NM, 1-Nov-2003.) |
| Ref | Expression |
|---|---|
| ssonuni | ⊢ (𝐴 ∈ 𝑉 → (𝐴 ⊆ On → ∪ 𝐴 ∈ On)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssorduni 7758 | . 2 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴) | |
| 2 | uniexg 7719 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝐴 ∈ V) | |
| 3 | elong 6343 | . . 3 ⊢ (∪ 𝐴 ∈ V → (∪ 𝐴 ∈ On ↔ Ord ∪ 𝐴)) | |
| 4 | 2, 3 | syl 17 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∪ 𝐴 ∈ On ↔ Ord ∪ 𝐴)) |
| 5 | 1, 4 | imbitrrid 246 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ⊆ On → ∪ 𝐴 ∈ On)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2109 Vcvv 3450 ⊆ wss 3917 ∪ cuni 4874 Ord word 6334 Oncon0 6335 |
| 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-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-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 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-br 5111 df-opab 5173 df-tr 5218 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-ord 6338 df-on 6339 |
| This theorem is referenced by: ssonunii 7760 onuni 7767 iunon 8311 onfununi 8313 oemapvali 9644 cardprclem 9939 carduni 9941 dfac12lem2 10105 ontgval 36426 onsupcl2 43221 onuniintrab 43222 onsupuni 43225 onsupcl3 43229 cantnfub2 43318 |
| Copyright terms: Public domain | W3C validator |