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

Theorem fnimapr 5763
Description: The image of a pair under a function. (Contributed by Jeff Madsen, 6-Jan-2011.)
Assertion
Ref Expression
fnimapr  |-  ( ( F  Fn  A  /\  B  e.  A  /\  C  e.  A )  ->  ( F " { B ,  C }
)  =  { ( F `  B ) ,  ( F `  C ) } )

Proof of Theorem fnimapr
StepHypRef Expression
1 fnsnfv 5762 . . . . 5  |-  ( ( F  Fn  A  /\  B  e.  A )  ->  { ( F `  B ) }  =  ( F " { B } ) )
213adant3 1048 . . . 4  |-  ( ( F  Fn  A  /\  B  e.  A  /\  C  e.  A )  ->  { ( F `  B ) }  =  ( F " { B } ) )
3 fnsnfv 5762 . . . . 5  |-  ( ( F  Fn  A  /\  C  e.  A )  ->  { ( F `  C ) }  =  ( F " { C } ) )
433adant2 1047 . . . 4  |-  ( ( F  Fn  A  /\  B  e.  A  /\  C  e.  A )  ->  { ( F `  C ) }  =  ( F " { C } ) )
52, 4uneq12d 3384 . . 3  |-  ( ( F  Fn  A  /\  B  e.  A  /\  C  e.  A )  ->  ( { ( F `
 B ) }  u.  { ( F `
 C ) } )  =  ( ( F " { B } )  u.  ( F " { C }
) ) )
65eqcomd 2244 . 2  |-  ( ( F  Fn  A  /\  B  e.  A  /\  C  e.  A )  ->  ( ( F " { B } )  u.  ( F " { C } ) )  =  ( { ( F `
 B ) }  u.  { ( F `
 C ) } ) )
7 df-pr 3716 . . . 4  |-  { B ,  C }  =  ( { B }  u.  { C } )
87imaeq2i 5124 . . 3  |-  ( F
" { B ,  C } )  =  ( F " ( { B }  u.  { C } ) )
9 imaundi 5200 . . 3  |-  ( F
" ( { B }  u.  { C } ) )  =  ( ( F " { B } )  u.  ( F " { C } ) )
108, 9eqtri 2259 . 2  |-  ( F
" { B ,  C } )  =  ( ( F " { B } )  u.  ( F " { C }
) )
11 df-pr 3716 . 2  |-  { ( F `  B ) ,  ( F `  C ) }  =  ( { ( F `  B ) }  u.  { ( F `  C
) } )
126, 10, 113eqtr4g 2296 1  |-  ( ( F  Fn  A  /\  B  e.  A  /\  C  e.  A )  ->  ( F " { B ,  C }
)  =  { ( F `  B ) ,  ( F `  C ) } )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ w3a 1009    = wceq 1402    e. wcel 2209    u. cun 3218   {csn 3709   {cpr 3710   "cima 4777    Fn wfn 5372   ` cfv 5377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385
This theorem is used by:  en2  7112  fvinim0ffz  10660
  Copyright terms: Public domain W3C validator