HomeHome Intuitionistic Logic Explorer
Theorem List (p. 76 of 114)
< Previous  Next >
Browser slow? Try the
Unicode version.

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

Theorem List for Intuitionistic Logic Explorer - 7501-7600   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremgtso 7501 'Greater than' is a strict ordering. (Contributed by JJ, 11-Oct-2018.)
 |-  `'  <  Or  RR
 
Theoremlttri3 7502 Tightness of real apartness. (Contributed by NM, 5-May-1999.)
 |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  =  B 
 <->  ( -.  A  <  B 
 /\  -.  B  <  A ) ) )
 
Theoremletri3 7503 Tightness of real apartness. (Contributed by NM, 14-May-1999.)
 |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  =  B 
 <->  ( A  <_  B  /\  B  <_  A )
 ) )
 
Theoremltleletr 7504 Transitive law, weaker form of  ( A  <  B  /\  B  <_  C )  ->  A  <  C. (Contributed by AV, 14-Oct-2018.)
 |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( ( A  <  B 
 /\  B  <_  C )  ->  A  <_  C ) )
 
Theoremletr 7505 Transitive law. (Contributed by NM, 12-Nov-1999.)
 |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( ( A  <_  B 
 /\  B  <_  C )  ->  A  <_  C ) )
 
Theoremleid 7506 'Less than or equal to' is reflexive. (Contributed by NM, 18-Aug-1999.)
 |-  ( A  e.  RR  ->  A  <_  A )
 
Theoremltne 7507 'Less than' implies not equal. See also ltap 8042 which is the same but for apartness. (Contributed by NM, 9-Oct-1999.) (Revised by Mario Carneiro, 16-Sep-2015.)
 |-  ( ( A  e.  RR  /\  A  <  B )  ->  B  =/=  A )
 
Theoremltnsym 7508 'Less than' is not symmetric. (Contributed by NM, 8-Jan-2002.)
 |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  <  B 
 ->  -.  B  <  A ) )
 
Theoremltle 7509 'Less than' implies 'less than or equal to'. (Contributed by NM, 25-Aug-1999.)
 |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  <  B 
 ->  A  <_  B )
 )
 
Theoremlelttr 7510 Transitive law. Part of Definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 23-May-1999.)
 |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( ( A  <_  B 
 /\  B  <  C )  ->  A  <  C ) )
 
Theoremltletr 7511 Transitive law. Part of Definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 25-Aug-1999.)
 |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( ( A  <  B 
 /\  B  <_  C )  ->  A  <  C ) )
 
Theoremltnsym2 7512 'Less than' is antisymmetric and irreflexive. (Contributed by NM, 13-Aug-2005.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
 |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  -.  ( A  <  B  /\  B  <  A ) )
 
Theoremeqle 7513 Equality implies 'less than or equal to'. (Contributed by NM, 4-Apr-2005.)
 |-  ( ( A  e.  RR  /\  A  =  B )  ->  A  <_  B )
 
Theoremltnri 7514 'Less than' is irreflexive. (Contributed by NM, 18-Aug-1999.)
 |-  A  e.  RR   =>    |-  -.  A  <  A
 
Theoremeqlei 7515 Equality implies 'less than or equal to'. (Contributed by NM, 23-May-1999.) (Revised by Alexander van der Vekens, 20-Mar-2018.)
 |-  A  e.  RR   =>    |-  ( A  =  B  ->  A  <_  B )
 
Theoremeqlei2 7516 Equality implies 'less than or equal to'. (Contributed by Alexander van der Vekens, 20-Mar-2018.)
 |-  A  e.  RR   =>    |-  ( B  =  A  ->  B  <_  A )
 
Theoremgtneii 7517 'Less than' implies not equal. See also gtapii 8043 which is the same for apartness. (Contributed by Mario Carneiro, 30-Sep-2013.)
 |-  A  e.  RR   &    |-  A  <  B   =>    |-  B  =/=  A
 
Theoremltneii 7518 'Greater than' implies not equal. (Contributed by Mario Carneiro, 16-Sep-2015.)
 |-  A  e.  RR   &    |-  A  <  B   =>    |-  A  =/=  B
 
Theoremlttri3i 7519 Tightness of real apartness. (Contributed by NM, 14-May-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   =>    |-  ( A  =  B  <->  ( -.  A  <  B  /\  -.  B  <  A ) )
 
Theoremletri3i 7520 Tightness of real apartness. (Contributed by NM, 14-May-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   =>    |-  ( A  =  B  <->  ( A  <_  B  /\  B  <_  A ) )
 
Theoremltnsymi 7521 'Less than' is not symmetric. (Contributed by NM, 6-May-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   =>    |-  ( A  <  B  ->  -.  B  <  A )
 
Theoremlenlti 7522 'Less than or equal to' in terms of 'less than'. (Contributed by NM, 24-May-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   =>    |-  ( A  <_  B  <->  -.  B  <  A )
 
Theoremltlei 7523 'Less than' implies 'less than or equal to'. (Contributed by NM, 14-May-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   =>    |-  ( A  <  B  ->  A  <_  B )
 
Theoremltleii 7524 'Less than' implies 'less than or equal to' (inference). (Contributed by NM, 22-Aug-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   &    |-  A  <  B   =>    |-  A  <_  B
 
Theoremltnei 7525 'Less than' implies not equal. (Contributed by NM, 28-Jul-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   =>    |-  ( A  <  B  ->  B  =/=  A )
 
Theoremlttri 7526 'Less than' is transitive. Theorem I.17 of [Apostol] p. 20. (Contributed by NM, 14-May-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   &    |-  C  e.  RR   =>    |-  (
 ( A  <  B  /\  B  <  C ) 
 ->  A  <  C )
 
Theoremlelttri 7527 'Less than or equal to', 'less than' transitive law. (Contributed by NM, 14-May-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   &    |-  C  e.  RR   =>    |-  (
 ( A  <_  B  /\  B  <  C ) 
 ->  A  <  C )
 
Theoremltletri 7528 'Less than', 'less than or equal to' transitive law. (Contributed by NM, 14-May-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   &    |-  C  e.  RR   =>    |-  (
 ( A  <  B  /\  B  <_  C )  ->  A  <  C )
 
Theoremletri 7529 'Less than or equal to' is transitive. (Contributed by NM, 14-May-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   &    |-  C  e.  RR   =>    |-  (
 ( A  <_  B  /\  B  <_  C )  ->  A  <_  C )
 
Theoremle2tri3i 7530 Extended trichotomy law for 'less than or equal to'. (Contributed by NM, 14-Aug-2000.)
 |-  A  e.  RR   &    |-  B  e.  RR   &    |-  C  e.  RR   =>    |-  (
 ( A  <_  B  /\  B  <_  C  /\  C  <_  A )  <->  ( A  =  B  /\  B  =  C  /\  C  =  A ) )
 
Theoremmulgt0i 7531 The product of two positive numbers is positive. (Contributed by NM, 16-May-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   =>    |-  ( ( 0  <  A  /\  0  <  B )  ->  0  <  ( A  x.  B ) )
 
Theoremmulgt0ii 7532 The product of two positive numbers is positive. (Contributed by NM, 18-May-1999.)
 |-  A  e.  RR   &    |-  B  e.  RR   &    |-  0  <  A   &    |-  0  <  B   =>    |-  0  <  ( A  x.  B )
 
Theoremltnrd 7533 'Less than' is irreflexive. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  RR )   =>    |-  ( ph  ->  -.  A  <  A )
 
Theoremgtned 7534 'Less than' implies not equal. See also gtapd 8046 which is the same but for apartness. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  A  <  B )   =>    |-  ( ph  ->  B  =/=  A )
 
Theoremltned 7535 'Greater than' implies not equal. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  A  <  B )   =>    |-  ( ph  ->  A  =/=  B )
 
Theoremlttri3d 7536 Tightness of real apartness. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  B  e.  RR )   =>    |-  ( ph  ->  ( A  =  B  <->  ( -.  A  <  B  /\  -.  B  <  A ) ) )
 
Theoremletri3d 7537 Tightness of real apartness. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  B  e.  RR )   =>    |-  ( ph  ->  ( A  =  B  <->  ( A  <_  B 
 /\  B  <_  A ) ) )
 
Theoremlenltd 7538 'Less than or equal to' in terms of 'less than'. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  B  e.  RR )   =>    |-  ( ph  ->  ( A  <_  B  <->  -.  B  <  A ) )
 
Theoremltled 7539 'Less than' implies 'less than or equal to'. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  B  e.  RR )   &    |-  ( ph  ->  A  <  B )   =>    |-  ( ph  ->  A  <_  B )
 
Theoremltnsymd 7540 'Less than' implies 'less than or equal to'. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  B  e.  RR )   &    |-  ( ph  ->  A  <  B )   =>    |-  ( ph  ->  -.  B  <  A )
 
Theoremnltled 7541 'Not less than ' implies 'less than or equal to'. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  B  e.  RR )   &    |-  ( ph  ->  -.  B  <  A )   =>    |-  ( ph  ->  A  <_  B )
 
Theoremlensymd 7542 'Less than or equal to' implies 'not less than'. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  B  e.  RR )   &    |-  ( ph  ->  A  <_  B )   =>    |-  ( ph  ->  -.  B  <  A )
 
Theoremmulgt0d 7543 The product of two positive numbers is positive. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  B  e.  RR )   &    |-  ( ph  ->  0  <  A )   &    |-  ( ph  ->  0  <  B )   =>    |-  ( ph  ->  0  <  ( A  x.  B ) )
 
Theoremletrd 7544 Transitive law deduction for 'less than or equal to'. (Contributed by NM, 20-May-2005.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  B  e.  RR )   &    |-  ( ph  ->  C  e.  RR )   &    |-  ( ph  ->  A  <_  B )   &    |-  ( ph  ->  B 
 <_  C )   =>    |-  ( ph  ->  A  <_  C )
 
Theoremlelttrd 7545 Transitive law deduction for 'less than or equal to', 'less than'. (Contributed by NM, 8-Jan-2006.)
 |-  ( ph  ->  A  e.  RR )   &    |-  ( ph  ->  B  e.  RR )   &    |-  ( ph  ->  C  e.  RR )   &    |-  ( ph  ->  A  <_  B )   &    |-  ( ph  ->  B  <  C )   =>    |-  ( ph  ->  A  <  C )
 
Theoremlttrd 7546 Transitive law deduction for 'less than'. (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 )
 
Theorem0lt1 7547 0 is less than 1. Theorem I.21 of [Apostol] p. 20. Part of definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 17-Jan-1997.)
 |-  0  <  1
 
3.2.5  Initial properties of the complex numbers
 
Theoremmul12 7548 Commutative/associative law for multiplication. (Contributed by NM, 30-Apr-2005.)
 |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  x.  ( B  x.  C ) )  =  ( B  x.  ( A  x.  C ) ) )
 
Theoremmul32 7549 Commutative/associative law. (Contributed by NM, 8-Oct-1999.)
 |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( ( A  x.  B )  x.  C )  =  ( ( A  x.  C )  x.  B ) )
 
Theoremmul31 7550 Commutative/associative law. (Contributed by Scott Fenton, 3-Jan-2013.)
 |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( ( A  x.  B )  x.  C )  =  ( ( C  x.  B )  x.  A ) )
 
Theoremmul4 7551 Rearrangement of 4 factors. (Contributed by NM, 8-Oct-1999.)
 |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  ->  ( ( A  x.  B )  x.  ( C  x.  D ) )  =  ( ( A  x.  C )  x.  ( B  x.  D ) ) )
 
Theoremmuladd11 7552 A simple product of sums expansion. (Contributed by NM, 21-Feb-2005.)
 |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( 1  +  A )  x.  ( 1  +  B ) )  =  (
 ( 1  +  A )  +  ( B  +  ( A  x.  B ) ) ) )
 
Theorem1p1times 7553 Two times a number. (Contributed by NM, 18-May-1999.) (Revised by Mario Carneiro, 27-May-2016.)
 |-  ( A  e.  CC  ->  ( ( 1  +  1 )  x.  A )  =  ( A  +  A ) )
 
Theorempeano2cn 7554 A theorem for complex numbers analogous the second Peano postulate peano2 4382. (Contributed by NM, 17-Aug-2005.)
 |-  ( A  e.  CC  ->  ( A  +  1 )  e.  CC )
 
Theorempeano2re 7555 A theorem for reals analogous the second Peano postulate peano2 4382. (Contributed by NM, 5-Jul-2005.)
 |-  ( A  e.  RR  ->  ( A  +  1 )  e.  RR )
 
Theoremaddcom 7556 Addition commutes. (Contributed by Jim Kingdon, 17-Jan-2020.)
 |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  +  B )  =  ( B  +  A )
 )
 
Theoremaddid1 7557  0 is an additive identity. (Contributed by Jim Kingdon, 16-Jan-2020.)
 |-  ( A  e.  CC  ->  ( A  +  0 )  =  A )
 
Theoremaddid2 7558  0 is a left identity for addition. (Contributed by Scott Fenton, 3-Jan-2013.)
 |-  ( A  e.  CC  ->  ( 0  +  A )  =  A )
 
Theoremreaddcan 7559 Cancellation law for addition over the reals. (Contributed by Scott Fenton, 3-Jan-2013.)
 |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( ( C  +  A )  =  ( C  +  B )  <->  A  =  B ) )
 
Theorem00id 7560  0 is its own additive identity. (Contributed by Scott Fenton, 3-Jan-2013.)
 |-  ( 0  +  0 )  =  0
 
Theoremaddid1i 7561  0 is an additive identity. (Contributed by NM, 23-Nov-1994.) (Revised by Scott Fenton, 3-Jan-2013.)
 |-  A  e.  CC   =>    |-  ( A  +  0 )  =  A
 
Theoremaddid2i 7562  0 is a left identity for addition. (Contributed by NM, 3-Jan-2013.)
 |-  A  e.  CC   =>    |-  ( 0  +  A )  =  A
 
Theoremaddcomi 7563 Addition commutes. Based on ideas by Eric Schmidt. (Contributed by Scott Fenton, 3-Jan-2013.)
 |-  A  e.  CC   &    |-  B  e.  CC   =>    |-  ( A  +  B )  =  ( B  +  A )
 
Theoremaddcomli 7564 Addition commutes. (Contributed by Mario Carneiro, 19-Apr-2015.)
 |-  A  e.  CC   &    |-  B  e.  CC   &    |-  ( A  +  B )  =  C   =>    |-  ( B  +  A )  =  C
 
Theoremmul12i 7565 Commutative/associative law that swaps the first two factors in a triple product. (Contributed by NM, 11-May-1999.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
 |-  A  e.  CC   &    |-  B  e.  CC   &    |-  C  e.  CC   =>    |-  ( A  x.  ( B  x.  C ) )  =  ( B  x.  ( A  x.  C ) )
 
Theoremmul32i 7566 Commutative/associative law that swaps the last two factors in a triple product. (Contributed by NM, 11-May-1999.)
 |-  A  e.  CC   &    |-  B  e.  CC   &    |-  C  e.  CC   =>    |-  (
 ( A  x.  B )  x.  C )  =  ( ( A  x.  C )  x.  B )
 
Theoremmul4i 7567 Rearrangement of 4 factors. (Contributed by NM, 16-Feb-1995.)
 |-  A  e.  CC   &    |-  B  e.  CC   &    |-  C  e.  CC   &    |-  D  e.  CC   =>    |-  ( ( A  x.  B )  x.  ( C  x.  D ) )  =  ( ( A  x.  C )  x.  ( B  x.  D ) )
 
Theoremaddid1d 7568  0 is an additive identity. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  CC )   =>    |-  ( ph  ->  ( A  +  0 )  =  A )
 
Theoremaddid2d 7569  0 is a left identity for addition. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  CC )   =>    |-  ( ph  ->  (
 0  +  A )  =  A )
 
Theoremaddcomd 7570 Addition commutes. Based on ideas by Eric Schmidt. (Contributed by Scott Fenton, 3-Jan-2013.) (Revised by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  CC )   &    |-  ( ph  ->  B  e.  CC )   =>    |-  ( ph  ->  ( A  +  B )  =  ( B  +  A ) )
 
Theoremmul12d 7571 Commutative/associative law that swaps the first two factors in a triple product. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  CC )   &    |-  ( ph  ->  B  e.  CC )   &    |-  ( ph  ->  C  e.  CC )   =>    |-  ( ph  ->  ( A  x.  ( B  x.  C ) )  =  ( B  x.  ( A  x.  C ) ) )
 
Theoremmul32d 7572 Commutative/associative law that swaps the last two factors in a triple product. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  CC )   &    |-  ( ph  ->  B  e.  CC )   &    |-  ( ph  ->  C  e.  CC )   =>    |-  ( ph  ->  (
 ( A  x.  B )  x.  C )  =  ( ( A  x.  C )  x.  B ) )
 
Theoremmul31d 7573 Commutative/associative law. (Contributed by Mario Carneiro, 27-May-2016.)
 |-  ( ph  ->  A  e.  CC )   &    |-  ( ph  ->  B  e.  CC )   &    |-  ( ph  ->  C  e.  CC )   =>    |-  ( ph  ->  (
 ( A  x.  B )  x.  C )  =  ( ( C  x.  B )  x.  A ) )
 
Theoremmul4d 7574 Rearrangement of 4 factors. (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  x.  B )  x.  ( C  x.  D ) )  =  ( ( A  x.  C )  x.  ( B  x.  D ) ) )
 
Theoremmuladd11r 7575 A simple product of sums expansion. (Contributed by AV, 30-Jul-2021.)
 |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  +  1 )  x.  ( B  +  1 ) )  =  ( ( ( A  x.  B )  +  ( A  +  B )
 )  +  1 ) )
 
Theoremcomraddd 7576 Commute RHS addition, in deduction form. (Contributed by David A. Wheeler, 11-Oct-2018.)
 |-  ( ph  ->  B  e.  CC )   &    |-  ( ph  ->  C  e.  CC )   &    |-  ( ph  ->  A  =  ( B  +  C ) )   =>    |-  ( ph  ->  A  =  ( C  +  B ) )
 
3.3  Real and complex numbers - basic operations
 
3.3.1  Addition
 
Theoremadd12 7577 Commutative/associative law that swaps the first two terms in a triple sum. (Contributed by NM, 11-May-2004.)
 |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  +  ( B  +  C )
 )  =  ( B  +  ( A  +  C ) ) )
 
Theoremadd32 7578 Commutative/associative law that swaps the last two terms in a triple sum. (Contributed by NM, 13-Nov-1999.)
 |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( ( A  +  B )  +  C )  =  ( ( A  +  C )  +  B ) )
 
Theoremadd32r 7579 Commutative/associative law that swaps the last two terms in a triple sum, rearranging the parentheses. (Contributed by Paul Chapman, 18-May-2007.)
 |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  +  ( B  +  C )
 )  =  ( ( A  +  C )  +  B ) )
 
Theoremadd4 7580 Rearrangement of 4 terms in a sum. (Contributed by NM, 13-Nov-1999.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
 |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  ->  ( ( A  +  B )  +  ( C  +  D )
 )  =  ( ( A  +  C )  +  ( B  +  D ) ) )
 
Theoremadd42 7581 Rearrangement of 4 terms in a sum. (Contributed by NM, 12-May-2005.)
 |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  ->  ( ( A  +  B )  +  ( C  +  D )
 )  =  ( ( A  +  C )  +  ( D  +  B ) ) )
 
Theoremadd12i 7582 Commutative/associative law that swaps the first two terms in a triple sum. (Contributed by NM, 21-Jan-1997.)
 |-  A  e.  CC   &    |-  B  e.  CC   &    |-  C  e.  CC   =>    |-  ( A  +  ( B  +  C ) )  =  ( B  +  ( A  +  C )
 )
 
Theoremadd32i 7583 Commutative/associative law that swaps the last two terms in a triple sum. (Contributed by NM, 21-Jan-1997.)
 |-  A  e.  CC   &    |-  B  e.  CC   &    |-  C  e.  CC   =>    |-  (
 ( A  +  B )  +  C )  =  ( ( A  +  C )  +  B )
 
Theoremadd4i 7584 Rearrangement of 4 terms in a sum. (Contributed by NM, 9-May-1999.)
 |-  A  e.  CC   &    |-  B  e.  CC   &    |-  C  e.  CC   &    |-  D  e.  CC   =>    |-  ( ( A  +  B )  +  ( C  +  D )
 )  =  ( ( A  +  C )  +  ( B  +  D ) )
 
Theoremadd42i 7585 Rearrangement of 4 terms in a sum. (Contributed by NM, 22-Aug-1999.)
 |-  A  e.  CC   &    |-  B  e.  CC   &    |-  C  e.  CC   &    |-  D  e.  CC   =>    |-  ( ( A  +  B )  +  ( C  +  D )
 )  =  ( ( A  +  C )  +  ( D  +  B ) )
 
Theoremadd12d 7586 Commutative/associative law that swaps the first two terms in a triple sum. (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 )
 ) )
 
Theoremadd32d 7587 Commutative/associative law that swaps the last two terms in a triple sum. (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 ) )
 
Theoremadd4d 7588 Rearrangement of 4 terms in a sum. (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 )
 ) )
 
Theoremadd42d 7589 Rearrangement of 4 terms in a sum. (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 )
 ) )
 
3.3.2  Subtraction
 
Syntaxcmin 7590 Extend class notation to include subtraction.
 class  -
 
Syntaxcneg 7591 Extend class notation to include unary minus. The symbol  -u 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 ( -u) and subtraction cmin 7590 ( -) to prevent syntax ambiguity. For example, looking at the syntax definition co 5607, if we used the same symbol then " (  -  A  -  B ) " could mean either " -  A " minus " B", or it could represent the (meaningless) operation of classes " - " and " -  B " connected with "operation" " A". On the other hand, " ( -u A  -  B ) " is unambiguous.
 class  -u A
 
Definitiondf-sub 7592* Define subtraction. Theorem subval 7611 shows its value (and describes how this definition works), theorem subaddi 7706 relates it to addition, and theorems subcli 7695 and resubcli 7682 prove its closure laws. (Contributed by NM, 26-Nov-1994.)
 |- 
 -  =  ( x  e.  CC ,  y  e.  CC  |->  ( iota_ z  e. 
 CC  ( y  +  z )  =  x ) )
 
Definitiondf-neg 7593 Define the negative of a number (unary minus). We use different symbols for unary minus ( -u) and subtraction ( -) to prevent syntax ambiguity. See cneg 7591 for a discussion of this. (Contributed by NM, 10-Feb-1995.)
 |-  -u A  =  (
 0  -  A )
 
Theoremcnegexlem1 7594 Addition cancellation of a real number from two complex numbers. Lemma for cnegex 7597. (Contributed by Eric Schmidt, 22-May-2007.)
 |-  ( ( A  e.  RR  /\  B  e.  CC  /\  C  e.  CC )  ->  ( ( A  +  B )  =  ( A  +  C )  <->  B  =  C ) )
 
Theoremcnegexlem2 7595 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 7597. (Contributed by Eric Schmidt, 22-May-2007.)
 |- 
 E. y  e.  RR  ( _i  x.  y
 )  e.  RR
 
Theoremcnegexlem3 7596* Existence of real number difference. Lemma for cnegex 7597. (Contributed by Eric Schmidt, 22-May-2007.)
 |-  ( ( b  e. 
 RR  /\  y  e.  RR )  ->  E. c  e.  RR  ( b  +  c )  =  y
 )
 
Theoremcnegex 7597* Existence of the negative of a complex number. (Contributed by Eric Schmidt, 21-May-2007.)
 |-  ( A  e.  CC  ->  E. x  e.  CC  ( A  +  x )  =  0 )
 
Theoremcnegex2 7598* Existence of a left inverse for addition. (Contributed by Scott Fenton, 3-Jan-2013.)
 |-  ( A  e.  CC  ->  E. x  e.  CC  ( x  +  A )  =  0 )
 
Theoremaddcan 7599 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.)
 |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( ( A  +  B )  =  ( A  +  C )  <->  B  =  C ) )
 
Theoremaddcan2 7600 Cancellation law for addition. (Contributed by NM, 30-Jul-2004.) (Revised by Scott Fenton, 3-Jan-2013.)
 |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( ( A  +  C )  =  ( B  +  C )  <->  A  =  B ) )
    < 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-11355
  Copyright terms: Public domain < Previous  Next >