Theorems · Theorem · combinatorics
Finset.piecewise_idem_right
∀ {ι : Type u_1} {π : ι → Sort u_2} (s : Finset ι) [inst : (j : ι) → Decidable (j ∈ s)] (f g₁ g₂ : (a : ι) → π a),
s.piecewise f (s.piecewise g₁ g₂) = s.piecewise f g₂- Defined in
- Mathlib.Data.Finset.Piecewise
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Decidable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Finset.piecewisestatement · cited by 64
- Finset.Subset.reflproof · cited by 29
- Finset.piecewise_piecewise_of_subset_rightproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- MultilinearMap.map_piecewise_sub_map_piecewiseproof · cited by 0