Theorem kqfvima 23898

Description: When the image set is open, the quotient map satisfies a partial converse to fnfvima 7231, which is normally only true for injective functions. (Contributed by Mario Carneiro, 25-Aug-2015.)

Hypothesis

Ref	Expression
kqval.2	⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})

Assertion

Ref	Expression
kqfvima	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ 𝑈 ↔ (𝐹‘𝐴) ∈ (𝐹 “ 𝑈)))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐽,𝑦   𝑥,𝑋,𝑦

Allowed substitution hints:   𝑈(𝑥, 𝑦)   𝐹(𝑥, 𝑦)

Proof of Theorem kqfvima

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		kqval.2	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})
2	1	kqffn 23893	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
3	2	3ad2ant1 1150	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → 𝐹 Fn 𝑋)
4		toponss 23095	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → 𝑈 ⊆ 𝑋)
5	4	3adant3 1149	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → 𝑈 ⊆ 𝑋)
6		fnfvima 7231	. . . 4 ⊢ ((𝐹 Fn 𝑋 ∧ 𝑈 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑈) → (𝐹‘𝐴) ∈ (𝐹 “ 𝑈))
7	6	3expia 1138	. . 3 ⊢ ((𝐹 Fn 𝑋 ∧ 𝑈 ⊆ 𝑋) → (𝐴 ∈ 𝑈 → (𝐹‘𝐴) ∈ (𝐹 “ 𝑈)))
8	3, 5, 7	syl2anc 595	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ 𝑈 → (𝐹‘𝐴) ∈ (𝐹 “ 𝑈)))
9		fnfun 6635	. . . 4 ⊢ (𝐹 Fn 𝑋 → Fun 𝐹)
10		fvelima 6946	. . . . 5 ⊢ ((Fun 𝐹 ∧ (𝐹‘𝐴) ∈ (𝐹 “ 𝑈)) → ∃𝑧 ∈ 𝑈 (𝐹‘𝑧) = (𝐹‘𝐴))
11	10	ex 417	. . . 4 ⊢ (Fun 𝐹 → ((𝐹‘𝐴) ∈ (𝐹 “ 𝑈) → ∃𝑧 ∈ 𝑈 (𝐹‘𝑧) = (𝐹‘𝐴)))
12	3, 9, 11	3syl 19	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝐴) ∈ (𝐹 “ 𝑈) → ∃𝑧 ∈ 𝑈 (𝐹‘𝑧) = (𝐹‘𝐴)))
13		simpl1 1209	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → 𝐽 ∈ (TopOn‘𝑋))
14	5	sselda 3936	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → 𝑧 ∈ 𝑋)
15		simpl3 1211	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → 𝐴 ∈ 𝑋)
16	1	kqfeq 23892	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝑧) = (𝐹‘𝐴) ↔ ∀𝑦 ∈ 𝐽 (𝑧 ∈ 𝑦 ↔ 𝐴 ∈ 𝑦)))
17	13, 14, 15, 16	syl3anc 1397	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → ((𝐹‘𝑧) = (𝐹‘𝐴) ↔ ∀𝑦 ∈ 𝐽 (𝑧 ∈ 𝑦 ↔ 𝐴 ∈ 𝑦)))
18		eleq2 2851	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → (𝑧 ∈ 𝑦 ↔ 𝑧 ∈ 𝑤))
19		eleq2 2851	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → (𝐴 ∈ 𝑦 ↔ 𝐴 ∈ 𝑤))
20	18, 19	bibi12d 348	. . . . . . . 8 ⊢ (𝑦 = 𝑤 → ((𝑧 ∈ 𝑦 ↔ 𝐴 ∈ 𝑦) ↔ (𝑧 ∈ 𝑤 ↔ 𝐴 ∈ 𝑤)))
21	20	cbvralvw 3242	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐽 (𝑧 ∈ 𝑦 ↔ 𝐴 ∈ 𝑦) ↔ ∀𝑤 ∈ 𝐽 (𝑧 ∈ 𝑤 ↔ 𝐴 ∈ 𝑤))
22	17, 21	bitrdi 290	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → ((𝐹‘𝑧) = (𝐹‘𝐴) ↔ ∀𝑤 ∈ 𝐽 (𝑧 ∈ 𝑤 ↔ 𝐴 ∈ 𝑤)))
23		simpl2 1210	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → 𝑈 ∈ 𝐽)
24		eleq2 2851	. . . . . . . . 9 ⊢ (𝑤 = 𝑈 → (𝑧 ∈ 𝑤 ↔ 𝑧 ∈ 𝑈))
25		eleq2 2851	. . . . . . . . 9 ⊢ (𝑤 = 𝑈 → (𝐴 ∈ 𝑤 ↔ 𝐴 ∈ 𝑈))
26	24, 25	bibi12d 348	. . . . . . . 8 ⊢ (𝑤 = 𝑈 → ((𝑧 ∈ 𝑤 ↔ 𝐴 ∈ 𝑤) ↔ (𝑧 ∈ 𝑈 ↔ 𝐴 ∈ 𝑈)))
27	26	rspcv 3576	. . . . . . 7 ⊢ (𝑈 ∈ 𝐽 → (∀𝑤 ∈ 𝐽 (𝑧 ∈ 𝑤 ↔ 𝐴 ∈ 𝑤) → (𝑧 ∈ 𝑈 ↔ 𝐴 ∈ 𝑈)))
28	23, 27	syl 18	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → (∀𝑤 ∈ 𝐽 (𝑧 ∈ 𝑤 ↔ 𝐴 ∈ 𝑤) → (𝑧 ∈ 𝑈 ↔ 𝐴 ∈ 𝑈)))
29	22, 28	sylbid 243	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → ((𝐹‘𝑧) = (𝐹‘𝐴) → (𝑧 ∈ 𝑈 ↔ 𝐴 ∈ 𝑈)))
30		simpr 489	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → 𝑧 ∈ 𝑈)
31		biimp 218	. . . . 5 ⊢ ((𝑧 ∈ 𝑈 ↔ 𝐴 ∈ 𝑈) → (𝑧 ∈ 𝑈 → 𝐴 ∈ 𝑈))
32	29, 30, 31	syl6ci 72	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → ((𝐹‘𝑧) = (𝐹‘𝐴) → 𝐴 ∈ 𝑈))
33	32	rexlimdva 3165	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → (∃𝑧 ∈ 𝑈 (𝐹‘𝑧) = (𝐹‘𝐴) → 𝐴 ∈ 𝑈))
34	12, 33	syld 48	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝐴) ∈ (𝐹 “ 𝑈) → 𝐴 ∈ 𝑈))
35	8, 34	impbid 215	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ 𝑈 ↔ (𝐹‘𝐴) ∈ (𝐹 “ 𝑈)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142  ∀wral 3078  ∃wrex 3088  {crab 3415   ⊆ wss 3904   ↦ cmpt 5191   “ cima 5663  Fun wfun 6530   Fn wfn 6531  ‘cfv 6536  TopOnctopon 23078

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-topon 23079

This theorem is used by:  kqsat  23899  kqdisj  23900  kqcldsat  23901  kqt0lem  23904  isr0  23905  regr1lem  23907  kqreglem1  23909  kqreglem2  23910