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 22500
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 22498 . 2 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Fre ↔ ∀𝑥𝑋𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
2 toponmax 22075 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
3 eleq2 2827 . . . . . . . . 9 (𝑜 = 𝑋 → (𝑥𝑜𝑥𝑋))
43intminss 4905 . . . . . . . 8 ((𝑋𝐽𝑥𝑋) → {𝑜𝐽𝑥𝑜} ⊆ 𝑋)
52, 4sylan 580 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → {𝑜𝐽𝑥𝑜} ⊆ 𝑋)
65sselda 3921 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) ∧ 𝑦 {𝑜𝐽𝑥𝑜}) → 𝑦𝑋)
7 biimt 361 . . . . . 6 (𝑦𝑋 → (𝑦 ∈ {𝑥} ↔ (𝑦𝑋𝑦 ∈ {𝑥})))
86, 7syl 17 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) ∧ 𝑦 {𝑜𝐽𝑥𝑜}) → (𝑦 ∈ {𝑥} ↔ (𝑦𝑋𝑦 ∈ {𝑥})))
98ralbidva 3111 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → (∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥})))
10 id 22 . . . . . . . . 9 (𝑥𝑜𝑥𝑜)
1110rgenw 3076 . . . . . . . 8 𝑜𝐽 (𝑥𝑜𝑥𝑜)
12 vex 3436 . . . . . . . . 9 𝑥 ∈ V
1312elintrab 4891 . . . . . . . 8 (𝑥 {𝑜𝐽𝑥𝑜} ↔ ∀𝑜𝐽 (𝑥𝑜𝑥𝑜))
1411, 13mpbir 230 . . . . . . 7 𝑥 {𝑜𝐽𝑥𝑜}
15 snssi 4741 . . . . . . 7 (𝑥 {𝑜𝐽𝑥𝑜} → {𝑥} ⊆ {𝑜𝐽𝑥𝑜})
1614, 15ax-mp 5 . . . . . 6 {𝑥} ⊆ {𝑜𝐽𝑥𝑜}
17 eqss 3936 . . . . . 6 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ( {𝑜𝐽𝑥𝑜} ⊆ {𝑥} ∧ {𝑥} ⊆ {𝑜𝐽𝑥𝑜}))
1816, 17mpbiran2 707 . . . . 5 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ {𝑜𝐽𝑥𝑜} ⊆ {𝑥})
19 dfss3 3909 . . . . 5 ( {𝑜𝐽𝑥𝑜} ⊆ {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥})
2018, 19bitri 274 . . . 4 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥})
21 vex 3436 . . . . . . . 8 𝑦 ∈ V
2221elintrab 4891 . . . . . . 7 (𝑦 {𝑜𝐽𝑥𝑜} ↔ ∀𝑜𝐽 (𝑥𝑜𝑦𝑜))
23 velsn 4577 . . . . . . . 8 (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥)
24 equcom 2021 . . . . . . . 8 (𝑦 = 𝑥𝑥 = 𝑦)
2523, 24bitri 274 . . . . . . 7 (𝑦 ∈ {𝑥} ↔ 𝑥 = 𝑦)
2622, 25imbi12i 351 . . . . . 6 ((𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦))
2726ralbii 3092 . . . . 5 (∀𝑦𝑋 (𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ ∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦))
28 ralcom3 3291 . . . . 5 (∀𝑦𝑋 (𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥}))
2927, 28bitr3i 276 . . . 4 (∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦) ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥}))
309, 20, 293bitr4g 314 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
3130ralbidva 3111 . 2 (𝐽 ∈ (TopOn‘𝑋) → (∀𝑥𝑋 {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑥𝑋𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
321, 31bitr4d 281 1 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Fre ↔ ∀𝑥𝑋 {𝑜𝐽𝑥𝑜} = {𝑥}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wral 3064  {crab 3068  wss 3887  {csn 4561   cint 4879  cfv 6433  TopOnctopon 22059  Frect1 22458
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-iota 6391  df-fun 6435  df-fv 6441  df-topgen 17154  df-top 22043  df-topon 22060  df-cld 22170  df-t1 22465
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator