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

Theorem kqfvima 24010
Description: When the image set is open, the quotient map satisfies a partial converse to fnfvima 7227, 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.
StepHypRef Expression
1 kqval.2 . . . . 5 𝐹 = (𝑥𝑋 ↦ {𝑦𝐽𝑥𝑦})
21kqffn 24005 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
323ad2ant1 1151 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → 𝐹 Fn 𝑋)
4 toponss 23206 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → 𝑈𝑋)
543adant3 1150 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → 𝑈𝑋)
6 fnfvima 7227 . . . 4 ((𝐹 Fn 𝑋𝑈𝑋𝐴𝑈) → (𝐹𝐴) ∈ (𝐹𝑈))
763expia 1139 . . 3 ((𝐹 Fn 𝑋𝑈𝑋) → (𝐴𝑈 → (𝐹𝐴) ∈ (𝐹𝑈)))
83, 5, 7syl2anc 596 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → (𝐴𝑈 → (𝐹𝐴) ∈ (𝐹𝑈)))
9 fnfun 6627 . . . 4 (𝐹 Fn 𝑋 → Fun 𝐹)
10 fvelima 6938 . . . . 5 ((Fun 𝐹 ∧ (𝐹𝐴) ∈ (𝐹𝑈)) → ∃𝑧𝑈 (𝐹𝑧) = (𝐹𝐴))
1110ex 418 . . . 4 (Fun 𝐹 → ((𝐹𝐴) ∈ (𝐹𝑈) → ∃𝑧𝑈 (𝐹𝑧) = (𝐹𝐴)))
123, 9, 113syl 19 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → ((𝐹𝐴) ∈ (𝐹𝑈) → ∃𝑧𝑈 (𝐹𝑧) = (𝐹𝐴)))
13 simpl1 1210 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → 𝐽 ∈ (TopOn‘𝑋))
145sselda 3930 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → 𝑧𝑋)
15 simpl3 1212 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → 𝐴𝑋)
161kqfeq 24004 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧𝑋𝐴𝑋) → ((𝐹𝑧) = (𝐹𝐴) ↔ ∀𝑦𝐽 (𝑧𝑦𝐴𝑦)))
1713, 14, 15, 16syl3anc 1398 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → ((𝐹𝑧) = (𝐹𝐴) ↔ ∀𝑦𝐽 (𝑧𝑦𝐴𝑦)))
18 eleq2 2849 . . . . . . . . 9 (𝑦 = 𝑤 → (𝑧𝑦𝑧𝑤))
19 eleq2 2849 . . . . . . . . 9 (𝑦 = 𝑤 → (𝐴𝑦𝐴𝑤))
2018, 19bibi12d 348 . . . . . . . 8 (𝑦 = 𝑤 → ((𝑧𝑦𝐴𝑦) ↔ (𝑧𝑤𝐴𝑤)))
2120cbvralvw 3240 . . . . . . 7 (∀𝑦𝐽 (𝑧𝑦𝐴𝑦) ↔ ∀𝑤𝐽 (𝑧𝑤𝐴𝑤))
2217, 21bitrdi 290 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → ((𝐹𝑧) = (𝐹𝐴) ↔ ∀𝑤𝐽 (𝑧𝑤𝐴𝑤)))
23 simpl2 1211 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → 𝑈𝐽)
24 eleq2 2849 . . . . . . . . 9 (𝑤 = 𝑈 → (𝑧𝑤𝑧𝑈))
25 eleq2 2849 . . . . . . . . 9 (𝑤 = 𝑈 → (𝐴𝑤𝐴𝑈))
2624, 25bibi12d 348 . . . . . . . 8 (𝑤 = 𝑈 → ((𝑧𝑤𝐴𝑤) ↔ (𝑧𝑈𝐴𝑈)))
2726rspcv 3572 . . . . . . 7 (𝑈𝐽 → (∀𝑤𝐽 (𝑧𝑤𝐴𝑤) → (𝑧𝑈𝐴𝑈)))
2823, 27syl 18 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → (∀𝑤𝐽 (𝑧𝑤𝐴𝑤) → (𝑧𝑈𝐴𝑈)))
2922, 28sylbid 243 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → ((𝐹𝑧) = (𝐹𝐴) → (𝑧𝑈𝐴𝑈)))
30 simpr 490 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → 𝑧𝑈)
31 biimp 218 . . . . 5 ((𝑧𝑈𝐴𝑈) → (𝑧𝑈𝐴𝑈))
3229, 30, 31syl6ci 72 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → ((𝐹𝑧) = (𝐹𝐴) → 𝐴𝑈))
3332rexlimdva 3163 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → (∃𝑧𝑈 (𝐹𝑧) = (𝐹𝐴) → 𝐴𝑈))
3412, 33syld 48 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → ((𝐹𝐴) ∈ (𝐹𝑈) → 𝐴𝑈))
358, 34impbid 215 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → (𝐴𝑈 ↔ (𝐹𝐴) ∈ (𝐹𝑈)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2145  wral 3076  wrex 3086  {crab 3412  wss 3898  cmpt 5185  cima 5650  Fun wfun 6521   Fn wfn 6522  cfv 6527  TopOnctopon 23189
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fv 6535  df-topon 23190
This theorem is used by:  kqsat  24011  kqdisj  24012  kqcldsat  24013  kqt0lem  24016  isr0  24017  regr1lem  24019  kqreglem1  24021  kqreglem2  24022
  Copyright terms: Public domain W3C validator