HomeHome Intuitionistic Logic Explorer
Theorem List (p. 68 of 95)
< 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 - 6701-6800   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremrecexgt0sr 6701* The reciprocal of a positive signed real exists and is positive. (Contributed by Jim Kingdon, 6-Feb-2020.)
 0R  <R  R.  0R  <R  .R 
 1R
 
Theoremrecexsrlem 6702* The reciprocal of a positive signed real exists. Part of Proposition 9-4.3 of [Gleason] p. 126. (Contributed by NM, 15-May-1996.)
 0R  <R  R.  .R 
 1R
 
Theoremaddgt0sr 6703 The sum of two positive signed reals is positive. (Contributed by NM, 14-May-1996.)
 0R  <R  0R  <R  0R  <R  +R
 
Theoremmulgt0sr 6704 The product of two positive signed reals is positive. (Contributed by NM, 13-May-1996.)
 0R  <R  0R  <R  0R  <R  .R
 
Theoremaptisr 6705 Apartness of signed reals is tight. (Contributed by Jim Kingdon, 29-Jan-2020.)
 R.  R.  <R  <R
 
Theoremmulextsr1lem 6706 Lemma for mulextsr1 6707. (Contributed by Jim Kingdon, 17-Feb-2020.)
 X  P.  Y  P.  Z  P.  W  P.  U  P.  V  P.  X 
 .P.  U  +P.  Y  .P.  V 
 +P.  Z 
 .P.  V  +P.  W  .P.  U  <P  X  .P.  V 
 +P.  Y  .P.  U  +P.  Z  .P.  U 
 +P.  W  .P.  V  X  +P.  W  <P  Y  +P.  Z  Z 
 +P.  Y  <P  W 
 +P.  X
 
Theoremmulextsr1 6707 Strong extensionality of multiplication of signed reals. (Contributed by Jim Kingdon, 18-Feb-2020.)
 R.  R.  C  R.  .R  C  <R 
 .R  C  <R  <R
 
Theoremarchsr 6708* For any signed real, there is an integer that is greater than it. This is also known as the "archimedean property". The expression  <. <. { l  |  l 
<Q  <. ,  1o >.  ~Q  },  {  |  <. ,  1o >.  ~Q  <Q  } >.  +P.  1P ,  1P >.  ~R is the embedding of the positive integer into the signed reals. (Contributed by Jim Kingdon, 23-Apr-2020.)
 R.  N.  <R  <. <. { l  |  l  <Q  <. ,  1o >.  ~Q  } ,  {  |  <. ,  1o >.  ~Q  <Q  } >.  +P.  1P ,  1P >.  ~R
 
Syntaxcc 6709 Class of complex numbers.

 CC
 
Syntaxcr 6710 Class of real numbers.

 RR
 
Syntaxcc0 6711 Extend class notation to include the complex number 0.
 0
 
Syntaxc1 6712 Extend class notation to include the complex number 1.
 1
 
Syntaxci 6713 Extend class notation to include the complex number i.

 _i
 
Syntaxcaddc 6714 Addition on complex numbers.
 +
 
Syntaxcltrr 6715 'Less than' predicate (defined over real subset of complex numbers).
 <RR
 
Syntaxcmul 6716 Multiplication on complex numbers. The token  x. is a center dot.

 x.
 
Definitiondf-c 6717 Define the set of complex numbers. (Contributed by NM, 22-Feb-1996.)

 CC  R.  X. 
 R.
 
Definitiondf-0 6718 Define the complex number 0. (Contributed by NM, 22-Feb-1996.)
 0  <. 0R ,  0R >.
 
Definitiondf-1 6719 Define the complex number 1. (Contributed by NM, 22-Feb-1996.)
 1  <. 1R ,  0R >.
 
Definitiondf-i 6720 Define the complex number  _i (the imaginary unit). (Contributed by NM, 22-Feb-1996.)
 _i  <. 0R ,  1R >.
 
Definitiondf-r 6721 Define the set of real numbers. (Contributed by NM, 22-Feb-1996.)

 RR  R.  X. 
 { 0R }
 
Definitiondf-add 6722* Define addition over complex numbers. (Contributed by NM, 28-May-1995.)

 +  { <. <. ,  >. ,  >.  |  CC  CC  <. ,  >.  <. ,  >. 
 <.  +R  ,  +R  >. }
 
