| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > clsfval | GIF version | ||
| Description: The closure function on the subsets of a topology's base set. (Contributed by NM, 3-Oct-2006.) (Revised by Mario Carneiro, 11-Nov-2013.) |
| Ref | Expression |
|---|---|
| cldval.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| clsfval | ⊢ (𝐽 ∈ Top → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cldval.1 | . . . 4 ⊢ 𝑋 = ∪ 𝐽 | |
| 2 | 1 | topopn 15092 | . . 3 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
| 3 | pwexg 4315 | . . 3 ⊢ (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V) | |
| 4 | mptexg 5936 | . . 3 ⊢ (𝒫 𝑋 ∈ V → (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V) | |
| 5 | 2, 3, 4 | 3syl 17 | . 2 ⊢ (𝐽 ∈ Top → (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V) |
| 6 | unieq 3942 | . . . . . 6 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽) | |
| 7 | 6, 1 | eqtr4di 2289 | . . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋) |
| 8 | 7 | pweqd 3693 | . . . 4 ⊢ (𝑗 = 𝐽 → 𝒫 ∪ 𝑗 = 𝒫 𝑋) |
| 9 | fveq2 5693 | . . . . . 6 ⊢ (𝑗 = 𝐽 → (Clsd‘𝑗) = (Clsd‘𝐽)) | |
| 10 | rabeq 2813 | . . . . . 6 ⊢ ((Clsd‘𝑗) = (Clsd‘𝐽) → {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦} = {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) | |
| 11 | 9, 10 | syl 14 | . . . . 5 ⊢ (𝑗 = 𝐽 → {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦} = {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) |
| 12 | 11 | inteqd 3973 | . . . 4 ⊢ (𝑗 = 𝐽 → ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦} = ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) |
| 13 | 8, 12 | mpteq12dv 4211 | . . 3 ⊢ (𝑗 = 𝐽 → (𝑥 ∈ 𝒫 ∪ 𝑗 ↦ ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦}) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})) |
| 14 | df-cls 15181 | . . 3 ⊢ cls = (𝑗 ∈ Top ↦ (𝑥 ∈ 𝒫 ∪ 𝑗 ↦ ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦})) | |
| 15 | 13, 14 | fvmptg 5778 | . 2 ⊢ ((𝐽 ∈ Top ∧ (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V) → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})) |
| 16 | 5, 15 | mpdan 425 | 1 ⊢ (𝐽 ∈ Top → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 {crab 2532 Vcvv 2821 ⊆ wss 3220 𝒫 cpw 3688 ∪ cuni 3933 ∩ cint 3968 ↦ cmpt 4190 ‘cfv 5375 Topctop 15081 Clsdccld 15176 clsccl 15178 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-pow 4309 ax-pr 4344 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-top 15082 df-cls 15181 |
| This theorem is referenced by: clsval 15195 |
| Copyright terms: Public domain | W3C validator |