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

Theorem recextlem1 8969
Description: Lemma for recexap 8971. (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 8264 . . . . 5  |-  _i  e.  CC
3 mulcl 8296 . . . . 5  |-  ( ( _i  e.  CC  /\  B  e.  CC )  ->  ( _i  x.  B
)  e.  CC )
42, 3mpan 428 . . . 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 8515 . . . 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 8341 . 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 8731 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  ( A  -  ( _i  x.  B ) ) )  =  ( ( A  x.  A )  -  ( A  x.  (
_i  x.  B )
) ) )
105, 1, 5subdid 8731 . . . 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 8298 . . . . . 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 8901 . . . . . . . . . 10  |-  ( _i  x.  _i )  = 
-u 1
1413oveq1i 6085 . . . . . . . . 9  |-  ( ( _i  x.  _i )  x.  ( B  x.  B ) )  =  ( -u 1  x.  ( B  x.  B
) )
15 mulcl 8296 . . . . . . . . . 10  |-  ( ( B  e.  CC  /\  B  e.  CC )  ->  ( B  x.  B
)  e.  CC )
1615mulm1d 8727 . . . . . . . . 9  |-  ( ( B  e.  CC  /\  B  e.  CC )  ->  ( -u 1  x.  ( B  x.  B
) )  =  -u ( B  x.  B
) )
1714, 16eqtr2id 2284 . . . . . . . 8  |-  ( ( B  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  =  ( ( _i  x.  _i )  x.  ( B  x.  B ) ) )
18 mul4 8448 . . . . . . . . 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 440 . . . . . . . 8  |-  ( ( B  e.  CC  /\  B  e.  CC )  ->  ( ( _i  x.  _i )  x.  ( B  x.  B )
)  =  ( ( _i  x.  B )  x.  ( _i  x.  B ) ) )
2017, 19eqtrd 2271 . . . . . . 7  |-  ( ( B  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  =  ( ( _i  x.  B
)  x.  ( _i  x.  B ) ) )
2120anidms 401 . . . . . 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 6093 . . . 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 2274 . . 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 6093 . 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 8296 . . . . . 6  |-  ( ( A  e.  CC  /\  A  e.  CC )  ->  ( A  x.  A
)  e.  CC )
2726anidms 401 . . . . 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 8296 . . . . 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 8614 . . . . . 6  |-  ( ( B  e.  CC  /\  B  e.  CC )  -> 
-u ( B  x.  B )  e.  CC )
3231anidms 401 . . . . 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 8651 . . 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 401 . . . 4  |-  ( B  e.  CC  ->  ( B  x.  B )  e.  CC )
36 subneg 8565 . . . 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 2271 . 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 2275 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 1402    e. wcel 2209  (class class class)co 6075   CCcc 8167   1c1 8170   _ici 8171    + caddc 8172    x. cmul 8174    - cmin 8487   -ucneg 8488
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-setind 4679  ax-resscn 8261  ax-1cn 8262  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-sub 8489  df-neg 8490
This theorem is referenced by:  recexap  8971
  Copyright terms: Public domain W3C validator