Documentation

Linglib.Core.Data.Set.Function

Functions agreeing on a set #

A function agrees with g off a exactly when it is an update of g at a, so quantifying over the functions that agree with g off a is quantifying over the values at a. Quantifying over the functions that agree with g on t, of a property that depends only on their values on s, depends only on the values of g on s ∩ t.

Main results #

theorem Set.eqOn_compl_singleton_iff {α : Type u_1} {β : Type u_2} [DecidableEq α] {f g : α → β} {a : α} :
EqOn f g {a}ᶜ ↔ f = Function.update g a (f a)
theorem Set.forall_eqOn_compl_singleton_iff {α : Type u_1} {β : Type u_2} [DecidableEq α] {g : α → β} {a : α} {p : (α → β) → Prop} :
(∀ (f : α → β), EqOn f g {a}ᶜ → p f) ↔ ∀ (b : β), p (Function.update g a b)
theorem Set.exists_eqOn_compl_singleton_iff {α : Type u_1} {β : Type u_2} [DecidableEq α] {g : α → β} {a : α} {p : (α → β) → Prop} :
(∃ (f : α → β), EqOn f g {a}ᶜ ∧ p f) ↔ ∃ (b : β), p (Function.update g a b)
theorem Set.exists_eqOn_eqOn_of_eqOn_inter {α : Type u_1} {β : Type u_2} {f g g' : α → β} {s t : Set α} (hg : EqOn g g' (s ∩ t)) (hf : EqOn f g t) :
∃ (f' : α → β), EqOn f' g' t ∧ EqOn f f' s
theorem Set.exists_eqOn_congr {α : Type u_1} {β : Type u_2} {g g' : α → β} {s t : Set α} (hg : EqOn g g' (s ∩ t)) {p : (α → β) → Prop} (hp : ∀ (f f' : α → β), EqOn f f' s → (p f ↔ p f')) :
(∃ (f : α → β), EqOn f g t ∧ p f) ↔ ∃ (f : α → β), EqOn f g' t ∧ p f
theorem Set.forall_eqOn_congr {α : Type u_1} {β : Type u_2} {g g' : α → β} {s t : Set α} (hg : EqOn g g' (s ∩ t)) {p : (α → β) → Prop} (hp : ∀ (f f' : α → β), EqOn f f' s → (p f ↔ p f')) :
(∀ (f : α → β), EqOn f g t → p f) ↔ ∀ (f : α → β), EqOn f g' t → p f