Theorems · Theorem · order theory

DFinsupp.Lex.acc_of_single

∀ {ι : Type u_1} {α : ι → Type u_2} [inst : (i : ι) → Zero (α i)] {r : ι → ι → Prop} {s : (i : ι) → α i → α i → Prop},
  (∀ ⦃i : ι⦄ ⦃a : α i⦄, ¬s i a 0) →
    ∀ [inst_1 : DecidableEq ι] [inst_2 : (i : ι) → (x : α i) → Decidable (x ≠ 0)] (x : Π₀ (i : ι), α i),
      (∀ i ∈ x.support, Acc (DFinsupp.Lex r s) fun₀ | i => x i) → Acc (DFinsupp.Lex r s) x

Defined in

Mathlib.Data.DFinsupp.WellFounded

Cited by

2 results in Mathlib

Foundations

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

Assumes

ZeroDecidableEqDecidable