Theorem fvelimad 6818

Description: Function value in an image. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
fvelimad.x	⊢ Ⅎ𝑥𝐹
fvelimad.f	⊢ (𝜑 → 𝐹 Fn 𝐴)
fvelimad.c	⊢ (𝜑 → 𝐶 ∈ (𝐹 “ 𝐵))

Assertion

Ref	Expression
fvelimad	⊢ (𝜑 → ∃𝑥 ∈ (𝐴 ∩ 𝐵)(𝐹‘𝑥) = 𝐶)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Allowed substitution hints:   𝜑(𝑥)   𝐹(𝑥)

Proof of Theorem fvelimad

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvelimad.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ (𝐹 “ 𝐵))
2		elimag 5962	. . . . 5 ⊢ (𝐶 ∈ (𝐹 “ 𝐵) → (𝐶 ∈ (𝐹 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 𝑦𝐹𝐶))
3	2	ibi 266	. . . 4 ⊢ (𝐶 ∈ (𝐹 “ 𝐵) → ∃𝑦 ∈ 𝐵 𝑦𝐹𝐶)
4	1, 3	syl 17	. . 3 ⊢ (𝜑 → ∃𝑦 ∈ 𝐵 𝑦𝐹𝐶)
5		nfv 1918	. . . 4 ⊢ Ⅎ𝑦𝜑
6		nfre1 3234	. . . 4 ⊢ Ⅎ𝑦∃𝑦 ∈ (𝐴 ∩ 𝐵)(𝐹‘𝑦) = 𝐶
7		vex 3426	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
8	7	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦𝐹𝐶) → 𝑦 ∈ V)
9	1	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦𝐹𝐶) → 𝐶 ∈ (𝐹 “ 𝐵))
10		simpr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦𝐹𝐶) → 𝑦𝐹𝐶)
11	8, 9, 10	breldmd 5810	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦𝐹𝐶) → 𝑦 ∈ dom 𝐹)
12		fvelimad.f	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 Fn 𝐴)
13	12	fndmd 6522	. . . . . . . . . 10 ⊢ (𝜑 → dom 𝐹 = 𝐴)
14	13	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦𝐹𝐶) → dom 𝐹 = 𝐴)
15	11, 14	eleqtrd 2841	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦𝐹𝐶) → 𝑦 ∈ 𝐴)
16	15	3adant2 1129	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵 ∧ 𝑦𝐹𝐶) → 𝑦 ∈ 𝐴)
17		simp2 1135	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵 ∧ 𝑦𝐹𝐶) → 𝑦 ∈ 𝐵)
18	16, 17	elind 4124	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵 ∧ 𝑦𝐹𝐶) → 𝑦 ∈ (𝐴 ∩ 𝐵))
19		fnfun 6517	. . . . . . . . 9 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
20	12, 19	syl 17	. . . . . . . 8 ⊢ (𝜑 → Fun 𝐹)
21	20	3ad2ant1 1131	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵 ∧ 𝑦𝐹𝐶) → Fun 𝐹)
22		simp3 1136	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵 ∧ 𝑦𝐹𝐶) → 𝑦𝐹𝐶)
23		funbrfv 6802	. . . . . . 7 ⊢ (Fun 𝐹 → (𝑦𝐹𝐶 → (𝐹‘𝑦) = 𝐶))
24	21, 22, 23	sylc 65	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵 ∧ 𝑦𝐹𝐶) → (𝐹‘𝑦) = 𝐶)
25		rspe 3232	. . . . . 6 ⊢ ((𝑦 ∈ (𝐴 ∩ 𝐵) ∧ (𝐹‘𝑦) = 𝐶) → ∃𝑦 ∈ (𝐴 ∩ 𝐵)(𝐹‘𝑦) = 𝐶)
26	18, 24, 25	syl2anc 583	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵 ∧ 𝑦𝐹𝐶) → ∃𝑦 ∈ (𝐴 ∩ 𝐵)(𝐹‘𝑦) = 𝐶)
27	26	3exp 1117	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → (𝑦𝐹𝐶 → ∃𝑦 ∈ (𝐴 ∩ 𝐵)(𝐹‘𝑦) = 𝐶)))
28	5, 6, 27	rexlimd 3245	. . 3 ⊢ (𝜑 → (∃𝑦 ∈ 𝐵 𝑦𝐹𝐶 → ∃𝑦 ∈ (𝐴 ∩ 𝐵)(𝐹‘𝑦) = 𝐶))
29	4, 28	mpd 15	. 2 ⊢ (𝜑 → ∃𝑦 ∈ (𝐴 ∩ 𝐵)(𝐹‘𝑦) = 𝐶)
30		nfv 1918	. . 3 ⊢ Ⅎ𝑦(𝐹‘𝑥) = 𝐶
31		fvelimad.x	. . . . 5 ⊢ Ⅎ𝑥𝐹
32		nfcv 2906	. . . . 5 ⊢ Ⅎ𝑥𝑦
33	31, 32	nffv 6766	. . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑦)
34	33	nfeq1 2921	. . 3 ⊢ Ⅎ𝑥(𝐹‘𝑦) = 𝐶
35		fveqeq2 6765	. . 3 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) = 𝐶 ↔ (𝐹‘𝑦) = 𝐶))
36	30, 34, 35	cbvrexw 3364	. 2 ⊢ (∃𝑥 ∈ (𝐴 ∩ 𝐵)(𝐹‘𝑥) = 𝐶 ↔ ∃𝑦 ∈ (𝐴 ∩ 𝐵)(𝐹‘𝑦) = 𝐶)
37	29, 36	sylibr 233	1 ⊢ (𝜑 → ∃𝑥 ∈ (𝐴 ∩ 𝐵)(𝐹‘𝑥) = 𝐶)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  Ⅎwnfc 2886  ∃wrex 3064  Vcvv 3422   ∩ cin 3882   class class class wbr 5070  dom cdm 5580   “ cima 5583  Fun wfun 6412   Fn wfn 6413  ‘cfv 6418

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-fv 6426

This theorem is referenced by:  cyc3evpm  31319  cycpmgcl  31322  cycpmconjslem2  31324  cyc3conja  31326  limsupmnflem  43151  liminfvalxr  43214