HomeHome Intuitionistic Logic Explorer
Theorem List (p. 97 of 130)
< Previous  Next >
Bad symbols? Try the
GIF version.

Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 9601-9700   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremiccleub 9601 An element of a closed interval is less than or equal to its upper bound. (Contributed by Jeff Hankins, 14-Jul-2009.)
((𝐴 ∈ ℝ*𝐵 ∈ ℝ*𝐶 ∈ (𝐴[,]𝐵)) → 𝐶𝐵)
 
Theoremiccgelb 9602 An element of a closed interval is more than or equal to its lower bound (Contributed by Thierry Arnoux, 23-Dec-2016.)
((𝐴 ∈ ℝ*𝐵 ∈ ℝ*𝐶 ∈ (𝐴[,]𝐵)) → 𝐴𝐶)
 
Theoremelioo5 9603 Membership in an open interval of extended reals. (Contributed by NM, 17-Aug-2008.)
((𝐴 ∈ ℝ*𝐵 ∈ ℝ*𝐶 ∈ ℝ*) → (𝐶 ∈ (𝐴(,)𝐵) ↔ (𝐴 < 𝐶𝐶 < 𝐵)))
 
Theoremelioo4g 9604 Membership in an open interval of extended reals. (Contributed by NM, 8-Jun-2007.) (Revised by Mario Carneiro, 28-Apr-2015.)
(𝐶 ∈ (𝐴(,)𝐵) ↔ ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*𝐶 ∈ ℝ) ∧ (𝐴 < 𝐶𝐶 < 𝐵)))
 
Theoremioossre 9605 An open interval is a set of reals. (Contributed by NM, 31-May-2007.)
(𝐴(,)𝐵) ⊆ ℝ
 
Theoremelioc2 9606 Membership in an open-below, closed-above real interval. (Contributed by Paul Chapman, 30-Dec-2007.) (Revised by Mario Carneiro, 14-Jun-2014.)
((𝐴 ∈ ℝ*𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴(,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶𝐶𝐵)))
 
Theoremelico2 9607 Membership in a closed-below, open-above real interval. (Contributed by Paul Chapman, 21-Jan-2008.) (Revised by Mario Carneiro, 14-Jun-2014.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴[,)𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴𝐶𝐶 < 𝐵)))
 
Theoremelicc2 9608 Membership in a closed real interval. (Contributed by Paul Chapman, 21-Sep-2007.) (Revised by Mario Carneiro, 14-Jun-2014.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴𝐶𝐶𝐵)))
 
Theoremelicc2i 9609 Inference for membership in a closed interval. (Contributed by Scott Fenton, 3-Jun-2013.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴𝐶𝐶𝐵))
 
Theoremelicc4 9610 Membership in a closed real interval. (Contributed by Stefan O'Rear, 16-Nov-2014.) (Proof shortened by Mario Carneiro, 1-Jan-2017.)
((𝐴 ∈ ℝ*𝐵 ∈ ℝ*𝐶 ∈ ℝ*) → (𝐶 ∈ (𝐴[,]𝐵) ↔ (𝐴𝐶𝐶𝐵)))
 
Theoremiccss 9611 Condition for a closed interval to be a subset of another closed interval. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 20-Feb-2015.)
(((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐴𝐶𝐷𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,]𝐵))
 
Theoremiccssioo 9612 Condition for a closed interval to be a subset of an open interval. (Contributed by Mario Carneiro, 20-Feb-2015.)
(((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ (𝐴 < 𝐶𝐷 < 𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴(,)𝐵))
 
Theoremicossico 9613 Condition for a closed-below, open-above interval to be a subset of a closed-below, open-above interval. (Contributed by Thierry Arnoux, 21-Sep-2017.)
(((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ (𝐴𝐶𝐷𝐵)) → (𝐶[,)𝐷) ⊆ (𝐴[,)𝐵))
 
Theoremiccss2 9614 Condition for a closed interval to be a subset of another closed interval. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 28-Apr-2015.)
((𝐶 ∈ (𝐴[,]𝐵) ∧ 𝐷 ∈ (𝐴[,]𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,]𝐵))
 
Theoremiccssico 9615 Condition for a closed interval to be a subset of a half-open interval. (Contributed by Mario Carneiro, 9-Sep-2015.)
(((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ (𝐴𝐶𝐷 < 𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,)𝐵))
 
Theoremiccssioo2 9616 Condition for a closed interval to be a subset of an open interval. (Contributed by Mario Carneiro, 20-Feb-2015.)
((𝐶 ∈ (𝐴(,)𝐵) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴(,)𝐵))
 
Theoremiccssico2 9617 Condition for a closed interval to be a subset of a closed-below, open-above interval. (Contributed by Mario Carneiro, 20-Feb-2015.)
((𝐶 ∈ (𝐴[,)𝐵) ∧ 𝐷 ∈ (𝐴[,)𝐵)) → (𝐶[,]𝐷) ⊆ (𝐴[,)𝐵))
 
Theoremioomax 9618 The open interval from minus to plus infinity. (Contributed by NM, 6-Feb-2007.)
(-∞(,)+∞) = ℝ
 
Theoremiccmax 9619 The closed interval from minus to plus infinity. (Contributed by Mario Carneiro, 4-Jul-2014.)
(-∞[,]+∞) = ℝ*
 
Theoremioopos 9620 The set of positive reals expressed as an open interval. (Contributed by NM, 7-May-2007.)
(0(,)+∞) = {𝑥 ∈ ℝ ∣ 0 < 𝑥}
 
Theoremioorp 9621 The set of positive reals expressed as an open interval. (Contributed by Steve Rodriguez, 25-Nov-2007.)
(0(,)+∞) = ℝ+
 
Theoremiooshf 9622 Shift the arguments of the open interval function. (Contributed by NM, 17-Aug-2008.)
(((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴𝐵) ∈ (𝐶(,)𝐷) ↔ 𝐴 ∈ ((𝐶 + 𝐵)(,)(𝐷 + 𝐵))))
 
Theoremiocssre 9623 A closed-above interval with real upper bound is a set of reals. (Contributed by FL, 29-May-2014.)
((𝐴 ∈ ℝ*𝐵 ∈ ℝ) → (𝐴(,]𝐵) ⊆ ℝ)
 
Theoremicossre 9624 A closed-below interval with real lower bound is a set of reals. (Contributed by Mario Carneiro, 14-Jun-2014.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ*) → (𝐴[,)𝐵) ⊆ ℝ)
 
Theoremiccssre 9625 A closed real interval is a set of reals. (Contributed by FL, 6-Jun-2007.) (Proof shortened by Paul Chapman, 21-Jan-2008.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
 
Theoremiccssxr 9626 A closed interval is a set of extended reals. (Contributed by FL, 28-Jul-2008.) (Revised by Mario Carneiro, 4-Jul-2014.)
(𝐴[,]𝐵) ⊆ ℝ*
 
Theoremiocssxr 9627 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.)
(𝐴(,]𝐵) ⊆ ℝ*
 
Theoremicossxr 9628 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.)
(𝐴[,)𝐵) ⊆ ℝ*
 
Theoremioossicc 9629 An open interval is a subset of its closure. (Contributed by Paul Chapman, 18-Oct-2007.)
(𝐴(,)𝐵) ⊆ (𝐴[,]𝐵)
 
Theoremicossicc 9630 A closed-below, open-above interval is a subset of its closure. (Contributed by Thierry Arnoux, 25-Oct-2016.)
(𝐴[,)𝐵) ⊆ (𝐴[,]𝐵)
 
Theoremiocssicc 9631 A closed-above, open-below interval is a subset of its closure. (Contributed by Thierry Arnoux, 1-Apr-2017.)
(𝐴(,]𝐵) ⊆ (𝐴[,]𝐵)
 
Theoremioossico 9632 An open interval is a subset of its closure-below. (Contributed by Thierry Arnoux, 3-Mar-2017.)
(𝐴(,)𝐵) ⊆ (𝐴[,)𝐵)
 
Theoremiocssioo 9633 Condition for a closed interval to be a subset of an open interval. (Contributed by Thierry Arnoux, 29-Mar-2017.)
(((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ (𝐴𝐶𝐷 < 𝐵)) → (𝐶(,]𝐷) ⊆ (𝐴(,)𝐵))
 
Theoremicossioo 9634 Condition for a closed interval to be a subset of an open interval. (Contributed by Thierry Arnoux, 29-Mar-2017.)
(((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ (𝐴 < 𝐶𝐷𝐵)) → (𝐶[,)𝐷) ⊆ (𝐴(,)𝐵))
 
Theoremioossioo 9635 Condition for an open interval to be a subset of an open interval. (Contributed by Thierry Arnoux, 26-Sep-2017.)
(((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ (𝐴𝐶𝐷𝐵)) → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
 
Theoremiccsupr 9636* 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.)
(((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑆 ⊆ (𝐴[,]𝐵) ∧ 𝐶𝑆) → (𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦𝑆 𝑦𝑥))
 
Theoremelioopnf 9637 Membership in an unbounded interval of extended reals. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝐴 ∈ ℝ* → (𝐵 ∈ (𝐴(,)+∞) ↔ (𝐵 ∈ ℝ ∧ 𝐴 < 𝐵)))
 
Theoremelioomnf 9638 Membership in an unbounded interval of extended reals. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝐴 ∈ ℝ* → (𝐵 ∈ (-∞(,)𝐴) ↔ (𝐵 ∈ ℝ ∧ 𝐵 < 𝐴)))
 
Theoremelicopnf 9639 Membership in a closed unbounded interval of reals. (Contributed by Mario Carneiro, 16-Sep-2014.)
(𝐴 ∈ ℝ → (𝐵 ∈ (𝐴[,)+∞) ↔ (𝐵 ∈ ℝ ∧ 𝐴𝐵)))
 
Theoremrepos 9640 Two ways of saying that a real number is positive. (Contributed by NM, 7-May-2007.)
(𝐴 ∈ (0(,)+∞) ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴))
 
Theoremioof 9641 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.)
(,):(ℝ* × ℝ*)⟶𝒫 ℝ
 
Theoremiccf 9642 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.)
[,]:(ℝ* × ℝ*)⟶𝒫 ℝ*
 
Theoremunirnioo 9643 The union of the range of the open interval function. (Contributed by NM, 7-May-2007.) (Revised by Mario Carneiro, 30-Jan-2014.)
ℝ = ran (,)
 
Theoremdfioo2 9644* Alternate definition of the set of open intervals of extended reals. (Contributed by NM, 1-Mar-2007.) (Revised by Mario Carneiro, 1-Sep-2015.)
(,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑤 ∈ ℝ ∣ (𝑥 < 𝑤𝑤 < 𝑦)})
 
Theoremioorebasg 9645 Open intervals are elements of the set of all open intervals. (Contributed by Jim Kingdon, 4-Apr-2020.)
((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → (𝐴(,)𝐵) ∈ ran (,))
 
Theoremelrege0 9646 The predicate "is a nonnegative real". (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 18-Jun-2014.)
(𝐴 ∈ (0[,)+∞) ↔ (𝐴 ∈ ℝ ∧ 0 ≤ 𝐴))
 
Theoremrge0ssre 9647 Nonnegative real numbers are real numbers. (Contributed by Thierry Arnoux, 9-Sep-2018.) (Proof shortened by AV, 8-Sep-2019.)
(0[,)+∞) ⊆ ℝ
 
Theoremelxrge0 9648 Elementhood in the set of nonnegative extended reals. (Contributed by Mario Carneiro, 28-Jun-2014.)
(𝐴 ∈ (0[,]+∞) ↔ (𝐴 ∈ ℝ* ∧ 0 ≤ 𝐴))
 
Theorem0e0icopnf 9649 0 is a member of (0[,)+∞) (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
0 ∈ (0[,)+∞)
 
Theorem0e0iccpnf 9650 0 is a member of (0[,]+∞) (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
0 ∈ (0[,]+∞)
 
Theoremge0addcl 9651 The nonnegative reals are closed under addition. (Contributed by Mario Carneiro, 19-Jun-2014.)
((𝐴 ∈ (0[,)+∞) ∧ 𝐵 ∈ (0[,)+∞)) → (𝐴 + 𝐵) ∈ (0[,)+∞))
 
Theoremge0mulcl 9652 The nonnegative reals are closed under multiplication. (Contributed by Mario Carneiro, 19-Jun-2014.)
((𝐴 ∈ (0[,)+∞) ∧ 𝐵 ∈ (0[,)+∞)) → (𝐴 · 𝐵) ∈ (0[,)+∞))
 
Theoremge0xaddcl 9653 The nonnegative reals are closed under addition. (Contributed by Mario Carneiro, 26-Aug-2015.)
((𝐴 ∈ (0[,]+∞) ∧ 𝐵 ∈ (0[,]+∞)) → (𝐴 +𝑒 𝐵) ∈ (0[,]+∞))
 
Theoremlbicc2 9654 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.)
((𝐴 ∈ ℝ*𝐵 ∈ ℝ*𝐴𝐵) → 𝐴 ∈ (𝐴[,]𝐵))
 
Theoremubicc2 9655 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.)
((𝐴 ∈ ℝ*𝐵 ∈ ℝ*𝐴𝐵) → 𝐵 ∈ (𝐴[,]𝐵))
 
Theorem0elunit 9656 Zero is an element of the closed unit. (Contributed by Scott Fenton, 11-Jun-2013.)
0 ∈ (0[,]1)
 
Theorem1elunit 9657 One is an element of the closed unit. (Contributed by Scott Fenton, 11-Jun-2013.)
1 ∈ (0[,]1)
 
Theoremiooneg 9658 Membership in a negated open real interval. (Contributed by Paul Chapman, 26-Nov-2007.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴(,)𝐵) ↔ -𝐶 ∈ (-𝐵(,)-𝐴)))
 
