ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnclima GIF version

Theorem cnclima 15415
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.)
Assertion
Ref Expression
cnclima ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽))

Proof of Theorem cnclima
StepHypRef Expression
1 eqid 2238 . . . . . 6 ∪ 𝐽 = ∪ 𝐽
2 eqid 2238 . . . . . 6 ∪ 𝐾 = ∪ 𝐾
31, 2cnf 15396 . . . . 5 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾)
43adantr 276 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → 𝐹:∪ 𝐽⟶∪ 𝐾)
5 ffun 5536 . . . . . 6 (𝐹:∪ 𝐽⟶∪ 𝐾 → Fun 𝐹)
6 funcnvcnv 5440 . . . . . 6 (Fun 𝐹 → Fun ◡◡𝐹)
7 imadif 5461 . . . . . 6 (Fun ◡◡𝐹 → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) = ((◡𝐹 “ ∪ 𝐾) ∖ (◡𝐹 “ 𝐴)))
85, 6, 73syl 17 . . . . 5 (𝐹:∪ 𝐽⟶∪ 𝐾 → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) = ((◡𝐹 “ ∪ 𝐾) ∖ (◡𝐹 “ 𝐴)))
9 fimacnv 5837 . . . . . 6 (𝐹:∪ 𝐽⟶∪ 𝐾 → (◡𝐹 “ ∪ 𝐾) = ∪ 𝐽)
109difeq1d 3346 . . . . 5 (𝐹:∪ 𝐽⟶∪ 𝐾 → ((◡𝐹 “ ∪ 𝐾) ∖ (◡𝐹 “ 𝐴)) = (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)))
118, 10eqtr2d 2272 . . . 4 (𝐹:∪ 𝐽⟶∪ 𝐾 → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) = (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)))
124, 11syl 14 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) = (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)))
132cldopn 15299 . . . 4 (𝐴 ∈ (Clsd‘𝐾) → (∪ 𝐾 ∖ 𝐴) ∈ 𝐾)
14 cnima 15412 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (∪ 𝐾 ∖ 𝐴) ∈ 𝐾) → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) ∈ 𝐽)
1513, 14sylan2 286 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ (∪ 𝐾 ∖ 𝐴)) ∈ 𝐽)
1612, 15eqeltrd 2315 . 2 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽)
17 cntop1 15393 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
1817adantr 276 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → 𝐽 ∈ Top)
19 cnvimass 5150 . . . 4 (◡𝐹 “ 𝐴) ⊆ dom 𝐹
2019, 4fssdm 5549 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ 𝐴) ⊆ ∪ 𝐽)
211iscld2 15296 . . 3 ((𝐽 ∈ Top ∧ (◡𝐹 “ 𝐴) ⊆ ∪ 𝐽) → ((◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽) ↔ (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽))
2218, 20, 21syl2anc 415 . 2 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → ((◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽) ↔ (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽))
2316, 22mpbird 167 1 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐴 ∈ (Clsd‘𝐾)) → (◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209   ∖ cdif 3217   ⊆ wss 3220  ∪ cuni 3935  ◡ccnv 4773   “ cima 4777  Fun wfun 5371  ⟶wf 5373  ‘cfv 5377  (class class class)co 6085  Topctop 15189  Clsdccld 15284   Cn ccn 15377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-top 15190  df-topon 15203  df-cld 15287  df-cn 15380
This theorem is used by:  hmeocld  15504
  Copyright terms: Public domain W3C validator