Home | Intuitionistic Logic Explorer Theorem List (p. 101 of 135) | < 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 | fzosubel 10001 | Translate membership in a half-open integer range. (Contributed by Stefan O'Rear, 15-Aug-2015.) |
..^ ..^ | ||
Theorem | fzosubel2 10002 | Membership in a translated half-open integer range implies translated membership in the original range. (Contributed by Stefan O'Rear, 15-Aug-2015.) |
..^ ..^ | ||
Theorem | fzosubel3 10003 | Membership in a translated half-open integer range when the original range is zero-based. (Contributed by Stefan O'Rear, 15-Aug-2015.) |
..^ ..^ | ||
Theorem | eluzgtdifelfzo 10004 | Membership of the difference of integers in a half-open range of nonnegative integers. (Contributed by Alexander van der Vekens, 17-Sep-2018.) |
..^ | ||
Theorem | ige2m2fzo 10005 | Membership of an integer greater than 1 decreased by 2 in a half-open range of nonnegative integers. (Contributed by Alexander van der Vekens, 3-Oct-2018.) |
..^ | ||
Theorem | fzocatel 10006 | Translate membership in a half-open integer range. (Contributed by Thierry Arnoux, 28-Sep-2018.) |
..^ ..^ ..^ | ||
Theorem | ubmelfzo 10007 | If an integer in a 1 based finite set of sequential integers is subtracted from the upper bound of this finite set of sequential integers, the result is contained in a half-open range of nonnegative integers with the same upper bound. (Contributed by AV, 18-Mar-2018.) (Revised by AV, 30-Oct-2018.) |
..^ | ||
Theorem | elfzodifsumelfzo 10008 | If an integer is in a half-open range of nonnegative integers with a difference as upper bound, the sum of the integer with the subtrahend of the difference is in the a half-open range of nonnegative integers containing the minuend of the difference. (Contributed by AV, 13-Nov-2018.) |
..^ ..^ | ||
Theorem | elfzom1elp1fzo 10009 | Membership of an integer incremented by one in a half-open range of nonnegative integers. (Contributed by Alexander van der Vekens, 24-Jun-2018.) (Proof shortened by AV, 5-Jan-2020.) |
..^ ..^ | ||
Theorem | elfzom1elfzo 10010 | Membership in a half-open range of nonnegative integers. (Contributed by Alexander van der Vekens, 18-Jun-2018.) |
..^ ..^ | ||
Theorem | fzval3 10011 | Expressing a closed integer range as a half-open integer range. (Contributed by Stefan O'Rear, 15-Aug-2015.) |
..^ | ||
Theorem | fzosn 10012 | Expressing a singleton as a half-open range. (Contributed by Stefan O'Rear, 23-Aug-2015.) |
..^ | ||
Theorem | elfzomin 10013 | Membership of an integer in the smallest open range of integers. (Contributed by Alexander van der Vekens, 22-Sep-2018.) |
..^ | ||
Theorem | zpnn0elfzo 10014 | Membership of an integer increased by a nonnegative integer in a half- open integer range. (Contributed by Alexander van der Vekens, 22-Sep-2018.) |
..^ | ||
Theorem | zpnn0elfzo1 10015 | Membership of an integer increased by a nonnegative integer in a half- open integer range. (Contributed by Alexander van der Vekens, 22-Sep-2018.) |
..^ | ||
Theorem | fzosplitsnm1 10016 | Removing a singleton from a half-open integer range at the end. (Contributed by Alexander van der Vekens, 23-Mar-2018.) |
..^ ..^ | ||
Theorem | elfzonlteqm1 10017 | If an element of a half-open integer range is not less than the upper bound of the range decreased by 1, it must be equal to the upper bound of the range decreased by 1. (Contributed by AV, 3-Nov-2018.) |
..^ | ||
Theorem | fzonn0p1 10018 | A nonnegative integer is element of the half-open range of nonnegative integers with the element increased by one as an upper bound. (Contributed by Alexander van der Vekens, 5-Aug-2018.) |
..^ | ||
Theorem | fzossfzop1 10019 | A half-open range of nonnegative integers is a subset of a half-open range of nonnegative integers with the upper bound increased by one. (Contributed by Alexander van der Vekens, 5-Aug-2018.) |
..^ ..^ | ||
Theorem | fzonn0p1p1 10020 | If a nonnegative integer is element of a half-open range of nonnegative integers, increasing this integer by one results in an element of a half- open range of nonnegative integers with the upper bound increased by one. (Contributed by Alexander van der Vekens, 5-Aug-2018.) |
..^ ..^ | ||
Theorem | elfzom1p1elfzo 10021 | Increasing an element of a half-open range of nonnegative integers by 1 results in an element of the half-open range of nonnegative integers with an upper bound increased by 1. (Contributed by Alexander van der Vekens, 1-Aug-2018.) |
..^ ..^ | ||
Theorem | fzo0ssnn0 10022 | Half-open integer ranges starting with 0 are subsets of NN0. (Contributed by Thierry Arnoux, 8-Oct-2018.) |
..^ | ||
Theorem | fzo01 10023 | Expressing the singleton of as a half-open integer range. (Contributed by Stefan O'Rear, 15-Aug-2015.) |
..^ | ||
Theorem | fzo12sn 10024 | A 1-based half-open integer interval up to, but not including, 2 is a singleton. (Contributed by Alexander van der Vekens, 31-Jan-2018.) |
..^ | ||
Theorem | fzo0to2pr 10025 | A half-open integer range from 0 to 2 is an unordered pair. (Contributed by Alexander van der Vekens, 4-Dec-2017.) |
..^ | ||
Theorem | fzo0to3tp 10026 | A half-open integer range from 0 to 3 is an unordered triple. (Contributed by Alexander van der Vekens, 9-Nov-2017.) |
..^ | ||
Theorem | fzo0to42pr 10027 | A half-open integer range from 0 to 4 is a union of two unordered pairs. (Contributed by Alexander van der Vekens, 17-Nov-2017.) |
..^ | ||
Theorem | fzo0sn0fzo1 10028 | A half-open range of nonnegative integers is the union of the singleton set containing 0 and a half-open range of positive integers. (Contributed by Alexander van der Vekens, 18-May-2018.) |
..^ ..^ | ||
Theorem | fzoend 10029 | The endpoint of a half-open integer range. (Contributed by Mario Carneiro, 29-Sep-2015.) |
..^ ..^ | ||
Theorem | fzo0end 10030 | The endpoint of a zero-based half-open range. (Contributed by Stefan O'Rear, 27-Aug-2015.) (Revised by Mario Carneiro, 29-Sep-2015.) |
..^ | ||
Theorem | ssfzo12 10031 | Subset relationship for half-open integer ranges. (Contributed by Alexander van der Vekens, 16-Mar-2018.) |
..^ ..^ | ||
Theorem | ssfzo12bi 10032 | Subset relationship for half-open integer ranges. (Contributed by Alexander van der Vekens, 5-Nov-2018.) |
..^ ..^ | ||
Theorem | ubmelm1fzo 10033 | 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 10034 | 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 10035 | 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 10036 | 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 10037 | 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 10038 | 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 10039 | A Peano-postulate-like theorem for downward closure of a half-open integer range. (Contributed by Mario Carneiro, 1-Oct-2015.) |
..^ ..^ | ||
Theorem | fzosplitsn 10040 | Extending a half-open range by a singleton on the end. (Contributed by Stefan O'Rear, 23-Aug-2015.) |
..^ ..^ | ||
Theorem | fzosplitprm1 10041 | Extending a half-open integer range by an unordered pair at the end. (Contributed by Alexander van der Vekens, 22-Sep-2018.) |
..^ ..^ | ||
Theorem | fzosplitsni 10042 | Membership in a half-open range extended by a singleton. (Contributed by Stefan O'Rear, 23-Aug-2015.) |
..^ ..^ | ||
Theorem | fzisfzounsn 10043 | 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 10044 | 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 10045* | Shift the scanning order inside of a quantification over a half-open integer range, analogous to fzshftral 9918. (Contributed by Alexander van der Vekens, 23-Sep-2018.) |
..^ ..^ | ||
Theorem | fzind2 10046* | 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 9189 using integer range definitions. (Contributed by Mario Carneiro, 6-Feb-2016.) |
..^ | ||
Theorem | exfzdc 10047* | Decidability of the existence of an integer defined by a decidable proposition. (Contributed by Jim Kingdon, 28-Jan-2022.) |
DECID DECID | ||
Theorem | fvinim0ffz 10048 | 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 10049 | 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 10050 | Rational trichotomy. (Contributed by Jim Kingdon, 6-Oct-2021.) |
Theorem | qletric 10051 | Rational trichotomy. (Contributed by Jim Kingdon, 6-Oct-2021.) |
Theorem | qlelttric 10052 | Rational trichotomy. (Contributed by Jim Kingdon, 7-Oct-2021.) |
Theorem | qltnle 10053 | 'Less than' expressed in terms of 'less than or equal to'. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | qdceq 10054 | Equality of rationals is decidable. (Contributed by Jim Kingdon, 11-Oct-2021.) |
DECID | ||
Theorem | exbtwnzlemstep 10055* | Lemma for exbtwnzlemex 10057. Induction step. (Contributed by Jim Kingdon, 10-May-2022.) |
Theorem | exbtwnzlemshrink 10056* | Lemma for exbtwnzlemex 10057. Shrinking the range around . (Contributed by Jim Kingdon, 10-May-2022.) |
Theorem | exbtwnzlemex 10057* |
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 10058* | 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 10059* | There is a unique greatest integer less than or equal to a rational number. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | rebtwn2zlemstep 10060* | Lemma for rebtwn2z 10062. Induction step. (Contributed by Jim Kingdon, 13-Oct-2021.) |
Theorem | rebtwn2zlemshrink 10061* | Lemma for rebtwn2z 10062. Shrinking the range around the given real number. (Contributed by Jim Kingdon, 13-Oct-2021.) |
Theorem | rebtwn2z 10062* |
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 10063 | Lemma for qbtwnre 10064. Calculations involved in showing the constructed rational number is less than . (Contributed by Jim Kingdon, 14-Oct-2021.) |
Theorem | qbtwnre 10064* | 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 10065* | 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 10066 | 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 10067 | An empty open interval of extended reals. (Contributed by NM, 6-Feb-2007.) |
Theorem | ioom 10068* | 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 10069 | An empty open interval of extended reals. (Contributed by FL, 30-May-2014.) |
Theorem | ioc0 10070 | An empty open interval of extended reals. (Contributed by FL, 30-May-2014.) |
Syntax | cfl 10071 | Extend class notation with floor (greatest integer) function. |
Syntax | cceil 10072 | Extend class notation to include the ceiling function. |
⌈ | ||
Definition | df-fl 10073* |
Define the floor (greatest integer less than or equal to) function. See
flval 10075 for its value, flqlelt 10079 for its basic property, and flqcl 10076 for
its closure. For example, while
(ex-fl 13106).
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 10074 |
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 10109 for its value, ceilqge 10113 and ceilqm1lt 10115 for its basic
properties, and ceilqcl 10111 for its closure. For example,
⌈ while ⌈
(ex-ceil 13107).
As described in df-fl 10073 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 10075* | 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 10076 | 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 10078. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | apbtwnz 10077* | 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 10078* | 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 11892) would satisfy this condition. (Contributed by Jim Kingdon, 11-May-2022.) |
# | ||
Theorem | flqlelt 10079 | A basic property of the floor (greatest integer) function. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqcld 10080 | The floor (greatest integer) function is an integer (closure law). (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqle 10081 | A basic property of the floor (greatest integer) function. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqltp1 10082 | A basic property of the floor (greatest integer) function. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | qfraclt1 10083 | The fractional part of a rational number is less than one. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | qfracge0 10084 | The fractional part of a rational number is nonnegative. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqge 10085 | The floor function value is the greatest integer less than or equal to its argument. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqlt 10086 | The floor function value is less than the next integer. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flid 10087 | An integer is its own floor. (Contributed by NM, 15-Nov-2004.) |
Theorem | flqidm 10088 | The floor function is idempotent. (Contributed by Jim Kingdon, 8-Oct-2021.) |
Theorem | flqidz 10089 | A rational number equals its floor iff it is an integer. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | flqltnz 10090 | If A is not an integer, then the floor of A is less than A. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | flqwordi 10091 | Ordering relationship for the greatest integer function. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | flqword2 10092 | Ordering relationship for the greatest integer function. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | flqbi 10093 | A condition equivalent to floor. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | flqbi2 10094 | A condition equivalent to floor. (Contributed by Jim Kingdon, 9-Oct-2021.) |
Theorem | adddivflid 10095 | 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 10096 | The floor of a number greater than or equal to 0 is a nonnegative integer. (Contributed by Jim Kingdon, 10-Oct-2021.) |
Theorem | flqge1nn 10097 | The floor of a number greater than or equal to 1 is a positive integer. (Contributed by Jim Kingdon, 10-Oct-2021.) |
Theorem | fldivnn0 10098 | 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 10099 | The floor of a fraction is 0 iff the denominator is less than the numerator. (Contributed by AV, 8-Jul-2021.) |
Theorem | flqaddz 10100 | An integer can be moved in and out of the floor of a sum. (Contributed by Jim Kingdon, 10-Oct-2021.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |