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 23471
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 23469 . 2 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Fre ↔ ∀𝑥𝑋𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
2 toponmax 23048 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
3 eleq2 2858 . . . . . . . . 9 (𝑜 = 𝑋 → (𝑥𝑜𝑥𝑋))
43intminss 4940 . . . . . . . 8 ((𝑋𝐽𝑥𝑋) → {𝑜𝐽𝑥𝑜} ⊆ 𝑋)
52, 4sylan 591 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → {𝑜𝐽𝑥𝑜} ⊆ 𝑋)
65sselda 3945 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) ∧ 𝑦 {𝑜𝐽𝑥𝑜}) → 𝑦𝑋)
7 biimt 363 . . . . . 6 (𝑦𝑋 → (𝑦 ∈ {𝑥} ↔ (𝑦𝑋𝑦 ∈ {𝑥})))
86, 7syl 18 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) ∧ 𝑦 {𝑜𝐽𝑥𝑜}) → (𝑦 ∈ {𝑥} ↔ (𝑦𝑋𝑦 ∈ {𝑥})))
98ralbidva 3192 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → (∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥})))
10 id 23 . . . . . . . . 9 (𝑥𝑜𝑥𝑜)
1110rgenw 3089 . . . . . . . 8 𝑜𝐽 (𝑥𝑜𝑥𝑜)
12 vex 3467 . . . . . . . . 9 𝑥 ∈ V
1312elintrab 4926 . . . . . . . 8 (𝑥 {𝑜𝐽𝑥𝑜} ↔ ∀𝑜𝐽 (𝑥𝑜𝑥𝑜))
1411, 13mpbir 234 . . . . . . 7 𝑥 {𝑜𝐽𝑥𝑜}
15 snssi 4753 . . . . . . 7 (𝑥 {𝑜𝐽𝑥𝑜} → {𝑥} ⊆ {𝑜𝐽𝑥𝑜})
1614, 15ax-mp 5 . . . . . 6 {𝑥} ⊆ {𝑜𝐽𝑥𝑜}
17 eqss 3960 . . . . . 6 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ( {𝑜𝐽𝑥𝑜} ⊆ {𝑥} ∧ {𝑥} ⊆ {𝑜𝐽𝑥𝑜}))
1816, 17mpbiran2 722 . . . . 5 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ {𝑜𝐽𝑥𝑜} ⊆ {𝑥})
19 dfss3 3934 . . . . 5 ( {𝑜𝐽𝑥𝑜} ⊆ {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥})
2018, 19bitri 278 . . . 4 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥})
21 vex 3467 . . . . . . . 8 𝑦 ∈ V
2221elintrab 4926 . . . . . . 7 (𝑦 {𝑜𝐽𝑥𝑜} ↔ ∀𝑜𝐽 (𝑥𝑜𝑦𝑜))
23 velsn 4607 . . . . . . . 8 (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥)
24 equcom 2045 . . . . . . . 8 (𝑦 = 𝑥𝑥 = 𝑦)
2523, 24bitri 278 . . . . . . 7 (𝑦 ∈ {𝑥} ↔ 𝑥 = 𝑦)
2622, 25imbi12i 353 . . . . . 6 ((𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦))
2726ralbii 3117 . . . . 5 (∀𝑦𝑋 (𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ ∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦))
28 ralcom3 3121 . . . . 5 (∀𝑦𝑋 (𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥}))
2927, 28bitr3i 280 . . . 4 (∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦) ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥}))
309, 20, 293bitr4g 317 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
3130ralbidva 3192 . 2 (𝐽 ∈ (TopOn‘𝑋) → (∀𝑥𝑋 {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑥𝑋𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
321, 31bitr4d 285 1 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Fre ↔ ∀𝑥𝑋 {𝑜𝐽𝑥𝑜} = {𝑥}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  wral 3085  {crab 3423  wss 3913  {csn 4591   cint 4913  cfv 6533  TopOnctopon 23032  Frect1 23429
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-int 4914  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6489  df-fun 6535  df-fv 6541  df-topgen 17492  df-top 23016  df-topon 23033  df-cld 23141  df-t1 23436
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator