Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  istopclsd Structured version   Visualization version   GIF version

Theorem istopclsd 43904
Description: A closure function which satisfies sscls 23404, clsidm 23415, cls0 23428, and clsun 37294 defines a (unique) topology which it is the closure function on. (Contributed by Stefan O'Rear, 1-Feb-2015.)
Hypotheses
Ref Expression
istopclsd.b (𝜑 → 𝐵 ∈ 𝑉)
istopclsd.f (𝜑 → 𝐹:𝒫 𝐵⟶𝒫 𝐵)
istopclsd.e ((𝜑 ∧ 𝑥 ⊆ 𝐵) → 𝑥 ⊆ (𝐹‘𝑥))
istopclsd.i ((𝜑 ∧ 𝑥 ⊆ 𝐵) → (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))
istopclsd.z (𝜑 → (𝐹‘∅) = ∅)
istopclsd.u ((𝜑 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝐵) → (𝐹‘(𝑥 ∪ 𝑦)) = ((𝐹‘𝑥) ∪ (𝐹‘𝑦)))
istopclsd.j 𝐽 = {𝑧 ∈ 𝒫 𝐵 ∣ (𝐹‘(𝐵 ∖ 𝑧)) = (𝐵 ∖ 𝑧)}
Assertion
Ref Expression
istopclsd (𝜑 → (𝐽 ∈ (TopOn‘𝐵) ∧ (cls‘𝐽) = 𝐹))
Distinct variable groups:   𝑥,𝐵,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝐽,𝑦   𝑥,𝑉,𝑦,𝑧
Allowed substitution hint:   𝐽(𝑧)

Proof of Theorem istopclsd
StepHypRef Expression
1 istopclsd.j . . . 4 𝐽 = {𝑧 ∈ 𝒫 𝐵 ∣ (𝐹‘(𝐵 ∖ 𝑧)) = (𝐵 ∖ 𝑧)}
2 istopclsd.f . . . . . . . . 9 (𝜑 → 𝐹:𝒫 𝐵⟶𝒫 𝐵)
32ffnd 6732 . . . . . . . 8 (𝜑 → 𝐹 Fn 𝒫 𝐵)
43adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑧 ∈ 𝒫 𝐵) → 𝐹 Fn 𝒫 𝐵)
5 difss 4075 . . . . . . . . 9 (𝐵 ∖ 𝑧) ⊆ 𝐵
6 istopclsd.b . . . . . . . . . 10 (𝜑 → 𝐵 ∈ 𝑉)
7 elpw2g 5299 . . . . . . . . . 10 (𝐵 ∈ 𝑉 → ((𝐵 ∖ 𝑧) ∈ 𝒫 𝐵 ↔ (𝐵 ∖ 𝑧) ⊆ 𝐵))
86, 7syl 18 . . . . . . . . 9 (𝜑 → ((𝐵 ∖ 𝑧) ∈ 𝒫 𝐵 ↔ (𝐵 ∖ 𝑧) ⊆ 𝐵))
95, 8mpbiri 261 . . . . . . . 8 (𝜑 → (𝐵 ∖ 𝑧) ∈ 𝒫 𝐵)
109adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑧 ∈ 𝒫 𝐵) → (𝐵 ∖ 𝑧) ∈ 𝒫 𝐵)
11 fnelfp 7203 . . . . . . 7 ((𝐹 Fn 𝒫 𝐵 ∧ (𝐵 ∖ 𝑧) ∈ 𝒫 𝐵) → ((𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘(𝐵 ∖ 𝑧)) = (𝐵 ∖ 𝑧)))
124, 10, 11syl2anc 596 . . . . . 6 ((𝜑 ∧ 𝑧 ∈ 𝒫 𝐵) → ((𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘(𝐵 ∖ 𝑧)) = (𝐵 ∖ 𝑧)))
1312bicomd 226 . . . . 5 ((𝜑 ∧ 𝑧 ∈ 𝒫 𝐵) → ((𝐹‘(𝐵 ∖ 𝑧)) = (𝐵 ∖ 𝑧) ↔ (𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I )))
1413rabbidva 3422 . . . 4 (𝜑 → {𝑧 ∈ 𝒫 𝐵 ∣ (𝐹‘(𝐵 ∖ 𝑧)) = (𝐵 ∖ 𝑧)} = {𝑧 ∈ 𝒫 𝐵 ∣ (𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I )})
151, 14eqtrid 2810 . . 3 (𝜑 → 𝐽 = {𝑧 ∈ 𝒫 𝐵 ∣ (𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I )})
16 istopclsd.e . . . . . 6 ((𝜑 ∧ 𝑥 ⊆ 𝐵) → 𝑥 ⊆ (𝐹‘𝑥))
17 simp1 1154 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → 𝜑)
18 simp2 1155 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → 𝑥 ⊆ 𝐵)
19 simp3 1156 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → 𝑦 ⊆ 𝑥)
2019, 18sstrd 3923 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → 𝑦 ⊆ 𝐵)
21 istopclsd.u . . . . . . . . 9 ((𝜑 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝐵) → (𝐹‘(𝑥 ∪ 𝑦)) = ((𝐹‘𝑥) ∪ (𝐹‘𝑦)))
2217, 18, 20, 21syl3anc 1399 . . . . . . . 8 ((𝜑 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘(𝑥 ∪ 𝑦)) = ((𝐹‘𝑥) ∪ (𝐹‘𝑦)))
23 ssequn2 4190 . . . . . . . . . . 11 (𝑦 ⊆ 𝑥 ↔ (𝑥 ∪ 𝑦) = 𝑥)
2423biimpi 219 . . . . . . . . . 10 (𝑦 ⊆ 𝑥 → (𝑥 ∪ 𝑦) = 𝑥)
25243ad2ant3 1153 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ∪ 𝑦) = 𝑥)
2625fveq2d 6912 . . . . . . . 8 ((𝜑 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘(𝑥 ∪ 𝑦)) = (𝐹‘𝑥))
2722, 26eqtr3d 2800 . . . . . . 7 ((𝜑 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → ((𝐹‘𝑥) ∪ (𝐹‘𝑦)) = (𝐹‘𝑥))
28 ssequn2 4190 . . . . . . 7 ((𝐹‘𝑦) ⊆ (𝐹‘𝑥) ↔ ((𝐹‘𝑥) ∪ (𝐹‘𝑦)) = (𝐹‘𝑥))
2927, 28sylibr 237 . . . . . 6 ((𝜑 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥))
30 istopclsd.i . . . . . 6 ((𝜑 ∧ 𝑥 ⊆ 𝐵) → (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))
316, 2, 16, 29, 30ismrcd1 43902 . . . . 5 (𝜑 → dom (𝐹 ∩ I ) ∈ (Moore‘𝐵))
32 istopclsd.z . . . . . 6 (𝜑 → (𝐹‘∅) = ∅)
33 0elpw 5321 . . . . . . 7 ∅ ∈ 𝒫 𝐵
34 fnelfp 7203 . . . . . . 7 ((𝐹 Fn 𝒫 𝐵 ∧ ∅ ∈ 𝒫 𝐵) → (∅ ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘∅) = ∅))
353, 33, 34sylancl 598 . . . . . 6 (𝜑 → (∅ ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘∅) = ∅))
3632, 35mpbird 260 . . . . 5 (𝜑 → ∅ ∈ dom (𝐹 ∩ I ))
37 simp1 1154 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝜑)
38 inss1 4136 . . . . . . . . . . . . 13 (𝐹 ∩ I ) ⊆ 𝐹
39 dmss 5891 . . . . . . . . . . . . 13 ((𝐹 ∩ I ) ⊆ 𝐹 → dom (𝐹 ∩ I ) ⊆ dom 𝐹)
4038, 39ax-mp 5 . . . . . . . . . . . 12 dom (𝐹 ∩ I ) ⊆ dom 𝐹
4140, 2fssdm 6751 . . . . . . . . . . 11 (𝜑 → dom (𝐹 ∩ I ) ⊆ 𝒫 𝐵)
42413ad2ant1 1151 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → dom (𝐹 ∩ I ) ⊆ 𝒫 𝐵)
43 simp2 1155 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑥 ∈ dom (𝐹 ∩ I ))
4442, 43sseldd 3914 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑥 ∈ 𝒫 𝐵)
4544elpwid 4569 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑥 ⊆ 𝐵)
46 simp3 1156 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑦 ∈ dom (𝐹 ∩ I ))
4742, 46sseldd 3914 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑦 ∈ 𝒫 𝐵)
4847elpwid 4569 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑦 ⊆ 𝐵)
4937, 45, 48, 21syl3anc 1399 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹‘(𝑥 ∪ 𝑦)) = ((𝐹‘𝑥) ∪ (𝐹‘𝑦)))
5033ad2ant1 1151 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝐹 Fn 𝒫 𝐵)
51 fnelfp 7203 . . . . . . . . . 10 ((𝐹 Fn 𝒫 𝐵 ∧ 𝑥 ∈ 𝒫 𝐵) → (𝑥 ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘𝑥) = 𝑥))
5250, 44, 51syl2anc 596 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑥 ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘𝑥) = 𝑥))
5343, 52mpbid 235 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹‘𝑥) = 𝑥)
54 fnelfp 7203 . . . . . . . . . 10 ((𝐹 Fn 𝒫 𝐵 ∧ 𝑦 ∈ 𝒫 𝐵) → (𝑦 ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘𝑦) = 𝑦))
5550, 47, 54syl2anc 596 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑦 ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘𝑦) = 𝑦))
5646, 55mpbid 235 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹‘𝑦) = 𝑦)
5753, 56uneq12d 4171 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → ((𝐹‘𝑥) ∪ (𝐹‘𝑦)) = (𝑥 ∪ 𝑦))
5849, 57eqtrd 2798 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹‘(𝑥 ∪ 𝑦)) = (𝑥 ∪ 𝑦))
5945, 48unssd 4193 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑥 ∪ 𝑦) ⊆ 𝐵)
60 vex 3458 . . . . . . . . . 10 𝑥 ∈ V
61 vex 3458 . . . . . . . . . 10 𝑦 ∈ V
6260, 61unex 7785 . . . . . . . . 9 (𝑥 ∪ 𝑦) ∈ V
6362elpw 4564 . . . . . . . 8 ((𝑥 ∪ 𝑦) ∈ 𝒫 𝐵 ↔ (𝑥 ∪ 𝑦) ⊆ 𝐵)
6459, 63sylibr 237 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑥 ∪ 𝑦) ∈ 𝒫 𝐵)
65 fnelfp 7203 . . . . . . 7 ((𝐹 Fn 𝒫 𝐵 ∧ (𝑥 ∪ 𝑦) ∈ 𝒫 𝐵) → ((𝑥 ∪ 𝑦) ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘(𝑥 ∪ 𝑦)) = (𝑥 ∪ 𝑦)))
6650, 64, 65syl2anc 596 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → ((𝑥 ∪ 𝑦) ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘(𝑥 ∪ 𝑦)) = (𝑥 ∪ 𝑦)))
6758, 66mpbird 260 . . . . 5 ((𝜑 ∧ 𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑥 ∪ 𝑦) ∈ dom (𝐹 ∩ I ))
68 eqid 2763 . . . . 5 {𝑧 ∈ 𝒫 𝐵 ∣ (𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I )} = {𝑧 ∈ 𝒫 𝐵 ∣ (𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I )}
6931, 36, 67, 68mretopd 23440 . . . 4 (𝜑 → ({𝑧 ∈ 𝒫 𝐵 ∣ (𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I )} ∈ (TopOn‘𝐵) ∧ dom (𝐹 ∩ I ) = (Clsd‘{𝑧 ∈ 𝒫 𝐵 ∣ (𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I )})))
7069simpld 500 . . 3 (𝜑 → {𝑧 ∈ 𝒫 𝐵 ∣ (𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I )} ∈ (TopOn‘𝐵))
7115, 70eqeltrd 2864 . 2 (𝜑 → 𝐽 ∈ (TopOn‘𝐵))
72 topontop 23261 . . . . . 6 (𝐽 ∈ (TopOn‘𝐵) → 𝐽 ∈ Top)
7371, 72syl 18 . . . . 5 (𝜑 → 𝐽 ∈ Top)
74 eqid 2763 . . . . . 6 (mrCls‘(Clsd‘𝐽)) = (mrCls‘(Clsd‘𝐽))
7574mrccls 23427 . . . . 5 (𝐽 ∈ Top → (cls‘𝐽) = (mrCls‘(Clsd‘𝐽)))
7673, 75syl 18 . . . 4 (𝜑 → (cls‘𝐽) = (mrCls‘(Clsd‘𝐽)))
7769simprd 501 . . . . . 6 (𝜑 → dom (𝐹 ∩ I ) = (Clsd‘{𝑧 ∈ 𝒫 𝐵 ∣ (𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I )}))
7815fveq2d 6912 . . . . . 6 (𝜑 → (Clsd‘𝐽) = (Clsd‘{𝑧 ∈ 𝒫 𝐵 ∣ (𝐵 ∖ 𝑧) ∈ dom (𝐹 ∩ I )}))
7977, 78eqtr4d 2801 . . . . 5 (𝜑 → dom (𝐹 ∩ I ) = (Clsd‘𝐽))
8079fveq2d 6912 . . . 4 (𝜑 → (mrCls‘dom (𝐹 ∩ I )) = (mrCls‘(Clsd‘𝐽)))
8176, 80eqtr4d 2801 . . 3 (𝜑 → (cls‘𝐽) = (mrCls‘dom (𝐹 ∩ I )))
826, 2, 16, 29, 30ismrcd2 43903 . . 3 (𝜑 → 𝐹 = (mrCls‘dom (𝐹 ∩ I )))
8381, 82eqtr4d 2801 . 2 (𝜑 → (cls‘𝐽) = 𝐹)
8471, 83jca 521 1 (𝜑 → (𝐽 ∈ (TopOn‘𝐵) ∧ (cls‘𝐽) = 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092   ∪ cun 4152  ∅c0 4281  𝒫 cpw 4560   I cid 5549  dom cdm 5655   Fn wfn 6553  ⟶wf 6554  ‘cfv 6558  mrClscmrc 17782  Topctop 23241  TopOnctopon 23258  Clsdccld 23364  clsccl 23366
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-mre 17785  df-mrc 17786  df-top 23242  df-topon 23259  df-cld 23367  df-cls 23369
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator