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 23955
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 23950 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧𝑋𝑤𝑋) → ((𝐹𝑧) = (𝐹𝑤) ↔ ∀𝑦𝐽 (𝑧𝑦𝑤𝑦)))
323expb 1138 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑧𝑋𝑤𝑋)) → ((𝐹𝑧) = (𝐹𝑤) ↔ ∀𝑦𝐽 (𝑧𝑦𝑤𝑦)))
43imbi1d 344 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑧𝑋𝑤𝑋)) → (((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤) ↔ (∀𝑦𝐽 (𝑧𝑦𝑤𝑦) → 𝑧 = 𝑤)))
542ralbidva 3224 . 2 (𝐽 ∈ (TopOn‘𝑋) → (∀𝑧𝑋𝑤𝑋 ((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤) ↔ ∀𝑧𝑋𝑤𝑋 (∀𝑦𝐽 (𝑧𝑦𝑤𝑦) → 𝑧 = 𝑤)))
61kqffn 23951 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
7 dffn2 6704 . . . 4 (𝐹 Fn 𝑋𝐹:𝑋⟶V)
86, 7sylib 221 . . 3 (𝐽 ∈ (TopOn‘𝑋) → 𝐹:𝑋⟶V)
9 dff13 7251 . . . 4 (𝐹:𝑋1-1→V ↔ (𝐹:𝑋⟶V ∧ ∀𝑧𝑋𝑤𝑋 ((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤)))
109baib 545 . . 3 (𝐹:𝑋⟶V → (𝐹:𝑋1-1→V ↔ ∀𝑧𝑋𝑤𝑋 ((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤)))
118, 10syl 18 . 2 (𝐽 ∈ (TopOn‘𝑋) → (𝐹:𝑋1-1→V ↔ ∀𝑧𝑋𝑤𝑋 ((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤)))
12 ist0-2 23569 . 2 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Kol2 ↔ ∀𝑧𝑋𝑤𝑋 (∀𝑦𝐽 (𝑧𝑦𝑤𝑦) → 𝑧 = 𝑤)))
135, 11, 123bitr4rd 315 1 (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Kol2 ↔ 𝐹:𝑋1-1→V))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wral 3076  {crab 3412  Vcvv 3450  cmpt 5186   Fn wfn 6528  wf 6529  1-1wf1 6530  cfv 6533  TopOnctopon 23135  Kol2ct0 23531
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736
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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  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 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fv 6541  df-topon 23136  df-t0 23538
This theorem is used by:  t0kq  24044
  Copyright terms: Public domain W3C validator