Order on associates of a monoid with zero #
This file shows that the divisibility preorder on Associates M is a partial order when M is
cancellative that it has 0 as a top element.
@[instance_reducible]
Equations
- Associates.instOrderTop = { top := 0, le_top := ⋯ }
@[simp]
theorem Associates.Prime.le_or_le {M : Type u_1} [CommMonoidWithZero M] {p a b : Associates M} (hp : Prime p) (h : p ≤ a * b) :
theorem Associates.dvdNotUnit_of_lt {M : Type u_1} [CommMonoidWithZero M] {a b : Associates M} (hlt : a < b) :
DvdNotUnit a b
@[instance_reducible]
Equations
- Associates.instBoundedOrder = { toOrderTop := Associates.instOrderTop, toOrderBot := Associates.instOrderBot }
@[instance_reducible]
Equations
- Associates.instPartialOrder = { toPreorder := Associates.instPreorder, le_antisymm := ⋯ }
theorem Associates.le_of_mul_le_mul_left {M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] (a b c : Associates M) (ha : a ≠ 0) :
theorem Associates.one_or_eq_of_le_of_prime {M : Type u_1} [CommMonoidWithZero M] {p a : Associates M} [IsCancelMulZero M] (hp : Prime p) (hap : a ≤ p) :
theorem Associates.dvdNotUnit_iff_lt {M : Type u_1} [CommMonoidWithZero M] {a b : Associates M} [IsCancelMulZero M] :
theorem Associates.le_one_iff {M : Type u_1} [CommMonoidWithZero M] {p : Associates M} [IsCancelMulZero M] :