MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnclsi Structured version   Visualization version   GIF version

Theorem cnclsi 23214
Description: Property of the image of a closure. (Contributed by Mario Carneiro, 25-Aug-2015.)
Hypothesis
Ref Expression
cnclsi.1 𝑋 = 𝐽
Assertion
Ref Expression
cnclsi ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → (𝐹 “ ((cls‘𝐽)‘𝑆)) ⊆ ((cls‘𝐾)‘(𝐹𝑆)))

Proof of Theorem cnclsi
StepHypRef Expression
1 cntop1 23182 . . . . 5 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
21adantr 480 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝐽 ∈ Top)
3 cnvimass 6039 . . . . 5 (𝐹 “ (𝐹𝑆)) ⊆ dom 𝐹
4 cnclsi.1 . . . . . . 7 𝑋 = 𝐽
5 eqid 2734 . . . . . . 7 𝐾 = 𝐾
64, 5cnf 23188 . . . . . 6 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋 𝐾)
76adantr 480 . . . . 5 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝐹:𝑋 𝐾)
83, 7fssdm 6679 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → (𝐹 “ (𝐹𝑆)) ⊆ 𝑋)
9 simpr 484 . . . . . . 7 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝑆𝑋)
107fdmd 6670 . . . . . . 7 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → dom 𝐹 = 𝑋)
119, 10sseqtrrd 3969 . . . . . 6 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝑆 ⊆ dom 𝐹)
12 sseqin2 4173 . . . . . 6 (𝑆 ⊆ dom 𝐹 ↔ (dom 𝐹𝑆) = 𝑆)
1311, 12sylib 218 . . . . 5 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → (dom 𝐹𝑆) = 𝑆)
14 dminss 6109 . . . . 5 (dom 𝐹𝑆) ⊆ (𝐹 “ (𝐹𝑆))
1513, 14eqsstrrdi 3977 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝑆 ⊆ (𝐹 “ (𝐹𝑆)))
164clsss 22996 . . . 4 ((𝐽 ∈ Top ∧ (𝐹 “ (𝐹𝑆)) ⊆ 𝑋𝑆 ⊆ (𝐹 “ (𝐹𝑆))) → ((cls‘𝐽)‘𝑆) ⊆ ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))))
172, 8, 15, 16syl3anc 1373 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))))
18 imassrn 6028 . . . . 5 (𝐹𝑆) ⊆ ran 𝐹
197frnd 6668 . . . . 5 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ran 𝐹 𝐾)
2018, 19sstrid 3943 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → (𝐹𝑆) ⊆ 𝐾)
215cncls2i 23212 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (𝐹𝑆) ⊆ 𝐾) → ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆))))
2220, 21syldan 591 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆))))
2317, 22sstrd 3942 . 2 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆))))
247ffund 6664 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → Fun 𝐹)
254clsss3 23001 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
261, 25sylan 580 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
2726, 10sseqtrrd 3969 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ dom 𝐹)
28 funimass3 6997 . . 3 ((Fun 𝐹 ∧ ((cls‘𝐽)‘𝑆) ⊆ dom 𝐹) → ((𝐹 “ ((cls‘𝐽)‘𝑆)) ⊆ ((cls‘𝐾)‘(𝐹𝑆)) ↔ ((cls‘𝐽)‘𝑆) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆)))))
2924, 27, 28syl2anc 584 . 2 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((𝐹 “ ((cls‘𝐽)‘𝑆)) ⊆ ((cls‘𝐾)‘(𝐹𝑆)) ↔ ((cls‘𝐽)‘𝑆) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆)))))
3023, 29mpbird 257 1 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → (𝐹 “ ((cls‘𝐽)‘𝑆)) ⊆ ((cls‘𝐾)‘(𝐹𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  cin 3898  wss 3899   cuni 4861  ccnv 5621  dom cdm 5622  ran crn 5623  cima 5625  Fun wfun 6484  wf 6486  cfv 6490  (class class class)co 7356  Topctop 22835  clsccl 22960   Cn ccn 23166
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-iun 4946  df-iin 4947  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-map 8763  df-top 22836  df-topon 22853  df-cld 22961  df-cls 22963  df-cn 23169
This theorem is referenced by:  cncls  23216  hmeocls  23710  clsnsg  24052
  Copyright terms: Public domain W3C validator