mathlib documentation

data.int.basic

@[instance]

def int.inhabited :

Equations

int.inhabited = {default := int.zero}

@[instance]

def int.nontrivial :

@[instance]

def int.comm_ring :

Equations

int.comm_ring = {add := int.add, add_assoc := int.add_assoc, zero := int.zero, zero_add := int.zero_add, add_zero := int.add_zero, neg := int.neg, add_left_neg := int.add_left_neg, add_comm := int.add_comm, mul := int.mul, mul_assoc := int.mul_assoc, one := int.one, one_mul := int.one_mul, mul_one := int.mul_one, left_distrib := int.distrib_left, right_distrib := int.distrib_right, mul_comm := int.mul_comm}

Extra instances to short-circuit type class resolution

@[instance]

def int.add_comm_monoid :

add_comm_monoid ℤ

Equations

int.add_comm_monoid = add_comm_group.to_add_comm_monoid ℤ

@[instance]

def int.add_monoid :

Equations

int.add_monoid = add_group.to_add_monoid ℤ

@[instance]

def int.monoid :

Equations

int.monoid = ring.to_monoid ℤ

@[instance]

def int.comm_monoid :

comm_monoid ℤ

Equations

int.comm_monoid = comm_semiring.to_comm_monoid ℤ

@[instance]

def int.comm_semigroup :

comm_semigroup ℤ

Equations

int.comm_semigroup = comm_ring.to_comm_semigroup ℤ

@[instance]

def int.semigroup :

Equations

int.semigroup = monoid.to_semigroup ℤ

@[instance]

def int.add_comm_semigroup :

add_comm_semigroup ℤ

Equations

int.add_comm_semigroup = add_comm_monoid.to_add_comm_semigroup ℤ

@[instance]

def int.add_semigroup :

add_semigroup ℤ

Equations

int.add_semigroup = add_monoid.to_add_semigroup ℤ

@[instance]

def int.comm_semiring :

comm_semiring ℤ

Equations

int.comm_semiring = comm_ring.to_comm_semiring

@[instance]

def int.semiring :

Equations

int.semiring = ring.to_semiring

@[instance]

def int.ring :

Equations

int.ring = comm_ring.to_ring ℤ

@[instance]

def int.distrib :

Equations

int.distrib = ring.to_distrib ℤ

@[instance]

def int.linear_ordered_comm_ring :

linear_ordered_comm_ring ℤ

Equations

int.linear_ordered_comm_ring = {add := comm_ring.add int.comm_ring, add_assoc := _, zero := comm_ring.zero int.comm_ring, zero_add := _, add_zero := _, neg := comm_ring.neg int.comm_ring, add_left_neg := _, add_comm := _, mul := comm_ring.mul int.comm_ring, mul_assoc := _, one := comm_ring.one int.comm_ring, one_mul := _, mul_one := _, left_distrib := _, right_distrib := _, le := linear_order.le int.linear_order, lt := linear_order.lt int.linear_order, le_refl := _, le_trans := _, lt_iff_le_not_le := _, le_antisymm := _, add_le_add_left := int.add_le_add_left, zero_le_one := int.linear_ordered_comm_ring._proof_1, mul_pos := int.mul_pos, le_total := _, decidable_le := linear_order.decidable_le int.linear_order, decidable_eq := linear_order.decidable_eq int.linear_order, decidable_lt := linear_order.decidable_lt int.linear_order, exists_pair_ne := _, mul_comm := _}

@[instance]

def int.linear_ordered_add_comm_group :

linear_ordered_add_comm_group ℤ

Equations

int.linear_ordered_add_comm_group = linear_ordered_ring.to_linear_ordered_add_comm_group

theorem int.abs_eq_nat_abs (a : ℤ) :

abs a = ↑(a.nat_abs)

theorem int.nat_abs_abs (a : ℤ) :

(abs a).nat_abs = a.nat_abs

theorem int.sign_mul_abs (a : ℤ) :

(a.sign) * abs a = a

@[simp]

theorem int.default_eq_zero :

default ℤ = 0

@[instance]

meta def int.has_to_format :

has_to_format ℤ

@[instance]

meta def int.has_reflect :

has_reflect ℤ

@[simp]

theorem int.add_def {a b : ℤ} :

a.add b = a + b

@[simp]

theorem int.mul_def {a b : ℤ} :

a.mul b = a * b

@[simp]

theorem int.coe_nat_mul_neg_succ (m n : ℕ) :

(↑m) * -[1+ n] = -(↑m) * ↑(n.succ)

@[simp]

theorem int.neg_succ_mul_coe_nat (m n : ℕ) :

-[1+ m] * ↑n = -(↑(m.succ)) * ↑n

@[simp]

theorem int.neg_succ_mul_neg_succ (m n : ℕ) :

-[1+ m] * -[1+ n] = (↑(m.succ)) * ↑(n.succ)

@[simp]

theorem int.coe_nat_le {m n : ℕ} :

↑m ≤ ↑n ↔ m ≤ n

@[simp]

theorem int.coe_nat_lt {m n : ℕ} :

↑m < ↑n ↔ m < n

@[simp]

theorem int.coe_nat_inj' {m n : ℕ} :

↑m = ↑n ↔ m = n

@[simp]

theorem int.coe_nat_pos {n : ℕ} :

0 < ↑n ↔ 0 < n

@[simp]

theorem int.coe_nat_eq_zero {n : ℕ} :

↑n = 0 ↔ n = 0

theorem int.coe_nat_ne_zero {n : ℕ} :

↑n ≠ 0 ↔ n ≠ 0

@[simp]

theorem int.coe_nat_nonneg (n : ℕ) :

theorem int.coe_nat_ne_zero_iff_pos {n : ℕ} :

↑n ≠ 0 ↔ 0 < n

theorem int.coe_nat_succ_pos (n : ℕ) :

0 < ↑(n.succ)

@[simp]

theorem int.coe_nat_abs (n : ℕ) :

abs ↑n = ↑n

succ and pred

def int.succ :

Immediate successor of an integer: succ n = n + 1

Equations

a.succ = a + 1

def int.pred :

Immediate predecessor of an integer: pred n = n - 1

Equations

a.pred = a - 1

theorem int.nat_succ_eq_int_succ (n : ℕ) :

↑(n.succ) = ↑n.succ

theorem int.pred_succ (a : ℤ) :

a.succ.pred = a

theorem int.succ_pred (a : ℤ) :

a.pred.succ = a

theorem int.neg_succ (a : ℤ) :

-a.succ = (-a).pred

theorem int.succ_neg_succ (a : ℤ) :

(-a.succ).succ = -a

theorem int.neg_pred (a : ℤ) :

-a.pred = (-a).succ

theorem int.pred_neg_pred (a : ℤ) :

(-a.pred).pred = -a

theorem int.pred_nat_succ (n : ℕ) :

↑(n.succ).pred = ↑n

theorem int.neg_nat_succ (n : ℕ) :

-↑(n.succ) = (-↑n).pred

theorem int.succ_neg_nat_succ (n : ℕ) :

(-↑(n.succ)).succ = -↑n

theorem int.lt_succ_self (a : ℤ) :

a < a.succ

theorem int.pred_self_lt (a : ℤ) :

a.pred < a

theorem int.add_one_le_iff {a b : ℤ} :

a + 1 ≤ b ↔ a < b

theorem int.lt_add_one_iff {a b : ℤ} :

a < b + 1 ↔ a ≤ b

theorem int.le_add_one {a b : ℤ} :

a ≤ b → a ≤ b + 1

theorem int.sub_one_lt_iff {a b : ℤ} :

a - 1 < b ↔ a ≤ b

theorem int.le_sub_one_iff {a b : ℤ} :

a ≤ b - 1 ↔ a < b

theorem int.induction_on {p : ℤ → Prop} (i : ℤ) :

p 0 → (∀ (i : ℕ), p ↑i → p (↑i + 1)) → (∀ (i : ℕ), p (-↑i) → p (-↑i - 1)) → p i

def int.induction_on' {C : ℤ → Sort u_1} (z b : ℤ) :

C b → (Π (k : ℤ), b ≤ k → C k → C (k + 1)) → (Π (k : ℤ), k ≤ b → C k → C (k - 1)) → C z

Inductively define a function on ℤ by defining it at b, for the succ of a number greater than b, and the pred of a number less than b.

Equations

z.induction_on' b = λ (H0 : C b) (Hs : Π (k : ℤ), b ≤ k → C k → C (k + 1)) (Hp : Π (k : ℤ), k ≤ b → C k → C (k - 1)), _.mpr (int.rec (λ (a : ℕ), nat.rec (_.mpr (_.mpr H0)) (λ (n : ℕ) (ih : C (int.of_nat n + b)), _.mpr (_.mpr (_.mpr (_.mpr (Hs (int.of_nat n + b) _ ih))))) a) (λ (a : ℕ), nat.rec (_.mpr (_.mpr (_.mpr (_.mpr (_.mpr (Hp b _ H0)))))) (λ (n : ℕ) (ih : C (-[1+ n] + b)), _.mpr (_.mpr (_.mpr (_.mpr (Hp (-[1+ n] + b) _ ih))))) a) (z - b))

nat abs

theorem int.nat_abs_add_le (a b : ℤ) :

(a + b).nat_abs ≤ a.nat_abs + b.nat_abs

theorem int.nat_abs_neg_of_nat (n : ℕ) :

(int.neg_of_nat n).nat_abs = n

theorem int.nat_abs_mul (a b : ℤ) :

