HomeHome Metamath Proof Explorer < Previous   Next >
Browser slow? Try the
Unicode version.

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-10766

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-8795)
  Hilbert Space Explorer  Hilbert Space Explorer
(8796-10377)
  User Sandboxes  User Sandboxes
(10378-10766)
 

Statement List for Metamath Proof Explorer - 5601-5700 - Page 57 of 108
TypeLabelDescription
Statement
 
Theoremltnsym 5601 'Less than' is not symmetric.
|- A e. RR   &   |- B e. RR   =>   |- (A < B -> -. B < A)
 
Theoremlenlt 5602 'Less than or equal to' in terms of 'less than'.
|- A e. RR   &   |- B e. RR   =>   |- (A <_ B <-> -. B < A)
 
Theoremltnle 5603 'Less than' in terms of 'less than or equal to'.
|- A e. RR   &   |- B e. RR   =>   |- (A < B <-> -. B <_ A)
 
Theoremltle 5604 'Less than' implies 'less than or equal to'.
|- A e. RR   &   |- B e. RR   =>   |- (A < B -> A <_ B)
 
Theoremltlei 5605 'Less than' implies 'less than or equal to' (inference).
|- A e. RR   &   |- B e. RR   &   |- A < B   =>   |- A <_ B
 
Theoremeqle 5606 Equality implies 'less than or equal to'.
|- A e. RR   &   |- B e. RR   =>   |- (A = B -> A <_ B)
 
Theoremltne 5607 'Less than' implies not equal.
|- A e. RR   &   |- B e. RR   =>   |- (A < B -> B =/= A)
 
Theoremletri 5608 Trichotomy law for 'less than or equal to'.
|- A e. RR   &   |- B e. RR   =>   |- (A <_ B \/ B <_ A)
 
Theoremlttr 5609 'Less than' is transitive. Theorem I.17 of [Apostol] p. 20.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- ((A < B /\ B < C) -> A < C)
 
Theoremlelttr 5610 'Less than or equal to', 'less than' transitive law.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- ((A <_ B /\ B < C) -> A < C)
 
Theoremltletr 5611 'Less than', 'less than or equal to' transitive law.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- ((A < B /\ B <_ C) -> A < C)
 
Theoremletr 5612 'Less than or equal to' is transitive.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- ((A <_ B /\ B <_ C) -> A <_ C)
 
Theoremle2tri3 5613 Extended trichotomy law for 'less than or equal to'.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- ((A <_ B /\ B <_ C /\ C <_ A) <-> (A = B /\ B = C /\ C = A))
 
Theoremltadd2 5614 Addition to both sides of 'less than'. (Proof shortened by Paul Chapman, 27-Jan-2008.)
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- (A < B <-> (C + A) < (C + B))
 
Theoremltadd1 5615 Addition to both sides of 'less than'. Theorem I.18 of [Apostol] p. 20.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- (A < B <-> (A + C) < (B + C))
 
Theoremleadd1 5616 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))
 
Theoremleadd2 5617 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))
 
Theoremltsubadd 5618 'Less than' relationship between subtraction and addition.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- ((A - B) < C <-> A < (C + B))
 
Theoremlesubadd 5619 '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))
 
Theoremlt2add 5620 Adding both side of two inequalities. 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))
 
Theoremle2add 5621 Adding both side of two inequalities.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   &   |- D e. RR   =>   |- ((A <_ C /\ B <_ D) -> (A + B) <_ (C + D))
 
Theoremaddgt0 5622 Addition of 2 positive numbers is positive.
|- A e. RR   &   |- B e. RR   =>   |- ((0 < A /\ 0 < B) -> 0 < (A + B))
 
Theoremaddge0 5623 Addition of 2 nonnegative numbers is nonnegative.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ 0 <_ B) -> 0 <_ (A + B))
 
Theoremaddgegt0 5624 Addition of nonnegative and positive numbers is positive.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ 0 < B) -> 0 < (A + B))
 
Theoremaddgt0i 5625 Addition of 2 positive numbers is positive.
|- A e. RR   &   |- B e. RR   &   |- 0 < A   &   |- 0 < B   =>   |- 0 < (A + B)
 
Theoremadd20 5626 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)))
 
Theoremltneg 5627 Negative of both sides of 'less than'. Theorem I.23 of [Apostol] p. 20.
|- A e. RR   &   |- B e. RR   =>   |- (A < B <-> -uB < -uA)
 
Theoremleneg 5628 Negative of both sides of 'less than or equal to'.
|- A e. RR   &   |- B e. RR   =>   |- (A <_ B <-> -uB <_ -uA)
 
Theoremltnegcon2 5629 Contraposition of negative in 'less than'.
|- A e. RR   &   |- B e. RR   =>   |- (A < -uB <-> B < -uA)
 
Theoremmulgt0 5630 The product of two positive numbers is positive.
|- A e. RR   &   |- B e. RR   =>   |- ((0 < A /\ 0 < B) -> 0 < (A x. B))
 
Theoremmulge0 5631 The product of two nonnegative numbers is nonnegative.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ 0 <_ B) -> 0 <_ (A x. B))
 
Theoremmulgt0i 5632 The product of two positive numbers is positive.
|- A e. RR   &   |- B e. RR   &   |- 0 < A   &   |- 0 < B   =>   |- 0 < (A x. B)
 
Theoremltnr 5633 'Less than' is irreflexive.
|- A e. RR   =>   |- -. A < A
 
Theoremleid 5634 'Less than or equal to' is reflexive.
|- A e. RR   =>   |- A <_ A
 
Theoremgt0ne0 5635 Positive means non-zero (useful for ordering theorems involving division).
|- A e. RR   =>   |- (0 < A -> A =/= 0)
 
Theoremlesub0 5636 Lemma to show a nonnegative number is zero.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ B <_ (B - A)) <-> A = 0)
 
Theoremmsqgt0 5637 A non-zero square is positive. Theorem I.20 of [Apostol] p. 20.
|- A e. RR   =>   |- (A =/= 0 -> 0 < (A x. A))
 
Theoremmsqge0 5638 A square is nonnegative.
|- A e. RR   =>   |- 0 <_ (A x. A)
 
Theoremmsqgt0t 5639 A non-zero square is positive. Theorem I.20 of [Apostol] p. 20.
|- ((A e. RR /\ A =/= 0) -> 0 < (A x. A))
 
Theoremmsqge0t 5640 A square is nonnegative.
|- (A e. RR -> 0 <_ (A x. A))
 
Theoremgt0ne0i 5641 Positive implies nonzero.
|- A e. RR   &   |- 0 < A   =>   |- A =/= 0
 
Theoremgt0ne0t 5642 Positive implies nonzero.
|- ((A e. RR /\ 0 < A) -> A =/= 0)
 
Theoremne0gt0t 5643 A nonzero nonnegative number is positive.
|- ((A e. RR /\ 0 <_ A) -> (A =/= 0 <-> 0 < A))
 
Theoremletrit 5644 Trichotomy law.
|- ((A e. RR /\ B e. RR) -> (A <_ B \/ B <_ A))
 
Theoremlecase 5645 Ordering elimination by cases.
|- (ph -> A e. RR)   &   |- (ph -> B e. RR)   &   |- ((ph /\ A <_ B) -> ps)   &   |- ((ph /\ B <_ A) -> ps)   =>   |- (ph -> ps)
 
Theoremlelttrit 5646 Trichotomy law.
|- ((A e. RR /\ B e. RR) -> (A <_ B \/ B < A))
 
Theoremltadd1t 5647 Addition to both sides of 'less than'.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> (A < B <-> (A + C) < (B + C)))
 
Theoremltadd2t 5648 Addition to both sides of 'less than'.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> (A < B <-> (C + A) < (C + B)))
 
Theoremleadd1t 5649 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)))
 
Theoremleadd2t 5650 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)))
 
Theoremltsubaddt 5651 'Less than' relationship between subtraction and addition.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A - B) < C <-> A < (C + B)))
 
Theoremltsubadd2t 5652 'Less than' relationship between subtraction and addition.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A - B) < C <-> A < (B + C)))
 
Theoremlesubaddt 5653 '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)))
 
Theoremlesubadd2t 5654 '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)))
 
Theoremltaddsubt 5655 'Less than' relationship between addition and subtraction.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A + B) < C <-> A < (C - B)))
 
Theoremltaddsub2t 5656 'Less than' relationship between addition and subtraction.
|- ((A e. RR /\ B e. RR /\ C e. RR) -> ((A + B) < C <-> B < (