Theorems · Theorem · order theory

Set.domRestrict_dite

∀ {α : Type u_1} {β : Type u_2} {s : Set α} [inst : (x : α) → Decidable (x ∈ s)] (f : (a : α) → a ∈ s → β)
  (g : (a : α) → a ∉ s → β), (s.domRestrict fun a => if h : a ∈ s then f a h else g a h) = fun a => f ↑a ⋯

Defined in

Mathlib.Data.Set.Restrict

Cited by

4 results in Mathlib

Foundations

Depth 7 from the axioms · uses Quot.sound

Assumes

Decidable