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

Theorem kqopn 22344
Description: The topological indistinguishability map is an open map. (Contributed by Mario Carneiro, 25-Aug-2015.)
Hypothesis
Ref Expression
kqval.2 𝐹 = (𝑥𝑋 ↦ {𝑦𝐽𝑥𝑦})
Assertion
Ref Expression
kqopn ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹𝑈) ∈ (KQ‘𝐽))
Distinct variable groups:   𝑥,𝑦,𝐽   𝑥,𝑋,𝑦
Allowed substitution hints:   𝑈(𝑥,𝑦)   𝐹(𝑥,𝑦)

Proof of Theorem kqopn
StepHypRef Expression
1 imassrn 5942 . . . 4 (𝐹𝑈) ⊆ ran 𝐹
21a1i 11 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹𝑈) ⊆ ran 𝐹)
3 kqval.2 . . . . 5 𝐹 = (𝑥𝑋 ↦ {𝑦𝐽𝑥𝑦})
43kqsat 22341 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹 “ (𝐹𝑈)) = 𝑈)
5 simpr 487 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → 𝑈𝐽)
64, 5eqeltrd 2915 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹 “ (𝐹𝑈)) ∈ 𝐽)
73kqffn 22335 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
8 dffn4 6598 . . . . . 6 (𝐹 Fn 𝑋𝐹:𝑋onto→ran 𝐹)
97, 8sylib 220 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝐹:𝑋onto→ran 𝐹)
109adantr 483 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → 𝐹:𝑋onto→ran 𝐹)
11 elqtop3 22313 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋onto→ran 𝐹) → ((𝐹𝑈) ∈ (𝐽 qTop 𝐹) ↔ ((𝐹𝑈) ⊆ ran 𝐹 ∧ (𝐹 “ (𝐹𝑈)) ∈ 𝐽)))
1210, 11syldan 593 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → ((𝐹𝑈) ∈ (𝐽 qTop 𝐹) ↔ ((𝐹𝑈) ⊆ ran 𝐹 ∧ (𝐹 “ (𝐹𝑈)) ∈ 𝐽)))
132, 6, 12mpbir2and 711 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹𝑈) ∈ (𝐽 qTop 𝐹))
143kqval 22336 . . 3 (𝐽 ∈ (TopOn‘𝑋) → (KQ‘𝐽) = (𝐽 qTop 𝐹))
1514adantr 483 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (KQ‘𝐽) = (𝐽 qTop 𝐹))
1613, 15eleqtrrd 2918 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹𝑈) ∈ (KQ‘𝐽))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1537  wcel 2114  {crab 3144  wss 3938  cmpt 5148  ccnv 5556  ran crn 5558  cima 5560   Fn wfn 6352  ontowfo 6355  cfv 6357  (class class class)co 7158   qTop cqtop 16778  TopOnctopon 21520  KQckq 22303
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-qtop 16782  df-topon 21521  df-kq 22304
This theorem is referenced by:  kqt0lem  22346  isr0  22347  regr1lem  22349  kqreglem1  22351  kqreglem2  22352  kqnrmlem1  22353  kqnrmlem2  22354
  Copyright terms: Public domain W3C validator