MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  neiptopreu Structured version   Visualization version   GIF version

Theorem neiptopreu 21345
Description: If, to each element 𝑃 of a set 𝑋, we associate a set (𝑁𝑃) fulfilling Properties Vi, Vii, Viii and Property Viv of [BourbakiTop1] p. I.2. , corresponding to ssnei 21322, innei 21337, elnei 21323 and neissex 21339, then there is a unique topology 𝑗 such that for any point 𝑝, (𝑁𝑝) is the set of neighborhoods of 𝑝. Proposition 2 of [BourbakiTop1] p. I.3. This can be used to build a topology from a set of neighborhoods. Note that innei 21337 uses binary intersections whereas Property Vii mentions finite intersections (which includes the empty intersection of subsets of 𝑋, which is equal to 𝑋), so we add the hypothesis that 𝑋 is a neighborhood of all points. TODO: when df-fi 8605 includes the empty intersection, remove that extra hypothesis. (Contributed by Thierry Arnoux, 6-Jan-2018.)
Hypotheses
Ref Expression
neiptop.o 𝐽 = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝𝑎 𝑎 ∈ (𝑁𝑝)}
neiptop.0 (𝜑𝑁:𝑋⟶𝒫 𝒫 𝑋)
neiptop.1 ((((𝜑𝑝𝑋) ∧ 𝑎𝑏𝑏𝑋) ∧ 𝑎 ∈ (𝑁𝑝)) → 𝑏 ∈ (𝑁𝑝))
neiptop.2 ((𝜑𝑝𝑋) → (fi‘(𝑁𝑝)) ⊆ (𝑁𝑝))
neiptop.3 (((𝜑𝑝𝑋) ∧ 𝑎 ∈ (𝑁𝑝)) → 𝑝𝑎)
neiptop.4 (((𝜑𝑝𝑋) ∧ 𝑎 ∈ (𝑁𝑝)) → ∃𝑏 ∈ (𝑁𝑝)∀𝑞𝑏 𝑎 ∈ (𝑁𝑞))
neiptop.5 ((𝜑𝑝𝑋) → 𝑋 ∈ (𝑁𝑝))
Assertion
Ref Expression
neiptopreu (𝜑 → ∃!𝑗 ∈ (TopOn‘𝑋)𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})))
Distinct variable groups:   𝑝,𝑎,𝑁   𝑋,𝑎,𝑏,𝑝   𝐽,𝑎,𝑝   𝑋,𝑝   𝜑,𝑝   𝑁,𝑏   𝑋,𝑏   𝜑,𝑎,𝑏,𝑞,𝑝   𝑁,𝑝,𝑞   𝑋,𝑞   𝜑,𝑞   𝑗,𝑎,𝑏,𝐽,𝑝   𝑗,𝑞,𝑁   𝑗,𝑋   𝜑,𝑗
Allowed substitution hint:   𝐽(𝑞)

