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

Theorem ist0-4 23671
Description: The topological indistinguishability map is injective iff the space is T0. (Contributed by Mario Carneiro, 25-Aug-2015.)
Hypothesis
Ref Expression
kqval.2 𝐹 = (𝑥𝑋 ↦ {𝑦𝐽𝑥𝑦})
Assertion
Ref Expression
ist0-4 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Kol2 ↔ 𝐹:𝑋1-1→V))
Distinct variable groups:   𝑥,𝑦,𝐽   𝑥,𝑋,𝑦
Allowed substitution hints:   𝐹(𝑥,𝑦)

Proof of Theorem ist0-4
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 kqval.2 . . . . . 6 𝐹 = (𝑥𝑋 ↦ {𝑦𝐽𝑥𝑦})
21kqfeq 23666 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧𝑋𝑤𝑋) → ((𝐹𝑧) = (𝐹𝑤) ↔ ∀𝑦𝐽 (𝑧𝑦𝑤𝑦)))
323expb 1120 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑧𝑋𝑤𝑋)) → ((𝐹𝑧) = (𝐹𝑤) ↔ ∀𝑦𝐽 (𝑧𝑦𝑤𝑦)))
43imbi1d 341 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑧𝑋𝑤𝑋)) → (((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤) ↔ (∀𝑦𝐽 (𝑧𝑦𝑤𝑦) → 𝑧 = 𝑤)))
542ralbidva 3196 . 2 (𝐽 ∈ (TopOn‘𝑋) → (∀𝑧𝑋𝑤𝑋 ((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤) ↔ ∀𝑧𝑋𝑤𝑋 (∀𝑦𝐽 (𝑧𝑦𝑤𝑦) → 𝑧 = 𝑤)))
61kqffn 23667 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
7 dffn2 6662 . . . 4 (𝐹 Fn 𝑋𝐹:𝑋⟶V)
86, 7sylib 218 . . 3 (𝐽 ∈ (TopOn‘𝑋) → 𝐹:𝑋⟶V)
9 dff13 7198 . . . 4 (𝐹:𝑋1-1→V ↔ (𝐹:𝑋⟶V ∧ ∀𝑧𝑋𝑤𝑋 ((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤)))
109baib 535 . . 3 (𝐹:𝑋⟶V → (𝐹:𝑋1-1→V ↔ ∀𝑧𝑋𝑤𝑋 ((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤)))
118, 10syl 17 . 2 (𝐽 ∈ (TopOn‘𝑋) → (𝐹:𝑋1-1→V ↔ ∀𝑧𝑋𝑤𝑋 ((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤)))
12 ist0-2 23286 . 2 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Kol2 ↔ ∀𝑧𝑋𝑤𝑋 (∀𝑦𝐽 (𝑧𝑦𝑤𝑦) → 𝑧 = 𝑤)))
135, 11, 123bitr4rd 312 1 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Kol2 ↔ 𝐹:𝑋1-1→V))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  wral 3049  {crab 3397  Vcvv 3438  cmpt 5177   Fn wfn 6485  wf 6486  1-1wf1 6487  cfv 6490  TopOnctopon 22852  Kol2ct0 23248
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fv 6498  df-topon 22853  df-t0 23255
This theorem is referenced by:  t0kq  23760
  Copyright terms: Public domain W3C validator