Theorems · Theorem · order theory

Finsupp.single_le_iff

∀ {ι : Type u_1} {α : Type u_3} [inst : AddCommMonoid α] [inst_1 : PartialOrder α] [CanonicallyOrderedAdd α] {i : ι}
  {x : α} {f : ι →₀ α}, (fun₀ | i => x) ≤ f ↔ x ≤ f i

Defined in

Mathlib.Data.Finsupp.Order

Cited by

3 results in Mathlib

Foundations

Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

AddCommMonoidPartialOrderCanonicallyOrderedAdd