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

 Description: Function value in an image. (Contributed by Glauco Siliprandi, 23-Oct-2021.)
Hypotheses
Ref Expression
Assertion
Ref Expression
fvelimad (𝜑 → ∃𝑥 ∈ (𝐴𝐵)(𝐹𝑥) = 𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶
Allowed substitution hints:   𝜑(𝑥)   𝐹(𝑥)

Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 fvelimad.c . . . 4 (𝜑𝐶 ∈ (𝐹𝐵))
2 elimag 5903 . . . . 5 (𝐶 ∈ (𝐹𝐵) → (𝐶 ∈ (𝐹𝐵) ↔ ∃𝑦𝐵 𝑦𝐹𝐶))
32ibi 270 . . . 4 (𝐶 ∈ (𝐹𝐵) → ∃𝑦𝐵 𝑦𝐹𝐶)
41, 3syl 17 . . 3 (𝜑 → ∃𝑦𝐵 𝑦𝐹𝐶)
5 nfv 1915 . . . 4 𝑦𝜑
6 nfre1 3265 . . . 4 𝑦𝑦 ∈ (𝐴𝐵)(𝐹𝑦) = 𝐶
7 vex 3444 . . . . . . . . . . 11 𝑦 ∈ V
87a1i 11 . . . . . . . . . 10 ((𝜑𝑦𝐹𝐶) → 𝑦 ∈ V)
91adantr 484 . . . . . . . . . 10 ((𝜑𝑦𝐹𝐶) → 𝐶 ∈ (𝐹𝐵))
10 simpr 488 . . . . . . . . . 10 ((𝜑𝑦𝐹𝐶) → 𝑦𝐹𝐶)
118, 9, 10breldmd 5750 . . . . . . . . 9 ((𝜑𝑦𝐹𝐶) → 𝑦 ∈ dom 𝐹)
12 fvelimad.f . . . . . . . . . . 11 (𝜑𝐹 Fn 𝐴)
1312fndmd 6432 . . . . . . . . . 10 (𝜑 → dom 𝐹 = 𝐴)
1413adantr 484 . . . . . . . . 9 ((𝜑𝑦𝐹𝐶) → dom 𝐹 = 𝐴)
1511, 14eleqtrd 2892 . . . . . . . 8 ((𝜑𝑦𝐹𝐶) → 𝑦𝐴)
16153adant2 1128 . . . . . . 7 ((𝜑𝑦𝐵𝑦𝐹𝐶) → 𝑦𝐴)
17 simp2 1134 . . . . . . 7 ((𝜑𝑦𝐵𝑦𝐹𝐶) → 𝑦𝐵)
1816, 17elind 4123 . . . . . 6 ((𝜑𝑦𝐵𝑦𝐹𝐶) → 𝑦 ∈ (𝐴𝐵))
19 fnfun 6428 . . . . . . . . 9 (𝐹 Fn 𝐴 → Fun 𝐹)
2012, 19syl 17 . . . . . . . 8 (𝜑 → Fun 𝐹)
21203ad2ant1 1130 . . . . . . 7 ((𝜑𝑦𝐵𝑦𝐹𝐶) → Fun 𝐹)
22 simp3 1135 . . . . . . 7 ((𝜑𝑦𝐵𝑦𝐹𝐶) → 𝑦𝐹𝐶)
23 funbrfv 6698 . . . . . . 7 (Fun 𝐹 → (𝑦𝐹𝐶 → (𝐹𝑦) = 𝐶))
2421, 22, 23sylc 65 . . . . . 6 ((𝜑𝑦𝐵𝑦𝐹𝐶) → (𝐹𝑦) = 𝐶)
25 rspe 3263 . . . . . 6 ((𝑦 ∈ (𝐴𝐵) ∧ (𝐹𝑦) = 𝐶) → ∃𝑦 ∈ (𝐴𝐵)(𝐹𝑦) = 𝐶)
2618, 24, 25syl2anc 587 . . . . 5 ((𝜑𝑦𝐵𝑦𝐹𝐶) → ∃𝑦 ∈ (𝐴𝐵)(𝐹𝑦) = 𝐶)
27263exp 1116 . . . 4 (𝜑 → (𝑦𝐵 → (𝑦𝐹𝐶 → ∃𝑦 ∈ (𝐴𝐵)(𝐹𝑦) = 𝐶)))
285, 6, 27rexlimd 3276 . . 3 (𝜑 → (∃𝑦𝐵 𝑦𝐹𝐶 → ∃𝑦 ∈ (𝐴𝐵)(𝐹𝑦) = 𝐶))
294, 28mpd 15 . 2 (𝜑 → ∃𝑦 ∈ (𝐴𝐵)(𝐹𝑦) = 𝐶)
30 nfv 1915 . . 3 𝑦(𝐹𝑥) = 𝐶
31 fvelimad.x . . . . 5 𝑥𝐹
32 nfcv 2955 . . . . 5 𝑥𝑦
3331, 32nffv 6662 . . . 4 𝑥(𝐹𝑦)
3433nfeq1 2970 . . 3 𝑥(𝐹𝑦) = 𝐶
35 fveqeq2 6661 . . 3 (𝑥 = 𝑦 → ((𝐹𝑥) = 𝐶 ↔ (𝐹𝑦) = 𝐶))
3630, 34, 35cbvrexw 3388 . 2 (∃𝑥 ∈ (𝐴𝐵)(𝐹𝑥) = 𝐶 ↔ ∃𝑦 ∈ (𝐴𝐵)(𝐹𝑦) = 𝐶)
3729, 36sylibr 237 1 (𝜑 → ∃𝑥 ∈ (𝐴𝐵)(𝐹𝑥) = 𝐶)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  Ⅎwnfc 2936  ∃wrex 3107  Vcvv 3441   ∩ cin 3881   class class class wbr 5033  dom cdm 5522   “ cima 5525  Fun wfun 6323   Fn wfn 6324  ‘cfv 6329 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5170  ax-nul 5177  ax-pr 5298 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-v 3443  df-sbc 3722  df-dif 3885  df-un 3887  df-in 3889  df-ss 3899  df-nul 4246  df-if 4428  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4804  df-br 5034  df-opab 5096  df-id 5428  df-xp 5528  df-rel 5529  df-cnv 5530  df-co 5531  df-dm 5532  df-rn 5533  df-res 5534  df-ima 5535  df-iota 6288  df-fun 6331  df-fn 6332  df-fv 6337 This theorem is referenced by:  cyc3evpm  30888  cycpmgcl  30891  cycpmconjslem2  30893  cyc3conja  30895  limsupmnflem  42446  liminfvalxr  42509
 Copyright terms: Public domain W3C validator