HomeHome Intuitionistic Logic Explorer
Theorem List (p. 68 of 94)
< 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
 
Theorempitonnlem1 6701* Lemma for pitonn 6704. 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 6702 Lemma for pitonn 6704. 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 6703* Lemma for pitonn 6704. 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 6704* 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 6705 The complex numbers form a set. Use cnex 6763 instead. (Contributed by Mario Carneiro, 17-Nov-2014.) (New usage is discouraged.)

 CC  _V
 
Theoremaxresscn 6706 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 6735. (Contributed by NM, 1-Mar-1995.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) (New usage is discouraged.)

 RR  C_  CC
 
Theoremax1cn 6707 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 6736. (Contributed by NM, 12-Apr-2007.) (New usage is discouraged.)
 1  CC
 
Theoremax1re 6708 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 6737.

In the Metamath Proof Explorer, this is not a complex number axiom but is proved from ax-1cn 6736 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 6709  _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 6738. (Contributed by NM, 23-Feb-1996.) (New usage is discouraged.)
 _i  CC
 
Theoremaxaddcl 6710 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 6739 be used later. Instead, in most cases use addcl 6764. (Contributed by NM, 14-Jun-1995.) (New usage is discouraged.)
 CC  CC  +  CC
 
Theoremaxaddrcl 6711 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 6740 be used later. Instead, in most cases use readdcl 6765. (Contributed by NM, 31-Mar-1996.) (New usage is discouraged.)
 RR  RR  +  RR
 
Theoremaxmulcl 6712 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 6741 be used later. Instead, in most cases use mulcl 6766. (Contributed by NM, 10-Aug-1995.) (New usage is discouraged.)
 CC  CC  x.  CC
 
Theoremaxmulrcl 6713 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 6742 be used later. Instead, in most cases use remulcl 6767. (New usage is discouraged.) (Contributed by NM, 31-Mar-1996.)
 RR  RR  x.  RR
 
Theoremaxaddcom 6714 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 6743 be used later. Instead, use addcom 6907.

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 6715 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 6744 be used later. Instead, use mulcom 6768. (Contributed by NM, 31-Aug-1995.) (New usage is discouraged.)
 CC  CC  x.  x.
 
Theoremaxaddass 6716 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 6745 be used later. Instead, use addass 6769. (Contributed by NM, 2-Sep-1995.) (New usage is discouraged.)
 CC  CC  C  CC  +  +  C  +  +  C
 
Theoremaxmulass 6717 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 6746. (Contributed by NM, 3-Sep-1995.) (New usage is discouraged.)
 CC  CC  C  CC  x.  x.  C  x.  x.  C
 
Theoremaxdistr 6718 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 6747 be used later. Instead, use adddi 6771. (Contributed by NM, 2-Sep-1995.) (New usage is discouraged.)
 CC  CC  C  CC  x.  +  C  x.  +  x.  C
 
Theoremaxi2m1 6719 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 6748. (Contributed by NM, 5-May-1996.) (New usage is discouraged.)
 _i  x.  _i  +  1  0
 
Theoremax0lt1 6720 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 6749.

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 6721  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 6750. (Contributed by Scott Fenton, 3-Jan-2013.) (New usage is discouraged.)
 RR  x.  1
 
Theoremax0id 6722  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 6751.

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 6723* 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 6752. (Contributed by NM, 15-May-1996.) (New usage is discouraged.)
 RR  RR  +  0
 
Theoremaxprecex 6724* 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 6753.

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 6725* 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 6754. (Contributed by NM, 13-May-1996.) (New usage is discouraged.)
 CC  RR  RR  +  _i  x.
 
Theoremaxpre-ltirr 6726 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 6755. (Contributed by Jim Kingdon, 12-Jan-2020.) (New usage is discouraged.)
 RR  <RR
 
Theoremaxpre-ltwlin 6727 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 6756. (Contributed by Jim Kingdon, 12-Jan-2020.) (New usage is discouraged.)
 RR  RR  C  RR  <RR  <RR  C  C  <RR
 
Theoremaxpre-lttrn 6728 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 6757. (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 6729 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 6758.

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

 RR  RR  <RR  <RR
 
Theoremaxpre-ltadd 6730 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 6759. (Contributed by NM, 11-May-1996.) (New usage is discouraged.)
 RR  RR  C  RR  <RR  C  + 
 <RR  C  +
 
Theoremaxpre-mulgt0 6731 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 6760. (Contributed by NM, 13-May-1996.) (New usage is discouraged.)
 RR  RR  0 
 <RR  0  <RR  0  <RR  x.
 
Theoremaxpre-mulext 6732 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 6761.

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

 RR  RR  C  RR  x.  C  <RR  x.  C  <RR  <RR
 
Theoremaxarch 6733* 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 7657 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 6762. (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 6734 The complex numbers form a set. Proofs should normally use cnex 6763 instead. (New usage is discouraged.) (Contributed by NM, 1-Mar-1995.)

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

 RR  C_  CC
 
Axiomax-1cn 6736 1 is a complex number. Axiom for real and complex numbers, justified by theorem ax1cn 6707. (Contributed by NM, 1-Mar-1995.)
 1  CC
 
Axiomax-1re 6737 1 is a real number. Axiom for real and complex numbers, justified by theorem ax1re 6708. Proofs should use 1re 6784 instead. (Contributed by Jim Kingdon, 13-Jan-2020.) (New usage is discouraged.)
 1  RR
 
Axiomax-icn 6738  _i is a complex number. Axiom for real and complex numbers, justified by theorem axicn 6709. (Contributed by NM, 1-Mar-1995.)
 _i  CC
 
Axiomax-addcl 6739 Closure law for addition of complex numbers. Axiom for real and complex numbers, justified by theorem axaddcl 6710. Proofs should normally use addcl 6764 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 6740 Closure law for addition in the real subfield of complex numbers. Axiom for real and complex numbers, justified by theorem axaddrcl 6711. Proofs should normally use readdcl 6765 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 RR  RR  +  RR
 
Axiomax-mulcl 6741 Closure law for multiplication of complex numbers. Axiom for real and complex numbers, justified by theorem axmulcl 6712. Proofs should normally use mulcl 6766 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 CC  CC  x.  CC
 
Axiomax-mulrcl 6742 Closure law for multiplication in the real subfield of complex numbers. Axiom for real and complex numbers, justified by theorem axmulrcl 6713. Proofs should normally use remulcl 6767 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 RR  RR  x.  RR
 
Axiomax-addcom 6743 Addition commutes. Axiom for real and complex numbers, justified by theorem axaddcom 6714. Proofs should normally use addcom 6907 instead. (New usage is discouraged.) (Contributed by Jim Kingdon, 17-Jan-2020.)
 CC  CC  +  +
 
Axiomax-mulcom 6744 Multiplication of complex numbers is commutative. Axiom for real and complex numbers, justified by theorem axmulcom 6715. Proofs should normally use mulcom 6768 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 CC  CC  x.  x.
 
Axiomax-addass 6745 Addition of complex numbers is associative. Axiom for real and complex numbers, justified by theorem axaddass 6716. Proofs should normally use addass 6769 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 CC  CC  C  CC  +  +  C  +  +  C
 
Axiomax-mulass 6746 Multiplication of complex numbers is associative. Axiom for real and complex numbers, justified by theorem axmulass 6717. Proofs should normally use mulass 6770 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 CC  CC  C  CC  x.  x.  C  x.  x.  C
 
Axiomax-distr 6747 Distributive law for complex numbers (left-distributivity). Axiom for real and complex numbers, justified by theorem axdistr 6718. Proofs should normally use adddi 6771 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
 CC  CC  C  CC  x.  +  C  x.  +  x.  C
 
Axiomax-i2m1 6748 i-squared equals -1 (expressed as i-squared plus 1 is 0). Axiom for real and complex numbers, justified by theorem axi2m1 6719. (Contributed by NM, 29-Jan-1995.)
 _i  x.  _i  +  1  0
 
Theoremax-0lt1 6749 0 is less than 1. Axiom for real and complex numbers, justified by theorem ax0lt1 6720. Proofs should normally use 0lt1 6898 instead. (New usage is discouraged.) (Contributed by Jim Kingdon, 12-Jan-2020.)
 0  <RR  1
 
Axiomax-1rid 6750  1 is an identity element for real multiplication. Axiom for real and complex numbers, justified by theorem ax1rid 6721. (Contributed by NM, 29-Jan-1995.)
 RR  x.  1
 
Axiomax-0id 6751  0 is an identity element for real addition. Axiom for real and complex numbers, justified by theorem ax0id 6722.

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

 CC  +  0
 
Axiomax-rnegex 6752* Existence of negative of real number. Axiom for real and complex numbers, justified by theorem axrnegex 6723. (Contributed by Eric Schmidt, 21-May-2007.)
 RR  RR  +  0
 
Axiomax-precex 6753* Existence of reciprocal of positive real number. Axiom for real and complex numbers, justified by theorem axprecex 6724. (Contributed by Jim Kingdon, 6-Feb-2020.)
 RR  0  <RR  RR  0  <RR  x.  1
 
Axiomax-cnre 6754* 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 6725. For naming consistency, use cnre 6781 for new proofs. (New usage is discouraged.) (Contributed by NM, 9-May-1999.)
 CC  RR  RR  +  _i  x.
 
Axiomax-pre-ltirr 6755 Real number less-than is irreflexive. Axiom for real and complex numbers, justified by theorem ax-pre-ltirr 6755. (Contributed by Jim Kingdon, 12-Jan-2020.)
 RR  <RR
 
Axiomax-pre-ltwlin 6756 Real number less-than is weakly linear. Axiom for real and complex numbers, justified by theorem axpre-ltwlin 6727. (Contributed by Jim Kingdon, 12-Jan-2020.)
 RR  RR  C  RR  <RR  <RR  C  C  <RR
 
Axiomax-pre-lttrn 6757 Ordering on reals is transitive. Axiom for real and complex numbers, justified by theorem axpre-lttrn 6728. (Contributed by NM, 13-Oct-2005.)
 RR  RR  C  RR  <RR  <RR  C  <RR  C
 
Axiomax-pre-apti 6758 Apartness of reals is tight. Axiom for real and complex numbers, justified by theorem axpre-apti 6729. (Contributed by Jim Kingdon, 29-Jan-2020.)
 RR  RR  <RR  <RR
 
Axiomax-pre-ltadd 6759 Ordering property of addition on reals. Axiom for real and complex numbers, justified by theorem axpre-ltadd 6730. (Contributed by NM, 13-Oct-2005.)
 RR  RR  C  RR  <RR  C  + 
 <RR  C  +
 
Axiomax-pre-mulgt0 6760 The product of two positive reals is positive. Axiom for real and complex numbers, justified by theorem axpre-mulgt0 6731. (Contributed by NM, 13-Oct-2005.)
 RR  RR  0 
 <RR  0  <RR  0  <RR  x.
 
Axiomax-pre-mulext 6761 Strong extensionality of multiplication (expressed in terms of  <RR). Axiom for real and complex numbers, justified by theorem axpre-mulext 6732

(Contributed by Jim Kingdon, 18-Feb-2020.)

 RR  RR  C  RR  x.  C  <RR  x.  C  <RR  <RR
 
Axiomax-arch 6762* Archimedean axiom. Definition 3.1(2) of [Geuvers], p. 9. Axiom for real and complex numbers, justified by theorem axarch 6733.

This axiom should not be used directly; instead use arch 7914 (which is the same, but stated in terms of 
NN and  <). (Contributed by Jim Kingdon, 2-May-2020.) (New usage is discouraged.)

 RR  n  |^| {  |  1  +  1  }  <RR  n
 
3.2  Derive the basic properties from the field axioms
 
3.2.1  Some deductions from the field axioms for complex numbers
 
Theoremcnex 6763 Alias for ax-cnex 6734. (Contributed by Mario Carneiro, 17-Nov-2014.)

 CC  _V
 
Theoremaddcl 6764 Alias for ax-addcl 6739, for naming consistency with addcli 6789. Use this theorem instead of ax-addcl 6739 or axaddcl 6710. (Contributed by NM, 10-Mar-2008.)
 CC  CC  +  CC
 
Theoremreaddcl 6765 Alias for ax-addrcl 6740, for naming consistency with readdcli 6798. (Contributed by NM, 10-Mar-2008.)
 RR  RR  +  RR
 
Theoremmulcl 6766 Alias for ax-mulcl 6741, for naming consistency with mulcli 6790. (Contributed by NM, 10-Mar-2008.)
 CC  CC  x.  CC
 
Theoremremulcl 6767 Alias for ax-mulrcl 6742, for naming consistency with remulcli 6799. (Contributed by NM, 10-Mar-2008.)
 RR  RR  x.  RR
 
Theoremmulcom 6768 Alias for ax-mulcom 6744, for naming consistency with mulcomi 6791. (Contributed by NM, 10-Mar-2008.)
 CC  CC  x.  x.
 
Theoremaddass 6769 Alias for ax-addass 6745, for naming consistency with addassi 6793. (Contributed by NM, 10-Mar-2008.)
 CC  CC  C  CC  +  +  C  +  +  C
 
Theoremmulass 6770 Alias for ax-mulass 6746, for naming consistency with mulassi 6794. (Contributed by NM, 10-Mar-2008.)
 CC  CC  C  CC  x.  x.  C  x.  x.  C
 
Theoremadddi 6771 Alias for ax-distr 6747, for naming consistency with adddii 6795. (Contributed by NM, 10-Mar-2008.)
 CC  CC  C  CC  x.  +  C  x.  +  x.  C
 
Theoremrecn 6772 A real number is a complex number. (Contributed by NM, 10-Aug-1999.)
 RR  CC
 
Theoremreex 6773 The real numbers form a set. (Contributed by Mario Carneiro, 17-Nov-2014.)

 RR  _V
 
Theoremreelprrecn 6774 Reals are a subset of the pair of real and complex numbers (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)

 RR  { RR ,  CC }
 
Theoremcnelprrecn 6775 Complex numbers are a subset of the pair of real and complex numbers (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)

 CC  { RR ,  CC }
 
Theoremadddir 6776 Distributive law for complex numbers (right-distributivity). (Contributed by NM, 10-Oct-2004.)
 CC  CC  C  CC  +  x.  C  x.  C  +  x.  C
 
Theorem0cn 6777 0 is a complex number. (Contributed by NM, 19-Feb-2005.)
 0  CC
 
Theorem0cnd 6778 0 is a complex number, deductive form. (Contributed by David A. Wheeler, 8-Dec-2018.)
 0  CC
 
Theoremc0ex 6779 0 is a set (common case). (Contributed by David A. Wheeler, 7-Jul-2016.)
 0  _V
 
Theorem1ex 6780 1 is a set. Common special case. (Contributed by David A. Wheeler, 7-Jul-2016.)
 1  _V
 
Theoremcnre 6781* Alias for ax-cnre 6754, for naming consistency. (Contributed by NM, 3-Jan-2013.)
 CC  RR  RR  +  _i  x.
 
Theoremmulid1 6782  1 is an identity element for multiplication. Based on ideas by Eric Schmidt. (Contributed by Scott Fenton, 3-Jan-2013.)
 CC  x.  1
 
Theoremmulid2 6783 Identity law for multiplication. Note: see mulid1 6782 for commuted version. (Contributed by NM, 8-Oct-1999.)
 CC  1  x.
 
Theorem1re 6784  1 is a real number. (Contributed by Jim Kingdon, 13-Jan-2020.)
 1  RR
 
Theorem0re 6785  0 is a real number. (Contributed by Eric Schmidt, 21-May-2007.) (Revised by Scott Fenton, 3-Jan-2013.)
 0  RR
 
Theorem0red 6786  0 is a real number, deductive form. (Contributed by David A. Wheeler, 6-Dec-2018.)
 0  RR
 
Theoremmulid1i 6787 Identity law for multiplication. (Contributed by NM, 14-Feb-1995.)
 CC   =>     x.  1
 
Theoremmulid2i 6788 Identity law for multiplication. (Contributed by NM, 14-Feb-1995.)
 CC   =>     1  x.
 
Theoremaddcli 6789 Closure law for addition. (Contributed by NM, 23-Nov-1994.)
 CC   &     CC   =>     +  CC
 
Theoremmulcli 6790 Closure law for multiplication. (Contributed by NM, 23-Nov-1994.)
 CC   &     CC   =>     x.  CC
 
Theoremmulcomi 6791 Commutative law for multiplication. (Contributed by NM, 23-Nov-1994.)
 CC   &     CC   =>     x.  x.
 
Theoremmulcomli 6792 Commutative law for multiplication. (Contributed by NM, 23-Nov-1994.)
 CC   &     CC   &     x.  C   =>     x.  C
 
Theoremaddassi 6793 Associative law for addition. (Contributed by NM, 23-Nov-1994.)
 CC   &     CC   &     C  CC   =>     +  +  C  +  +  C
 
Theoremmulassi 6794 Associative law for multiplication. (Contributed by NM, 23-Nov-1994.)
 CC   &     CC   &     C  CC   =>     x.  x.  C  x.  x.  C
 
Theoremadddii 6795 Distributive law (left-distributivity). (Contributed by NM, 23-Nov-1994.)
 CC   &     CC   &     C  CC   =>     x.  +  C  x.  +  x.  C
 
Theoremadddiri 6796 Distributive law (right-distributivity). (Contributed by NM, 16-Feb-1995.)
 CC   &     CC   &     C  CC   =>     +  x.  C  x.  C  +  x.  C
 
Theoremrecni 6797 A real number is a complex number. (Contributed by NM, 1-Mar-1995.)
 RR   =>     CC
 
Theoremreaddcli 6798 Closure law for addition of reals. (Contributed by NM, 17-Jan-1997.)
 RR   &     RR   =>     +  RR
 
Theoremremulcli 6799 Closure law for multiplication of reals. (Contributed by NM, 17-Jan-1997.)
 RR   &     RR   =>     x.  RR
 
Theorem1red 6800 1 is an real number, deductive form (common case). (Contributed by David A. Wheeler, 6-Dec-2018.)
 1  RR
    < 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-9381
  Copyright terms: Public domain < Previous  Next >