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

Theorem recextlem1 8798
Description: Lemma for recexap 8800. (Contributed by Eric Schmidt, 23-May-2007.)
Assertion
Ref Expression
recextlem1  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  +  ( _i  x.  B
) )  x.  ( A  -  ( _i  x.  B ) ) )  =  ( ( A  x.  A )  +  ( B  x.  B
) ) )

Proof of Theorem recextlem1
StepHypRef Expression
1 simpl 109 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  A  e.  CC )
2 ax-icn 8094 . . . . 5  |-  _i  e.  CC
3 mulcl 8126 . . . . 5  |-  ( ( _i  e.  CC  /\  B  e.  CC )  ->  ( _i  x.  B
)  e.  CC )
42, 3mpan 424 . . . 4  |-  ( B  e.  CC  ->  (
_i  x.  B )  e.  CC )
54adantl 277 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( _i  x.  B
)  e.  CC )
6 subcl 8345 . . . 4  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( A  -  ( _i  x.  B
) )  e.  CC )
74, 6sylan2 286 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  -  (
_i  x.  B )
)  e.  CC )
81, 5, 7adddird 8172 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  +  ( _i  x.  B
) )  x.  ( A  -  ( _i  x.  B ) ) )  =  ( ( A  x.  ( A  -  ( _i  x.  B
) ) )  +  ( ( _i  x.  B )  x.  ( A  -  ( _i  x.  B ) ) ) ) )
91, 1, 5subdid 8560 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  ( A  -  ( _i  x.  B ) ) )  =  ( ( A  x.  A )  -  ( A  x.  (
_i  x.  B )
) ) )
105, 1, 5subdid 8560 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( _i  x.  B )  x.  ( A  -  ( _i  x.  B ) ) )  =  ( ( ( _i  x.  B )  x.  A )  -  ( ( _i  x.  B )  x.  (
_i  x.  B )
) ) )
11 mulcom 8128 . . . . . 6  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( A  x.  ( _i  x.  B
) )  =  ( ( _i  x.  B
)  x.  A ) )
124, 11sylan2 286 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  (
_i  x.  B )
)  =  ( ( _i  x.  B )  x.  A ) )
13 ixi 8730 . . . . . . . . . 10  |-  ( _i  x.  _i )  = 
-u 1
1413oveq1i 6011 . . . . . . . . 9  |-  ( ( _i  x.  _i )  x.  ( B  x.  B ) )  =  ( -u 1  x.  ( B  x.  B
) )
15 mulcl 8126 . . . . . . . . . 10  |-  ( ( B  e.  CC  /\  B  e.  CC )  ->  ( B  x.  B
)  e.  CC )
1615mulm1d 8556 . . . . . . . . 9  |-  ( ( B  e.  CC  /\  B  e.  CC )  ->  ( -u 1  x.  ( B  x.  B
) )  =  -u ( B  x.  B
) )
1714, 16eqtr2id 2275 . . . . . . . 8  |-  ( ( B  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  =  ( ( _i  x.  _i )  x.  ( B  x.  B ) ) )
18 mul4 8278 . . . . . . . . 9  |-  ( ( ( _i  e.  CC  /\  _i  e.  CC )  /\  ( B  e.  CC  /\  B  e.  CC ) )  -> 
( ( _i  x.  _i )  x.  ( B  x.  B )
)  =  ( ( _i  x.  B )  x.  ( _i  x.  B ) ) )
192, 2, 18mpanl12 436 . . . . . . . 8  |-  ( ( B  e.  CC  /\  B  e.  CC )  ->  ( ( _i  x.  _i )  x.  ( B  x.  B )
)  =  ( ( _i  x.  B )  x.  ( _i  x.  B ) ) )
2017, 19eqtrd 2262 . . . . . . 7  |-  ( ( B  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  =  ( ( _i  x.  B
)  x.  ( _i  x.  B ) ) )
2120anidms 397 . . . . . 6  |-  ( B  e.  CC  ->  -u ( B  x.  B )  =  ( ( _i  x.  B )  x.  ( _i  x.  B
) ) )
2221adantl 277 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  =  ( ( _i  x.  B
)  x.  ( _i  x.  B ) ) )
2312, 22oveq12d 6019 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  x.  ( _i  x.  B
) )  -  -u ( B  x.  B )
)  =  ( ( ( _i  x.  B
)  x.  A )  -  ( ( _i  x.  B )  x.  ( _i  x.  B
) ) ) )
2410, 23eqtr4d 2265 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( _i  x.  B )  x.  ( A  -  ( _i  x.  B ) ) )  =  ( ( A  x.  ( _i  x.  B ) )  -  -u ( B  x.  B
) ) )
259, 24oveq12d 6019 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  x.  ( A  -  (
_i  x.  B )
) )  +  ( ( _i  x.  B
)  x.  ( A  -  ( _i  x.  B ) ) ) )  =  ( ( ( A  x.  A
)  -  ( A  x.  ( _i  x.  B ) ) )  +  ( ( A  x.  ( _i  x.  B ) )  -  -u ( B  x.  B
) ) ) )
26 mulcl 8126 . . . . . 6  |-  ( ( A  e.  CC  /\  A  e.  CC )  ->  ( A  x.  A
)  e.  CC )
2726anidms 397 . . . . 5  |-  ( A  e.  CC  ->  ( A  x.  A )  e.  CC )
2827adantr 276 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  A
)  e.  CC )
29 mulcl 8126 . . . . 5  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( A  x.  ( _i  x.  B
) )  e.  CC )
304, 29sylan2 286 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  (
_i  x.  B )
)  e.  CC )
3115negcld 8444 . . . . . 6  |-  ( ( B  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  e.  CC )
3231anidms 397 . . . . 5  |-  ( B  e.  CC  ->  -u ( B  x.  B )  e.  CC )
3332adantl 277 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  e.  CC )
3428, 30, 33npncand 8481 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A  x.  A )  -  ( A  x.  (
_i  x.  B )
) )  +  ( ( A  x.  (
_i  x.  B )
)  -  -u ( B  x.  B )
) )  =  ( ( A  x.  A
)  -  -u ( B  x.  B )
) )
3515anidms 397 . . . 4  |-  ( B  e.  CC  ->  ( B  x.  B )  e.  CC )
36 subneg 8395 . . . 4  |-  ( ( ( A  x.  A
)  e.  CC  /\  ( B  x.  B
)  e.  CC )  ->  ( ( A  x.  A )  -  -u ( B  x.  B
) )  =  ( ( A  x.  A
)  +  ( B  x.  B ) ) )
3727, 35, 36syl2an 289 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  x.  A )  -  -u ( B  x.  B )
)  =  ( ( A  x.  A )  +  ( B  x.  B ) ) )
3834, 37eqtrd 2262 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A  x.  A )  -  ( A  x.  (
_i  x.  B )
) )  +  ( ( A  x.  (
_i  x.  B )
)  -  -u ( B  x.  B )
) )  =  ( ( A  x.  A
)  +  ( B  x.  B ) ) )
398, 25, 383eqtrd 2266 1  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  +  ( _i  x.  B
) )  x.  ( A  -  ( _i  x.  B ) ) )  =  ( ( A  x.  A )  +  ( B  x.  B
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200  (class class class)co 6001   CCcc 7997   1c1 8000   _ici 8001    + caddc 8002    x. cmul 8004    - cmin 8317   -ucneg 8318
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-setind 4629  ax-resscn 8091  ax-1cn 8092  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-mulcom 8100  ax-addass 8101  ax-mulass 8102  ax-distr 8103  ax-i2m1 8104  ax-1rid 8106  ax-0id 8107  ax-rnegex 8108  ax-cnre 8110
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-sub 8319  df-neg 8320
This theorem is referenced by:  recexap  8800
  Copyright terms: Public domain W3C validator