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

Theorem kqfvima 23695
Description: When the image set is open, the quotient map satisfies a partial converse to fnfvima 7188, 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 23690 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
323ad2ant1 1134 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → 𝐹 Fn 𝑋)
4 toponss 22892 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → 𝑈𝑋)
543adant3 1133 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → 𝑈𝑋)
6 fnfvima 7188 . . . 4 ((𝐹 Fn 𝑋𝑈𝑋𝐴𝑈) → (𝐹𝐴) ∈ (𝐹𝑈))
763expia 1122 . . 3 ((𝐹 Fn 𝑋𝑈𝑋) → (𝐴𝑈 → (𝐹𝐴) ∈ (𝐹𝑈)))
83, 5, 7syl2anc 585 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → (𝐴𝑈 → (𝐹𝐴) ∈ (𝐹𝑈)))
9 fnfun 6598 . . . 4 (𝐹 Fn 𝑋 → Fun 𝐹)
10 fvelima 6905 . . . . 5 ((Fun 𝐹 ∧ (𝐹𝐴) ∈ (𝐹𝑈)) → ∃𝑧𝑈 (𝐹𝑧) = (𝐹𝐴))
1110ex 412 . . . 4 (Fun 𝐹 → ((𝐹𝐴) ∈ (𝐹𝑈) → ∃𝑧𝑈 (𝐹𝑧) = (𝐹𝐴)))
123, 9, 113syl 18 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → ((𝐹𝐴) ∈ (𝐹𝑈) → ∃𝑧𝑈 (𝐹𝑧) = (𝐹𝐴)))
13 simpl1 1193 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → 𝐽 ∈ (TopOn‘𝑋))
145sselda 3921 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → 𝑧𝑋)
15 simpl3 1195 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → 𝐴𝑋)
161kqfeq 23689 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧𝑋𝐴𝑋) → ((𝐹𝑧) = (𝐹𝐴) ↔ ∀𝑦𝐽 (𝑧𝑦𝐴𝑦)))
1713, 14, 15, 16syl3anc 1374 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → ((𝐹𝑧) = (𝐹𝐴) ↔ ∀𝑦𝐽 (𝑧𝑦𝐴𝑦)))
18 eleq2 2825 . . . . . . . . 9 (𝑦 = 𝑤 → (𝑧𝑦𝑧𝑤))
19 eleq2 2825 . . . . . . . . 9 (𝑦 = 𝑤 → (𝐴𝑦𝐴𝑤))
2018, 19bibi12d 345 . . . . . . . 8 (𝑦 = 𝑤 → ((𝑧𝑦𝐴𝑦) ↔ (𝑧𝑤𝐴𝑤)))
2120cbvralvw 3215 . . . . . . 7 (∀𝑦𝐽 (𝑧𝑦𝐴𝑦) ↔ ∀𝑤𝐽 (𝑧𝑤𝐴𝑤))
2217, 21bitrdi 287 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → ((𝐹𝑧) = (𝐹𝐴) ↔ ∀𝑤𝐽 (𝑧𝑤𝐴𝑤)))
23 simpl2 1194 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → 𝑈𝐽)
24 eleq2 2825 . . . . . . . . 9 (𝑤 = 𝑈 → (𝑧𝑤𝑧𝑈))
25 eleq2 2825 . . . . . . . . 9 (𝑤 = 𝑈 → (𝐴𝑤𝐴𝑈))
2624, 25bibi12d 345 . . . . . . . 8 (𝑤 = 𝑈 → ((𝑧𝑤𝐴𝑤) ↔ (𝑧𝑈𝐴𝑈)))
2726rspcv 3560 . . . . . . 7 (𝑈𝐽 → (∀𝑤𝐽 (𝑧𝑤𝐴𝑤) → (𝑧𝑈𝐴𝑈)))
2823, 27syl 17 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → (∀𝑤𝐽 (𝑧𝑤𝐴𝑤) → (𝑧𝑈𝐴𝑈)))
2922, 28sylbid 240 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → ((𝐹𝑧) = (𝐹𝐴) → (𝑧𝑈𝐴𝑈)))
30 simpr 484 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → 𝑧𝑈)
31 biimp 215 . . . . 5 ((𝑧𝑈𝐴𝑈) → (𝑧𝑈𝐴𝑈))
3229, 30, 31syl6ci 71 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) ∧ 𝑧𝑈) → ((𝐹𝑧) = (𝐹𝐴) → 𝐴𝑈))
3332rexlimdva 3138 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → (∃𝑧𝑈 (𝐹𝑧) = (𝐹𝐴) → 𝐴𝑈))
3412, 33syld 47 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → ((𝐹𝐴) ∈ (𝐹𝑈) → 𝐴𝑈))
358, 34impbid 212 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑋) → (𝐴𝑈 ↔ (𝐹𝐴) ∈ (𝐹𝑈)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3051  wrex 3061  {crab 3389  wss 3889  cmpt 5166  cima 5634  Fun wfun 6492   Fn wfn 6493  cfv 6498  TopOnctopon 22875
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 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  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 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fv 6506  df-topon 22876
This theorem is referenced by:  kqsat  23696  kqdisj  23697  kqcldsat  23698  kqt0lem  23701  isr0  23702  regr1lem  23704  kqreglem1  23706  kqreglem2  23707
  Copyright terms: Public domain W3C validator