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

Theorem recexaplem2 8832
Description: Lemma for recexap 8833. (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 8127 . . . . . . . . . . 11  |-  _i  e.  CC
21mul01i 8570 . . . . . . . . . 10  |-  ( _i  x.  0 )  =  0
32oveq2i 6029 . . . . . . . . 9  |-  ( 0  +  ( _i  x.  0 ) )  =  ( 0  +  0 )
4 00id 8320 . . . . . . . . 9  |-  ( 0  +  0 )  =  0
53, 4eqtr2i 2253 . . . . . . . 8  |-  0  =  ( 0  +  ( _i  x.  0 ) )
65breq2i 4096 . . . . . . 7  |-  ( ( A  +  ( _i  x.  B ) ) #  0  <->  ( A  +  ( _i  x.  B
) ) #  ( 0  +  ( _i  x.  0 ) ) )
7 0re 8179 . . . . . . . 8  |-  0  e.  RR
8 apreim 8783 . . . . . . . 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 439 . . . . . . 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 454 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( A  +  ( _i  x.  B
) ) #  0 )  <-> 
( ( A  e.  RR  /\  B  e.  RR )  /\  ( A #  0  \/  B #  0 ) ) )
12 remulcl 8160 . . . . . . . . . 10  |-  ( ( A  e.  RR  /\  A  e.  RR )  ->  ( A  x.  A
)  e.  RR )
1312anidms 397 . . . . . . . . 9  |-  ( A  e.  RR  ->  ( A  x.  A )  e.  RR )
14 remulcl 8160 . . . . . . . . . 10  |-  ( ( B  e.  RR  /\  B  e.  RR )  ->  ( B  x.  B
)  e.  RR )
1514anidms 397 . . . . . . . . 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 8781 . . . . . . . . 9  |-  ( ( A  e.  RR  /\  A #  0 )  ->  0  <  ( A  x.  A
) )
19 msqge0 8796 . . . . . . . . 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 570 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A #  0 )  ->  ( 0  < 
( A  x.  A
)  /\  0  <_  ( B  x.  B ) ) )
22 addgtge0 8630 . . . . . . 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 411 . . . . . 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 8796 . . . . . . . . 9  |-  ( A  e.  RR  ->  0  <_  ( A  x.  A
) )
26 apsqgt0 8781 . . . . . . . . 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 400 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  B #  0 )  ->  ( 0  <_ 
( A  x.  A
)  /\  0  <  ( B  x.  B ) ) )
29 addgegt0 8629 . . . . . . 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 411 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  B #  0 )  ->  0  <  (
( A  x.  A
)  +  ( B  x.  B ) ) )
3123, 30jaodan 804 . . . . 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 1220 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  0  <  ( ( A  x.  A
)  +  ( B  x.  B ) ) )
3433olcd 741 . 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 1023 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  A  e.  RR )
3635, 35remulcld 8210 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( A  x.  A )  e.  RR )
37 simp2 1024 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  B  e.  RR )
3837, 37remulcld 8210 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( B  x.  B )  e.  RR )
3936, 38readdcld 8209 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( ( A  x.  A )  +  ( B  x.  B ) )  e.  RR )
40 reaplt 8768 . . 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 413 . 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
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 715    /\ w3a 1004    e. wcel 2202   class class class wbr 4088  (class class class)co 6018   RRcr 8031   0cc0 8032   _ici 8034    + caddc 8035    x. cmul 8037    < clt 8214    <_ cle 8215   # cap 8761
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-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149  ax-pre-mulext 8150
This theorem depends on definitions:  df-bi 117  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-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-po 4393  df-iso 4394  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-ap 8762
This theorem is referenced by:  recexap  8833
  Copyright terms: Public domain W3C validator