ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eufnfv Unicode version

Theorem eufnfv 5715
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.
StepHypRef Expression
1 eufnfv.1 . . . . 5  |-  A  e. 
_V
21mptex 5711 . . . 4  |-  ( x  e.  A  |->  B )  e.  _V
3 eqeq2 2175 . . . . . 6  |-  ( y  =  ( x  e.  A  |->  B )  -> 
( f  =  y  <-> 
f  =  ( x  e.  A  |->  B ) ) )
43bibi2d 231 . . . . 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 ) ) ) )
54albidv 1812 . . . 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 ) ) ) )
62, 5spcev 2821 . . 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 2165 . . . . . . 7  |-  ( x  e.  A  |->  B )  =  ( x  e.  A  |->  B )
97, 8fnmpti 5316 . . . . . 6  |-  ( x  e.  A  |->  B )  Fn  A
10 fneq1 5276 . . . . . 6  |-  ( f  =  ( x  e.  A  |->  B )  -> 
( f  Fn  A  <->  ( x  e.  A  |->  B )  Fn  A ) )
119, 10mpbiri 167 . . . . 5  |-  ( f  =  ( x  e.  A  |->  B )  -> 
f  Fn  A )
1211pm4.71ri 390 . . . 4  |-  ( f  =  ( x  e.  A  |->  B )  <->  ( f  Fn  A  /\  f  =  ( x  e.  A  |->  B ) ) )
13 dffn5im 5532 . . . . . . 7  |-  ( f  Fn  A  ->  f  =  ( x  e.  A  |->  ( f `  x ) ) )
1413eqeq1d 2174 . . . . . 6  |-  ( f  Fn  A  ->  (
f  =  ( x  e.  A  |->  B )  <-> 
( x  e.  A  |->  ( f `  x
) )  =  ( x  e.  A  |->  B ) ) )
15 funfvex 5503 . . . . . . . . 9  |-  ( ( Fun  f  /\  x  e.  dom  f )  -> 
( f `  x
)  e.  _V )
1615funfni 5288 . . . . . . . 8  |-  ( ( f  Fn  A  /\  x  e.  A )  ->  ( f `  x
)  e.  _V )
1716ralrimiva 2539 . . . . . . 7  |-  ( f  Fn  A  ->  A. x  e.  A  ( f `  x )  e.  _V )
18 mpteqb 5576 . . . . . . 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 ) )
1917, 18syl 14 . . . . . 6  |-  ( f  Fn  A  ->  (
( x  e.  A  |->  ( f `  x
) )  =  ( x  e.  A  |->  B )  <->  A. x  e.  A  ( f `  x
)  =  B ) )
2014, 19bitrd 187 . . . . 5  |-  ( f  Fn  A  ->  (
f  =  ( x  e.  A  |->  B )  <->  A. x  e.  A  ( f `  x
)  =  B ) )
2120pm5.32i 450 . . . 4  |-  ( ( f  Fn  A  /\  f  =  ( x  e.  A  |->  B ) )  <->  ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  =  B ) )
2212, 21bitr2i 184 . . 3  |-  ( ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  =  B )  <->  f  =  ( x  e.  A  |->  B ) )
236, 22mpg 1439 . 2  |-  E. y A. f ( ( f  Fn  A  /\  A. x  e.  A  (
f `  x )  =  B )  <->  f  =  y )
24 df-eu 2017 . 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 ) )
2523, 24mpbir 145 1  |-  E! f ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  =  B )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104   A.wal 1341    = wceq 1343   E.wex 1480   E!weu 2014    e. wcel 2136   A.wral 2444   _Vcvv 2726    |-> cmpt 4043    Fn wfn 5183   ` cfv 5188
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator