Theorem kqopn 24108

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 6216	. . . 4 ⊢ (𝐹 “ 𝑈) ⊆ ran 𝐹
2	1	a1i 11	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (𝐹 “ 𝑈) ⊆ ran 𝐹)
3		kqval.2	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})
4	3	kqsat 24105	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (◡𝐹 “ (𝐹 “ 𝑈)) = 𝑈)
5		simpr 490	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → 𝑈 ∈ 𝐽)
6	4, 5	eqeltrd 2864	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (◡𝐹 “ (𝐹 “ 𝑈)) ∈ 𝐽)
7	3	kqffn 24099	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
8		dffn4 6832	. . . . . 6 ⊢ (𝐹 Fn 𝑋 ↔ 𝐹:𝑋⟶ontoran 𝐹)
9	7, 8	sylib 221	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹:𝑋⟶ontoran 𝐹)
10	9	adantr 486	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → 𝐹:𝑋⟶ontoran 𝐹)
11		elqtop3 24077	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋⟶ontoran 𝐹) → ((𝐹 “ 𝑈) ∈ (𝐽 qTop 𝐹) ↔ ((𝐹 “ 𝑈) ⊆ ran 𝐹 ∧ (◡𝐹 “ (𝐹 “ 𝑈)) ∈ 𝐽)))
12	10, 11	syldan 603	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → ((𝐹 “ 𝑈) ∈ (𝐽 qTop 𝐹) ↔ ((𝐹 “ 𝑈) ⊆ ran 𝐹 ∧ (◡𝐹 “ (𝐹 “ 𝑈)) ∈ 𝐽)))
13	2, 6, 12	mpbir2and 726	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (𝐹 “ 𝑈) ∈ (𝐽 qTop 𝐹))
14	3	kqval 24100	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (KQ‘𝐽) = (𝐽 qTop 𝐹))
15	14	adantr 486	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (KQ‘𝐽) = (𝐽 qTop 𝐹))
16	13, 15	eleqtrrd 2867	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → (𝐹 “ 𝑈) ∈ (KQ‘𝐽))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900   ↦ cmpt 5192  ^◡ccnv 5657  ran crn 5659   “ cima 5661   Fn wfn 6561  ⟶ontowfo 6564  ‘cfv 6566  (class class class)co 7451   qTop cqtop 17725  TopOnctopon 23283  KQckq 24067

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-qtop 17729  df-topon 23284  df-kq 24068

This theorem is used by:  kqt0lem  24110  isr0  24111  regr1lem  24113  kqreglem1  24115  kqreglem2  24116  kqnrmlem1  24117  kqnrmlem2  24118