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

Theorem msqge0 8724
Description: A square is nonnegative. Lemma 2.35 of [Geuvers], p. 9. (Contributed by NM, 23-May-2007.) (Revised by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
msqge0  |-  ( A  e.  RR  ->  0  <_  ( A  x.  A
) )

Proof of Theorem msqge0
StepHypRef Expression
1 remulcl 8088 . . . . 5  |-  ( ( A  e.  RR  /\  A  e.  RR )  ->  ( A  x.  A
)  e.  RR )
21anidms 397 . . . 4  |-  ( A  e.  RR  ->  ( A  x.  A )  e.  RR )
3 0re 8107 . . . 4  |-  0  e.  RR
4 ltnsym2 8198 . . . 4  |-  ( ( ( A  x.  A
)  e.  RR  /\  0  e.  RR )  ->  -.  ( ( A  x.  A )  <  0  /\  0  < 
( A  x.  A
) ) )
52, 3, 4sylancl 413 . . 3  |-  ( A  e.  RR  ->  -.  ( ( A  x.  A )  <  0  /\  0  <  ( A  x.  A ) ) )
6 orc 714 . . . . . 6  |-  ( ( A  x.  A )  <  0  ->  (
( A  x.  A
)  <  0  \/  0  <  ( A  x.  A ) ) )
7 reaplt 8696 . . . . . . 7  |-  ( ( ( A  x.  A
)  e.  RR  /\  0  e.  RR )  ->  ( ( A  x.  A ) #  0  <->  ( ( A  x.  A )  <  0  \/  0  < 
( A  x.  A
) ) ) )
82, 3, 7sylancl 413 . . . . . 6  |-  ( A  e.  RR  ->  (
( A  x.  A
) #  0  <->  ( ( A  x.  A )  <  0  \/  0  < 
( A  x.  A
) ) ) )
96, 8imbitrrid 156 . . . . 5  |-  ( A  e.  RR  ->  (
( A  x.  A
)  <  0  ->  ( A  x.  A ) #  0 ) )
10 recn 8093 . . . . . . . . 9  |-  ( A  e.  RR  ->  A  e.  CC )
11 mulap0r 8723 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  A  e.  CC  /\  ( A  x.  A ) #  0 )  ->  ( A #  0  /\  A #  0 ) )
1210, 11syl3an1 1283 . . . . . . . . 9  |-  ( ( A  e.  RR  /\  A  e.  CC  /\  ( A  x.  A ) #  0 )  ->  ( A #  0  /\  A #  0 ) )
1310, 12syl3an2 1284 . . . . . . . 8  |-  ( ( A  e.  RR  /\  A  e.  RR  /\  ( A  x.  A ) #  0 )  ->  ( A #  0  /\  A #  0 ) )
1413simpld 112 . . . . . . 7  |-  ( ( A  e.  RR  /\  A  e.  RR  /\  ( A  x.  A ) #  0 )  ->  A #  0 )
15143expia 1208 . . . . . 6  |-  ( ( A  e.  RR  /\  A  e.  RR )  ->  ( ( A  x.  A ) #  0  ->  A #  0 ) )
1615anidms 397 . . . . 5  |-  ( A  e.  RR  ->  (
( A  x.  A
) #  0  ->  A #  0 ) )
17 apsqgt0 8709 . . . . . 6  |-  ( ( A  e.  RR  /\  A #  0 )  ->  0  <  ( A  x.  A
) )
1817ex 115 . . . . 5  |-  ( A  e.  RR  ->  ( A #  0  ->  0  < 
( A  x.  A
) ) )
199, 16, 183syld 57 . . . 4  |-  ( A  e.  RR  ->  (
( A  x.  A
)  <  0  ->  0  <  ( A  x.  A ) ) )
2019ancld 325 . . 3  |-  ( A  e.  RR  ->  (
( A  x.  A
)  <  0  ->  ( ( A  x.  A
)  <  0  /\  0  <  ( A  x.  A ) ) ) )
215, 20mtod 665 . 2  |-  ( A  e.  RR  ->  -.  ( A  x.  A
)  <  0 )
22 lenlt 8183 . . 3  |-  ( ( 0  e.  RR  /\  ( A  x.  A
)  e.  RR )  ->  ( 0  <_ 
( A  x.  A
)  <->  -.  ( A  x.  A )  <  0
) )
233, 2, 22sylancr 414 . 2  |-  ( A  e.  RR  ->  (
0  <_  ( A  x.  A )  <->  -.  ( A  x.  A )  <  0 ) )
2421, 23mpbird 167 1  |-  ( A  e.  RR  ->  0  <_  ( A  x.  A
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 710    /\ w3a 981    e. wcel 2178   class class class wbr 4059  (class class class)co 5967   CCcc 7958   RRcr 7959   0cc0 7960    x. cmul 7965    < clt 8142    <_ cle 8143   # cap 8689
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-mulrcl 8059  ax-addcom 8060  ax-mulcom 8061  ax-addass 8062  ax-mulass 8063  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-1rid 8067  ax-0id 8068  ax-rnegex 8069  ax-precex 8070  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-apti 8075  ax-pre-ltadd 8076  ax-pre-mulgt0 8077  ax-pre-mulext 8078
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-id 4358  df-po 4361  df-iso 4362  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-iota 5251  df-fun 5292  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-reap 8683  df-ap 8690
This theorem is referenced by:  msqge0i  8725  msqge0d  8726  recexaplem2  8760  sqge0  10798  bernneq  10842
  Copyright terms: Public domain W3C validator