Loogle!

Result

Found 105 declarations mentioning Set.piecewise.

• Set.piecewise 📋 Mathlib.Logic.Function.Basic
  {α : Type u} {β : α → Sort v} (s : Set α) (f g : (i : α) → β i) [(j : α) → Decidable (j ∈ s)] (i : α) : β i
• Set.domRestrict_piecewise 📋 Mathlib.Data.Set.Restrict
  {α : Type u_1} {β : Type u_2} (f g : α → β) (s : Set α) [(x : α) → Decidable (x ∈ s)] : s.domRestrict (s.piecewise f g) = s.domRestrict f
• Set.restrict_piecewise 📋 Mathlib.Data.Set.Restrict
  {α : Type u_1} {β : Type u_2} (f g : α → β) (s : Set α) [(x : α) → Decidable (x ∈ s)] : s.domRestrict (s.piecewise f g) = s.domRestrict f
• Set.domRestrict_piecewise_compl 📋 Mathlib.Data.Set.Restrict
  {α : Type u_1} {β : Type u_2} (f g : α → β) (s : Set α) [(x : α) → Decidable (x ∈ s)] : sᶜ.domRestrict (s.piecewise f g) = sᶜ.domRestrict g
• Set.restrict_piecewise_compl 📋 Mathlib.Data.Set.Restrict
  {α : Type u_1} {β : Type u_2} (f g : α → β) (s : Set α) [(x : α) → Decidable (x ∈ s)] : sᶜ.domRestrict (s.piecewise f g) = sᶜ.domRestrict g
• Set.piecewise_same 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (s : Set α) (f : (i : α) → δ i) [(j : α) → Decidable (j ∈ s)] : s.piecewise f f = f
• Set.piecewise_eqOn 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} (s : Set α) [(j : α) → Decidable (j ∈ s)] (f g : α → β) : Set.EqOn (s.piecewise f g) f s
• Set.piecewise_univ 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (f g : (i : α) → δ i) [(i : α) → Decidable (i ∈ Set.univ)] : Set.univ.piecewise f g = f
• Set.piecewise_eqOn_compl 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} (s : Set α) [(j : α) → Decidable (j ∈ s)] (f g : α → β) : Set.EqOn (s.piecewise f g) g sᶜ
• Set.piecewise_empty 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (f g : (i : α) → δ i) [(i : α) → Decidable (i ∈ ∅)] : ∅.piecewise f g = g
• Set.piecewise_eq_of_mem 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (s : Set α) (f g : (i : α) → δ i) [(j : α) → Decidable (j ∈ s)] {i : α} (hi : i ∈ s) : s.piecewise f g i = f i
• Set.piecewise_eq_of_notMem 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (s : Set α) (f g : (i : α) → δ i) [(j : α) → Decidable (j ∈ s)] {i : α} (hi : i ∉ s) : s.piecewise f g i = g i
• Set.piecewise_range_comp 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} {ι : Sort u_7} (f : ι → α) [(j : α) → Decidable (j ∈ Set.range f)] (g₁ g₂ : α → β) : (Set.range f).piecewise g₁ g₂ ∘ f = g₁ ∘ f
• Set.univ_pi_piecewise_univ 📋 Mathlib.Data.Set.Piecewise
  {ι : Type u_7} {α : ι → Type u_8} (s : Set ι) (t : (i : ι) → Set (α i)) [(x : ι) → Decidable (x ∈ s)] : Set.univ.pi (s.piecewise t fun x => Set.univ) = s.pi t
• Set.piecewise_preimage 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} (s : Set α) [(j : α) → Decidable (j ∈ s)] (f g : α → β) (t : Set β) : s.piecewise f g ⁻¹' t = s.ite (f ⁻¹' t) (g ⁻¹' t)
• Set.piecewise_insert_self 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (s : Set α) (f g : (i : α) → δ i) {j : α} [(i : α) → Decidable (i ∈ insert j s)] : (insert j s).piecewise f g j = f j
• Set.piecewise_singleton 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} (x : α) [(y : α) → Decidable (y ∈ {x})] [DecidableEq α] (f g : α → β) : {x}.piecewise f g = Function.update g x (f x)
• Set.range_piecewise 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} (s : Set α) [(j : α) → Decidable (j ∈ s)] (f g : α → β) : Set.range (s.piecewise f g) = f '' s ∪ g '' sᶜ
• Set.EqOn.piecewise_ite 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} (s : Set α) [(j : α) → Decidable (j ∈ s)] {f f' g : α → β} {t t' : Set α} (h : Set.EqOn f g t) (h' : Set.EqOn f' g t') : Set.EqOn (s.piecewise f f') g (s.ite t t')
• Set.apply_piecewise 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (s : Set α) (f g : (i : α) → δ i) [(j : α) → Decidable (j ∈ s)] {δ' : α → Sort u_7} (h : (i : α) → δ i → δ' i) {x : α} : h x (s.piecewise f g x) = s.piecewise (fun x => h x (f x)) (fun x => h x (g x)) x
• Set.piecewise_op 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (s : Set α) (f g : (i : α) → δ i) [(j : α) → Decidable (j ∈ s)] {δ' : α → Sort u_7} (h : (i : α) → δ i → δ' i) : (s.piecewise (fun x => h x (f x)) fun x => h x (g x)) = fun x => h x (s.piecewise f g x)
• Set.piecewise_compl 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (s : Set α) (f g : (i : α) → δ i) [(j : α) → Decidable (j ∈ s)] [(i : α) → Decidable (i ∈ sᶜ)] : sᶜ.piecewise f g = s.piecewise g f
• Set.eqOn_piecewise 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} (s : Set α) [(j : α) → Decidable (j ∈ s)] {f f' g : α → β} {t : Set α} : Set.EqOn (s.piecewise f f') g t ↔ Set.EqOn f g (t ∩ s) ∧ Set.EqOn f' g (t ∩ sᶜ)
• Set.univ_pi_piecewise 📋 Mathlib.Data.Set.Piecewise
  {ι : Type u_7} {α : ι → Type u_8} (s : Set ι) (t t' : (i : ι) → Set (α i)) [(x : ι) → Decidable (x ∈ s)] : Set.univ.pi (s.piecewise t t') = s.pi t ∩ sᶜ.pi t'
