| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hmeocld | Structured version Visualization version GIF version | ||
| Description: Homeomorphisms preserve closedness. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 25-Aug-2015.) |
| Ref | Expression |
|---|---|
| hmeoopn.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| hmeocld | ⊢ ((𝐹 ∈ (𝐽Homeo𝐾) ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∈ (Clsd‘𝐽) ↔ (𝐹 “ 𝐴) ∈ (Clsd‘𝐾))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hmeocnvcn 23988 | . . . 4 ⊢ (𝐹 ∈ (𝐽Homeo𝐾) → ◡𝐹 ∈ (𝐾 Cn 𝐽)) | |
| 2 | 1 | adantr 486 | . . 3 ⊢ ((𝐹 ∈ (𝐽Homeo𝐾) ∧ 𝐴 ⊆ 𝑋) → ◡𝐹 ∈ (𝐾 Cn 𝐽)) |
| 3 | imacnvcnv 6202 | . . . . 5 ⊢ (◡◡𝐹 “ 𝐴) = (𝐹 “ 𝐴) | |
| 4 | cnclima 23494 | . . . . 5 ⊢ ((◡𝐹 ∈ (𝐾 Cn 𝐽) ∧ 𝐴 ∈ (Clsd‘𝐽)) → (◡◡𝐹 “ 𝐴) ∈ (Clsd‘𝐾)) | |
| 5 | 3, 4 | eqeltrrid 2865 | . . . 4 ⊢ ((◡𝐹 ∈ (𝐾 Cn 𝐽) ∧ 𝐴 ∈ (Clsd‘𝐽)) → (𝐹 “ 𝐴) ∈ (Clsd‘𝐾)) |
| 6 | 5 | ex 418 | . . 3 ⊢ (◡𝐹 ∈ (𝐾 Cn 𝐽) → (𝐴 ∈ (Clsd‘𝐽) → (𝐹 “ 𝐴) ∈ (Clsd‘𝐾))) |
| 7 | 2, 6 | syl 18 | . 2 ⊢ ((𝐹 ∈ (𝐽Homeo𝐾) ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∈ (Clsd‘𝐽) → (𝐹 “ 𝐴) ∈ (Clsd‘𝐾))) |
| 8 | hmeocn 23987 | . . . . 5 ⊢ (𝐹 ∈ (𝐽Homeo𝐾) → 𝐹 ∈ (𝐽 Cn 𝐾)) | |
| 9 | 8 | adantr 486 | . . . 4 ⊢ ((𝐹 ∈ (𝐽Homeo𝐾) ∧ 𝐴 ⊆ 𝑋) → 𝐹 ∈ (𝐽 Cn 𝐾)) |
| 10 | cnclima 23494 | . . . . 5 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (𝐹 “ 𝐴) ∈ (Clsd‘𝐾)) → (◡𝐹 “ (𝐹 “ 𝐴)) ∈ (Clsd‘𝐽)) | |
| 11 | 10 | ex 418 | . . . 4 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → ((𝐹 “ 𝐴) ∈ (Clsd‘𝐾) → (◡𝐹 “ (𝐹 “ 𝐴)) ∈ (Clsd‘𝐽))) |
| 12 | 9, 11 | syl 18 | . . 3 ⊢ ((𝐹 ∈ (𝐽Homeo𝐾) ∧ 𝐴 ⊆ 𝑋) → ((𝐹 “ 𝐴) ∈ (Clsd‘𝐾) → (◡𝐹 “ (𝐹 “ 𝐴)) ∈ (Clsd‘𝐽))) |
| 13 | hmeoopn.1 | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
| 14 | eqid 2760 | . . . . . . 7 ⊢ ∪ 𝐾 = ∪ 𝐾 | |
| 15 | 13, 14 | hmeof1o 23991 | . . . . . 6 ⊢ (𝐹 ∈ (𝐽Homeo𝐾) → 𝐹:𝑋–1-1-onto→∪ 𝐾) |
| 16 | f1of1 6817 | . . . . . 6 ⊢ (𝐹:𝑋–1-1-onto→∪ 𝐾 → 𝐹:𝑋–1-1→∪ 𝐾) | |
| 17 | 15, 16 | syl 18 | . . . . 5 ⊢ (𝐹 ∈ (𝐽Homeo𝐾) → 𝐹:𝑋–1-1→∪ 𝐾) |
| 18 | f1imacnv 6835 | . . . . 5 ⊢ ((𝐹:𝑋–1-1→∪ 𝐾 ∧ 𝐴 ⊆ 𝑋) → (◡𝐹 “ (𝐹 “ 𝐴)) = 𝐴) | |
| 19 | 17, 18 | sylan 592 | . . . 4 ⊢ ((𝐹 ∈ (𝐽Homeo𝐾) ∧ 𝐴 ⊆ 𝑋) → (◡𝐹 “ (𝐹 “ 𝐴)) = 𝐴) |
| 20 | 19 | eleq1d 2845 | . . 3 ⊢ ((𝐹 ∈ (𝐽Homeo𝐾) ∧ 𝐴 ⊆ 𝑋) → ((◡𝐹 “ (𝐹 “ 𝐴)) ∈ (Clsd‘𝐽) ↔ 𝐴 ∈ (Clsd‘𝐽))) |
| 21 | 12, 20 | sylibd 242 | . 2 ⊢ ((𝐹 ∈ (𝐽Homeo𝐾) ∧ 𝐴 ⊆ 𝑋) → ((𝐹 “ 𝐴) ∈ (Clsd‘𝐾) → 𝐴 ∈ (Clsd‘𝐽))) |
| 22 | 7, 21 | impbid 215 | 1 ⊢ ((𝐹 ∈ (𝐽Homeo𝐾) ∧ 𝐴 ⊆ 𝑋) → (𝐴 ∈ (Clsd‘𝐽) ↔ (𝐹 “ 𝐴) ∈ (Clsd‘𝐾))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ∪ cuni 4867 ◡ccnv 5654 “ cima 5658 –1-1→wf1 6530 –1-1-onto→wf1o 6532 ‘cfv 6533 (class class class)co 7414 Clsdccld 23242 Cn ccn 23450 Homeochmeo 23980 |
| 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-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7417 df-oprab 7418 df-mpo 7419 df-map 8829 df-top 23120 df-topon 23137 df-cld 23245 df-cn 23453 df-hmeo 23982 |
| This theorem is used by: cldsubg 24338 reheibor 38590 |
| Copyright terms: Public domain | W3C validator |