Home | Intuitionistic Logic Explorer Theorem List (p. 70 of 106) | < Previous Next > |
Browser slow? Try the
Unicode version. |
||
Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | mulasssrg 6901 | Multiplication of signed reals is associative. (Contributed by Jim Kingdon, 3-Jan-2020.) |
Theorem | distrsrg 6902 | Multiplication of signed reals is distributive. (Contributed by Jim Kingdon, 4-Jan-2020.) |
Theorem | m1p1sr 6903 | Minus one plus one is zero for signed reals. (Contributed by NM, 5-May-1996.) |
Theorem | m1m1sr 6904 | Minus one times minus one is plus one for signed reals. (Contributed by NM, 14-May-1996.) |
Theorem | lttrsr 6905* | Signed real 'less than' is a transitive relation. (Contributed by Jim Kingdon, 4-Jan-2019.) |
Theorem | ltposr 6906 | Signed real 'less than' is a partial order. (Contributed by Jim Kingdon, 4-Jan-2019.) |
Theorem | ltsosr 6907 | Signed real 'less than' is a strict ordering. (Contributed by NM, 19-Feb-1996.) |
Theorem | 0lt1sr 6908 | 0 is less than 1 for signed reals. (Contributed by NM, 26-Mar-1996.) |
Theorem | 1ne0sr 6909 | 1 and 0 are distinct for signed reals. (Contributed by NM, 26-Mar-1996.) |
Theorem | 0idsr 6910 | The signed real number 0 is an identity element for addition of signed reals. (Contributed by NM, 10-Apr-1996.) |
Theorem | 1idsr 6911 | 1 is an identity element for multiplication. (Contributed by Jim Kingdon, 5-Jan-2020.) |
Theorem | 00sr 6912 | A signed real times 0 is 0. (Contributed by NM, 10-Apr-1996.) |
Theorem | ltasrg 6913 | Ordering property of addition. (Contributed by NM, 10-May-1996.) |
Theorem | pn0sr 6914 | A signed real plus its negative is zero. (Contributed by NM, 14-May-1996.) |
Theorem | negexsr 6915* | Existence of negative signed real. Part of Proposition 9-4.3 of [Gleason] p. 126. (Contributed by NM, 2-May-1996.) |
Theorem | recexgt0sr 6916* | The reciprocal of a positive signed real exists and is positive. (Contributed by Jim Kingdon, 6-Feb-2020.) |
Theorem | recexsrlem 6917* | The reciprocal of a positive signed real exists. Part of Proposition 9-4.3 of [Gleason] p. 126. (Contributed by NM, 15-May-1996.) |
Theorem | addgt0sr 6918 | The sum of two positive signed reals is positive. (Contributed by NM, 14-May-1996.) |
Theorem | ltadd1sr 6919 | Adding one to a signed real yields a larger signed real. (Contributed by Jim Kingdon, 7-Jul-2021.) |
Theorem | mulgt0sr 6920 | The product of two positive signed reals is positive. (Contributed by NM, 13-May-1996.) |
Theorem | aptisr 6921 | Apartness of signed reals is tight. (Contributed by Jim Kingdon, 29-Jan-2020.) |
Theorem | mulextsr1lem 6922 | Lemma for mulextsr1 6923. (Contributed by Jim Kingdon, 17-Feb-2020.) |
Theorem | mulextsr1 6923 | Strong extensionality of multiplication of signed reals. (Contributed by Jim Kingdon, 18-Feb-2020.) |
Theorem | archsr 6924* | For any signed real, there is an integer that is greater than it. This is also known as the "archimedean property". The expression , is the embedding of the positive integer into the signed reals. (Contributed by Jim Kingdon, 23-Apr-2020.) |
Theorem | srpospr 6925* | Mapping from a signed real greater than zero to a positive real. (Contributed by Jim Kingdon, 25-Jun-2021.) |
Theorem | prsrcl 6926 | Mapping from a positive real to a signed real. (Contributed by Jim Kingdon, 25-Jun-2021.) |
Theorem | prsrpos 6927 | Mapping from a positive real to a signed real yields a result greater than zero. (Contributed by Jim Kingdon, 25-Jun-2021.) |
Theorem | prsradd 6928 | Mapping from positive real addition to signed real addition. (Contributed by Jim Kingdon, 29-Jun-2021.) |
Theorem | prsrlt 6929 | Mapping from positive real ordering to signed real ordering. (Contributed by Jim Kingdon, 29-Jun-2021.) |
Theorem | prsrriota 6930* | Mapping a restricted iota from a positive real to a signed real. (Contributed by Jim Kingdon, 29-Jun-2021.) |
Theorem | caucvgsrlemcl 6931* | Lemma for caucvgsr 6944. Terms of the sequence from caucvgsrlemgt1 6937 can be mapped to positive reals. (Contributed by Jim Kingdon, 2-Jul-2021.) |
Theorem | caucvgsrlemasr 6932* | Lemma for caucvgsr 6944. The lower bound is a signed real. (Contributed by Jim Kingdon, 4-Jul-2021.) |
Theorem | caucvgsrlemfv 6933* | Lemma for caucvgsr 6944. Coercing sequence value from a positive real to a signed real. (Contributed by Jim Kingdon, 29-Jun-2021.) |
Theorem | caucvgsrlemf 6934* | Lemma for caucvgsr 6944. Defining the sequence in terms of positive reals. (Contributed by Jim Kingdon, 23-Jun-2021.) |
Theorem | caucvgsrlemcau 6935* | Lemma for caucvgsr 6944. Defining the Cauchy condition in terms of positive reals. (Contributed by Jim Kingdon, 23-Jun-2021.) |
Theorem | caucvgsrlembound 6936* | Lemma for caucvgsr 6944. Defining the boundedness condition in terms of positive reals. (Contributed by Jim Kingdon, 25-Jun-2021.) |
Theorem | caucvgsrlemgt1 6937* | Lemma for caucvgsr 6944. A Cauchy sequence whose terms are greater than one converges. (Contributed by Jim Kingdon, 22-Jun-2021.) |
Theorem | caucvgsrlemoffval 6938* | Lemma for caucvgsr 6944. Offsetting the values of the sequence so they are greater than one. (Contributed by Jim Kingdon, 3-Jul-2021.) |
Theorem | caucvgsrlemofff 6939* | Lemma for caucvgsr 6944. Offsetting the values of the sequence so they are greater than one. (Contributed by Jim Kingdon, 3-Jul-2021.) |
Theorem | caucvgsrlemoffcau 6940* | Lemma for caucvgsr 6944. Offsetting the values of the sequence so they are greater than one. (Contributed by Jim Kingdon, 3-Jul-2021.) |
Theorem | caucvgsrlemoffgt1 6941* | Lemma for caucvgsr 6944. Offsetting the values of the sequence so they are greater than one. (Contributed by Jim Kingdon, 3-Jul-2021.) |
Theorem | caucvgsrlemoffres 6942* | Lemma for caucvgsr 6944. Offsetting the values of the sequence so they are greater than one. (Contributed by Jim Kingdon, 3-Jul-2021.) |
Theorem | caucvgsrlembnd 6943* | Lemma for caucvgsr 6944. A Cauchy sequence with a lower bound converges. (Contributed by Jim Kingdon, 19-Jun-2021.) |
Theorem | caucvgsr 6944* |
A Cauchy sequence of signed reals with a modulus of convergence
converges to a signed real. This is basically Corollary 11.2.13 of
[HoTT], p. (varies). The HoTT book
theorem has a modulus of
convergence (that is, a rate of convergence) specified by (11.2.9) in
HoTT whereas this theorem fixes the rate of convergence to say that
all terms after the nth term must be within of the nth
term
(it should later be able to prove versions of this theorem with a
different fixed rate or a modulus of convergence supplied as a
hypothesis).
This is similar to caucvgprpr 6868 but is for signed reals rather than positive reals. Here is an outline of how we prove it: 1. Choose a lower bound for the sequence (see caucvgsrlembnd 6943). 2. Offset each element of the sequence so that each element of the resulting sequence is greater than one (greater than zero would not suffice, because the limit as well as the elements of the sequence need to be positive) (see caucvgsrlemofff 6939). 3. Since a signed real (element of ) which is greater than zero can be mapped to a positive real (element of ), perform that mapping on each element of the sequence and invoke caucvgprpr 6868 to get a limit (see caucvgsrlemgt1 6937). 4. Map the resulting limit from positive reals back to signed reals (see caucvgsrlemgt1 6937). 5. Offset that limit so that we get the limit of the original sequence rather than the limit of the offsetted sequence (see caucvgsrlemoffres 6942). (Contributed by Jim Kingdon, 20-Jun-2021.) |
Syntax | cc 6945 | Class of complex numbers. |
Syntax | cr 6946 | Class of real numbers. |
Syntax | cc0 6947 | Extend class notation to include the complex number 0. |
Syntax | c1 6948 | Extend class notation to include the complex number 1. |
Syntax | ci 6949 | Extend class notation to include the complex number i. |
Syntax | caddc 6950 | Addition on complex numbers. |
Syntax | cltrr 6951 | 'Less than' predicate (defined over real subset of complex numbers). |
Syntax | cmul 6952 | Multiplication on complex numbers. The token is a center dot. |
Definition | df-c 6953 | Define the set of complex numbers. (Contributed by NM, 22-Feb-1996.) |
Definition | df-0 6954 | Define the complex number 0. (Contributed by NM, 22-Feb-1996.) |
Definition | df-1 6955 | Define the complex number 1. (Contributed by NM, 22-Feb-1996.) |
Definition | df-i 6956 | Define the complex number (the imaginary unit). (Contributed by NM, 22-Feb-1996.) |
Definition | df-r 6957 | Define the set of real numbers. (Contributed by NM, 22-Feb-1996.) |
Definition | df-add 6958* | Define addition over complex numbers. (Contributed by NM, 28-May-1995.) |
Definition | df-mul 6959* | Define multiplication over complex numbers. (Contributed by NM, 9-Aug-1995.) |
Definition | df-lt 6960* | Define 'less than' on the real subset of complex numbers. (Contributed by NM, 22-Feb-1996.) |
Theorem | opelcn 6961 | Ordered pair membership in the class of complex numbers. (Contributed by NM, 14-May-1996.) |
Theorem | opelreal 6962 | Ordered pair membership in class of real subset of complex numbers. (Contributed by NM, 22-Feb-1996.) |
Theorem | elreal 6963* | Membership in class of real numbers. (Contributed by NM, 31-Mar-1996.) |
Theorem | elrealeu 6964* | The real number mapping in elreal 6963 is unique. (Contributed by Jim Kingdon, 11-Jul-2021.) |
Theorem | elreal2 6965 | Ordered pair membership in the class of complex numbers. (Contributed by Mario Carneiro, 15-Jun-2013.) |
Theorem | 0ncn 6966 | 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.) |
Theorem | ltrelre 6967 | 'Less than' is a relation on real numbers. (Contributed by NM, 22-Feb-1996.) |
Theorem | addcnsr 6968 | Addition of complex numbers in terms of signed reals. (Contributed by NM, 28-May-1995.) |
Theorem | mulcnsr 6969 | Multiplication of complex numbers in terms of signed reals. (Contributed by NM, 9-Aug-1995.) |
Theorem | eqresr 6970 | Equality of real numbers in terms of intermediate signed reals. (Contributed by NM, 10-May-1996.) |
Theorem | addresr 6971 | Addition of real numbers in terms of intermediate signed reals. (Contributed by NM, 10-May-1996.) |
Theorem | mulresr 6972 | Multiplication of real numbers in terms of intermediate signed reals. (Contributed by NM, 10-May-1996.) |
Theorem | ltresr 6973 | Ordering of real subset of complex numbers in terms of signed reals. (Contributed by NM, 22-Feb-1996.) |
Theorem | ltresr2 6974 | Ordering of real subset of complex numbers in terms of signed reals. (Contributed by NM, 22-Feb-1996.) |
Theorem | dfcnqs 6975 | Technical trick to permit reuse of previous lemmas to prove arithmetic operation laws in from those in . The trick involves qsid 6202, 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 is a quotient set, even though it is not (compare df-c 6953), 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.) |
Theorem | addcnsrec 6976 | Technical trick to permit re-use of some equivalence class lemmas for operation laws. See dfcnqs 6975 and mulcnsrec 6977. (Contributed by NM, 13-Aug-1995.) |
Theorem | mulcnsrec 6977 | Technical trick to permit re-use of some equivalence class lemmas for operation laws. The trick involves ecidg 6201, which shows that the coset of the converse epsilon relation (which is not an equivalence relation) leaves a set unchanged. See also dfcnqs 6975. (Contributed by NM, 13-Aug-1995.) |
Theorem | addvalex 6978 | Existence of a sum. This is dependent on how we define so once we proceed to real number axioms we will replace it with theorems such as addcl 7064. (Contributed by Jim Kingdon, 14-Jul-2021.) |
Theorem | pitonnlem1 6979* | Lemma for pitonn 6982. Two ways to write the number one. (Contributed by Jim Kingdon, 24-Apr-2020.) |
Theorem | pitonnlem1p1 6980 | Lemma for pitonn 6982. Simplifying an expression involving signed reals. (Contributed by Jim Kingdon, 26-Apr-2020.) |
Theorem | pitonnlem2 6981* | Lemma for pitonn 6982. Two ways to add one to a number. (Contributed by Jim Kingdon, 24-Apr-2020.) |
Theorem | pitonn 6982* | Mapping from to . (Contributed by Jim Kingdon, 22-Apr-2020.) |
Theorem | pitoregt0 6983* | Embedding from to yields a number greater than zero. (Contributed by Jim Kingdon, 15-Jul-2021.) |
Theorem | pitore 6984* | Embedding from to . Similar to pitonn 6982 but separate in the sense that we have not proved nnssre 7994 yet. (Contributed by Jim Kingdon, 15-Jul-2021.) |
Theorem | recnnre 6985* | Embedding the reciprocal of a natural number into . (Contributed by Jim Kingdon, 15-Jul-2021.) |
Theorem | peano1nnnn 6986* | One is an element of . This is a counterpart to 1nn 8001 designed for real number axioms which involve natural numbers (notably, axcaucvg 7032). (Contributed by Jim Kingdon, 14-Jul-2021.) (New usage is discouraged.) |
Theorem | peano2nnnn 6987* | A successor of a positive integer is a positive integer. This is a counterpart to peano2nn 8002 designed for real number axioms which involve to natural numbers (notably, axcaucvg 7032). (Contributed by Jim Kingdon, 14-Jul-2021.) (New usage is discouraged.) |
Theorem | ltrennb 6988* | Ordering of natural numbers with or . (Contributed by Jim Kingdon, 13-Jul-2021.) |
Theorem | ltrenn 6989* | Ordering of natural numbers with or . (Contributed by Jim Kingdon, 12-Jul-2021.) |
Theorem | recidpipr 6990* | Another way of saying that a number times its reciprocal is one. (Contributed by Jim Kingdon, 17-Jul-2021.) |
Theorem | recidpirqlemcalc 6991 | Lemma for recidpirq 6992. Rearranging some of the expressions. (Contributed by Jim Kingdon, 17-Jul-2021.) |
Theorem | recidpirq 6992* | A real number times its reciprocal is one, where reciprocal is expressed with . (Contributed by Jim Kingdon, 15-Jul-2021.) |
Theorem | axcnex 6993 | The complex numbers form a set. Use cnex 7063 instead. (Contributed by Mario Carneiro, 17-Nov-2014.) (New usage is discouraged.) |
Theorem | axresscn 6994 | 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 7034. (Contributed by NM, 1-Mar-1995.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) (New usage is discouraged.) |
Theorem | ax1cn 6995 | 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 7035. (Contributed by NM, 12-Apr-2007.) (New usage is discouraged.) |
Theorem | ax1re 6996 |
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 7036.
In the Metamath Proof Explorer, this is not a complex number axiom but is proved from ax-1cn 7035 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.) |
Theorem | axicn 6997 | 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 7037. (Contributed by NM, 23-Feb-1996.) (New usage is discouraged.) |
Theorem | axaddcl 6998 | 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 7038 be used later. Instead, in most cases use addcl 7064. (Contributed by NM, 14-Jun-1995.) (New usage is discouraged.) |
Theorem | axaddrcl 6999 | 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 7039 be used later. Instead, in most cases use readdcl 7065. (Contributed by NM, 31-Mar-1996.) (New usage is discouraged.) |
Theorem | axmulcl 7000 | 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 7040 be used later. Instead, in most cases use mulcl 7066. (Contributed by NM, 10-Aug-1995.) (New usage is discouraged.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |