Documentation

Mathlib.Tactic.Inclusion.Extension.IntervalInt.Hypotheses

Hypothesis operations for integer intervals #

This file defines the hypothesis extensions for interval_int.

theorem Inclusion.IntervalInt.Iic_mem_of_le {x y : ℤ} {I : Interval ℤ} (hxy : x ≤ y) (hy : y ∈ I) :
theorem Inclusion.IntervalInt.Ici_mem_of_le {x y : ℤ} {I : Interval ℤ} (hxy : x ≤ y) (hx : x ∈ I) :
theorem Inclusion.IntervalInt.Iic_mem_of_lt {x y : ℤ} {I : Interval ℤ} (hxy : x < y) (hy : y ∈ I) :
theorem Inclusion.IntervalInt.Ici_mem_of_lt {x y : ℤ} {I : Interval ℤ} (hxy : x < y) (hx : x ∈ I) :
theorem Inclusion.IntervalInt.Ici_mem_of_mem_Ioi {a x : ℤ} {I : Interval ℤ} (hx : x ∈ Set.Ioi a) (ha : a ∈ I) :
theorem Inclusion.IntervalInt.Iic_mem_of_mem_Iio {b x : ℤ} {I : Interval ℤ} (hx : x ∈ Set.Iio b) (hb : b ∈ I) :
theorem Inclusion.IntervalInt.Icc_mem_of_mem_Icc {a b x : ℤ} {I J : Interval ℤ} (hx : x ∈ Set.Icc a b) (ha : a ∈ I) (hb : b ∈ J) :
theorem Inclusion.IntervalInt.Icc_mem_of_mem_Ico {a b x : ℤ} {I J : Interval ℤ} (hx : x ∈ Set.Ico a b) (ha : a ∈ I) (hb : b ∈ J) :
x ∈ Interval.Icc I.lb (J.ub - 1)
theorem Inclusion.IntervalInt.Icc_mem_of_mem_Ioc {a b x : ℤ} {I J : Interval ℤ} (hx : x ∈ Set.Ioc a b) (ha : a ∈ I) (hb : b ∈ J) :
x ∈ Interval.Icc (I.lb + 1) J.ub
theorem Inclusion.IntervalInt.Icc_mem_of_mem_Ioo {a b x : ℤ} {I J : Interval ℤ} (hx : x ∈ Set.Ioo a b) (ha : a ∈ I) (hb : b ∈ J) :
x ∈ Interval.Icc (I.lb + 1) (J.ub - 1)