Home | Intuitionistic Logic Explorer Theorem List (p. 67 of 105) | < 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 | nnnq0lem1 6601* | Decomposing non-negative fractions into natural numbers. Lemma for addnnnq0 6604 and mulnnnq0 6605. (Contributed by Jim Kingdon, 23-Nov-2019.) |
~_{Q0} ~_{Q0} ~_{Q0} ~_{Q0} ~_{Q0} ~_{Q0} ~_{Q0} ~_{Q0} | ||
Theorem | addnq0mo 6602* | There is at most one result from adding non-negative fractions. (Contributed by Jim Kingdon, 23-Nov-2019.) |
~_{Q0} ~_{Q0} ~_{Q0} ~_{Q0} ~_{Q0} | ||
Theorem | mulnq0mo 6603* | There is at most one result from multiplying non-negative fractions. (Contributed by Jim Kingdon, 20-Nov-2019.) |
~_{Q0} ~_{Q0} ~_{Q0} ~_{Q0} ~_{Q0} | ||
Theorem | addnnnq0 6604 | Addition of non-negative fractions in terms of natural numbers. (Contributed by Jim Kingdon, 22-Nov-2019.) |
~_{Q0} +_{Q0} ~_{Q0} ~_{Q0} | ||
Theorem | mulnnnq0 6605 | Multiplication of non-negative fractions in terms of natural numbers. (Contributed by Jim Kingdon, 19-Nov-2019.) |
~_{Q0} ·_{Q0} ~_{Q0} ~_{Q0} | ||
Theorem | addclnq0 6606 | Closure of addition on non-negative fractions. (Contributed by Jim Kingdon, 29-Nov-2019.) |
Q_{0} Q_{0} +_{Q0} Q_{0} | ||
Theorem | mulclnq0 6607 | Closure of multiplication on non-negative fractions. (Contributed by Jim Kingdon, 30-Nov-2019.) |
Q_{0} Q_{0} ·_{Q0} Q_{0} | ||
Theorem | nqpnq0nq 6608 | A positive fraction plus a non-negative fraction is a positive fraction. (Contributed by Jim Kingdon, 30-Nov-2019.) |
Q_{0} +_{Q0} | ||
Theorem | nqnq0a 6609 | Addition of positive fractions is equal with or +_{Q0}. (Contributed by Jim Kingdon, 10-Nov-2019.) |
+_{Q0} | ||
Theorem | nqnq0m 6610 | Multiplication of positive fractions is equal with or ·_{Q0}. (Contributed by Jim Kingdon, 10-Nov-2019.) |
·_{Q0} | ||
Theorem | nq0m0r 6611 | Multiplication with zero for non-negative fractions. (Contributed by Jim Kingdon, 5-Nov-2019.) |
Q_{0} 0_{Q0} ·_{Q0} 0_{Q0} | ||
Theorem | nq0a0 6612 | Addition with zero for non-negative fractions. (Contributed by Jim Kingdon, 5-Nov-2019.) |
Q_{0} +_{Q0} 0_{Q0} | ||
Theorem | nnanq0 6613 | Addition of non-negative fractions with a common denominator. You can add two fractions with the same denominator by adding their numerators and keeping the same denominator. (Contributed by Jim Kingdon, 1-Dec-2019.) |
~_{Q0} ~_{Q0} +_{Q0} ~_{Q0} | ||
Theorem | distrnq0 6614 | Multiplication of non-negative fractions is distributive. (Contributed by Jim Kingdon, 27-Nov-2019.) |
Q_{0} Q_{0} Q_{0} ·_{Q0} +_{Q0} ·_{Q0} +_{Q0} ·_{Q0} | ||
Theorem | mulcomnq0 6615 | Multiplication of non-negative fractions is commutative. (Contributed by Jim Kingdon, 27-Nov-2019.) |
Q_{0} Q_{0} ·_{Q0} ·_{Q0} | ||
Theorem | addassnq0lemcl 6616 | A natural number closure law. Lemma for addassnq0 6617. (Contributed by Jim Kingdon, 3-Dec-2019.) |
Theorem | addassnq0 6617 | Addition of non-negaative fractions is associative. (Contributed by Jim Kingdon, 29-Nov-2019.) |
Q_{0} Q_{0} Q_{0} +_{Q0} +_{Q0} +_{Q0} +_{Q0} | ||
Theorem | distnq0r 6618 | Multiplication of non-negative fractions is distributive. Version of distrnq0 6614 with the multiplications commuted. (Contributed by Jim Kingdon, 29-Nov-2019.) |
Q_{0} Q_{0} Q_{0} +_{Q0} ·_{Q0} ·_{Q0} +_{Q0} ·_{Q0} | ||
Theorem | addpinq1 6619 | Addition of one to the numerator of a fraction whose denominator is one. (Contributed by Jim Kingdon, 26-Apr-2020.) |
Theorem | nq02m 6620 | Multiply a non-negative fraction by two. (Contributed by Jim Kingdon, 29-Nov-2019.) |
Q_{0} ~_{Q0} ·_{Q0} +_{Q0} | ||
Definition | df-inp 6621* |
Define the set of positive reals. A "Dedekind cut" is a partition of
the positive rational numbers into two classes such that all the numbers
of one class are less than all the numbers of the other.
Here we follow the definition of a Dedekind cut from Definition 11.2.1 of [HoTT], p. (varies) with the one exception that we define it over positive rational numbers rather than all rational numbers. A Dedekind cut is an ordered pair of a lower set and an upper set which is inhabited ( ), rounded ( and likewise for ), disjoint ( ) and located ( ). See HoTT for more discussion of those terms and different ways of defining Dedekind cuts. (Note: This is a "temporary" definition used in the construction of complex numbers, and is intended to be used only by the construction.) (Contributed by Jim Kingdon, 25-Sep-2019.) |
Definition | df-i1p 6622* | Define the positive real constant 1. This is a "temporary" set used in the construction of complex numbers and is intended to be used only by the construction. (Contributed by Jim Kingdon, 25-Sep-2019.) |
Definition | df-iplp 6623* |
Define addition on positive reals. From Section 11.2.1 of [HoTT], p.
(varies). We write this definition to closely resemble the definition
in HoTT although some of the conditions are redundant (for example,
implies ) and can be simplified
as
shown at genpdf 6663.
This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by Jim Kingdon, 26-Sep-2019.) |
Definition | df-imp 6624* |
Define multiplication on positive reals. Here we use a simple
definition which is similar to df-iplp 6623 or the definition of
multiplication on positive reals in Metamath Proof Explorer. This is as
opposed to the more complicated definition of multiplication given in
Section 11.2.1 of [HoTT], p. (varies),
which appears to be motivated by
handling negative numbers or handling modified Dedekind cuts in which
locatedness is omitted.
This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by Jim Kingdon, 29-Sep-2019.) |
Definition | df-iltp 6625* |
Define ordering on positive reals. We define
if there is a
positive fraction which is an element of the upper cut of
and the lower cut of . From the definition of < in Section 11.2.1
of [HoTT], p. (varies).
This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by Jim Kingdon, 29-Sep-2019.) |
Theorem | npsspw 6626 | Lemma for proving existence of reals. (Contributed by Jim Kingdon, 27-Sep-2019.) |
Theorem | preqlu 6627 | Two reals are equal if and only if their lower and upper cuts are. (Contributed by Jim Kingdon, 11-Dec-2019.) |
Theorem | npex 6628 | The class of positive reals is a set. (Contributed by NM, 31-Oct-1995.) |
Theorem | elinp 6629* | Membership in positive reals. (Contributed by Jim Kingdon, 27-Sep-2019.) |
Theorem | prop 6630 | A positive real is an ordered pair of a lower cut and an upper cut. (Contributed by Jim Kingdon, 27-Sep-2019.) |
Theorem | elnp1st2nd 6631* | Membership in positive reals, using and to refer to the lower and upper cut. (Contributed by Jim Kingdon, 3-Oct-2019.) |
Theorem | prml 6632* | A positive real's lower cut is inhabited. (Contributed by Jim Kingdon, 27-Sep-2019.) |
Theorem | prmu 6633* | A positive real's upper cut is inhabited. (Contributed by Jim Kingdon, 27-Sep-2019.) |
Theorem | prssnql 6634 | A positive real's lower cut is a subset of the positive fractions. It would presumably be possible to also prove , but we only need so far. (Contributed by Jim Kingdon, 28-Sep-2019.) |
Theorem | prssnqu 6635 | A positive real's upper cut is a subset of the positive fractions. It would presumably be possible to also prove , but we only need so far. (Contributed by Jim Kingdon, 28-Sep-2019.) |
Theorem | elprnql 6636 | An element of a positive real's lower cut is a positive fraction. (Contributed by Jim Kingdon, 28-Sep-2019.) |
Theorem | elprnqu 6637 | An element of a positive real's upper cut is a positive fraction. (Contributed by Jim Kingdon, 28-Sep-2019.) |
Theorem | 0npr 6638 | The empty set is not a positive real. (Contributed by NM, 15-Nov-1995.) |
Theorem | prcdnql 6639 | A lower cut is closed downwards under the positive fractions. (Contributed by Jim Kingdon, 28-Sep-2019.) |
Theorem | prcunqu 6640 | An upper cut is closed upwards under the positive fractions. (Contributed by Jim Kingdon, 25-Nov-2019.) |
Theorem | prubl 6641 | A positive fraction not in a lower cut is an upper bound. (Contributed by Jim Kingdon, 29-Sep-2019.) |
Theorem | prltlu 6642 | An element of a lower cut is less than an element of the corresponding upper cut. (Contributed by Jim Kingdon, 15-Oct-2019.) |
Theorem | prnmaxl 6643* | A lower cut has no largest member. (Contributed by Jim Kingdon, 29-Sep-2019.) |
Theorem | prnminu 6644* | An upper cut has no smallest member. (Contributed by Jim Kingdon, 7-Nov-2019.) |
Theorem | prnmaddl 6645* | A lower cut has no largest member. Addition version. (Contributed by Jim Kingdon, 29-Sep-2019.) |
Theorem | prloc 6646 | A Dedekind cut is located. (Contributed by Jim Kingdon, 23-Oct-2019.) |
Theorem | prdisj 6647 | A Dedekind cut is disjoint. (Contributed by Jim Kingdon, 15-Dec-2019.) |
Theorem | prarloclemlt 6648 | Two possible ways of contracting an interval which straddles a Dedekind cut. Lemma for prarloc 6658. (Contributed by Jim Kingdon, 10-Nov-2019.) |
Theorem | prarloclemlo 6649* | Contracting the lower side of an interval which straddles a Dedekind cut. Lemma for prarloc 6658. (Contributed by Jim Kingdon, 10-Nov-2019.) |
+_{Q0} ~_{Q0} ·_{Q0} +_{Q0} ~_{Q0} ·_{Q0} | ||
Theorem | prarloclemup 6650 | Contracting the upper side of an interval which straddles a Dedekind cut. Lemma for prarloc 6658. (Contributed by Jim Kingdon, 10-Nov-2019.) |
+_{Q0} ~_{Q0} ·_{Q0} +_{Q0} ~_{Q0} ·_{Q0} | ||
Theorem | prarloclem3step 6651* | Induction step for prarloclem3 6652. (Contributed by Jim Kingdon, 9-Nov-2019.) |
+_{Q0} ~_{Q0} ·_{Q0} +_{Q0} ~_{Q0} ·_{Q0} | ||
Theorem | prarloclem3 6652* | Contracting an interval which straddles a Dedekind cut. Lemma for prarloc 6658. (Contributed by Jim Kingdon, 27-Oct-2019.) |
+_{Q0} ~_{Q0} ·_{Q0} +_{Q0} ~_{Q0} ·_{Q0} | ||
Theorem | prarloclem4 6653* | A slight rearrangement of prarloclem3 6652. Lemma for prarloc 6658. (Contributed by Jim Kingdon, 4-Nov-2019.) |
+_{Q0} ~_{Q0} ·_{Q0} +_{Q0} ~_{Q0} ·_{Q0} | ||
Theorem | prarloclemn 6654* | Subtracting two from a positive integer. Lemma for prarloc 6658. (Contributed by Jim Kingdon, 5-Nov-2019.) |
Theorem | prarloclem5 6655* | A substitution of zero for and minus two for . Lemma for prarloc 6658. (Contributed by Jim Kingdon, 4-Nov-2019.) |
+_{Q0} ~_{Q0} ·_{Q0} | ||
Theorem | prarloclem 6656* | A special case of Lemma 6.16 from [BauerTaylor], p. 32. Given evenly spaced rational numbers from to (which are in the lower and upper cuts, respectively, of a real number), there are a pair of numbers, two positions apart in the even spacing, which straddle the cut. (Contributed by Jim Kingdon, 22-Oct-2019.) |
+_{Q0} ~_{Q0} ·_{Q0} | ||
Theorem | prarloclemcalc 6657 | Some calculations for prarloc 6658. (Contributed by Jim Kingdon, 26-Oct-2019.) |
+_{Q0} ~_{Q0} ·_{Q0} | ||
Theorem | prarloc 6658* |
A Dedekind cut is arithmetically located. Part of Proposition 11.15 of
[BauerTaylor], p. 52, slightly
modified. It states that given a
tolerance ,
there are elements of the lower and upper cut which
are within that tolerance of each other.
Usually, proofs will be shorter if they use prarloc2 6659 instead. (Contributed by Jim Kingdon, 22-Oct-2019.) |
Theorem | prarloc2 6659* | A Dedekind cut is arithmetically located. This is a variation of prarloc 6658 which only constructs one (named) point and is therefore often easier to work with. It states that given a tolerance , there are elements of the lower and upper cut which are exactly that tolerance from each other. (Contributed by Jim Kingdon, 26-Dec-2019.) |
Theorem | ltrelpr 6660 | Positive real 'less than' is a relation on positive reals. (Contributed by NM, 14-Feb-1996.) |
Theorem | ltdfpr 6661* | More convenient form of df-iltp 6625. (Contributed by Jim Kingdon, 15-Dec-2019.) |
Theorem | genpdflem 6662* | Simplification of upper or lower cut expression. Lemma for genpdf 6663. (Contributed by Jim Kingdon, 30-Sep-2019.) |
Theorem | genpdf 6663* | Simplified definition of addition or multiplication on positive reals. (Contributed by Jim Kingdon, 30-Sep-2019.) |
Theorem | genipv 6664* | Value of general operation (addition or multiplication) on positive reals. (Contributed by Jim Kingon, 3-Oct-2019.) |
Theorem | genplt2i 6665* | Operating on both sides of two inequalities, when the operation is consistent with . (Contributed by Jim Kingdon, 6-Oct-2019.) |
Theorem | genpelxp 6666* | Set containing the result of adding or multiplying positive reals. (Contributed by Jim Kingdon, 5-Dec-2019.) |
Theorem | genpelvl 6667* | Membership in lower cut of general operation (addition or multiplication) on positive reals. (Contributed by Jim Kingdon, 2-Oct-2019.) |
Theorem | genpelvu 6668* | Membership in upper cut of general operation (addition or multiplication) on positive reals. (Contributed by Jim Kingdon, 15-Oct-2019.) |
Theorem | genpprecll 6669* | Pre-closure law for general operation on lower cuts. (Contributed by Jim Kingdon, 2-Oct-2019.) |
Theorem | genppreclu 6670* | Pre-closure law for general operation on upper cuts. (Contributed by Jim Kingdon, 7-Nov-2019.) |
Theorem | genipdm 6671* | Domain of general operation on positive reals. (Contributed by Jim Kingdon, 2-Oct-2019.) |
Theorem | genpml 6672* | The lower cut produced by addition or multiplication on positive reals is inhabited. (Contributed by Jim Kingdon, 5-Oct-2019.) |
Theorem | genpmu 6673* | The upper cut produced by addition or multiplication on positive reals is inhabited. (Contributed by Jim Kingdon, 5-Dec-2019.) |
Theorem | genpcdl 6674* | Downward closure of an operation on positive reals. (Contributed by Jim Kingdon, 14-Oct-2019.) |
Theorem | genpcuu 6675* | Upward closure of an operation on positive reals. (Contributed by Jim Kingdon, 8-Nov-2019.) |
Theorem | genprndl 6676* | The lower cut produced by addition or multiplication on positive reals is rounded. (Contributed by Jim Kingdon, 7-Oct-2019.) |
Theorem | genprndu 6677* | The upper cut produced by addition or multiplication on positive reals is rounded. (Contributed by Jim Kingdon, 7-Oct-2019.) |
Theorem | genpdisj 6678* | The lower and upper cuts produced by addition or multiplication on positive reals are disjoint. (Contributed by Jim Kingdon, 15-Oct-2019.) |
Theorem | genpassl 6679* | Associativity of lower cuts. Lemma for genpassg 6681. (Contributed by Jim Kingdon, 11-Dec-2019.) |
Theorem | genpassu 6680* | Associativity of upper cuts. Lemma for genpassg 6681. (Contributed by Jim Kingdon, 11-Dec-2019.) |
Theorem | genpassg 6681* | Associativity of an operation on reals. (Contributed by Jim Kingdon, 11-Dec-2019.) |
Theorem | addnqprllem 6682 | Lemma to prove downward closure in positive real addition. (Contributed by Jim Kingdon, 7-Dec-2019.) |
Theorem | addnqprulem 6683 | Lemma to prove upward closure in positive real addition. (Contributed by Jim Kingdon, 7-Dec-2019.) |
Theorem | addnqprl 6684 | Lemma to prove downward closure in positive real addition. (Contributed by Jim Kingdon, 5-Dec-2019.) |
Theorem | addnqpru 6685 | Lemma to prove upward closure in positive real addition. (Contributed by Jim Kingdon, 5-Dec-2019.) |
Theorem | addlocprlemlt 6686 | Lemma for addlocpr 6691. The case. (Contributed by Jim Kingdon, 6-Dec-2019.) |
Theorem | addlocprlemeqgt 6687 | Lemma for addlocpr 6691. This is a step used in both the and cases. (Contributed by Jim Kingdon, 7-Dec-2019.) |
Theorem | addlocprlemeq 6688 | Lemma for addlocpr 6691. The case. (Contributed by Jim Kingdon, 6-Dec-2019.) |
Theorem | addlocprlemgt 6689 | Lemma for addlocpr 6691. The case. (Contributed by Jim Kingdon, 6-Dec-2019.) |
Theorem | addlocprlem 6690 | Lemma for addlocpr 6691. The result, in deduction form. (Contributed by Jim Kingdon, 6-Dec-2019.) |
Theorem | addlocpr 6691* | Locatedness of addition on positive reals. Lemma 11.16 in [BauerTaylor], p. 53. The proof in BauerTaylor relies on signed rationals, so we replace it with another proof which applies prarloc 6658 to both and , and uses nqtri3or 6551 rather than prloc 6646 to decide whether is too big to be in the lower cut of (and deduce that if it is, then must be in the upper cut). What the two proofs have in common is that they take the difference between and to determine how tight a range they need around the real numbers. (Contributed by Jim Kingdon, 5-Dec-2019.) |
Theorem | addclpr 6692 | Closure of addition on positive reals. First statement of Proposition 9-3.5 of [Gleason] p. 123. Combination of Lemma 11.13 and Lemma 11.16 in [BauerTaylor], p. 53. (Contributed by NM, 13-Mar-1996.) |
Theorem | plpvlu 6693* | Value of addition on positive reals. (Contributed by Jim Kingdon, 8-Dec-2019.) |
Theorem | mpvlu 6694* | Value of multiplication on positive reals. (Contributed by Jim Kingdon, 8-Dec-2019.) |
Theorem | dmplp 6695 | Domain of addition on positive reals. (Contributed by NM, 18-Nov-1995.) |
Theorem | dmmp 6696 | Domain of multiplication on positive reals. (Contributed by NM, 18-Nov-1995.) |
Theorem | nqprm 6697* | A cut produced from a rational is inhabited. Lemma for nqprlu 6702. (Contributed by Jim Kingdon, 8-Dec-2019.) |
Theorem | nqprrnd 6698* | A cut produced from a rational is rounded. Lemma for nqprlu 6702. (Contributed by Jim Kingdon, 8-Dec-2019.) |
Theorem | nqprdisj 6699* | A cut produced from a rational is disjoint. Lemma for nqprlu 6702. (Contributed by Jim Kingdon, 8-Dec-2019.) |
Theorem | nqprloc 6700* | A cut produced from a rational is located. Lemma for nqprlu 6702. (Contributed by Jim Kingdon, 8-Dec-2019.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |