Mathlib Map

Theorems · Theorem · combinatorics

Finset.piecewise_same

∀ {ι : Type u_1} {π : ι → Sort u_2} (s : Finset ι) (f : (i : ι) → π i) [inst : (j : ι) → Decidable (j ∈ s)],
  s.piecewise f f = f
Defined in
Mathlib.Data.Finset.Piecewise
Cited by
1 results in Mathlib
Foundations
Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
Decidable
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

FormalMultilinearSeries.derivSeries_apply_diag · cited by 2FormalMultilinearSeries.d…Finset · cited by 13712FinsetFinset.piecewise · cited by 64Finset.piecewiseFinset.piecewise_eq_of_mem · cited by 13Finset.piecewise_eq_of_memFinset.piecewise_eq_of_notMem · cited by 12Finset.piecewise_eq_of_no…Finset.piecewise_sameCITED BYCITES

Cites4

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

Cited by1

Results whose statement or proof uses this declaration.