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

Theorem ofco 6285
Description: The composition of a function operation with another function. (Contributed by Mario Carneiro, 19-Dec-2014.)
Hypotheses
Ref Expression
ofco.1  |-  ( ph  ->  F  Fn  A )
ofco.2  |-  ( ph  ->  G  Fn  B )
ofco.3  |-  ( ph  ->  H : D --> C )
ofco.4  |-  ( ph  ->  A  e.  V )
ofco.5  |-  ( ph  ->  B  e.  W )
ofco.6  |-  ( ph  ->  D  e.  X )
ofco.7  |-  ( A  i^i  B )  =  C
Assertion
Ref Expression
ofco  |-  ( ph  ->  ( ( F  oF R G )  o.  H )  =  ( ( F  o.  H )  oF R ( G  o.  H ) ) )

Proof of Theorem ofco
Dummy variables  y  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ofco.3 . . . 4  |-  ( ph  ->  H : D --> C )
21ffvelcdmda 5812 . . 3  |-  ( (
ph  /\  x  e.  D )  ->  ( H `  x )  e.  C )
31feqmptd 5730 . . 3  |-  ( ph  ->  H  =  ( x  e.  D  |->  ( H `
 x ) ) )
4 ofco.1 . . . 4  |-  ( ph  ->  F  Fn  A )
5 ofco.2 . . . 4  |-  ( ph  ->  G  Fn  B )
6 ofco.4 . . . 4  |-  ( ph  ->  A  e.  V )
7 ofco.5 . . . 4  |-  ( ph  ->  B  e.  W )
8 ofco.7 . . . 4  |-  ( A  i^i  B )  =  C
9 eqidd 2233 . . . 4  |-  ( (
ph  /\  y  e.  A )  ->  ( F `  y )  =  ( F `  y ) )
10 eqidd 2233 . . . 4  |-  ( (
ph  /\  y  e.  B )  ->  ( G `  y )  =  ( G `  y ) )
114, 5, 6, 7, 8, 9, 10offval 6274 . . 3  |-  ( ph  ->  ( F  oF R G )  =  ( y  e.  C  |->  ( ( F `  y ) R ( G `  y ) ) ) )
12 fveq2 5670 . . . 4  |-  ( y  =  ( H `  x )  ->  ( F `  y )  =  ( F `  ( H `  x ) ) )
13 fveq2 5670 . . . 4  |-  ( y  =  ( H `  x )  ->  ( G `  y )  =  ( G `  ( H `  x ) ) )
1412, 13oveq12d 6068 . . 3  |-  ( y  =  ( H `  x )  ->  (
( F `  y
) R ( G `
 y ) )  =  ( ( F `
 ( H `  x ) ) R ( G `  ( H `  x )
) ) )
152, 3, 11, 14fmptco 5843 . 2  |-  ( ph  ->  ( ( F  oF R G )  o.  H )  =  ( x  e.  D  |->  ( ( F `  ( H `  x ) ) R ( G `
 ( H `  x ) ) ) ) )
16 inss1 3441 . . . . . 6  |-  ( A  i^i  B )  C_  A
178, 16eqsstrri 3271 . . . . 5  |-  C  C_  A
18 fss 5521 . . . . 5  |-  ( ( H : D --> C  /\  C  C_  A )  ->  H : D --> A )
191, 17, 18sylancl 413 . . . 4  |-  ( ph  ->  H : D --> A )
20 fnfco 5539 . . . 4  |-  ( ( F  Fn  A  /\  H : D --> A )  ->  ( F  o.  H )  Fn  D
)
214, 19, 20syl2anc 411 . . 3  |-  ( ph  ->  ( F  o.  H
)  Fn  D )
22 inss2 3442 . . . . . 6  |-  ( A  i^i  B )  C_  B
238, 22eqsstrri 3271 . . . . 5  |-  C  C_  B
24 fss 5521 . . . . 5  |-  ( ( H : D --> C  /\  C  C_  B )  ->  H : D --> B )
251, 23, 24sylancl 413 . . . 4  |-  ( ph  ->  H : D --> B )
26 fnfco 5539 . . . 4  |-  ( ( G  Fn  B  /\  H : D --> B )  ->  ( G  o.  H )  Fn  D
)
275, 25, 26syl2anc 411 . . 3  |-  ( ph  ->  ( G  o.  H
)  Fn  D )
28 ofco.6 . . 3  |-  ( ph  ->  D  e.  X )
29 inidm 3430 . . 3  |-  ( D  i^i  D )  =  D
30 ffn 5508 . . . . 5  |-  ( H : D --> C  ->  H  Fn  D )
311, 30syl 14 . . . 4  |-  ( ph  ->  H  Fn  D )
32 fvco2 5746 . . . 4  |-  ( ( H  Fn  D  /\  x  e.  D )  ->  ( ( F  o.  H ) `  x
)  =  ( F `
 ( H `  x ) ) )
3331, 32sylan 283 . . 3  |-  ( (
ph  /\  x  e.  D )  ->  (
( F  o.  H
) `  x )  =  ( F `  ( H `  x ) ) )
34 fvco2 5746 . . . 4  |-  ( ( H  Fn  D  /\  x  e.  D )  ->  ( ( G  o.  H ) `  x
)  =  ( G `
 ( H `  x ) ) )
3531, 34sylan 283 . . 3  |-  ( (
ph  /\  x  e.  D )  ->  (
( G  o.  H
) `  x )  =  ( G `  ( H `  x ) ) )
3621, 27, 28, 28, 29, 33, 35offval 6274 . 2  |-  ( ph  ->  ( ( F  o.  H )  oF R ( G  o.  H ) )  =  ( x  e.  D  |->  ( ( F `  ( H `  x ) ) R ( G `
 ( H `  x ) ) ) ) )
3715, 36eqtr4d 2268 1  |-  ( ph  ->  ( ( F  oF R G )  o.  H )  =  ( ( F  o.  H )  oF R ( G  o.  H ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2203    i^i cin 3210    C_ wss 3211    |-> cmpt 4171    o. ccom 4753    Fn wfn 5347   -->wf 5348   ` cfv 5352  (class class class)co 6050    oFcof 6264
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-setind 4659
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-of 6266
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator