Theorems · Theorem · combinatorics
Finset.piecewise_piecewise_of_subset_right
∀ {ι : Type u_1} {π : ι → Sort u_2} {s t : Finset ι} [inst : (i : ι) → Decidable (i ∈ s)]
[inst_1 : (i : ι) → Decidable (i ∈ t)],
t ⊆ s → ∀ (f g₁ g₂ : (a : ι) → π a), s.piecewise f (t.piecewise g₁ g₂) = s.piecewise f g₂- Defined in
- Mathlib.Data.Finset.Piecewise
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
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_notMemproof · cited by 12
- Finset.piecewise_congrproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- Finset.piecewise_idem_rightproof · cited by 1