MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnbrfvb Unicode version

Theorem fnbrfvb 5579
Description: Equivalence of function value and binary relation. (Contributed by NM, 19-Apr-2004.) (Revised by Mario Carneiro, 28-Apr-2015.)
Assertion
Ref Expression
fnbrfvb  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  ( ( F `  B )  =  C  <-> 
B F C ) )

Proof of Theorem fnbrfvb
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 eqid 2296 . . . 4  |-  ( F `
 B )  =  ( F `  B
)
2 fvex 5555 . . . . 5  |-  ( F `
 B )  e. 
_V
3 eqeq2 2305 . . . . . . 7  |-  ( x  =  ( F `  B )  ->  (
( F `  B
)  =  x  <->  ( F `  B )  =  ( F `  B ) ) )
4 breq2 4043 . . . . . . 7  |-  ( x  =  ( F `  B )  ->  ( B F x  <->  B F
( F `  B
) ) )
53, 4bibi12d 312 . . . . . 6  |-  ( x  =  ( F `  B )  ->  (
( ( F `  B )  =  x  <-> 
B F x )  <-> 
( ( F `  B )  =  ( F `  B )  <-> 
B F ( F `
 B ) ) ) )
65imbi2d 307 . . . . 5  |-  ( x  =  ( F `  B )  ->  (
( ( F  Fn  A  /\  B  e.  A
)  ->  ( ( F `  B )  =  x  <->  B F x ) )  <->  ( ( F  Fn  A  /\  B  e.  A )  ->  (
( F `  B
)  =  ( F `
 B )  <->  B F
( F `  B
) ) ) ) )
7 fneu 5364 . . . . . 6  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  E! x  B F x )
8 tz6.12c 5563 . . . . . 6  |-  ( E! x  B F x  ->  ( ( F `
 B )  =  x  <->  B F x ) )
97, 8syl 15 . . . . 5  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  ( ( F `  B )  =  x  <-> 
B F x ) )
102, 6, 9vtocl 2851 . . . 4  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  ( ( F `  B )  =  ( F `  B )  <-> 
B F ( F `
 B ) ) )
111, 10mpbii 202 . . 3  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  B F ( F `
 B ) )
12 breq2 4043 . . 3  |-  ( ( F `  B )  =  C  ->  ( B F ( F `  B )  <->  B F C ) )
1311, 12syl5ibcom 211 . 2  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  ( ( F `  B )  =  C  ->  B F C ) )
14 fnfun 5357 . . . 4  |-  ( F  Fn  A  ->  Fun  F )
15 funbrfv 5577 . . . 4  |-  ( Fun 
F  ->  ( B F C  ->  ( F `
 B )  =  C ) )
1614, 15syl 15 . . 3  |-  ( F  Fn  A  ->  ( B F C  ->  ( F `  B )  =  C ) )
1716adantr 451 . 2  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  ( B F C  ->  ( F `  B )  =  C ) )
1813, 17impbid 183 1  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  ( ( F `  B )  =  C  <-> 
B F C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1632    e. wcel 1696   E!weu 2156   class class class wbr 4039   Fun wfun 5265    Fn wfn 5266   ` cfv 5271
This theorem is referenced by:  fnopfvb  5580  funbrfvb  5581  dffn5  5584  fnsnfv  5598  fndmdif  5645  dffo4  5692  dff13  5799  isomin  5850  isoini  5851  1stconst  6223  2ndconst  6224  fsplit  6239  seqomlem3  6480  seqomlem4  6481  nqerrel  8572  imasleval  13459  znleval  16524  elnlfn  22524  adjbd1o  22681  feqmptdf  23243  br1steq  24201  br2ndeq  24202  trpredpred  24302  fvbigcup  24513  fvsingle  24530  imageval  24540  brfullfun  24558  axcontlem5  24668  pw2f1ocnv  27233  funressnfv  28096  fnbrafvb  28122
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pr 4230
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-iota 5235  df-fun 5273  df-fn 5274  df-fv 5279
  Copyright terms: Public domain W3C validator