Home Metamath Proof ExplorerTheorem List (p. 107 of 429) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

 Color key: Metamath Proof Explorer (1-27903) Hilbert Space Explorer (27904-29428) Users' Mathboxes (29429-42879)

Theorem List for Metamath Proof Explorer - 10601-10700   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremgt0ne0i 10601 Positive means nonzero (useful for ordering theorems involving division). (Contributed by NM, 16-Sep-1999.)
𝐴 ∈ ℝ       (0 < 𝐴𝐴 ≠ 0)

Theoremgt0ne0ii 10602 Positive implies nonzero. (Contributed by NM, 15-May-1999.)
𝐴 ∈ ℝ    &   0 < 𝐴       𝐴 ≠ 0

Theoremmsqgt0i 10603 A nonzero square is positive. Theorem I.20 of [Apostol] p. 20. (Contributed by NM, 17-Jan-1997.) (Revised by Mario Carneiro, 27-May-2016.)
𝐴 ∈ ℝ       (𝐴 ≠ 0 → 0 < (𝐴 · 𝐴))

Theoremmsqge0i 10604 A square is nonnegative. (Contributed by NM, 14-May-1999.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
𝐴 ∈ ℝ       0 ≤ (𝐴 · 𝐴)

Theoremaddgt0i 10605 Addition of 2 positive numbers is positive. (Contributed by NM, 16-May-1999.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       ((0 < 𝐴 ∧ 0 < 𝐵) → 0 < (𝐴 + 𝐵))

Theoremaddge0i 10606 Addition of 2 nonnegative numbers is nonnegative. (Contributed by NM, 28-May-1999.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → 0 ≤ (𝐴 + 𝐵))

Theoremaddgegt0i 10607 Addition of nonnegative and positive numbers is positive. (Contributed by NM, 25-Sep-1999.) (Revised by Mario Carneiro, 27-May-2016.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       ((0 ≤ 𝐴 ∧ 0 < 𝐵) → 0 < (𝐴 + 𝐵))

Theoremaddgt0ii 10608 Addition of 2 positive numbers is positive. (Contributed by NM, 18-May-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   0 < 𝐴    &   0 < 𝐵       0 < (𝐴 + 𝐵)

Theoremadd20i 10609 Two nonnegative numbers are zero iff their sum is zero. (Contributed by NM, 28-Jul-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → ((𝐴 + 𝐵) = 0 ↔ (𝐴 = 0 ∧ 𝐵 = 0)))

Theoremltnegi 10610 Negative of both sides of 'less than'. Theorem I.23 of [Apostol] p. 20. (Contributed by NM, 21-Jan-1997.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (𝐴 < 𝐵 ↔ -𝐵 < -𝐴)

Theoremlenegi 10611 Negative of both sides of 'less than or equal to'. (Contributed by NM, 1-Aug-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (𝐴𝐵 ↔ -𝐵 ≤ -𝐴)

Theoremltnegcon2i 10612 Contraposition of negative in 'less than'. (Contributed by NM, 14-May-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (𝐴 < -𝐵𝐵 < -𝐴)

Theoremmulge0i 10613 The product of two nonnegative numbers is nonnegative. (Contributed by NM, 30-Jul-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → 0 ≤ (𝐴 · 𝐵))

Theoremlesub0i 10614 Lemma to show a nonnegative number is zero. (Contributed by NM, 8-Oct-1999.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       ((0 ≤ 𝐴𝐵 ≤ (𝐵𝐴)) ↔ 𝐴 = 0)

Theoremltaddposi 10615 Adding a positive number to another number increases it. (Contributed by NM, 25-Aug-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (0 < 𝐴𝐵 < (𝐵 + 𝐴))

Theoremposdifi 10616 Comparison of two numbers whose difference is positive. (Contributed by NM, 19-Aug-2001.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (𝐴 < 𝐵 ↔ 0 < (𝐵𝐴))

Theoremltnegcon1i 10617 Contraposition of negative in 'less than'. (Contributed by NM, 14-May-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (-𝐴 < 𝐵 ↔ -𝐵 < 𝐴)

Theoremlenegcon1i 10618 Contraposition of negative in 'less than or equal to'. (Contributed by NM, 6-Apr-2005.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (-𝐴𝐵 ↔ -𝐵𝐴)

Theoremsubge0i 10619 Nonnegative subtraction. (Contributed by NM, 13-Aug-2000.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (0 ≤ (𝐴𝐵) ↔ 𝐵𝐴)

Theoremltadd1i 10620 Addition to both sides of 'less than'. Theorem I.18 of [Apostol] p. 20. (Contributed by NM, 21-Jan-1997.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝐶 ∈ ℝ       (𝐴 < 𝐵 ↔ (𝐴 + 𝐶) < (𝐵 + 𝐶))

Theoremleadd1i 10621 Addition to both sides of 'less than or equal to'. (Contributed by NM, 11-Aug-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝐶 ∈ ℝ       (𝐴𝐵 ↔ (𝐴 + 𝐶) ≤ (𝐵 + 𝐶))

Theoremleadd2i 10622 Addition to both sides of 'less than or equal to'. (Contributed by NM, 11-Aug-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝐶 ∈ ℝ       (𝐴𝐵 ↔ (𝐶 + 𝐴) ≤ (𝐶 + 𝐵))

Theoremltsubaddi 10623 'Less than' relationship between subtraction and addition. (Contributed by NM, 21-Jan-1997.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝐶 ∈ ℝ       ((𝐴𝐵) < 𝐶𝐴 < (𝐶 + 𝐵))

Theoremlesubaddi 10624 'Less than or equal to' relationship between subtraction and addition. (Contributed by NM, 30-Sep-1999.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝐶 ∈ ℝ       ((𝐴𝐵) ≤ 𝐶𝐴 ≤ (𝐶 + 𝐵))

Theoremltsubadd2i 10625 'Less than' relationship between subtraction and addition. (Contributed by NM, 21-Jan-1997.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝐶 ∈ ℝ       ((𝐴𝐵) < 𝐶𝐴 < (𝐵 + 𝐶))

Theoremlesubadd2i 10626 'Less than or equal to' relationship between subtraction and addition. (Contributed by NM, 3-Aug-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝐶 ∈ ℝ       ((𝐴𝐵) ≤ 𝐶𝐴 ≤ (𝐵 + 𝐶))

Theoremltaddsubi 10627 'Less than' relationship between subtraction and addition. (Contributed by NM, 14-May-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝐶 ∈ ℝ       ((𝐴 + 𝐵) < 𝐶𝐴 < (𝐶𝐵))

Theoremlt2addi 10628 Adding both side of two inequalities. Theorem I.25 of [Apostol] p. 20. (Contributed by NM, 14-May-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝐶 ∈ ℝ    &   𝐷 ∈ ℝ       ((𝐴 < 𝐶𝐵 < 𝐷) → (𝐴 + 𝐵) < (𝐶 + 𝐷))

Theoremle2addi 10629 Adding both side of two inequalities. (Contributed by NM, 16-Sep-1999.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝐶 ∈ ℝ    &   𝐷 ∈ ℝ       ((𝐴𝐶𝐵𝐷) → (𝐴 + 𝐵) ≤ (𝐶 + 𝐷))

Theoremgt0ne0d 10630 Positive implies nonzero. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑 → 0 < 𝐴)       (𝜑𝐴 ≠ 0)

Theoremlt0ne0d 10631 Something less than zero is not zero. Deduction form. (Contributed by David Moews, 28-Feb-2017.)
(𝜑𝐴 < 0)       (𝜑𝐴 ≠ 0)

Theoremleidd 10632 'Less than or equal to' is reflexive. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)       (𝜑𝐴𝐴)

Theoremmsqgt0d 10633 A nonzero square is positive. Theorem I.20 of [Apostol] p. 20. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐴 ≠ 0)       (𝜑 → 0 < (𝐴 · 𝐴))

Theoremmsqge0d 10634 A square is nonnegative. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)       (𝜑 → 0 ≤ (𝐴 · 𝐴))

Theoremlt0neg1d 10635 Comparison of a number and its negative to zero. Theorem I.23 of [Apostol] p. 20. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)       (𝜑 → (𝐴 < 0 ↔ 0 < -𝐴))

Theoremlt0neg2d 10636 Comparison of a number and its negative to zero. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)       (𝜑 → (0 < 𝐴 ↔ -𝐴 < 0))

Theoremle0neg1d 10637 Comparison of a number and its negative to zero. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)       (𝜑 → (𝐴 ≤ 0 ↔ 0 ≤ -𝐴))

Theoremle0neg2d 10638 Comparison of a number and its negative to zero. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)       (𝜑 → (0 ≤ 𝐴 ↔ -𝐴 ≤ 0))

Theoremaddgegt0d 10639 Addition of nonnegative and positive numbers is positive. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝐴)    &   (𝜑 → 0 < 𝐵)       (𝜑 → 0 < (𝐴 + 𝐵))

Theoremaddgt0d 10640 Addition of 2 positive numbers is positive. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑 → 0 < 𝐴)    &   (𝜑 → 0 < 𝐵)       (𝜑 → 0 < (𝐴 + 𝐵))

Theoremaddge0d 10641 Addition of 2 nonnegative numbers is nonnegative. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝐴)    &   (𝜑 → 0 ≤ 𝐵)       (𝜑 → 0 ≤ (𝐴 + 𝐵))

Theoremmulge0d 10642 The product of two nonnegative numbers is nonnegative. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝐴)    &   (𝜑 → 0 ≤ 𝐵)       (𝜑 → 0 ≤ (𝐴 · 𝐵))

Theoremltnegd 10643 Negative of both sides of 'less than'. Theorem I.23 of [Apostol] p. 20. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → (𝐴 < 𝐵 ↔ -𝐵 < -𝐴))

Theoremlenegd 10644 Negative of both sides of 'less than or equal to'. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → (𝐴𝐵 ↔ -𝐵 ≤ -𝐴))

Theoremltnegcon1d 10645 Contraposition of negative in 'less than'. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑 → -𝐴 < 𝐵)       (𝜑 → -𝐵 < 𝐴)

Theoremltnegcon2d 10646 Contraposition of negative in 'less than'. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴 < -𝐵)       (𝜑𝐵 < -𝐴)

Theoremlenegcon1d 10647 Contraposition of negative in 'less than or equal to'. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑 → -𝐴𝐵)       (𝜑 → -𝐵𝐴)

Theoremlenegcon2d 10648 Contraposition of negative in 'less than or equal to'. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴 ≤ -𝐵)       (𝜑𝐵 ≤ -𝐴)

Theoremltaddposd 10649 Adding a positive number to another number increases it. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → (0 < 𝐴𝐵 < (𝐵 + 𝐴)))

Theoremltaddpos2d 10650 Adding a positive number to another number increases it. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → (0 < 𝐴𝐵 < (𝐴 + 𝐵)))

Theoremltsubposd 10651 Subtracting a positive number from another number decreases it. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → (0 < 𝐴 ↔ (𝐵𝐴) < 𝐵))

Theoremposdifd 10652 Comparison of two numbers whose difference is positive. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → (𝐴 < 𝐵 ↔ 0 < (𝐵𝐴)))

Theoremaddge01d 10653 A number is less than or equal to itself plus a nonnegative number. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → (0 ≤ 𝐵𝐴 ≤ (𝐴 + 𝐵)))

Theoremaddge02d 10654 A number is less than or equal to itself plus a nonnegative number. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → (0 ≤ 𝐵𝐴 ≤ (𝐵 + 𝐴)))

Theoremsubge0d 10655 Nonnegative subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → (0 ≤ (𝐴𝐵) ↔ 𝐵𝐴))

Theoremsuble0d 10656 Nonpositive subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → ((𝐴𝐵) ≤ 0 ↔ 𝐴𝐵))

Theoremsubge02d 10657 Nonnegative subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → (0 ≤ 𝐵 ↔ (𝐴𝐵) ≤ 𝐴))

Theoremltadd1d 10658 Addition to both sides of 'less than'. Theorem I.18 of [Apostol] p. 20. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → (𝐴 < 𝐵 ↔ (𝐴 + 𝐶) < (𝐵 + 𝐶)))

Theoremleadd1d 10659 Addition to both sides of 'less than or equal to'. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → (𝐴𝐵 ↔ (𝐴 + 𝐶) ≤ (𝐵 + 𝐶)))

Theoremleadd2d 10660 Addition to both sides of 'less than or equal to'. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → (𝐴𝐵 ↔ (𝐶 + 𝐴) ≤ (𝐶 + 𝐵)))

Theoremltsubaddd 10661 'Less than' relationship between subtraction and addition. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → ((𝐴𝐵) < 𝐶𝐴 < (𝐶 + 𝐵)))

Theoremlesubaddd 10662 'Less than or equal to' relationship between subtraction and addition. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → ((𝐴𝐵) ≤ 𝐶𝐴 ≤ (𝐶 + 𝐵)))

Theoremltsubadd2d 10663 'Less than' relationship between subtraction and addition. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → ((𝐴𝐵) < 𝐶𝐴 < (𝐵 + 𝐶)))

Theoremlesubadd2d 10664 'Less than or equal to' relationship between subtraction and addition. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → ((𝐴𝐵) ≤ 𝐶𝐴 ≤ (𝐵 + 𝐶)))

Theoremltaddsubd 10665 'Less than' relationship between subtraction and addition. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → ((𝐴 + 𝐵) < 𝐶𝐴 < (𝐶𝐵)))

Theoremltaddsub2d 10666 'Less than' relationship between subtraction and addition. (Contributed by Mario Carneiro, 29-Dec-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → ((𝐴 + 𝐵) < 𝐶𝐵 < (𝐶𝐴)))

Theoremleaddsub2d 10667 'Less than or equal to' relationship between and addition and subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → ((𝐴 + 𝐵) ≤ 𝐶𝐵 ≤ (𝐶𝐴)))

Theoremsubled 10668 Swap subtrahends in an inequality. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑 → (𝐴𝐵) ≤ 𝐶)       (𝜑 → (𝐴𝐶) ≤ 𝐵)

Theoremlesubd 10669 Swap subtrahends in an inequality. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐴 ≤ (𝐵𝐶))       (𝜑𝐶 ≤ (𝐵𝐴))

Theoremltsub23d 10670 'Less than' relationship between subtraction and addition. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑 → (𝐴𝐵) < 𝐶)       (𝜑 → (𝐴𝐶) < 𝐵)

Theoremltsub13d 10671 'Less than' relationship between subtraction and addition. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐴 < (𝐵𝐶))       (𝜑𝐶 < (𝐵𝐴))

Theoremlesub1d 10672 Subtraction from both sides of 'less than or equal to'. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → (𝐴𝐵 ↔ (𝐴𝐶) ≤ (𝐵𝐶)))

Theoremlesub2d 10673 Subtraction of both sides of 'less than or equal to'. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → (𝐴𝐵 ↔ (𝐶𝐵) ≤ (𝐶𝐴)))

Theoremltsub1d 10674 Subtraction from both sides of 'less than'. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → (𝐴 < 𝐵 ↔ (𝐴𝐶) < (𝐵𝐶)))

Theoremltsub2d 10675 Subtraction of both sides of 'less than'. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)       (𝜑 → (𝐴 < 𝐵 ↔ (𝐶𝐵) < (𝐶𝐴)))

Theoremltadd1dd 10676 Addition to both sides of 'less than'. Theorem I.18 of [Apostol] p. 20. (Contributed by Mario Carneiro, 30-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐴 < 𝐵)       (𝜑 → (𝐴 + 𝐶) < (𝐵 + 𝐶))

Theoremltsub1dd 10677 Subtraction from both sides of 'less than'. (Contributed by Mario Carneiro, 30-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐴 < 𝐵)       (𝜑 → (𝐴𝐶) < (𝐵𝐶))

Theoremltsub2dd 10678 Subtraction of both sides of 'less than'. (Contributed by Mario Carneiro, 30-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐴 < 𝐵)       (𝜑 → (𝐶𝐵) < (𝐶𝐴))

Theoremleadd1dd 10679 Addition to both sides of 'less than or equal to'. (Contributed by Mario Carneiro, 30-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐴𝐵)       (𝜑 → (𝐴 + 𝐶) ≤ (𝐵 + 𝐶))

Theoremleadd2dd 10680 Addition to both sides of 'less than or equal to'. (Contributed by Mario Carneiro, 30-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐴𝐵)       (𝜑 → (𝐶 + 𝐴) ≤ (𝐶 + 𝐵))

Theoremlesub1dd 10681 Subtraction from both sides of 'less than or equal to'. (Contributed by Mario Carneiro, 30-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐴𝐵)       (𝜑 → (𝐴𝐶) ≤ (𝐵𝐶))

Theoremlesub2dd 10682 Subtraction of both sides of 'less than or equal to'. (Contributed by Mario Carneiro, 30-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐴𝐵)       (𝜑 → (𝐶𝐵) ≤ (𝐶𝐴))

Theoremlesub3d 10683 The result of subtracting a number less than or equal to an intermediate number from a number greater than or equal to a third number increased by the intermediate number is greater than or equal to the third number. (Contributed by AV, 13-Aug-2020.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝑋 ∈ ℝ)    &   (𝜑 → (𝑋 + 𝐶) ≤ 𝐴)    &   (𝜑𝐵𝑋)       (𝜑𝐶 ≤ (𝐴𝐵))

Theoremle2addd 10684 Adding both side of two inequalities. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐷 ∈ ℝ)    &   (𝜑𝐴𝐶)    &   (𝜑𝐵𝐷)       (𝜑 → (𝐴 + 𝐵) ≤ (𝐶 + 𝐷))

