| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnclima | Structured version Visualization version GIF version | ||
| Description: A closed subset of the codomain of a continuous function has a closed preimage. (Contributed by NM, 15-Mar-2007.) (Revised by Mario Carneiro, 21-Aug-2015.) |
| Ref | Expression |
|---|---|
| cnclima | ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2761 | . . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 2 | eqid 2761 | . . . . . 6 ⊢ ∪ 𝐾 = ∪ 𝐾 | |
| 3 | 1, 2 | cnf 23564 | . . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾) |
| 4 | 3 | adantr 486 | . . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → 𝐹:∪ 𝐽⟶∪ 𝐾) |
| 5 | ffun 6712 | . . . . . 6 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → Fun 𝐹) | |
| 6 | funcnvcnv 6607 | . . . . . 6 ⊢ (Fun 𝐹 → Fun ◡◡𝐹) | |
| 7 | imadif 6624 | . . . . . 6 ⊢ (Fun ◡◡𝐹 → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) = ((◡𝐹 “ ∪ 𝐾) ∖ (◡𝐹 “ 𝐴))) | |
| 8 | 5, 6, 7 | 3syl 19 | . . . . 5 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) = ((◡𝐹 “ ∪ 𝐾) ∖ (◡𝐹 “ 𝐴))) |
| 9 | fimacnv 6732 | . . . . . 6 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → (◡𝐹 “ ∪ 𝐾) = ∪ 𝐽) | |
| 10 | 9 | difeq1d 4073 | . . . . 5 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → ((◡𝐹 “ ∪ 𝐾) ∖ (◡𝐹 “ 𝐴)) = (∪ 𝐽 ∖ (◡𝐹 “ 𝐴))) |
| 11 | 8, 10 | eqtr2d 2797 | . . . 4 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) = (◡𝐹 “ (∪ 𝐾 ∖ 𝐴))) |
| 12 | 4, 11 | syl 18 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) = (◡𝐹 “ (∪ 𝐾 ∖ 𝐴))) |
| 13 | 2 | cldopn 23349 | . . . 4 ⊢ (𝐴 ∈ (Clsd‘𝐾) → (∪ 𝐾 ∖ 𝐴) ∈ 𝐾) |
| 14 | cnima 23583 | . . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (∪ 𝐾 ∖ 𝐴) ∈ 𝐾) → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) ∈ 𝐽) | |
| 15 | 13, 14 | sylan2 605 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) ∈ 𝐽) |
| 16 | 12, 15 | eqeltrd 2861 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽) |
| 17 | cntop1 23558 | . . 3 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top) | |
| 18 | cnvimass 6198 | . . . 4 ⊢ (◡𝐹 “ 𝐴) ⊆ dom 𝐹 | |
| 19 | 18, 4 | fssdm 6729 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ 𝐴) ⊆ ∪ 𝐽) |
| 20 | 1 | iscld2 23346 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (◡𝐹 “ 𝐴) ⊆ ∪ 𝐽) → ((◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽) ↔ (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽)) |
| 21 | 17, 19, 20 | syl2an2r 698 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → ((◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽) ↔ (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽)) |
| 22 | 16, 21 | mpbird 260 | 1 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∖ cdif 3896 ⊆ wss 3899 ∪ cuni 4867 ◡ccnv 5650 “ cima 5654 Fun wfun 6532 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 Topctop 23211 Clsdccld 23334 Cn ccn 23542 |
| 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 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 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 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-map 8849 df-top 23212 df-topon 23229 df-cld 23337 df-cn 23545 |
| This theorem is used by: iscncl 23587 cncls2i 23588 paste 23612 cnt1 23668 dnsconst 23696 cnconn 23740 hauseqlcld 23965 txconn 24008 imasncld 24010 r0cld 24057 kqreglem2 24061 kqnrmlem1 24062 kqnrmlem2 24063 hmeocld 24086 nrmhmph 24113 tgphaus 24436 csscld 25570 clsocv 25571 hmeoclda 37121 hmeocldb 37122 rfcnpre3 46049 rfcnpre4 46050 sepfsepc 50035 seppcld 50037 |
| Copyright terms: Public domain | W3C validator |