Theorems · Theorem · combinatorics
Finset.piecewise_cases
∀ {ι : Type u_1} {π : ι → Sort u_2} (s : Finset ι) (f g : (i : ι) → π i) [inst : (j : ι) → Decidable (j ∈ s)] {i : ι}
(p : π i → Prop), p (f i) → p (g i) → p (s.piecewise f g i)- Defined in
- Mathlib.Data.Finset.Piecewise
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 56 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.piecewise_eq_of_memproof · cited by 13
- Finset.piecewise_eq_of_notMemproof · cited by 12
Cited by2
Results whose statement or proof uses this declaration.
- Finset.le_piecewise_of_le_of_leproof · cited by 1
- Finset.piecewise_le_of_le_of_leproof · cited by 1