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 36281
Description: A closure function which satisfies sscls 20670, clsidm 20681, cls0 20694, and clsun 31493 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 (𝜑𝐹:𝒫 𝐵⟶𝒫 𝐵)
3 ffn 5958 . . . . . . . . 9 (𝐹:𝒫 𝐵⟶𝒫 𝐵𝐹 Fn 𝒫 𝐵)
42, 3syl 17 . . . . . . . 8 (𝜑𝐹 Fn 𝒫 𝐵)
54adantr 480 . . . . . . 7 ((𝜑𝑧 ∈ 𝒫 𝐵) → 𝐹 Fn 𝒫 𝐵)
6 difss 3699 . . . . . . . . 9 (𝐵𝑧) ⊆ 𝐵
7 istopclsd.b . . . . . . . . . 10 (𝜑𝐵𝑉)
8 elpw2g 4754 . . . . . . . . . 10 (𝐵𝑉 → ((𝐵𝑧) ∈ 𝒫 𝐵 ↔ (𝐵𝑧) ⊆ 𝐵))
97, 8syl 17 . . . . . . . . 9 (𝜑 → ((𝐵𝑧) ∈ 𝒫 𝐵 ↔ (𝐵𝑧) ⊆ 𝐵))
106, 9mpbiri 247 . . . . . . . 8 (𝜑 → (𝐵𝑧) ∈ 𝒫 𝐵)
1110adantr 480 . . . . . . 7 ((𝜑𝑧 ∈ 𝒫 𝐵) → (𝐵𝑧) ∈ 𝒫 𝐵)
12 fnelfp 6346 . . . . . . 7 ((𝐹 Fn 𝒫 𝐵 ∧ (𝐵𝑧) ∈ 𝒫 𝐵) → ((𝐵𝑧) ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘(𝐵𝑧)) = (𝐵𝑧)))
135, 11, 12syl2anc 691 . . . . . 6 ((𝜑𝑧 ∈ 𝒫 𝐵) → ((𝐵𝑧) ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘(𝐵𝑧)) = (𝐵𝑧)))
1413bicomd 212 . . . . 5 ((𝜑𝑧 ∈ 𝒫 𝐵) → ((𝐹‘(𝐵𝑧)) = (𝐵𝑧) ↔ (𝐵𝑧) ∈ dom (𝐹 ∩ I )))
1514rabbidva 3163 . . . 4 (𝜑 → {𝑧 ∈ 𝒫 𝐵 ∣ (𝐹‘(𝐵𝑧)) = (𝐵𝑧)} = {𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )})
161, 15syl5eq 2656 . . 3 (𝜑𝐽 = {𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )})
17 istopclsd.e . . . . . 6 ((𝜑𝑥𝐵) → 𝑥 ⊆ (𝐹𝑥))
18 simp1 1054 . . . . . . . . 9 ((𝜑𝑥𝐵𝑦𝑥) → 𝜑)
19 simp2 1055 . . . . . . . . 9 ((𝜑𝑥𝐵𝑦𝑥) → 𝑥𝐵)
20 simp3 1056 . . . . . . . . . 10 ((𝜑𝑥𝐵𝑦𝑥) → 𝑦𝑥)
2120, 19sstrd 3578 . . . . . . . . 9 ((𝜑𝑥𝐵𝑦𝑥) → 𝑦𝐵)
22 istopclsd.u . . . . . . . . 9 ((𝜑𝑥𝐵𝑦𝐵) → (𝐹‘(𝑥𝑦)) = ((𝐹𝑥) ∪ (𝐹𝑦)))
2318, 19, 21, 22syl3anc 1318 . . . . . . . 8 ((𝜑𝑥𝐵𝑦𝑥) → (𝐹‘(𝑥𝑦)) = ((𝐹𝑥) ∪ (𝐹𝑦)))
24 ssequn2 3748 . . . . . . . . . . 11 (𝑦𝑥 ↔ (𝑥𝑦) = 𝑥)
2524biimpi 205 . . . . . . . . . 10 (𝑦𝑥 → (𝑥𝑦) = 𝑥)
26253ad2ant3 1077 . . . . . . . . 9 ((𝜑𝑥𝐵𝑦𝑥) → (𝑥𝑦) = 𝑥)
2726fveq2d 6107 . . . . . . . 8 ((𝜑𝑥𝐵𝑦𝑥) → (𝐹‘(𝑥𝑦)) = (𝐹𝑥))
2823, 27eqtr3d 2646 . . . . . . 7 ((𝜑𝑥𝐵𝑦𝑥) → ((𝐹𝑥) ∪ (𝐹𝑦)) = (𝐹𝑥))
29 ssequn2 3748 . . . . . . 7 ((𝐹𝑦) ⊆ (𝐹𝑥) ↔ ((𝐹𝑥) ∪ (𝐹𝑦)) = (𝐹𝑥))
3028, 29sylibr 223 . . . . . 6 ((𝜑𝑥𝐵𝑦𝑥) → (𝐹𝑦) ⊆ (𝐹𝑥))
31 istopclsd.i . . . . . 6 ((𝜑𝑥𝐵) → (𝐹‘(𝐹𝑥)) = (𝐹𝑥))
327, 2, 17, 30, 31ismrcd1 36279 . . . . 5 (𝜑 → dom (𝐹 ∩ I ) ∈ (Moore‘𝐵))
33 istopclsd.z . . . . . 6 (𝜑 → (𝐹‘∅) = ∅)
34 0elpw 4760 . . . . . . 7 ∅ ∈ 𝒫 𝐵
35 fnelfp 6346 . . . . . . 7 ((𝐹 Fn 𝒫 𝐵 ∧ ∅ ∈ 𝒫 𝐵) → (∅ ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘∅) = ∅))
364, 34, 35sylancl 693 . . . . . 6 (𝜑 → (∅ ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘∅) = ∅))
3733, 36mpbird 246 . . . . 5 (𝜑 → ∅ ∈ dom (𝐹 ∩ I ))
38 simp1 1054 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝜑)
39 inss1 3795 . . . . . . . . . . . . 13 (𝐹 ∩ I ) ⊆ 𝐹
40 dmss 5245 . . . . . . . . . . . . 13 ((𝐹 ∩ I ) ⊆ 𝐹 → dom (𝐹 ∩ I ) ⊆ dom 𝐹)
4139, 40ax-mp 5 . . . . . . . . . . . 12 dom (𝐹 ∩ I ) ⊆ dom 𝐹
42 fdm 5964 . . . . . . . . . . . . 13 (𝐹:𝒫 𝐵⟶𝒫 𝐵 → dom 𝐹 = 𝒫 𝐵)
432, 42syl 17 . . . . . . . . . . . 12 (𝜑 → dom 𝐹 = 𝒫 𝐵)
4441, 43syl5sseq 3616 . . . . . . . . . . 11 (𝜑 → dom (𝐹 ∩ I ) ⊆ 𝒫 𝐵)
45443ad2ant1 1075 . . . . . . . . . 10 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → dom (𝐹 ∩ I ) ⊆ 𝒫 𝐵)
46 simp2 1055 . . . . . . . . . 10 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑥 ∈ dom (𝐹 ∩ I ))
4745, 46sseldd 3569 . . . . . . . . 9 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑥 ∈ 𝒫 𝐵)
4847elpwid 4118 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑥𝐵)
49 simp3 1056 . . . . . . . . . 10 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑦 ∈ dom (𝐹 ∩ I ))
5045, 49sseldd 3569 . . . . . . . . 9 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑦 ∈ 𝒫 𝐵)
5150elpwid 4118 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑦𝐵)
5238, 48, 51, 22syl3anc 1318 . . . . . . 7 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹‘(𝑥𝑦)) = ((𝐹𝑥) ∪ (𝐹𝑦)))
5343ad2ant1 1075 . . . . . . . . . 10 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝐹 Fn 𝒫 𝐵)
54 fnelfp 6346 . . . . . . . . . 10 ((𝐹 Fn 𝒫 𝐵𝑥 ∈ 𝒫 𝐵) → (𝑥 ∈ dom (𝐹 ∩ I ) ↔ (𝐹𝑥) = 𝑥))
5553, 47, 54syl2anc 691 . . . . . . . . 9 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑥 ∈ dom (𝐹 ∩ I ) ↔ (𝐹𝑥) = 𝑥))
5646, 55mpbid 221 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹𝑥) = 𝑥)
57 fnelfp 6346 . . . . . . . . . 10 ((𝐹 Fn 𝒫 𝐵𝑦 ∈ 𝒫 𝐵) → (𝑦 ∈ dom (𝐹 ∩ I ) ↔ (𝐹𝑦) = 𝑦))
5853, 50, 57syl2anc 691 . . . . . . . . 9 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑦 ∈ dom (𝐹 ∩ I ) ↔ (𝐹𝑦) = 𝑦))
5949, 58mpbid 221 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹𝑦) = 𝑦)
6056, 59uneq12d 3730 . . . . . . 7 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → ((𝐹𝑥) ∪ (𝐹𝑦)) = (𝑥𝑦))
6152, 60eqtrd 2644 . . . . . 6 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹‘(𝑥𝑦)) = (𝑥𝑦))
6248, 51unssd 3751 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑥𝑦) ⊆ 𝐵)
63 vex 3176 . . . . . . . . . 10 𝑥 ∈ V
64 vex 3176 . . . . . . . . . 10 𝑦 ∈ V
6563, 64unex 6854 . . . . . . . . 9 (𝑥𝑦) ∈ V
6665elpw 4114 . . . . . . . 8 ((𝑥𝑦) ∈ 𝒫 𝐵 ↔ (𝑥𝑦) ⊆ 𝐵)
6762, 66sylibr 223 . . . . . . 7 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑥𝑦) ∈ 𝒫 𝐵)
68 fnelfp 6346 . . . . . . 7 ((𝐹 Fn 𝒫 𝐵 ∧ (𝑥𝑦) ∈ 𝒫 𝐵) → ((𝑥𝑦) ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘(𝑥𝑦)) = (𝑥𝑦)))
6953, 67, 68syl2anc 691 . . . . . 6 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → ((𝑥𝑦) ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘(𝑥𝑦)) = (𝑥𝑦)))
7061, 69mpbird 246 . . . . 5 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑥𝑦) ∈ dom (𝐹 ∩ I ))
71 eqid 2610 . . . . 5 {𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )} = {𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )}
7232, 37, 70, 71mretopd 20706 . . . 4 (𝜑 → ({𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )} ∈ (TopOn‘𝐵) ∧ dom (𝐹 ∩ I ) = (Clsd‘{𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )})))
7372simpld 474 . . 3 (𝜑 → {𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )} ∈ (TopOn‘𝐵))
7416, 73eqeltrd 2688 . 2 (𝜑𝐽 ∈ (TopOn‘𝐵))
75 topontop 20541 . . . . . 6 (𝐽 ∈ (TopOn‘𝐵) → 𝐽 ∈ Top)
7674, 75syl 17 . . . . 5 (𝜑𝐽 ∈ Top)
77 eqid 2610 . . . . . 6 (mrCls‘(Clsd‘𝐽)) = (mrCls‘(Clsd‘𝐽))
7877mrccls 20693 . . . . 5 (𝐽 ∈ Top → (cls‘𝐽) = (mrCls‘(Clsd‘𝐽)))
7976, 78syl 17 . . . 4 (𝜑 → (cls‘𝐽) = (mrCls‘(Clsd‘𝐽)))
8072simprd 478 . . . . . 6 (𝜑 → dom (𝐹 ∩ I ) = (Clsd‘{𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )}))
8116fveq2d 6107 . . . . . 6 (𝜑 → (Clsd‘𝐽) = (Clsd‘{𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )}))
8280, 81eqtr4d 2647 . . . . 5 (𝜑 → dom (𝐹 ∩ I ) = (Clsd‘𝐽))
8382fveq2d 6107 . . . 4 (𝜑 → (mrCls‘dom (𝐹 ∩ I )) = (mrCls‘(Clsd‘𝐽)))
8479, 83eqtr4d 2647 . . 3 (𝜑 → (cls‘𝐽) = (mrCls‘dom (𝐹 ∩ I )))
857, 2, 17, 30, 31ismrcd2 36280 . . 3 (𝜑𝐹 = (mrCls‘dom (𝐹 ∩ I )))
8684, 85eqtr4d 2647 . 2 (𝜑 → (cls‘𝐽) = 𝐹)
8774, 86jca 553 1 (𝜑 → (𝐽 ∈ (TopOn‘𝐵) ∧ (cls‘𝐽) = 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  {crab 2900  cdif 3537  cun 3538  cin 3539  wss 3540  c0 3874  𝒫 cpw 4108   I cid 4948  dom cdm 5038   Fn wfn 5799  wf 5800  cfv 5804  mrClscmrc 16066  Topctop 20517  TopOnctopon 20518  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-mre 16069  df-mrc 16070  df-top 20521  df-topon 20523  df-cld 20633  df-cls 20635
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator