| 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 2765 | . . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 2 | eqid 2765 | . . . . . 6 ⊢ ∪ 𝐾 = ∪ 𝐾 | |
| 3 | 1, 2 | cnf 23455 | . . . . 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 4080 | . . . . 5 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → ((◡𝐹 “ ∪ 𝐾) ∖ (◡𝐹 “ 𝐴)) = (∪ 𝐽 ∖ (◡𝐹 “ 𝐴))) |
| 11 | 8, 10 | eqtr2d 2801 | . . . 4 ⊢ (𝐹:∪ 𝐽⟶∪ 𝐾 → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) = (◡𝐹 “ (∪ 𝐾 ∖ 𝐴))) |
| 12 | 4, 11 | syl 18 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) = (◡𝐹 “ (∪ 𝐾 ∖ 𝐴))) |
| 13 | 2 | cldopn 23240 | . . . 4 ⊢ (𝐴 ∈ (Clsd‘𝐾) → (∪ 𝐾 ∖ 𝐴) ∈ 𝐾) |
| 14 | cnima 23474 | . . . 4 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (∪ 𝐾 ∖ 𝐴) ∈ 𝐾) → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) ∈ 𝐽) | |
| 15 | 13, 14 | sylan2 605 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) ∈ 𝐽) |
| 16 | 12, 15 | eqeltrd 2865 | . 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽) |
| 17 | cntop1 23449 | . . 3 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top) | |
| 18 | cnvimass 6086 | . . . 4 ⊢ (◡𝐹 “ 𝐴) ⊆ dom 𝐹 | |
| 19 | 18, 4 | fssdm 6729 | . . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ 𝐴) ⊆ ∪ 𝐽) |
| 20 | 1 | iscld2 23237 | . . 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 2146 ∖ cdif 3903 ⊆ wss 3906 ∪ cuni 4874 ◡ccnv 5662 “ cima 5666 Fun wfun 6534 ⟶wf 6536 ‘cfv 6540 (class class class)co 7419 Topctop 23102 Clsdccld 23225 Cn ccn 23433 |
| 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-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-map 8832 df-top 23103 df-topon 23120 df-cld 23228 df-cn 23436 |
| This theorem is used by: iscncl 23478 cncls2i 23479 paste 23503 cnt1 23559 dnsconst 23587 cnconn 23631 hauseqlcld 23856 txconn 23899 imasncld 23901 r0cld 23948 kqreglem2 23952 kqnrmlem1 23953 kqnrmlem2 23954 hmeocld 23977 nrmhmph 24004 tgphaus 24327 csscld 25461 clsocv 25462 hmeoclda 36903 hmeocldb 36904 rfcnpre3 45813 rfcnpre4 45814 sepfsepc 49765 seppcld 49767 |
| Copyright terms: Public domain | W3C validator |