| 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 23102 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐽 ∈ Top ↔ (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) ∧ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝐽 (𝑥 ∩ 𝑦) ∈ 𝐽))) | |
| 2 | 1 | ibi 270 | . . . 4 ⊢ (𝐽 ∈ Top → (∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) ∧ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ 𝐽 (𝑥 ∩ 𝑦) ∈ 𝐽)) |
| 3 | 2 | simpld 500 | . . 3 ⊢ (𝐽 ∈ Top → ∀𝑥(𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽)) |
| 4 | elpw2g 5306 | . . . . . . . 8 ⊢ (𝐽 ∈ Top → (𝐴 ∈ 𝒫 𝐽 ↔ 𝐴 ⊆ 𝐽)) | |
| 5 | 4 | biimpar 483 | . . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝐽) → 𝐴 ∈ 𝒫 𝐽) |
| 6 | sseq1 3963 | . . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝐽 ↔ 𝐴 ⊆ 𝐽)) | |
| 7 | unieq 4885 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → ∪ 𝑥 = ∪ 𝐴) | |
| 8 | 7 | eleq1d 2850 | . . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (∪ 𝑥 ∈ 𝐽 ↔ ∪ 𝐴 ∈ 𝐽)) |
| 9 | 6, 8 | imbi12d 347 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ 𝐽 → ∪ 𝑥 ∈ 𝐽) ↔ (𝐴 ⊆ 𝐽 → ∪ 𝐴 ∈ 𝐽))) |
| 10 | 9 | spcgv 3557 | . . . . . . 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 2146 ∀wral 3081 ∩ cin 3905 ⊆ wss 3906 𝒫 cpw 4564 ∪ cuni 4874 Topctop 23100 |
| 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-ext 2737 ax-sep 5259 |
| 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 2744 df-cleq 2757 df-clel 2840 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-top 23101 |
| This theorem is used by: iunopn 23105 unopn 23110 0opn 23111 topopn 23113 tgtop 23180 ntropn 23256 toponmre 23300 neips 23320 txcmplem1 23849 unimopn 24704 metrest 24732 cnopn 24994 locfinreflem 34294 cvmscld 35802 mblfinlem3 38367 mblfinlem4 38368 ismblfin 38369 topclat 49833 toplatlub 49835 |
| Copyright terms: Public domain | W3C validator |