MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ofnegsub Unicode version

Theorem ofnegsub 9760
Description: Function analog of negsub 9111. (Contributed by Mario Carneiro, 24-Jul-2014.)
Assertion
Ref Expression
ofnegsub  |-  ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  ->  ( F  o F  +  ( ( A  X.  { -u 1 } )  o F  x.  G ) )  =  ( F  o F  -  G )
)

Proof of Theorem ofnegsub
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 simp1 955 . 2  |-  ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  ->  A  e.  V
)
2 simp2 956 . . 3  |-  ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  ->  F : A --> CC )
3 ffn 5405 . . 3  |-  ( F : A --> CC  ->  F  Fn  A )
42, 3syl 15 . 2  |-  ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  ->  F  Fn  A
)
5 ax-1cn 8811 . . . . 5  |-  1  e.  CC
65negcli 9130 . . . 4  |-  -u 1  e.  CC
7 fnconstg 5445 . . . 4  |-  ( -u
1  e.  CC  ->  ( A  X.  { -u
1 } )  Fn  A )
86, 7mp1i 11 . . 3  |-  ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  ->  ( A  X.  { -u 1 } )  Fn  A )
9 simp3 957 . . . 4  |-  ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  ->  G : A --> CC )
10 ffn 5405 . . . 4  |-  ( G : A --> CC  ->  G  Fn  A )
119, 10syl 15 . . 3  |-  ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  ->  G  Fn  A
)
12 inidm 3391 . . 3  |-  ( A  i^i  A )  =  A
138, 11, 1, 1, 12offn 6105 . 2  |-  ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  ->  ( ( A  X.  { -u 1 } )  o F  x.  G )  Fn  A )
144, 11, 1, 1, 12offn 6105 . 2  |-  ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  ->  ( F  o F  -  G )  Fn  A )
15 eqidd 2297 . 2  |-  ( ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  /\  x  e.  A
)  ->  ( F `  x )  =  ( F `  x ) )
166a1i 10 . . . 4  |-  ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  ->  -u 1  e.  CC )
17 eqidd 2297 . . . 4  |-  ( ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  /\  x  e.  A
)  ->  ( G `  x )  =  ( G `  x ) )
181, 16, 11, 17ofc1 6116 . . 3  |-  ( ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  /\  x  e.  A
)  ->  ( (
( A  X.  { -u 1 } )  o F  x.  G ) `
 x )  =  ( -u 1  x.  ( G `  x
) ) )
19 ffvelrn 5679 . . . . 5  |-  ( ( G : A --> CC  /\  x  e.  A )  ->  ( G `  x
)  e.  CC )
209, 19sylan 457 . . . 4  |-  ( ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  /\  x  e.  A
)  ->  ( G `  x )  e.  CC )
2120mulm1d 9247 . . 3  |-  ( ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  /\  x  e.  A
)  ->  ( -u 1  x.  ( G `  x
) )  =  -u ( G `  x ) )
2218, 21eqtrd 2328 . 2  |-  ( ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  /\  x  e.  A
)  ->  ( (
( A  X.  { -u 1 } )  o F  x.  G ) `
 x )  = 
-u ( G `  x ) )
23 ffvelrn 5679 . . . . 5  |-  ( ( F : A --> CC  /\  x  e.  A )  ->  ( F `  x
)  e.  CC )
242, 23sylan 457 . . . 4  |-  ( ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  /\  x  e.  A
)  ->  ( F `  x )  e.  CC )
2524, 20negsubd 9179 . . 3  |-  ( ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  /\  x  e.  A
)  ->  ( ( F `  x )  +  -u ( G `  x ) )  =  ( ( F `  x )  -  ( G `  x )
) )
264, 11, 1, 1, 12, 15, 17ofval 6103 . . 3  |-  ( ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  /\  x  e.  A
)  ->  ( ( F  o F  -  G
) `  x )  =  ( ( F `
 x )  -  ( G `  x ) ) )
2725, 26eqtr4d 2331 . 2  |-  ( ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  /\  x  e.  A
)  ->  ( ( F `  x )  +  -u ( G `  x ) )  =  ( ( F  o F  -  G ) `  x ) )
281, 4, 13, 14, 15, 22, 27offveq 6114 1  |-  ( ( A  e.  V  /\  F : A --> CC  /\  G : A --> CC )  ->  ( F  o F  +  ( ( A  X.  { -u 1 } )  o F  x.  G ) )  =  ( F  o F  -  G )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1632    e. wcel 1696   {csn 3653    X. cxp 4703    Fn wfn 5266   -->wf 5267   ` cfv 5271  (class class class)co 5874    o Fcof 6092   CCcc 8751   1c1 8754    + caddc 8756    x. cmul 8758    - cmin 9053   -ucneg 9054
This theorem is referenced by:  i1fsub  19079  itg1sub  19080  plysub  19617  coesub  19654  dgrsub  19669  basellem9  20342  expgrowth  27655
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528  ax-resscn 8810  ax-1cn 8811  ax-icn 8812  ax-addcl 8813  ax-addrcl 8814  ax-mulcl 8815  ax-mulrcl 8816  ax-mulcom 8817  ax-addass 8818  ax-mulass 8819  ax-distr 8820  ax-i2m1 8821  ax-1ne0 8822  ax-1rid 8823  ax-rnegex 8824  ax-rrecex 8825  ax-cnre 8826  ax-pre-lttri 8827  ax-pre-lttrn 8828  ax-pre-ltadd 8829
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-nel 2462  df-ral 2561  df-rex 2562  df-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-po 4330  df-so 4331  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-of 6094  df-riota 6320  df-er 6676  df-en 6880  df-dom 6881  df-sdom 6882  df-pnf 8885  df-mnf 8886  df-ltxr 8888  df-sub 9055  df-neg 9056
  Copyright terms: Public domain W3C validator