mmtheorems57 - Metamath Proof Explorer

Jump to page: Contents + 1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10781

Statement List for Metamath Proof Explorer - 5601-5700 - Page 57 of 108

Type	Label	Description
Statement
Theorem	addgt0i 5601	Addition of 2 positive numbers is positive.
|- A e. RR   &   |- B e. RR   &   |- 0 < A   &   |- 0 < B   =>   |- 0 < (A + B)
Theorem	add20 5602	Two nonnegative numbers are zero iff their sum is zero.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ 0 <_ B) -> ((A + B) = 0 <-> (A = 0 /\ B = 0)))
Theorem	ltneg 5603	Negative of both sides of 'less than'. Theorem I.23 of [Apostol] p. 20.
|- A e. RR   &   |- B e. RR   =>   |- (A < B <-> -uB < -uA)
Theorem	leneg 5604	Negative of both sides of 'less than or equal to'.
|- A e. RR   &   |- B e. RR   =>   |- (A <_ B <-> -uB <_ -uA)
Theorem	ltnegcon2 5605	Contraposition of negative in 'less than'.
|- A e. RR   &   |- B e. RR   =>   |- (A < -uB <-> B < -uA)
Theorem	mulgt0 5606	The product of two positive numbers is positive.
|- A e. RR   &   |- B e. RR   =>   |- ((0 < A /\ 0 < B) -> 0 < (A x. B))
Theorem	mulge0 5607	The product of two nonnegative numbers is nonnegative.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ 0 <_ B) -> 0 <_ (A x. B))
Theorem	mulgt0i 5608	The product of two positive numbers is positive.
|- A e. RR   &   |- B e. RR   &   |- 0 < A   &   |- 0 < B   =>   |- 0 < (A x. B)
Theorem	ltnr 5609	'Less than' is irreflexive.
|- A e. RR   =>   |- -. A < A
Theorem	leid 5610	'Less than or equal to' is reflexive.
|- A e. RR   =>   |- A <_ A
Theorem	gt0ne0 5611	Positive means non-zero (useful for ordering theorems involving division).
|- A e. RR   =>   |- (0 < A -> A =/= 0)
Theorem	lesub0 5612	Lemma to show a nonnegative number is zero.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ B <_ (B - A)) <-> A = 0)
Theorem	msqgt0 5613	A non-zero square is positive. Theorem I.20 of [Apostol] p. 20.
|- A e. RR   =>   |- (A =/= 0 -> 0 < (A x. A))
Theorem	msqge0 5614	A square is nonnegative.
|- A e. RR   =>   |- 0 <_ (A x. A)
Theorem	msqgt0t 5615	A non-zero square is positive. Theorem I.20 of [Apostol] p. 20.
|- ((A e. RR /\ A =/= 0) -> 0 < (A x. A))
Theorem	msqge0t 5616	A square is nonnegative.
|- (A e. RR -> 0 <_ (A x. A))
Theorem	gt0ne0i 5617	Positive implies nonzero.
|- A e. RR   &   |- 0 < A   =>   |- A =/= 0
Theorem	gt0ne0t 5618	Positive implies nonzero.
|- ((A e. RR /\ 0 < A) -> A =/= 0)
Theorem	ne0gt0t 5619	A nonzero nonnegative number is positive.
|- ((A e. RR /\ 0 <_ A) -> (A =/= 0 <-> 0 < A))
Theorem	letrit 5620	Trichotomy law.
|- ((A e. RR /\ B e. RR) -> (A <_ B \/ B <_ A))
Theorem	lecase 5621	Ordering elimination by cases.
|- (ph -> A e. RR)   &   |- (ph -> B e. RR)   &   |- ((ph /\ A <_ B) -> ps)   &   |- ((ph /\ B <_ A) -> ps)   =>   |- (ph -> ps)
Theorem	lelttrit 5622	Trichotomy law.
|- ((A e. RR /\ B e. RR) -> (A <_ B \/ B < A))
Theorem	ltadd1t 5623	Addition to both sides of 'less than'.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> (A < B <-> (A + C) < (B + C)))
Theorem	ltadd2t 5624	Addition to both sides of 'less than'.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> (A < B <-> (C + A) < (C + B)))
Theorem	leadd1t 5625	Addition to both sides of 'less than or equal to'.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> (A <_ B <-> (A + C) <_ (B + C)))
Theorem	leadd2t 5626	Addition to both sides of 'less than or equal to'.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> (A <_ B <-> (C + A) <_ (C + B)))
Theorem	ltsubaddt 5627	'Less than' relationship between subtraction and addition.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A - B) < C <-> A < (C + B)))
Theorem	ltsubadd2t 5628	'Less than' relationship between subtraction and addition.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A - B) < C <-> A < (B + C)))
Theorem	lesubaddt 5629	'Less than or equal to' relationship between subtraction and addition.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A - B) <_ C <-> A <_ (C + B)))
Theorem	lesubadd2t 5630	'Less than or equal to' relationship between subtraction and addition.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A - B) <_ C <-> A <_ (B + C)))
Theorem	ltaddsubt 5631	'Less than' relationship between addition and subtraction.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A + B) < C <-> A < (C - B)))
Theorem	ltaddsub2t 5632	'Less than' relationship between addition and subtraction.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A + B) < C <-> B < (C - A)))
Theorem	leaddsubt 5633	'Less than or equal to' relationship between addition and subtraction.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A + B) <_ C <-> A <_ (C - B)))
Theorem	leaddsub2t 5634	'Less than or equal to' relationship between and addition and subtraction.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A + B) <_ C <-> B <_ (C - A)))
Theorem	sublet 5635	Swap subtrahends in an inequality.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A - B) <_ C <-> (A - C) <_ B))
Theorem	lesubt 5636	Swap subtrahends in an inequality.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> (A <_ (B - C) <-> C <_ (B - A)))
Theorem	ltsubadd2 5637	'Less than' relationship between subtraction and addition.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- ((A - B) < C <-> A < (B + C))
Theorem	lesubadd2 5638	'Less than or equal to' relationship between subtraction and addition.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- ((A - B) <_ C <-> A <_ (B + C))
Theorem	ltaddsub 5639	'Less than' relationship between subtraction and addition.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- ((A + B) < C <-> A < (C - B))
Theorem	ltmullem 5640	Multiplication of both sides of 'less than' by a positive number. Theorem I.19 of [Apostol] p. 20.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- (0 < C -> (A < B -> (A x. C) < (B x. C)))
Theorem	ltsub23t 5641	'Less than' relationship between subtraction and addition.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A - B) < C <-> (A - C) < B))
Theorem	ltsub13t 5642	'Less than' relationship between subtraction and addition.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> (A < (B - C) <-> C < (B - A)))
Theorem	lt2addt 5643	Adding both sides of two 'less than' relations. Theorem I.25 of [Apostol] p. 20.
|- (((A e. RR /\ B e. RR) /\ (C e. RR /\ D e. RR)) -> ((A < C /\ B < D) -> (A + B) < (C + D)))
Theorem	le2addt 5644	Adding both sides of two 'less than or equal to' relations.
|- (((A e. RR /\ B e. RR) /\ (C e. RR /\ D e. RR)) -> ((A <_ C /\ B <_ D) -> (A + B) <_ (C + D)))
Theorem	ltleaddt 5645	Adding both sides of two orderings.
|- (((A e. RR /\ B e. RR) /\ (C e. RR /\ D e. RR)) -> ((A < C /\ B <_ D) -> (A + B) < (C + D)))
Theorem	leltaddt 5646	Adding both sides of two orderings.
|- (((A e. RR /\ B e. RR) /\ (C e. RR /\ D e. RR)) -> ((A <_ C /\ B < D) -> (A + B) < (C + D)))
Theorem	addgt0t 5647	The sum of 2 positive numbers is positive.
|- (((A e. RR /\ B e. RR) /\ (0 < A /\ 0 < B)) -> 0 < (A + B))
Theorem	addgegt0t 5648	The sum of nonnegative and positive numbers is positive.
|- (((A e. RR /\ B e. RR) /\ (0 <_ A /\ 0 < B)) -> 0 < (A + B))
Theorem	addgtge0t 5649	The sum of nonnegative and positive numbers is positive.
|- (((A e. RR /\ B e. RR) /\ (0 < A /\ 0 <_ B)) -> 0 < (A + B))
Theorem	addge0t 5650	The sum of 2 nonnegative numbers is nonnegative.
|- (((A e. RR /\ B e. RR) /\ (0 <_ A /\ 0 <_ B)) -> 0 <_ (A + B))
Theorem	ltaddpost 5651	Adding a positive number to another number increases it.
|- ((A e. RR /\ B e. RR) -> (0 < A <-> B < (B + A)))
Theorem	ltaddpos2t 5652	Adding a positive number to another number increases it.
|- ((A e. RR /\ B e. RR) -> (0 < A <-> B < (A + B)))
Theorem	ltsubpost 5653	Subtracting a positive number from another number decreases it.
|- ((A e. RR /\ B e. RR) -> (0 < A <-> (B - A) < B))
Theorem	posdift 5654	Comparison of two numbers whose difference is positive.
|- ((A e. RR /\ B e. RR)