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

Theorem recextlem1 8548
Description: Lemma for recexap 8550. (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 108 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  A  e.  CC )
2 ax-icn 7848 . . . . 5  |-  _i  e.  CC
3 mulcl 7880 . . . . 5  |-  ( ( _i  e.  CC  /\  B  e.  CC )  ->  ( _i  x.  B
)  e.  CC )
42, 3mpan 421 . . . 4  |-  ( B  e.  CC  ->  (
_i  x.  B )  e.  CC )
54adantl 275 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( _i  x.  B
)  e.  CC )
6 subcl 8097 . . . 4  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( A  -  ( _i  x.  B
) )  e.  CC )
74, 6sylan2 284 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  -  (
_i  x.  B )
)  e.  CC )
81, 5, 7adddird 7924 . 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 8312 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  ( A  -  ( _i  x.  B ) ) )  =  ( ( A  x.  A )  -  ( A  x.  (
_i  x.  B )
) ) )
105, 1, 5subdid 8312 . . . 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 7882 . . . . . 6  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( A  x.  ( _i  x.  B
) )  =  ( ( _i  x.  B
)  x.  A ) )
124, 11sylan2 284 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  (
_i  x.  B )
)  =  ( ( _i  x.  B )  x.  A ) )
13 ixi 8481 . . . . . . . . . 10  |-  ( _i  x.  _i )  = 
-u 1
1413oveq1i 5852 . . . . . . . . 9  |-  ( ( _i  x.  _i )  x.  ( B  x.  B ) )  =  ( -u 1  x.  ( B  x.  B
) )
15 mulcl 7880 . . . . . . . . . 10  |-  ( ( B  e.  CC  /\  B  e.  CC )  ->  ( B  x.  B
)  e.  CC )
1615mulm1d 8308 . . . . . . . . 9  |-  ( ( B  e.  CC  /\  B  e.  CC )  ->  ( -u 1  x.  ( B  x.  B
) )  =  -u ( B  x.  B
) )
1714, 16eqtr2id 2212 . . . . . . . 8  |-  ( ( B  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  =  ( ( _i  x.  _i )  x.  ( B  x.  B ) ) )
18 mul4 8030 . . . . . . . . 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 433 . . . . . . . 8  |-  ( ( B  e.  CC  /\  B  e.  CC )  ->  ( ( _i  x.  _i )  x.  ( B  x.  B )
)  =  ( ( _i  x.  B )  x.  ( _i  x.  B ) ) )
2017, 19eqtrd 2198 . . . . . . 7  |-  ( ( B  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  =  ( ( _i  x.  B
)  x.  ( _i  x.  B ) ) )
2120anidms 395 . . . . . 6  |-  ( B  e.  CC  ->  -u ( B  x.  B )  =  ( ( _i  x.  B )  x.  ( _i  x.  B
) ) )
2221adantl 275 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  =  ( ( _i  x.  B
)  x.  ( _i  x.  B ) ) )
2312, 22oveq12d 5860 . . . 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 2201 . . 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 5860 . 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 7880 . . . . . 6  |-  ( ( A  e.  CC  /\  A  e.  CC )  ->  ( A  x.  A
)  e.  CC )
2726anidms 395 . . . . 5  |-  ( A  e.  CC  ->  ( A  x.  A )  e.  CC )
2827adantr 274 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  A
)  e.  CC )
29 mulcl 7880 . . . . 5  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( A  x.  ( _i  x.  B
) )  e.  CC )
304, 29sylan2 284 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  (
_i  x.  B )
)  e.  CC )
3115negcld 8196 . . . . . 6  |-  ( ( B  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  e.  CC )
3231anidms 395 . . . . 5  |-  ( B  e.  CC  ->  -u ( B  x.  B )  e.  CC )
3332adantl 275 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  e.  CC )
3428, 30, 33npncand 8233 . . 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 395 . . . 4  |-  ( B  e.  CC  ->  ( B  x.  B )  e.  CC )
36 subneg 8147 . . . 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 287 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  x.  A )  -  -u ( B  x.  B )
)  =  ( ( A  x.  A )  +  ( B  x.  B ) ) )
3834, 37eqtrd 2198 . 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 2202 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 103    = wceq 1343    e. wcel 2136  (class class class)co 5842   CCcc 7751   1c1 7754   _ici 7755    + caddc 7756    x. cmul 7758    - cmin 8069   -ucneg 8070
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-setind 4514  ax-resscn 7845  ax-1cn 7846  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-addcom 7853  ax-mulcom 7854  ax-addass 7855  ax-mulass 7856  ax-distr 7857  ax-i2m1 7858  ax-1rid 7860  ax-0id 7861  ax-rnegex 7862  ax-cnre 7864
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-iota 5153  df-fun 5190  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-sub 8071  df-neg 8072
This theorem is referenced by:  recexap  8550
  Copyright terms: Public domain W3C validator