Theorem fnmptfvd 5684

Description: A function with a given domain is a mapping defined by its function values. (Contributed by AV, 1-Mar-2019.)

Hypotheses

Ref	Expression
fnmptfvd.m	|- ( ph -> M Fn A )
fnmptfvd.s	|- ( i = a -> D = C )
fnmptfvd.d	|- ( ( ph /\ i e. A ) -> D e. U )
fnmptfvd.c	|- ( ( ph /\ a e. A ) -> C e. V )

Assertion

Ref	Expression
fnmptfvd	|- ( ph -> ( M = ( a e. A |-> C ) <-> A. i e. A ( M ` i ) = D ) )

Distinct variable groups:   A, a, i   C, i   D, a   M, a, i   U, a, i   V, a, i   ph, a, i

Allowed substitution hints:   C( a)   D( i)

Proof of Theorem fnmptfvd

Step	Hyp	Ref	Expression
1		fnmptfvd.m	. . 3 |- ( ph -> M Fn A )
2		fnmptfvd.c	. . . . 5 |- ( ( ph /\ a e. A ) -> C e. V )
3	2	ralrimiva 2579	. . . 4 |- ( ph -> A. a e. A C e. V )
4		eqid 2205	. . . . 5 |- ( a e. A |-> C ) = ( a e. A |-> C )
5	4	fnmpt 5402	. . . 4 |- ( A. a e. A C e. V -> ( a e. A |-> C ) Fn A )
6	3, 5	syl 14	. . 3 |- ( ph -> ( a e. A |-> C ) Fn A )
7		eqfnfv 5677	. . 3 |- ( ( M Fn A /\ ( a e. A |-> C ) Fn A ) -> ( M = ( a e. A |-> C ) <-> A. i e. A ( M ` i ) = ( ( a e. A |-> C ) ` i ) ) )
8	1, 6, 7	syl2anc 411	. 2 |- ( ph -> ( M = ( a e. A |-> C ) <-> A. i e. A ( M ` i ) = ( ( a e. A |-> C ) ` i ) ) )
9		fnmptfvd.s	. . . . . . . 8 |- ( i = a -> D = C )
10	9	cbvmptv 4140	. . . . . . 7 |- ( i e. A |-> D ) = ( a e. A |-> C )
11	10	eqcomi 2209	. . . . . 6 |- ( a e. A |-> C ) = ( i e. A |-> D )
12	11	a1i 9	. . . . 5 |- ( ph -> ( a e. A |-> C ) = ( i e. A |-> D ) )
13	12	fveq1d 5578	. . . 4 |- ( ph -> ( ( a e. A |-> C ) ` i ) = ( ( i e. A |-> D ) ` i ) )
14	13	eqeq2d 2217	. . 3 |- ( ph -> ( ( M ` i ) = ( ( a e. A |-> C ) ` i ) <-> ( M ` i ) = ( ( i e. A |-> D ) ` i ) ) )
15	14	ralbidv 2506	. 2 |- ( ph -> ( A. i e. A ( M ` i ) = ( ( a e. A |-> C ) ` i ) <-> A. i e. A ( M ` i ) = ( ( i e. A |-> D ) ` i ) ) )
16		simpr 110	. . . . 5 |- ( ( ph /\ i e. A ) -> i e. A )
17		fnmptfvd.d	. . . . 5 |- ( ( ph /\ i e. A ) -> D e. U )
18		eqid 2205	. . . . . 6 |- ( i e. A |-> D ) = ( i e. A |-> D )
19	18	fvmpt2 5663	. . . . 5 |- ( ( i e. A /\ D e. U ) -> ( ( i e. A |-> D ) ` i ) = D )
20	16, 17, 19	syl2anc 411	. . . 4 |- ( ( ph /\ i e. A ) -> ( ( i e. A |-> D ) ` i ) = D )
21	20	eqeq2d 2217	. . 3 |- ( ( ph /\ i e. A ) -> ( ( M ` i ) = ( ( i e. A |-> D ) ` i ) <-> ( M ` i ) = D ) )
22	21	ralbidva 2502	. 2 |- ( ph -> ( A. i e. A ( M ` i ) = ( ( i e. A |-> D ) ` i ) <-> A. i e. A ( M ` i ) = D ) )
23	8, 15, 22	3bitrd 214	1 |- ( ph -> ( M = ( a e. A |-> C ) <-> A. i e. A ( M ` i ) = D ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1373   e. wcel 2176   A.wral 2484   |-> cmpt 4105   Fn wfn 5266   ` cfv 5271

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-iota 5232  df-fun 5273  df-fn 5274  df-fv 5279

This theorem is referenced by:  nninfdcinf  7273  nninfwlporlemd  7274  nninfwlporlem  7275