Theorems · Theorem · logic and foundations
Set.piecewise_eq_of_mem
∀ {α : Type u_1} {δ : α → Sort u_7} (s : Set α) (f g : (i : α) → δ i) [inst : (j : α) → Decidable (j ∈ s)] {i : α},
i ∈ s → s.piecewise f g i = f i- Defined in
- Mathlib.Data.Set.Piecewise
- Cited by
- 49 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
- 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.
- Setstatement and proof · cited by 53,352
- Set.piecewisestatement · cited by 136
Cited by49
Results whose statement or proof uses this declaration.
- MeasureTheory.SimpleFunc.inductionproof · cited by 14
- Set.piecewise_eqOnproof · cited by 6
- Set.piecewise_preimageproof · cited by 6
- MeasureTheory.StronglyMeasurable.piecewiseproof · cited by 6
- Set.range_piecewiseproof · cited by 5
- AEMeasurable.exists_ae_eq_range_subsetproof · cited by 4
- Set.apply_piecewiseproof · cited by 3
- Set.piecewise_complproof · cited by 3
- Set.piecewise_leproof · cited by 3
- Monotone.piecewise_eventually_eq_iUnionproof · cited by 3
- Filter.limsup_piecewiseproof · cited by 2
- convexOn_univ_piecewise_Iic_of_antitoneOn_Iic_monotoneOn_Iciproof · cited by 2