• Set.piecewise_insert_of_ne 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (s : Set α) (f g : (i : α) → δ i) [(j : α) → Decidable (j ∈ s)] {i j : α} (h : i ≠ j) [(i : α) → Decidable (i ∈ insert j s)] : (insert j s).piecewise f g i = s.piecewise f g i
• Set.EqOn.piecewise_ite' 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} (s : Set α) [(j : α) → Decidable (j ∈ s)] {f f' g : α → β} {t t' : Set α} (h : Set.EqOn f g (t ∩ s)) (h' : Set.EqOn f' g (t' ∩ sᶜ)) : Set.EqOn (s.piecewise f f') g (s.ite t t')
• Set.injective_piecewise_iff 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} (s : Set α) [(j : α) → Decidable (j ∈ s)] {f g : α → β} : Function.Injective (s.piecewise f g) ↔ Set.InjOn f s ∧ Set.InjOn g sᶜ ∧ ∀ x ∈ s, ∀ y ∉ s, f x ≠ g y
• Set.piecewise_comp 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} (s : Set α) [(j : α) → Decidable (j ∈ s)] (f g : α → γ) (h : β → α) : s.piecewise f g ∘ h = (h ⁻¹' s).piecewise (f ∘ h) (g ∘ h)
• Set.piecewise_insert 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (s : Set α) (f g : (i : α) → δ i) [(j : α) → Decidable (j ∈ s)] [DecidableEq α] (j : α) [(i : α) → Decidable (i ∈ insert j s)] : (insert j s).piecewise f g = Function.update (s.piecewise f g) j (f j)
• Set.pi_piecewise 📋 Mathlib.Data.Set.Piecewise
  {ι : Type u_7} {α : ι → Type u_8} (s s' : Set ι) (t t' : (i : ι) → Set (α i)) [(x : ι) → Decidable (x ∈ s')] : s.pi (s'.piecewise t t') = (s ∩ s').pi t ∩ (s \ s').pi t'
• Set.apply_piecewise₂ 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (s : Set α) (f g : (i : α) → δ i) [(j : α) → Decidable (j ∈ s)] {δ' : α → Sort u_7} {δ'' : α → Sort u_8} (f' g' : (i : α) → δ' i) (h : (i : α) → δ i → δ' i → δ'' i) {x : α} : h x (s.piecewise f g x) (s.piecewise f' g' x) = s.piecewise (fun x => h x (f x) (f' x)) (fun x => h x (g x) (g' x)) x
• Set.piecewise_op₂ 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Sort u_6} (s : Set α) (f g : (i : α) → δ i) [(j : α) → Decidable (j ∈ s)] {δ' : α → Sort u_7} {δ'' : α → Sort u_8} (f' g' : (i : α) → δ' i) (h : (i : α) → δ i → δ' i → δ'' i) : (s.piecewise (fun x => h x (f x) (f' x)) fun x => h x (g x) (g' x)) = fun x => h x (s.piecewise f g x) (s.piecewise f' g' x)
• Set.piecewise_mem_pi 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} (s : Set α) [(j : α) → Decidable (j ∈ s)] {δ : α → Type u_7} {t : Set α} {t' : (i : α) → Set (δ i)} {f g : (i : α) → δ i} (hf : f ∈ t.pi t') (hg : g ∈ t.pi t') : s.piecewise f g ∈ t.pi t'
• Set.le_piecewise 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Type u_7} [(i : α) → Preorder (δ i)] {s : Set α} [(j : α) → Decidable (j ∈ s)] {f₁ f₂ g : (i : α) → δ i} (h₁ : ∀ i ∈ s, g i ≤ f₁ i) (h₂ : ∀ i ∉ s, g i ≤ f₂ i) : g ≤ s.piecewise f₁ f₂
• Set.piecewise_le 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Type u_7} [(i : α) → Preorder (δ i)] {s : Set α} [(j : α) → Decidable (j ∈ s)] {f₁ f₂ g : (i : α) → δ i} (h₁ : ∀ i ∈ s, f₁ i ≤ g i) (h₂ : ∀ i ∉ s, f₂ i ≤ g i) : s.piecewise f₁ f₂ ≤ g
• Set.MapsTo.piecewise_ite 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {β : Type u_2} {s s₁ s₂ : Set α} {t t₁ t₂ : Set β} {f₁ f₂ : α → β} [(i : α) → Decidable (i ∈ s)] (h₁ : Set.MapsTo f₁ (s₁ ∩ s) (t₁ ∩ t)) (h₂ : Set.MapsTo f₂ (s₂ ∩ sᶜ) (t₂ ∩ tᶜ)) : Set.MapsTo (s.piecewise f₁ f₂) (s.ite s₁ s₂) (t.ite t₁ t₂)
• Set.piecewise_mono 📋 Mathlib.Data.Set.Piecewise
  {α : Type u_1} {δ : α → Type u_7} [(i : α) → Preorder (δ i)] {s : Set α} [(j : α) → Decidable (j ∈ s)] {f₁ f₂ g₁ g₂ : (i : α) → δ i} (h₁ : ∀ i ∈ s, f₁ i ≤ g₁ i) (h₂ : ∀ i ∉ s, f₂ i ≤ g₂ i) : s.piecewise f₁ f₂ ≤ s.piecewise g₁ g₂
• Set.piecewise_smul 📋 Mathlib.Algebra.Group.Action.Pi
  {ι : Type u_1} {M : Type u_2} {α : ι → Type u_4} [(i : ι) → SMul M (α i)] (s : Set ι) [(i : ι) → Decidable (i ∈ s)] (c : M) (f₁ g₁ : (i : ι) → α i) : s.piecewise (c • f₁) (c • g₁) = c • s.piecewise f₁ g₁
• Set.piecewise_vadd 📋 Mathlib.Algebra.Group.Action.Pi
  {ι : Type u_1} {M : Type u_2} {α : ι → Type u_4} [(i : ι) → VAdd M (α i)] (s : Set ι) [(i : ι) → Decidable (i ∈ s)] (c : M) (f₁ g₁ : (i : ι) → α i) : s.piecewise (c +ᵥ f₁) (c +ᵥ g₁) = c +ᵥ s.piecewise f₁ g₁
• Set.piecewise_inv 📋 Mathlib.Algebra.Group.Pi.Lemmas
  {I : Type u} {f : I → Type v} [(i : I) → Inv (f i)] (s : Set I) [(i : I) → Decidable (i ∈ s)] (f₁ g₁ : (i : I) → f i) : s.piecewise f₁⁻¹ g₁⁻¹ = (s.piecewise f₁ g₁)⁻¹
• Set.piecewise_neg 📋 Mathlib.Algebra.Group.Pi.Lemmas
  {I : Type u} {f : I → Type v} [(i : I) → Neg (f i)] (s : Set I) [(i : I) → Decidable (i ∈ s)] (f₁ g₁ : (i : I) → f i) : s.piecewise (-f₁) (-g₁) = -s.piecewise f₁ g₁
• Set.piecewise_add 📋 Mathlib.Algebra.Group.Pi.Lemmas
  {I : Type u} {f : I → Type v} [(i : I) → Add (f i)] (s : Set I) [(i : I) → Decidable (i ∈ s)] (f₁ f₂ g₁ g₂ : (i : I) → f i) : s.piecewise (f₁ + f₂) (g₁ + g₂) = s.piecewise f₁ g₁ + s.piecewise f₂ g₂
• Set.piecewise_div 📋 Mathlib.Algebra.Group.Pi.Lemmas
  {I : Type u} {f : I → Type v} [(i : I) → Div (f i)] (s : Set I) [(i : I) → Decidable (i ∈ s)] (f₁ f₂ g₁ g₂ : (i : I) → f i) : s.piecewise (f₁ / f₂) (g₁ / g₂) = s.piecewise f₁ g₁ / s.piecewise f₂ g₂
• Set.piecewise_mul 📋 Mathlib.Algebra.Group.Pi.Lemmas
  {I : Type u} {f : I → Type v} [(i : I) → Mul (f i)] (s : Set I) [(i : I) → Decidable (i ∈ s)] (f₁ f₂ g₁ g₂ : (i : I) → f i) : s.piecewise (f₁ * f₂) (g₁ * g₂) = s.piecewise f₁ g₁ * s.piecewise f₂ g₂
• Set.piecewise_sub 📋 Mathlib.Algebra.Group.Pi.Lemmas
  {I : Type u} {f : I → Type v} [(i : I) → Sub (f i)] (s : Set I) [(i : I) → Decidable (i ∈ s)] (f₁ f₂ g₁ g₂ : (i : I) → f i) : s.piecewise (f₁ - f₂) (g₁ - g₂) = s.piecewise f₁ g₁ - s.piecewise f₂ g₂
• Finset.piecewise_coe 📋 Mathlib.Data.Finset.Piecewise
  {ι : Type u_1} {π : ι → Sort u_2} (s : Finset ι) (f g : (i : ι) → π i) [(j : ι) → Decidable (j ∈ s)] : (↑s).piecewise f g = s.piecewise f g
• Set.piecewise_eq_indicator 📋 Mathlib.Algebra.Notation.Indicator
  {α : Type u_1} {M : Type u_3} [Zero M] {s : Set α} {f : α → M} [DecidablePred fun x => x ∈ s] : s.piecewise f 0 = s.indicator f
• Set.piecewise_eq_mulIndicator 📋 Mathlib.Algebra.Notation.Indicator
  {α : Type u_1} {M : Type u_3} [One M] {s : Set α} {f : α → M} [DecidablePred fun x => x ∈ s] : s.piecewise f 1 = s.mulIndicator f
• Set.comp_indicator 📋 Mathlib.Algebra.Notation.Indicator
  {α : Type u_1} {β : Type u_2} {M : Type u_3} [Zero M] (h : M → β) (f : α → M) {s : Set α} {x : α} [DecidablePred fun x => x ∈ s] : h (s.indicator f x) = s.piecewise (h ∘ f) (Function.const α (h 0)) x
• Set.comp_mulIndicator 📋 Mathlib.Algebra.Notation.Indicator
  {α : Type u_1} {β : Type u_2} {M : Type u_3} [One M] (h : M → β) (f : α → M) {s : Set α} {x : α} [DecidablePred fun x => x ∈ s] : h (s.mulIndicator f x) = s.piecewise (h ∘ f) (Function.const α (h 1)) x
• Set.indicator_add_compl_eq_piecewise 📋 Mathlib.Algebra.Group.Indicator
  {α : Type u_1} {M : Type u_4} [AddZeroClass M] {s : Set α} [DecidablePred fun x => x ∈ s] (f g : α → M) : s.indicator f + sᶜ.indicator g = s.piecewise f g
• Set.mulIndicator_mul_compl_eq_piecewise 📋 Mathlib.Algebra.Group.Indicator
  {α : Type u_1} {M : Type u_4} [MulOneClass M] {s : Set α} [DecidablePred fun x => x ∈ s] (f g : α → M) : s.mulIndicator f * sᶜ.mulIndicator g = s.piecewise f g
• Antitone.piecewise_eventually_eq_iInter 📋 Mathlib.Order.Filter.AtTopBot.Defs
  {ι : Type u_1} {α : Type u_2} {β : α → Type u_4} [Preorder ι] {s : ι → Set α} [(i : ι) → DecidablePred fun x => x ∈ s i] [DecidablePred fun x => x ∈ ⋂ i, s i] (hs : Antitone s) (f g : (a : α) → β a) (a : α) : ∀ᶠ (i : ι) in Filter.atTop, (s i).piecewise f g a = (⋂ i, s i).piecewise f g a
• Monotone.piecewise_eventually_eq_iUnion 📋 Mathlib.Order.Filter.AtTopBot.Defs
  {ι : Type u_1} {α : Type u_2} {β : α → Type u_4} [Preorder ι] {s : ι → Set α} [(i : ι) → DecidablePred fun x => x ∈ s i] [DecidablePred fun x => x ∈ ⋃ i, s i] (hs : Monotone s) (f g : (a : α) → β a) (a : α) : ∀ᶠ (i : ι) in Filter.atTop, (s i).piecewise f g a = (⋃ i, s i).piecewise f g a
• Filter.Tendsto.piecewise 📋 Mathlib.Order.Filter.Tendsto
  {α : Type u_1} {β : Type u_2} {l₁ : Filter α} {l₂ : Filter β} {f g : α → β} {s : Set α} [(x : α) → Decidable (x ∈ s)] (h₀ : Filter.Tendsto f (l₁ ⊓ Filter.principal s) l₂) (h₁ : Filter.Tendsto g (l₁ ⊓ Filter.principal sᶜ) l₂) : Filter.Tendsto (s.piecewise f g) l₁ l₂
• DFinsupp.coe_piecewise 📋 Mathlib.Data.DFinsupp.Defs
  {ι : Type u} {β : ι → Type v} [(i : ι) → Zero (β i)] (x y : Π₀ (i : ι), β i) (s : Set ι) [(i : ι) → Decidable (i ∈ s)] : ⇑(x.piecewise y s) = s.piecewise ⇑x ⇑y
• Filter.Tendsto.piecewise_nhdsWithin 📋 Mathlib.Topology.NhdsWithin
  {α : Type u_1} {β : Type u_2} [TopologicalSpace α] {f g : α → β} {t : Set α} [(x : α) → Decidable (x ∈ t)] {a : α} {s : Set α} {l : Filter β} (h₀ : Filter.Tendsto f (nhdsWithin a (s ∩ t)) l) (h₁ : Filter.Tendsto g (nhdsWithin a (s ∩ tᶜ)) l) : Filter.Tendsto (t.piecewise f g) (nhdsWithin a s) l
• IsClosed.continuous_piecewise_of_specializes 📋 Mathlib.Topology.Inseparable
  {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f g : X → Y} [DecidablePred fun x => x ∈ s] (hs : IsClosed s) (hf : Continuous f) (hg : Continuous g) (hspec : ∀ (x : X), g x ⤳ f x) : Continuous (s.piecewise f g)
• IsOpen.continuous_piecewise_of_specializes 📋 Mathlib.Topology.Inseparable
  {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f g : X → Y} [DecidablePred fun x => x ∈ s] (hs : IsOpen s) (hf : Continuous f) (hg : Continuous g) (hspec : ∀ (x : X), f x ⤳ g x) : Continuous (s.piecewise f g)
• Continuous.piecewise 📋 Mathlib.Topology.Piecewise
  {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {f g : α → β} {s : Set α} [(a : α) → Decidable (a ∈ s)] (hs : ∀ a ∈ frontier s, f a = g a) (hf : Continuous f) (hg : Continuous g) : Continuous (s.piecewise f g)
• continuous_piecewise 📋 Mathlib.Topology.Piecewise
  {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {f g : α → β} {s : Set α} [(a : α) → Decidable (a ∈ s)] (hs : ∀ a ∈ frontier s, f a = g a) (hf : ContinuousOn f (closure s)) (hg : ContinuousOn g (closure sᶜ)) : Continuous (s.piecewise f g)
• continuousOn_piecewise_ite 📋 Mathlib.Topology.Piecewise
  {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {f g : α → β} {s s' t : Set α} [(x : α) → Decidable (x ∈ t)] (h : ContinuousOn f s) (h' : ContinuousOn g s') (H : s ∩ frontier t = s' ∩ frontier t) (Heq : Set.EqOn f g (s ∩ frontier t)) : ContinuousOn (t.piecewise f g) (t.ite s s')
• ContinuousOn.piecewise 📋 Mathlib.Topology.Piecewise
  {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {f g : α → β} {s t : Set α} [(a : α) → Decidable (a ∈ t)] (ht : ∀ a ∈ s ∩ frontier t, f a = g a) (hf : ContinuousOn f (s ∩ closure t)) (hg : ContinuousOn g (s ∩ closure tᶜ)) : ContinuousOn (t.piecewise f g) s
• continuousOn_piecewise_ite' 📋 Mathlib.Topology.Piecewise
  {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {f g : α → β} {s s' t : Set α} [(x : α) → Decidable (x ∈ t)] (h : ContinuousOn f (s ∩ closure t)) (h' : ContinuousOn g (s' ∩ closure tᶜ)) (H : s ∩ frontier t = s' ∩ frontier t) (Heq : Set.EqOn f g (s ∩ frontier t)) : ContinuousOn (t.piecewise f g) (t.ite s s')
• ContinuousOn.piecewise' 📋 Mathlib.Topology.Piecewise
  {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {f g : α → β} {s t : Set α} [(a : α) → Decidable (a ∈ t)] (hpf : ∀ a ∈ s ∩ frontier t, Filter.Tendsto f (nhdsWithin a (s ∩ t)) (nhds (t.piecewise f g a))) (hpg : ∀ a ∈ s ∩ frontier t, Filter.Tendsto g (nhdsWithin a (s ∩ tᶜ)) (nhds (t.piecewise f g a))) (hf : ContinuousOn f (s ∩ t)) (hg : ContinuousOn g (s ∩ tᶜ)) : ContinuousOn (t.piecewise f g) s
• Set.piecewise_mem_Icc' 📋 Mathlib.Order.Interval.Set.Pi
  {ι : Type u_1} {α : ι → Type u_2} [(i : ι) → Preorder (α i)] {s : Set ι} [(j : ι) → Decidable (j ∈ s)] {f₁ f₂ g₁ g₂ : (i : ι) → α i} (h₁ : f₁ ∈ Set.Icc g₁ g₂) (h₂ : f₂ ∈ Set.Icc g₁ g₂) : s.piecewise f₁ f₂ ∈ Set.Icc g₁ g₂
• Set.piecewise_mem_Icc 📋 Mathlib.Order.Interval.Set.Pi
  {ι : Type u_1} {α : ι → Type u_2} [(i : ι) → Preorder (α i)] {s : Set ι} [(j : ι) → Decidable (j ∈ s)] {f₁ f₂ g₁ g₂ : (i : ι) → α i} (h₁ : ∀ i ∈ s, f₁ i ∈ Set.Icc (g₁ i) (g₂ i)) (h₂ : ∀ i ∉ s, f₂ i ∈ Set.Icc (g₁ i) (g₂ i)) : s.piecewise f₁ f₂ ∈ Set.Icc g₁ g₂
• PartialEquiv.piecewise_apply 📋 Mathlib.Logic.Equiv.PartialEquiv
  {α : Type u_1} {β : Type u_2} (e e' : PartialEquiv α β) (s : Set α) (t : Set β) [(x : α) → Decidable (x ∈ s)] [(y : β) → Decidable (y ∈ t)] (H : e.IsImage s t) (H' : e'.IsImage s t) : ↑(e.piecewise e' s t H H') = s.piecewise ↑e ↑e'
• PartialEquiv.piecewise_symm_apply 📋 Mathlib.Logic.Equiv.PartialEquiv
  {α : Type u_1} {β : Type u_2} (e e' : PartialEquiv α β) (s : Set α) (t : Set β) [(x : α) → Decidable (x ∈ s)] [(y : β) → Decidable (y ∈ t)] (H : e.IsImage s t) (H' : e'.IsImage s t) : ↑(e.piecewise e' s t H H').symm = t.piecewise ↑e.symm ↑e'.symm
• PartialEquiv.IsImage.leftInvOn_piecewise 📋 Mathlib.Logic.Equiv.PartialEquiv
  {α : Type u_1} {β : Type u_2} {e : PartialEquiv α β} {s : Set α} {t : Set β} {e' : PartialEquiv α β} [(i : α) → Decidable (i ∈ s)] [(i : β) → Decidable (i ∈ t)] (h : e.IsImage s t) (h' : e'.IsImage s t) : Set.LeftInvOn (t.piecewise ↑e.symm ↑e'.symm) (s.piecewise ↑e ↑e') (s.ite e.source e'.source)
• PartialEquiv.disjointUnion_apply 📋 Mathlib.Logic.Equiv.PartialEquiv
  {α : Type u_1} {β : Type u_2} (e e' : PartialEquiv α β) (hs : Disjoint e.source e'.source) (ht : Disjoint e.target e'.target) [(x : α) → Decidable (x ∈ e.source)] [(y : β) → Decidable (y ∈ e.target)] : ↑(e.disjointUnion e' hs ht) = e.source.piecewise ↑e ↑e'
• PartialEquiv.disjointUnion_symm_apply 📋 Mathlib.Logic.Equiv.PartialEquiv
  {α : Type u_1} {β : Type u_2} (e e' : PartialEquiv α β) (hs : Disjoint e.source e'.source) (ht : Disjoint e.target e'.target) [(x : α) → Decidable (x ∈ e.source)] [(y : β) → Decidable (y ∈ e.target)] : ↑(e.disjointUnion e' hs ht).symm = e.target.piecewise ↑e.symm ↑e'.symm
• Filter.liminf_piecewise 📋 Mathlib.Order.LiminfLimsup
  {α : Type u_1} {β : Type u_2} [CompleteDistribLattice α] {f : Filter β} {u : β → α} {s : Set β} [DecidablePred fun x => x ∈ s] {v : β → α} : Filter.liminf (s.piecewise u v) f = (Filter.bliminf u f fun x => x ∈ s) ⊓ Filter.bliminf v f fun x => x ∉ s
• Filter.limsup_piecewise 📋 Mathlib.Order.LiminfLimsup
  {α : Type u_1} {β : Type u_2} [CompleteDistribLattice α] {f : Filter β} {u : β → α} {s : Set β} [DecidablePred fun x => x ∈ s] {v : β → α} : Filter.limsup (s.piecewise u v) f = (Filter.blimsup u f fun x => x ∈ s) ⊔ Filter.blimsup v f fun x => x ∉ s
• Measurable.piecewise 📋 Mathlib.MeasureTheory.MeasurableSpace.Basic
  {α : Type u_1} {β : Type u_2} {s : Set α} {f g : α → β} {m : MeasurableSpace α} {mβ : MeasurableSpace β} {x✝ : DecidablePred fun x => x ∈ s} (hs : MeasurableSet s) (hf : Measurable f) (hg : Measurable g) : Measurable (s.piecewise f g)
• piecewise_ae_eq_restrict 📋 Mathlib.MeasureTheory.Measure.Restrict
  {α : Type u_2} {β : Type u_3} [MeasurableSpace α] {μ : MeasureTheory.Measure α} {s : Set α} {f g : α → β} [DecidablePred fun x => x ∈ s] (hs : MeasurableSet s) : s.piecewise f g =ᵐ[μ.restrict s] f
• piecewise_ae_eq_restrict_compl 📋 Mathlib.MeasureTheory.Measure.Restrict
  {α : Type u_2} {β : Type u_3} [MeasurableSpace α] {μ : MeasureTheory.Measure α} {s : Set α} {f g : α → β} [DecidablePred fun x => x ∈ s] (hs : MeasurableSet s) : s.piecewise f g =ᵐ[μ.restrict sᶜ] g
• piecewise_ae_eq_of_ae_eq_set 📋 Mathlib.MeasureTheory.Measure.Restrict
  {α : Type u_2} {β : Type u_3} [MeasurableSpace α] {μ : MeasureTheory.Measure α} {s t : Set α} {f g : α → β} [DecidablePred fun x => x ∈ s] [DecidablePred fun x => x ∈ t] (hst : s =ᵐ[μ] t) : s.piecewise f g =ᵐ[μ] t.piecewise f g
• ContinuousOn.measurable_piecewise 📋 Mathlib.MeasureTheory.Constructions.BorelSpace.Basic
  {α : Type u_1} {γ : Type u_3} [TopologicalSpace α] [MeasurableSpace α] [OpensMeasurableSpace α] [TopologicalSpace γ] [MeasurableSpace γ] [BorelSpace γ] {f g : α → γ} {s : Set α} [(j : α) → Decidable (j ∈ s)] (hf : ContinuousOn f s) (hg : ContinuousOn g sᶜ) (hs : MeasurableSet s) : Measurable (s.piecewise f g)
• MeasureTheory.SimpleFunc.coe_piecewise 📋 Mathlib.MeasureTheory.Function.SimpleFunc
  {α : Type u_1} {β : Type u_2} [MeasurableSpace α] {s : Set α} (hs : MeasurableSet s) (f g : MeasureTheory.SimpleFunc α β) : ⇑(MeasureTheory.SimpleFunc.piecewise s hs f g) = s.piecewise ⇑f ⇑g
• MeasureTheory.StronglyMeasurable.piecewise 📋 Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic
  {α : Type u_1} {β : Type u_2} {f g : α → β} {m : MeasurableSpace α} [TopologicalSpace β] {s : Set α} {x✝ : DecidablePred fun x => x ∈ s} (hs : MeasurableSet s) (hf : MeasureTheory.StronglyMeasurable f) (hg : MeasureTheory.StronglyMeasurable g) : MeasureTheory.StronglyMeasurable (s.piecewise f g)
• MeasureTheory.StronglyMeasurable.induction' 📋 Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic
  {α : Type u_1} {β : Type u_2} [MeasurableSpace α] [Nonempty β] [TopologicalSpace β] {P : (f : α → β) → MeasureTheory.StronglyMeasurable f → Prop} (const : ∀ (c : β), P (fun x => c) ⋯) (pcw : ∀ ⦃f g : α → β⦄ {s : Set α} (hf : MeasureTheory.StronglyMeasurable f) (hg : MeasureTheory.StronglyMeasurable g) (hs : MeasurableSet s), P f hf → P g hg → P (s.piecewise f g) ⋯) (lim : ∀ ⦃f : ℕ → α → β⦄ ⦃g : α → β⦄ (hf : ∀ (n : ℕ), MeasureTheory.StronglyMeasurable (f n)) (hg : MeasureTheory.StronglyMeasurable g), (∀ (n : ℕ), P (f n) ⋯) → (∀ (x : α), Filter.Tendsto (fun x_1 => f x_1 x) Filter.atTop (nhds (g x))) → P g hg) (f : α → β) (hf : MeasureTheory.StronglyMeasurable f) : P f hf
• MeasureTheory.AEStronglyMeasurable.piecewise 📋 Mathlib.MeasureTheory.Function.StronglyMeasurable.AEStronglyMeasurable
  {α : Type u_1} {β : Type u_2} [TopologicalSpace β] {m₀ : MeasurableSpace α} {μ : MeasureTheory.Measure α} {f g : α → β} {s : Set α} [DecidablePred fun x => x ∈ s] (hs : MeasurableSet s) (hf : MeasureTheory.AEStronglyMeasurable f (μ.restrict s)) (hg : MeasureTheory.AEStronglyMeasurable g (μ.restrict sᶜ)) : MeasureTheory.AEStronglyMeasurable (s.piecewise f g) μ
• MeasureTheory.lintegral_piecewise 📋 Mathlib.MeasureTheory.Integral.Lebesgue.Basic
  {α : Type u_1} {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {s : Set α} (hs : MeasurableSet s) (f g : α → ENNReal) [(j : α) → Decidable (j ∈ s)] : ∫⁻ (a : α), s.piecewise f g a ∂μ = ∫⁻ (a : α) in s, f a ∂μ + ∫⁻ (a : α) in sᶜ, g a ∂μ
• ENNReal.essSup_piecewise 📋 Mathlib.MeasureTheory.Function.EssSup
  {α : Type u_1} {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {f : α → ENNReal} {s : Set α} [DecidablePred fun x => x ∈ s] {g : α → ENNReal} (hs : MeasurableSet s) : essSup (s.piecewise f g) μ = max (essSup f (μ.restrict s)) (essSup g (μ.restrict sᶜ))
• MeasureTheory.eLpNormEssSup_piecewise 📋 Mathlib.MeasureTheory.Function.LpSeminorm.Indicator
  {α : Type u_1} {m0 : MeasurableSpace α} {μ : MeasureTheory.Measure α} {ε : Type u_6} [TopologicalSpace ε] [ESeminormedAddMonoid ε] {s : Set α} (f g : α → ε) [DecidablePred fun x => x ∈ s] (hs : MeasurableSet s) : MeasureTheory.eLpNormEssSup (s.piecewise f g) μ = max (MeasureTheory.eLpNormEssSup f (μ.restrict s)) (MeasureTheory.eLpNormEssSup g (μ.restrict sᶜ))
• MeasureTheory.MemLp.piecewise 📋 Mathlib.MeasureTheory.Function.LpSeminorm.Indicator
  {α : Type u_1} {m0 : MeasurableSpace α} {p : ENNReal} {μ : MeasureTheory.Measure α} {ε : Type u_6} [TopologicalSpace ε] [ESeminormedAddMonoid ε] {s : Set α} {f : α → ε} [DecidablePred fun x => x ∈ s] {g : α → ε} (hs : MeasurableSet s) (hf : MeasureTheory.MemLp f p (μ.restrict s)) (hg : MeasureTheory.MemLp g p (μ.restrict sᶜ)) : MeasureTheory.MemLp (s.piecewise f g) p μ
• MeasureTheory.eLpNorm_top_piecewise 📋 Mathlib.MeasureTheory.Function.LpSeminorm.Indicator
  {α : Type u_1} {m0 : MeasurableSpace α} {μ : MeasureTheory.Measure α} {ε : Type u_6} [TopologicalSpace ε] [ESeminormedAddMonoid ε] {s : Set α} (f g : α → ε) [DecidablePred fun x => x ∈ s] (hs : MeasurableSet s) : MeasureTheory.eLpNorm (s.piecewise f g) ⊤ μ = max (MeasureTheory.eLpNorm f ⊤ (μ.restrict s)) (MeasureTheory.eLpNorm g ⊤ (μ.restrict sᶜ))
• MeasureTheory.Integrable.piecewise 📋 Mathlib.MeasureTheory.Integral.IntegrableOn
  {α : Type u_1} {ε' : Type u_4} {mα : MeasurableSpace α} {s : Set α} {μ : MeasureTheory.Measure α} [TopologicalSpace ε'] [ESeminormedAddMonoid ε'] {f g : α → ε'} [DecidablePred fun x => x ∈ s] (hs : MeasurableSet s) (hf : MeasureTheory.IntegrableOn f s μ) (hg : MeasureTheory.IntegrableOn g sᶜ μ) : MeasureTheory.Integrable (s.piecewise f g) μ
• MeasureTheory.integral_piecewise 📋 Mathlib.MeasureTheory.Integral.Bochner.Set
  {X : Type u_1} {E : Type u_3} {mX : MeasurableSpace X} [NormedAddCommGroup E] [NormedSpace ℝ E] {f g : X → E} {s : Set X} {μ : MeasureTheory.Measure X} [DecidablePred fun x => x ∈ s] (hs : MeasurableSet s) (hf : MeasureTheory.IntegrableOn f s μ) (hg : MeasureTheory.IntegrableOn g sᶜ μ) : ∫ (x : X), s.piecewise f g x ∂μ = ∫ (x : X) in s, f x ∂μ + ∫ (x : X) in sᶜ, g x ∂μ
• OpenPartialHomeomorph.IsImage.leftInvOn_piecewise 📋 Mathlib.Topology.OpenPartialHomeomorph.IsImage
  {X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] {e : OpenPartialHomeomorph X Y} {s : Set X} {t : Set Y} {e' : OpenPartialHomeomorph X Y} [(i : X) → Decidable (i ∈ s)] [(i : Y) → Decidable (i ∈ t)] (h : e.IsImage s t) (h' : e'.IsImage s t) : Set.LeftInvOn (t.piecewise ↑e.symm ↑e'.symm) (s.piecewise ↑e ↑e') (s.ite e.source e'.source)
• OpenPartialHomeomorph.piecewise_apply 📋 Mathlib.Topology.OpenPartialHomeomorph.Constructions
  {X : Type u_1} {Y : Type u_3} [TopologicalSpace X] [TopologicalSpace Y] (e e' : OpenPartialHomeomorph X Y) (s : Set X) (t : Set Y) [(x : X) → Decidable (x ∈ s)] [(y : Y) → Decidable (y ∈ t)] (H : e.IsImage s t) (H' : e'.IsImage s t) (Hs : e.source ∩ frontier s = e'.source ∩ frontier s) (Heq : Set.EqOn (↑e) (↑e') (e.source ∩ frontier s)) : ↑(e.piecewise e' s t H H' Hs Heq) = s.piecewise ↑e ↑e'
• ContMDiff.piecewise 📋 Mathlib.Geometry.Manifold.ContMDiff.Basic
  {𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {H : Type u_3} [TopologicalSpace H] {I : ModelWithCorners 𝕜 E H} {M : Type u_4} [TopologicalSpace M] {E' : Type u_5} [NormedAddCommGroup E'] [NormedSpace 𝕜 E'] {H' : Type u_6} [TopologicalSpace H'] {I' : ModelWithCorners 𝕜 E' H'} {M' : Type u_7} [TopologicalSpace M'] [ChartedSpace H M] [ChartedSpace H' M'] {n : WithTop ℕ∞} {f g : M → M'} {s : Set M} [DecidablePred fun x => x ∈ s] (hf : ContMDiff I I' n f) (hg : ContMDiff I I' n g) (hfg : ∀ x ∈ frontier s, f =ᶠ[nhds x] g) : ContMDiff I I' n (s.piecewise f g)
• ContMDiff.piecewise_Iic 📋 Mathlib.Geometry.Manifold.ContMDiff.Basic
  {n : WithTop ℕ∞} {E : Type u_11} [NormedAddCommGroup E] [NormedSpace ℝ E] {H : Type u_12} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type u_13} [TopologicalSpace M] [ChartedSpace H M] {f g : ℝ → M} {s : ℝ} (hf : ContMDiff (modelWithCornersSelf ℝ ℝ) I n f) (hg : ContMDiff (modelWithCornersSelf ℝ ℝ) I n g) (hfg : f =ᶠ[nhds s] g) : ContMDiff (modelWithCornersSelf ℝ ℝ) I n ((Set.Iic s).piecewise f g)
• concaveOn_univ_piecewise_Ici_of_antitoneOn_Ici_monotoneOn_Iic 📋 Mathlib.Analysis.Convex.Piecewise
  {𝕜 : Type u_1} {E : Type u_2} {β : Type u_3} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [LinearOrder E] [IsOrderedAddMonoid E] [Module 𝕜 E] [PosSMulMono 𝕜 E] [AddCommGroup β] [PartialOrder β] [IsOrderedAddMonoid β] [Module 𝕜 β] [PosSMulMono 𝕜 β] {e : E} {f g : E → β} (hf : ConcaveOn 𝕜 (Set.Ici e) f) (hg : ConcaveOn 𝕜 (Set.Iic e) g) (h_anti : AntitoneOn f (Set.Ici e)) (h_mono : MonotoneOn g (Set.Iic e)) (h_eq : f e = g e) : ConcaveOn 𝕜 Set.univ ((Set.Ici e).piecewise f g)
• concaveOn_univ_piecewise_Iic_of_monotoneOn_Iic_antitoneOn_Ici 📋 Mathlib.Analysis.Convex.Piecewise
  {𝕜 : Type u_1} {E : Type u_2} {β : Type u_3} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [LinearOrder E] [IsOrderedAddMonoid E] [Module 𝕜 E] [PosSMulMono 𝕜 E] [AddCommGroup β] [PartialOrder β] [IsOrderedAddMonoid β] [Module 𝕜 β] [PosSMulMono 𝕜 β] {e : E} {f g : E → β} (hf : ConcaveOn 𝕜 (Set.Iic e) f) (hg : ConcaveOn 𝕜 (Set.Ici e) g) (h_mono : MonotoneOn f (Set.Iic e)) (h_anti : AntitoneOn g (Set.Ici e)) (h_eq : f e = g e) : ConcaveOn 𝕜 Set.univ ((Set.Iic e).piecewise f g)
• convexOn_univ_piecewise_Ici_of_monotoneOn_Ici_antitoneOn_Iic 📋 Mathlib.Analysis.Convex.Piecewise
  {𝕜 : Type u_1} {E : Type u_2} {β : Type u_3} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [LinearOrder E] [IsOrderedAddMonoid E] [Module 𝕜 E] [PosSMulMono 𝕜 E] [AddCommGroup β] [PartialOrder β] [IsOrderedAddMonoid β] [Module 𝕜 β] [PosSMulMono 𝕜 β] {e : E} {f g : E → β} (hf : ConvexOn 𝕜 (Set.Ici e) f) (hg : ConvexOn 𝕜 (Set.Iic e) g) (h_mono : MonotoneOn f (Set.Ici e)) (h_anti : AntitoneOn g (Set.Iic e)) (h_eq : f e = g e) : ConvexOn 𝕜 Set.univ ((Set.Ici e).piecewise f g)
• convexOn_univ_piecewise_Iic_of_antitoneOn_Iic_monotoneOn_Ici 📋 Mathlib.Analysis.Convex.Piecewise
  {𝕜 : Type u_1} {E : Type u_2} {β : Type u_3} [Semiring 𝕜] [PartialOrder 𝕜] [AddCommMonoid E] [LinearOrder E] [IsOrderedAddMonoid E] [Module 𝕜 E] [PosSMulMono 𝕜 E] [AddCommGroup β] [PartialOrder β] [IsOrderedAddMonoid β] [Module 𝕜 β] [PosSMulMono 𝕜 β] {e : E} {f g : E → β} (hf : ConvexOn 𝕜 (Set.Iic e) f) (hg : ConvexOn 𝕜 (Set.Ici e) g) (h_anti : AntitoneOn f (Set.Iic e)) (h_mono : MonotoneOn g (Set.Ici e)) (h_eq : f e = g e) : ConvexOn 𝕜 Set.univ ((Set.Iic e).piecewise f g)
• eqOn_piecewise_of_isMIntegralCurveOn_Ioo 📋 Mathlib.Geometry.Manifold.IntegralCurve.UniformTime
  {E : Type u_1} [NormedAddCommGroup E] [NormedSpace ℝ E] {H : Type u_2} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type u_3} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I 1 M] [T2Space M] {γ γ' : ℝ → M} {v : (x : M) → TangentSpace I x} {t₀ : ℝ} [BoundarylessManifold I M] (hv : ContMDiff I I.tangent 1 fun x => ⟨x, v x⟩) {a b a' b' : ℝ} (hγ : IsMIntegralCurveOn γ v (Set.Ioo a b)) (hγ' : IsMIntegralCurveOn γ' v (Set.Ioo a' b')) (ht₀ : t₀ ∈ Set.Ioo a b ∩ Set.Ioo a' b') (h : γ t₀ = γ' t₀) : Set.EqOn ((Set.Ioo a b).piecewise γ γ') γ' (Set.Ioo a' b')
• isMIntegralCurveOn_piecewise 📋 Mathlib.Geometry.Manifold.IntegralCurve.UniformTime
  {E : Type u_1} [NormedAddCommGroup E] [NormedSpace ℝ E] {H : Type u_2} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type u_3} [TopologicalSpace M] [ChartedSpace H M] [IsManifold I 1 M] [T2Space M] {γ γ' : ℝ → M} {v : (x : M) → TangentSpace I x} [BoundarylessManifold I M] (hv : ContMDiff I I.tangent 1 fun x => ⟨x, v x⟩) {a b a' b' : ℝ} (hγ : IsMIntegralCurveOn γ v (Set.Ioo a b)) (hγ' : IsMIntegralCurveOn γ' v (Set.Ioo a' b')) {t₀ : ℝ} (ht₀ : t₀ ∈ Set.Ioo a b ∩ Set.Ioo a' b') (h : γ t₀ = γ' t₀) : IsMIntegralCurveOn ((Set.Ioo a b).piecewise γ γ') v (Set.Ioo a b ∪ Set.Ioo a' b')
• MeasureTheory.stoppedValue_piecewise_const 📋 Mathlib.Probability.Process.Stopping
  {Ω : Type u_1} {s : Set Ω} [DecidablePred fun x => x ∈ s] {ι' : Type u_4} {α : Type u_5} [Nonempty ι'] {i j : ι'} {f : ι' → Ω → α} : MeasureTheory.stoppedValue f (s.piecewise (fun x => ↑i) fun x => ↑j) = s.piecewise (f i) (f j)
• MeasureTheory.isStoppingTime_piecewise_const 📋 Mathlib.Probability.Process.Stopping
  {Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {𝒢 : MeasureTheory.Filtration ι m} {i j : ι} {s : Set Ω} [DecidablePred fun x => x ∈ s] (hij : i ≤ j) (hs : MeasurableSet s) : MeasureTheory.IsStoppingTime 𝒢 (s.piecewise (fun x => ↑i) fun x => ↑j)
• MeasureTheory.IsStoppingTime.piecewise_of_le 📋 Mathlib.Probability.Process.Stopping
  {Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {𝒢 : MeasureTheory.Filtration ι m} {τ η : Ω → WithTop ι} {i : ι} {s : Set Ω} [DecidablePred fun x => x ∈ s] (hτ_st : MeasureTheory.IsStoppingTime 𝒢 τ) (hη_st : MeasureTheory.IsStoppingTime 𝒢 η) (hτ : ∀ (ω : Ω), ↑i ≤ τ ω) (hη : ∀ (ω : Ω), ↑i ≤ η ω) (hs : MeasurableSet s) : MeasureTheory.IsStoppingTime 𝒢 (s.piecewise τ η)
• MeasureTheory.stoppedValue_piecewise_const' 📋 Mathlib.Probability.Process.Stopping
  {Ω : Type u_1} {s : Set Ω} [DecidablePred fun x => x ∈ s] {ι' : Type u_4} {α : Type u_5} [AddCommGroup α] [Nonempty ι'] {i j : ι'} {f : ι' → Ω → α} : MeasureTheory.stoppedValue f (s.piecewise (fun x => ↑i) fun x => ↑j) = s.indicator (f i) + sᶜ.indicator (f j)
• MeasureTheory.VectorMeasure.integral_piecewise 📋 Mathlib.MeasureTheory.VectorMeasure.SetIntegral
  {X : Type u_2} {E : Type u_3} {F : Type u_4} {G : Type u_5} {mX : MeasurableSpace X} [NormedAddCommGroup E] [NormedAddCommGroup F] [NormedAddCommGroup G] {μ : MeasureTheory.VectorMeasure X F} {f g : X → E} {s : Set X} [NormedSpace ℝ E] [NormedSpace ℝ F] [NormedSpace ℝ G] {B : E →L[ℝ] F →L[ℝ] G} [DecidablePred fun x => x ∈ s] (hs : MeasurableSet s) (hf : μ.IntegrableOn f s) (hg : μ.IntegrableOn g sᶜ) : ∫ᵛ (x : X), s.piecewise f g x ∂[B; μ] = ∫ᵛ (x : X) in s, f x ∂[B; μ] + ∫ᵛ (x : X) in sᶜ, g x ∂[B; μ]

About

Loogle searches Lean and Mathlib definitions and theorems.

You can use Loogle from within the Lean4 VSCode language extension using the Loogle command from the command palette. You can also try the #loogle command from LeanSearchClient, the CLI version, the Loogle VS Code extension, the lean.nvim integration or the Zulip bot.

Usage

Loogle finds definitions and lemmas in various ways:

1. By constant:
   🔍 Real.sin
   finds all lemmas whose statement somehow mentions the sine function.

2. By lemma name substring:
   🔍 "differ"
   finds all lemmas that have "differ" somewhere in their lemma name.

3. By subexpression:
   🔍 _ * (_ ^ _)
   finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.

   The pattern can also be non-linear, as in
   🔍 Real.sqrt ?a * Real.sqrt ?a

   If the pattern has parameters, they are matched in any order. Both of these will find List.map:
   🔍 (?a -> ?b) -> List ?a -> List ?b
   🔍 List ?a -> (?a -> ?b) -> List ?b

4. By main conclusion:
   🔍 |- tsum _ = _ * tsum _
   finds all lemmas where the conclusion (the subexpression to the right of all → and ∀) has the given shape.

   As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
   🔍 |- _ < _ → tsum _ < tsum _
   will find tsum_lt_tsum even though the hypothesis f i < g i is not the last.

5. You can filter for definitions vs theorems: Using ⊢ (_ : Type _) finds all definitions which provide data while ⊢ (_ : Prop) finds all theorems (and definitions of proofs).

If you pass more than one such search filter, separated by commas Loogle will return lemmas which match all of them. The search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin and tsum, have "two" as a substring of the lemma name, include a product and a power somewhere in the type, and have a hypothesis of the form _ < _ (if there were any such lemmas). Metavariables (?a) are assigned independently in each filter.

The #lucky button will directly send you to the documentation of the first hit.

Source code

You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.

This is Loogle revision 9f11169 serving mathlib revision ce5dd8c