Theorems · Theorem · combinatorics
Finset.piecewise_congr
∀ {ι : Type u_1} {π : ι → Sort u_2} (s : Finset ι) [inst : (j : ι) → Decidable (j ∈ s)] {f f' g g' : (i : ι) → π i},
(∀ i ∈ s, f i = f' i) → (∀ i ∉ s, g i = g' i) → s.piecewise f g = s.piecewise f' g'- Defined in
- Mathlib.Data.Finset.Piecewise
- Cited by
- 4 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.
Cites3
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
- if_ctx_congrproof · cited by 5
Cited by4
Results whose statement or proof uses this declaration.
- Finset.piecewise_piecewise_of_subset_leftproof · cited by 1
- Finset.piecewise_piecewise_of_subset_rightproof · cited by 1
- Finset.update_piecewise_of_memproof · cited by 0
- Finset.update_piecewise_of_notMemproof · cited by 0