Theoremle2subd 10685 Subtracting both sides of two 'less than or equal to' relations. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐷 ∈ ℝ)    &   (𝜑𝐴𝐶)    &   (𝜑𝐵𝐷)       (𝜑 → (𝐴𝐷) ≤ (𝐶𝐵))

Theoremltleaddd 10686 Adding both sides of two orderings. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐷 ∈ ℝ)    &   (𝜑𝐴 < 𝐶)    &   (𝜑𝐵𝐷)       (𝜑 → (𝐴 + 𝐵) < (𝐶 + 𝐷))

Theoremleltaddd 10687 Adding both sides of two orderings. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐷 ∈ ℝ)    &   (𝜑𝐴𝐶)    &   (𝜑𝐵 < 𝐷)       (𝜑 → (𝐴 + 𝐵) < (𝐶 + 𝐷))

Theoremlt2addd 10688 Adding both side of two inequalities. Theorem I.25 of [Apostol] p. 20. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐷 ∈ ℝ)    &   (𝜑𝐴 < 𝐶)    &   (𝜑𝐵 < 𝐷)       (𝜑 → (𝐴 + 𝐵) < (𝐶 + 𝐷))

Theoremlt2subd 10689 Subtracting both sides of two 'less than' relations. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐷 ∈ ℝ)    &   (𝜑𝐴 < 𝐶)    &   (𝜑𝐵 < 𝐷)       (𝜑 → (𝐴𝐷) < (𝐶𝐵))

Theorempossumd 10690 Condition for a positive sum. (Contributed by Scott Fenton, 16-Dec-2017.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → (0 < (𝐴 + 𝐵) ↔ -𝐵 < 𝐴))

Theoremsublt0d 10691 When a subtraction gives a negative result. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)       (𝜑 → ((𝐴𝐵) < 0 ↔ 𝐴 < 𝐵))

Theoremltaddsublt 10692 Addition and subtraction on one side of 'less than'. (Contributed by AV, 24-Nov-2018.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐶 ↔ ((𝐴 + 𝐵) − 𝐶) < 𝐴))

Theorem1le1 10693 1 ≤ 1. Common special case. (Contributed by David A. Wheeler, 16-Jul-2016.)
1 ≤ 1

5.3.5  Reciprocals

Theoremixi 10694 i times itself is minus 1. (Contributed by NM, 6-May-1999.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
(i · i) = -1

Theoremrecextlem1 10695 Lemma for recex 10697. (Contributed by Eric Schmidt, 23-May-2007.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + (i · 𝐵)) · (𝐴 − (i · 𝐵))) = ((𝐴 · 𝐴) + (𝐵 · 𝐵)))

Theoremrecextlem2 10696 Lemma for recex 10697. (Contributed by Eric Schmidt, 23-May-2007.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐴 + (i · 𝐵)) ≠ 0) → ((𝐴 · 𝐴) + (𝐵 · 𝐵)) ≠ 0)

Theoremrecex 10697* Existence of reciprocal of nonzero complex number. (Contributed by Eric Schmidt, 22-May-2007.)
((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) → ∃𝑥 ∈ ℂ (𝐴 · 𝑥) = 1)

Theoremmulcand 10698 Cancellation law for multiplication. Theorem I.7 of [Apostol] p. 18. (Contributed by NM, 26-Jan-1995.) (Revised by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝐵 ∈ ℂ)    &   (𝜑𝐶 ∈ ℂ)    &   (𝜑𝐶 ≠ 0)       (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵))

Theoremmulcan2d 10699 Cancellation law for multiplication. Theorem I.7 of [Apostol] p. 18. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝐵 ∈ ℂ)    &   (𝜑𝐶 ∈ ℂ)    &   (𝜑𝐶 ≠ 0)       (𝜑 → ((𝐴 · 𝐶) = (𝐵 · 𝐶) ↔ 𝐴 = 𝐵))

Theoremmulcanad 10700 Cancellation of a nonzero factor on the left in an equation. One-way deduction form of mulcand 10698. (Contributed by David Moews, 28-Feb-2017.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝐵 ∈ ℂ)    &   (𝜑𝐶 ∈ ℂ)    &   (𝜑𝐶 ≠ 0)    &   (𝜑 → (𝐶 · 𝐴) = (𝐶 · 𝐵))       (𝜑𝐴 = 𝐵)

Page List
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-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42500 426 42501-42600 427 42601-42700 428 42701-42800 429 42801-42879
 Copyright terms: Public domain < Previous  Next >