HomeHome Intuitionistic Logic Explorer
Theorem List (p. 98 of 132)
< 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 - 9701-9800   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremioopos 9701 The set of positive reals expressed as an open interval. (Contributed by NM, 7-May-2007.)
 |-  ( 0 (,) +oo )  =  { x  e.  RR  |  0  < 
 x }
 
Theoremioorp 9702 The set of positive reals expressed as an open interval. (Contributed by Steve Rodriguez, 25-Nov-2007.)
 |-  ( 0 (,) +oo )  =  RR+
 
Theoremiooshf 9703 Shift the arguments of the open interval function. (Contributed by NM, 17-Aug-2008.)
 |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  ->  ( ( A  -  B )  e.  ( C (,) D )  <->  A  e.  (
 ( C  +  B ) (,) ( D  +  B ) ) ) )
 
Theoremiocssre 9704 A closed-above interval with real upper bound is a set of reals. (Contributed by FL, 29-May-2014.)
 |-  ( ( A  e.  RR*  /\  B  e.  RR )  ->  ( A (,] B )  C_  RR )
 
Theoremicossre 9705 A closed-below interval with real lower bound is a set of reals. (Contributed by Mario Carneiro, 14-Jun-2014.)
 |-  ( ( A  e.  RR  /\  B  e.  RR* )  ->  ( A [,) B )  C_  RR )
 
Theoremiccssre 9706 A closed real interval is a set of reals. (Contributed by FL, 6-Jun-2007.) (Proof shortened by Paul Chapman, 21-Jan-2008.)
 |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A [,] B )  C_  RR )
 
Theoremiccssxr 9707 A closed interval is a set of extended reals. (Contributed by FL, 28-Jul-2008.) (Revised by Mario Carneiro, 4-Jul-2014.)
 |-  ( A [,] B )  C_  RR*
 
Theoremiocssxr 9708 An open-below, closed-above interval is a subset of the extended reals. (Contributed by FL, 29-May-2014.) (Revised by Mario Carneiro, 4-Jul-2014.)
 |-  ( A (,] B )  C_  RR*
 
Theoremicossxr 9709 A closed-below, open-above interval is a subset of the extended reals. (Contributed by FL, 29-May-2014.) (Revised by Mario Carneiro, 4-Jul-2014.)
 |-  ( A [,) B )  C_  RR*
 
Theoremioossicc 9710 An open interval is a subset of its closure. (Contributed by Paul Chapman, 18-Oct-2007.)
 |-  ( A (,) B )  C_  ( A [,] B )
 
Theoremicossicc 9711 A closed-below, open-above interval is a subset of its closure. (Contributed by Thierry Arnoux, 25-Oct-2016.)
 |-  ( A [,) B )  C_  ( A [,] B )
 
Theoremiocssicc 9712 A closed-above, open-below interval is a subset of its closure. (Contributed by Thierry Arnoux, 1-Apr-2017.)
 |-  ( A (,] B )  C_  ( A [,] B )
 
Theoremioossico 9713 An open interval is a subset of its closure-below. (Contributed by Thierry Arnoux, 3-Mar-2017.)
 |-  ( A (,) B )  C_  ( A [,) B )
 
Theoremiocssioo 9714 Condition for a closed interval to be a subset of an open interval. (Contributed by Thierry Arnoux, 29-Mar-2017.)
 |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( A 
 <_  C  /\  D  <  B ) )  ->  ( C (,] D )  C_  ( A (,) B ) )
 
Theoremicossioo 9715 Condition for a closed interval to be a subset of an open interval. (Contributed by Thierry Arnoux, 29-Mar-2017.)
 |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( A  <  C  /\  D  <_  B ) )  ->  ( C [,) D ) 
 C_  ( A (,) B ) )
 
Theoremioossioo 9716 Condition for an open interval to be a subset of an open interval. (Contributed by Thierry Arnoux, 26-Sep-2017.)
 |-  ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( A 
 <_  C  /\  D  <_  B ) )  ->  ( C (,) D )  C_  ( A (,) B ) )
 
