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

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

Proof of Theorem kqcld
StepHypRef Expression
1 imassrn 6037 . . . 4 (𝐹𝑈) ⊆ ran 𝐹
21a1i 11 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹𝑈) ⊆ ran 𝐹)
3 kqval.2 . . . . 5 𝐹 = (𝑥𝑋 ↦ {𝑦𝐽𝑥𝑦})
43kqcldsat 23698 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ (𝐹𝑈)) = 𝑈)
5 simpr 484 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → 𝑈 ∈ (Clsd‘𝐽))
64, 5eqeltrd 2837 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ (𝐹𝑈)) ∈ (Clsd‘𝐽))
73kqffn 23690 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
8 dffn4 6759 . . . . . 6 (𝐹 Fn 𝑋𝐹:𝑋onto→ran 𝐹)
97, 8sylib 218 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝐹:𝑋onto→ran 𝐹)
10 qtopcld 23678 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋onto→ran 𝐹) → ((𝐹𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ ((𝐹𝑈) ⊆ ran 𝐹 ∧ (𝐹 “ (𝐹𝑈)) ∈ (Clsd‘𝐽))))
119, 10mpdan 688 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → ((𝐹𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ ((𝐹𝑈) ⊆ ran 𝐹 ∧ (𝐹 “ (𝐹𝑈)) ∈ (Clsd‘𝐽))))
1211adantr 480 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → ((𝐹𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ ((𝐹𝑈) ⊆ ran 𝐹 ∧ (𝐹 “ (𝐹𝑈)) ∈ (Clsd‘𝐽))))
132, 6, 12mpbir2and 714 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹𝑈) ∈ (Clsd‘(𝐽 qTop 𝐹)))
143kqval 23691 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → (KQ‘𝐽) = (𝐽 qTop 𝐹))
1514adantr 480 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (KQ‘𝐽) = (𝐽 qTop 𝐹))
1615fveq2d 6845 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (Clsd‘(KQ‘𝐽)) = (Clsd‘(𝐽 qTop 𝐹)))
1713, 16eleqtrrd 2840 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹𝑈) ∈ (Clsd‘(KQ‘𝐽)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  {crab 3390  wss 3890  cmpt 5167  ccnv 5630  ran crn 5632  cima 5634   Fn wfn 6494  ontowfo 6497  cfv 6499  (class class class)co 7367   qTop cqtop 17467  TopOnctopon 22875  Clsdccld 22981  KQckq 23658
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5308  ax-pr 5376  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6455  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7370  df-oprab 7371  df-mpo 7372  df-qtop 17471  df-top 22859  df-topon 22876  df-cld 22984  df-kq 23659
This theorem is referenced by:  kqreglem1  23706  kqnrmlem1  23708  kqnrmlem2  23709
  Copyright terms: Public domain W3C validator