(a * b).nat_abs = (a.nat_abs) * b.nat_abs

@[simp]

theorem int.nat_abs_mul_self' (a : ℤ) :

(↑(a.nat_abs)) * ↑(a.nat_abs) = a * a

theorem int.neg_succ_of_nat_eq' (m : ℕ) :

-[1+ m] = -↑m - 1

theorem int.nat_abs_ne_zero_of_ne_zero {z : ℤ} :

z ≠ 0 → z.nat_abs ≠ 0

@[simp]

theorem int.nat_abs_eq_zero {a : ℤ} :

a.nat_abs = 0 ↔ a = 0

theorem int.nat_abs_lt_nat_abs_of_nonneg_of_lt {a b : ℤ} :

0 ≤ a → a < b → a.nat_abs < b.nat_abs

theorem int.nat_abs_eq_iff_mul_self_eq {a b : ℤ} :

a.nat_abs = b.nat_abs ↔ a * a = b * b

theorem int.nat_abs_lt_iff_mul_self_lt {a b : ℤ} :

a.nat_abs < b.nat_abs ↔ a * a < b * b

theorem int.nat_abs_le_iff_mul_self_le {a b : ℤ} :

a.nat_abs ≤ b.nat_abs ↔ a * a ≤ b * b

theorem int.nat_abs_eq_iff_sq_eq {a b : ℤ} :

a.nat_abs = b.nat_abs ↔ a ^ 2 = b ^ 2

theorem int.nat_abs_lt_iff_sq_lt {a b : ℤ} :

a.nat_abs < b.nat_abs ↔ a ^ 2 < b ^ 2

theorem int.nat_abs_le_iff_sq_le {a b : ℤ} :

a.nat_abs ≤ b.nat_abs ↔ a ^ 2 ≤ b ^ 2

`/`

@[simp]

theorem int.of_nat_div (m n : ℕ) :

int.of_nat (m / n) = int.of_nat m / int.of_nat n

@[simp]

theorem int.coe_nat_div (m n : ℕ) :

↑(m / n) = ↑m / ↑n

theorem int.neg_succ_of_nat_div (m : ℕ) {b : ℤ} :

0 < b → -[1+ m] / b = -(↑m / b + 1)

@[simp]

theorem int.div_neg (a b : ℤ) :

a / -b = -(a / b)

theorem int.div_of_neg_of_pos {a b : ℤ} :

a < 0 → 0 < b → a / b = -((-a - 1) / b + 1)

theorem int.div_nonneg {a b : ℤ} :

0 ≤ a → 0 ≤ b → 0 ≤ a / b

theorem int.div_nonpos {a b : ℤ} :

0 ≤ a → b ≤ 0 → a / b ≤ 0

theorem int.div_neg' {a b : ℤ} :

a < 0 → 0 < b → a / b < 0

theorem int.zero_div (b : ℤ) :

0 / b = 0

theorem int.div_zero (a : ℤ) :

a / 0 = 0

@[simp]

theorem int.div_one (a : ℤ) :

a / 1 = a

theorem int.div_eq_zero_of_lt {a b : ℤ} :

0 ≤ a → a < b → a / b = 0

theorem int.div_eq_zero_of_lt_abs {a b : ℤ} :

0 ≤ a → a < abs b → a / b = 0

theorem int.add_mul_div_right (a b : ℤ) {c : ℤ} :

c ≠ 0 → (a + b * c) / c = a / c + b

theorem int.add_mul_div_left (a : ℤ) {b : ℤ} (c : ℤ) :

b ≠ 0 → (a + b * c) / b = a / b + c

@[simp]

theorem int.mul_div_cancel (a : ℤ) {b : ℤ} :

b ≠ 0 → a * b / b = a

@[simp]

theorem int.mul_div_cancel_left {a : ℤ} (b : ℤ) :

a ≠ 0 → a * b / a = b

@[simp]

theorem int.div_self {a : ℤ} :

a ≠ 0 → a / a = 1

mod

theorem int.of_nat_mod (m n : ℕ) :

↑m % ↑n = int.of_nat (m % n)

@[simp]

theorem int.coe_nat_mod (m n : ℕ) :

↑(m % n) = ↑m % ↑n

theorem int.neg_succ_of_nat_mod (m : ℕ) {b : ℤ} :

0 < b → -[1+ m] % b = b - 1 - ↑m % b

@[simp]

theorem int.mod_neg (a b : ℤ) :

a % -b = a % b

@[simp]

theorem int.mod_abs (a b : ℤ) :

a % abs b = a % b

theorem int.zero_mod (b : ℤ) :

0 % b = 0

theorem int.mod_zero (a : ℤ) :

a % 0 = a

theorem int.mod_one (a : ℤ) :

a % 1 = 0

theorem int.mod_eq_of_lt {a b : ℤ} :

