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

Theorem ofco 5729
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 )
21ffvelrnda 5302 . . 3  |-  ( (
ph  /\  x  e.  D )  ->  ( H `  x )  e.  C )
31feqmptd 5226 . . 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 2041 . . . 4  |-  ( (
ph  /\  y  e.  A )  ->  ( F `  y )  =  ( F `  y ) )
10 eqidd 2041 . . . 4  |-  ( (
ph  /\  y  e.  B )  ->  ( G `  y )  =  ( G `  y ) )
114, 5, 6, 7, 8, 9, 10offval 5719 . . 3  |-  ( ph  ->  ( F  oF R G )  =  ( y  e.  C  |->  ( ( F `  y ) R ( G `  y ) ) ) )
12 fveq2 5178 . . . 4  |-  ( y  =  ( H `  x )  ->  ( F `  y )  =  ( F `  ( H `  x ) ) )
13 fveq2 5178 . . . 4  |-  ( y  =  ( H `  x )  ->  ( G `  y )  =  ( G `  ( H `  x ) ) )
1412, 13oveq12d 5530 . . 3  |-  ( y  =  ( H `  x )  ->  (
( F `  y
) R ( G `
 y ) )  =  ( ( F `
 ( H `  x ) ) R ( G `  ( H `  x )
) ) )
152, 3, 11, 14fmptco 5330 . 2  |-  ( ph  ->  ( ( F  oF R G )  o.  H )  =  ( x  e.  D  |->  ( ( F `  ( H `  x ) ) R ( G `
 ( H `  x ) ) ) ) )
16 inss1 3157 . . . . . 6  |-  ( A  i^i  B )  C_  A
178, 16eqsstr3i 2976 . . . . 5  |-  C  C_  A
18 fss 5054 . . . . 5  |-  ( ( H : D --> C  /\  C  C_  A )  ->  H : D --> A )
191, 17, 18sylancl 392 . . . 4  |-  ( ph  ->  H : D --> A )
20 fnfco 5065 . . . 4  |-  ( ( F  Fn  A  /\  H : D --> A )  ->  ( F  o.  H )  Fn  D
)
214, 19, 20syl2anc 391 . . 3  |-  ( ph  ->  ( F  o.  H
)  Fn  D )
22 inss2 3158 . . . . . 6  |-  ( A  i^i  B )  C_  B
238, 22eqsstr3i 2976 . . . . 5  |-  C  C_  B
24 fss 5054 . . . . 5  |-  ( ( H : D --> C  /\  C  C_  B )  ->  H : D --> B )
251, 23, 24sylancl 392 . . . 4  |-  ( ph  ->  H : D --> B )
26 fnfco 5065 . . . 4  |-  ( ( G  Fn  B  /\  H : D --> B )  ->  ( G  o.  H )  Fn  D
)
275, 25, 26syl2anc 391 . . 3  |-  ( ph  ->  ( G  o.  H
)  Fn  D )
28 ofco.6 . . 3  |-  ( ph  ->  D  e.  X )
29 inidm 3146 . . 3  |-  ( D  i^i  D )  =  D
30 ffn 5046 . . . . 5  |-  ( H : D --> C  ->  H  Fn  D )
311, 30syl 14 . . . 4  |-  ( ph  ->  H  Fn  D )
32 fvco2 5242 . . . 4  |-  ( ( H  Fn  D  /\  x  e.  D )  ->  ( ( F  o.  H ) `  x
)  =  ( F `
 ( H `  x ) ) )
3331, 32sylan 267 . . 3  |-  ( (
ph  /\  x  e.  D )  ->  (
( F  o.  H
) `  x )  =  ( F `  ( H `  x ) ) )
34 fvco2 5242 . . . 4  |-  ( ( H  Fn  D  /\  x  e.  D )  ->  ( ( G  o.  H ) `  x
)  =  ( G `
 ( H `  x ) ) )
3531, 34sylan 267 . . 3  |-  ( (
ph  /\  x  e.  D )  ->  (
( G  o.  H
) `  x )  =  ( G `  ( H `  x ) ) )
3621, 27, 28, 28, 29, 33, 35offval 5719 . 2  |-  ( ph  ->  ( ( F  o.  H )  oF R ( G  o.  H ) )  =  ( x  e.  D  |->  ( ( F `  ( H `  x ) ) R ( G `
 ( H `  x ) ) ) ) )
3715, 36eqtr4d 2075 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 97    = wceq 1243    e. wcel 1393    i^i cin 2916    C_ wss 2917    |-> cmpt 3818    o. ccom 4349    Fn wfn 4897   -->wf 4898   ` cfv 4902  (class class class)co 5512    oFcof 5710
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-setind 4262
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-of 5712
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator