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

Theorem recexaplem2 8799
Description: Lemma for recexap 8800. (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 8094 . . . . . . . . . . 11  |-  _i  e.  CC
21mul01i 8537 . . . . . . . . . 10  |-  ( _i  x.  0 )  =  0
32oveq2i 6012 . . . . . . . . 9  |-  ( 0  +  ( _i  x.  0 ) )  =  ( 0  +  0 )
4 00id 8287 . . . . . . . . 9  |-  ( 0  +  0 )  =  0
53, 4eqtr2i 2251 . . . . . . . 8  |-  0  =  ( 0  +  ( _i  x.  0 ) )
65breq2i 4091 . . . . . . 7  |-  ( ( A  +  ( _i  x.  B ) ) #  0  <->  ( A  +  ( _i  x.  B
) ) #  ( 0  +  ( _i  x.  0 ) ) )
7 0re 8146 . . . . . . . 8  |-  0  e.  RR
8 apreim 8750 . . . . . . . 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 8127 . . . . . . . . . 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 8127 . . . . . . . . . 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 8748 . . . . . . . . 9  |-  ( ( A  e.  RR  /\  A #  0 )  ->  0  <  ( A  x.  A
) )
19 msqge0 8763 . . . . . . . . 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 568 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  A #  0 )  ->  ( 0  < 
( A  x.  A
)  /\  0  <_  ( B  x.  B ) ) )
22 addgtge0 8597 . . . . . . 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 8763 . . . . . . . . 9  |-  ( A  e.  RR  ->  0  <_  ( A  x.  A
) )
26 apsqgt0 8748 . . . . . . . . 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 8596 . . . . . . 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 802 . . . . 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 1218 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  0  <  ( ( A  x.  A
)  +  ( B  x.  B ) ) )
3433olcd 739 . 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 1021 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  A  e.  RR )
3635, 35remulcld 8177 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( A  x.  A )  e.  RR )
37 simp2 1022 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  B  e.  RR )
3837, 37remulcld 8177 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( B  x.  B )  e.  RR )
3936, 38readdcld 8176 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( A  +  ( _i  x.  B ) ) #  0 )  ->  ( ( A  x.  A )  +  ( B  x.  B ) )  e.  RR )
40 reaplt 8735 . . 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 713    /\ w3a 1002    e. wcel 2200   class class class wbr 4083  (class class class)co 6001   RRcr 7998   0cc0 7999   _ici 8001    + caddc 8002    x. cmul 8004    < clt 8181    <_ cle 8182   # cap 8728
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-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-mulrcl 8098  ax-addcom 8099  ax-mulcom 8100  ax-addass 8101  ax-mulass 8102  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-1rid 8106  ax-0id 8107  ax-rnegex 8108  ax-precex 8109  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-apti 8114  ax-pre-ltadd 8115  ax-pre-mulgt0 8116  ax-pre-mulext 8117
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-nel 2496  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-po 4387  df-iso 4388  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-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-reap 8722  df-ap 8729
This theorem is referenced by:  recexap  8800
  Copyright terms: Public domain W3C validator