P. 82 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 8101-8200   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	nnncan2d 8101	Cancellation law for subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A - C ) - ( B - C ) ) = ( A - B ) )
Theorem	npncan3d 8102	Cancellation law for subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A - B ) + ( C - A ) ) = ( C - B ) )
Theorem	pnpcand 8103	Cancellation law for mixed addition and subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A + B ) - ( A + C ) ) = ( B - C ) )
Theorem	pnpcan2d 8104	Cancellation law for mixed addition and subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A + C ) - ( B + C ) ) = ( A - B ) )
Theorem	pnncand 8105	Cancellation law for mixed addition and subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A + B ) - ( A - C ) ) = ( B + C ) )
Theorem	ppncand 8106	Cancellation law for mixed addition and subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A + B ) + ( C - B ) ) = ( A + C ) )
Theorem	subcand 8107	Cancellation law for subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> ( A - B ) = ( A - C ) )   =>    |- ( ph -> B = C )
Theorem	subcan2d 8108	Cancellation law for subtraction. (Contributed by Mario Carneiro, 22-Sep-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> ( A - C ) = ( B - C ) )   =>    |- ( ph -> A = B )
Theorem	subcanad 8109	Cancellation law for subtraction. Deduction form of subcan 8010. Generalization of subcand 8107. (Contributed by David Moews, 28-Feb-2017.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A - B ) = ( A - C ) <-> B = C ) )
Theorem	subneintrd 8110	Introducing subtraction on both sides of a statement of inequality. Contrapositive of subcand 8107. (Contributed by David Moews, 28-Feb-2017.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> B =/= C )   =>    |- ( ph -> ( A - B ) =/= ( A - C ) )
Theorem	subcan2ad 8111	Cancellation law for subtraction. Deduction form of subcan2 7980. Generalization of subcan2d 8108. (Contributed by David Moews, 28-Feb-2017.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A - C ) = ( B - C ) <-> A = B ) )
Theorem	subneintr2d 8112	Introducing subtraction on both sides of a statement of inequality. Contrapositive of subcan2d 8108. (Contributed by David Moews, 28-Feb-2017.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> A =/= B )   =>    |- ( ph -> ( A - C ) =/= ( B - C ) )
Theorem	addsub4d 8113	Rearrangement of 4 terms in a mixed addition and subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> D e. CC )   =>    |- ( ph -> ( ( A + B ) - ( C + D ) ) = ( ( A - C ) + ( B - D ) ) )
Theorem	subadd4d 8114	Rearrangement of 4 terms in a mixed addition and subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> D e. CC )   =>    |- ( ph -> ( ( A - B ) - ( C - D ) ) = ( ( A + D ) - ( B + C ) ) )
Theorem	sub4d 8115	Rearrangement of 4 terms in a subtraction. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> D e. CC )   =>    |- ( ph -> ( ( A - B ) - ( C - D ) ) = ( ( A - C ) - ( B - D ) ) )
Theorem	2addsubd 8116	Law for subtraction and addition. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> D e. CC )   =>    |- ( ph -> ( ( ( A + B ) + C ) - D ) = ( ( ( A + C ) - D ) + B ) )
Theorem	addsubeq4d 8117	Relation between sums and differences. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> D e. CC )   =>    |- ( ph -> ( ( A + B ) = ( C + D ) <-> ( C - A ) = ( B - D ) ) )
Theorem	subeqxfrd 8118	Transfer two terms of a subtraction in an equality. (Contributed by Thierry Arnoux, 2-Feb-2020.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> D e. CC )   &    |- ( ph -> ( A - B ) = ( C - D ) )   =>    |- ( ph -> ( A - C ) = ( B - D ) )
Theorem	mvlraddd 8119	Move LHS right addition to RHS. (Contributed by David A. Wheeler, 15-Oct-2018.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> ( A + B ) = C )   =>    |- ( ph -> A = ( C - B ) )
Theorem	mvlladdd 8120	Move LHS left addition to RHS. (Contributed by David A. Wheeler, 15-Oct-2018.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> ( A + B ) = C )   =>    |- ( ph -> B = ( C - A ) )
Theorem	mvrraddd 8121	Move RHS right addition to LHS. (Contributed by David A. Wheeler, 15-Oct-2018.)
|- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> A = ( B + C ) )   =>    |- ( ph -> ( A - C ) = B )
Theorem	mvrladdd 8122	Move RHS left addition to LHS. (Contributed by David A. Wheeler, 11-Oct-2018.)
|- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> A = ( B + C ) )   =>    |- ( ph -> ( A - B ) = C )
Theorem	assraddsubd 8123	Associate RHS addition-subtraction. (Contributed by David A. Wheeler, 15-Oct-2018.)
|- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> D e. CC )   &    |- ( ph -> A = ( ( B + C ) - D ) )   =>    |- ( ph -> A = ( B + ( C - D ) ) )
Theorem	subaddeqd 8124	Transfer two terms of a subtraction to an addition in an equality. (Contributed by Thierry Arnoux, 2-Feb-2020.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> D e. CC )   &    |- ( ph -> ( A + B ) = ( C + D ) )   =>    |- ( ph -> ( A - D ) = ( C - B ) )
Theorem	addlsub 8125	Left-subtraction: Subtraction of the left summand from the result of an addition. (Contributed by BJ, 6-Jun-2019.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A + B ) = C <-> A = ( C - B ) ) )
Theorem	addrsub 8126	Right-subtraction: Subtraction of the right summand from the result of an addition. (Contributed by BJ, 6-Jun-2019.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A + B ) = C <-> B = ( C - A ) ) )
Theorem	subexsub 8127	A subtraction law: Exchanging the subtrahend and the result of the subtraction. (Contributed by BJ, 6-Jun-2019.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( A = ( C - B ) <-> B = ( C - A ) ) )
Theorem	addid0 8128	If adding a number to a another number yields the other number, the added number must be 0. This shows that 0 is the unique (right) identity of the complex numbers. (Contributed by AV, 17-Jan-2021.)
|- ( ( X e. CC /\ Y e. CC ) -> ( ( X + Y ) = X <-> Y = 0 ) )
Theorem	addn0nid 8129	Adding a nonzero number to a complex number does not yield the complex number. (Contributed by AV, 17-Jan-2021.)
|- ( ( X e. CC /\ Y e. CC /\ Y =/= 0 ) -> ( X + Y ) =/= X )
Theorem	pnpncand 8130	Addition/subtraction cancellation law. (Contributed by Scott Fenton, 14-Dec-2017.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A + ( B - C ) ) + ( C - B ) ) = A )
Theorem	subeqrev 8131	Reverse the order of subtraction in an equality. (Contributed by Scott Fenton, 8-Jul-2013.)
|- ( ( ( A e. CC /\ B e. CC ) /\ ( C e. CC /\ D e. CC ) ) -> ( ( A - B ) = ( C - D ) <-> ( B - A ) = ( D - C ) ) )
Theorem	pncan1 8132	Cancellation law for addition and subtraction with 1. (Contributed by Alexander van der Vekens, 3-Oct-2018.)
|- ( A e. CC -> ( ( A + 1 ) - 1 ) = A )
Theorem	npcan1 8133	Cancellation law for subtraction and addition with 1. (Contributed by Alexander van der Vekens, 5-Oct-2018.)
|- ( A e. CC -> ( ( A - 1 ) + 1 ) = A )
Theorem	subeq0bd 8134	If two complex numbers are equal, their difference is zero. Consequence of subeq0ad 8076. Converse of subeq0d 8074. Contrapositive of subne0ad 8077. (Contributed by David Moews, 28-Feb-2017.)
|- ( ph -> A e. CC )   &    |- ( ph -> A = B )   =>    |- ( ph -> ( A - B ) = 0 )
Theorem	renegcld 8135	Closure law for negative of reals. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. RR )   =>    |- ( ph -> -u A e. RR )
Theorem	resubcld 8136	Closure law for subtraction of reals. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   =>    |- ( ph -> ( A - B ) e. RR )
Theorem	negf1o 8137*	Negation is an isomorphism of a subset of the real numbers to the negated elements of the subset. (Contributed by AV, 9-Aug-2020.)
|- F = ( x e. A |-> -u x )   =>    |- ( A C_ RR -> F : A -1-1-onto-> { n e. RR | -u n e. A } )
4.3.3  Multiplication
Theorem	kcnktkm1cn 8138	k times k minus 1 is a complex number if k is a complex number. (Contributed by Alexander van der Vekens, 11-Mar-2018.)
|- ( K e. CC -> ( K x. ( K - 1 ) ) e. CC )
Theorem	muladd 8139	Product of two sums. (Contributed by NM, 14-Jan-2006.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
|- ( ( ( A e. CC /\ B e. CC ) /\ ( C e. CC /\ D e. CC ) ) -> ( ( A + B ) x. ( C + D ) ) = ( ( ( A x. C ) + ( D x. B ) ) + ( ( A x. D ) + ( C x. B ) ) ) )
Theorem	subdi 8140	Distribution of multiplication over subtraction. Theorem I.5 of [Apostol] p. 18. (Contributed by NM, 18-Nov-2004.)
|- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( A x. ( B - C ) ) = ( ( A x. B ) - ( A x. C ) ) )
Theorem	subdir 8141	Distribution of multiplication over subtraction. Theorem I.5 of [Apostol] p. 18. (Contributed by NM, 30-Dec-2005.)
|- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A - B ) x. C ) = ( ( A x. C ) - ( B x. C ) ) )
Theorem	mul02 8142	Multiplication by 0. Theorem I.6 of [Apostol] p. 18. (Contributed by NM, 10-Aug-1999.)
|- ( A e. CC -> ( 0 x. A ) = 0 )
Theorem	mul02lem2 8143	Zero times a real is zero. Although we prove it as a corollary of mul02 8142, the name is for consistency with the Metamath Proof Explorer which proves it before mul02 8142. (Contributed by Scott Fenton, 3-Jan-2013.)
|- ( A e. RR -> ( 0 x. A ) = 0 )
Theorem	mul01 8144	Multiplication by 0. Theorem I.6 of [Apostol] p. 18. (Contributed by NM, 15-May-1999.) (Revised by Scott Fenton, 3-Jan-2013.)
|- ( A e. CC -> ( A x. 0 ) = 0 )
Theorem	mul02i 8145	Multiplication by 0. Theorem I.6 of [Apostol] p. 18. (Contributed by NM, 23-Nov-1994.)
|- A e. CC   =>    |- ( 0 x. A ) = 0
Theorem	mul01i 8146	Multiplication by 0. Theorem I.6 of [Apostol] p. 18. (Contributed by NM, 23-Nov-1994.) (Revised by Scott Fenton, 3-Jan-2013.)
|- A e. CC   =>    |- ( A x. 0 ) = 0
Theorem	mul02d 8147	Multiplication by 0. Theorem I.6 of [Apostol] p. 18. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( 0 x. A ) = 0 )
Theorem	mul01d 8148	Multiplication by 0. Theorem I.6 of [Apostol] p. 18. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( A x. 0 ) = 0 )
Theorem	ine0 8149	The imaginary unit _i is not zero. (Contributed by NM, 6-May-1999.)
|- _i =/= 0
Theorem	mulneg1 8150	Product with negative is negative of product. Theorem I.12 of [Apostol] p. 18. (Contributed by NM, 14-May-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( ( A e. CC /\ B e. CC ) -> ( -u A x. B ) = -u ( A x. B ) )
Theorem	mulneg2 8151	The product with a negative is the negative of the product. (Contributed by NM, 30-Jul-2004.)
|- ( ( A e. CC /\ B e. CC ) -> ( A x. -u B ) = -u ( A x. B ) )
Theorem	mulneg12 8152	Swap the negative sign in a product. (Contributed by NM, 30-Jul-2004.)
|- ( ( A e. CC /\ B e. CC ) -> ( -u A x. B ) = ( A x. -u B ) )
Theorem	mul2neg 8153	Product of two negatives. Theorem I.12 of [Apostol] p. 18. (Contributed by NM, 30-Jul-2004.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
|- ( ( A e. CC /\ B e. CC ) -> ( -u A x. -u B ) = ( A x. B ) )
Theorem	submul2 8154	Convert a subtraction to addition using multiplication by a negative. (Contributed by NM, 2-Feb-2007.)
|- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( A - ( B x. C ) ) = ( A + ( B x. -u C ) ) )
Theorem	mulm1 8155	Product with minus one is negative. (Contributed by NM, 16-Nov-1999.)
|- ( A e. CC -> ( -u 1 x. A ) = -u A )
Theorem	mulsub 8156	Product of two differences. (Contributed by NM, 14-Jan-2006.)
|- ( ( ( A e. CC /\ B e. CC ) /\ ( C e. CC /\ D e. CC ) ) -> ( ( A - B ) x. ( C - D ) ) = ( ( ( A x. C ) + ( D x. B ) ) - ( ( A x. D ) + ( C x. B ) ) ) )
Theorem	mulsub2 8157	Swap the order of subtraction in a multiplication. (Contributed by Scott Fenton, 24-Jun-2013.)
|- ( ( ( A e. CC /\ B e. CC ) /\ ( C e. CC /\ D e. CC ) ) -> ( ( A - B ) x. ( C - D ) ) = ( ( B - A ) x. ( D - C ) ) )
Theorem	mulm1i 8158	Product with minus one is negative. (Contributed by NM, 31-Jul-1999.)
|- A e. CC   =>    |- ( -u 1 x. A ) = -u A
Theorem	mulneg1i 8159	Product with negative is negative of product. Theorem I.12 of [Apostol] p. 18. (Contributed by NM, 10-Feb-1995.) (Revised by Mario Carneiro, 27-May-2016.)
|- A e. CC   &    |- B e. CC   =>    |- ( -u A x. B ) = -u ( A x. B )
Theorem	mulneg2i 8160	Product with negative is negative of product. (Contributed by NM, 31-Jul-1999.) (Revised by Mario Carneiro, 27-May-2016.)
|- A e. CC   &    |- B e. CC   =>    |- ( A x. -u B ) = -u ( A x. B )
Theorem	mul2negi 8161	Product of two negatives. Theorem I.12 of [Apostol] p. 18. (Contributed by NM, 14-Feb-1995.) (Revised by Mario Carneiro, 27-May-2016.)
|- A e. CC   &    |- B e. CC   =>    |- ( -u A x. -u B ) = ( A x. B )
Theorem	subdii 8162	Distribution of multiplication over subtraction. Theorem I.5 of [Apostol] p. 18. (Contributed by NM, 26-Nov-1994.)
|- A e. CC   &    |- B e. CC   &    |- C e. CC   =>    |- ( A x. ( B - C ) ) = ( ( A x. B ) - ( A x. C ) )
Theorem	subdiri 8163	Distribution of multiplication over subtraction. Theorem I.5 of [Apostol] p. 18. (Contributed by NM, 8-May-1999.)
|- A e. CC   &    |- B e. CC   &    |- C e. CC   =>    |- ( ( A - B ) x. C ) = ( ( A x. C ) - ( B x. C ) )
Theorem	muladdi 8164	Product of two sums. (Contributed by NM, 17-May-1999.)
|- A e. CC   &    |- B e. CC   &    |- C e. CC   &    |- D e. CC   =>    |- ( ( A + B ) x. ( C + D ) ) = ( ( ( A x. C ) + ( D x. B ) ) + ( ( A x. D ) + ( C x. B ) ) )
Theorem	mulm1d 8165	Product with minus one is negative. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( -u 1 x. A ) = -u A )
Theorem	mulneg1d 8166	Product with negative is negative of product. Theorem I.12 of [Apostol] p. 18. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( -u A x. B ) = -u ( A x. B ) )
Theorem	mulneg2d 8167	Product with negative is negative of product. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( A x. -u B ) = -u ( A x. B ) )
Theorem	mul2negd 8168	Product of two negatives. Theorem I.12 of [Apostol] p. 18. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( -u A x. -u B ) = ( A x. B ) )
Theorem	subdid 8169	Distribution of multiplication over subtraction. Theorem I.5 of [Apostol] p. 18. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( A x. ( B - C ) ) = ( ( A x. B ) - ( A x. C ) ) )
Theorem	subdird 8170	Distribution of multiplication over subtraction. Theorem I.5 of [Apostol] p. 18. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( ( A - B ) x. C ) = ( ( A x. C ) - ( B x. C ) ) )
Theorem	muladdd 8171	Product of two sums. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> D e. CC )   =>    |- ( ph -> ( ( A + B ) x. ( C + D ) ) = ( ( ( A x. C ) + ( D x. B ) ) + ( ( A x. D ) + ( C x. B ) ) ) )
Theorem	mulsubd 8172	Product of two differences. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> D e. CC )   =>    |- ( ph -> ( ( A - B ) x. ( C - D ) ) = ( ( ( A x. C ) + ( D x. B ) ) - ( ( A x. D ) + ( C x. B ) ) ) )
Theorem	mulsubfacd 8173	Multiplication followed by the subtraction of a factor. (Contributed by Alexander van der Vekens, 28-Aug-2018.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( ( A x. B ) - B ) = ( ( A - 1 ) x. B ) )
4.3.4  Ordering on reals (cont.)
Theorem	ltadd2 8174	Addition to both sides of 'less than'. (Contributed by NM, 12-Nov-1999.) (Revised by Mario Carneiro, 27-May-2016.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A < B <-> ( C + A ) < ( C + B ) ) )
Theorem	ltadd2i 8175	Addition to both sides of 'less than'. (Contributed by NM, 21-Jan-1997.)
|- A e. RR   &    |- B e. RR   &    |- C e. RR   =>    |- ( A < B <-> ( C + A ) < ( C + B ) )
Theorem	ltadd2d 8176	Addition to both sides of 'less than'. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   =>    |- ( ph -> ( A < B <-> ( C + A ) < ( C + B ) ) )
Theorem	ltadd2dd 8177	Addition to both sides of 'less than'. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   &    |- ( ph -> A < B )   =>    |- ( ph -> ( C + A ) < ( C + B ) )
Theorem	ltletrd 8178	Transitive law deduction for 'less than', 'less than or equal to'. (Contributed by NM, 9-Jan-2006.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   &    |- ( ph -> A < B )   &    |- ( ph -> B <_ C )   =>    |- ( ph -> A < C )
Theorem	ltaddneg 8179	Adding a negative number to another number decreases it. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
|- ( ( A e. RR /\ B e. RR ) -> ( A < 0 <-> ( B + A ) < B ) )
Theorem	ltaddnegr 8180	Adding a negative number to another number decreases it. (Contributed by AV, 19-Mar-2021.)
|- ( ( A e. RR /\ B e. RR ) -> ( A < 0 <-> ( A + B ) < B ) )
Theorem	lelttrdi 8181	If a number is less than another number, and the other number is less than or equal to a third number, the first number is less than the third number. (Contributed by Alexander van der Vekens, 24-Mar-2018.)
|- ( ph -> ( A e. RR /\ B e. RR /\ C e. RR ) )   &    |- ( ph -> B <_ C )   =>    |- ( ph -> ( A < B -> A < C ) )
Theorem	gt0ne0 8182	Positive implies nonzero. (Contributed by NM, 3-Oct-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( ( A e. RR /\ 0 < A ) -> A =/= 0 )
Theorem	lt0ne0 8183	A number which is less than zero is not zero. See also lt0ap0 8403 which is similar but for apartness. (Contributed by Stefan O'Rear, 13-Sep-2014.)
|- ( ( A e. RR /\ A < 0 ) -> A =/= 0 )
Theorem	ltadd1 8184	Addition to both sides of 'less than'. Part of definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 12-Nov-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A < B <-> ( A + C ) < ( B + C ) ) )
Theorem	leadd1 8185	Addition to both sides of 'less than or equal to'. Part of definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 18-Oct-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A <_ B <-> ( A + C ) <_ ( B + C ) ) )
Theorem	leadd2 8186	Addition to both sides of 'less than or equal to'. (Contributed by NM, 26-Oct-1999.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A <_ B <-> ( C + A ) <_ ( C + B ) ) )
Theorem	ltsubadd 8187	'Less than' relationship between subtraction and addition. (Contributed by NM, 21-Jan-1997.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A - B ) < C <-> A < ( C + B ) ) )
Theorem	ltsubadd2 8188	'Less than' relationship between subtraction and addition. (Contributed by NM, 21-Jan-1997.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A - B ) < C <-> A < ( B + C ) ) )
Theorem	lesubadd 8189	'Less than or equal to' relationship between subtraction and addition. (Contributed by NM, 17-Nov-2004.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A - B ) <_ C <-> A <_ ( C + B ) ) )
Theorem	lesubadd2 8190	'Less than or equal to' relationship between subtraction and addition. (Contributed by NM, 10-Aug-1999.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A - B ) <_ C <-> A <_ ( B + C ) ) )
Theorem	ltaddsub 8191	'Less than' relationship between addition and subtraction. (Contributed by NM, 17-Nov-2004.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A + B ) < C <-> A < ( C - B ) ) )
Theorem	ltaddsub2 8192	'Less than' relationship between addition and subtraction. (Contributed by NM, 17-Nov-2004.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A + B ) < C <-> B < ( C - A ) ) )
Theorem	leaddsub 8193	'Less than or equal to' relationship between addition and subtraction. (Contributed by NM, 6-Apr-2005.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A + B ) <_ C <-> A <_ ( C - B ) ) )
Theorem	leaddsub2 8194	'Less than or equal to' relationship between and addition and subtraction. (Contributed by NM, 6-Apr-2005.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A + B ) <_ C <-> B <_ ( C - A ) ) )
Theorem	suble 8195	Swap subtrahends in an inequality. (Contributed by NM, 29-Sep-2005.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A - B ) <_ C <-> ( A - C ) <_ B ) )
Theorem	lesub 8196	Swap subtrahends in an inequality. (Contributed by NM, 29-Sep-2005.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A <_ ( B - C ) <-> C <_ ( B - A ) ) )
Theorem	ltsub23 8197	'Less than' relationship between subtraction and addition. (Contributed by NM, 4-Oct-1999.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A - B ) < C <-> ( A - C ) < B ) )
Theorem	ltsub13 8198	'Less than' relationship between subtraction and addition. (Contributed by NM, 17-Nov-2004.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A < ( B - C ) <-> C < ( B - A ) ) )
Theorem	le2add 8199	Adding both sides of two 'less than or equal to' relations. (Contributed by NM, 17-Apr-2005.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ D e. RR ) ) -> ( ( A <_ C /\ B <_ D ) -> ( A + B ) <_ ( C + D ) ) )
Theorem	lt2add 8200	Adding both sides of two 'less than' relations. Theorem I.25 of [Apostol] p. 20. (Contributed by NM, 15-Aug-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ D e. RR ) ) -> ( ( A < C /\ B < D ) -> ( A + B ) < ( C + D ) ) )