Theorems · Theorem · combinatorics
Finset.piecewise_eq_of_notMem
∀ {ι : Type u_1} {π : ι → Sort u_2} (s : Finset ι) (f g : (i : ι) → π i) [inst : (j : ι) → Decidable (j ∈ s)] {i : ι},
i ∉ s → s.piecewise f g i = g i- Defined in
- Mathlib.Data.Finset.Piecewise
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 55 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.
Cites2
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
Cited by12
Results whose statement or proof uses this declaration.
- MultilinearMap.map_piecewise_smulproof · cited by 4
- MultilinearMap.norm_image_sub_le_of_bound'proof · cited by 3
- MeasureTheory.isPiSystem_squareCylindersproof · cited by 3
- MultilinearMap.map_piecewise_addproof · cited by 3
- MultilinearMap.curryFinFinset_symm_apply_piecewise_constproof · cited by 2
- Finset.piecewise_casesproof · cited by 2
- Finset.update_piecewiseproof · cited by 2
- Finset.piecewise_le_piecewise'proof · cited by 1
- Finset.piecewise_piecewise_of_subset_rightproof · cited by 1
- Finset.piecewise_sameproof · cited by 1
- MultilinearMap.map_sub_map_piecewiseproof · cited by 1
- MultilinearMap.map_piecewise_sub_map_piecewiseproof · cited by 0