Theorem fvmptf 5263

Description: Value of a function given by an ordered-pair class abstraction. This version of fvmptg 5248 uses bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 8-Nov-2005.) (Revised by Mario Carneiro, 15-Oct-2016.)

Hypotheses

Ref	Expression
fvmptf.1	⊢ Ⅎ𝑥𝐴
fvmptf.2	⊢ Ⅎ𝑥𝐶
fvmptf.3	⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)
fvmptf.4	⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵)

Assertion

Ref	Expression
fvmptf	⊢ ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ 𝑉) → (𝐹‘𝐴) = 𝐶)

Distinct variable group:   𝑥,𝐷

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

Proof of Theorem fvmptf

Step	Hyp	Ref	Expression
1		elex 2566	. . 3 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V)
2		fvmptf.1	. . . 4 ⊢ Ⅎ𝑥𝐴
3		fvmptf.2	. . . . . 6 ⊢ Ⅎ𝑥𝐶
4	3	nfel1 2188	. . . . 5 ⊢ Ⅎ𝑥 𝐶 ∈ V
5		fvmptf.4	. . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵)
6		nfmpt1 3850	. . . . . . . 8 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐷 ↦ 𝐵)
7	5, 6	nfcxfr 2175	. . . . . . 7 ⊢ Ⅎ𝑥𝐹
8	7, 2	nffv 5185	. . . . . 6 ⊢ Ⅎ𝑥(𝐹‘𝐴)
9	8, 3	nfeq 2185	. . . . 5 ⊢ Ⅎ𝑥(𝐹‘𝐴) = 𝐶
10	4, 9	nfim 1464	. . . 4 ⊢ Ⅎ𝑥(𝐶 ∈ V → (𝐹‘𝐴) = 𝐶)
11		fvmptf.3	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)
12	11	eleq1d 2106	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝐵 ∈ V ↔ 𝐶 ∈ V))
13		fveq2 5178	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝐹‘𝑥) = (𝐹‘𝐴))
14	13, 11	eqeq12d 2054	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥) = 𝐵 ↔ (𝐹‘𝐴) = 𝐶))
15	12, 14	imbi12d 223	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝐵 ∈ V → (𝐹‘𝑥) = 𝐵) ↔ (𝐶 ∈ V → (𝐹‘𝐴) = 𝐶)))
16	5	fvmpt2 5254	. . . . 5 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝐵 ∈ V) → (𝐹‘𝑥) = 𝐵)
17	16	ex 108	. . . 4 ⊢ (𝑥 ∈ 𝐷 → (𝐵 ∈ V → (𝐹‘𝑥) = 𝐵))
18	2, 10, 15, 17	vtoclgaf 2618	. . 3 ⊢ (𝐴 ∈ 𝐷 → (𝐶 ∈ V → (𝐹‘𝐴) = 𝐶))
19	1, 18	syl5 28	. 2 ⊢ (𝐴 ∈ 𝐷 → (𝐶 ∈ 𝑉 → (𝐹‘𝐴) = 𝐶))
20	19	imp 115	1 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ 𝑉) → (𝐹‘𝐴) = 𝐶)

Syntax hints:   → wi 4   ∧ wa 97   = wceq 1243   ∈ wcel 1393  Ⅎwnfc 2165  Vcvv 2557   ↦ cmpt 3818  ‘cfv 4902

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-sbc 2765  df-csb 2853  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-iota 4867  df-fun 4904  df-fv 4910

This theorem is referenced by: (None)