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

Theorem r0sep 24094
Description: The separation property of an R0 space. (Contributed by Mario Carneiro, 25-Aug-2015.)
Assertion
Ref Expression
r0sep (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 ↔ 𝐵 ∈ 𝑜)))
Distinct variable groups:   𝐴,𝑜   𝐵,𝑜   𝑜,𝐽   𝑜,𝑋

Proof of Theorem r0sep
Dummy variables 𝑥 𝑦 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2763 . . . 4 (𝑧 ∈ 𝑋 ↦ {𝑤 ∈ 𝐽 ∣ 𝑧 ∈ 𝑤}) = (𝑧 ∈ 𝑋 ↦ {𝑤 ∈ 𝐽 ∣ 𝑧 ∈ 𝑤})
21isr0 24083 . . 3 (𝐽 ∈ (TopOn‘𝑋) → ((KQ‘𝐽) ∈ Fre ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜))))
32biimpa 482 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)))
4 eleq1 2852 . . . . . 6 (𝑥 = 𝐴 → (𝑥 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜))
54imbi1d 344 . . . . 5 (𝑥 = 𝐴 → ((𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜)))
65ralbidv 3189 . . . 4 (𝑥 = 𝐴 → (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜)))
74bibi1d 346 . . . . 5 (𝑥 = 𝐴 → ((𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ (𝐴 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)))
87ralbidv 3189 . . . 4 (𝑥 = 𝐴 → (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)))
96, 8imbi12d 347 . . 3 (𝑥 = 𝐴 → ((∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)) ↔ (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) → ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜))))
10 eleq1 2852 . . . . . 6 (𝑦 = 𝐵 → (𝑦 ∈ 𝑜 ↔ 𝐵 ∈ 𝑜))
1110imbi2d 343 . . . . 5 (𝑦 = 𝐵 → ((𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜)))
1211ralbidv 3189 . . . 4 (𝑦 = 𝐵 → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜)))
1310bibi2d 345 . . . . 5 (𝑦 = 𝐵 → ((𝐴 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ (𝐴 ∈ 𝑜 ↔ 𝐵 ∈ 𝑜)))
1413ralbidv 3189 . . . 4 (𝑦 = 𝐵 → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 ↔ 𝐵 ∈ 𝑜)))
1512, 14imbi12d 347 . . 3 (𝑦 = 𝐵 → ((∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) → ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)) ↔ (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 ↔ 𝐵 ∈ 𝑜))))
169, 15rspc2v 3590 . 2 ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 ↔ 𝐵 ∈ 𝑜))))
173, 16mpan9 516 1 (((𝐽 ∈ (TopOn‘𝑋) ∧ (KQ‘𝐽) ∈ Fre) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 ↔ 𝐵 ∈ 𝑜)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ↦ cmpt 5189  ‘cfv 6555  TopOnctopon 23255  Frect1 23652  KQckq 24039
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-map 8874  df-topgen 17640  df-qtop 17705  df-top 23239  df-topon 23256  df-cld 23364  df-cn 23572  df-t1 23659  df-kq 24040
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator