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 43411
Description: A closure function which satisfies sscls 23194, clsidm 23205, cls0 23218, and clsun 36817 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 6708 . . . . . . . 8 (𝜑𝐹 Fn 𝒫 𝐵)
43adantr 485 . . . . . . 7 ((𝜑𝑧 ∈ 𝒫 𝐵) → 𝐹 Fn 𝒫 𝐵)
5 difss 4091 . . . . . . . . 9 (𝐵𝑧) ⊆ 𝐵
6 istopclsd.b . . . . . . . . . 10 (𝜑𝐵𝑉)
7 elpw2g 5305 . . . . . . . . . 10 (𝐵𝑉 → ((𝐵𝑧) ∈ 𝒫 𝐵 ↔ (𝐵𝑧) ⊆ 𝐵))
86, 7syl 18 . . . . . . . . 9 (𝜑 → ((𝐵𝑧) ∈ 𝒫 𝐵 ↔ (𝐵𝑧) ⊆ 𝐵))
95, 8mpbiri 261 . . . . . . . 8 (𝜑 → (𝐵𝑧) ∈ 𝒫 𝐵)
109adantr 485 . . . . . . 7 ((𝜑𝑧 ∈ 𝒫 𝐵) → (𝐵𝑧) ∈ 𝒫 𝐵)
11 fnelfp 7175 . . . . . . 7 ((𝐹 Fn 𝒫 𝐵 ∧ (𝐵𝑧) ∈ 𝒫 𝐵) → ((𝐵𝑧) ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘(𝐵𝑧)) = (𝐵𝑧)))
124, 10, 11syl2anc 595 . . . . . 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 3948 . . . . . . . . 9 ((𝜑𝑥𝐵𝑦𝑥) → 𝑦𝐵)
21 istopclsd.u . . . . . . . . 9 ((𝜑𝑥𝐵𝑦𝐵) → (𝐹‘(𝑥𝑦)) = ((𝐹𝑥) ∪ (𝐹𝑦)))
2217, 18, 20, 21syl3anc 1398 . . . . . . . 8 ((𝜑𝑥𝐵𝑦𝑥) → (𝐹‘(𝑥𝑦)) = ((𝐹𝑥) ∪ (𝐹𝑦)))
23 ssequn2 4143 . . . . . . . . . . 11 (𝑦𝑥 ↔ (𝑥𝑦) = 𝑥)
2423biimpi 219 . . . . . . . . . 10 (𝑦𝑥 → (𝑥𝑦) = 𝑥)
25243ad2ant3 1153 . . . . . . . . 9 ((𝜑𝑥𝐵𝑦𝑥) → (𝑥𝑦) = 𝑥)
2625fveq2d 6887 . . . . . . . 8 ((𝜑𝑥𝐵𝑦𝑥) → (𝐹‘(𝑥𝑦)) = (𝐹𝑥))
2722, 26eqtr3d 2800 . . . . . . 7 ((𝜑𝑥𝐵𝑦𝑥) → ((𝐹𝑥) ∪ (𝐹𝑦)) = (𝐹𝑥))
28 ssequn2 4143 . . . . . . 7 ((𝐹𝑦) ⊆ (𝐹𝑥) ↔ ((𝐹𝑥) ∪ (𝐹𝑦)) = (𝐹𝑥))
2927, 28sylibr 237 . . . . . 6 ((𝜑𝑥𝐵𝑦𝑥) → (𝐹𝑦) ⊆ (𝐹𝑥))
30 istopclsd.i . . . . . 6 ((𝜑𝑥𝐵) → (𝐹‘(𝐹𝑥)) = (𝐹𝑥))
316, 2, 16, 29, 30ismrcd1 43409 . . . . 5 (𝜑 → dom (𝐹 ∩ I ) ∈ (Moore‘𝐵))
32 istopclsd.z . . . . . 6 (𝜑 → (𝐹‘∅) = ∅)
33 0elpw 5328 . . . . . . 7 ∅ ∈ 𝒫 𝐵
34 fnelfp 7175 . . . . . . 7 ((𝐹 Fn 𝒫 𝐵 ∧ ∅ ∈ 𝒫 𝐵) → (∅ ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘∅) = ∅))
353, 33, 34sylancl 597 . . . . . 6 (𝜑 → (∅ ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘∅) = ∅))
3632, 35mpbird 260 . . . . 5 (𝜑 → ∅ ∈ dom (𝐹 ∩ I ))
37 simp1 1154 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝜑)
38 inss1 4190 . . . . . . . . . . . . 13 (𝐹 ∩ I ) ⊆ 𝐹
39 dmss 5894 . . . . . . . . . . . . 13 ((𝐹 ∩ I ) ⊆ 𝐹 → dom (𝐹 ∩ I ) ⊆ dom 𝐹)
4038, 39ax-mp 5 . . . . . . . . . . . 12 dom (𝐹 ∩ I ) ⊆ dom 𝐹
4140, 2fssdm 6727 . . . . . . . . . . 11 (𝜑 → dom (𝐹 ∩ I ) ⊆ 𝒫 𝐵)
42413ad2ant1 1151 . . . . . . . . . 10 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → dom (𝐹 ∩ I ) ⊆ 𝒫 𝐵)
43 simp2 1155 . . . . . . . . . 10 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑥 ∈ dom (𝐹 ∩ I ))
4442, 43sseldd 3939 . . . . . . . . 9 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑥 ∈ 𝒫 𝐵)
4544elpwid 4572 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑥𝐵)
46 simp3 1156 . . . . . . . . . 10 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑦 ∈ dom (𝐹 ∩ I ))
4742, 46sseldd 3939 . . . . . . . . 9 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑦 ∈ 𝒫 𝐵)
4847elpwid 4572 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝑦𝐵)
4937, 45, 48, 21syl3anc 1398 . . . . . . 7 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹‘(𝑥𝑦)) = ((𝐹𝑥) ∪ (𝐹𝑦)))
5033ad2ant1 1151 . . . . . . . . . 10 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → 𝐹 Fn 𝒫 𝐵)
51 fnelfp 7175 . . . . . . . . . 10 ((𝐹 Fn 𝒫 𝐵𝑥 ∈ 𝒫 𝐵) → (𝑥 ∈ dom (𝐹 ∩ I ) ↔ (𝐹𝑥) = 𝑥))
5250, 44, 51syl2anc 595 . . . . . . . . 9 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑥 ∈ dom (𝐹 ∩ I ) ↔ (𝐹𝑥) = 𝑥))
5343, 52mpbid 235 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹𝑥) = 𝑥)
54 fnelfp 7175 . . . . . . . . . 10 ((𝐹 Fn 𝒫 𝐵𝑦 ∈ 𝒫 𝐵) → (𝑦 ∈ dom (𝐹 ∩ I ) ↔ (𝐹𝑦) = 𝑦))
5550, 47, 54syl2anc 595 . . . . . . . . 9 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑦 ∈ dom (𝐹 ∩ I ) ↔ (𝐹𝑦) = 𝑦))
5646, 55mpbid 235 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹𝑦) = 𝑦)
5753, 56uneq12d 4124 . . . . . . 7 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → ((𝐹𝑥) ∪ (𝐹𝑦)) = (𝑥𝑦))
5849, 57eqtrd 2798 . . . . . 6 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝐹‘(𝑥𝑦)) = (𝑥𝑦))
5945, 48unssd 4146 . . . . . . . 8 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑥𝑦) ⊆ 𝐵)
60 vex 3459 . . . . . . . . . 10 𝑥 ∈ V
61 vex 3459 . . . . . . . . . 10 𝑦 ∈ V
6260, 61unex 7744 . . . . . . . . 9 (𝑥𝑦) ∈ V
6362elpw 4567 . . . . . . . 8 ((𝑥𝑦) ∈ 𝒫 𝐵 ↔ (𝑥𝑦) ⊆ 𝐵)
6459, 63sylibr 237 . . . . . . 7 ((𝜑𝑥 ∈ dom (𝐹 ∩ I ) ∧ 𝑦 ∈ dom (𝐹 ∩ I )) → (𝑥𝑦) ∈ 𝒫 𝐵)
65 fnelfp 7175 . . . . . . 7 ((𝐹 Fn 𝒫 𝐵 ∧ (𝑥𝑦) ∈ 𝒫 𝐵) → ((𝑥𝑦) ∈ dom (𝐹 ∩ I ) ↔ (𝐹‘(𝑥𝑦)) = (𝑥𝑦)))
6650, 64, 65syl2anc 595 . . . . . 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 23230 . . . 4 (𝜑 → ({𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )} ∈ (TopOn‘𝐵) ∧ dom (𝐹 ∩ I ) = (Clsd‘{𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )})))
7069simpld 499 . . 3 (𝜑 → {𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )} ∈ (TopOn‘𝐵))
7115, 70eqeltrd 2863 . 2 (𝜑𝐽 ∈ (TopOn‘𝐵))
72 topontop 23051 . . . . . 6 (𝐽 ∈ (TopOn‘𝐵) → 𝐽 ∈ Top)
7371, 72syl 18 . . . . 5 (𝜑𝐽 ∈ Top)
74 eqid 2763 . . . . . 6 (mrCls‘(Clsd‘𝐽)) = (mrCls‘(Clsd‘𝐽))
7574mrccls 23217 . . . . 5 (𝐽 ∈ Top → (cls‘𝐽) = (mrCls‘(Clsd‘𝐽)))
7673, 75syl 18 . . . 4 (𝜑 → (cls‘𝐽) = (mrCls‘(Clsd‘𝐽)))
7769simprd 500 . . . . . 6 (𝜑 → dom (𝐹 ∩ I ) = (Clsd‘{𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )}))
7815fveq2d 6887 . . . . . 6 (𝜑 → (Clsd‘𝐽) = (Clsd‘{𝑧 ∈ 𝒫 𝐵 ∣ (𝐵𝑧) ∈ dom (𝐹 ∩ I )}))
7977, 78eqtr4d 2801 . . . . 5 (𝜑 → dom (𝐹 ∩ I ) = (Clsd‘𝐽))
8079fveq2d 6887 . . . 4 (𝜑 → (mrCls‘dom (𝐹 ∩ I )) = (mrCls‘(Clsd‘𝐽)))
8176, 80eqtr4d 2801 . . 3 (𝜑 → (cls‘𝐽) = (mrCls‘dom (𝐹 ∩ I )))
826, 2, 16, 29, 30ismrcd2 43410 . . 3 (𝜑𝐹 = (mrCls‘dom (𝐹 ∩ I )))
8381, 82eqtr4d 2801 . 2 (𝜑 → (cls‘𝐽) = 𝐹)
8471, 83jca 520 1 (𝜑 → (𝐽 ∈ (TopOn‘𝐵) ∧ (cls‘𝐽) = 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1103   = wceq 1570  wcel 2143  {crab 3416  cdif 3903  cun 3904  cin 3905  wss 3906  c0 4287  𝒫 cpw 4563   I cid 5557  dom cdm 5663   Fn wfn 6533  wf 6534  cfv 6538  mrClscmrc 17636  Topctop 23031  TopOnctopon 23048  Clsdccld 23154  clsccl 23156
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-iin 4960  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-mre 17639  df-mrc 17640  df-top 23032  df-topon 23049  df-cld 23157  df-cls 23159
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator