| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > iunon | GIF version | ||
| Description: The indexed union of a set of ordinal numbers 𝐵(𝑥) is an ordinal number. (Contributed by NM, 13-Oct-2003.) (Revised by Mario Carneiro, 5-Dec-2016.) |
| Ref | Expression |
|---|---|
| iunon | ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ On) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ On) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfiun3g 4989 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) | |
| 2 | 1 | adantl 277 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ On) → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) |
| 3 | mptexg 5878 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) | |
| 4 | rnexg 4997 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) | |
| 5 | 3, 4 | syl 14 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) |
| 6 | eqid 2231 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 7 | 6 | fmpt 5797 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On ↔ (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶On) |
| 8 | frn 5491 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶On → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On) | |
| 9 | 7, 8 | sylbi 121 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On) |
| 10 | ssonuni 4586 | . . . 4 ⊢ (ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V → (ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On)) | |
| 11 | 10 | imp 124 | . . 3 ⊢ ((ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On) → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On) |
| 12 | 5, 9, 11 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ On) → ∪ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On) |
| 13 | 2, 12 | eqeltrd 2308 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ On) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ On) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 ∀wral 2510 Vcvv 2802 ⊆ wss 3200 ∪ cuni 3893 ∪ ciun 3970 ↦ cmpt 4150 Oncon0 4460 ran crn 4726 ⟶wf 5322 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 |
| This theorem is referenced by: rdgon 6551 |
| Copyright terms: Public domain | W3C validator |