Theorems · Theorem · order theory

DFinsupp.Lex.acc_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) →
    (∀ (i : ι), WellFounded (s i)) →
      ∀ [inst_1 : DecidableEq ι] {i : ι},
        Acc (rᶜ ⊓ fun x1 x2 => x1 ≠ x2) i → ∀ (a : α i), Acc (DFinsupp.Lex r s) fun₀ | i => a

Defined in

Mathlib.Data.DFinsupp.WellFounded

Cited by

1 results in Mathlib

Foundations

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

Assumes

ZeroDecidableEq