Theorem fvmptdf 7000

Description: Deduction version of fvmptd 7001 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by AV, 29-Mar-2024.)

Hypotheses

Ref	Expression
fvmptd.1	⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵))
fvmptd.2	⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 = 𝐶)
fvmptd.3	⊢ (𝜑 → 𝐴 ∈ 𝐷)
fvmptd.4	⊢ (𝜑 → 𝐶 ∈ 𝑉)
fvmptdf.p	⊢ Ⅎ𝑥𝜑
fvmptdf.a	⊢ Ⅎ𝑥𝐴
fvmptdf.c	⊢ Ⅎ𝑥𝐶

Assertion

Ref	Expression
fvmptdf	⊢ (𝜑 → (𝐹‘𝐴) = 𝐶)

Distinct variable group:   𝑥,𝐷

Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑥)   𝐹(𝑥)   𝑉(𝑥)

Proof of Theorem fvmptdf

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvmptd.1	. . 3 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵))
2	1	fveq1d 6887	. 2 ⊢ (𝜑 → (𝐹‘𝐴) = ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴))
3		fvmptd.3	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐷)
4		fvmptdf.p	. . . . 5 ⊢ Ⅎ𝑥𝜑
5		nfcsb1v 3878	. . . . . 6 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵
6	5	a1i 11	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵)
7		fvmptdf.c	. . . . . 6 ⊢ Ⅎ𝑥𝐶
8	7	a1i 11	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝐶)
9		csbeq1a 3868	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵)
10	9	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵)
11		fvmptdf.a	. . . . . . . 8 ⊢ Ⅎ𝑥𝐴
12	11	nfeq2 2944	. . . . . . 7 ⊢ Ⅎ𝑥 𝑦 = 𝐴
13	4, 12	nfan 1932	. . . . . 6 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑦 = 𝐴)
14	7	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = 𝐴) → Ⅎ𝑥𝐶)
15		vex 3461	. . . . . . 7 ⊢ 𝑦 ∈ V
16	15	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = 𝐴) → 𝑦 ∈ V)
17		eqtr 2785	. . . . . . . . 9 ⊢ ((𝑥 = 𝑦 ∧ 𝑦 = 𝐴) → 𝑥 = 𝐴)
18	17	ancoms 464	. . . . . . . 8 ⊢ ((𝑦 = 𝐴 ∧ 𝑥 = 𝑦) → 𝑥 = 𝐴)
19		fvmptd.2	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 = 𝐶)
20	18, 19	sylan2 605	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 = 𝐴 ∧ 𝑥 = 𝑦)) → 𝐵 = 𝐶)
21	20	anassrs 473	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 = 𝐴) ∧ 𝑥 = 𝑦) → 𝐵 = 𝐶)
22	13, 14, 16, 21	csbiedf 3884	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = 𝐴) → ⦋𝑦 / 𝑥⦌𝐵 = 𝐶)
23	4, 6, 8, 3, 10, 22	csbie2df 4408	. . . 4 ⊢ (𝜑 → ⦋𝐴 / 𝑥⦌𝐵 = 𝐶)
24		fvmptd.4	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
25	23, 24	eqeltrd 2865	. . 3 ⊢ (𝜑 → ⦋𝐴 / 𝑥⦌𝐵 ∈ 𝑉)
26		eqid 2765	. . . 4 ⊢ (𝑥 ∈ 𝐷 ↦ 𝐵) = (𝑥 ∈ 𝐷 ↦ 𝐵)
27	26	fvmpts 6997	. . 3 ⊢ ((𝐴 ∈ 𝐷 ∧ ⦋𝐴 / 𝑥⦌𝐵 ∈ 𝑉) → ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴) = ⦋𝐴 / 𝑥⦌𝐵)
28	3, 25, 27	syl2anc 596	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴) = ⦋𝐴 / 𝑥⦌𝐵)
29	2, 28, 23	3eqtrd 2804	1 ⊢ (𝜑 → (𝐹‘𝐴) = 𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2146  Ⅎwnfc 2912  Vcvv 3457  ⦋csb 3854   ↦ cmpt 5194  ‘cfv 6540

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548

This theorem is used by:  fvmptd  7001  symgval  19464  mplvrpmga  33958  cfsetsnfsetf  47828  1arymaptfo  49456  2arymaptfo  49467