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 44132
Description: The closure function is a map from the powerset of the base set to itself. This is less precise than clsf 23081. (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 23081 . . 3 (𝐽 ∈ Top → (cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽))
3 clselmap.k . . . . 5 𝐾 = (cls‘𝐽)
43feq1i 6735 . . . 4 (𝐾:𝒫 𝑋⟶(Clsd‘𝐽) ↔ (cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽))
5 df-f 6573 . . . 4 (𝐾:𝒫 𝑋⟶(Clsd‘𝐽) ↔ (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)))
64, 5sylbb1 237 . . 3 ((cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽) → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)))
71cldss2 23063 . . . . 5 (Clsd‘𝐽) ⊆ 𝒫 𝑋
8 sstr2 4005 . . . . 5 (ran 𝐾 ⊆ (Clsd‘𝐽) → ((Clsd‘𝐽) ⊆ 𝒫 𝑋 → ran 𝐾 ⊆ 𝒫 𝑋))
97, 8mpi 20 . . . 4 (ran 𝐾 ⊆ (Clsd‘𝐽) → ran 𝐾 ⊆ 𝒫 𝑋)
109anim2i 617 . . 3 ((𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)) → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
112, 6, 103syl 18 . 2 (𝐽 ∈ Top → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
12 df-f 6573 . 2 (𝐾:𝒫 𝑋⟶𝒫 𝑋 ↔ (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
1311, 12sylibr 234 1 (𝐽 ∈ Top → 𝐾:𝒫 𝑋⟶𝒫 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2108  wss 3966  𝒫 cpw 4608   cuni 4915  ran crn 5694   Fn wfn 6564  wf 6565  cfv 6569  Topctop 22924  Clsdccld 23049  clsccl 23051
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5288  ax-sep 5305  ax-nul 5315  ax-pow 5374  ax-pr 5441  ax-un 7761
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3483  df-sbc 3795  df-csb 3912  df-dif 3969  df-un 3971  df-in 3973  df-ss 3983  df-nul 4343  df-if 4535  df-pw 4610  df-sn 4635  df-pr 4637  df-op 4641  df-uni 4916  df-int 4955  df-iun 5001  df-iin 5002  df-br 5152  df-opab 5214  df-mpt 5235  df-id 5587  df-xp 5699  df-rel 5700  df-cnv 5701  df-co 5702  df-dm 5703  df-rn 5704  df-res 5705  df-ima 5706  df-iota 6522  df-fun 6571  df-fn 6572  df-f 6573  df-f1 6574  df-fo 6575  df-f1o 6576  df-fv 6577  df-top 22925  df-cld 23052  df-cls 23054
This theorem is referenced by:  clselmap  44133
  Copyright terms: Public domain W3C validator