Theoremiccneg 9659 Membership in a negated closed real interval. (Contributed by Paul Chapman, 26-Nov-2007.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ (𝐴[,]𝐵) ↔ -𝐶 ∈ (-𝐵[,]-𝐴)))
 
Theoremicoshft 9660 A shifted real is a member of a shifted, closed-below, open-above real interval. (Contributed by Paul Chapman, 25-Mar-2008.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝑋 ∈ (𝐴[,)𝐵) → (𝑋 + 𝐶) ∈ ((𝐴 + 𝐶)[,)(𝐵 + 𝐶))))
 
Theoremicoshftf1o 9661* 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.)
𝐹 = (𝑥 ∈ (𝐴[,)𝐵) ↦ (𝑥 + 𝐶))       ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐹:(𝐴[,)𝐵)–1-1-onto→((𝐴 + 𝐶)[,)(𝐵 + 𝐶)))
 
Theoremicodisj 9662 End-to-end closed-below, open-above real intervals are disjoint. (Contributed by Mario Carneiro, 16-Jun-2014.)
((𝐴 ∈ ℝ*𝐵 ∈ ℝ*𝐶 ∈ ℝ*) → ((𝐴[,)𝐵) ∩ (𝐵[,)𝐶)) = ∅)
 
Theoremioodisj 9663 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.)
((((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ*𝐷 ∈ ℝ*)) ∧ 𝐵𝐶) → ((𝐴(,)𝐵) ∩ (𝐶(,)𝐷)) = ∅)
 
Theoremiccshftr 9664 Membership in a shifted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
(𝐴 + 𝑅) = 𝐶    &   (𝐵 + 𝑅) = 𝐷       (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑋 ∈ ℝ ∧ 𝑅 ∈ ℝ)) → (𝑋 ∈ (𝐴[,]𝐵) ↔ (𝑋 + 𝑅) ∈ (𝐶[,]𝐷)))
 
Theoremiccshftri 9665 Membership in a shifted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝑅 ∈ ℝ    &   (𝐴 + 𝑅) = 𝐶    &   (𝐵 + 𝑅) = 𝐷       (𝑋 ∈ (𝐴[,]𝐵) → (𝑋 + 𝑅) ∈ (𝐶[,]𝐷))
 
Theoremiccshftl 9666 Membership in a shifted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
(𝐴𝑅) = 𝐶    &   (𝐵𝑅) = 𝐷       (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑋 ∈ ℝ ∧ 𝑅 ∈ ℝ)) → (𝑋 ∈ (𝐴[,]𝐵) ↔ (𝑋𝑅) ∈ (𝐶[,]𝐷)))
 
