Theorem kqopn 23669

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

Step	Hyp	Ref	Expression
1		imassrn 6027	. . . 4 ⊢ (𝐹 “ 𝑈) ⊆ ran 𝐹
2	1	a1i 11	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (𝐹 “ 𝑈) ⊆ ran 𝐹)
3		kqval.2	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})
4	3	kqsat 23666	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (◡𝐹 “ (𝐹 “ 𝑈)) = 𝑈)
5		simpr 484	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → 𝑈 ∈ 𝐽)
6	4, 5	eqeltrd 2833	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (◡𝐹 “ (𝐹 “ 𝑈)) ∈ 𝐽)
7	3	kqffn 23660	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
8		dffn4 6749	. . . . . 6 ⊢ (𝐹 Fn 𝑋 ↔ 𝐹:𝑋–onto→ran 𝐹)
9	7, 8	sylib 218	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹:𝑋–onto→ran 𝐹)
10	9	adantr 480	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → 𝐹:𝑋–onto→ran 𝐹)
11		elqtop3 23638	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→ran 𝐹) → ((𝐹 “ 𝑈) ∈ (𝐽 qTop 𝐹) ↔ ((𝐹 “ 𝑈) ⊆ ran 𝐹 ∧ (◡𝐹 “ (𝐹 “ 𝑈)) ∈ 𝐽)))
12	10, 11	syldan 591	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → ((𝐹 “ 𝑈) ∈ (𝐽 qTop 𝐹) ↔ ((𝐹 “ 𝑈) ⊆ ran 𝐹 ∧ (◡𝐹 “ (𝐹 “ 𝑈)) ∈ 𝐽)))
13	2, 6, 12	mpbir2and 713	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (𝐹 “ 𝑈) ∈ (𝐽 qTop 𝐹))
14	3	kqval 23661	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (KQ‘𝐽) = (𝐽 qTop 𝐹))
15	14	adantr 480	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (KQ‘𝐽) = (𝐽 qTop 𝐹))
16	13, 15	eleqtrrd 2836	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (𝐹 “ 𝑈) ∈ (KQ‘𝐽))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  {crab 3396   ⊆ wss 3898   ↦ cmpt 5176  ^◡ccnv 5620  ran crn 5622   “ cima 5624   Fn wfn 6484  –onto→wfo 6487  ‘cfv 6489  (class class class)co 7355   qTop cqtop 17415  TopOnctopon 22845  KQckq 23628

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 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677

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 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-qtop 17419  df-topon 22846  df-kq 23629

This theorem is referenced by:  kqt0lem  23671  isr0  23672  regr1lem  23674  kqreglem1  23676  kqreglem2  23677  kqnrmlem1  23678  kqnrmlem2  23679