Theoremiccsupr 9717* A nonempty subset of a closed real interval satisfies the conditions for the existence of its supremum. To be useful without excluded middle, we'll probably need to change not equal to apart, and perhaps make other changes, but the theorem does hold as stated here. (Contributed by Paul Chapman, 21-Jan-2008.)
 |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  S  C_  ( A [,] B )  /\  C  e.  S )  ->  ( S  C_  RR  /\  S  =/=  (/)  /\  E. x  e.  RR  A. y  e.  S  y  <_  x ) )
 
Theoremelioopnf 9718 Membership in an unbounded interval of extended reals. (Contributed by Mario Carneiro, 18-Jun-2014.)
 |-  ( A  e.  RR*  ->  ( B  e.  ( A (,) +oo )  <->  ( B  e.  RR  /\  A  <  B ) ) )
 
Theoremelioomnf 9719 Membership in an unbounded interval of extended reals. (Contributed by Mario Carneiro, 18-Jun-2014.)
 |-  ( A  e.  RR*  ->  ( B  e.  ( -oo (,) A )  <->  ( B  e.  RR  /\  B  <  A ) ) )
 
Theoremelicopnf 9720 Membership in a closed unbounded interval of reals. (Contributed by Mario Carneiro, 16-Sep-2014.)
 |-  ( A  e.  RR  ->  ( B  e.  ( A [,) +oo )  <->  ( B  e.  RR  /\  A  <_  B ) ) )
 
Theoremrepos 9721 Two ways of saying that a real number is positive. (Contributed by NM, 7-May-2007.)
 |-  ( A  e.  (
 0 (,) +oo )  <->  ( A  e.  RR  /\  0  <  A ) )
 
Theoremioof 9722 The set of open intervals of extended reals maps to subsets of reals. (Contributed by NM, 7-Feb-2007.) (Revised by Mario Carneiro, 16-Nov-2013.)
 |- 
 (,) : ( RR*  X.  RR* )
 --> ~P RR
 
Theoremiccf 9723 The set of closed intervals of extended reals maps to subsets of extended reals. (Contributed by FL, 14-Jun-2007.) (Revised by Mario Carneiro, 3-Nov-2013.)
 |- 
 [,] : ( RR*  X.  RR* )
 --> ~P RR*
 
Theoremunirnioo 9724 The union of the range of the open interval function. (Contributed by NM, 7-May-2007.) (Revised by Mario Carneiro, 30-Jan-2014.)
 |- 
 RR  =  U. ran  (,)
 
Theoremdfioo2 9725* Alternate definition of the set of open intervals of extended reals. (Contributed by NM, 1-Mar-2007.) (Revised by Mario Carneiro, 1-Sep-2015.)
 |- 
 (,)  =  ( x  e.  RR* ,  y  e.  RR*  |->  { w  e.  RR  |  ( x  <  w  /\  w  <  y ) } )
 
Theoremioorebasg 9726 Open intervals are elements of the set of all open intervals. (Contributed by Jim Kingdon, 4-Apr-2020.)
 |-  ( ( A  e.  RR*  /\  B  e.  RR* )  ->  ( A (,) B )  e.  ran  (,) )
 
Theoremelrege0 9727 The predicate "is a nonnegative real". (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 18-Jun-2014.)
 |-  ( A  e.  (
 0 [,) +oo )  <->  ( A  e.  RR  /\  0  <_  A ) )
 
Theoremrge0ssre 9728 Nonnegative real numbers are real numbers. (Contributed by Thierry Arnoux, 9-Sep-2018.) (Proof shortened by AV, 8-Sep-2019.)
 |-  ( 0 [,) +oo )  C_  RR
 
Theoremelxrge0 9729 Elementhood in the set of nonnegative extended reals. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( A  e.  (
 0 [,] +oo )  <->  ( A  e.  RR*  /\  0  <_  A ) )
 
