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

Theorem oprabco 6457
Description: Composition of a function with an operator abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 26-Sep-2015.)
Hypotheses
Ref Expression
oprabco.1  |-  ( ( x  e.  A  /\  y  e.  B )  ->  C  e.  D )
oprabco.2  |-  F  =  ( x  e.  A ,  y  e.  B  |->  C )
oprabco.3  |-  G  =  ( x  e.  A ,  y  e.  B  |->  ( H `  C
) )
Assertion
Ref Expression
oprabco  |-  ( H  Fn  D  ->  G  =  ( H  o.  F ) )
Distinct variable groups:    x, y, A   
x, B, y    x, D, y    x, H, y
Allowed substitution hints:    C( x,  y)    F( x,  y)    G( x,  y)

Proof of Theorem oprabco
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 oprabco.3 . 2  |-  G  =  ( x  e.  A ,  y  e.  B  |->  ( H `  C
) )
2 oprabco.1 . . . 4  |-  ( ( x  e.  A  /\  y  e.  B )  ->  C  e.  D )
32adantl 277 . . 3  |-  ( ( H  Fn  D  /\  ( x  e.  A  /\  y  e.  B
) )  ->  C  e.  D )
4 oprabco.2 . . . 4  |-  F  =  ( x  e.  A ,  y  e.  B  |->  C )
54a1i 9 . . 3  |-  ( H  Fn  D  ->  F  =  ( x  e.  A ,  y  e.  B  |->  C ) )
6 dffn5im 5751 . . 3  |-  ( H  Fn  D  ->  H  =  ( z  e.  D  |->  ( H `  z ) ) )
7 fveq2 5698 . . 3  |-  ( z  =  C  ->  ( H `  z )  =  ( H `  C ) )
83, 5, 6, 7fmpoco 6456 . 2  |-  ( H  Fn  D  ->  ( H  o.  F )  =  ( x  e.  A ,  y  e.  B  |->  ( H `  C ) ) )
91, 8eqtr4id 2290 1  |-  ( H  Fn  D  ->  G  =  ( H  o.  F ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209    o. ccom 4780    Fn wfn 5375   ` cfv 5380    e. cmpo 6090
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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580
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-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379
This theorem is used by:  oprab2co  6458
  Copyright terms: Public domain W3C validator