| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iunopn | Structured version Visualization version GIF version | ||
| Description: The indexed union of a subset of a topology is an open set. (Contributed by NM, 5-Oct-2006.) |
| Ref | Expression |
|---|---|
| iunopn | ⊢ ((𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfiun2g 4990 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) | |
| 2 | 1 | adantl 487 | . 2 ⊢ ((𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) |
| 3 | uniiunlem 4014 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 ↔ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ⊆ 𝐽)) | |
| 4 | 3 | ibi 270 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ⊆ 𝐽) |
| 5 | uniopn 23227 | . . 3 ⊢ ((𝐽 ∈ Top ∧ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ⊆ 𝐽) → ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ 𝐽) | |
| 6 | 4, 5 | sylan2 605 | . 2 ⊢ ((𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ 𝐽) |
| 7 | 2, 6 | eqeltrd 2863 | 1 ⊢ ((𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 {cab 2741 ∀wral 3079 ∃wrex 3089 ⊆ wss 3899 ∪ cuni 4869 ∪ ciun 4953 Topctop 23223 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-ex 1812 df-nf 1816 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-ss 3900 df-in 4093 df-pw 4561 df-uni 4870 df-iun 4955 df-top 23224 |
| This theorem is used by: iincld 23369 tgcn 23582 kgentopon 23869 xkococnlem 23990 qtoptop2 24030 zcld 25145 metnrmlem2 25192 cnambfre 38726 |
| Copyright terms: Public domain | W3C validator |