Theorem0e0icopnf 9730 0 is a member of  ( 0 [,) +oo ) (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
 |-  0  e.  ( 0 [,) +oo )
 
Theorem0e0iccpnf 9731 0 is a member of  ( 0 [,] +oo ) (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
 |-  0  e.  ( 0 [,] +oo )
 
Theoremge0addcl 9732 The nonnegative reals are closed under addition. (Contributed by Mario Carneiro, 19-Jun-2014.)
 |-  ( ( A  e.  ( 0 [,) +oo )  /\  B  e.  (
 0 [,) +oo ) ) 
 ->  ( A  +  B )  e.  ( 0 [,) +oo ) )
 
Theoremge0mulcl 9733 The nonnegative reals are closed under multiplication. (Contributed by Mario Carneiro, 19-Jun-2014.)
 |-  ( ( A  e.  ( 0 [,) +oo )  /\  B  e.  (
 0 [,) +oo ) ) 
 ->  ( A  x.  B )  e.  ( 0 [,) +oo ) )
 
Theoremge0xaddcl 9734 The nonnegative reals are closed under addition. (Contributed by Mario Carneiro, 26-Aug-2015.)
 |-  ( ( A  e.  ( 0 [,] +oo )  /\  B  e.  (
 0 [,] +oo ) ) 
 ->  ( A +e B )  e.  (
 0 [,] +oo ) )
 
Theoremlbicc2 9735 The lower bound of a closed interval is a member of it. (Contributed by Paul Chapman, 26-Nov-2007.) (Revised by FL, 29-May-2014.) (Revised by Mario Carneiro, 9-Sep-2015.)
 |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  <_  B )  ->  A  e.  ( A [,] B ) )
 
Theoremubicc2 9736 The upper bound of a closed interval is a member of it. (Contributed by Paul Chapman, 26-Nov-2007.) (Revised by FL, 29-May-2014.)
 |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  A  <_  B )  ->  B  e.  ( A [,] B ) )
 
Theorem0elunit 9737 Zero is an element of the closed unit. (Contributed by Scott Fenton, 11-Jun-2013.)
 |-  0  e.  ( 0 [,] 1 )
 
Theorem1elunit 9738 One is an element of the closed unit. (Contributed by Scott Fenton, 11-Jun-2013.)
 |-  1  e.  ( 0 [,] 1 )
 
Theoremiooneg 9739 Membership in a negated open real interval. (Contributed by Paul Chapman, 26-Nov-2007.)
 |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( C  e.  ( A (,) B )  <->  -u C  e.  ( -u B (,) -u A ) ) )
 
Theoremiccneg 9740 Membership in a negated closed real interval. (Contributed by Paul Chapman, 26-Nov-2007.)
 |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( C  e.  ( A [,] B )  <->  -u C  e.  ( -u B [,] -u A ) ) )
 
Theoremicoshft 9741 A shifted real is a member of a shifted, closed-below, open-above real interval. (Contributed by Paul Chapman, 25-Mar-2008.)
 |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( X  e.  ( A [,) B )  ->  ( X  +  C )  e.  ( ( A  +  C ) [,) ( B  +  C ) ) ) )
 
Theoremicoshftf1o 9742* Shifting a closed-below, open-above interval is one-to-one onto. (Contributed by Paul Chapman, 25-Mar-2008.) (Proof shortened by Mario Carneiro, 1-Sep-2015.)
 |-  F  =  ( x  e.  ( A [,) B )  |->  ( x  +  C ) )   =>    |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  F :
 ( A [,) B )
 -1-1-onto-> ( ( A  +  C ) [,) ( B  +  C )
 ) )
 
Theoremicodisj 9743 End-to-end closed-below, open-above real intervals are disjoint. (Contributed by Mario Carneiro, 16-Jun-2014.)
 |-  ( ( A  e.  RR*  /\  B  e.  RR*  /\  C  e.  RR* )  ->  (
 ( A [,) B )  i^i  ( B [,) C ) )  =  (/) )
 
Theoremioodisj 9744 If the upper bound of one open interval is less than or equal to the lower bound of the other, the intervals are disjoint. (Contributed by Jeff Hankins, 13-Jul-2009.)
 |-  ( ( ( ( A  e.  RR*  /\  B  e.  RR* )  /\  ( C  e.  RR*  /\  D  e.  RR* ) )  /\  B  <_  C )  ->  ( ( A (,) B )  i^i  ( C (,) D ) )  =  (/) )
 
Theoremiccshftr 9745 Membership in a shifted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
 |-  ( A  +  R )  =  C   &    |-  ( B  +  R )  =  D   =>    |-  (
 ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  ->  ( X  e.  ( A [,] B )  <->  ( X  +  R )  e.  ( C [,] D ) ) )
 
Theoremiccshftri 9746 Membership in a shifted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
 |-  A  e.  RR   &    |-  B  e.  RR   &    |-  R  e.  RR   &    |-  ( A  +  R )  =  C   &    |-  ( B  +  R )  =  D   =>    |-  ( X  e.  ( A [,] B )  ->  ( X  +  R )  e.  ( C [,] D ) )
 
Theoremiccshftl 9747 Membership in a shifted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
 |-  ( A  -  R )  =  C   &    |-  ( B  -  R )  =  D   =>    |-  (
 ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  ->  ( X  e.  ( A [,] B )  <->  ( X  -  R )  e.  ( C [,] D ) ) )
 
Theoremiccshftli 9748 Membership in a shifted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
 |-  A  e.  RR   &    |-  B  e.  RR   &    |-  R  e.  RR   &    |-  ( A  -  R )  =  C   &    |-  ( B  -  R )  =  D   =>    |-  ( X  e.  ( A [,] B )  ->  ( X  -  R )  e.  ( C [,] D ) )
 
Theoremiccdil 9749 Membership in a dilated interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
 |-  ( A  x.  R )  =  C   &    |-  ( B  x.  R )  =  D   =>    |-  (
 ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  ( X  e.  ( A [,] B )  <->  ( X  x.  R )  e.  ( C [,] D ) ) )
 
Theoremiccdili 9750 Membership in a dilated interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
 |-  A  e.  RR   &    |-  B  e.  RR   &    |-  R  e.  RR+   &    |-  ( A  x.  R )  =  C   &    |-  ( B  x.  R )  =  D   =>    |-  ( X  e.  ( A [,] B )  ->  ( X  x.  R )  e.  ( C [,] D ) )
 
Theoremicccntr 9751 Membership in a contracted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
 |-  ( A  /  R )  =  C   &    |-  ( B  /  R )  =  D   =>    |-  (
 ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  ( X  e.  ( A [,] B )  <->  ( X  /  R )  e.  ( C [,] D ) ) )
 
Theoremicccntri 9752 Membership in a contracted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
 |-  A  e.  RR   &    |-  B  e.  RR   &    |-  R  e.  RR+   &    |-  ( A  /  R )  =  C   &    |-  ( B  /  R )  =  D   =>    |-  ( X  e.  ( A [,] B )  ->  ( X  /  R )  e.  ( C [,] D ) )
 
Theoremdivelunit 9753 A condition for a ratio to be a member of the closed unit. (Contributed by Scott Fenton, 11-Jun-2013.)
 |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  ( ( A  /  B )  e.  (
 0 [,] 1 )  <->  A  <_  B ) )
 
Theoremlincmb01cmp 9754 A linear combination of two reals which lies in the interval between them. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 8-Sep-2015.)
 |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  A  <  B )  /\  T  e.  ( 0 [,] 1
 ) )  ->  (
 ( ( 1  -  T )  x.  A )  +  ( T  x.  B ) )  e.  ( A [,] B ) )
 
Theoremiccf1o 9755* Describe a bijection from  [ 0 ,  1 ] to an arbitrary nontrivial closed interval  [ A ,  B ]. (Contributed by Mario Carneiro, 8-Sep-2015.)
 |-  F  =  ( x  e.  ( 0 [,] 1 )  |->  ( ( x  x.  B )  +  ( ( 1  -  x )  x.  A ) ) )   =>    |-  ( ( A  e.  RR  /\  B  e.  RR  /\  A  <  B ) 
 ->  ( F : ( 0 [,] 1 ) -1-1-onto-> ( A [,] B ) 
 /\  `' F  =  (
 y  e.  ( A [,] B )  |->  ( ( y  -  A )  /  ( B  -  A ) ) ) ) )
 
Theoremunitssre 9756  ( 0 [,] 1 ) is a subset of the reals. (Contributed by David Moews, 28-Feb-2017.)
 |-  ( 0 [,] 1
 )  C_  RR
 
Theoremzltaddlt1le 9757 The sum of an integer and a real number between 0 and 1 is less than or equal to a second integer iff the sum is less than the second integer. (Contributed by AV, 1-Jul-2021.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  A  e.  ( 0 (,) 1 ) ) 
 ->  ( ( M  +  A )  <  N  <->  ( M  +  A )  <_  N ) )
 
4.5.4  Finite intervals of integers
 
Syntaxcfz 9758 Extend class notation to include the notation for a contiguous finite set of integers. Read " M ... N " as "the set of integers from  M to  N inclusive."
 class  ...
 
Definitiondf-fz 9759* Define an operation that produces a finite set of sequential integers. Read " M ... N " as "the set of integers from  M to  N inclusive." See fzval 9760 for its value and additional comments. (Contributed by NM, 6-Sep-2005.)
 |- 
 ...  =  ( m  e.  ZZ ,  n  e. 
 ZZ  |->  { k  e.  ZZ  |  ( m  <_  k  /\  k  <_  n ) } )
 
Theoremfzval 9760* The value of a finite set of sequential integers. E.g.,  2 ... 5 means the set  { 2 ,  3 ,  4 ,  5 }. A special case of this definition (starting at 1) appears as Definition 11-2.1 of [Gleason] p. 141, where  NNk means our  1 ... k; he calls these sets segments of the integers. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 3-Nov-2013.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M ... N )  =  { k  e.  ZZ  |  ( M 
 <_  k  /\  k  <_  N ) } )
 
Theoremfzval2 9761 An alternate way of expressing a finite set of sequential integers. (Contributed by Mario Carneiro, 3-Nov-2013.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M ... N )  =  ( ( M [,] N )  i^i  ZZ ) )
 
Theoremfzf 9762 Establish the domain and codomain of the finite integer sequence function. (Contributed by Scott Fenton, 8-Aug-2013.) (Revised by Mario Carneiro, 16-Nov-2013.)
 |- 
 ... : ( ZZ  X.  ZZ ) --> ~P ZZ
 
Theoremelfz1 9763 Membership in a finite set of sequential integers. (Contributed by NM, 21-Jul-2005.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  e.  ( M ... N )  <-> 
 ( K  e.  ZZ  /\  M  <_  K  /\  K  <_  N ) ) )
 
Theoremelfz 9764 Membership in a finite set of sequential integers. (Contributed by NM, 29-Sep-2005.)
 |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  e.  ( M ... N )  <->  ( M  <_  K 
 /\  K  <_  N ) ) )
 
Theoremelfz2 9765 Membership in a finite set of sequential integers. We use the fact that an operation's value is empty outside of its domain to show  M  e.  ZZ and  N  e.  ZZ. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( K  e.  ( M ... N )  <->  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  /\  ( M 
 <_  K  /\  K  <_  N ) ) )
 
Theoremelfz5 9766 Membership in a finite set of sequential integers. (Contributed by NM, 26-Dec-2005.)
 |-  ( ( K  e.  ( ZZ>= `  M )  /\  N  e.  ZZ )  ->  ( K  e.  ( M ... N )  <->  K  <_  N ) )
 
Theoremelfz4 9767 Membership in a finite set of sequential integers. (Contributed by NM, 21-Jul-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  /\  ( M 
 <_  K  /\  K  <_  N ) )  ->  K  e.  ( M ... N ) )
 
