Theorem fnmptfvd 5633

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 2560	. . . 4 |- ( ph -> A. a e. A C e. V )
4		eqid 2187	. . . . 5 |- ( a e. A |-> C ) = ( a e. A |-> C )
5	4	fnmpt 5354	. . . 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 5626	. . 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 4111	. . . . . . 7 |- ( i e. A |-> D ) = ( a e. A |-> C )
11	10	eqcomi 2191	. . . . . 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 5529	. . . 4 |- ( ph -> ( ( a e. A |-> C ) ` i ) = ( ( i e. A |-> D ) ` i ) )
14	13	eqeq2d 2199	. . 3 |- ( ph -> ( ( M ` i ) = ( ( a e. A |-> C ) ` i ) <-> ( M ` i ) = ( ( i e. A |-> D ) ` i ) ) )
15	14	ralbidv 2487	. 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 2187	. . . . . 6 |- ( i e. A |-> D ) = ( i e. A |-> D )
19	18	fvmpt2 5612	. . . . 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 2199	. . 3 |- ( ( ph /\ i e. A ) -> ( ( M ` i ) = ( ( i e. A |-> D ) ` i ) <-> ( M ` i ) = D ) )
22	21	ralbidva 2483	. 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 1363   e. wcel 2158   A.wral 2465   |-> cmpt 4076   Fn wfn 5223   ` cfv 5228

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 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221

This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ral 2470  df-rex 2471  df-v 2751  df-sbc 2975  df-csb 3070  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-br 4016  df-opab 4077  df-mpt 4078  df-id 4305  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-iota 5190  df-fun 5230  df-fn 5231  df-fv 5236

This theorem is referenced by:  nninfdcinf  7182  nninfwlporlemd  7183  nninfwlporlem  7184