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

Theorem cnclsi 23233
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 23201 . . . . 5 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
21adantr 480 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝐽 ∈ Top)
3 cnvimass 6051 . . . . 5 (𝐹 “ (𝐹𝑆)) ⊆ dom 𝐹
4 cnclsi.1 . . . . . . 7 𝑋 = 𝐽
5 eqid 2737 . . . . . . 7 𝐾 = 𝐾
64, 5cnf 23207 . . . . . 6 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋 𝐾)
76adantr 480 . . . . 5 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝐹:𝑋 𝐾)
83, 7fssdm 6691 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → (𝐹 “ (𝐹𝑆)) ⊆ 𝑋)
9 simpr 484 . . . . . . 7 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝑆𝑋)
107fdmd 6682 . . . . . . 7 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → dom 𝐹 = 𝑋)
119, 10sseqtrrd 3973 . . . . . 6 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝑆 ⊆ dom 𝐹)
12 sseqin2 4177 . . . . . 6 (𝑆 ⊆ dom 𝐹 ↔ (dom 𝐹𝑆) = 𝑆)
1311, 12sylib 218 . . . . 5 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → (dom 𝐹𝑆) = 𝑆)
14 dminss 6121 . . . . 5 (dom 𝐹𝑆) ⊆ (𝐹 “ (𝐹𝑆))
1513, 14eqsstrrdi 3981 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝑆 ⊆ (𝐹 “ (𝐹𝑆)))
164clsss 23015 . . . 4 ((𝐽 ∈ Top ∧ (𝐹 “ (𝐹𝑆)) ⊆ 𝑋𝑆 ⊆ (𝐹 “ (𝐹𝑆))) → ((cls‘𝐽)‘𝑆) ⊆ ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))))
172, 8, 15, 16syl3anc 1374 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))))
18 imassrn 6040 . . . . 5 (𝐹𝑆) ⊆ ran 𝐹
197frnd 6680 . . . . 5 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ran 𝐹 𝐾)
2018, 19sstrid 3947 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → (𝐹𝑆) ⊆ 𝐾)
215cncls2i 23231 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (𝐹𝑆) ⊆ 𝐾) → ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆))))
2220, 21syldan 592 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆))))
2317, 22sstrd 3946 . 2 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆))))
247ffund 6676 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → Fun 𝐹)
254clsss3 23020 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
261, 25sylan 581 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
2726, 10sseqtrrd 3973 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ dom 𝐹)
28 funimass3 7010 . . 3 ((Fun 𝐹 ∧ ((cls‘𝐽)‘𝑆) ⊆ dom 𝐹) → ((𝐹 “ ((cls‘𝐽)‘𝑆)) ⊆ ((cls‘𝐾)‘(𝐹𝑆)) ↔ ((cls‘𝐽)‘𝑆) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆)))))
2924, 27, 28syl2anc 585 . 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 1542  wcel 2114  cin 3902  wss 3903   cuni 4865  ccnv 5633  dom cdm 5634  ran crn 5635  cima 5637  Fun wfun 6496  wf 6498  cfv 6502  (class class class)co 7370  Topctop 22854  clsccl 22979   Cn ccn 23185
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-iin 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5529  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-ov 7373  df-oprab 7374  df-mpo 7375  df-map 8779  df-top 22855  df-topon 22872  df-cld 22980  df-cls 22982  df-cn 23188
This theorem is referenced by:  cncls  23235  hmeocls  23729  clsnsg  24071
  Copyright terms: Public domain W3C validator