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

Theorem kqfvima 24049
Description: When the image set is open, the quotient map satisfies a partial converse to fnfvima 7239, 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 24044 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
323ad2ant1 1151 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → 𝐹 Fn 𝑋)
4 toponss 23245 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽) → 𝑈 ⊆ 𝑋)
543adant3 1150 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → 𝑈 ⊆ 𝑋)
6 fnfvima 7239 . . . 4 ((𝐹 Fn 𝑋 ∧ 𝑈 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑈) → (𝐹‘𝐴) ∈ (𝐹 “ 𝑈))
763expia 1139 . . 3 ((𝐹 Fn 𝑋 ∧ 𝑈 ⊆ 𝑋) → (𝐴 ∈ 𝑈 → (𝐹‘𝐴) ∈ (𝐹 “ 𝑈)))
83, 5, 7syl2anc 596 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ 𝑈 → (𝐹‘𝐴) ∈ (𝐹 “ 𝑈)))
9 fnfun 6639 . . . 4 (𝐹 Fn 𝑋 → Fun 𝐹)
10 fvelima 6950 . . . . 5 ((Fun 𝐹 ∧ (𝐹‘𝐴) ∈ (𝐹 “ 𝑈)) → ∃𝑧 ∈ 𝑈 (𝐹‘𝑧) = (𝐹‘𝐴))
1110ex 418 . . . 4 (Fun 𝐹 → ((𝐹‘𝐴) ∈ (𝐹 “ 𝑈) → ∃𝑧 ∈ 𝑈 (𝐹‘𝑧) = (𝐹‘𝐴)))
123, 9, 113syl 19 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝐴) ∈ (𝐹 “ 𝑈) → ∃𝑧 ∈ 𝑈 (𝐹‘𝑧) = (𝐹‘𝐴)))
13 simpl1 1210 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → 𝐽 ∈ (TopOn‘𝑋))
145sselda 3908 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → 𝑧 ∈ 𝑋)
15 simpl3 1212 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) ∧ 𝑧 ∈ 𝑈) → 𝐴 ∈ 𝑋)
161kqfeq 24043 . . . . . . . 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 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  {crab 3412   ⊆ wss 3895   ↦ cmpt 5185   “ cima 5653  Fun wfun 6532   Fn wfn 6533  ‘cfv 6538  TopOnctopon 23228
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3896  df-dif 4047  df-in 4091  df-un 4151  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 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-topon 23229
This theorem is used by:  kqsat  24050  kqdisj  24051  kqcldsat  24052  kqt0lem  24055  isr0  24056  regr1lem  24058  kqreglem1  24060  kqreglem2  24061
  Copyright terms: Public domain W3C validator