| 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 4987 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) | |
| 2 | 1 | adantl 481 | . 2 ⊢ ((𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) |
| 3 | uniiunlem 4041 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 ↔ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ⊆ 𝐽)) | |
| 4 | 3 | ibi 267 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ⊆ 𝐽) |
| 5 | uniopn 22853 | . . 3 ⊢ ((𝐽 ∈ Top ∧ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ⊆ 𝐽) → ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ 𝐽) | |
| 6 | 4, 5 | sylan2 594 | . 2 ⊢ ((𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ 𝐽) |
| 7 | 2, 6 | eqeltrd 2837 | 1 ⊢ ((𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {cab 2715 ∀wral 3052 ∃wrex 3062 ⊆ wss 3903 ∪ cuni 4865 ∪ ciun 4948 Topctop 22849 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-in 3910 df-ss 3920 df-pw 4558 df-uni 4866 df-iun 4950 df-top 22850 |
| This theorem is referenced by: iincld 22995 tgcn 23208 kgentopon 23494 xkococnlem 23615 qtoptop2 23655 zcld 24770 metnrmlem2 24817 cnambfre 37919 |
| Copyright terms: Public domain | W3C validator |