Theorem fvmptf 5723

Description: Value of a function given by an ordered-pair class abstraction. This version of fvmptg 5699 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	|- F/_xA
fvmptf.2	|- F/_xC
fvmptf.3	|- (x = A -> B = C)
fvmptf.4	|- F = (x e. D |-> B)

Assertion

Ref	Expression
fvmptf	|- ((A e. D /\ C e. V) -> (F` A) = C)

Distinct variable group:   x,D

Allowed substitution hints:   A(x)   B(x)   C(x)   F(x)   V(x)

Proof of Theorem fvmptf

Step	Hyp	Ref	Expression
1		elex 2868	. . 3 |- (C e. V -> C e. _V)
2		fvmptf.1	. . . 4 |- F/_xA
3		fvmptf.2	. . . . . 6 |- F/_xC
4	3	nfel1 2500	. . . . 5 |- F/x C e. _V
5		fvmptf.4	. . . . . . . 8 |- F = (x e. D |-> B)
6		nfmpt1 5673	. . . . . . . 8 |- F/_x(x e. D |-> B)
7	5, 6	nfcxfr 2487	. . . . . . 7 |- F/_xF
8	7, 2	nffv 5335	. . . . . 6 |- F/_x(F` A)
9	8, 3	nfeq 2497	. . . . 5 |- F/x(F` A) = C
10	4, 9	nfim 1813	. . . 4 |- F/x(C e. _V -> (F` A) = C)
11		fvmptf.3	. . . . . 6 |- (x = A -> B = C)
12	11	eleq1d 2419	. . . . 5 |- (x = A -> (B e. _V <-> C e. _V))
13		fveq2 5329	. . . . . 6 |- (x = A -> (F` x) = (F` A))
14	13, 11	eqeq12d 2367	. . . . 5 |- (x = A -> ((F` x) = B <-> (F` A) = C))
15	12, 14	imbi12d 311	. . . 4 |- (x = A -> ((B e. _V -> (F` x) = B) <-> (C e. _V -> (F` A) = C)))
16	5	fvmpt2 5705	. . . . 5 |- ((x e. D /\ B e. _V) -> (F` x) = B)
17	16	ex 423	. . . 4 |- (x e. D -> (B e. _V -> (F` x) = B))
18	2, 10, 15, 17	vtoclgaf 2920	. . 3 |- (A e. D -> (C e. _V -> (F` A) = C))
19	1, 18	syl5 28	. 2 |- (A e. D -> (C e. V -> (F` A) = C))
20	19	imp 418	1 |- ((A e. D /\ C e. V) -> (F` A) = C)

Syntax hints:   -> wi 4   /\ wa 358   = wceq 1642   e. wcel 1710   F/_wnfc 2477  _Vcvv 2860  ` cfv 4782   |-> cmpt 5652

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-reu 2622  df-rmo 2623  df-rab 2624  df-v 2862  df-sbc 3048  df-csb 3138  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-pss 3262  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-iota 4340  df-0c 4378  df-addc 4379  df-nnc 4380  df-fin 4381  df-lefin 4441  df-ltfin 4442  df-ncfin 4443  df-tfin 4444  df-evenfin 4445  df-oddfin 4446  df-sfin 4447  df-spfin 4448  df-phi 4566  df-op 4567  df-proj1 4568  df-proj2 4569  df-opab 4624  df-br 4641  df-co 4727  df-ima 4728  df-id 4768  df-cnv 4786  df-rn 4787  df-dm 4788  df-fun 4790  df-fn 4791  df-fv 4796  df-mpt 5653

This theorem is referenced by:  fvmptnf  5724