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 23332
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 23330 . 2 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Fre ↔ ∀𝑥𝑋𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
2 toponmax 22909 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
3 eleq2 2828 . . . . . . . . 9 (𝑜 = 𝑋 → (𝑥𝑜𝑥𝑋))
43intminss 4904 . . . . . . . 8 ((𝑋𝐽𝑥𝑋) → {𝑜𝐽𝑥𝑜} ⊆ 𝑋)
52, 4sylan 586 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → {𝑜𝐽𝑥𝑜} ⊆ 𝑋)
65sselda 3915 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) ∧ 𝑦 {𝑜𝐽𝑥𝑜}) → 𝑦𝑋)
7 biimt 361 . . . . . 6 (𝑦𝑋 → (𝑦 ∈ {𝑥} ↔ (𝑦𝑋𝑦 ∈ {𝑥})))
86, 7syl 17 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) ∧ 𝑦 {𝑜𝐽𝑥𝑜}) → (𝑦 ∈ {𝑥} ↔ (𝑦𝑋𝑦 ∈ {𝑥})))
98ralbidva 3160 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → (∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥})))
10 id 22 . . . . . . . . 9 (𝑥𝑜𝑥𝑜)
1110rgenw 3057 . . . . . . . 8 𝑜𝐽 (𝑥𝑜𝑥𝑜)
12 vex 3435 . . . . . . . . 9 𝑥 ∈ V
1312elintrab 4890 . . . . . . . 8 (𝑥 {𝑜𝐽𝑥𝑜} ↔ ∀𝑜𝐽 (𝑥𝑜𝑥𝑜))
1411, 13mpbir 232 . . . . . . 7 𝑥 {𝑜𝐽𝑥𝑜}
15 snssi 4717 . . . . . . 7 (𝑥 {𝑜𝐽𝑥𝑜} → {𝑥} ⊆ {𝑜𝐽𝑥𝑜})
1614, 15ax-mp 5 . . . . . 6 {𝑥} ⊆ {𝑜𝐽𝑥𝑜}
17 eqss 3930 . . . . . 6 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ( {𝑜𝐽𝑥𝑜} ⊆ {𝑥} ∧ {𝑥} ⊆ {𝑜𝐽𝑥𝑜}))
1816, 17mpbiran2 716 . . . . 5 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ {𝑜𝐽𝑥𝑜} ⊆ {𝑥})
19 dfss3 3904 . . . . 5 ( {𝑜𝐽𝑥𝑜} ⊆ {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥})
2018, 19bitri 276 . . . 4 ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑦 {𝑜𝐽𝑥𝑜}𝑦 ∈ {𝑥})
21 vex 3435 . . . . . . . 8 𝑦 ∈ V
2221elintrab 4890 . . . . . . 7 (𝑦 {𝑜𝐽𝑥𝑜} ↔ ∀𝑜𝐽 (𝑥𝑜𝑦𝑜))
23 velsn 4571 . . . . . . . 8 (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥)
24 equcom 2025 . . . . . . . 8 (𝑦 = 𝑥𝑥 = 𝑦)
2523, 24bitri 276 . . . . . . 7 (𝑦 ∈ {𝑥} ↔ 𝑥 = 𝑦)
2622, 25imbi12i 351 . . . . . 6 ((𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦))
2726ralbii 3085 . . . . 5 (∀𝑦𝑋 (𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ ∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦))
28 ralcom3 3089 . . . . 5 (∀𝑦𝑋 (𝑦 {𝑜𝐽𝑥𝑜} → 𝑦 ∈ {𝑥}) ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥}))
2927, 28bitr3i 278 . . . 4 (∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦) ↔ ∀𝑦 {𝑜𝐽𝑥𝑜} (𝑦𝑋𝑦 ∈ {𝑥}))
309, 20, 293bitr4g 315 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥𝑋) → ( {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
3130ralbidva 3160 . 2 (𝐽 ∈ (TopOn‘𝑋) → (∀𝑥𝑋 {𝑜𝐽𝑥𝑜} = {𝑥} ↔ ∀𝑥𝑋𝑦𝑋 (∀𝑜𝐽 (𝑥𝑜𝑦𝑜) → 𝑥 = 𝑦)))
321, 31bitr4d 283 1 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Fre ↔ ∀𝑥𝑋 {𝑜𝐽𝑥𝑜} = {𝑥}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wral 3053  {crab 3391  wss 3883  {csn 4555   cint 4877  cfv 6485  TopOnctopon 22893  Frect1 23290
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-iota 6441  df-fun 6487  df-fv 6493  df-topgen 17397  df-top 22877  df-topon 22894  df-cld 23002  df-t1 23297
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator