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

Theorem binom2sub 10914
Description: Expand the square of a subtraction. (Contributed by Scott Fenton, 10-Jun-2013.)
Assertion
Ref Expression
binom2sub  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  -  B ) ^ 2 )  =  ( ( ( A ^ 2 )  -  ( 2  x.  ( A  x.  B ) ) )  +  ( B ^
2 ) ) )

Proof of Theorem binom2sub
StepHypRef Expression
1 negcl 8378 . . . 4  |-  ( B  e.  CC  ->  -u B  e.  CC )
2 binom2 10912 . . . 4  |-  ( ( A  e.  CC  /\  -u B  e.  CC )  ->  ( ( A  +  -u B ) ^
2 )  =  ( ( ( A ^
2 )  +  ( 2  x.  ( A  x.  -u B ) ) )  +  ( -u B ^ 2 ) ) )
31, 2sylan2 286 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  +  -u B ) ^ 2 )  =  ( ( ( A ^ 2 )  +  ( 2  x.  ( A  x.  -u B ) ) )  +  ( -u B ^ 2 ) ) )
4 negsub 8426 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  +  -u B )  =  ( A  -  B ) )
54oveq1d 6032 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  +  -u B ) ^ 2 )  =  ( ( A  -  B ) ^ 2 ) )
63, 5eqtr3d 2266 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A ^ 2 )  +  ( 2  x.  ( A  x.  -u B ) ) )  +  (
-u B ^ 2 ) )  =  ( ( A  -  B
) ^ 2 ) )
7 mulneg2 8574 . . . . . . 7  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  -u B
)  =  -u ( A  x.  B )
)
87oveq2d 6033 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( 2  x.  ( A  x.  -u B ) )  =  ( 2  x.  -u ( A  x.  B ) ) )
9 2cn 9213 . . . . . . 7  |-  2  e.  CC
10 mulcl 8158 . . . . . . 7  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  B
)  e.  CC )
11 mulneg2 8574 . . . . . . 7  |-  ( ( 2  e.  CC  /\  ( A  x.  B
)  e.  CC )  ->  ( 2  x.  -u ( A  x.  B
) )  =  -u ( 2  x.  ( A  x.  B )
) )
129, 10, 11sylancr 414 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( 2  x.  -u ( A  x.  B )
)  =  -u (
2  x.  ( A  x.  B ) ) )
138, 12eqtr2d 2265 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  -> 
-u ( 2  x.  ( A  x.  B
) )  =  ( 2  x.  ( A  x.  -u B ) ) )
1413oveq2d 6033 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A ^
2 )  +  -u ( 2  x.  ( A  x.  B )
) )  =  ( ( A ^ 2 )  +  ( 2  x.  ( A  x.  -u B ) ) ) )
15 sqcl 10861 . . . . . 6  |-  ( A  e.  CC  ->  ( A ^ 2 )  e.  CC )
1615adantr 276 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A ^ 2 )  e.  CC )
17 mulcl 8158 . . . . . 6  |-  ( ( 2  e.  CC  /\  ( A  x.  B
)  e.  CC )  ->  ( 2  x.  ( A  x.  B
) )  e.  CC )
189, 10, 17sylancr 414 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( 2  x.  ( A  x.  B )
)  e.  CC )
1916, 18negsubd 8495 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A ^
2 )  +  -u ( 2  x.  ( A  x.  B )
) )  =  ( ( A ^ 2 )  -  ( 2  x.  ( A  x.  B ) ) ) )
2014, 19eqtr3d 2266 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A ^
2 )  +  ( 2  x.  ( A  x.  -u B ) ) )  =  ( ( A ^ 2 )  -  ( 2  x.  ( A  x.  B
) ) ) )
21 sqneg 10859 . . . 4  |-  ( B  e.  CC  ->  ( -u B ^ 2 )  =  ( B ^
2 ) )
2221adantl 277 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( -u B ^
2 )  =  ( B ^ 2 ) )
2320, 22oveq12d 6035 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A ^ 2 )  +  ( 2  x.  ( A  x.  -u B ) ) )  +  (
-u B ^ 2 ) )  =  ( ( ( A ^
2 )  -  (
2  x.  ( A  x.  B ) ) )  +  ( B ^ 2 ) ) )
246, 23eqtr3d 2266 1  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  -  B ) ^ 2 )  =  ( ( ( A ^ 2 )  -  ( 2  x.  ( A  x.  B ) ) )  +  ( B ^
2 ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202  (class class class)co 6017   CCcc 8029    + caddc 8034    x. cmul 8036    - cmin 8349   -ucneg 8350   2c2 9193   ^cexp 10799
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852  df-inn 9143  df-2 9201  df-n0 9402  df-z 9479  df-uz 9755  df-seqfrec 10709  df-exp 10800
This theorem is referenced by:  binom2sub1  10915  binom2subi  10916  resqrexlemover  11570  resqrexlemcalc1  11574  amgm2  11678  bdtrilem  11799  pythagtriplem1  12837  pythagtriplem14  12849  tangtx  15561
  Copyright terms: Public domain W3C validator