0 ≤ a → a < b → a % b = a

theorem int.mod_nonneg (a : ℤ) {b : ℤ} :

b ≠ 0 → 0 ≤ a % b

theorem int.mod_lt_of_pos (a : ℤ) {b : ℤ} :

0 < b → a % b < b

theorem int.mod_lt (a : ℤ) {b : ℤ} :

b ≠ 0 → a % b < abs b

theorem int.mod_add_div_aux (m n : ℕ) :

↑n - (↑m % ↑n + 1) - ((↑n) * (↑m / ↑n) + ↑n) = -[1+ m]

theorem int.mod_add_div (a b : ℤ) :

a % b + b * (a / b) = a

theorem int.mod_def (a b : ℤ) :

a % b = a - b * (a / b)

@[simp]

theorem int.add_mul_mod_self {a b c : ℤ} :

(a + b * c) % c = a % c

@[simp]

theorem int.add_mul_mod_self_left (a b c : ℤ) :

(a + b * c) % b = a % b

@[simp]

theorem int.add_mod_self {a b : ℤ} :

(a + b) % b = a % b

@[simp]

theorem int.add_mod_self_left {a b : ℤ} :

(a + b) % a = b % a

@[simp]

theorem int.mod_add_mod (m n k : ℤ) :

(m % n + k) % n = (m + k) % n

@[simp]

theorem int.add_mod_mod (m n k : ℤ) :

(m + n % k) % k = (m + n) % k

theorem int.add_mod (a b n : ℤ) :

(a + b) % n = (a % n + b % n) % n

theorem int.add_mod_eq_add_mod_right {m n k : ℤ} (i : ℤ) :

m % n = k % n → (m + i) % n = (k + i) % n

theorem int.add_mod_eq_add_mod_left {m n k : ℤ} (i : ℤ) :

m % n = k % n → (i + m) % n = (i + k) % n

theorem int.mod_add_cancel_right {m n k : ℤ} (i : ℤ) :

(m + i) % n = (k + i) % n ↔ m % n = k % n

theorem int.mod_add_cancel_left {m n k i : ℤ} :

(i + m) % n = (i + k) % n ↔ m % n = k % n

theorem int.mod_sub_cancel_right {m n k : ℤ} (i : ℤ) :

(m - i) % n = (k - i) % n ↔ m % n = k % n

theorem int.mod_eq_mod_iff_mod_sub_eq_zero {m n k : ℤ} :

m % n = k % n ↔ (m - k) % n = 0

@[simp]

theorem int.mul_mod_left (a b : ℤ) :

a * b % b = 0

@[simp]

theorem int.mul_mod_right (a b : ℤ) :

a * b % a = 0

theorem int.mul_mod (a b n : ℤ) :

a * b % n = (a % n) * (b % n) % n

theorem int.mod_self {a : ℤ} :

a % a = 0

@[simp]

theorem int.mod_mod_of_dvd (n : ℤ) {m k : ℤ} :

m ∣ k → n % k % m = n % m

@[simp]

theorem int.mod_mod (a b : ℤ) :

a % b % b = a % b

theorem int.sub_mod (a b n : ℤ) :

(a - b) % n = (a % n - b % n) % n

properties of `/` and `%`

@[simp]

theorem int.mul_div_mul_of_pos {a : ℤ} (b c : ℤ) :

0 < a → a * b / a * c = b / c

@[simp]

theorem int.mul_div_mul_of_pos_left (a : ℤ) {b : ℤ} (c : ℤ) :

0 < b → a * b / c * b = a / c

@[simp]

theorem int.mul_mod_mul_of_pos {a : ℤ} (b c : ℤ) :

0 < a → a * b % a * c = a * (b % c)

theorem int.lt_div_add_one_mul_self (a : ℤ) {b : ℤ} :

0 < b → a < (a / b + 1) * b

theorem int.abs_div_le_abs (a b : ℤ) :

abs (a / b) ≤ abs a

theorem int.div_le_self {a : ℤ} (b : ℤ) :

0 ≤ a → a / b ≤ a

theorem int.mul_div_cancel_of_mod_eq_zero {a b : ℤ} :

a % b = 0 → b * (a / b) = a

theorem int.div_mul_cancel_of_mod_eq_zero {a b : ℤ} :

a % b = 0 → (a / b) * b = a

theorem int.mod_two_eq_zero_or_one (n : ℤ) :

n % 2 = 0 ∨ n % 2 = 1

dvd

theorem int.coe_nat_dvd {m n : ℕ} :

↑m ∣ ↑n ↔ m ∣ n

theorem int.coe_nat_dvd_left {n : ℕ} {z : ℤ} :

↑n ∣ z ↔ n ∣ z.nat_abs

theorem int.coe_nat_dvd_right {n : ℕ} {z : ℤ} :

