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

Theorem cnclsi 22768
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 22736 . . . . 5 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
21adantr 482 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝐽 ∈ Top)
3 cnvimass 6078 . . . . 5 (𝐹 “ (𝐹𝑆)) ⊆ dom 𝐹
4 cnclsi.1 . . . . . . 7 𝑋 = 𝐽
5 eqid 2733 . . . . . . 7 𝐾 = 𝐾
64, 5cnf 22742 . . . . . 6 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋 𝐾)
76adantr 482 . . . . 5 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝐹:𝑋 𝐾)
83, 7fssdm 6735 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → (𝐹 “ (𝐹𝑆)) ⊆ 𝑋)
9 simpr 486 . . . . . . 7 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝑆𝑋)
107fdmd 6726 . . . . . . 7 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → dom 𝐹 = 𝑋)
119, 10sseqtrrd 4023 . . . . . 6 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝑆 ⊆ dom 𝐹)
12 sseqin2 4215 . . . . . 6 (𝑆 ⊆ dom 𝐹 ↔ (dom 𝐹𝑆) = 𝑆)
1311, 12sylib 217 . . . . 5 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → (dom 𝐹𝑆) = 𝑆)
14 dminss 6150 . . . . 5 (dom 𝐹𝑆) ⊆ (𝐹 “ (𝐹𝑆))
1513, 14eqsstrrdi 4037 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → 𝑆 ⊆ (𝐹 “ (𝐹𝑆)))
164clsss 22550 . . . 4 ((𝐽 ∈ Top ∧ (𝐹 “ (𝐹𝑆)) ⊆ 𝑋𝑆 ⊆ (𝐹 “ (𝐹𝑆))) → ((cls‘𝐽)‘𝑆) ⊆ ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))))
172, 8, 15, 16syl3anc 1372 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))))
18 imassrn 6069 . . . . 5 (𝐹𝑆) ⊆ ran 𝐹
197frnd 6723 . . . . 5 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ran 𝐹 𝐾)
2018, 19sstrid 3993 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → (𝐹𝑆) ⊆ 𝐾)
215cncls2i 22766 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ (𝐹𝑆) ⊆ 𝐾) → ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆))))
2220, 21syldan 592 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘(𝐹 “ (𝐹𝑆))) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆))))
2317, 22sstrd 3992 . 2 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ (𝐹 “ ((cls‘𝐾)‘(𝐹𝑆))))
247ffund 6719 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → Fun 𝐹)
254clsss3 22555 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
261, 25sylan 581 . . . 4 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
2726, 10sseqtrrd 4023 . . 3 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ dom 𝐹)
28 funimass3 7053 . . 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 205  wa 397   = wceq 1542  wcel 2107  cin 3947  wss 3948   cuni 4908  ccnv 5675  dom cdm 5676  ran crn 5677  cima 5679  Fun wfun 6535  wf 6537  cfv 6541  (class class class)co 7406  Topctop 22387  clsccl 22514   Cn ccn 22720
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7722
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-iin 5000  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6493  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-ov 7409  df-oprab 7410  df-mpo 7411  df-map 8819  df-top 22388  df-topon 22405  df-cld 22515  df-cls 22517  df-cn 22723
This theorem is referenced by:  cncls  22770  hmeocls  23264  clsnsg  23606
  Copyright terms: Public domain W3C validator