Home | Intuitionistic Logic Explorer Theorem List (p. 97 of 116) | < 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 | ssfzo12bi 9601 | Subset relationship for half-open integer ranges. (Contributed by Alexander van der Vekens, 5-Nov-2018.) |
..^ ..^ | ||
Theorem | ubmelm1fzo 9602 | The result of subtracting 1 and an integer of a half-open range of nonnegative integers from the upper bound of this range is contained in this range. (Contributed by AV, 23-Mar-2018.) (Revised by AV, 30-Oct-2018.) |
..^ ..^ | ||
Theorem | fzofzp1 9603 | If a point is in a half-open range, the next point is in the closed range. (Contributed by Stefan O'Rear, 23-Aug-2015.) |
..^ | ||
Theorem | fzofzp1b 9604 | If a point is in a half-open range, the next point is in the closed range. (Contributed by Mario Carneiro, 27-Sep-2015.) |
..^ | ||
Theorem | elfzom1b 9605 | An integer is a member of a 1-based finite set of sequential integers iff its predecessor is a member of the corresponding 0-based set. (Contributed by Mario Carneiro, 27-Sep-2015.) |
..^ ..^ | ||
Theorem | elfzonelfzo 9606 | If an element of a half-open integer range is not contained in the lower subrange, it must be in the upper subrange. (Contributed by Alexander van der Vekens, 30-Mar-2018.) |
..^ ..^ ..^ | ||
Theorem | elfzomelpfzo 9607 | An integer increased by another integer is an element of a half-open integer range if and only if the integer is contained in the half-open integer range with bounds decreased by the other integer. (Contributed by Alexander van der Vekens, 30-Mar-2018.) |
..^ ..^ | ||
Theorem | peano2fzor 9608 | A Peano-postulate-like theorem for downward closure of a half-open integer range. (Contributed by Mario Carneiro, 1-Oct-2015.) |
..^ ..^ | ||
Theorem | fzosplitsn 9609 | Extending a half-open range by a singleton on the end. (Contributed by Stefan O'Rear, 23-Aug-2015.) |
..^ ..^ | ||
Theorem | fzosplitprm1 9610 | Extending a half-open integer range by an unordered pair at the end. (Contributed by Alexander van der Vekens, 22-Sep-2018.) |
..^ ..^ | ||
Theorem | fzosplitsni 9611 | Membership in a half-open range extended by a singleton. (Contributed by Stefan O'Rear, 23-Aug-2015.) |
..^ ..^ | ||
Theorem | fzisfzounsn 9612 | A finite interval of integers as union of a half-open integer range and a singleton. (Contributed by Alexander van der Vekens, 15-Jun-2018.) |
..^ | ||
Theorem | fzostep1 9613 | Two possibilities for a number one greater than a number in a half-open range. (Contributed by Stefan O'Rear, 23-Aug-2015.) |
..^ ..^ | ||
Theorem | fzoshftral 9614* | Shift the scanning order inside of a quantification over a half-open integer range, analogous to fzshftral 9489. (Contributed by Alexander van der Vekens, 23-Sep-2018.) |
..^ ..^ | ||
Theorem | fzind2 9615* | Induction on the integers from to inclusive. The first four hypotheses give us the substitution instances we need; the last two are the basis and the induction step. Version of fzind 8831 using integer range definitions. (Contributed by Mario Carneiro, 6-Feb-2016.) |
..^ | ||
Theorem | exfzdc 9616* | Decidability of the existence of an integer defined by a decidable proposition. (Contributed by Jim Kingdon, 28-Jan-2022.) |
DECID DECID | ||
Theorem | fvinim0ffz 9617 | The function values for the borders of a finite interval of integers, which is the domain of the function, are not in the image of the interior of the interval iff the intersection of the images of the interior and the borders is empty. (Contributed by Alexander van der Vekens, 31-Oct-2017.) (Revised by AV, 5-Feb-2021.) |
..^ ..^ ..^ | ||
Theorem | subfzo0 9618 | The difference between two elements in a half-open range of nonnegative integers is greater than the negation of the upper bound and less than the upper bound of the range. (Contributed by AV, 20-Mar-2021.) |
..^ ..^ | ||
Theorem | qtri3or 9619 | Rational trichotomy. (Contributed by Jim Kingdon, 6-Oct-2021.) |
Theorem | qletric 9620 | Rational trichotomy. (Contributed by Jim Kingdon, 6-Oct-2021.) |
Theorem | qlelttric 9621 | Rational trichotomy. (Contributed by Jim Kingdon, 7-Oct-2021.) |
Theorem | qltnle 9622 | 'Less than' expressed in terms of 'less than or equal to'. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | qdceq 9623 | Equality of rationals is decidable. (Contributed by Jim Kingdon, 11-Oct-2021.) |
DECID | ||
Theorem | exbtwnzlemstep 9624* | Lemma for exbtwnzlemex 9626. Induction step. (Contributed by Jim Kingdon, 10-May-2022.) |
Theorem | exbtwnzlemshrink 9625* | Lemma for exbtwnzlemex 9626. Shrinking the range around . (Contributed by Jim Kingdon, 10-May-2022.) |
Theorem | exbtwnzlemex 9626* |
Existence of an integer so that a given real number is between the
integer and its successor. The real number must satisfy the
hypothesis. For example
either a rational number or
a number which is irrational (in the sense of being apart from any
rational number) will meet this condition.
The proof starts by finding two integers which are less than and greater than . Then this range can be shrunk by choosing an integer in between the endpoints of the range and then deciding which half of the range to keep based on the hypothesis, and iterating until the range consists of two consecutive integers. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | exbtwnz 9627* | If a real number is between an integer and its successor, there is a unique greatest integer less than or equal to the real number. (Contributed by Jim Kingdon, 10-May-2022.) |
Theorem | qbtwnz 9628* | There is a unique greatest integer less than or equal to a rational number. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | rebtwn2zlemstep 9629* | Lemma for rebtwn2z 9631. Induction step. (Contributed by Jim Kingdon, 13-Oct-2021.) |
Theorem | rebtwn2zlemshrink 9630* | Lemma for rebtwn2z 9631. Shrinking the range around the given real number. (Contributed by Jim Kingdon, 13-Oct-2021.) |
Theorem | rebtwn2z 9631* |
A real number can be bounded by integers above and below which are two
apart.
The proof starts by finding two integers which are less than and greater than the given real number. Then this range can be shrunk by choosing an integer in between the endpoints of the range and then deciding which half of the range to keep based on weak linearity, and iterating until the range consists of integers which are two apart. (Contributed by Jim Kingdon, 13-Oct-2021.) |
Theorem | qbtwnrelemcalc 9632 | Lemma for qbtwnre 9633. Calculations involved in showing the constructed rational number is less than . (Contributed by Jim Kingdon, 14-Oct-2021.) |
Theorem | qbtwnre 9633* | The rational numbers are dense in : any two real numbers have a rational between them. Exercise 6 of [Apostol] p. 28. (Contributed by NM, 18-Nov-2004.) |
Theorem | qbtwnxr 9634* | The rational numbers are dense in : any two extended real numbers have a rational between them. (Contributed by NM, 6-Feb-2007.) (Proof shortened by Mario Carneiro, 23-Aug-2015.) |
Theorem | qavgle 9635 | The average of two rational numbers is less than or equal to at least one of them. (Contributed by Jim Kingdon, 3-Nov-2021.) |
Theorem | ioo0 9636 | An empty open interval of extended reals. (Contributed by NM, 6-Feb-2007.) |
Theorem | ioom 9637* | An open interval of extended reals is inhabited iff the lower argument is less than the upper argument. (Contributed by Jim Kingdon, 27-Nov-2021.) |
Theorem | ico0 9638 | An empty open interval of extended reals. (Contributed by FL, 30-May-2014.) |
Theorem | ioc0 9639 | An empty open interval of extended reals. (Contributed by FL, 30-May-2014.) |
Syntax | cfl 9640 | Extend class notation with floor (greatest integer) function. |
Syntax | cceil 9641 | Extend class notation to include the ceiling function. |
⌈ | ||
Definition | df-fl 9642* |
Define the floor (greatest integer less than or equal to) function. See
flval 9644 for its value, flqlelt 9648 for its basic property, and flqcl 9645 for
its closure. For example, while
(ex-fl 11309).
Although we define this on real numbers so that notations are similar to the Metamath Proof Explorer, in the absence of excluded middle few theorems will be possible for all real numbers. Imagine a real number which is around 2.99995 or 3.00001 . In order to determine whether its floor is 2 or 3, it would be necessary to compute the number to arbitrary precision. The term "floor" was coined by Ken Iverson. He also invented a mathematical notation for floor, consisting of an L-shaped left bracket and its reflection as a right bracket. In APL, the left-bracket alone is used, and we borrow this idea. (Thanks to Paul Chapman for this information.) (Contributed by NM, 14-Nov-2004.) |
Definition | df-ceil 9643 |
The ceiling (least integer greater than or equal to) function. Defined in
ISO 80000-2:2009(E) operation 2-9.18 and the "NIST Digital Library of
Mathematical Functions" , front introduction, "Common Notations
and
Definitions" section at http://dlmf.nist.gov/front/introduction#Sx4.
See ceilqval 9678 for its value, ceilqge 9682 and ceilqm1lt 9684 for its basic
properties, and ceilqcl 9680 for its closure. For example,
⌈ while ⌈
(ex-ceil 11310).
As described in df-fl 9642 most theorems are only for rationals, not reals. The symbol ⌈ is inspired by the gamma shaped left bracket of the usual notation. (Contributed by David A. Wheeler, 19-May-2015.) |
⌈ | ||
Theorem | flval 9644* | Value of the floor (greatest integer) function. The floor of is the (unique) integer less than or equal to whose successor is strictly greater than . (Contributed by NM, 14-Nov-2004.) (Revised by Mario Carneiro, 2-Nov-2013.) |
Theorem | flqcl 9645 | The floor (greatest integer) function yields an integer when applied to a rational (closure law). For a similar closure law for real numbers apart from any integer, see flapcl 9647. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | apbtwnz 9646* | There is a unique greatest integer less than or equal to a real number which is apart from all integers. (Contributed by Jim Kingdon, 11-May-2022.) |
# | ||
Theorem | flapcl 9647* | The floor (greatest integer) function yields an integer when applied to a real number apart from any integer. For example, an irrational number (see for example sqrt2irrap 11251) would satisfy this condition. (Contributed by Jim Kingdon, 11-May-2022.) |
# | ||
Theorem | flqlelt 9648 | A basic property of the floor (greatest integer) function. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqcld 9649 | The floor (greatest integer) function is an integer (closure law). (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqle 9650 | A basic property of the floor (greatest integer) function. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqltp1 9651 | A basic property of the floor (greatest integer) function. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | qfraclt1 9652 | The fractional part of a rational number is less than one. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | qfracge0 9653 | The fractional part of a rational number is nonnegative. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqge 9654 | The floor function value is the greatest integer less than or equal to its argument. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqlt 9655 | The floor function value is less than the next integer. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flid 9656 | An integer is its own floor. (Contributed by NM, 15-Nov-2004.) |
Theorem | flqidm 9657 | The floor function is idempotent. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqidz 9658 | A rational number equals its floor iff it is an integer. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | flqltnz 9659 | If A is not an integer, then the floor of A is less than A. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | flqwordi 9660 | Ordering relationship for the greatest integer function. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | flqword2 9661 | Ordering relationship for the greatest integer function. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | flqbi 9662 | A condition equivalent to floor. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | flqbi2 9663 | A condition equivalent to floor. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | adddivflid 9664 | The floor of a sum of an integer and a fraction is equal to the integer iff the denominator of the fraction is less than the numerator. (Contributed by AV, 14-Jul-2021.) |
Theorem | flqge0nn0 9665 | The floor of a number greater than or equal to 0 is a nonnegative integer. (Contributed by Jim Kingdon, 10-Oct-2021.) |
Theorem | flqge1nn 9666 | The floor of a number greater than or equal to 1 is a positive integer. (Contributed by Jim Kingdon, 10-Oct-2021.) |
Theorem | fldivnn0 9667 | The floor function of a division of a nonnegative integer by a positive integer is a nonnegative integer. (Contributed by Alexander van der Vekens, 14-Apr-2018.) |
Theorem | divfl0 9668 | The floor of a fraction is 0 iff the denominator is less than the numerator. (Contributed by AV, 8-Jul-2021.) |
Theorem | flqaddz 9669 | An integer can be moved in and out of the floor of a sum. (Contributed by Jim Kingdon, 10-Oct-2021.) |
Theorem | flqzadd 9670 | An integer can be moved in and out of the floor of a sum. (Contributed by Jim Kingdon, 10-Oct-2021.) |
Theorem | flqmulnn0 9671 | Move a nonnegative integer in and out of a floor. (Contributed by Jim Kingdon, 10-Oct-2021.) |
Theorem | btwnzge0 9672 | A real bounded between an integer and its successor is nonnegative iff the integer is nonnegative. Second half of Lemma 13-4.1 of [Gleason] p. 217. (Contributed by NM, 12-Mar-2005.) |
Theorem | 2tnp1ge0ge0 9673 | Two times an integer plus one is not negative iff the integer is not negative. (Contributed by AV, 19-Jun-2021.) |
Theorem | flhalf 9674 | Ordering relation for the floor of half of an integer. (Contributed by NM, 1-Jan-2006.) (Proof shortened by Mario Carneiro, 7-Jun-2016.) |
Theorem | fldivnn0le 9675 | The floor function of a division of a nonnegative integer by a positive integer is less than or equal to the division. (Contributed by Alexander van der Vekens, 14-Apr-2018.) |
Theorem | flltdivnn0lt 9676 | The floor function of a division of a nonnegative integer by a positive integer is less than the division of a greater dividend by the same positive integer. (Contributed by Alexander van der Vekens, 14-Apr-2018.) |
Theorem | fldiv4p1lem1div2 9677 | The floor of an integer equal to 3 or greater than 4, increased by 1, is less than or equal to the half of the integer minus 1. (Contributed by AV, 8-Jul-2021.) |
Theorem | ceilqval 9678 | The value of the ceiling function. (Contributed by Jim Kingdon, 10-Oct-2021.) |
⌈ | ||
Theorem | ceiqcl 9679 | The ceiling function returns an integer (closure law). (Contributed by Jim Kingdon, 11-Oct-2021.) |
Theorem | ceilqcl 9680 | Closure of the ceiling function. (Contributed by Jim Kingdon, 11-Oct-2021.) |
⌈ | ||
Theorem | ceiqge 9681 | The ceiling of a real number is greater than or equal to that number. (Contributed by Jim Kingdon, 11-Oct-2021.) |
Theorem | ceilqge 9682 | The ceiling of a real number is greater than or equal to that number. (Contributed by Jim Kingdon, 11-Oct-2021.) |
⌈ | ||
Theorem | ceiqm1l 9683 | One less than the ceiling of a real number is strictly less than that number. (Contributed by Jim Kingdon, 11-Oct-2021.) |
Theorem | ceilqm1lt 9684 | One less than the ceiling of a real number is strictly less than that number. (Contributed by Jim Kingdon, 11-Oct-2021.) |
⌈ | ||
Theorem | ceiqle 9685 | The ceiling of a real number is the smallest integer greater than or equal to it. (Contributed by Jim Kingdon, 11-Oct-2021.) |
Theorem | ceilqle 9686 | The ceiling of a real number is the smallest integer greater than or equal to it. (Contributed by Jim Kingdon, 11-Oct-2021.) |
⌈ | ||
Theorem | ceilid 9687 | An integer is its own ceiling. (Contributed by AV, 30-Nov-2018.) |
⌈ | ||
Theorem | ceilqidz 9688 | A rational number equals its ceiling iff it is an integer. (Contributed by Jim Kingdon, 11-Oct-2021.) |
⌈ | ||
Theorem | flqleceil 9689 | The floor of a rational number is less than or equal to its ceiling. (Contributed by Jim Kingdon, 11-Oct-2021.) |
⌈ | ||
Theorem | flqeqceilz 9690 | A rational number is an integer iff its floor equals its ceiling. (Contributed by Jim Kingdon, 11-Oct-2021.) |
⌈ | ||
Theorem | intqfrac2 9691 | Decompose a real into integer and fractional parts. (Contributed by Jim Kingdon, 18-Oct-2021.) |
Theorem | intfracq 9692 | Decompose a rational number, expressed as a ratio, into integer and fractional parts. The fractional part has a tighter bound than that of intqfrac2 9691. (Contributed by NM, 16-Aug-2008.) |
Theorem | flqdiv 9693 | Cancellation of the embedded floor of a real divided by an integer. (Contributed by Jim Kingdon, 18-Oct-2021.) |
Syntax | cmo 9694 | Extend class notation with the modulo operation. |
Definition | df-mod 9695* | Define the modulo (remainder) operation. See modqval 9696 for its value. For example, and . As with df-fl 9642 we define this for first and second arguments which are real and positive real, respectively, even though many theorems will need to be more restricted (for example, specify rational arguments). (Contributed by NM, 10-Nov-2008.) |
Theorem | modqval 9696 | The value of the modulo operation. The modulo congruence notation of number theory, (modulo ), can be expressed in our notation as . Definition 1 in Knuth, The Art of Computer Programming, Vol. I (1972), p. 38. Knuth uses "mod" for the operation and "modulo" for the congruence. Unlike Knuth, we restrict the second argument to positive numbers to simplify certain theorems. (This also gives us future flexibility to extend it to any one of several different conventions for a zero or negative second argument, should there be an advantage in doing so.) As with flqcl 9645 we only prove this for rationals although other particular kinds of real numbers may be possible. (Contributed by Jim Kingdon, 16-Oct-2021.) |
Theorem | modqvalr 9697 | The value of the modulo operation (multiplication in reversed order). (Contributed by Jim Kingdon, 16-Oct-2021.) |
Theorem | modqcl 9698 | Closure law for the modulo operation. (Contributed by Jim Kingdon, 16-Oct-2021.) |
Theorem | flqpmodeq 9699 | Partition of a division into its integer part and the remainder. (Contributed by Jim Kingdon, 16-Oct-2021.) |
Theorem | modqcld 9700 | Closure law for the modulo operation. (Contributed by Jim Kingdon, 16-Oct-2021.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |