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

Theorem ofco 6149
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 5693 . . 3  |-  ( (
ph  /\  x  e.  D )  ->  ( H `  x )  e.  C )
31feqmptd 5610 . . 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 2194 . . . 4  |-  ( (
ph  /\  y  e.  A )  ->  ( F `  y )  =  ( F `  y ) )
10 eqidd 2194 . . . 4  |-  ( (
ph  /\  y  e.  B )  ->  ( G `  y )  =  ( G `  y ) )
114, 5, 6, 7, 8, 9, 10offval 6138 . . 3  |-  ( ph  ->  ( F  oF R G )  =  ( y  e.  C  |->  ( ( F `  y ) R ( G `  y ) ) ) )
12 fveq2 5554 . . . 4  |-  ( y  =  ( H `  x )  ->  ( F `  y )  =  ( F `  ( H `  x ) ) )
13 fveq2 5554 . . . 4  |-  ( y  =  ( H `  x )  ->  ( G `  y )  =  ( G `  ( H `  x ) ) )
1412, 13oveq12d 5936 . . 3  |-  ( y  =  ( H `  x )  ->  (
( F `  y
) R ( G `
 y ) )  =  ( ( F `
 ( H `  x ) ) R ( G `  ( H `  x )
) ) )
152, 3, 11, 14fmptco 5724 . 2  |-  ( ph  ->  ( ( F  oF R G )  o.  H )  =  ( x  e.  D  |->  ( ( F `  ( H `  x ) ) R ( G `
 ( H `  x ) ) ) ) )
16 inss1 3379 . . . . . 6  |-  ( A  i^i  B )  C_  A
178, 16eqsstrri 3212 . . . . 5  |-  C  C_  A
18 fss 5415 . . . . 5  |-  ( ( H : D --> C  /\  C  C_  A )  ->  H : D --> A )
191, 17, 18sylancl 413 . . . 4  |-  ( ph  ->  H : D --> A )
20 fnfco 5428 . . . 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 3380 . . . . . 6  |-  ( A  i^i  B )  C_  B
238, 22eqsstrri 3212 . . . . 5  |-  C  C_  B
24 fss 5415 . . . . 5  |-  ( ( H : D --> C  /\  C  C_  B )  ->  H : D --> B )
251, 23, 24sylancl 413 . . . 4  |-  ( ph  ->  H : D --> B )
26 fnfco 5428 . . . 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 3368 . . 3  |-  ( D  i^i  D )  =  D
30 ffn 5403 . . . . 5  |-  ( H : D --> C  ->  H  Fn  D )
311, 30syl 14 . . . 4  |-  ( ph  ->  H  Fn  D )
32 fvco2 5626 . . . 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 5626 . . . 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 6138 . 2  |-  ( ph  ->  ( ( F  o.  H )  oF R ( G  o.  H ) )  =  ( x  e.  D  |->  ( ( F `  ( H `  x ) ) R ( G `
 ( H `  x ) ) ) ) )
3715, 36eqtr4d 2229 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 1364    e. wcel 2164    i^i cin 3152    C_ wss 3153    |-> cmpt 4090    o. ccom 4663    Fn wfn 5249   -->wf 5250   ` cfv 5254  (class class class)co 5918    oFcof 6128
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-setind 4569
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-of 6130
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator