HomeHome Intuitionistic Logic Explorer
Theorem List (p. 77 of 115)
< Previous  Next >
Bad symbols? Try the
GIF version.

Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 7601-7700   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Syntaxcneg 7601 Extend class notation to include unary minus. The symbol - is not a class by itself but part of a compound class definition. We do this rather than making it a formal function since it is so commonly used. Note: We use different symbols for unary minus (-) and subtraction cmin 7600 () to prevent syntax ambiguity. For example, looking at the syntax definition co 5615, if we used the same symbol then "( − 𝐴𝐵) " could mean either "𝐴 " minus "𝐵", or it could represent the (meaningless) operation of classes " " and "𝐵 " connected with "operation" "𝐴". On the other hand, "(-𝐴𝐵) " is unambiguous.
class -𝐴
 
Definitiondf-sub 7602* Define subtraction. Theorem subval 7621 shows its value (and describes how this definition works), theorem subaddi 7716 relates it to addition, and theorems subcli 7705 and resubcli 7692 prove its closure laws. (Contributed by NM, 26-Nov-1994.)
− = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑧 ∈ ℂ (𝑦 + 𝑧) = 𝑥))
 
Definitiondf-neg 7603 Define the negative of a number (unary minus). We use different symbols for unary minus (-) and subtraction () to prevent syntax ambiguity. See cneg 7601 for a discussion of this. (Contributed by NM, 10-Feb-1995.)
-𝐴 = (0 − 𝐴)
 
Theoremcnegexlem1 7604 Addition cancellation of a real number from two complex numbers. Lemma for cnegex 7607. (Contributed by Eric Schmidt, 22-May-2007.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) = (𝐴 + 𝐶) ↔ 𝐵 = 𝐶))
 
Theoremcnegexlem2 7605 Existence of a real number which produces a real number when multiplied by i. (Hint: zero is such a number, although we don't need to prove that yet). Lemma for cnegex 7607. (Contributed by Eric Schmidt, 22-May-2007.)
𝑦 ∈ ℝ (i · 𝑦) ∈ ℝ
 
Theoremcnegexlem3 7606* Existence of real number difference. Lemma for cnegex 7607. (Contributed by Eric Schmidt, 22-May-2007.)
((𝑏 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ∃𝑐 ∈ ℝ (𝑏 + 𝑐) = 𝑦)
 
Theoremcnegex 7607* Existence of the negative of a complex number. (Contributed by Eric Schmidt, 21-May-2007.)
(𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ (𝐴 + 𝑥) = 0)
 
Theoremcnegex2 7608* Existence of a left inverse for addition. (Contributed by Scott Fenton, 3-Jan-2013.)
(𝐴 ∈ ℂ → ∃𝑥 ∈ ℂ (𝑥 + 𝐴) = 0)
 
Theoremaddcan 7609 Cancellation law for addition. Theorem I.1 of [Apostol] p. 18. (Contributed by NM, 22-Nov-1994.) (Proof shortened by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) = (𝐴 + 𝐶) ↔ 𝐵 = 𝐶))
 
Theoremaddcan2 7610 Cancellation law for addition. (Contributed by NM, 30-Jul-2004.) (Revised by Scott Fenton, 3-Jan-2013.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐶) = (𝐵 + 𝐶) ↔ 𝐴 = 𝐵))
 
Theoremaddcani 7611 Cancellation law for addition. Theorem I.1 of [Apostol] p. 18. (Contributed by NM, 27-Oct-1999.) (Revised by Scott Fenton, 3-Jan-2013.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   𝐶 ∈ ℂ       ((𝐴 + 𝐵) = (𝐴 + 𝐶) ↔ 𝐵 = 𝐶)
 
Theoremaddcan2i 7612 Cancellation law for addition. Theorem I.1 of [Apostol] p. 18. (Contributed by NM, 14-May-2003.) (Revised by Scott Fenton, 3-Jan-2013.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   𝐶 ∈ ℂ       ((𝐴 + 𝐶) = (𝐵 + 𝐶) ↔ 𝐴 = 𝐵)
 
Theoremaddcand 7613 Cancellation law for addition. Theorem I.1 of [Apostol] p. 18. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝐵 ∈ ℂ)    &   (𝜑𝐶 ∈ ℂ)       (𝜑 → ((𝐴 + 𝐵) = (𝐴 + 𝐶) ↔ 𝐵 = 𝐶))
 
Theoremaddcan2d 7614 Cancellation law for addition. Theorem I.1 of [Apostol] p. 18. (Contributed by Mario Carneiro, 27-May-2016.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝐵 ∈ ℂ)    &   (𝜑𝐶 ∈ ℂ)       (𝜑 → ((𝐴 + 𝐶) = (𝐵 + 𝐶) ↔ 𝐴 = 𝐵))
 
Theoremaddcanad 7615 Cancelling a term on the left-hand side of a sum in an equality. Consequence of addcand 7613. (Contributed by David Moews, 28-Feb-2017.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝐵 ∈ ℂ)    &   (𝜑𝐶 ∈ ℂ)    &   (𝜑 → (𝐴 + 𝐵) = (𝐴 + 𝐶))       (𝜑𝐵 = 𝐶)
 
Theoremaddcan2ad 7616 Cancelling a term on the right-hand side of a sum in an equality. Consequence of addcan2d 7614. (Contributed by David Moews, 28-Feb-2017.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝐵 ∈ ℂ)    &   (𝜑𝐶 ∈ ℂ)    &   (𝜑 → (𝐴 + 𝐶) = (𝐵 + 𝐶))       (𝜑𝐴 = 𝐵)
 
Theoremaddneintrd 7617 Introducing a term on the left-hand side of a sum in a negated equality. Contrapositive of addcanad 7615. Consequence of addcand 7613. (Contributed by David Moews, 28-Feb-2017.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝐵 ∈ ℂ)    &   (𝜑𝐶 ∈ ℂ)    &   (𝜑𝐵𝐶)       (𝜑 → (𝐴 + 𝐵) ≠ (𝐴 + 𝐶))
 
Theoremaddneintr2d 7618 Introducing a term on the right-hand side of a sum in a negated equality. Contrapositive of addcan2ad 7616. Consequence of addcan2d 7614. (Contributed by David Moews, 28-Feb-2017.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝐵 ∈ ℂ)    &   (𝜑𝐶 ∈ ℂ)    &   (𝜑𝐴𝐵)       (𝜑 → (𝐴 + 𝐶) ≠ (𝐵 + 𝐶))
 
Theorem0cnALT 7619 Alternate proof of 0cn 7427. (Contributed by NM, 19-Feb-2005.) (Revised by Mario Carneiro, 27-May-2016.) (Proof modification is discouraged.) (New usage is discouraged.)
0 ∈ ℂ
 
Theoremnegeu 7620* Existential uniqueness of negatives. Theorem I.2 of [Apostol] p. 18. (Contributed by NM, 22-Nov-1994.) (Proof shortened by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐴 + 𝑥) = 𝐵)
 
Theoremsubval 7621* Value of subtraction, which is the (unique) element 𝑥 such that 𝐵 + 𝑥 = 𝐴. (Contributed by NM, 4-Aug-2007.) (Revised by Mario Carneiro, 2-Nov-2013.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴𝐵) = (𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴))
 
Theoremnegeq 7622 Equality theorem for negatives. (Contributed by NM, 10-Feb-1995.)
(𝐴 = 𝐵 → -𝐴 = -𝐵)
 
Theoremnegeqi 7623 Equality inference for negatives. (Contributed by NM, 14-Feb-1995.)
𝐴 = 𝐵       -𝐴 = -𝐵
 
Theoremnegeqd 7624 Equality deduction for negatives. (Contributed by NM, 14-May-1999.)
(𝜑𝐴 = 𝐵)       (𝜑 → -𝐴 = -𝐵)
 
Theoremnfnegd 7625 Deduction version of nfneg 7626. (Contributed by NM, 29-Feb-2008.) (Revised by Mario Carneiro, 15-Oct-2016.)
(𝜑𝑥𝐴)       (𝜑𝑥-𝐴)
 
Theoremnfneg 7626 Bound-variable hypothesis builder for the negative of a complex number. (Contributed by NM, 12-Jun-2005.) (Revised by Mario Carneiro, 15-Oct-2016.)
𝑥𝐴       𝑥-𝐴
 
Theoremcsbnegg 7627 Move class substitution in and out of the negative of a number. (Contributed by NM, 1-Mar-2008.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
(𝐴𝑉𝐴 / 𝑥-𝐵 = -𝐴 / 𝑥𝐵)
 
Theoremsubcl 7628 Closure law for subtraction. (Contributed by NM, 10-May-1999.) (Revised by Mario Carneiro, 21-Dec-2013.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴𝐵) ∈ ℂ)
 
Theoremnegcl 7629 Closure law for negative. (Contributed by NM, 6-Aug-2003.)
(𝐴 ∈ ℂ → -𝐴 ∈ ℂ)
 
Theoremnegicn 7630 -i is a complex number (common case). (Contributed by David A. Wheeler, 7-Dec-2018.)
-i ∈ ℂ
 
Theoremsubf 7631 Subtraction is an operation on the complex numbers. (Contributed by NM, 4-Aug-2007.) (Revised by Mario Carneiro, 16-Nov-2013.)
− :(ℂ × ℂ)⟶ℂ
 
Theoremsubadd 7632 Relationship between subtraction and addition. (Contributed by NM, 20-Jan-1997.) (Revised by Mario Carneiro, 21-Dec-2013.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐵) = 𝐶 ↔ (𝐵 + 𝐶) = 𝐴))
 
Theoremsubadd2 7633 Relationship between subtraction and addition. (Contributed by Scott Fenton, 5-Jul-2013.) (Proof shortened by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐵) = 𝐶 ↔ (𝐶 + 𝐵) = 𝐴))
 
Theoremsubsub23 7634 Swap subtrahend and result of subtraction. (Contributed by NM, 14-Dec-2007.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐵) = 𝐶 ↔ (𝐴𝐶) = 𝐵))
 
Theorempncan 7635 Cancellation law for subtraction. (Contributed by NM, 10-May-2004.) (Revised by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐵) = 𝐴)
 
Theorempncan2 7636 Cancellation law for subtraction. (Contributed by NM, 17-Apr-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐴) = 𝐵)
 
Theorempncan3 7637 Subtraction and addition of equals. (Contributed by NM, 14-Mar-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + (𝐵𝐴)) = 𝐵)
 
Theoremnpcan 7638 Cancellation law for subtraction. (Contributed by NM, 10-May-2004.) (Revised by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴𝐵) + 𝐵) = 𝐴)
 
Theoremaddsubass 7639 Associative-type law for addition and subtraction. (Contributed by NM, 6-Aug-2003.) (Revised by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = (𝐴 + (𝐵𝐶)))
 
Theoremaddsub 7640 Law for addition and subtraction. (Contributed by NM, 19-Aug-2001.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = ((𝐴𝐶) + 𝐵))
 
Theoremsubadd23 7641 Commutative/associative law for addition and subtraction. (Contributed by NM, 1-Feb-2007.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐵) + 𝐶) = (𝐴 + (𝐶𝐵)))
 
Theoremaddsub12 7642 Commutative/associative law for addition and subtraction. (Contributed by NM, 8-Feb-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 + (𝐵𝐶)) = (𝐵 + (𝐴𝐶)))
 
