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

Theorem recexaplem2 8983
Description: Lemma for recexap 8984. (Contributed by Jim Kingdon, 20-Feb-2020.)
Assertion
Ref Expression
recexaplem2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( ( A  x.  A )  +  ( B  x.  B ) ) #  0 )

Proof of Theorem recexaplem2
StepHypRef Expression
1 ax-icn 8275 . . . . . . . . . . 11  |-  _i  e.  CC
21mul01i 8720 . . . . . . . . . 10  |-  ( _i  x.  0 )  =  0
32oveq2i 6096 . . . . . . . . 9  |-  ( 0  +  ( _i  x.  0 ) )  =  ( 0  +  0 )
4 00id 8469 . . . . . . . . 9  |-  ( 0  +  0 )  =  0
53, 4eqtr2i 2260 . . . . . . . 8  |-  0  =  ( 0  +  ( _i  x.  0 ) )
65breq2i 4138 . . . . . . 7  |-  ( ( A  +  ( _i  x.  B ) ) #  0  <->  ( A  +  ( _i  x.  B
) ) #  ( 0  +  ( _i  x.  0 ) ) )
7 0re 8327 . . . . . . . 8  |-  0  e.  RR
8 apreim 8934 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  e.  RR  /\  0  e.  RR ) )  -> 
( ( A  +  ( _i  x.  B
) ) #  ( 0  +  ( _i  x.  0 ) )  <->  ( A #  0  \/  B #  0
) ) )
97, 7, 8mpanr12 443 . . . . . . 7  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( A  +  ( _i  x.  B
) ) #  ( 0  +  ( _i  x.  0 ) )  <->  ( A #  0  \/  B #  0
) ) )
106, 9bitrid 192 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( A  +  ( _i  x.  B
) ) #  0  <->  ( A #  0  \/  B #  0 ) ) )
1110pm5.32i 458 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( A  +  ( _i  x.  B
) ) #  0 )  <-> 
( ( A  e.  RR  /\  B  e.  RR )  /\  ( A #  0  \/  B #  0 ) ) )
12 remulcl 8308 . . . . . . . . . 10  |-  ( ( A  e.  RR  /\  A  e.  RR )  ->  ( A  x.  A
)  e.  RR )
1312anidms 401 . . . . . . . . 9  |-  ( A  e.  RR  ->  ( A  x.  A )  e.  RR )
14 remulcl 8308 . . . . . . . . . 10  |-  ( ( B  e.  RR  /\  B  e.  RR )  ->  ( B  x.  B
)  e.  RR )
1514anidms 401 . . . . . . . . 9  |-  ( B  e.  RR  ->  ( B  x.  B )  e.  RR )
1613, 15anim12i 338 . . . . . . . 8  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( ( A  x.  A )  e.  RR  /\  ( B  x.  B
)  e.  RR ) )
1716adantr 276 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A #  0 )  ->  ( ( A  x.  A )  e.  RR  /\  ( B  x.  B )  e.  RR ) )
18 apsqgt0 8932 . . . . . . . . 9  |-  ( ( A  e.  RR  /\  A #  0 )  ->  0  <  ( A  x.  A
) )
19 msqge0 8947 . . . . . . . . 9  |-  ( B  e.  RR  ->  0  <_  ( B  x.  B
) )
2018, 19anim12i 338 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  A #  0 )  /\  B  e.  RR )  ->  ( 0  <  ( A  x.  A )  /\  0  <_  ( B  x.  B ) ) )
2120an32s 574 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A #  0 )  ->  ( 0  < 
( A  x.  A
)  /\  0  <_  ( B  x.  B ) ) )
22 addgtge0 8780 . . . . . . 7  |-  ( ( ( ( A  x.  A )  e.  RR  /\  ( B  x.  B
)  e.  RR )  /\  ( 0  < 
( A  x.  A
)  /\  0  <_  ( B  x.  B ) ) )  ->  0  <  ( ( A  x.  A )  +  ( B  x.  B ) ) )
2317, 21, 22syl2anc 415 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A #  0 )  ->  0  <  (
( A  x.  A
)  +  ( B  x.  B ) ) )
2416adantr 276 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  B #  0 )  ->  ( ( A  x.  A )  e.  RR  /\  ( B  x.  B )  e.  RR ) )
25 msqge0 8947 . . . . . . . . 9  |-  ( A  e.  RR  ->  0  <_  ( A  x.  A
) )
26 apsqgt0 8932 . . . . . . . . 9  |-  ( ( B  e.  RR  /\  B #  0 )  ->  0  <  ( B  x.  B
) )
2725, 26anim12i 338 . . . . . . . 8  |-  ( ( A  e.  RR  /\  ( B  e.  RR  /\  B #  0 ) )  ->  ( 0  <_ 
( A  x.  A
)  /\  0  <  ( B  x.  B ) ) )
2827anassrs 404 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  B #  0 )  ->  ( 0  <_ 
( A  x.  A
)  /\  0  <  ( B  x.  B ) ) )
29 addgegt0 8779 . . . . . . 7  |-  ( ( ( ( A  x.  A )  e.  RR  /\  ( B  x.  B
)  e.  RR )  /\  ( 0  <_ 
( A  x.  A
)  /\  0  <  ( B  x.  B ) ) )  ->  0  <  ( ( A  x.  A )  +  ( B  x.  B ) ) )
3024, 28, 29syl2anc 415 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  B #  0 )  ->  0  <  (
( A  x.  A
)  +  ( B  x.  B ) ) )
3123, 30jaodan 809 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( A #  0  \/  B #  0 ) )  ->  0  <  ( ( A  x.  A
)  +  ( B  x.  B ) ) )
3211, 31sylbi 121 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( A  +  ( _i  x.  B
) ) #  0 )  ->  0  <  (
( A  x.  A
)  +  ( B  x.  B ) ) )
33323impa 1225 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  0  <  ( ( A  x.  A
)  +  ( B  x.  B ) ) )
3433olcd 746 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( (
( A  x.  A
)  +  ( B  x.  B ) )  <  0  \/  0  <  ( ( A  x.  A )  +  ( B  x.  B
) ) ) )
35 simp1 1028 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  A  e.  RR )
3635, 35remulcld 8357 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( A  x.  A )  e.  RR )
37 simp2 1029 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  B  e.  RR )
3837, 37remulcld 8357 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( B  x.  B )  e.  RR )
3936, 38readdcld 8356 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( ( A  x.  A )  +  ( B  x.  B ) )  e.  RR )
40 reaplt 8919 . . 3  |-  ( ( ( ( A  x.  A )  +  ( B  x.  B ) )  e.  RR  /\  0  e.  RR )  ->  ( ( ( A  x.  A )  +  ( B  x.  B
) ) #  0  <->  (
( ( A  x.  A )  +  ( B  x.  B ) )  <  0  \/  0  <  ( ( A  x.  A )  +  ( B  x.  B ) ) ) ) )
4139, 7, 40sylancl 417 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( (
( A  x.  A
)  +  ( B  x.  B ) ) #  0  <->  ( ( ( A  x.  A )  +  ( B  x.  B ) )  <  0  \/  0  < 
( ( A  x.  A )  +  ( B  x.  B ) ) ) ) )
4234, 41mpbird 167 1  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( ( A  x.  A )  +  ( B  x.  B ) ) #  0 )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    /\ w3a 1009    e. wcel 2209   class class class wbr 4130  (class class class)co 6085   RRcr 8179   0cc0 8180   _ici 8182    + caddc 8183    x. cmul 8185    < clt 8361    <_ cle 8362   # cap 8912
This proof depends on 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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-mulrcl 8279  ax-addcom 8280  ax-mulcom 8281  ax-addass 8282  ax-mulass 8283  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-1rid 8287  ax-0id 8288  ax-rnegex 8289  ax-precex 8290  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-apti 8295  ax-pre-ltadd 8296  ax-pre-mulgt0 8297  ax-pre-mulext 8298
This proof 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-nel 2516  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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-reap 8906  df-ap 8913
This theorem is used by:  recexap  8984
  Copyright terms: Public domain W3C validator