Theoremelfzuzb 9768 Membership in a finite set of sequential integers in terms of sets of upper integers. (Contributed by NM, 18-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( K  e.  ( M ... N )  <->  ( K  e.  ( ZZ>= `  M )  /\  N  e.  ( ZZ>= `  K ) ) )
 
Theoremeluzfz 9769 Membership in a finite set of sequential integers. (Contributed by NM, 4-Oct-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( ( K  e.  ( ZZ>= `  M )  /\  N  e.  ( ZZ>= `  K ) )  ->  K  e.  ( M ... N ) )
 
Theoremelfzuz 9770 A member of a finite set of sequential integers belongs to an upper set of integers. (Contributed by NM, 17-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( K  e.  ( M ... N )  ->  K  e.  ( ZZ>= `  M ) )
 
Theoremelfzuz3 9771 Membership in a finite set of sequential integers implies membership in an upper set of integers. (Contributed by NM, 28-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( K  e.  ( M ... N )  ->  N  e.  ( ZZ>= `  K ) )
 
Theoremelfzel2 9772 Membership in a finite set of sequential integer implies the upper bound is an integer. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( K  e.  ( M ... N )  ->  N  e.  ZZ )
 
Theoremelfzel1 9773 Membership in a finite set of sequential integer implies the lower bound is an integer. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( K  e.  ( M ... N )  ->  M  e.  ZZ )
 
Theoremelfzelz 9774 A member of a finite set of sequential integer is an integer. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( K  e.  ( M ... N )  ->  K  e.  ZZ )
 
Theoremelfzle1 9775 A member of a finite set of sequential integer is greater than or equal to the lower bound. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( K  e.  ( M ... N )  ->  M  <_  K )
 
Theoremelfzle2 9776 A member of a finite set of sequential integer is less than or equal to the upper bound. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( K  e.  ( M ... N )  ->  K  <_  N )
 
Theoremelfzuz2 9777 Implication of membership in a finite set of sequential integers. (Contributed by NM, 20-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( K  e.  ( M ... N )  ->  N  e.  ( ZZ>= `  M ) )
 
Theoremelfzle3 9778 Membership in a finite set of sequential integer implies the bounds are comparable. (Contributed by NM, 18-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( K  e.  ( M ... N )  ->  M  <_  N )
 
Theoremeluzfz1 9779 Membership in a finite set of sequential integers - special case. (Contributed by NM, 21-Jul-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( N  e.  ( ZZ>=
 `  M )  ->  M  e.  ( M ... N ) )
 
Theoremeluzfz2 9780 Membership in a finite set of sequential integers - special case. (Contributed by NM, 13-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
 |-  ( N  e.  ( ZZ>=
 `  M )  ->  N  e.  ( M ... N ) )
 
Theoremeluzfz2b 9781 Membership in a finite set of sequential integers - special case. (Contributed by NM, 14-Sep-2005.)
 |-  ( N  e.  ( ZZ>=
 `  M )  <->  N  e.  ( M ... N ) )
 
Theoremelfz3 9782 Membership in a finite set of sequential integers containing one integer. (Contributed by NM, 21-Jul-2005.)
 |-  ( N  e.  ZZ  ->  N  e.  ( N
 ... N ) )
 
Theoremelfz1eq 9783 Membership in a finite set of sequential integers containing one integer. (Contributed by NM, 19-Sep-2005.)
 |-  ( K  e.  ( N ... N )  ->  K  =  N )
 
Theoremelfzubelfz 9784 If there is a member in a finite set of sequential integers, the upper bound is also a member of this finite set of sequential integers. (Contributed by Alexander van der Vekens, 31-May-2018.)
 |-  ( K  e.  ( M ... N )  ->  N  e.  ( M ... N ) )
 
Theorempeano2fzr 9785 A Peano-postulate-like theorem for downward closure of a finite set of sequential integers. (Contributed by Mario Carneiro, 27-May-2014.)
 |-  ( ( K  e.  ( ZZ>= `  M )  /\  ( K  +  1 )  e.  ( M
 ... N ) ) 
 ->  K  e.  ( M
 ... N ) )
 
Theoremfzm 9786* Properties of a finite interval of integers which is inhabited. (Contributed by Jim Kingdon, 15-Apr-2020.)
 |-  ( E. x  x  e.  ( M ... N )  <->  N  e.  ( ZZ>=
 `  M ) )
 
Theoremfztri3or 9787 Trichotomy in terms of a finite interval of integers. (Contributed by Jim Kingdon, 1-Jun-2020.)
 |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  <  M  \/  K  e.  ( M
 ... N )  \/  N  <  K ) )
 
Theoremfzdcel 9788 Decidability of membership in a finite interval of integers. (Contributed by Jim Kingdon, 1-Jun-2020.)
 |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  -> DECID  K  e.  ( M ... N ) )
 
Theoremfznlem 9789 A finite set of sequential integers is empty if the bounds are reversed. (Contributed by Jim Kingdon, 16-Apr-2020.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  <  M 
 ->  ( M ... N )  =  (/) ) )
 
Theoremfzn 9790 A finite set of sequential integers is empty if the bounds are reversed. (Contributed by NM, 22-Aug-2005.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  <  M  <-> 
 ( M ... N )  =  (/) ) )
 
Theoremfzen 9791 A shifted finite set of sequential integers is equinumerous to the original set. (Contributed by Paul Chapman, 11-Apr-2009.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  ->  ( M ... N )  ~~  ( ( M  +  K ) ... ( N  +  K ) ) )
 
Theoremfz1n 9792 A 1-based finite set of sequential integers is empty iff it ends at index  0. (Contributed by Paul Chapman, 22-Jun-2011.)
 |-  ( N  e.  NN0  ->  ( ( 1 ...
 N )  =  (/)  <->  N  =  0 ) )
 
Theorem0fz1 9793 Two ways to say a finite 1-based sequence is empty. (Contributed by Paul Chapman, 26-Oct-2012.)
 |-  ( ( N  e.  NN0  /\  F  Fn  ( 1
 ... N ) ) 
 ->  ( F  =  (/)  <->  N  =  0 ) )
 
Theoremfz10 9794 There are no integers between 1 and 0. (Contributed by Jeff Madsen, 16-Jun-2010.) (Proof shortened by Mario Carneiro, 28-Apr-2015.)
 |-  ( 1 ... 0
 )  =  (/)
 
Theoremuzsubsubfz 9795 Membership of an integer greater than L decreased by ( L - M ) in an M based finite set of sequential integers. (Contributed by Alexander van der Vekens, 14-Sep-2018.)
 |-  ( ( L  e.  ( ZZ>= `  M )  /\  N  e.  ( ZZ>= `  L ) )  ->  ( N  -  ( L  -  M ) )  e.  ( M ... N ) )
 
Theoremuzsubsubfz1 9796 Membership of an integer greater than L decreased by ( L - 1 ) in a 1 based finite set of sequential integers. (Contributed by Alexander van der Vekens, 14-Sep-2018.)
 |-  ( ( L  e.  NN  /\  N  e.  ( ZZ>=
 `  L ) ) 
 ->  ( N  -  ( L  -  1 ) )  e.  ( 1 ...
 N ) )
 
Theoremige3m2fz 9797 Membership of an integer greater than 2 decreased by 2 in a 1 based finite set of sequential integers. (Contributed by Alexander van der Vekens, 14-Sep-2018.)
 |-  ( N  e.  ( ZZ>=
 `  3 )  ->  ( N  -  2
 )  e.  ( 1
 ... N ) )
 
Theoremfzsplit2 9798 Split a finite interval of integers into two parts. (Contributed by Mario Carneiro, 13-Apr-2016.)
 |-  ( ( ( K  +  1 )  e.  ( ZZ>= `  M )  /\  N  e.  ( ZZ>= `  K ) )  ->  ( M ... N )  =  ( ( M
 ... K )  u.  ( ( K  +  1 ) ... N ) ) )
 
Theoremfzsplit 9799 Split a finite interval of integers into two parts. (Contributed by Jeff Madsen, 17-Jun-2010.) (Revised by Mario Carneiro, 13-Apr-2016.)
 |-  ( K  e.  ( M ... N )  ->  ( M ... N )  =  ( ( M
 ... K )  u.  ( ( K  +  1 ) ... N ) ) )
 
Theoremfzdisj 9800 Condition for two finite intervals of integers to be disjoint. (Contributed by Jeff Madsen, 17-Jun-2010.)
 |-  ( K  <  M  ->  ( ( J ... K )  i^i  ( M
 ... N ) )  =  (/) )
    < 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-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13177
  Copyright terms: Public domain < Previous  Next >