Definitiondf-mul 6723* Define multiplication over complex numbers. (Contributed by NM, 9-Aug-1995.)

 x.  { <. <. ,  >. ,  >.  |  CC  CC  <. ,  >.  <. ,  >. 
 <.  .R  +R  -1R  .R  .R  ,  .R  +R  .R  >. }
 
Definitiondf-lt 6724* Define 'less than' on the real subset of complex numbers. (Contributed by NM, 22-Feb-1996.)

 <RR  { <. ,  >.  |  RR  RR  <. ,  0R >.  <. ,  0R >.  <R  }
 
Theoremopelcn 6725 Ordered pair membership in the class of complex numbers. (Contributed by NM, 14-May-1996.)
 <. ,  >.  CC  R.  R.
 
Theoremopelreal 6726 Ordered pair membership in class of real subset of complex numbers. (Contributed by NM, 22-Feb-1996.)
 <. ,  0R >.  RR  R.
 
Theoremelreal 6727* Membership in class of real numbers. (Contributed by NM, 31-Mar-1996.)
 RR  R.  <. ,  0R >.
 
Theoremelreal2 6728 Ordered pair membership in the class of complex numbers. (Contributed by Mario Carneiro, 15-Jun-2013.)
 RR  1st `  R.  <. 1st `  ,  0R >.
 
Theorem0ncn 6729 The empty set is not a complex number. Note: do not use this after the real number axioms are developed, since it is a construction-dependent property. (Contributed by NM, 2-May-1996.)
 (/)  CC
 
Theoremltrelre 6730 'Less than' is a relation on real numbers. (Contributed by NM, 22-Feb-1996.)

 <RR  C_  RR  X.  RR
 
Theoremaddcnsr 6731 Addition of complex numbers in terms of signed reals. (Contributed by NM, 28-May-1995.)
 R.  R.  C  R.  D  R.  <. ,  >.  +  <. C ,  D >.  <. 
 +R  C ,  +R  D
 >.
 
Theoremmulcnsr 6732 Multiplication of complex numbers in terms of signed reals. (Contributed by NM, 9-Aug-1995.)
 R.  R.  C  R.  D  R.  <. ,  >.  x.  <. C ,  D >.  <.  .R  C 
 +R  -1R  .R  .R  D ,  .R  C 
 +R  .R  D >.
 
Theoremeqresr 6733 Equality of real numbers in terms of intermediate signed reals. (Contributed by NM, 10-May-1996.)
 _V   =>     <. ,  0R >.  <. ,  0R >.
 
Theoremaddresr 6734 Addition of real numbers in terms of intermediate signed reals. (Contributed by NM, 10-May-1996.)
 R.  R.  <. ,  0R >.  +  <. ,  0R >.  <. 
 +R  ,  0R >.
 
Theoremmulresr 6735 Multiplication of real numbers in terms of intermediate signed reals. (Contributed by NM, 10-May-1996.)
 R.  R.  <. ,  0R >.  x.  <. ,  0R >.  <. 
 .R  ,  0R >.
 
Theoremltresr 6736 Ordering of real subset of complex numbers in terms of signed reals. (Contributed by NM, 22-Feb-1996.)
 <. ,  0R >.  <RR 
 <. ,  0R >. 
 <R
 
Theoremltresr2 6737 Ordering of real subset of complex numbers in terms of signed reals. (Contributed by NM, 22-Feb-1996.)
 RR  RR  <RR  1st `  <R  1st `
 
Theoremdfcnqs 6738 Technical trick to permit reuse of previous lemmas to prove arithmetic operation laws in  CC from those in  R.. The trick involves qsid 6107, which shows that the coset of the converse epsilon relation (which is not an equivalence relation) acts as an identity divisor for the quotient set operation. This lets us "pretend" that  CC is a quotient set, even though it is not (compare df-c 6717), and allows us to reuse some of the equivalence class lemmas we developed for the transition from positive reals to signed reals, etc. (Contributed by NM, 13-Aug-1995.)

 CC  R.  X.  R. /. `'  _E
 
Theoremaddcnsrec 6739 Technical trick to permit re-use of some equivalence class lemmas for operation laws. See dfcnqs 6738 and mulcnsrec 6740. (Contributed by NM, 13-Aug-1995.)
 R.  R.  C  R.  D  R.  <. ,  >. `'  _E  +  <. C ,  D >. `'  _E  <.  +R  C , 
 +R  D >. `'  _E
 
Theoremmulcnsrec 6740 Technical trick to permit re-use of some equivalence class lemmas for operation laws. The trick involves ecidg 6106, which shows that the coset of the converse epsilon relation (which is not an equivalence relation) leaves a set unchanged. See also dfcnqs 6738. (Contributed by NM, 13-Aug-1995.)
 R.  R.  C  R.  D  R.  <. ,  >. `'  _E  x. 
 <. C ,  D >. `'  _E  <.  .R  C  +R  -1R  .R  .R  D ,  .R  C  +R  .R  D >. `'  _E
 
Theorempitonnlem1 6741* Lemma for pitonn 6744. Two ways to write the number one. (Contributed by Jim Kingdon, 24-Apr-2020.)

 <. <. <. { l  |  l  <Q  <. 1o ,  1o >.  ~Q  } ,  {  |  <. 1o ,  1o >.  ~Q  <Q  } >.  +P.  1P ,  1P >.  ~R  ,  0R >.  1
 
Theorempitonnlem1p1 6742 Lemma for pitonn 6744. Simplifying an expression involving signed reals. (Contributed by Jim Kingdon, 26-Apr-2020.)
 P.  <.  +P.  1P  +P.  1P ,  1P  +P. 
 1P >.  ~R  <.  +P.  1P ,  1P >. 
 ~R
 
Theorempitonnlem2 6743* Lemma for pitonn 6744. Two ways to add one to a number. (Contributed by Jim Kingdon, 24-Apr-2020.)
 K  N.  <. <. <. { l  |  l  <Q 
 <. K ,  1o >. 
 ~Q  } ,  {  |  <. K ,  1o >.  ~Q  <Q  } >.  +P.  1P ,  1P >.  ~R  ,  0R >.  +  1 
 <. <. <. { l  |  l  <Q  <. K  +N  1o ,  1o >.  ~Q  } ,  {  |  <. K  +N  1o ,  1o >.  ~Q  <Q  } >.  +P.  1P ,  1P >.  ~R  ,  0R >.
 
Theorempitonn 6744* Mapping from  N. to  NN. (Contributed by Jim Kingdon, 22-Apr-2020.)
 n  N.  <. <. <. { l  |  l  <Q 
 <. n ,  1o >. 
 ~Q  } ,  {  |  <. n ,  1o >.  ~Q  <Q  } >.  +P.  1P ,  1P >.  ~R  ,  0R >.  |^| {  |  1  +  1  }
 
3.1.2  Final derivation of real and complex number postulates
 
Theoremaxcnex 6745 The complex numbers form a set. Use cnex 6803 instead. (Contributed by Mario Carneiro, 17-Nov-2014.) (New usage is discouraged.)

 CC  _V
 
Theoremaxresscn 6746 The real numbers are a subset of the complex numbers. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-resscn 6775. (Contributed by NM, 1-Mar-1995.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) (New usage is discouraged.)

 RR  C_  CC
 
Theoremax1cn 6747 1 is a complex number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-1cn 6776. (Contributed by NM, 12-Apr-2007.) (New usage is discouraged.)
 1  CC
 
Theoremax1re 6748 1 is a real number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-1re 6777.

In the Metamath Proof Explorer, this is not a complex number axiom but is proved from ax-1cn 6776 and the other axioms. It is not known whether we can do so here, but the Metamath Proof Explorer proof (accessed 13-Jan-2020) uses excluded middle. (Contributed by Jim Kingdon, 13-Jan-2020.) (New usage is discouraged.)

 1  RR
 
Theoremaxicn 6749  _i is a complex number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-icn 6778. (Contributed by NM, 23-Feb-1996.) (New usage is discouraged.)
 _i  CC
 
Theoremaxaddcl 6750 Closure law for addition of complex numbers. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-addcl 6779 be used later. Instead, in most cases use addcl 6804. (Contributed by NM, 14-Jun-1995.) (New usage is discouraged.)
 CC  CC  +  CC
 
Theoremaxaddrcl 6751 Closure law for addition in the real subfield of complex numbers. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-addrcl 6780 be used later. Instead, in most cases use readdcl 6805. (Contributed by NM, 31-Mar-1996.) (New usage is discouraged.)
 RR  RR  +  RR
 
Theoremaxmulcl 6752 Closure law for multiplication of complex numbers. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-mulcl 6781 be used later. Instead, in most cases use mulcl 6806. (Contributed by NM, 10-Aug-1995.) (New usage is discouraged.)
 CC  CC  x.  CC
 
Theoremaxmulrcl 6753 Closure law for multiplication in the real subfield of complex numbers. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-mulrcl 6782 be used later. Instead, in most cases use remulcl 6807. (New usage is discouraged.) (Contributed by NM, 31-Mar-1996.)
 RR  RR  x.  RR
 
Theoremaxaddcom 6754 Addition commutes. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-addcom 6783 be used later. Instead, use addcom 6947.

In the Metamath Proof Explorer this is not a complex number axiom but is instead proved from other axioms. That proof relies on real number trichotomy and it is not known whether it is possible to prove this from the other axioms without it. (Contributed by Jim Kingdon, 17-Jan-2020.) (New usage is discouraged.)

 CC  CC  +  +
 
Theoremaxmulcom 6755 Multiplication of complex numbers is commutative. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-mulcom 6784 be used later. Instead, use mulcom 6808. (Contributed by NM, 31-Aug-1995.) (New usage is discouraged.)
 CC  CC  x.  x.
 
Theoremaxaddass 6756 Addition of complex numbers is associative. This theorem transfers the associative laws for the real and imaginary signed real components of complex number pairs, to complex number addition itself. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-addass 6785 be used later. Instead, use addass 6809. (Contributed by NM, 2-Sep-1995.) (New usage is discouraged.)
 CC  CC  C  CC  +  +  C  +  +  C
 
Theoremaxmulass 6757 Multiplication of complex numbers is associative. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-mulass 6786. (Contributed by NM, 3-Sep-1995.) (New usage is discouraged.)
 CC  CC  C  CC  x.  x.  C  x.  x.  C
 
Theoremaxdistr 6758 Distributive law for complex numbers (left-distributivity). Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-distr 6787 be used later. Instead, use adddi 6811. (Contributed by NM, 2-Sep-1995.) (New usage is discouraged.)
 CC  CC  C  CC  x.  +  C  x.  +  x.  C
 
Theoremaxi2m1 6759 i-squared equals -1 (expressed as i-squared plus 1 is 0). Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-i2m1 6788. (Contributed by NM, 5-May-1996.) (New usage is discouraged.)
 _i  x.  _i  +  1  0
 
Theoremax0lt1 6760 0 is less than 1. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-0lt1 6789.

The version of this axiom in the Metamath Proof Explorer reads  1  =/=  0; here we change it to  0  <RR  1. The proof of  0  <RR  1 from  1  =/=  0 in the Metamath Proof Explorer (accessed 12-Jan-2020) relies on real number trichotomy. (Contributed by Jim Kingdon, 12-Jan-2020.) (New usage is discouraged.)

 0  <RR  1
 
Theoremax1rid 6761  1 is an identity element for real multiplication. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-1rid 6790. (Contributed by Scott Fenton, 3-Jan-2013.) (New usage is discouraged.)
 RR  x.  1
 
Theoremax0id 6762  0 is an identity element for real addition. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-0id 6791.

In the Metamath Proof Explorer this is not a complex number axiom but is instead proved from other axioms. That proof relies on excluded middle and it is not known whether it is possible to prove this from the other axioms without excluded middle. (Contributed by Jim Kingdon, 16-Jan-2020.) (New usage is discouraged.)

 CC  +  0
 
Theoremaxrnegex 6763* Existence of negative of real number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-rnegex 6792. (Contributed by NM, 15-May-1996.) (New usage is discouraged.)
 RR  RR  +  0
 
Theoremaxprecex 6764* Existence of positive reciprocal of positive real number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-precex 6793.

In treatments which assume excluded middle, the  0 
<RR condition is generally replaced by  =/=  0, and it may not be necessary to state that the reciproacal is positive. (Contributed by Jim Kingdon, 6-Feb-2020.) (New usage is discouraged.)

 RR  0  <RR  RR  0  <RR  x.  1
 
Theoremaxcnre 6765* A complex number can be expressed in terms of two reals. Definition 10-1.1(v) of [Gleason] p. 130. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-cnre 6794. (Contributed by NM, 13-May-1996.) (New usage is discouraged.)
 CC  RR  RR  +  _i  x.
 
Theoremaxpre-ltirr 6766 Real number less-than is irreflexive. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-ltirr 6795. (Contributed by Jim Kingdon, 12-Jan-2020.) (New usage is discouraged.)
 RR  <RR
 
Theoremaxpre-ltwlin 6767 Real number less-than is weakly linear. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-ltwlin 6796. (Contributed by Jim Kingdon, 12-Jan-2020.) (New usage is discouraged.)
 RR  RR  C  RR  <RR  <RR  C  C  <RR
 
