Theorem fvmptdf 5793

Description: Alternate deduction version of fvmpt 5782, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.)

Hypotheses

Ref	Expression
fvmptdf.1	|- ( ph -> A e. D )
fvmptdf.2	|- ( ( ph /\ x = A ) -> B e. V )
fvmptdf.3	|- ( ( ph /\ x = A ) -> ( ( F ` A ) = B -> ps ) )
fvmptdf.4	|- F/_ x F
fvmptdf.5	|- F/ x ps

Assertion

Ref	Expression
fvmptdf	|- ( ph -> ( F = ( x e. D |-> B ) -> ps ) )

Distinct variable groups:   x, A   x, D   ph, x

Allowed substitution hints:   ps( x)   B( x)   F( x)   V( x)

Proof of Theorem fvmptdf

Step	Hyp	Ref	Expression
1		nfv 1581	. 2 |- F/ x ph
2		fvmptdf.4	. . . 4 |- F/_ x F
3		nfmpt1 4224	. . . 4 |- F/_ x ( x e. D |-> B )
4	2, 3	nfeq 2400	. . 3 |- F/ x F = ( x e. D |-> B )
5		fvmptdf.5	. . 3 |- F/ x ps
6	4, 5	nfim 1625	. 2 |- F/ x ( F = ( x e. D |-> B ) -> ps )
7		fvmptdf.1	. . . 4 |- ( ph -> A e. D )
8		elex 2833	. . . 4 |- ( A e. D -> A e. _V )
9	7, 8	syl 14	. . 3 |- ( ph -> A e. _V )
10		isset 2828	. . 3 |- ( A e. _V <-> E. x x = A )
11	9, 10	sylib 122	. 2 |- ( ph -> E. x x = A )
12		fveq1 5694	. . 3 |- ( F = ( x e. D |-> B ) -> ( F ` A ) = ( ( x e. D |-> B ) ` A ) )
13		simpr 110	. . . . . . 7 |- ( ( ph /\ x = A ) -> x = A )
14	13	fveq2d 5699	. . . . . 6 |- ( ( ph /\ x = A ) -> ( ( x e. D |-> B ) ` x ) = ( ( x e. D |-> B ) ` A ) )
15	7	adantr 276	. . . . . . . 8 |- ( ( ph /\ x = A ) -> A e. D )
16	13, 15	eqeltrd 2315	. . . . . . 7 |- ( ( ph /\ x = A ) -> x e. D )
17		fvmptdf.2	. . . . . . 7 |- ( ( ph /\ x = A ) -> B e. V )
18		eqid 2238	. . . . . . . 8 |- ( x e. D |-> B ) = ( x e. D |-> B )
19	18	fvmpt2 5789	. . . . . . 7 |- ( ( x e. D /\ B e. V ) -> ( ( x e. D |-> B ) ` x ) = B )
20	16, 17, 19	syl2anc 415	. . . . . 6 |- ( ( ph /\ x = A ) -> ( ( x e. D |-> B ) ` x ) = B )
21	14, 20	eqtr3d 2273	. . . . 5 |- ( ( ph /\ x = A ) -> ( ( x e. D |-> B ) ` A ) = B )
22	21	eqeq2d 2250	. . . 4 |- ( ( ph /\ x = A ) -> ( ( F ` A ) = ( ( x e. D |-> B ) ` A ) <-> ( F ` A ) = B ) )
23		fvmptdf.3	. . . 4 |- ( ( ph /\ x = A ) -> ( ( F ` A ) = B -> ps ) )
24	22, 23	sylbid 150	. . 3 |- ( ( ph /\ x = A ) -> ( ( F ` A ) = ( ( x e. D |-> B ) ` A ) -> ps ) )
25	12, 24	syl5 32	. 2 |- ( ( ph /\ x = A ) -> ( F = ( x e. D |-> B ) -> ps ) )
26	1, 6, 11, 25	exlimdd 1925	1 |- ( ph -> ( F = ( x e. D |-> B ) -> ps ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   F/wnf 1513   E.wex 1545   e. wcel 2209   F/_wnfc 2379   _Vcvv 2821   |-> cmpt 4192   ` cfv 5377

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385

This theorem is used by:  fvmptdv  5794