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

Theorem oprabco 5858
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.1 . . . 4  |-  ( ( x  e.  A  /\  y  e.  B )  ->  C  e.  D )
21adantl 271 . . 3  |-  ( ( H  Fn  D  /\  ( x  e.  A  /\  y  e.  B
) )  ->  C  e.  D )
3 oprabco.2 . . . 4  |-  F  =  ( x  e.  A ,  y  e.  B  |->  C )
43a1i 9 . . 3  |-  ( H  Fn  D  ->  F  =  ( x  e.  A ,  y  e.  B  |->  C ) )
5 dffn5im 5240 . . 3  |-  ( H  Fn  D  ->  H  =  ( z  e.  D  |->  ( H `  z ) ) )
6 fveq2 5198 . . 3  |-  ( z  =  C  ->  ( H `  z )  =  ( H `  C ) )
72, 4, 5, 6fmpt2co 5857 . 2  |-  ( H  Fn  D  ->  ( H  o.  F )  =  ( x  e.  A ,  y  e.  B  |->  ( H `  C ) ) )
8 oprabco.3 . 2  |-  G  =  ( x  e.  A ,  y  e.  B  |->  ( H `  C
) )
97, 8syl6reqr 2132 1  |-  ( H  Fn  D  ->  G  =  ( H  o.  F ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    = wceq 1284    e. wcel 1433    o. ccom 4367    Fn wfn 4917   ` cfv 4922    |-> cmpt2 5534
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-fv 4930  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788
This theorem is referenced by:  oprab2co  5859
  Copyright terms: Public domain W3C validator