Theorem2addsub 7643 Law for subtraction and addition. (Contributed by NM, 20-Nov-2005.)
(((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → (((𝐴 + 𝐵) + 𝐶) − 𝐷) = (((𝐴 + 𝐶) − 𝐷) + 𝐵))
 
Theoremaddsubeq4 7644 Relation between sums and differences. (Contributed by Jeff Madsen, 17-Jun-2010.)
(((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐵) = (𝐶 + 𝐷) ↔ (𝐶𝐴) = (𝐵𝐷)))
 
Theorempncan3oi 7645 Subtraction and addition of equals. Almost but not exactly the same as pncan3i 7706 and pncan 7635, this order happens often when applying "operations to both sides" so create a theorem specifically for it. A deduction version of this is available as pncand 7741. (Contributed by David A. Wheeler, 11-Oct-2018.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ       ((𝐴 + 𝐵) − 𝐵) = 𝐴
 
Theoremmvrraddi 7646 Move RHS right addition to LHS. (Contributed by David A. Wheeler, 11-Oct-2018.)
𝐵 ∈ ℂ    &   𝐶 ∈ ℂ    &   𝐴 = (𝐵 + 𝐶)       (𝐴𝐶) = 𝐵
 
Theoremmvlladdi 7647 Move LHS left addition to RHS. (Contributed by David A. Wheeler, 11-Oct-2018.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   (𝐴 + 𝐵) = 𝐶       𝐵 = (𝐶𝐴)
 
Theoremsubid 7648 Subtraction of a number from itself. (Contributed by NM, 8-Oct-1999.) (Revised by Mario Carneiro, 27-May-2016.)
(𝐴 ∈ ℂ → (𝐴𝐴) = 0)
 
Theoremsubid1 7649 Identity law for subtraction. (Contributed by NM, 9-May-2004.) (Revised by Mario Carneiro, 27-May-2016.)
(𝐴 ∈ ℂ → (𝐴 − 0) = 𝐴)
 
Theoremnpncan 7650 Cancellation law for subtraction. (Contributed by NM, 8-Feb-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐵) + (𝐵𝐶)) = (𝐴𝐶))
 
Theoremnppcan 7651 Cancellation law for subtraction. (Contributed by NM, 1-Sep-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴𝐵) + 𝐶) + 𝐵) = (𝐴 + 𝐶))
 
Theoremnnpcan 7652 Cancellation law for subtraction: ((a-b)-c)+b = a-c holds for complex numbers a,b,c. (Contributed by Alexander van der Vekens, 24-Mar-2018.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴𝐵) − 𝐶) + 𝐵) = (𝐴𝐶))
 
Theoremnppcan3 7653 Cancellation law for subtraction. (Contributed by Mario Carneiro, 14-Sep-2015.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐵) + (𝐶 + 𝐵)) = (𝐴 + 𝐶))
 
Theoremsubcan2 7654 Cancellation law for subtraction. (Contributed by NM, 8-Feb-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐶) = (𝐵𝐶) ↔ 𝐴 = 𝐵))
 
Theoremsubeq0 7655 If the difference between two numbers is zero, they are equal. (Contributed by NM, 16-Nov-1999.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴𝐵) = 0 ↔ 𝐴 = 𝐵))
 
Theoremnpncan2 7656 Cancellation law for subtraction. (Contributed by Scott Fenton, 21-Jun-2013.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴𝐵) + (𝐵𝐴)) = 0)
 
Theoremsubsub2 7657 Law for double subtraction. (Contributed by NM, 30-Jun-2005.) (Revised by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − (𝐵𝐶)) = (𝐴 + (𝐶𝐵)))
 
Theoremnncan 7658 Cancellation law for subtraction. (Contributed by NM, 21-Jun-2005.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − (𝐴𝐵)) = 𝐵)
 
Theoremsubsub 7659 Law for double subtraction. (Contributed by NM, 13-May-2004.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − (𝐵𝐶)) = ((𝐴𝐵) + 𝐶))
 
Theoremnppcan2 7660 Cancellation law for subtraction. (Contributed by NM, 29-Sep-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − (𝐵 + 𝐶)) + 𝐶) = (𝐴𝐵))
 
Theoremsubsub3 7661 Law for double subtraction. (Contributed by NM, 27-Jul-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − (𝐵𝐶)) = ((𝐴 + 𝐶) − 𝐵))
 
Theoremsubsub4 7662 Law for double subtraction. (Contributed by NM, 19-Aug-2005.) (Revised by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐵) − 𝐶) = (𝐴 − (𝐵 + 𝐶)))
 
Theoremsub32 7663 Swap the second and third terms in a double subtraction. (Contributed by NM, 19-Aug-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐵) − 𝐶) = ((𝐴𝐶) − 𝐵))
 
Theoremnnncan 7664 Cancellation law for subtraction. (Contributed by NM, 4-Sep-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − (𝐵𝐶)) − 𝐶) = (𝐴𝐵))
 
Theoremnnncan1 7665 Cancellation law for subtraction. (Contributed by NM, 8-Feb-2005.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐵) − (𝐴𝐶)) = (𝐶𝐵))
 
Theoremnnncan2 7666 Cancellation law for subtraction. (Contributed by NM, 1-Oct-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐶) − (𝐵𝐶)) = (𝐴𝐵))
 
Theoremnpncan3 7667 Cancellation law for subtraction. (Contributed by Scott Fenton, 23-Jun-2013.) (Proof shortened by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐵) + (𝐶𝐴)) = (𝐶𝐵))
 
Theorempnpcan 7668 Cancellation law for mixed addition and subtraction. (Contributed by NM, 4-Mar-2005.) (Revised by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − (𝐴 + 𝐶)) = (𝐵𝐶))
 
Theorempnpcan2 7669 Cancellation law for mixed addition and subtraction. (Contributed by Scott Fenton, 9-Jun-2006.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐶) − (𝐵 + 𝐶)) = (𝐴𝐵))
 
Theorempnncan 7670 Cancellation law for mixed addition and subtraction. (Contributed by NM, 30-Jun-2005.) (Revised by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − (𝐴𝐶)) = (𝐵 + 𝐶))
 
Theoremppncan 7671 Cancellation law for mixed addition and subtraction. (Contributed by NM, 30-Jun-2005.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + (𝐶𝐵)) = (𝐴 + 𝐶))
 
Theoremaddsub4 7672 Rearrangement of 4 terms in a mixed addition and subtraction. (Contributed by NM, 4-Mar-2005.)
(((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐵) − (𝐶 + 𝐷)) = ((𝐴𝐶) + (𝐵𝐷)))
 
Theoremsubadd4 7673 Rearrangement of 4 terms in a mixed addition and subtraction. (Contributed by NM, 24-Aug-2006.)
(((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴𝐵) − (𝐶𝐷)) = ((𝐴 + 𝐷) − (𝐵 + 𝐶)))
 
Theoremsub4 7674 Rearrangement of 4 terms in a subtraction. (Contributed by NM, 23-Nov-2007.)
(((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴𝐵) − (𝐶𝐷)) = ((𝐴𝐶) − (𝐵𝐷)))
 
Theoremneg0 7675 Minus 0 equals 0. (Contributed by NM, 17-Jan-1997.)
-0 = 0
 
Theoremnegid 7676 Addition of a number and its negative. (Contributed by NM, 14-Mar-2005.)
(𝐴 ∈ ℂ → (𝐴 + -𝐴) = 0)
 
Theoremnegsub 7677 Relationship between subtraction and negative. Theorem I.3 of [Apostol] p. 18. (Contributed by NM, 21-Jan-1997.) (Proof shortened by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + -𝐵) = (𝐴𝐵))
 
Theoremsubneg 7678 Relationship between subtraction and negative. (Contributed by NM, 10-May-2004.) (Revised by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − -𝐵) = (𝐴 + 𝐵))
 
Theoremnegneg 7679 A number is equal to the negative of its negative. Theorem I.4 of [Apostol] p. 18. (Contributed by NM, 12-Jan-2002.) (Revised by Mario Carneiro, 27-May-2016.)
(𝐴 ∈ ℂ → --𝐴 = 𝐴)
 
Theoremneg11 7680 Negative is one-to-one. (Contributed by NM, 8-Feb-2005.) (Revised by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (-𝐴 = -𝐵𝐴 = 𝐵))
 
Theoremnegcon1 7681 Negative contraposition law. (Contributed by NM, 9-May-2004.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (-𝐴 = 𝐵 ↔ -𝐵 = 𝐴))
 
Theoremnegcon2 7682 Negative contraposition law. (Contributed by NM, 14-Nov-2004.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 = -𝐵𝐵 = -𝐴))
 