z ∣ ↑n ↔ z.nat_abs ∣ n

theorem int.dvd_antisymm {a b : ℤ} :

0 ≤ a → 0 ≤ b → a ∣ b → b ∣ a → a = b

theorem int.dvd_of_mod_eq_zero {a b : ℤ} :

b % a = 0 → a ∣ b

theorem int.mod_eq_zero_of_dvd {a b : ℤ} :

a ∣ b → b % a = 0

theorem int.dvd_iff_mod_eq_zero (a b : ℤ) :

a ∣ b ↔ b % a = 0

theorem int.dvd_sub_of_mod_eq {a b c : ℤ} :

a % b = c → b ∣ a - c

If a % b = c then b divides a - c.

theorem int.nat_abs_dvd {a b : ℤ} :

↑(a.nat_abs) ∣ b ↔ a ∣ b

theorem int.dvd_nat_abs {a b : ℤ} :

a ∣ ↑(b.nat_abs) ↔ a ∣ b

@[instance]

def int.decidable_dvd :

decidable_rel has_dvd.dvd

Equations

int.decidable_dvd = λ (a n : ℤ), decidable_of_decidable_of_iff (int.decidable_eq (n % a) 0) _

theorem int.div_mul_cancel {a b : ℤ} :

b ∣ a → (a / b) * b = a

theorem int.mul_div_cancel' {a b : ℤ} :

a ∣ b → a * (b / a) = b

theorem int.mul_div_assoc (a : ℤ) {b c : ℤ} :

c ∣ b → a * b / c = a * (b / c)

theorem int.div_dvd_div {a b c : ℤ} :

a ∣ b → b ∣ c → b / a ∣ c / a

theorem int.eq_mul_of_div_eq_right {a b c : ℤ} :

b ∣ a → a / b = c → a = b * c

theorem int.div_eq_of_eq_mul_right {a b c : ℤ} :

b ≠ 0 → a = b * c → a / b = c

theorem int.eq_div_of_mul_eq_right {a b c : ℤ} :

a ≠ 0 → a * b = c → b = c / a

theorem int.div_eq_iff_eq_mul_right {a b c : ℤ} :

b ≠ 0 → b ∣ a → (a / b = c ↔ a = b * c)

theorem int.div_eq_iff_eq_mul_left {a b c : ℤ} :

b ≠ 0 → b ∣ a → (a / b = c ↔ a = c * b)

theorem int.eq_mul_of_div_eq_left {a b c : ℤ} :

b ∣ a → a / b = c → a = c * b

theorem int.div_eq_of_eq_mul_left {a b c : ℤ} :

b ≠ 0 → a = c * b → a / b = c

theorem int.neg_div_of_dvd {a b : ℤ} :

b ∣ a → -a / b = -(a / b)

theorem int.add_div_of_dvd {a b c : ℤ} :

c ∣ a → c ∣ b → (a + b) / c = a / c + b / c

theorem int.div_sign (a b : ℤ) :

a / b.sign = a * b.sign

@[simp]

theorem int.sign_mul (a b : ℤ) :

(a * b).sign = (a.sign) * b.sign

theorem int.sign_eq_div_abs (a : ℤ) :

a.sign = a / abs a

theorem int.mul_sign (i : ℤ) :

i * i.sign = ↑(i.nat_abs)

theorem int.le_of_dvd {a b : ℤ} :

0 < b → a ∣ b → a ≤ b

theorem int.eq_one_of_dvd_one {a : ℤ} :

0 ≤ a → a ∣ 1 → a = 1

theorem int.eq_one_of_mul_eq_one_right {a b : ℤ} :

0 ≤ a → a * b = 1 → a = 1

theorem int.eq_one_of_mul_eq_one_left {a b : ℤ} :

0 ≤ b → a * b = 1 → b = 1

theorem int.of_nat_dvd_of_dvd_nat_abs {a : ℕ} {z : ℤ} :

a ∣ z.nat_abs → ↑a ∣ z

theorem int.dvd_nat_abs_of_of_nat_dvd {a : ℕ} {z : ℤ} :

↑a ∣ z → a ∣ z.nat_abs

theorem int.pow_dvd_of_le_of_pow_dvd {p m n : ℕ} {k : ℤ} :

m ≤ n → ↑(p ^ n) ∣ k → ↑(p ^ m) ∣ k

theorem int.dvd_of_pow_dvd {p k : ℕ} {m : ℤ} :

1 ≤ k → ↑(p ^ k) ∣ m → ↑p ∣ m

theorem int.exists_lt_and_lt_iff_not_dvd (m : ℤ) {n : ℤ} :

0 < n → ((∃ (k : ℤ), n * k < m ∧ m < n * (k + 1)) ↔ ¬n ∣ m)

If n > 0 then m is not divisible by n iff it is between n * k and n * (k + 1) for some k.

`/` and ordering

