Theorems · Theorem · combinatorics
List.Perm.foldr_op_eq
∀ {α : Type u_1} {op : α → α → α} [IA : Std.Associative op] [IC : Std.Commutative op] {l₁ l₂ : List α} {a : α},
l₁.Perm l₂ → List.foldr op a l₁ = List.foldr op a l₂- Defined in
- Mathlib.Data.List.Perm.Basic
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- List.Perm.foldr_eqproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- List.Perm.prod_eqproof · cited by 7
- List.Perm.sum_eqproof · cited by 0