Theoremiccshftli 9667 Membership in a shifted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝑅 ∈ ℝ    &   (𝐴𝑅) = 𝐶    &   (𝐵𝑅) = 𝐷       (𝑋 ∈ (𝐴[,]𝐵) → (𝑋𝑅) ∈ (𝐶[,]𝐷))
 
Theoremiccdil 9668 Membership in a dilated interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
(𝐴 · 𝑅) = 𝐶    &   (𝐵 · 𝑅) = 𝐷       (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑋 ∈ ℝ ∧ 𝑅 ∈ ℝ+)) → (𝑋 ∈ (𝐴[,]𝐵) ↔ (𝑋 · 𝑅) ∈ (𝐶[,]𝐷)))
 
Theoremiccdili 9669 Membership in a dilated interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝑅 ∈ ℝ+    &   (𝐴 · 𝑅) = 𝐶    &   (𝐵 · 𝑅) = 𝐷       (𝑋 ∈ (𝐴[,]𝐵) → (𝑋 · 𝑅) ∈ (𝐶[,]𝐷))
 
Theoremicccntr 9670 Membership in a contracted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
(𝐴 / 𝑅) = 𝐶    &   (𝐵 / 𝑅) = 𝐷       (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑋 ∈ ℝ ∧ 𝑅 ∈ ℝ+)) → (𝑋 ∈ (𝐴[,]𝐵) ↔ (𝑋 / 𝑅) ∈ (𝐶[,]𝐷)))
 
Theoremicccntri 9671 Membership in a contracted interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ    &   𝑅 ∈ ℝ+    &   (𝐴 / 𝑅) = 𝐶    &   (𝐵 / 𝑅) = 𝐷       (𝑋 ∈ (𝐴[,]𝐵) → (𝑋 / 𝑅) ∈ (𝐶[,]𝐷))
 
Theoremdivelunit 9672 A condition for a ratio to be a member of the closed unit. (Contributed by Scott Fenton, 11-Jun-2013.)
(((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 < 𝐵)) → ((𝐴 / 𝐵) ∈ (0[,]1) ↔ 𝐴𝐵))
 
Theoremlincmb01cmp 9673 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.)
(((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 < 𝐵) ∧ 𝑇 ∈ (0[,]1)) → (((1 − 𝑇) · 𝐴) + (𝑇 · 𝐵)) ∈ (𝐴[,]𝐵))
 
Theoremiccf1o 9674* Describe a bijection from [0, 1] to an arbitrary nontrivial closed interval [𝐴, 𝐵]. (Contributed by Mario Carneiro, 8-Sep-2015.)
𝐹 = (𝑥 ∈ (0[,]1) ↦ ((𝑥 · 𝐵) + ((1 − 𝑥) · 𝐴)))       ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 < 𝐵) → (𝐹:(0[,]1)–1-1-onto→(𝐴[,]𝐵) ∧ 𝐹 = (𝑦 ∈ (𝐴[,]𝐵) ↦ ((𝑦𝐴) / (𝐵𝐴)))))
 
Theoremunitssre 9675 (0[,]1) is a subset of the reals. (Contributed by David Moews, 28-Feb-2017.)
(0[,]1) ⊆ ℝ
 
Theoremzltaddlt1le 9676 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.)
((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐴 ∈ (0(,)1)) → ((𝑀 + 𝐴) < 𝑁 ↔ (𝑀 + 𝐴) ≤ 𝑁))
 
3.5.4  Finite intervals of integers
 
Syntaxcfz 9677 Extend class notation to include the notation for a contiguous finite set of integers. Read "𝑀...𝑁 " as "the set of integers from 𝑀 to 𝑁 inclusive."
class ...
 
Definitiondf-fz 9678* Define an operation that produces a finite set of sequential integers. Read "𝑀...𝑁 " as "the set of integers from 𝑀 to 𝑁 inclusive." See fzval 9679 for its value and additional comments. (Contributed by NM, 6-Sep-2005.)
... = (𝑚 ∈ ℤ, 𝑛 ∈ ℤ ↦ {𝑘 ∈ ℤ ∣ (𝑚𝑘𝑘𝑛)})
 
Theoremfzval 9679* 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 k means our 1...𝑘; he calls these sets segments of the integers. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 3-Nov-2013.)
((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀...𝑁) = {𝑘 ∈ ℤ ∣ (𝑀𝑘𝑘𝑁)})
 
Theoremfzval2 9680 An alternate way of expressing a finite set of sequential integers. (Contributed by Mario Carneiro, 3-Nov-2013.)
((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀...𝑁) = ((𝑀[,]𝑁) ∩ ℤ))
 
Theoremfzf 9681 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.)
...:(ℤ × ℤ)⟶𝒫 ℤ
 
Theoremelfz1 9682 Membership in a finite set of sequential integers. (Contributed by NM, 21-Jul-2005.)
((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 ∈ ℤ ∧ 𝑀𝐾𝐾𝑁)))
 
Theoremelfz 9683 Membership in a finite set of sequential integers. (Contributed by NM, 29-Sep-2005.)
((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ (𝑀𝐾𝐾𝑁)))
 
Theoremelfz2 9684 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 𝑀 ∈ ℤ and 𝑁 ∈ ℤ. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
(𝐾 ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀𝐾𝐾𝑁)))
 
Theoremelfz5 9685 Membership in a finite set of sequential integers. (Contributed by NM, 26-Dec-2005.)
((𝐾 ∈ (ℤ𝑀) ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ (𝑀...𝑁) ↔ 𝐾𝑁))
 
Theoremelfz4 9686 Membership in a finite set of sequential integers. (Contributed by NM, 21-Jul-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
(((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ (𝑀𝐾𝐾𝑁)) → 𝐾 ∈ (𝑀...𝑁))
 
Theoremelfzuzb 9687 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.)
(𝐾 ∈ (𝑀...𝑁) ↔ (𝐾 ∈ (ℤ𝑀) ∧ 𝑁 ∈ (ℤ𝐾)))
 
Theoremeluzfz 9688 Membership in a finite set of sequential integers. (Contributed by NM, 4-Oct-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
((𝐾 ∈ (ℤ𝑀) ∧ 𝑁 ∈ (ℤ𝐾)) → 𝐾 ∈ (𝑀...𝑁))
 
Theoremelfzuz 9689 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.)
(𝐾 ∈ (𝑀...𝑁) → 𝐾 ∈ (ℤ𝑀))
 
Theoremelfzuz3 9690 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.)
(𝐾 ∈ (𝑀...𝑁) → 𝑁 ∈ (ℤ𝐾))
 
Theoremelfzel2 9691 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.)
(𝐾 ∈ (𝑀...𝑁) → 𝑁 ∈ ℤ)
 
Theoremelfzel1 9692 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.)
(𝐾 ∈ (𝑀...𝑁) → 𝑀 ∈ ℤ)
 
Theoremelfzelz 9693 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.)
(𝐾 ∈ (𝑀...𝑁) → 𝐾 ∈ ℤ)
 
Theoremelfzle1 9694 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.)
(𝐾 ∈ (𝑀...𝑁) → 𝑀𝐾)
 
Theoremelfzle2 9695 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.)
(𝐾 ∈ (𝑀...𝑁) → 𝐾𝑁)
 
Theoremelfzuz2 9696 Implication of membership in a finite set of sequential integers. (Contributed by NM, 20-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
(𝐾 ∈ (𝑀...𝑁) → 𝑁 ∈ (ℤ𝑀))
 
Theoremelfzle3 9697 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.)
(𝐾 ∈ (𝑀...𝑁) → 𝑀𝑁)
 
Theoremeluzfz1 9698 Membership in a finite set of sequential integers - special case. (Contributed by NM, 21-Jul-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
(𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ (𝑀...𝑁))
 
Theoremeluzfz2 9699 Membership in a finite set of sequential integers - special case. (Contributed by NM, 13-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
(𝑁 ∈ (ℤ𝑀) → 𝑁 ∈ (𝑀...𝑁))
 
Theoremeluzfz2b 9700 Membership in a finite set of sequential integers - special case. (Contributed by NM, 14-Sep-2005.)
(𝑁 ∈ (ℤ𝑀) ↔ 𝑁 ∈ (𝑀...𝑁))
    < 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-12930
  Copyright terms: Public domain < Previous  Next >