Theorems · Theorem · order theory

Set.range_ite_const

∀ {α : Type u_1} {β : Type u_2} {p : α → Prop} [inst : DecidablePred p] {x y : β},
  (∃ a, p a) → (∃ a, ¬p a) → (Set.range fun a => if p a then x else y) = {x, y}

Defined in

Mathlib.Data.Set.Insert

Cited by

2 results in Mathlib

Foundations

Depth 16 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

DecidablePred