theorem int.div_mul_le (a : ℤ) {b : ℤ} :

b ≠ 0 → (a / b) * b ≤ a

theorem int.div_le_of_le_mul {a b c : ℤ} :

0 < c → a ≤ b * c → a / c ≤ b

theorem int.mul_lt_of_lt_div {a b c : ℤ} :

0 < c → a < b / c → a * c < b

theorem int.mul_le_of_le_div {a b c : ℤ} :

0 < c → a ≤ b / c → a * c ≤ b

theorem int.le_div_of_mul_le {a b c : ℤ} :

0 < c → a * c ≤ b → a ≤ b / c

theorem int.le_div_iff_mul_le {a b c : ℤ} :

0 < c → (a ≤ b / c ↔ a * c ≤ b)

theorem int.div_le_div {a b c : ℤ} :

0 < c → a ≤ b → a / c ≤ b / c

theorem int.div_lt_of_lt_mul {a b c : ℤ} :

0 < c → a < b * c → a / c < b

theorem int.lt_mul_of_div_lt {a b c : ℤ} :

0 < c → a / c < b → a < b * c

theorem int.div_lt_iff_lt_mul {a b c : ℤ} :

0 < c → (a / c < b ↔ a < b * c)

theorem int.le_mul_of_div_le {a b c : ℤ} :

0 ≤ b → b ∣ a → a / b ≤ c → a ≤ c * b

theorem int.lt_div_of_mul_lt {a b c : ℤ} :

0 ≤ b → b ∣ c → a * b < c → a < c / b

theorem int.lt_div_iff_mul_lt {a b : ℤ} (c : ℤ) :

0 < c → c ∣ b → (a < b / c ↔ a * c < b)

theorem int.div_pos_of_pos_of_dvd {a b : ℤ} :

0 < a → 0 ≤ b → b ∣ a → 0 < a / b

theorem int.div_eq_div_of_mul_eq_mul {a b c d : ℤ} :

d ∣ c → b ≠ 0 → d ≠ 0 → a * d = b * c → a / b = c / d

theorem int.eq_mul_div_of_mul_eq_mul_of_dvd_left {a b c d : ℤ} :

b ≠ 0 → b ∣ c → b * a = c * d → a = (c / b) * d

theorem int.eq_zero_of_dvd_of_nat_abs_lt_nat_abs {a b : ℤ} :

a ∣ b → b.nat_abs < a.nat_abs → b = 0

If an integer with larger absolute value divides an integer, it is zero.

theorem int.eq_zero_of_dvd_of_nonneg_of_lt {a b : ℤ} :

0 ≤ a → a < b → b ∣ a → a = 0

theorem int.eq_of_mod_eq_of_nat_abs_sub_lt_nat_abs {a b c : ℤ} :

a % b = c → (a - c).nat_abs < b.nat_abs → a = c

If two integers are congruent to a sufficiently large modulus, they are equal.

theorem int.of_nat_add_neg_succ_of_nat_of_lt {m n : ℕ} :

m < n.succ → int.of_nat m + -[1+ n] = -[1+ n - m]

theorem int.of_nat_add_neg_succ_of_nat_of_ge {m n : ℕ} :

n.succ ≤ m → int.of_nat m + -[1+ n] = int.of_nat (m - n.succ)

@[simp]

theorem int.neg_add_neg (m n : ℕ) :

-[1+ m] + -[1+ n] = -[1+ (m + n).succ]

to_nat

theorem int.to_nat_eq_max (a : ℤ) :

↑(a.to_nat) = max a 0

@[simp]

theorem int.to_nat_zero :

@[simp]

theorem int.to_nat_one :

@[simp]

theorem int.to_nat_of_nonneg {a : ℤ} :

0 ≤ a → ↑(a.to_nat) = a

@[simp]

theorem int.to_nat_sub_of_le (a b : ℤ) :

b ≤ a → ↑((a + -b).to_nat) = a + -b

@[simp]

theorem int.to_nat_coe_nat (n : ℕ) :

↑n.to_nat = n

@[simp]

theorem int.to_nat_coe_nat_add_one {n : ℕ} :

(↑n + 1).to_nat = n + 1

theorem int.le_to_nat (a : ℤ) :

a ≤ ↑(a.to_nat)

@[simp]

theorem int.to_nat_le {a : ℤ} {n : ℕ} :

a.to_nat ≤ n ↔ a ≤ ↑n

@[simp]

theorem int.lt_to_nat {n : ℕ} {a : ℤ} :

n < a.to_nat ↔ ↑n < a

theorem int.to_nat_le_to_nat {a b : ℤ} :

a ≤ b → a.to_nat ≤ b.to_nat

theorem int.to_nat_lt_to_nat {a b : ℤ} :

0 < b → (a.to_nat < b.to_nat ↔ a < b)