Proof of Theorem neiptopreu
StepHypRef Expression
1 neiptop.o . . . . 5 𝐽 = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝𝑎 𝑎 ∈ (𝑁𝑝)}
2 neiptop.0 . . . . 5 (𝜑𝑁:𝑋⟶𝒫 𝒫 𝑋)
3 neiptop.1 . . . . 5 ((((𝜑𝑝𝑋) ∧ 𝑎𝑏𝑏𝑋) ∧ 𝑎 ∈ (𝑁𝑝)) → 𝑏 ∈ (𝑁𝑝))
4 neiptop.2 . . . . 5 ((𝜑𝑝𝑋) → (fi‘(𝑁𝑝)) ⊆ (𝑁𝑝))
5 neiptop.3 . . . . 5 (((𝜑𝑝𝑋) ∧ 𝑎 ∈ (𝑁𝑝)) → 𝑝𝑎)
6 neiptop.4 . . . . 5 (((𝜑𝑝𝑋) ∧ 𝑎 ∈ (𝑁𝑝)) → ∃𝑏 ∈ (𝑁𝑝)∀𝑞𝑏 𝑎 ∈ (𝑁𝑞))
7 neiptop.5 . . . . 5 ((𝜑𝑝𝑋) → 𝑋 ∈ (𝑁𝑝))
81, 2, 3, 4, 5, 6, 7neiptoptop 21343 . . . 4 (𝜑𝐽 ∈ Top)
9 eqid 2777 . . . . 5 𝐽 = 𝐽
109toptopon 21129 . . . 4 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘ 𝐽))
118, 10sylib 210 . . 3 (𝜑𝐽 ∈ (TopOn‘ 𝐽))
121, 2, 3, 4, 5, 6, 7neiptopuni 21342 . . . 4 (𝜑𝑋 = 𝐽)
1312fveq2d 6450 . . 3 (𝜑 → (TopOn‘𝑋) = (TopOn‘ 𝐽))
1411, 13eleqtrrd 2861 . 2 (𝜑𝐽 ∈ (TopOn‘𝑋))
151, 2, 3, 4, 5, 6, 7neiptopnei 21344 . 2 (𝜑𝑁 = (𝑝𝑋 ↦ ((nei‘𝐽)‘{𝑝})))
16 nfv 1957 . . . . . . . . . 10 𝑝(𝜑𝑗 ∈ (TopOn‘𝑋))
17 nfmpt1 4982 . . . . . . . . . . 11 𝑝(𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))
1817nfeq2 2948 . . . . . . . . . 10 𝑝 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))
1916, 18nfan 1946 . . . . . . . . 9 𝑝((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})))
20 nfv 1957 . . . . . . . . 9 𝑝 𝑏𝑋
2119, 20nfan 1946 . . . . . . . 8 𝑝(((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑋)
22 simpllr 766 . . . . . . . . . . 11 (((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑋) ∧ 𝑝𝑏) → 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})))
23 simpr 479 . . . . . . . . . . . 12 ((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑋) → 𝑏𝑋)
2423sselda 3820 . . . . . . . . . . 11 (((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑋) ∧ 𝑝𝑏) → 𝑝𝑋)
25 id 22 . . . . . . . . . . . 12 (𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})) → 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})))
26 fvexd 6461 . . . . . . . . . . . 12 ((𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})) ∧ 𝑝𝑋) → ((nei‘𝑗)‘{𝑝}) ∈ V)
2725, 26fvmpt2d 6554 . . . . . . . . . . 11 ((𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})) ∧ 𝑝𝑋) → (𝑁𝑝) = ((nei‘𝑗)‘{𝑝}))
2822, 24, 27syl2anc 579 . . . . . . . . . 10 (((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑋) ∧ 𝑝𝑏) → (𝑁𝑝) = ((nei‘𝑗)‘{𝑝}))
2928eqcomd 2783 . . . . . . . . 9 (((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑋) ∧ 𝑝𝑏) → ((nei‘𝑗)‘{𝑝}) = (𝑁𝑝))
3029eleq2d 2844 . . . . . . . 8 (((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑋) ∧ 𝑝𝑏) → (𝑏 ∈ ((nei‘𝑗)‘{𝑝}) ↔ 𝑏 ∈ (𝑁𝑝)))
3121, 30ralbida 3163 . . . . . . 7 ((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑋) → (∀𝑝𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝}) ↔ ∀𝑝𝑏 𝑏 ∈ (𝑁𝑝)))
3231pm5.32da 574 . . . . . 6 (((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → ((𝑏𝑋 ∧ ∀𝑝𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝})) ↔ (𝑏𝑋 ∧ ∀𝑝𝑏 𝑏 ∈ (𝑁𝑝))))
33 simpllr 766 . . . . . . . . 9 ((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑗) → 𝑗 ∈ (TopOn‘𝑋))
34 simpr 479 . . . . . . . . 9 ((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑗) → 𝑏𝑗)
35 toponss 21139 . . . . . . . . 9 ((𝑗 ∈ (TopOn‘𝑋) ∧ 𝑏𝑗) → 𝑏𝑋)
3633, 34, 35syl2anc 579 . . . . . . . 8 ((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑗) → 𝑏𝑋)
37 topontop 21125 . . . . . . . . . . 11 (𝑗 ∈ (TopOn‘𝑋) → 𝑗 ∈ Top)
3837ad2antlr 717 . . . . . . . . . 10 (((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → 𝑗 ∈ Top)
39 opnnei 21332 . . . . . . . . . 10 (𝑗 ∈ Top → (𝑏𝑗 ↔ ∀𝑝𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝})))
4038, 39syl 17 . . . . . . . . 9 (((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → (𝑏𝑗 ↔ ∀𝑝𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝})))
4140biimpa 470 . . . . . . . 8 ((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑗) → ∀𝑝𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝}))
4236, 41jca 507 . . . . . . 7 ((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏𝑗) → (𝑏𝑋 ∧ ∀𝑝𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝})))
4340biimpar 471 . . . . . . . 8 ((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ ∀𝑝𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝})) → 𝑏𝑗)
4443adantrl 706 . . . . . . 7 ((((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ (𝑏𝑋 ∧ ∀𝑝𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝}))) → 𝑏𝑗)
4542, 44impbida 791 . . . . . 6 (((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → (𝑏𝑗 ↔ (𝑏𝑋 ∧ ∀𝑝𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝}))))
461neipeltop 21341 . . . . . . 7 (𝑏𝐽 ↔ (𝑏𝑋 ∧ ∀𝑝𝑏 𝑏 ∈ (𝑁𝑝)))
4746a1i 11 . . . . . 6 (((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → (𝑏𝐽 ↔ (𝑏𝑋 ∧ ∀𝑝𝑏 𝑏 ∈ (𝑁𝑝))))
4832, 45, 473bitr4d 303 . . . . 5 (((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → (𝑏𝑗𝑏𝐽))
4948eqrdv 2775 . . . 4 (((𝜑𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → 𝑗 = 𝐽)
5049ex 403 . . 3 ((𝜑𝑗 ∈ (TopOn‘𝑋)) → (𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})) → 𝑗 = 𝐽))
5150ralrimiva 3147 . 2 (𝜑 → ∀𝑗 ∈ (TopOn‘𝑋)(𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})) → 𝑗 = 𝐽))
52 simpl 476 . . . . . . 7 ((𝑗 = 𝐽𝑝𝑋) → 𝑗 = 𝐽)
5352fveq2d 6450 . . . . . 6 ((𝑗 = 𝐽𝑝𝑋) → (nei‘𝑗) = (nei‘𝐽))
5453fveq1d 6448 . . . . 5 ((𝑗 = 𝐽𝑝𝑋) → ((nei‘𝑗)‘{𝑝}) = ((nei‘𝐽)‘{𝑝}))
5554mpteq2dva 4979 . . . 4 (𝑗 = 𝐽 → (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})) = (𝑝𝑋 ↦ ((nei‘𝐽)‘{𝑝})))
5655eqeq2d 2787 . . 3 (𝑗 = 𝐽 → (𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})) ↔ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝐽)‘{𝑝}))))
5756eqreu 3609 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑁 = (𝑝𝑋 ↦ ((nei‘𝐽)‘{𝑝})) ∧ ∀𝑗 ∈ (TopOn‘𝑋)(𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})) → 𝑗 = 𝐽)) → ∃!𝑗 ∈ (TopOn‘𝑋)𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})))
5814, 15, 51, 57syl3anc 1439 1 (𝜑 → ∃!𝑗 ∈ (TopOn‘𝑋)𝑁 = (𝑝𝑋 ↦ ((nei‘𝑗)‘{𝑝})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wa 386  w3a 1071   = wceq 1601  wcel 2106  wral 3089  wrex 3090  ∃!wreu 3091  {crab 3093  Vcvv 3397  wss 3791  𝒫 cpw 4378  {csn 4397   cuni 4671  cmpt 4965  wf 6131  cfv 6135  ficfi 8604  Topctop 21105  TopOnctopon 21122  neicnei 21309
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2054  ax-8 2108  ax-9 2115  ax-10 2134  ax-11 2149  ax-12 2162  ax-13 2333  ax-ext 2753  ax-rep 5006  ax-sep 5017  ax-nul 5025  ax-pow 5077  ax-pr 5138  ax-un 7226
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3or 1072  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2550  df-eu 2586  df-clab 2763  df-cleq 2769  df-clel 2773  df-nfc 2920  df-ne 2969  df-ral 3094  df-rex 3095  df-reu 3096  df-rab 3098  df-v 3399  df-sbc 3652  df-csb 3751  df-dif 3794  df-un 3796  df-in 3798  df-ss 3805  df-pss 3807  df-nul 4141  df-if 4307  df-pw 4380  df-sn 4398  df-pr 4400  df-tp 4402  df-op 4404  df-uni 4672  df-int 4711  df-iun 4755  df-br 4887  df-opab 4949  df-mpt 4966  df-tr 4988  df-id 5261  df-eprel 5266  df-po 5274  df-so 5275  df-fr 5314  df-we 5316  df-xp 5361  df-rel 5362  df-cnv 5363  df-co 5364  df-dm 5365  df-rn 5366  df-res 5367  df-ima 5368  df-pred 5933  df-ord 5979  df-on 5980  df-lim 5981  df-suc 5982  df-iota 6099  df-fun 6137  df-fn 6138  df-f 6139  df-f1 6140  df-fo 6141  df-f1o 6142  df-fv 6143  df-ov 6925  df-oprab 6926  df-mpt2 6927  df-om 7344  df-wrecs 7689  df-recs 7751  df-rdg 7789  df-1o 7843  df-oadd 7847  df-er 8026  df-en 8242  df-fin 8245  df-fi 8605  df-top 21106  df-topon 21123  df-ntr 21232  df-nei 21310
This theorem is referenced by:  ustuqtop  22458
  Copyright terms: Public domain W3C validator