Theorem msqge0 8944

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

Step	Hyp	Ref	Expression
1		remulcl 8307	. . . . 5 |- ( ( A e. RR /\ A e. RR ) -> ( A x. A ) e. RR )
2	1	anidms 401	. . . 4 |- ( A e. RR -> ( A x. A ) e. RR )
3		0re 8326	. . . 4 |- 0 e. RR
4		ltnsym2 8416	. . . 4 |- ( ( ( A x. A ) e. RR /\ 0 e. RR ) -> -. ( ( A x. A ) < 0 /\ 0 < ( A x. A ) ) )
5	2, 3, 4	sylancl 417	. . 3 |- ( A e. RR -> -. ( ( A x. A ) < 0 /\ 0 < ( A x. A ) ) )
6		orc 724	. . . . . 6 |- ( ( A x. A ) < 0 -> ( ( A x. A ) < 0 \/ 0 < ( A x. A ) ) )
7		reaplt 8916	. . . . . . 7 |- ( ( ( A x. A ) e. RR /\ 0 e. RR ) -> ( ( A x. A ) # 0 <-> ( ( A x. A ) < 0 \/ 0 < ( A x. A ) ) ) )
8	2, 3, 7	sylancl 417	. . . . . 6 |- ( A e. RR -> ( ( A x. A ) # 0 <-> ( ( A x. A ) < 0 \/ 0 < ( A x. A ) ) ) )
9	6, 8	imbitrrid 156	. . . . 5 |- ( A e. RR -> ( ( A x. A ) < 0 -> ( A x. A ) # 0 ) )
10		recn 8312	. . . . . . . . 9 |- ( A e. RR -> A e. CC )
11		mulap0r 8943	. . . . . . . . . 10 |- ( ( A e. CC /\ A e. CC /\ ( A x. A ) # 0 ) -> ( A # 0 /\ A # 0 ) )
12	10, 11	syl3an1 1311	. . . . . . . . 9 |- ( ( A e. RR /\ A e. CC /\ ( A x. A ) # 0 ) -> ( A # 0 /\ A # 0 ) )
13	10, 12	syl3an2 1312	. . . . . . . 8 |- ( ( A e. RR /\ A e. RR /\ ( A x. A ) # 0 ) -> ( A # 0 /\ A # 0 ) )
14	13	simpld 112	. . . . . . 7 |- ( ( A e. RR /\ A e. RR /\ ( A x. A ) # 0 ) -> A # 0 )
15	14	3expia 1236	. . . . . 6 |- ( ( A e. RR /\ A e. RR ) -> ( ( A x. A ) # 0 -> A # 0 ) )
16	15	anidms 401	. . . . 5 |- ( A e. RR -> ( ( A x. A ) # 0 -> A # 0 ) )
17		apsqgt0 8929	. . . . . 6 |- ( ( A e. RR /\ A # 0 ) -> 0 < ( A x. A ) )
18	17	ex 115	. . . . 5 |- ( A e. RR -> ( A # 0 -> 0 < ( A x. A ) ) )
19	9, 16, 18	3syld 57	. . . 4 |- ( A e. RR -> ( ( A x. A ) < 0 -> 0 < ( A x. A ) ) )
20	19	ancld 325	. . 3 |- ( A e. RR -> ( ( A x. A ) < 0 -> ( ( A x. A ) < 0 /\ 0 < ( A x. A ) ) ) )
21	5, 20	mtod 673	. 2 |- ( A e. RR -> -. ( A x. A ) < 0 )
22		lenlt 8401	. . 3 |- ( ( 0 e. RR /\ ( A x. A ) e. RR ) -> ( 0 <_ ( A x. A ) <-> -. ( A x. A ) < 0 ) )
23	3, 2, 22	sylancr 418	. 2 |- ( A e. RR -> ( 0 <_ ( A x. A ) <-> -. ( A x. A ) < 0 ) )
24	21, 23	mpbird 167	1 |- ( A e. RR -> 0 <_ ( A x. A ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   /\ w3a 1009   e. wcel 2209   class class class wbr 4130  (class class class)co 6085   CCcc 8177   RRcr 8178   0cc0 8179   x. cmul 8184   < clt 8360   <_ cle 8361   # cap 8909

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 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297

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 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910

This theorem is used by:  msqge0i  8945  msqge0d  8946  recexaplem2  8980  sqge0  11053  bernneq  11098