Theorems · Theorem · order theory
Set.restrict_ite_compl
Deprecated since 2026-07-19Use Set.domRestrict_ite_compl instead.
∀ {α : Type u_1} {β : Type u_2} (f g : α → β) (s : Set α) [inst : (x : α) → Decidable (x ∈ s)],
(sᶜ.domRestrict fun a => if a ∈ s then f a else g a) = sᶜ.domRestrict gAlias of Set.domRestrict_ite_compl.
- Defined in
- Mathlib.Data.Set.Restrict
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses Quot.sound
- Assumes
- Decidable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Set.Elemstatement · cited by 7,166
- Compl.complstatement · cited by 2,925
- Set.domRestrictstatement · cited by 383
- Set.domRestrict_ite_complproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.