Theoremaxpre-lttrn 6768 Ordering on reals is transitive. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-lttrn 6797. (Contributed by NM, 19-May-1996.) (Revised by Mario Carneiro, 16-Jun-2013.) (New usage is discouraged.)
 RR  RR  C  RR  <RR  <RR  C  <RR  C
 
Theoremaxpre-apti 6769 Apartness of reals is tight. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-apti 6798.

(Contributed by Jim Kingdon, 29-Jan-2020.) (New usage is discouraged.)

 RR  RR  <RR  <RR
 
Theoremaxpre-ltadd 6770 Ordering property of addition on reals. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-ltadd 6799. (Contributed by NM, 11-May-1996.) (New usage is discouraged.)
 RR  RR  C  RR  <RR  C  + 
 <RR  C  +
 
Theoremaxpre-mulgt0 6771 The product of two positive reals is positive. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-mulgt0 6800. (Contributed by NM, 13-May-1996.) (New usage is discouraged.)
 RR  RR  0 
 <RR  0  <RR  0  <RR  x.
 
Theoremaxpre-mulext 6772 Strong extensionality of multiplication (expressed in terms of  <RR). Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-mulext 6801.

(Contributed by Jim Kingdon, 18-Feb-2020.) (New usage is discouraged.)

 RR  RR  C  RR  x.  C  <RR  x.  C  <RR  <RR
 
Theoremaxarch 6773* Archimedean axiom. The Archimedean property is more naturally stated once we have defined  NN. Unless we find another way to state it, we'll just use the right hand side of dfnn2 7697 in stating what we mean by "natural number" in the context of this axiom.

This construction-dependent theorem should not be referenced directly; instead, use ax-arch 6802. (Contributed by Jim Kingdon, 22-Apr-2020.) (New usage is discouraged.)

 RR  n  |^| {  |  1  +  1  }  <RR  n
 
3.1.3  Real and complex number postulates restated as axioms
 
Axiomax-cnex 6774 The complex numbers form a set. Proofs should normally use cnex 6803 instead. (New usage is discouraged.) (Contributed by NM, 1-Mar-1995.)

 CC  _V
 
Axiomax-resscn 6775 The real numbers are a subset of the complex numbers. Axiom for real and complex numbers, justified by theorem axresscn 6746. (Contributed by NM, 1-Mar-1995.)

 RR  C_  CC
 
Axiomax-1cn 6776 1 is a complex number. Axiom for real and complex numbers, justified by theorem ax1cn 6747. (Contributed by NM, 1-Mar-1995.)
 1  CC
 
Axiomax-1re 6777 1 is a real number. Axiom for real and complex numbers, justified by theorem ax1re 6748. Proofs should use 1re 6824 instead. (Contributed by Jim Kingdon, 13-Jan-2020.) (New usage is discouraged.)
 1  RR
 
Axiomax-icn 6778  _i is a complex number. Axiom for real and complex numbers, justified by theorem axicn 6749. (Contributed by NM, 1-Mar-1995.)
 _i  CC
 
Axiomax-addcl 6779 Closure law for addition of complex numbers. Axiom for real and complex numbers, justified by theorem axaddcl 6750. Proofs should normally use addcl 6804 instead, which asserts the same thing but follows our naming conventions for closures. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 CC  CC  +  CC
 
Axiomax-addrcl 6780 Closure law for addition in the real subfield of complex numbers. Axiom for real and complex numbers, justified by theorem axaddrcl 6751. Proofs should normally use readdcl 6805 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 RR  RR  +  RR
 
Axiomax-mulcl 6781 Closure law for multiplication of complex numbers. Axiom for real and complex numbers, justified by theorem axmulcl 6752. Proofs should normally use mulcl 6806 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 CC  CC  x.  CC
 
Axiomax-mulrcl 6782 Closure law for multiplication in the real subfield of complex numbers. Axiom for real and complex numbers, justified by theorem axmulrcl 6753. Proofs should normally use remulcl 6807 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 RR  RR  x.  RR
 
Axiomax-addcom 6783 Addition commutes. Axiom for real and complex numbers, justified by theorem axaddcom 6754. Proofs should normally use addcom 6947 instead. (New usage is discouraged.) (Contributed by Jim Kingdon, 17-Jan-2020.)
 CC  CC  +  +
 
Axiomax-mulcom 6784 Multiplication of complex numbers is commutative. Axiom for real and complex numbers, justified by theorem axmulcom 6755. Proofs should normally use mulcom 6808 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 CC  CC  x.  x.
 
Axiomax-addass 6785 Addition of complex numbers is associative. Axiom for real and complex numbers, justified by theorem axaddass 6756. Proofs should normally use addass 6809 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 CC  CC  C  CC  +  +  C  +  +  C
 
Axiomax-mulass 6786 Multiplication of complex numbers is associative. Axiom for real and complex numbers, justified by theorem axmulass 6757. Proofs should normally use mulass 6810 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 CC  CC  C  CC  x.  x.  C  x.  x.  C
 
Axiomax-distr 6787 Distributive law for complex numbers (left-distributivity). Axiom for real and complex numbers, justified by theorem axdistr 6758. Proofs should normally use adddi 6811 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 CC  CC  C  CC  x.  +  C  x.  +  x.  C
 
Axiomax-i2m1 6788 i-squared equals -1 (expressed as i-squared plus 1 is 0). Axiom for real and complex numbers, justified by theorem axi2m1 6759. (Contributed by NM, 29-Jan-1995.)
 _i  x.  _i  +  1  0
 
Theoremax-0lt1 6789 0 is less than 1. Axiom for real and complex numbers, justified by theorem ax0lt1 6760. Proofs should normally use 0lt1 6938 instead. (New usage is discouraged.) (Contributed by Jim Kingdon, 12-Jan-2020.)
 0  <RR  1
 
Axiomax-1rid 6790  1 is an identity element for real multiplication. Axiom for real and complex numbers, justified by theorem ax1rid 6761. (Contributed by NM, 29-Jan-1995.)
 RR  x.  1
 
Axiomax-0id 6791  0 is an identity element for real addition. Axiom for real and complex numbers, justified by theorem ax0id 6762.

Proofs should normally use addid1 6948 instead. (New usage is discouraged.) (Contributed by Jim Kingdon, 16-Jan-2020.)

 CC  +  0
 
Axiomax-rnegex 6792* Existence of negative of real number. Axiom for real and complex numbers, justified by theorem axrnegex 6763. (Contributed by Eric Schmidt, 21-May-2007.)
 RR  RR  +  0
 
Axiomax-precex 6793* Existence of reciprocal of positive real number. Axiom for real and complex numbers, justified by theorem axprecex 6764. (Contributed by Jim Kingdon, 6-Feb-2020.)
 RR  0  <RR  RR  0  <RR  x.  1
 
Axiomax-cnre 6794* A complex number can be expressed in terms of two reals. Definition 10-1.1(v) of [Gleason] p. 130. Axiom for real and complex numbers, justified by theorem axcnre 6765. For naming consistency, use cnre 6821 for new proofs. (New usage is discouraged.) (Contributed by NM, 9-May-1999.)
 CC  RR  RR  +  _i  x.
 
Axiomax-pre-ltirr 6795 Real number less-than is irreflexive. Axiom for real and complex numbers, justified by theorem ax-pre-ltirr 6795. (Contributed by Jim Kingdon, 12-Jan-2020.)
 RR  <RR
 
Axiomax-pre-ltwlin 6796 Real number less-than is weakly linear. Axiom for real and complex numbers, justified by theorem axpre-ltwlin 6767. (Contributed by Jim Kingdon, 12-Jan-2020.)
 RR  RR  C  RR  <RR  <RR  C  C  <RR
 
Axiomax-pre-lttrn 6797 Ordering on reals is transitive. Axiom for real and complex numbers, justified by theorem axpre-lttrn 6768. (Contributed by NM, 13-Oct-2005.)
 RR  RR  C  RR  <RR  <RR  C  <RR  C
 
Axiomax-pre-apti 6798 Apartness of reals is tight. Axiom for real and complex numbers, justified by theorem axpre-apti 6769. (Contributed by Jim Kingdon, 29-Jan-2020.)
 RR  RR  <RR  <RR
 
Axiomax-pre-ltadd 6799 Ordering property of addition on reals. Axiom for real and complex numbers, justified by theorem axpre-ltadd 6770. (Contributed by NM, 13-Oct-2005.)
 RR  RR  C  RR  <RR  C  + 
 <RR  C  +
 
Axiomax-pre-mulgt0 6800 The product of two positive reals is positive. Axiom for real and complex numbers, justified by theorem axpre-mulgt0 6771. (Contributed by NM, 13-Oct-2005.)
 RR  RR  0 
 <RR  0  <RR  0  <RR  x.
    < 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-9457
  Copyright terms: Public domain < Previous  Next >