| 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 2763 | . . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 2 | eqid 2763 | . . . . . 6 ⊢ ∪ 𝐾 = ∪ 𝐾 | |
| 3 | 1, 2 | cnf 23403 | . . . . 5 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾) |
| 4 | 3 | adantr 485 | . . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → 𝐹:∪ 𝐽⟶∪ 𝐾) |
| 5 | ffun 6708 | . . . . . 6 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → Fun 𝐹) | |
| 6 | funcnvcnv 6603 | . . . . . 6 ⊢ (Fun 𝐹 → Fun ◡◡𝐹) | |
| 7 | imadif 6620 | . . . . . 6 ⊢ (Fun ◡◡𝐹 → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) = ((◡𝐹 “ ∪ 𝐾) ∖ (◡𝐹 “ 𝐴))) | |
| 8 | 5, 6, 7 | 3syl 19 | . . . . 5 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) = ((◡𝐹 “ ∪ 𝐾) ∖ (◡𝐹 “ 𝐴))) |
| 9 | fimacnv 6728 | . . . . . 6 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → (◡𝐹 “ ∪ 𝐾) = ∪ 𝐽) | |
| 10 | 9 | difeq1d 4080 | . . . . 5 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → ((◡𝐹 “ ∪ 𝐾) ∖ (◡𝐹 “ 𝐴)) = (∪ 𝐽 ∖ (◡𝐹 “ 𝐴))) |
| 11 | 8, 10 | eqtr2d 2799 | . . . 4 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) = (◡𝐹 “ (∪ 𝐾 ∖ 𝐴))) |
| 12 | 4, 11 | syl 18 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) = (◡𝐹 “ (∪ 𝐾 ∖ 𝐴))) |
| 13 | 2 | cldopn 23188 | . . . 4 ⊢ (𝐴 ∈ (Clsd‘𝐾) → (∪ 𝐾 ∖ 𝐴) ∈ 𝐾) |
| 14 | cnima 23422 | . . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (∪ 𝐾 ∖ 𝐴) ∈ 𝐾) → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) ∈ 𝐽) | |
| 15 | 13, 14 | sylan2 604 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) ∈ 𝐽) |
| 16 | 12, 15 | eqeltrd 2863 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽) |
| 17 | cntop1 23397 | . . 3 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top) | |
| 18 | cnvimass 6084 | . . . 4 ⊢ (◡𝐹 “ 𝐴) ⊆ dom 𝐹 | |
| 19 | 18, 4 | fssdm 6725 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ 𝐴) ⊆ ∪ 𝐽) |
| 20 | 1 | iscld2 23185 | . . 3 ⊢ ((𝐽 ∈ Top ∧ (◡𝐹 “ 𝐴) ⊆ ∪ 𝐽) → ((◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽) ↔ (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽)) |
| 21 | 17, 19, 20 | syl2an2r 697 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → ((◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽) ↔ (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽)) |
| 22 | 16, 21 | mpbird 260 | 1 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∖ cdif 3902 ⊆ wss 3905 ∪ cuni 4872 ◡ccnv 5660 “ cima 5664 Fun wfun 6530 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 Topctop 23050 Clsdccld 23173 Cn ccn 23381 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-map 8822 df-top 23051 df-topon 23068 df-cld 23176 df-cn 23384 |
| This theorem is referenced by: iscncl 23426 cncls2i 23427 paste 23451 cnt1 23507 dnsconst 23535 cnconn 23579 hauseqlcld 23803 txconn 23846 imasncld 23848 r0cld 23895 kqreglem2 23899 kqnrmlem1 23900 kqnrmlem2 23901 hmeocld 23924 nrmhmph 23951 tgphaus 24274 csscld 25408 clsocv 25409 hmeoclda 36864 hmeocldb 36865 rfcnpre3 45773 rfcnpre4 45774 sepfsepc 49726 seppcld 49728 |
| Copyright terms: Public domain | W3C validator |