Mathlib Map

Theorems · Definition · combinatorics

Finmap.foldl

{α : Type u} →
  {β : α → Type v} →
    {δ : Type w} →
      (f : δ → (a : α) → β a → δ) →
        (∀ (d : δ) (a₁ : α) (b₁ : β a₁) (a₂ : α) (b₂ : β a₂), f (f d a₁ b₁) a₂ b₂ = f (f d a₂ b₂) a₁ b₁) →
          δ → Finmap β → δ

Fold a commutative function over the key-value pairs in the map

Defined in
Mathlib.Data.Finmap
Cited by
0 results in Mathlib
Foundations
Depth 16 from the axioms · uses propext
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Finmap.all · cited by 0Finmap.allFinmap.any · cited by 0Finmap.anyFinmap.sdiff · cited by 0Finmap.sdiffFinmap · cited by 81FinmapFinmap.entries · cited by 14Finmap.entriesMultiset.foldl · cited by 13Multiset.foldlFinmap.foldlCITED BYCITES

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by3

Results whose statement or proof uses this declaration.