Theorem eufnfv 5389

Description: A function is uniquely determined by its values. (Contributed by NM, 31-Aug-2011.)

Hypotheses

Ref	Expression
eufnfv.1	|- A e. _V
eufnfv.2	|- B e. _V

Assertion

Ref	Expression
eufnfv	|- E! f ( f Fn A /\ A. x e. A ( f ` x ) = B )

Distinct variable groups:   x, f, A   B, f

Allowed substitution hint:   B( x)

Proof of Theorem eufnfv

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eufnfv.1	. . . . 5 |- A e. _V
2	1	mptex 5387	. . . 4 |- ( x e. A |-> B ) e. _V
3		eqeq2 2049	. . . . . 6 |- ( y = ( x e. A |-> B ) -> ( f = y <-> f = ( x e. A |-> B ) ) )
4	3	bibi2d 221	. . . . 5 |- ( y = ( x e. A |-> B ) -> ( ( ( f Fn A /\ A. x e. A ( f ` x ) = B ) <-> f = y ) <-> ( ( f Fn A /\ A. x e. A ( f ` x ) = B ) <-> f = ( x e. A |-> B ) ) ) )
5	4	albidv 1705	. . . 4 |- ( y = ( x e. A |-> B ) -> ( A. f ( ( f Fn A /\ A. x e. A ( f ` x ) = B ) <-> f = y ) <-> A. f ( ( f Fn A /\ A. x e. A ( f ` x ) = B ) <-> f = ( x e. A |-> B ) ) ) )
6	2, 5	spcev 2647	. . 3 |- ( A. f ( ( f Fn A /\ A. x e. A ( f ` x ) = B ) <-> f = ( x e. A |-> B ) ) -> E. y A. f ( ( f Fn A /\ A. x e. A ( f ` x ) = B ) <-> f = y ) )
7		eufnfv.2	. . . . . . 7 |- B e. _V
8		eqid 2040	. . . . . . 7 |- ( x e. A |-> B ) = ( x e. A |-> B )
9	7, 8	fnmpti 5027	. . . . . 6 |- ( x e. A |-> B ) Fn A
10		fneq1 4987	. . . . . 6 |- ( f = ( x e. A |-> B ) -> ( f Fn A <-> ( x e. A |-> B ) Fn A ) )
11	9, 10	mpbiri 157	. . . . 5 |- ( f = ( x e. A |-> B ) -> f Fn A )
12	11	pm4.71ri 372	. . . 4 |- ( f = ( x e. A |-> B ) <-> ( f Fn A /\ f = ( x e. A |-> B ) ) )
13		dffn5im 5219	. . . . . . 7 |- ( f Fn A -> f = ( x e. A |-> ( f ` x ) ) )
14	13	eqeq1d 2048	. . . . . 6 |- ( f Fn A -> ( f = ( x e. A |-> B ) <-> ( x e. A |-> ( f ` x ) ) = ( x e. A |-> B ) ) )
15		funfvex 5192	. . . . . . . . 9 |- ( ( Fun f /\ x e. dom f ) -> ( f ` x ) e. _V )
16	15	funfni 4999	. . . . . . . 8 |- ( ( f Fn A /\ x e. A ) -> ( f ` x ) e. _V )
17	16	ralrimiva 2392	. . . . . . 7 |- ( f Fn A -> A. x e. A ( f ` x ) e. _V )
18		mpteqb 5261	. . . . . . 7 |- ( A. x e. A ( f ` x ) e. _V -> ( ( x e. A |-> ( f ` x ) ) = ( x e. A |-> B ) <-> A. x e. A ( f ` x ) = B ) )
19	17, 18	syl 14	. . . . . 6 |- ( f Fn A -> ( ( x e. A |-> ( f ` x ) ) = ( x e. A |-> B ) <-> A. x e. A ( f ` x ) = B ) )
20	14, 19	bitrd 177	. . . . 5 |- ( f Fn A -> ( f = ( x e. A |-> B ) <-> A. x e. A ( f ` x ) = B ) )
21	20	pm5.32i 427	. . . 4 |- ( ( f Fn A /\ f = ( x e. A |-> B ) ) <-> ( f Fn A /\ A. x e. A ( f ` x ) = B ) )
22	12, 21	bitr2i 174	. . 3 |- ( ( f Fn A /\ A. x e. A ( f ` x ) = B ) <-> f = ( x e. A |-> B ) )
23	6, 22	mpg 1340	. 2 |- E. y A. f ( ( f Fn A /\ A. x e. A ( f ` x ) = B ) <-> f = y )
24		df-eu 1903	. 2 |- ( E! f ( f Fn A /\ A. x e. A ( f ` x ) = B ) <-> E. y A. f ( ( f Fn A /\ A. x e. A ( f ` x ) = B ) <-> f = y ) )
25	23, 24	mpbir 134	1 |- E! f ( f Fn A /\ A. x e. A ( f ` x ) = B )

Syntax hints:   /\ wa 97   <-> wb 98   A.wal 1241   = wceq 1243   E.wex 1381   e. wcel 1393   E!weu 1900   A.wral 2306   _Vcvv 2557   |-> cmpt 3818   Fn wfn 4897   ` 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-coll 3872  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-reu 2313  df-rab 2315  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-iun 3659  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-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910

This theorem is referenced by: (None)