theorem int.lt_of_to_nat_lt {a b : ℤ} :

a.to_nat < b.to_nat → a < b

theorem int.to_nat_add {a b : ℤ} :

0 ≤ a → 0 ≤ b → (a + b).to_nat = a.to_nat + b.to_nat

theorem int.to_nat_add_one {a : ℤ} :

0 ≤ a → (a + 1).to_nat = a.to_nat + 1

def int.to_nat' :

ℤ → option ℕ

If n : ℕ, then int.to_nat' n = some n, if n : ℤ is negative, then int.to_nat' n = none.

Equations

-[1+ n].to_nat' = none
↑n.to_nat' = some n

theorem int.mem_to_nat' (a : ℤ) (n : ℕ) :

n ∈ a.to_nat' ↔ a = ↑n

theorem int.to_nat_zero_of_neg {z : ℤ} :

z < 0 → z.to_nat = 0

units

@[simp]

theorem int.units_nat_abs (u : units ℤ) :

↑u.nat_abs = 1

theorem int.units_eq_one_or (u : units ℤ) :

u = 1 ∨ u = -1

theorem int.units_inv_eq_self (u : units ℤ) :

bitwise ops

@[simp]

theorem int.bodd_zero :

@[simp]

theorem int.bodd_one :

theorem int.bodd_two :

@[simp]

theorem int.bodd_coe (n : ℕ) :

↑n.bodd = n.bodd

@[simp]

theorem int.bodd_sub_nat_nat (m n : ℕ) :

(int.sub_nat_nat m n).bodd = bxor m.bodd n.bodd

@[simp]

theorem int.bodd_neg_of_nat (n : ℕ) :

(int.neg_of_nat n).bodd = n.bodd

@[simp]

theorem int.bodd_neg (n : ℤ) :

(-n).bodd = n.bodd

@[simp]

theorem int.bodd_add (m n : ℤ) :

(m + n).bodd = bxor m.bodd n.bodd

@[simp]

theorem int.bodd_mul (m n : ℤ) :

(m * n).bodd = m.bodd && n.bodd

theorem int.bodd_add_div2 (n : ℤ) :

cond n.bodd 1 0 + 2 * n.div2 = n

theorem int.div2_val (n : ℤ) :

n.div2 = n / 2

theorem int.bit0_val (n : ℤ) :

bit0 n = 2 * n

theorem int.bit1_val (n : ℤ) :

bit1 n = 2 * n + 1

theorem int.bit_val (b : bool) (n : ℤ) :

int.bit b n = 2 * n + cond b 1 0

theorem int.bit_decomp (n : ℤ) :

int.bit n.bodd n.div2 = n

def int.bit_cases_on {C : ℤ → Sort u} (n : ℤ) :

(Π (b : bool) (n : ℤ), C (int.bit b n)) → C n

Defines a function from ℤ conditionally, if it is defined for odd and even integers separately using bit.

Equations

n.bit_cases_on h = _.mpr (h n.bodd n.div2)

@[simp]

theorem int.bit_zero :

int.bit ff 0 = 0

@[simp]

theorem int.bit_coe_nat (b : bool) (n : ℕ) :

int.bit b ↑n = ↑(nat.bit b n)

@[simp]

theorem int.bit_neg_succ (b : bool) (n : ℕ) :

int.bit b -[1+ n] = -[1+ nat.bit (!b) n]

@[simp]

theorem int.bodd_bit (b : bool) (n : ℤ) :

(int.bit b n).bodd = b

@[simp]

theorem int.bodd_bit0 (n : ℤ) :

(bit0 n).bodd = ff

@[simp]

theorem int.bodd_bit1 (n : ℤ) :

(bit1 n).bodd = tt

@[simp]

theorem int.div2_bit (b : bool) (n : ℤ) :

(int.bit b n).div2 = n

theorem int.bit0_ne_bit1 (m n : ℤ) :

bit0 m ≠ bit1 n

theorem int.bit1_ne_bit0 (m n : ℤ) :

bit1 m ≠ bit0 n

theorem int.bit1_ne_zero (m : ℤ) :

@[simp]

theorem int.test_bit_zero (b : bool) (n : ℤ) :

(int.bit b n).test_bit 0 = b

@[simp]

theorem int.test_bit_succ (m : ℕ) (b : bool) (n : ℤ) :

(int.bit b n).test_bit m.succ = n.test_bit m

theorem int.bitwise_or :

int.bitwise bor = int.lor

theorem int.bitwise_and :

int.bitwise band = int.land

theorem int.bitwise_diff :

int.bitwise (λ (a b : bool), a && !b) = int.ldiff

theorem int.bitwise_xor :

int.bitwise bxor = int.lxor

@[simp]

theorem int.bitwise_bit (f : bool → bool → bool) (a : bool) (m : ℤ) (b : bool) (n : ℤ) :

