![]() |
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 11859 | . . 3 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
3 | pwexg 4036 | . . 3 ⊢ (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V) | |
4 | mptexg 5561 | . . 3 ⊢ (𝒫 𝑋 ∈ V → (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V) | |
5 | 2, 3, 4 | 3syl 17 | . 2 ⊢ (𝐽 ∈ Top → (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V) |
6 | unieq 3684 | . . . . . 6 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽) | |
7 | 6, 1 | syl6eqr 2145 | . . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋) |
8 | 7 | pweqd 3454 | . . . 4 ⊢ (𝑗 = 𝐽 → 𝒫 ∪ 𝑗 = 𝒫 𝑋) |
9 | fveq2 5340 | . . . . . 6 ⊢ (𝑗 = 𝐽 → (Clsd‘𝑗) = (Clsd‘𝐽)) | |
10 | rabeq 2625 | . . . . . 6 ⊢ ((Clsd‘𝑗) = (Clsd‘𝐽) → {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦} = {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) | |
11 | 9, 10 | syl 14 | . . . . 5 ⊢ (𝑗 = 𝐽 → {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦} = {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) |
12 | 11 | inteqd 3715 | . . . 4 ⊢ (𝑗 = 𝐽 → ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦} = ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) |
13 | 8, 12 | mpteq12dv 3942 | . . 3 ⊢ (𝑗 = 𝐽 → (𝑥 ∈ 𝒫 ∪ 𝑗 ↦ ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦}) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})) |
14 | df-cls 11949 | . . 3 ⊢ cls = (𝑗 ∈ Top ↦ (𝑥 ∈ 𝒫 ∪ 𝑗 ↦ ∩ {𝑦 ∈ (Clsd‘𝑗) ∣ 𝑥 ⊆ 𝑦})) | |
15 | 13, 14 | fvmptg 5415 | . 2 ⊢ ((𝐽 ∈ Top ∧ (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦}) ∈ V) → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})) |
16 | 5, 15 | mpdan 413 | 1 ⊢ (𝐽 ∈ Top → (cls‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ ∩ {𝑦 ∈ (Clsd‘𝐽) ∣ 𝑥 ⊆ 𝑦})) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1296 ∈ wcel 1445 {crab 2374 Vcvv 2633 ⊆ wss 3013 𝒫 cpw 3449 ∪ cuni 3675 ∩ cint 3710 ↦ cmpt 3921 ‘cfv 5049 Topctop 11848 Clsdccld 11944 clsccl 11946 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 668 ax-5 1388 ax-7 1389 ax-gen 1390 ax-ie1 1434 ax-ie2 1435 ax-8 1447 ax-10 1448 ax-11 1449 ax-i12 1450 ax-bndl 1451 ax-4 1452 ax-14 1457 ax-17 1471 ax-i9 1475 ax-ial 1479 ax-i5r 1480 ax-ext 2077 ax-coll 3975 ax-sep 3978 ax-pow 4030 ax-pr 4060 |
This theorem depends on definitions: df-bi 116 df-3an 929 df-tru 1299 df-nf 1402 df-sb 1700 df-eu 1958 df-mo 1959 df-clab 2082 df-cleq 2088 df-clel 2091 df-nfc 2224 df-ral 2375 df-rex 2376 df-reu 2377 df-rab 2379 df-v 2635 df-sbc 2855 df-csb 2948 df-un 3017 df-in 3019 df-ss 3026 df-pw 3451 df-sn 3472 df-pr 3473 df-op 3475 df-uni 3676 df-int 3711 df-iun 3754 df-br 3868 df-opab 3922 df-mpt 3923 df-id 4144 df-xp 4473 df-rel 4474 df-cnv 4475 df-co 4476 df-dm 4477 df-rn 4478 df-res 4479 df-ima 4480 df-iota 5014 df-fun 5051 df-fn 5052 df-f 5053 df-f1 5054 df-fo 5055 df-f1o 5056 df-fv 5057 df-top 11849 df-cls 11949 |
This theorem is referenced by: clsval 11963 |
Copyright terms: Public domain | W3C validator |