Theorems · Theorem · order theory

DFinsupp.Lex.acc

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

Defined in

Mathlib.Data.DFinsupp.WellFounded

Cited by

2 results in Mathlib

Foundations

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

Assumes

ZeroDecidableEqDecidable