def termℤ : Lean.ParserDescr

Equations

• termℤ = Lean.ParserDescr.node `termℤ 1024 (Lean.ParserDescr.symbol "ℤ")

theorem Int.coe_nat_eq (n : ℕ) : ↑n = Int.ofNat n

@[deprecated]

def Int.zero : ℤ

The number 0 : ℤ, as a standalone definition.

Equations

• Int.zero = Int.ofNat 0

@[deprecated]

def Int.one : ℤ

The number 1 : ℤ, as a standalone definition.

Equations

• Int.one = Int.ofNat 1

theorem Int.ofNat_add_out (m : ℕ) (n : ℕ) : ↑m + ↑n = ↑(m + n)

theorem Int.ofNat_mul_out (m : ℕ) (n : ℕ) : ↑m * ↑n = ↑(m * n)

theorem Int.ofNat_add_one_out (n : ℕ) : ↑n + 1 = ↑(Nat.succ n)

theorem Int.neg_eq_neg {a : ℤ} {b : ℤ} (h : -a = -b) : a = b

@[deprecated Int.natAbs_eq_zero]

theorem Int.eq_zero_of_natAbs_eq_zero {a : ℤ} : Int.natAbs a = 0 → a = 0

@[deprecated Int.natAbs_pos]

theorem Int.natAbs_pos_of_ne_zero {a : ℤ} (h : a ≠ 0) : 0 < Int.natAbs a

def Int.natMod (m : ℤ) (n : ℤ) : ℕ

The modulus of an integer by another as a natural. Uses the E-rounding convention.

Equations

• Int.natMod m n = Int.toNat (m % n)