Theorem fvmptdf 7029

Description: Deduction version of fvmptd 7030 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 6916	. 2 ⊢ (𝜑 → (𝐹‘𝐴) = ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴))
3		fvmptd.3	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐷)
4		fvmptdf.p	. . . . 5 ⊢ Ⅎ𝑥𝜑
5		nfcsb1v 3875	. . . . . 6 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵
6	5	a1i 11	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵)
7		fvmptdf.c	. . . . . 6 ⊢ Ⅎ𝑥𝐶
8	7	a1i 11	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝐶)
9		csbeq1a 3865	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵)
10	9	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵)
11		fvmptdf.a	. . . . . . . 8 ⊢ Ⅎ𝑥𝐴
12	11	nfeq2 2943	. . . . . . 7 ⊢ Ⅎ𝑥 𝑦 = 𝐴
13	4, 12	nfan 1934	. . . . . 6 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑦 = 𝐴)
14	7	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = 𝐴) → Ⅎ𝑥𝐶)
15		vex 3458	. . . . . . 7 ⊢ 𝑦 ∈ V
16	15	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = 𝐴) → 𝑦 ∈ V)
17		eqtr 2783	. . . . . . . . 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 3881	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = 𝐴) → ⦋𝑦 / 𝑥⦌𝐵 = 𝐶)
23	4, 6, 8, 3, 10, 22	csbie2df 4404	. . . 4 ⊢ (𝜑 → ⦋𝐴 / 𝑥⦌𝐵 = 𝐶)
24		fvmptd.4	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
25	23, 24	eqeltrd 2864	. . 3 ⊢ (𝜑 → ⦋𝐴 / 𝑥⦌𝐵 ∈ 𝑉)
26		eqid 2763	. . . 4 ⊢ (𝑥 ∈ 𝐷 ↦ 𝐵) = (𝑥 ∈ 𝐷 ↦ 𝐵)
27	26	fvmpts 7026	. . 3 ⊢ ((𝐴 ∈ 𝐷 ∧ ⦋𝐴 / 𝑥⦌𝐵 ∈ 𝑉) → ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴) = ⦋𝐴 / 𝑥⦌𝐵)
28	3, 25, 27	syl2anc 596	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴) = ⦋𝐴 / 𝑥⦌𝐵)
29	2, 28, 23	3eqtrd 2802	1 ⊢ (𝜑 → (𝐹‘𝐴) = 𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2147  Ⅎwnfc 2911  Vcvv 3454  ⦋csb 3851   ↦ cmpt 5190  ‘cfv 6564

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-pr 5396

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-iota 6518  df-fun 6566  df-fv 6572

This theorem is used by:  fvmptd  7030  symgval  19627  mplvrpmga  34281  cfsetsnfsetf  48395  1arymaptfo  50080  2arymaptfo  50091