clsf2 - Mathbox for Richard Penner

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

Theorem clsf2 37444

Description: The closure function is a map from the powerset of the base set to itself. This is less precise than clsf 20662. (Contributed by RP, 22-Apr-2021.)

**Hypotheses**
Ref	Expression
clselmap.x	⊢ 𝑋 = ∪ 𝐽
clselmap.k	⊢ 𝐾 = (cls‘𝐽)

**Assertion**
Ref	Expression
clsf2	⊢ (𝐽 ∈ Top → 𝐾:𝒫 𝑋⟶𝒫 𝑋)

**Proof of Theorem clsf2**
Step	Hyp	Ref	Expression
1		clselmap.x	. . . 4 ⊢ 𝑋 = ∪ 𝐽
2	1	clsf 20662	. . 3 ⊢ (𝐽 ∈ Top → (cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽))
3		clselmap.k	. . . . 5 ⊢ 𝐾 = (cls‘𝐽)
4	3	feq1i 5949	. . . 4 ⊢ (𝐾:𝒫 𝑋⟶(Clsd‘𝐽) ↔ (cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽))
5		df-f 5808	. . . 4 ⊢ (𝐾:𝒫 𝑋⟶(Clsd‘𝐽) ↔ (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)))
6	4, 5	sylbb1 226	. . 3 ⊢ ((cls‘𝐽):𝒫 𝑋⟶(Clsd‘𝐽) → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)))
7	1	cldss2 20644	. . . . 5 ⊢ (Clsd‘𝐽) ⊆ 𝒫 𝑋
8		sstr2 3575	. . . . 5 ⊢ (ran 𝐾 ⊆ (Clsd‘𝐽) → ((Clsd‘𝐽) ⊆ 𝒫 𝑋 → ran 𝐾 ⊆ 𝒫 𝑋))
9	7, 8	mpi 20	. . . 4 ⊢ (ran 𝐾 ⊆ (Clsd‘𝐽) → ran 𝐾 ⊆ 𝒫 𝑋)
10	9	anim2i 591	. . 3 ⊢ ((𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ (Clsd‘𝐽)) → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
11	2, 6, 10	3syl 18	. 2 ⊢ (𝐽 ∈ Top → (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
12		df-f 5808	. 2 ⊢ (𝐾:𝒫 𝑋⟶𝒫 𝑋 ↔ (𝐾 Fn 𝒫 𝑋 ∧ ran 𝐾 ⊆ 𝒫 𝑋))
13	11, 12	sylibr 223	1 ⊢ (𝐽 ∈ Top → 𝐾:𝒫 𝑋⟶𝒫 𝑋)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ⊆ wss 3540 𝒫 cpw 4108 ∪ cuni 4372 ran crn 5039 Fn wfn 5799 ⟶wf 5800 ‘cfv 5804 Topctop 20517 Clsdccld 20630 clsccl 20632

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-iin 4458 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-top 20521 df-cld 20633 df-cls 20635

This theorem is referenced by: clselmap 37445

W3C validator