| 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 4996 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) | |
| 2 | 1 | adantl 487 | . 2 ⊢ ((𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) |
| 3 | uniiunlem 4042 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 ↔ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ⊆ 𝐽)) | |
| 4 | 3 | ibi 270 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ⊆ 𝐽) |
| 5 | uniopn 23106 | . . 3 ⊢ ((𝐽 ∈ Top ∧ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ⊆ 𝐽) → ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ 𝐽) | |
| 6 | 4, 5 | sylan2 605 | . 2 ⊢ ((𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ 𝐽) |
| 7 | 2, 6 | eqeltrd 2865 | 1 ⊢ ((𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 {cab 2743 ∀wral 3081 ∃wrex 3091 ⊆ wss 3906 ∪ cuni 4874 ∪ ciun 4958 Topctop 23102 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-in 3913 df-ss 3923 df-pw 4566 df-uni 4875 df-iun 4960 df-top 23103 |
| This theorem is used by: iincld 23248 tgcn 23461 kgentopon 23748 xkococnlem 23869 qtoptop2 23909 zcld 25024 metnrmlem2 25071 cnambfre 38378 |
| Copyright terms: Public domain | W3C validator |