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

Theorem ist1-3 23378
Description: A space is T1 iff every point is the only point in the intersection of all open sets containing that point. (Contributed by Jeff Hankins, 31-Jan-2010.) (Proof shortened by Mario Carneiro, 24-Aug-2015.)
Assertion
Ref Expression
ist1-3 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Fre ↔ ∀𝑥𝑋 {𝑜𝐽𝑥𝑜} = {𝑥}))
Distinct variable groups:   𝑥,𝑜,𝐽   𝑜,𝑋,𝑥

Proof of Theorem ist1-3
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ist1-2 23376 . 2 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Fre ↔ ∀𝑥𝑋𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
2 toponmax 22953 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
3 eleq2 2833 . . . . . . . . 9 (𝑜 = 𝑋 → (𝑥𝑜𝑥𝑋))
43intminss 4998 . . . . . . . 8 ((𝑋𝐽𝑥𝑋) → {𝑜𝐽𝑥𝑜} ⊆ 𝑋)
52, 4sylan 579 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → {𝑜𝐽𝑥𝑜} ⊆ 𝑋)
65sselda 4008 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) ∧ 𝑦 {𝑜𝐽𝑥𝑜}) → 𝑦𝑋)
7 biimt 360 . . . . . 6 (𝑦𝑋 → (𝑦 ∈ {𝑥} ↔ (𝑦𝑋𝑦 ∈ {𝑥})))
86, 7syl 17 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) ∧ 𝑦 {𝑜𝐽𝑥𝑜}) → (𝑦 ∈ {𝑥} ↔ (𝑦𝑋𝑦 ∈ {𝑥})))
98ralbidva 3182 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → (∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥})))
10 id 22 . . . . . . . . 9 (𝑥𝑜𝑥𝑜)
1110rgenw 3071 . . . . . . . 8 𝑜𝐽 (𝑥𝑜𝑥𝑜)
12 vex 3492 . . . . . . . . 9 𝑥 ∈ V
1312elintrab 4984 . . . . . . . 8 (𝑥 {𝑜𝐽𝑥𝑜} ↔ ∀𝑜𝐽 (𝑥𝑜𝑥𝑜))
1411, 13mpbir 231 . . . . . . 7 𝑥 {𝑜𝐽𝑥𝑜}
15 snssi 4833 . . . . . . 7 (𝑥 {𝑜𝐽𝑥𝑜} → {𝑥} ⊆ {𝑜𝐽𝑥𝑜})
1614, 15ax-mp 5 . . . . . 6 {𝑥} ⊆ {𝑜𝐽𝑥𝑜}
17 eqss 4024 . . . . . 6 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ( {𝑜𝐽𝑥𝑜} ⊆ {𝑥} ∧ {𝑥} ⊆ {𝑜𝐽𝑥𝑜}))
1816, 17mpbiran2 709 . . . . 5 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ {𝑜𝐽𝑥𝑜} ⊆ {𝑥})
19 dfss3 3997 . . . . 5 ( {𝑜𝐽𝑥𝑜} ⊆ {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥})
2018, 19bitri 275 . . . 4 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥})
21 vex 3492 . . . . . . . 8 𝑦 ∈ V
2221elintrab 4984 . . . . . . 7 (𝑦 {𝑜𝐽𝑥𝑜} ↔ ∀𝑜𝐽 (𝑥𝑜𝑦𝑜))
23 velsn 4664 . . . . . . . 8 (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥)
24 equcom 2017 . . . . . . . 8 (𝑦 = 𝑥𝑥 = 𝑦)
2523, 24bitri 275 . . . . . . 7 (𝑦 ∈ {𝑥} ↔ 𝑥 = 𝑦)
2622, 25imbi12i 350 . . . . . 6 ((𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦))
2726ralbii 3099 . . . . 5 (∀𝑦𝑋 (𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ ∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦))
28 ralcom3 3103 . . . . 5 (∀𝑦𝑋 (𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥}))
2927, 28bitr3i 277 . . . 4 (∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦) ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥}))
309, 20, 293bitr4g 314 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
3130ralbidva 3182 . 2 (𝐽 ∈ (TopOn‘𝑋) → (∀𝑥𝑋 {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑥𝑋𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
321, 31bitr4d 282 1 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Fre ↔ ∀𝑥𝑋 {𝑜𝐽𝑥𝑜} = {𝑥}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  wral 3067  {crab 3443  wss 3976  {csn 4648   cint 4970  cfv 6573  TopOnctopon 22937  Frect1 23336
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fv 6581  df-topgen 17503  df-top 22921  df-topon 22938  df-cld 23048  df-t1 23343
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator