| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uniopn | Structured version Visualization version GIF version | ||
| Description: The union of a subset of a topology (that is, the union of any family of open sets of a topology) is an open set. (Contributed by Stefan Allan, 27-Feb-2006.) |
| Ref | Expression |
|---|---|
| uniopn | ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝐽) → ∪ 𝐴 ∈ 𝐽) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | istopg 23120 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐽 ∈ Top ↔ (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) ∧ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝐽 (𝑥 ∩ 𝑦) ∈ 𝐽))) | |
| 2 | 1 | ibi 270 | . . . 4 ⊢ (𝐽 ∈ Top → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) ∧ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝐽 (𝑥 ∩ 𝑦) ∈ 𝐽)) |
| 3 | 2 | simpld 500 | . . 3 ⊢ (𝐽 ∈ Top → ∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽)) |
| 4 | elpw2g 5298 | . . . . . . . 8 ⊢ (𝐽 ∈ Top → (𝐴 ∈ 𝒫 𝐽 ↔ 𝐴 ⊆ 𝐽)) | |
| 5 | 4 | biimpar 483 | . . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝐽) → 𝐴 ∈ 𝒫 𝐽) |
| 6 | sseq1 3956 | . . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝐽 ↔ 𝐴 ⊆ 𝐽)) | |
| 7 | unieq 4878 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → ∪ 𝑥 = ∪ 𝐴) | |
| 8 | 7 | eleq1d 2845 | . . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (∪ 𝑥 ∈ 𝐽 ↔ ∪ 𝐴 ∈ 𝐽)) |
| 9 | 6, 8 | imbi12d 347 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) ↔ (𝐴 ⊆ 𝐽 → ∪ 𝐴 ∈ 𝐽))) |
| 10 | 9 | spcgv 3550 | . . . . . . 7 ⊢ (𝐴 ∈ 𝒫 𝐽 → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) → (𝐴 ⊆ 𝐽 → ∪ 𝐴 ∈ 𝐽))) |
| 11 | 5, 10 | syl 18 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝐽) → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) → (𝐴 ⊆ 𝐽 → ∪ 𝐴 ∈ 𝐽))) |
| 12 | 11 | com23 87 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝐽) → (𝐴 ⊆ 𝐽 → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) → ∪ 𝐴 ∈ 𝐽))) |
| 13 | 12 | ex 418 | . . . 4 ⊢ (𝐽 ∈ Top → (𝐴 ⊆ 𝐽 → (𝐴 ⊆ 𝐽 → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) → ∪ 𝐴 ∈ 𝐽)))) |
| 14 | 13 | pm2.43d 54 | . . 3 ⊢ (𝐽 ∈ Top → (𝐴 ⊆ 𝐽 → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) → ∪ 𝐴 ∈ 𝐽))) |
| 15 | 3, 14 | mpid 45 | . 2 ⊢ (𝐽 ∈ Top → (𝐴 ⊆ 𝐽 → ∪ 𝐴 ∈ 𝐽)) |
| 16 | 15 | imp 412 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝐽) → ∪ 𝐴 ∈ 𝐽) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∀wal 1568 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ∩ cin 3898 ⊆ wss 3899 𝒫 cpw 4557 ∪ cuni 4867 Topctop 23118 |
| 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 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 |
| This proof depends on definitions: df-bi 210 df-an 402 df-3an 1105 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-in 3906 df-ss 3916 df-pw 4559 df-uni 4868 df-top 23119 |
| This theorem is used by: iunopn 23123 unopn 23128 0opn 23129 topopn 23131 tgtop 23198 ntropn 23274 toponmre 23318 neips 23338 txcmplem1 23867 unimopn 24722 metrest 24750 cnopn 25012 locfinreflem 34350 cvmscld 35852 mblfinlem3 38408 mblfinlem4 38409 ismblfin 38410 topclat 49924 toplatlub 49926 |
| Copyright terms: Public domain | W3C validator |