int.bitwise f (int.bit a m) (int.bit b n) = int.bit (f a b) (int.bitwise f m n)

@[simp]

theorem int.lor_bit (a : bool) (m : ℤ) (b : bool) (n : ℤ) :

(int.bit a m).lor (int.bit b n) = int.bit (a || b) (m.lor n)

@[simp]

theorem int.land_bit (a : bool) (m : ℤ) (b : bool) (n : ℤ) :

(int.bit a m).land (int.bit b n) = int.bit (a && b) (m.land n)

@[simp]

theorem int.ldiff_bit (a : bool) (m : ℤ) (b : bool) (n : ℤ) :

(int.bit a m).ldiff (int.bit b n) = int.bit (a && !b) (m.ldiff n)

@[simp]

theorem int.lxor_bit (a : bool) (m : ℤ) (b : bool) (n : ℤ) :

(int.bit a m).lxor (int.bit b n) = int.bit (bxor a b) (m.lxor n)

@[simp]

theorem int.lnot_bit (b : bool) (n : ℤ) :

(int.bit b n).lnot = int.bit (!b) n.lnot

@[simp]

theorem int.test_bit_bitwise (f : bool → bool → bool) (m n : ℤ) (k : ℕ) :

(int.bitwise f m n).test_bit k = f (m.test_bit k) (n.test_bit k)

@[simp]

theorem int.test_bit_lor (m n : ℤ) (k : ℕ) :

(m.lor n).test_bit k = m.test_bit k || n.test_bit k

@[simp]

theorem int.test_bit_land (m n : ℤ) (k : ℕ) :

(m.land n).test_bit k = m.test_bit k && n.test_bit k

@[simp]

theorem int.test_bit_ldiff (m n : ℤ) (k : ℕ) :

(m.ldiff n).test_bit k = m.test_bit k && !n.test_bit k

@[simp]

theorem int.test_bit_lxor (m n : ℤ) (k : ℕ) :

(m.lxor n).test_bit k = bxor (m.test_bit k) (n.test_bit k)

@[simp]

theorem int.test_bit_lnot (n : ℤ) (k : ℕ) :

n.lnot.test_bit k = !n.test_bit k

theorem int.shiftl_add (m : ℤ) (n : ℕ) (k : ℤ) :

m.shiftl (↑n + k) = (m.shiftl ↑n).shiftl k

theorem int.shiftl_sub (m : ℤ) (n : ℕ) (k : ℤ) :

m.shiftl (↑n - k) = (m.shiftl ↑n).shiftr k

@[simp]

theorem int.shiftl_neg (m n : ℤ) :

m.shiftl (-n) = m.shiftr n

@[simp]

theorem int.shiftr_neg (m n : ℤ) :

m.shiftr (-n) = m.shiftl n

@[simp]

theorem int.shiftl_coe_nat (m n : ℕ) :

↑m.shiftl ↑n = ↑(m.shiftl n)

@[simp]

theorem int.shiftr_coe_nat (m n : ℕ) :

↑m.shiftr ↑n = ↑(m.shiftr n)

@[simp]

theorem int.shiftl_neg_succ (m n : ℕ) :

-[1+ m].shiftl ↑n = -[1+ nat.shiftl' tt m n]

@[simp]

theorem int.shiftr_neg_succ (m n : ℕ) :

-[1+ m].shiftr ↑n = -[1+ m.shiftr n]

theorem int.shiftr_add (m : ℤ) (n k : ℕ) :

m.shiftr (↑n + ↑k) = (m.shiftr ↑n).shiftr ↑k

theorem int.shiftl_eq_mul_pow (m : ℤ) (n : ℕ) :

m.shiftl ↑n = m * ↑(2 ^ n)

theorem int.shiftr_eq_div_pow (m : ℤ) (n : ℕ) :

m.shiftr ↑n = m / ↑(2 ^ n)

theorem int.one_shiftl (n : ℕ) :

1.shiftl ↑n = ↑(2 ^ n)

@[simp]

theorem int.zero_shiftl (n : ℤ) :

0.shiftl n = 0

@[simp]

theorem int.zero_shiftr (n : ℤ) :

0.shiftr n = 0

Least upper bound property for integers

theorem int.exists_least_of_bdd {P : ℤ → Prop} :

(∃ (b : ℤ), ∀ (z : ℤ), P z → b ≤ z) → (∃ (z : ℤ), P z) → (∃ (lb : ℤ), P lb ∧ ∀ (z : ℤ), P z → lb ≤ z)

theorem int.exists_greatest_of_bdd {P : ℤ → Prop} :

(∃ (b : ℤ), ∀ (z : ℤ), P z → z ≤ b) → (∃ (z : ℤ), P z) → (∃ (ub : ℤ), P ub ∧ ∀ (z : ℤ), P z → z ≤ ub)