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

Theorem kqopn 23717
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 6023 . . . 4 (𝐹𝑈) ⊆ ran 𝐹
21a1i 11 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹𝑈) ⊆ ran 𝐹)
3 kqval.2 . . . . 5 𝐹 = (𝑥𝑋 ↦ {𝑦𝐽𝑥𝑦})
43kqsat 23714 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹 “ (𝐹𝑈)) = 𝑈)
5 simpr 485 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → 𝑈𝐽)
64, 5eqeltrd 2839 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹 “ (𝐹𝑈)) ∈ 𝐽)
73kqffn 23708 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
8 dffn4 6745 . . . . . 6 (𝐹 Fn 𝑋𝐹:𝑋onto→ran 𝐹)
97, 8sylib 219 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝐹:𝑋onto→ran 𝐹)
109adantr 481 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → 𝐹:𝑋onto→ran 𝐹)
11 elqtop3 23686 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋onto→ran 𝐹) → ((𝐹𝑈) ∈ (𝐽 qTop 𝐹) ↔ ((𝐹𝑈) ⊆ ran 𝐹 ∧ (𝐹 “ (𝐹𝑈)) ∈ 𝐽)))
1210, 11syldan 597 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → ((𝐹𝑈) ∈ (𝐽 qTop 𝐹) ↔ ((𝐹𝑈) ⊆ ran 𝐹 ∧ (𝐹 “ (𝐹𝑈)) ∈ 𝐽)))
132, 6, 12mpbir2and 719 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹𝑈) ∈ (𝐽 qTop 𝐹))
143kqval 23709 . . 3 (𝐽 ∈ (TopOn‘𝑋) → (KQ‘𝐽) = (𝐽 qTop 𝐹))
1514adantr 481 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (KQ‘𝐽) = (𝐽 qTop 𝐹))
1613, 15eleqtrrd 2842 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹𝑈) ∈ (KQ‘𝐽))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  {crab 3391  wss 3883  cmpt 5153  ccnv 5617  ran crn 5619  cima 5621   Fn wfn 6480  ontowfo 6483  cfv 6485  (class class class)co 7356   qTop cqtop 17458  TopOnctopon 22893  KQckq 23676
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-rep 5199  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-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  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-iun 4923  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-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-qtop 17462  df-topon 22894  df-kq 23677
This theorem is referenced by:  kqt0lem  23719  isr0  23720  regr1lem  23722  kqreglem1  23724  kqreglem2  23725  kqnrmlem1  23726  kqnrmlem2  23727
  Copyright terms: Public domain W3C validator