Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  clsf2 Structured version   Visualization version   GIF version

Theorem clsf2 44709
Description: The closure function is a map from the powerset of the base set to itself. This is less precise than clsf 23162. (Contributed by RP, 22-Apr-2021.)
Hypotheses
Ref Expression
clselmap.x 𝑋 = 𝐽
clselmap.k 𝐾 = (cls‘𝐽)
Assertion
Ref Expression
clsf2 (𝐽 ∈ Top → 𝐾:𝒫 𝑋⟶𝒫 𝑋)

Proof of Theorem clsf2
StepHypRef Expression
1 clselmap.x . . . 4 𝑋 = 𝐽
21clsf 23162 . . 3 (𝐽 ∈ Top → (cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽))
3 clselmap.k . . . . 5 𝐾 = (cls‘𝐽)
43feq1i 6686 . . . 4 (𝐾:𝒫 𝑋⟶(Clsd‘𝐽) ↔ (cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽))
5 df-f 6529 . . . 4 (𝐾:𝒫 𝑋⟶(Clsd‘𝐽) ↔ (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)))
64, 5sylbb1 240 . . 3 ((cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽) → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)))
71cldss2 23144 . . . . 5 (Clsd‘𝐽) ⊆ 𝒫 𝑋
8 sstr2 3946 . . . . 5 (ran 𝐾 ⊆ (Clsd‘𝐽) → ((Clsd‘𝐽) ⊆ 𝒫 𝑋 → ran 𝐾 ⊆ 𝒫 𝑋))
97, 8mpi 21 . . . 4 (ran 𝐾 ⊆ (Clsd‘𝐽) → ran 𝐾 ⊆ 𝒫 𝑋)
109anim2i 628 . . 3 ((𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)) → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
112, 6, 103syl 19 . 2 (𝐽 ∈ Top → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
12 df-f 6529 . 2 (𝐾:𝒫 𝑋⟶𝒫 𝑋 ↔ (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
1311, 12sylibr 237 1 (𝐽 ∈ Top → 𝐾:𝒫 𝑋⟶𝒫 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  wcel 2145  wss 3907  𝒫 cpw 4558   cuni 4867  ran crn 5652   Fn wfn 6520  wf 6521  cfv 6525  Topctop 23007  Clsdccld 23130  clsccl 23132
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5231  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5105  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-top 23008  df-cld 23133  df-cls 23135
This theorem is referenced by:  clselmap  44710
  Copyright terms: Public domain W3C validator