Loogle!
Result
Found 492 declarations mentioning VSub.vsub. Of these, only the first 200 are shown.
- VSub.vsub 📋 Mathlib.Algebra.Notation.Defs
{G : outParam (Type u_1)} {P : Type u_2} [self : VSub G P] : P → P → G - VSub.ext 📋 Mathlib.Algebra.Notation.Defs
{G : outParam (Type u_1)} {P : Type u_2} {x y : VSub G P} (vsub : VSub.vsub = VSub.vsub) : x = y - VSub.ext_iff 📋 Mathlib.Algebra.Notation.Defs
{G : outParam (Type u_1)} {P : Type u_2} {x y : VSub G P} : x = y ↔ VSub.vsub = VSub.vsub - vsub_eq_sub 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} [AddGroup G] (g₁ g₂ : G) : g₁ -ᵥ g₂ = g₁ - g₂ - vsub_self 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (p : P) : p -ᵥ p = 0 - neg_vsub_eq_vsub_rev 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (p₁ p₂ : P) : -(p₁ -ᵥ p₂) = p₂ -ᵥ p₁ - eq_of_vsub_eq_zero 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] {p₁ p₂ : P} (h : p₁ -ᵥ p₂ = 0) : p₁ = p₂ - vsub_eq_zero_iff_eq 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] {p₁ p₂ : P} : p₁ -ᵥ p₂ = 0 ↔ p₁ = p₂ - vsub_ne_zero 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] {p q : P} : p -ᵥ q ≠ 0 ↔ p ≠ q - Equiv.coe_constVSub 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [AddTorsor G P] (p : P) : ⇑(Equiv.constVSub p) = fun x => p -ᵥ x - Equiv.coe_vaddConst_symm 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [AddTorsor G P] (p : P) : ⇑(Equiv.vaddConst p).symm = fun p' => p' -ᵥ p - Equiv.pointReflection_vsub_left 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_3} {P : Type u_4} [AddGroup G] [AddTorsor G P] (x y : P) : (Equiv.pointReflection x) y -ᵥ x = x -ᵥ y - vadd_vsub 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (g : G) (p : P) : (g +ᵥ p) -ᵥ p = g - vsub_sub_vsub_cancel_right 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (p₁ p₂ p₃ : P) : p₁ -ᵥ p₃ - (p₂ -ᵥ p₃) = p₁ -ᵥ p₂ - vsub_vadd 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (p₁ p₂ : P) : (p₁ -ᵥ p₂) +ᵥ p₂ = p₁ - AddTorsor.vadd_vsub' 📋 Mathlib.Algebra.Torsor.Defs
{G : outParam (Type u_1)} {P : Type u_2} {inst✝ : AddGroup G} [self : AddTorsor G P] (g : G) (p : P) : (g +ᵥ p) -ᵥ p = g - AddTorsor.vsub_vadd' 📋 Mathlib.Algebra.Torsor.Defs
{G : outParam (Type u_1)} {P : Type u_2} {inst✝ : AddGroup G} [self : AddTorsor G P] (p₁ p₂ : P) : (p₁ -ᵥ p₂) +ᵥ p₂ = p₁ - eq_vadd_iff_vsub_eq 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (p₁ : P) (g : G) (p₂ : P) : p₁ = g +ᵥ p₂ ↔ p₁ -ᵥ p₂ = g - vsub_add_vsub_cancel 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (p₁ p₂ p₃ : P) : p₁ -ᵥ p₂ + (p₂ -ᵥ p₃) = p₁ -ᵥ p₃ - Equiv.pointReflection_vsub_right 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_3} {P : Type u_4} [AddGroup G] [AddTorsor G P] (x y : P) : (Equiv.pointReflection x) y -ᵥ y = 2 • (x -ᵥ y) - Equiv.pointReflection_apply 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_3} {P : Type u_4} [AddGroup G] [AddTorsor G P] (x y : P) : (Equiv.pointReflection x) y = (x -ᵥ y) +ᵥ x - vadd_vsub_eq_sub_vsub 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (g : G) (p q : P) : (g +ᵥ p) -ᵥ q = g - (q -ᵥ p) - vsub_vadd_eq_vsub_sub 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (p₁ p₂ : P) (g : G) : p₁ -ᵥ (g +ᵥ p₂) = p₁ -ᵥ p₂ - g - vadd_vsub_assoc 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (g : G) (p₁ p₂ : P) : (g +ᵥ p₁) -ᵥ p₂ = g + (p₁ -ᵥ p₂) - vadd_vsub_vadd_cancel_right 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (v₁ v₂ : G) (p : P) : (v₁ +ᵥ p) -ᵥ (v₂ +ᵥ p) = v₁ - v₂ - AddTorsor.mk 📋 Mathlib.Algebra.Torsor.Defs
{G : outParam (Type u_1)} {P : Type u_2} [AddGroup G] [toAddAction : AddAction G P] [toVSub : VSub G P] [nonempty : Nonempty P] (vsub_vadd' : ∀ (p₁ p₂ : P), (p₁ -ᵥ p₂) +ᵥ p₂ = p₁) (vadd_vsub' : ∀ (g : G) (p : P), (g +ᵥ p) -ᵥ p = g) : AddTorsor G P - vadd_eq_vadd_iff_neg_add_eq_vsub 📋 Mathlib.Algebra.Torsor.Defs
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] {v₁ v₂ : G} {p₁ p₂ : P} : v₁ +ᵥ p₁ = v₂ +ᵥ p₂ ↔ -v₁ + v₂ = p₁ -ᵥ p₂ - Set.Nonempty.of_vsub_left 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} : (s -ᵥ t).Nonempty → s.Nonempty - Set.Nonempty.of_vsub_right 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} : (s -ᵥ t).Nonempty → t.Nonempty - Set.Nonempty.vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} : s.Nonempty → t.Nonempty → (s -ᵥ t).Nonempty - Set.empty_vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] (t : Set β) : ∅ -ᵥ t = ∅ - Set.vsub_empty 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] (s : Set β) : s -ᵥ ∅ = ∅ - Set.vsub_nonempty 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} : (s -ᵥ t).Nonempty ↔ s.Nonempty ∧ t.Nonempty - Set.image2_vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} : Set.image2 (fun x1 x2 => x1 -ᵥ x2) s t = s -ᵥ t - Set.singleton_vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] (t : Set β) (b : β) : {b} -ᵥ t = (fun x => b -ᵥ x) '' t - Set.vsub_singleton 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] (s : Set β) (b : β) : s -ᵥ {b} = (fun x => x -ᵥ b) '' s - Set.vsub_self_mono 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} (h : s ⊆ t) : s -ᵥ s ⊆ t -ᵥ t - Set.singleton_vsub_singleton 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {b c : β} : {b} -ᵥ {c} = {b -ᵥ c} - Set.vsub_subset_vsub_left 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t₁ t₂ : Set β} : t₁ ⊆ t₂ → s -ᵥ t₁ ⊆ s -ᵥ t₂ - Set.vsub_subset_vsub_right 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s₁ s₂ t : Set β} : s₁ ⊆ s₂ → s₁ -ᵥ t ⊆ s₂ -ᵥ t - Set.vsub_eq_empty 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} : s -ᵥ t = ∅ ↔ s = ∅ ∨ t = ∅ - Set.vsub_mem_vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} {b c : β} (hb : b ∈ s) (hc : c ∈ t) : b -ᵥ c ∈ s -ᵥ t - Set.vsub_subset_vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s₁ s₂ t₁ t₂ : Set β} : s₁ ⊆ s₂ → t₁ ⊆ t₂ → s₁ -ᵥ t₁ ⊆ s₂ -ᵥ t₂ - Set.image_vsub_prod 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} : (fun x => x.1 -ᵥ x.2) '' s ×ˢ t = s -ᵥ t - Set.union_vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s₁ s₂ t : Set β} : s₁ ∪ s₂ -ᵥ t = s₁ -ᵥ t ∪ (s₂ -ᵥ t) - Set.vsub_union 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t₁ t₂ : Set β} : s -ᵥ (t₁ ∪ t₂) = s -ᵥ t₁ ∪ (s -ᵥ t₂) - Set.inter_vsub_subset 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s₁ s₂ t : Set β} : s₁ ∩ s₂ -ᵥ t ⊆ (s₁ -ᵥ t) ∩ (s₂ -ᵥ t) - Set.vsub_inter_subset 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t₁ t₂ : Set β} : s -ᵥ t₁ ∩ t₂ ⊆ (s -ᵥ t₁) ∩ (s -ᵥ t₂) - Set.vsub_subset_iff 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} {u : Set α} : s -ᵥ t ⊆ u ↔ ∀ x ∈ s, ∀ y ∈ t, x -ᵥ y ∈ u - Set.mem_vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} {a : α} : a ∈ s -ᵥ t ↔ ∃ x ∈ s, ∃ y ∈ t, x -ᵥ y = a - Set.inter_vsub_union_subset_union 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s₁ s₂ t₁ t₂ : Set β} : s₁ ∩ s₂ -ᵥ (t₁ ∪ t₂) ⊆ s₁ -ᵥ t₁ ∪ (s₂ -ᵥ t₂) - Set.union_vsub_inter_subset_union 📋 Mathlib.Algebra.Group.Pointwise.Set.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] {s₁ s₂ t₁ t₂ : Set β} : s₁ ∪ s₂ -ᵥ t₁ ∩ t₂ ⊆ s₁ -ᵥ t₁ ∪ (s₂ -ᵥ t₂) - vsub_left_injective 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (p : P) : Function.Injective fun x => x -ᵥ p - vsub_right_injective 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (p : P) : Function.Injective fun x => p -ᵥ x - vsub_left_cancel 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] {p₁ p₂ p : P} (h : p₁ -ᵥ p = p₂ -ᵥ p) : p₁ = p₂ - vsub_right_cancel 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] {p₁ p₂ p : P} (h : p -ᵥ p₁ = p -ᵥ p₂) : p₁ = p₂ - vsub_left_cancel_iff 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] {p₁ p₂ p : P} : p₁ -ᵥ p = p₂ -ᵥ p ↔ p₁ = p₂ - vsub_right_cancel_iff 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] {p₁ p₂ p : P} : p -ᵥ p₁ = p -ᵥ p₂ ↔ p₁ = p₂ - Set.Nonempty.zero_mem_vsub_self 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] {s : Set P} (h : s.Nonempty) : 0 ∈ s -ᵥ s - Equiv.left_vsub_pointReflection 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_3} {P : Type u_4} [AddGroup G] [T : AddTorsor G P] (x y : P) : x -ᵥ (Equiv.pointReflection x) y = y -ᵥ x - Set.singleton_vsub_self 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] (p : P) : {p} -ᵥ {p} = {0} - vsub_sub_vsub_cancel_left 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddCommGroup G] [AddTorsor G P] (p₁ p₂ p₃ : P) : p₃ -ᵥ p₂ - (p₃ -ᵥ p₁) = p₁ -ᵥ p₂ - Pi.vsub_apply 📋 Mathlib.Algebra.Torsor.Basic
{I : Type u} {fg : I → Type v} [(i : I) → AddGroup (fg i)] {fp : I → Type w} [(i : I) → AddTorsor (fg i) (fp i)] (p q : (i : I) → fp i) (i : I) : (p -ᵥ q) i = p i -ᵥ q i - Pi.vsub_def 📋 Mathlib.Algebra.Torsor.Basic
{I : Type u} {fg : I → Type v} [(i : I) → AddGroup (fg i)] {fp : I → Type w} [(i : I) → AddTorsor (fg i) (fp i)] (p q : (i : I) → fp i) : p -ᵥ q = fun i => p i -ᵥ q i - Equiv.right_vsub_pointReflection 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_3} {P : Type u_4} [AddGroup G] [T : AddTorsor G P] (x y : P) : y -ᵥ (Equiv.pointReflection x) y = 2 • (y -ᵥ x) - Prod.fst_vsub 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {G' : Type u_2} {P : Type u_3} {P' : Type u_4} [AddGroup G] [AddGroup G'] [AddTorsor G P] [AddTorsor G' P'] (p₁ p₂ : P × P') : (p₁ -ᵥ p₂).1 = p₁.1 -ᵥ p₂.1 - Prod.snd_vsub 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {G' : Type u_2} {P : Type u_3} {P' : Type u_4} [AddGroup G] [AddGroup G'] [AddTorsor G P] [AddTorsor G' P'] (p₁ p₂ : P × P') : (p₁ -ᵥ p₂).2 = p₁.2 -ᵥ p₂.2 - Prod.mk_vsub_mk 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {G' : Type u_2} {P : Type u_3} {P' : Type u_4} [AddGroup G] [AddGroup G'] [AddTorsor G P] [AddTorsor G' P'] (p₁ p₂ : P) (p₁' p₂' : P') : (p₁, p₁') -ᵥ (p₂, p₂') = (p₁ -ᵥ p₂, p₁' -ᵥ p₂') - Set.zero_mem_vsub_iff 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddGroup G] [T : AddTorsor G P] {s t : Set P} : 0 ∈ s -ᵥ t ↔ ¬Disjoint s t - vsub_sub_vsub_comm 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddCommGroup G] [AddTorsor G P] (p₁ p₂ p₃ p₄ : P) : p₁ -ᵥ p₂ - (p₃ -ᵥ p₄) = p₁ -ᵥ p₃ - (p₂ -ᵥ p₄) - Function.Surjective.addTorsor 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} {Q : Type u_3} [AddGroup G] [AddTorsor G P] [VAdd G Q] [VSub G Q] (f : P → Q) (hf : Function.Surjective f) (vadd : ∀ (c : G) (x : P), f (c +ᵥ x) = c +ᵥ f x) (vsub : ∀ (x y : P), x -ᵥ y = f x -ᵥ f y) : AddTorsor G Q - Function.Injective.addTorsor 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} {Q : Type u_3} [AddGroup G] [AddTorsor G P] [VAdd G Q] [VSub G Q] [Nonempty Q] (f : Q → P) (hf : Function.Injective f) (vadd : ∀ (c : G) (x : Q), f (c +ᵥ x) = c +ᵥ f x) (vsub : ∀ (x y : Q), x -ᵥ y = f x -ᵥ f y) : AddTorsor G Q - vadd_vsub_vadd_cancel_left 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddCommGroup G] [AddTorsor G P] (v : G) (p₁ p₂ : P) : (v +ᵥ p₁) -ᵥ (v +ᵥ p₂) = p₁ -ᵥ p₂ - vsub_vadd_comm 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddCommGroup G] [AddTorsor G P] (p₁ p₂ p₃ : P) : (p₁ -ᵥ p₂) +ᵥ p₃ = (p₃ -ᵥ p₂) +ᵥ p₁ - vadd_eq_vadd_iff_sub_eq_vsub 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddCommGroup G] [AddTorsor G P] {v₁ v₂ : G} {p₁ p₂ : P} : v₁ +ᵥ p₁ = v₂ +ᵥ p₂ ↔ v₂ - v₁ = p₁ -ᵥ p₂ - Set.prod_vsub_prod_comm 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {G' : Type u_2} {P : Type u_3} {P' : Type u_4} [AddGroup G] [AddGroup G'] [AddTorsor G P] [AddTorsor G' P'] (s₁ s₂ : Set P) (t₁ t₂ : Set P') : s₁ ×ˢ t₁ -ᵥ s₂ ×ˢ t₂ = (s₁ -ᵥ s₂) ×ˢ (t₁ -ᵥ t₂) - Set.vadd_set_vsub_vadd_set 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddCommGroup G] [AddTorsor G P] (v : G) (s t : Set P) : (v +ᵥ s) -ᵥ (v +ᵥ t) = s -ᵥ t - sub_add_vsub_comm 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddCommGroup G] [AddTorsor G P] (v₁ v₂ : G) (p₁ p₂ : P) : v₁ - v₂ + (p₁ -ᵥ p₂) = (v₁ +ᵥ p₁) -ᵥ (v₂ +ᵥ p₂) - vadd_vsub_vadd_comm 📋 Mathlib.Algebra.Torsor.Basic
{G : Type u_1} {P : Type u_2} [AddCommGroup G] [AddTorsor G P] (v₁ v₂ : G) (p₁ p₂ : P) : (v₁ +ᵥ p₁) -ᵥ (v₂ +ᵥ p₂) = v₁ - v₂ + (p₁ -ᵥ p₂) - Set.Finite.vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Finite
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} (hs : s.Finite) (ht : t.Finite) : (s -ᵥ t).Finite - Set.iUnion_vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} {ι : Sort u_3} [VSub α β] (s : ι → Set β) (t : Set β) : (⋃ i, s i) -ᵥ t = ⋃ i, s i -ᵥ t - Set.vsub_iUnion 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} {ι : Sort u_3} [VSub α β] (s : Set β) (t : ι → Set β) : s -ᵥ ⋃ i, t i = ⋃ i, s -ᵥ t i - Set.iInter_vsub_subset 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} {ι : Sort u_3} [VSub α β] (s : ι → Set β) (t : Set β) : (⋂ i, s i) -ᵥ t ⊆ ⋂ i, s i -ᵥ t - Set.vsub_iInter_subset 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} {ι : Sort u_3} [VSub α β] (s : Set β) (t : ι → Set β) : s -ᵥ ⋂ i, t i ⊆ ⋂ i, s -ᵥ t i - Set.iUnion_vsub_left_image 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} : ⋃ a ∈ s, (fun x => a -ᵥ x) '' t = s -ᵥ t - Set.iUnion_vsub_right_image 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} : ⋃ a ∈ t, (fun x => x -ᵥ a) '' s = s -ᵥ t - Set.iUnion₂_vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} {ι : Sort u_3} {κ : ι → Sort u_4} [VSub α β] (s : (i : ι) → κ i → Set β) (t : Set β) : (⋃ i, ⋃ j, s i j) -ᵥ t = ⋃ i, ⋃ j, s i j -ᵥ t - Set.vsub_iUnion₂ 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} {ι : Sort u_3} {κ : ι → Sort u_4} [VSub α β] (s : Set β) (t : (i : ι) → κ i → Set β) : s -ᵥ ⋃ i, ⋃ j, t i j = ⋃ i, ⋃ j, s -ᵥ t i j - Set.iInter₂_vsub_subset 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} {ι : Sort u_3} {κ : ι → Sort u_4} [VSub α β] (s : (i : ι) → κ i → Set β) (t : Set β) : (⋂ i, ⋂ j, s i j) -ᵥ t ⊆ ⋂ i, ⋂ j, s i j -ᵥ t - Set.vsub_iInter₂_subset 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} {ι : Sort u_3} {κ : ι → Sort u_4} [VSub α β] (s : Set β) (t : (i : ι) → κ i → Set β) : s -ᵥ ⋂ i, ⋂ j, t i j ⊆ ⋂ i, ⋂ j, s -ᵥ t i j - Set.sUnion_vsub 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} [VSub α β] (S : Set (Set β)) (t : Set β) : ⋃₀ S -ᵥ t = ⋃ s ∈ S, s -ᵥ t - Set.vsub_sUnion 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} [VSub α β] (s : Set β) (T : Set (Set β)) : s -ᵥ ⋃₀ T = ⋃ t ∈ T, s -ᵥ t - Set.sInter_vsub_subset 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} [VSub α β] (S : Set (Set β)) (t : Set β) : ⋂₀ S -ᵥ t ⊆ ⋂ s ∈ S, s -ᵥ t - Set.vsub_sInter_subset 📋 Mathlib.Algebra.Group.Pointwise.Set.Lattice
{α : Type u_1} {β : Type u_2} [VSub α β] (s : Set β) (T : Set (Set β)) : s -ᵥ ⋂₀ T ⊆ ⋂ t ∈ T, s -ᵥ t - Finset.Nonempty.of_vsub_left 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t : Finset β} : (s -ᵥ t).Nonempty → s.Nonempty - Finset.Nonempty.of_vsub_right 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t : Finset β} : (s -ᵥ t).Nonempty → t.Nonempty - Finset.Nonempty.vsub 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t : Finset β} : s.Nonempty → t.Nonempty → (s -ᵥ t).Nonempty - Finset.empty_vsub 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] (t : Finset β) : ∅ -ᵥ t = ∅ - Finset.vsub_empty 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] (s : Finset β) : s -ᵥ ∅ = ∅ - Finset.vsub_nonempty 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t : Finset β} : (s -ᵥ t).Nonempty ↔ s.Nonempty ∧ t.Nonempty - Finset.image_vsub_product 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t : Finset β} : Finset.image₂ (fun x1 x2 => x1 -ᵥ x2) s t = s -ᵥ t - Finset.vsub_card_le 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t : Finset β} : (s -ᵥ t).card ≤ s.card * t.card - Finset.vsub_def 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t : Finset β} : s -ᵥ t = Finset.image₂ (fun x1 x2 => x1 -ᵥ x2) s t - Finset.singleton_vsub 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {t : Finset β} (a : β) : {a} -ᵥ t = Finset.image (fun x => a -ᵥ x) t - Finset.vsub_singleton 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s : Finset β} (b : β) : s -ᵥ {b} = Finset.image (fun x => x -ᵥ b) s - Finset.singleton_vsub_singleton 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] (a b : β) : {a} -ᵥ {b} = {a -ᵥ b} - Finset.vsub_eq_empty 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t : Finset β} : s -ᵥ t = ∅ ↔ s = ∅ ∨ t = ∅ - Finset.coe_vsub 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] (s t : Finset β) : ↑(s -ᵥ t) = ↑s -ᵥ ↑t - Finset.vsub_subset_vsub_left 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t₁ t₂ : Finset β} : t₁ ⊆ t₂ → s -ᵥ t₁ ⊆ s -ᵥ t₂ - Finset.vsub_subset_vsub_right 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s₁ s₂ t : Finset β} : s₁ ⊆ s₂ → s₁ -ᵥ t ⊆ s₂ -ᵥ t - Finset.vsub_mem_vsub 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t : Finset β} {b c : β} : b ∈ s → c ∈ t → b -ᵥ c ∈ s -ᵥ t - Finset.union_vsub 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s₁ s₂ t : Finset β} [DecidableEq β] : s₁ ∪ s₂ -ᵥ t = s₁ -ᵥ t ∪ (s₂ -ᵥ t) - Finset.vsub_union 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t₁ t₂ : Finset β} [DecidableEq β] : s -ᵥ (t₁ ∪ t₂) = s -ᵥ t₁ ∪ (s -ᵥ t₂) - Set.toFinset_vsub 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [DecidableEq α] [VSub α β] (s t : Set β) [Fintype ↑s] [Fintype ↑t] [Fintype ↑(s -ᵥ t)] : (s -ᵥ t).toFinset = s.toFinset -ᵥ t.toFinset - Set.Finite.toFinset_vsub 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [DecidableEq α] [VSub α β] {s t : Set β} (hs : s.Finite) (ht : t.Finite) (hf : (s -ᵥ t).Finite := ⋯) : hf.toFinset = hs.toFinset -ᵥ ht.toFinset - Finset.inter_vsub_subset 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s₁ s₂ t : Finset β} [DecidableEq β] : s₁ ∩ s₂ -ᵥ t ⊆ (s₁ -ᵥ t) ∩ (s₂ -ᵥ t) - Finset.vsub_inter_subset 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t₁ t₂ : Finset β} [DecidableEq β] : s -ᵥ t₁ ∩ t₂ ⊆ (s -ᵥ t₁) ∩ (s -ᵥ t₂) - Finset.vsub_subset_vsub 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s₁ s₂ t₁ t₂ : Finset β} : s₁ ⊆ s₂ → t₁ ⊆ t₂ → s₁ -ᵥ t₁ ⊆ s₂ -ᵥ t₂ - Finset.mem_vsub 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t : Finset β} {a : α} : a ∈ s -ᵥ t ↔ ∃ b ∈ s, ∃ c ∈ t, b -ᵥ c = a - Finset.vsub_subset_iff 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {s t : Finset β} {u : Finset α} : s -ᵥ t ⊆ u ↔ ∀ x ∈ s, ∀ y ∈ t, x -ᵥ y ∈ u - Finset.subset_vsub 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [VSub α β] [DecidableEq α] {u : Finset α} {s t : Set β} : ↑u ⊆ s -ᵥ t → ∃ s' t', ↑s' ⊆ s ∧ ↑t' ⊆ t ∧ u ⊆ s' -ᵥ t' - Filter.NeBot.of_vsub_left 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f g : Filter β} : (f -ᵥ g).NeBot → f.NeBot - Filter.NeBot.of_vsub_right 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f g : Filter β} : (f -ᵥ g).NeBot → g.NeBot - Filter.NeBot.vsub 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f g : Filter β} : f.NeBot → g.NeBot → (f -ᵥ g).NeBot - Filter.vsub.instNeBot 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f g : Filter β} [f.NeBot] [g.NeBot] : (f -ᵥ g).NeBot - Filter.bot_vsub 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {g : Filter β} : ⊥ -ᵥ g = ⊥ - Filter.vsub_bot 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f : Filter β} : f -ᵥ ⊥ = ⊥ - Filter.vsub_neBot_iff 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f g : Filter β} : (f -ᵥ g).NeBot ↔ f.NeBot ∧ g.NeBot - Filter.map₂_vsub 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f g : Filter β} : Filter.map₂ (fun x1 x2 => x1 -ᵥ x2) f g = f -ᵥ g - Filter.pure_vsub 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {g : Filter β} {a : β} : pure a -ᵥ g = Filter.map (fun x => a -ᵥ x) g - Filter.vsub_pure 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f : Filter β} {b : β} : f -ᵥ pure b = Filter.map (fun x => x -ᵥ b) f - Filter.pure_vsub_pure 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {a b : β} : pure a -ᵥ pure b = pure (a -ᵥ b) - Filter.vsub_eq_bot_iff 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f g : Filter β} : f -ᵥ g = ⊥ ↔ f = ⊥ ∨ g = ⊥ - Filter.vsub_le_vsub_left 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f g₁ g₂ : Filter β} : g₁ ≤ g₂ → f -ᵥ g₁ ≤ f -ᵥ g₂ - Filter.vsub_le_vsub_right 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f₁ f₂ g : Filter β} : f₁ ≤ f₂ → f₁ -ᵥ g ≤ f₂ -ᵥ g - Filter.vsub_mem_vsub 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f g : Filter β} {s t : Set β} : s ∈ f → t ∈ g → s -ᵥ t ∈ f -ᵥ g - Filter.vsub_le_vsub 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f₁ f₂ g₁ g₂ : Filter β} : f₁ ≤ f₂ → g₁ ≤ g₂ → f₁ -ᵥ g₁ ≤ f₂ -ᵥ g₂ - Filter.le_vsub_iff 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f g : Filter β} {h : Filter α} : h ≤ f -ᵥ g ↔ ∀ ⦃s : Set β⦄, s ∈ f → ∀ ⦃t : Set β⦄, t ∈ g → s -ᵥ t ∈ h - Filter.mem_vsub 📋 Mathlib.Order.Filter.Pointwise
{α : Type u_2} {β : Type u_3} [VSub α β] {f g : Filter β} {s : Set α} : s ∈ f -ᵥ g ↔ ∃ t₁ ∈ f, ∃ t₂ ∈ g, t₁ -ᵥ t₂ ⊆ s - AffineMap.left_vsub_lineMap 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] (p₀ p₁ : P1) (c : k) : p₀ -ᵥ (AffineMap.lineMap p₀ p₁) c = c • (p₀ -ᵥ p₁) - AffineMap.lineMap_vsub_left 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] (p₀ p₁ : P1) (c : k) : (AffineMap.lineMap p₀ p₁) c -ᵥ p₀ = c • (p₁ -ᵥ p₀) - AffineMap.lineMap_linear 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] (p₀ p₁ : P1) : (AffineMap.lineMap p₀ p₁).linear = LinearMap.id.smulRight (p₁ -ᵥ p₀) - AffineMap.coe_homothety 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_2} {V1 : Type u_3} {P1 : Type u_4} [CommRing k] [AddCommGroup V1] [AddTorsor V1 P1] [Module k V1] (c : P1) (r : k) : ⇑(AffineMap.homothety c r) = fun p => r • (p -ᵥ c) +ᵥ c - AffineMap.homothety_apply 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_2} {V1 : Type u_3} {P1 : Type u_4} [CommRing k] [AddCommGroup V1] [AddTorsor V1 P1] [Module k V1] (c : P1) (r : k) (p : P1) : (AffineMap.homothety c r) p = r • (p -ᵥ c) +ᵥ c - AffineMap.mk' 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} {V2 : Type u_4} {P2 : Type u_5} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] [AddCommGroup V2] [Module k V2] [AddTorsor V2 P2] (f : P1 → P2) (f' : V1 →ₗ[k] V2) (p : P1) (h : ∀ (p' : P1), f p' = f' (p' -ᵥ p) +ᵥ f p) : P1 →ᵃ[k] P2 - AffineMap.coe_lineMap 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] (p₀ p₁ : P1) : ⇑(AffineMap.lineMap p₀ p₁) = fun c => c • (p₁ -ᵥ p₀) +ᵥ p₀ - AffineMap.lineMap_apply 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] (p₀ p₁ : P1) (c : k) : (AffineMap.lineMap p₀ p₁) c = c • (p₁ -ᵥ p₀) +ᵥ p₀ - AffineMap.lineMap_vsub_right 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] (p₀ p₁ : P1) (c : k) : (AffineMap.lineMap p₀ p₁) c -ᵥ p₁ = (1 - c) • (p₀ -ᵥ p₁) - AffineMap.right_vsub_lineMap 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] (p₀ p₁ : P1) (c : k) : p₁ -ᵥ (AffineMap.lineMap p₀ p₁) c = (1 - c) • (p₁ -ᵥ p₀) - AffineMap.linearMap_vsub 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} {V2 : Type u_4} {P2 : Type u_5} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] [AddCommGroup V2] [Module k V2] [AddTorsor V2 P2] (f : P1 →ᵃ[k] P2) (p1 p2 : P1) : f.linear (p1 -ᵥ p2) = f p1 -ᵥ f p2 - AffineMap.coe_mk' 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} {V2 : Type u_4} {P2 : Type u_5} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] [AddCommGroup V2] [Module k V2] [AddTorsor V2 P2] (f : P1 → P2) (f' : V1 →ₗ[k] V2) (p : P1) (h : ∀ (p' : P1), f p' = f' (p' -ᵥ p) +ᵥ f p) : ⇑(AffineMap.mk' f f' p h) = f - AffineMap.image_vsub_image 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} {V2 : Type u_4} {P2 : Type u_5} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] [AddCommGroup V2] [Module k V2] [AddTorsor V2 P2] {s t : Set P1} (f : P1 →ᵃ[k] P2) : ⇑f '' s -ᵥ ⇑f '' t = ⇑f.linear '' (s -ᵥ t) - AffineMap.mk'_linear 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} {V2 : Type u_4} {P2 : Type u_5} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] [AddCommGroup V2] [Module k V2] [AddTorsor V2 P2] (f : P1 → P2) (f' : V1 →ₗ[k] V2) (p : P1) (h : ∀ (p' : P1), f p' = f' (p' -ᵥ p) +ᵥ f p) : (AffineMap.mk' f f' p h).linear = f' - AffineMap.lineMap_vsub_lineMap 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] (p₁ p₂ p₃ p₄ : P1) (c : k) : (AffineMap.lineMap p₁ p₂) c -ᵥ (AffineMap.lineMap p₃ p₄) c = (AffineMap.lineMap (p₁ -ᵥ p₃) (p₂ -ᵥ p₄)) c - AffineMap.vsub_apply 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} {V2 : Type u_4} {P2 : Type u_5} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] [AddCommGroup V2] [Module k V2] [AddTorsor V2 P2] (f g : P1 →ᵃ[k] P2) (p : P1) : (f -ᵥ g) p = f p -ᵥ g p - AffineMap.vsub_linear 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_1} {V1 : Type u_2} {P1 : Type u_3} {V2 : Type u_4} {P2 : Type u_5} [Ring k] [AddCommGroup V1] [Module k V1] [AddTorsor V1 P1] [AddCommGroup V2] [Module k V2] [AddTorsor V2 P2] (f g : P1 →ᵃ[k] P2) : (f -ᵥ g).linear = f.linear - g.linear - AffineMap.homothety_def 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_2} {V1 : Type u_3} {P1 : Type u_4} [CommRing k] [AddCommGroup V1] [AddTorsor V1 P1] [Module k V1] (c : P1) (r : k) : AffineMap.homothety c r = r • (AffineMap.id k P1 -ᵥ AffineMap.const k P1 c) +ᵥ AffineMap.const k P1 c - AffineMap.homothety_add 📋 Mathlib.LinearAlgebra.AffineSpace.AffineMap
{k : Type u_2} {V1 : Type u_3} {P1 : Type u_4} [CommRing k] [AddCommGroup V1] [AddTorsor V1 P1] [Module k V1] (c : P1) (r₁ r₂ : k) : AffineMap.homothety c (r₁ + r₂) = r₁ • (AffineMap.id k P1 -ᵥ AffineMap.const k P1 c) +ᵥ AffineMap.homothety c r₂ - AffineEquiv.coe_constVSub 📋 Mathlib.LinearAlgebra.AffineSpace.AffineEquiv
(k : Type u_1) {P₁ : Type u_2} {V₁ : Type u_6} [Ring k] [AddCommGroup V₁] [Module k V₁] [AddTorsor V₁ P₁] (p : P₁) : ⇑(AffineEquiv.constVSub k p) = fun x => p -ᵥ x - AffineEquiv.constVSub_apply 📋 Mathlib.LinearAlgebra.AffineSpace.AffineEquiv
(k : Type u_1) {P₁ : Type u_2} {V₁ : Type u_6} [Ring k] [AddCommGroup V₁] [Module k V₁] [AddTorsor V₁ P₁] (p x✝ : P₁) : (AffineEquiv.constVSub k p) x✝ = p -ᵥ x✝ - AffineEquiv.vaddConst_symm_apply 📋 Mathlib.LinearAlgebra.AffineSpace.AffineEquiv
(k : Type u_1) {P₁ : Type u_2} {V₁ : Type u_6} [Ring k] [AddCommGroup V₁] [Module k V₁] [AddTorsor V₁ P₁] (b p' : P₁) : (AffineEquiv.vaddConst k b).symm p' = p' -ᵥ b - AffineEquiv.pointReflection_apply 📋 Mathlib.LinearAlgebra.AffineSpace.AffineEquiv
(k : Type u_1) {P₁ : Type u_2} {V₁ : Type u_6} [Ring k] [AddCommGroup V₁] [Module k V₁] [AddTorsor V₁ P₁] (x y : P₁) : (AffineEquiv.pointReflection k x) y = (x -ᵥ y) +ᵥ x - AffineMap.lineMap_vsub 📋 Mathlib.LinearAlgebra.AffineSpace.AffineEquiv
{k : Type u_1} {P₁ : Type u_2} {V₁ : Type u_6} [Ring k] [AddCommGroup V₁] [Module k V₁] [AddTorsor V₁ P₁] (p₁ p₂ p₃ : P₁) (c : k) : (AffineMap.lineMap p₁ p₂) c -ᵥ p₃ = (AffineMap.lineMap (p₁ -ᵥ p₃) (p₂ -ᵥ p₃)) c - AffineMap.vsub_lineMap 📋 Mathlib.LinearAlgebra.AffineSpace.AffineEquiv
{k : Type u_1} {P₁ : Type u_2} {V₁ : Type u_6} [Ring k] [AddCommGroup V₁] [Module k V₁] [AddTorsor V₁ P₁] (p₁ p₂ p₃ : P₁) (c : k) : p₁ -ᵥ (AffineMap.lineMap p₂ p₃) c = (AffineMap.lineMap (p₁ -ᵥ p₂) (p₁ -ᵥ p₃)) c - AffineEquiv.mk' 📋 Mathlib.LinearAlgebra.AffineSpace.AffineEquiv
{k : Type u_1} {P₁ : Type u_2} {P₂ : Type u_3} {V₁ : Type u_6} {V₂ : Type u_7} [Ring k] [AddCommGroup V₁] [AddCommGroup V₂] [Module k V₁] [Module k V₂] [AddTorsor V₁ P₁] [AddTorsor V₂ P₂] (e : P₁ → P₂) (e' : V₁ ≃ₗ[k] V₂) (p : P₁) (h : ∀ (p' : P₁), e p' = e' (p' -ᵥ p) +ᵥ e p) : P₁ ≃ᵃ[k] P₂ - AffineEquiv.ofLinearEquiv_apply 📋 Mathlib.LinearAlgebra.AffineSpace.AffineEquiv
{k : Type u_10} {V : Type u_11} {P : Type u_12} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] (A : V ≃ₗ[k] V) (p₀ p₁ x : P) : (AffineEquiv.ofLinearEquiv A p₀ p₁) x = A (x -ᵥ p₀) +ᵥ p₁ - AffineEquiv.linear_mk' 📋 Mathlib.LinearAlgebra.AffineSpace.AffineEquiv
{k : Type u_1} {P₁ : Type u_2} {P₂ : Type u_3} {V₁ : Type u_6} {V₂ : Type u_7} [Ring k] [AddCommGroup V₁] [AddCommGroup V₂] [Module k V₁] [Module k V₂] [AddTorsor V₁ P₁] [AddTorsor V₂ P₂] (e : P₁ ≃ P₂) (e' : V₁ ≃ₗ[k] V₂) (p : P₁) (h : ∀ (p' : P₁), e p' = e' (p' -ᵥ p) +ᵥ e p) : (AffineEquiv.mk' (⇑e) e' p h).linear = e' - AffineEquiv.coe_mk' 📋 Mathlib.LinearAlgebra.AffineSpace.AffineEquiv
{k : Type u_1} {P₁ : Type u_2} {P₂ : Type u_3} {V₁ : Type u_6} {V₂ : Type u_7} [Ring k] [AddCommGroup V₁] [AddCommGroup V₂] [Module k V₁] [Module k V₂] [AddTorsor V₁ P₁] [AddTorsor V₂ P₂] (e : P₁ ≃ P₂) (e' : V₁ ≃ₗ[k] V₂) (p : P₁) (h : ∀ (p' : P₁), e p' = e' (p' -ᵥ p) +ᵥ e p) : ⇑(AffineEquiv.mk' (⇑e) e' p h) = ⇑e - midpoint_eq_midpoint_iff_vsub_eq_vsub 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
(R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] {x x' y y' : P} : midpoint R x y = midpoint R x' y' ↔ x -ᵥ x' = y' -ᵥ y - midpoint_vsub_midpoint 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
{R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ p₃ p₄ : P) : midpoint R p₁ p₂ -ᵥ midpoint R p₃ p₄ = midpoint R (p₁ -ᵥ p₃) (p₂ -ᵥ p₄) - left_vsub_midpoint 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
{R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ : P) : p₁ -ᵥ midpoint R p₁ p₂ = ⅟2 • (p₁ -ᵥ p₂) - midpoint_vsub_left 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
{R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ : P) : midpoint R p₁ p₂ -ᵥ p₁ = ⅟2 • (p₂ -ᵥ p₁) - midpoint_vsub_right 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
{R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ : P) : midpoint R p₁ p₂ -ᵥ p₂ = ⅟2 • (p₁ -ᵥ p₂) - right_vsub_midpoint 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
{R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ : P) : p₂ -ᵥ midpoint R p₁ p₂ = ⅟2 • (p₂ -ᵥ p₁) - midpoint_vsub_midpoint_same_left 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
(R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ p₃ : P) : midpoint R p₁ p₂ -ᵥ midpoint R p₁ p₃ = ⅟2 • (p₂ -ᵥ p₃) - midpoint_vsub_midpoint_same_right 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
(R : Type u_1) {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ p₃ : P) : midpoint R p₁ p₃ -ᵥ midpoint R p₂ p₃ = ⅟2 • (p₁ -ᵥ p₂) - midpoint_vsub 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
{R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ p : P) : midpoint R p₁ p₂ -ᵥ p = ⅟2 • (p₁ -ᵥ p) + ⅟2 • (p₂ -ᵥ p) - vsub_midpoint 📋 Mathlib.LinearAlgebra.AffineSpace.Midpoint
{R : Type u_1} {V : Type u_2} {P : Type u_4} [Ring R] [Invertible 2] [AddCommGroup V] [Module R V] [AddTorsor V P] (p₁ p₂ p : P) : p -ᵥ midpoint R p₁ p₂ = ⅟2 • (p -ᵥ p₁) + ⅟2 • (p -ᵥ p₂) - vectorSpan_def 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
(k : Type u_1) {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] (s : Set P) : vectorSpan k s = Submodule.span k (s -ᵥ s) - vsub_set_subset_vectorSpan 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
(k : Type u_1) {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] (s : Set P) : s -ᵥ s ⊆ ↑(vectorSpan k s) - vsub_mem_vectorSpan_pair 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
(k : Type u_1) {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] (p₁ p₂ : P) : p₁ -ᵥ p₂ ∈ vectorSpan k {p₁, p₂} - vsub_rev_mem_vectorSpan_pair 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
(k : Type u_1) {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] (p₁ p₂ : P) : p₂ -ᵥ p₁ ∈ vectorSpan k {p₁, p₂} - vsub_mem_vectorSpan 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
(k : Type u_1) {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {s : Set P} {p₁ p₂ : P} (hp₁ : p₁ ∈ s) (hp₂ : p₂ ∈ s) : p₁ -ᵥ p₂ ∈ vectorSpan k s - vsub_mem_vectorSpan_of_mem_spanPoints_of_mem_spanPoints 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
(k : Type u_1) {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {s : Set P} {p₁ p₂ : P} (hp₁ : p₁ ∈ spanPoints k s) (hp₂ : p₂ ∈ spanPoints k s) : p₁ -ᵥ p₂ ∈ vectorSpan k s - AffineSubspace.mem_mk' 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {p q : P} {direction : Submodule k V} : q ∈ AffineSubspace.mk' p direction ↔ q -ᵥ p ∈ direction - AffineSubspace.coe_direction_eq_vsub_set_left 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {s : AffineSubspace k P} {p : P} (hp : p ∈ s) : ↑s.direction = (fun x => p -ᵥ x) '' ↑s - AffineSubspace.coe_direction_eq_vsub_set_right 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {s : AffineSubspace k P} {p : P} (hp : p ∈ s) : ↑s.direction = (fun x => x -ᵥ p) '' ↑s - AffineSubspace.coe_direction_eq_vsub_set 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {s : AffineSubspace k P} (h : (↑s).Nonempty) : ↑s.direction = ↑s -ᵥ ↑s - AffineSubspace.vsub_mem_direction 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {s : AffineSubspace k P} {p₁ p₂ : P} (hp₁ : p₁ ∈ s) (hp₂ : p₂ ∈ s) : p₁ -ᵥ p₂ ∈ s.direction - smul_vsub_mem_vectorSpan_pair 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] (r : k) (p₁ p₂ : P) : r • (p₁ -ᵥ p₂) ∈ vectorSpan k {p₁, p₂} - smul_vsub_rev_mem_vectorSpan_pair 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] (r : k) (p₁ p₂ : P) : r • (p₂ -ᵥ p₁) ∈ vectorSpan k {p₁, p₂} - AffineSubspace.mem_direction_iff_eq_vsub_left 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {s : AffineSubspace k P} {p : P} (hp : p ∈ s) (v : V) : v ∈ s.direction ↔ ∃ p₂ ∈ s, v = p -ᵥ p₂ - AffineSubspace.mem_direction_iff_eq_vsub_right 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {s : AffineSubspace k P} {p : P} (hp : p ∈ s) (v : V) : v ∈ s.direction ↔ ∃ p₂ ∈ s, v = p₂ -ᵥ p - vsub_mem_vectorSpan_of_mem_affineSpan_of_mem_affineSpan 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {s : Set P} {p₁ p₂ : P} (hp₁ : p₁ ∈ affineSpan k s) (hp₂ : p₂ ∈ affineSpan k s) : p₁ -ᵥ p₂ ∈ vectorSpan k s - AffineSubspace.mk 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] (carrier : Set P) (smul_vsub_vadd_mem' : ∀ (c : k) {p₁ p₂ p₃ : P}, p₁ ∈ carrier → p₂ ∈ carrier → p₃ ∈ carrier → c • (p₁ -ᵥ p₂) +ᵥ p₃ ∈ carrier) : AffineSubspace k P - AffineSubspace.mem_direction_iff_eq_vsub 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {s : AffineSubspace k P} (h : (↑s).Nonempty) (v : V) : v ∈ s.direction ↔ ∃ p₁ ∈ s, ∃ p₂ ∈ s, v = p₁ -ᵥ p₂ - AffineSubspace.vsub_self_of_zero_mem 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} [Ring k] [AddCommGroup V] [Module k V] {s : AffineSubspace k V} (hs : 0 ∈ s) : ↑s -ᵥ ↑s = ↑s - affineSpan_induction 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {x : P} {s : Set P} {p : P → Prop} (h : x ∈ affineSpan k s) (mem : ∀ x ∈ s, p x) (smul_vsub_vadd : ∀ (c : k) (u v w : P), p u → p v → p w → p (c • (u -ᵥ v) +ᵥ w)) : p x - AffineSubspace.smul_vsub_vadd_mem' 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} {P : Type u_3} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] (self : AffineSubspace k P) (c : k) {p₁ p₂ p₃ : P} : p₁ ∈ self.carrier → p₂ ∈ self.carrier → p₃ ∈ self.carrier → c • (p₁ -ᵥ p₂) +ᵥ p₃ ∈ self.carrier - AffineSubspace.vsub_self_eq_iff_zero_mem 📋 Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs
{k : Type u_1} {V : Type u_2} [Ring k] [AddCommGroup V] [Module k V] {s : AffineSubspace k V} [Nonempty ↥s] : ↑s -ᵥ ↑s = ↑s ↔ 0 ∈ s
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:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.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 ?aIf 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 ?bBy 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 findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.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