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

Theorem submul2 8620
Description: Convert a subtraction to addition using multiplication by a negative. (Contributed by NM, 2-Feb-2007.)
Assertion
Ref Expression
submul2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  -  ( B  x.  C ) )  =  ( A  +  ( B  x.  -u C
) ) )

Proof of Theorem submul2
StepHypRef Expression
1 mulneg2 8617 . . . . 5  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( B  x.  -u C
)  =  -u ( B  x.  C )
)
21adantl 277 . . . 4  |-  ( ( A  e.  CC  /\  ( B  e.  CC  /\  C  e.  CC ) )  ->  ( B  x.  -u C )  = 
-u ( B  x.  C ) )
32oveq2d 6044 . . 3  |-  ( ( A  e.  CC  /\  ( B  e.  CC  /\  C  e.  CC ) )  ->  ( A  +  ( B  x.  -u C ) )  =  ( A  +  -u ( B  x.  C
) ) )
4 mulcl 8202 . . . 4  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( B  x.  C
)  e.  CC )
5 negsub 8469 . . . 4  |-  ( ( A  e.  CC  /\  ( B  x.  C
)  e.  CC )  ->  ( A  +  -u ( B  x.  C
) )  =  ( A  -  ( B  x.  C ) ) )
64, 5sylan2 286 . . 3  |-  ( ( A  e.  CC  /\  ( B  e.  CC  /\  C  e.  CC ) )  ->  ( A  +  -u ( B  x.  C ) )  =  ( A  -  ( B  x.  C )
) )
73, 6eqtr2d 2265 . 2  |-  ( ( A  e.  CC  /\  ( B  e.  CC  /\  C  e.  CC ) )  ->  ( A  -  ( B  x.  C ) )  =  ( A  +  ( B  x.  -u C
) ) )
873impb 1226 1  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  -  ( B  x.  C ) )  =  ( A  +  ( B  x.  -u C
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2202  (class class class)co 6028   CCcc 8073    + caddc 8078    x. cmul 8080    - cmin 8392   -ucneg 8393
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 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-setind 4641  ax-resscn 8167  ax-1cn 8168  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-distr 8179  ax-i2m1 8180  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-sub 8394  df-neg 8395
This theorem is referenced by:  cjap  11529
  Copyright terms: Public domain W3C validator