Theorems about invertible elements in a GroupWithZero #
We intentionally keep imports minimal here as this file is used by Mathlib/Tactic/NormNum.lean.
@[instance 100]
instance Invertible.toNeZero {α : Type u} [MulZeroOneClass α] [Nontrivial α] (a : α) [Invertible a] :
NeZero a
@[simp]
A variant of Ring.inverse_unit.
@[instance_reducible]
a⁻¹ is an inverse of a if a ≠ 0
Equations
- invertibleOfNonzero h = { invOf := a⁻¹, invOf_mul_self := ⋯, mul_invOf_self := ⋯ }
Instances For
@[simp]
@[simp]
@[instance_reducible]
a is the inverse of a⁻¹
Equations
- invertibleInv = { invOf := a, invOf_mul_self := ⋯, mul_invOf_self := ⋯ }
@[simp]
@[simp]
@[simp]
@[instance_reducible]
def invertibleDiv {α : Type u} [GroupWithZero α] (a b : α) [Invertible a] [Invertible b] :
Invertible (a / b)
b / a is the inverse of a / b
Equations
- invertibleDiv a b = { invOf := b / a, invOf_mul_self := ⋯, mul_invOf_self := ⋯ }
Instances For
theorem invOf_div {α : Type u} [GroupWithZero α] (a b : α) [Invertible a] [Invertible b] [Invertible (a / b)] :