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 38741
Description: The closure function is a map from the powerset of the base set to itself. This is less precise than clsf 20900. (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 20900 . . 3 (𝐽 ∈ Top → (cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽))
3 clselmap.k . . . . 5 𝐾 = (cls‘𝐽)
43feq1i 6074 . . . 4 (𝐾:𝒫 𝑋⟶(Clsd‘𝐽) ↔ (cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽))
5 df-f 5930 . . . 4 (𝐾:𝒫 𝑋⟶(Clsd‘𝐽) ↔ (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)))
64, 5sylbb1 227 . . 3 ((cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽) → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)))
71cldss2 20882 . . . . 5 (Clsd‘𝐽) ⊆ 𝒫 𝑋
8 sstr2 3643 . . . . 5 (ran 𝐾 ⊆ (Clsd‘𝐽) → ((Clsd‘𝐽) ⊆ 𝒫 𝑋 → ran 𝐾 ⊆ 𝒫 𝑋))
97, 8mpi 20 . . . 4 (ran 𝐾 ⊆ (Clsd‘𝐽) → ran 𝐾 ⊆ 𝒫 𝑋)
109anim2i 592 . . 3 ((𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)) → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
112, 6, 103syl 18 . 2 (𝐽 ∈ Top → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
12 df-f 5930 . 2 (𝐾:𝒫 𝑋⟶𝒫 𝑋 ↔ (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
1311, 12sylibr 224 1 (𝐽 ∈ Top → 𝐾:𝒫 𝑋⟶𝒫 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1523  wcel 2030  wss 3607  𝒫 cpw 4191   cuni 4468  ran crn 5144   Fn wfn 5921  wf 5922  cfv 5926  Topctop 20746  Clsdccld 20868  clsccl 20870
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-iin 4555  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-top 20747  df-cld 20871  df-cls 20873
This theorem is referenced by:  clselmap  38742
  Copyright terms: Public domain W3C validator