Theoremnegeq0 7683 A number is zero iff its negative is zero. (Contributed by NM, 12-Jul-2005.) (Revised by Mario Carneiro, 27-May-2016.)
(𝐴 ∈ ℂ → (𝐴 = 0 ↔ -𝐴 = 0))
 
Theoremsubcan 7684 Cancellation law for subtraction. (Contributed by NM, 8-Feb-2005.) (Revised by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐵) = (𝐴𝐶) ↔ 𝐵 = 𝐶))
 
Theoremnegsubdi 7685 Distribution of negative over subtraction. (Contributed by NM, 15-Nov-2004.) (Proof shortened by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → -(𝐴𝐵) = (-𝐴 + 𝐵))
 
Theoremnegdi 7686 Distribution of negative over addition. (Contributed by NM, 10-May-2004.) (Proof shortened by Mario Carneiro, 27-May-2016.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → -(𝐴 + 𝐵) = (-𝐴 + -𝐵))
 
Theoremnegdi2 7687 Distribution of negative over addition. (Contributed by NM, 1-Jan-2006.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → -(𝐴 + 𝐵) = (-𝐴𝐵))
 
Theoremnegsubdi2 7688 Distribution of negative over subtraction. (Contributed by NM, 4-Oct-1999.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → -(𝐴𝐵) = (𝐵𝐴))
 
Theoremneg2sub 7689 Relationship between subtraction and negative. (Contributed by Paul Chapman, 8-Oct-2007.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (-𝐴 − -𝐵) = (𝐵𝐴))
 
Theoremrenegcl 7690 Closure law for negative of reals. (Contributed by NM, 20-Jan-1997.)
(𝐴 ∈ ℝ → -𝐴 ∈ ℝ)
 
Theoremrenegcli 7691 Closure law for negative of reals. (Note: this inference proof style and the deduction theorem usage in renegcl 7690 is deprecated, but is retained for its demonstration value.) (Contributed by NM, 17-Jan-1997.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
𝐴 ∈ ℝ       -𝐴 ∈ ℝ
 
Theoremresubcli 7692 Closure law for subtraction of reals. (Contributed by NM, 17-Jan-1997.) (Revised by Mario Carneiro, 27-May-2016.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (𝐴𝐵) ∈ ℝ
 
Theoremresubcl 7693 Closure law for subtraction of reals. (Contributed by NM, 20-Jan-1997.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴𝐵) ∈ ℝ)
 
Theoremnegreb 7694 The negative of a real is real. (Contributed by NM, 11-Aug-1999.) (Revised by Mario Carneiro, 14-Jul-2014.)
(𝐴 ∈ ℂ → (-𝐴 ∈ ℝ ↔ 𝐴 ∈ ℝ))
 
Theorempeano2cnm 7695 "Reverse" second Peano postulate analog for complex numbers: A complex number minus 1 is a complex number. (Contributed by Alexander van der Vekens, 18-Mar-2018.)
(𝑁 ∈ ℂ → (𝑁 − 1) ∈ ℂ)
 
Theorempeano2rem 7696 "Reverse" second Peano postulate analog for reals. (Contributed by NM, 6-Feb-2007.)
(𝑁 ∈ ℝ → (𝑁 − 1) ∈ ℝ)
 
Theoremnegcli 7697 Closure law for negative. (Contributed by NM, 26-Nov-1994.)
𝐴 ∈ ℂ       -𝐴 ∈ ℂ
 
Theoremnegidi 7698 Addition of a number and its negative. (Contributed by NM, 26-Nov-1994.)
𝐴 ∈ ℂ       (𝐴 + -𝐴) = 0
 
Theoremnegnegi 7699 A number is equal to the negative of its negative. Theorem I.4 of [Apostol] p. 18. (Contributed by NM, 8-Feb-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
𝐴 ∈ ℂ       --𝐴 = 𝐴
 
Theoremsubidi 7700 Subtraction of a number from itself. (Contributed by NM, 26-Nov-1994.)
𝐴 ∈ ℂ       (𝐴𝐴) = 0
    < Previous  Next >

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-11413
  Copyright terms: Public domain < Previous  Next >