Loogle!
Result
Found 195 declarations mentioning Set.neg.
- Set.neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [Neg Ξ±] : Neg (Set Ξ±) - Set.neg_univ π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [Neg Ξ±] : -Set.univ = Set.univ - Set.Nonempty.neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {s : Set Ξ±} (h : s.Nonempty) : (-s).Nonempty - Set.nonempty_neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {s : Set Ξ±} : (-s).Nonempty β s.Nonempty - Set.neg_empty π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [Neg Ξ±] : -β = β - Set.neg_preimage π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [Neg Ξ±] {s : Set Ξ±} : Neg.neg β»ΒΉ' s = -s - Set.neg_ofPred π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [Neg Ξ±] (p : Ξ± β Prop) : -{x | p x} = {x | p (-x)} - Set.neg_setOf π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [Neg Ξ±] (p : Ξ± β Prop) : -{x | p x} = {x | p (-x)} - Set.image_neg_eq_neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {s : Set Ξ±} : (fun x => -x) '' s = -s - Set.compl_neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [Neg Ξ±] {s : Set Ξ±} : -sαΆ = (-s)αΆ - Set.mem_neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [Neg Ξ±] {s : Set Ξ±} {a : Ξ±} : a β -s β -a β s - Set.neg_eq_empty π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {s : Set Ξ±} : -s = β β s = β - Set.neg_range π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {ΞΉ : Sort u_4} {f : ΞΉ β Ξ±} : -Set.range f = Set.range fun i => -f i - Set.neg_eq_self_iff_neg_subset π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {s : Set Ξ±} : -s = s β -s β s - Set.neg_singleton π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] (a : Ξ±) : -{a} = {-a} - Set.neg_mem_neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {s : Set Ξ±} {a : Ξ±} : -a β -s β a β s - Set.neg_range' π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {ΞΉ : Type u_4} {f : ΞΉ β Ξ±} : -Set.range f = Set.range (-f) - Set.neg_subset π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {s t : Set Ξ±} : -s β t β s β -t - Set.neg_subset_neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {s t : Set Ξ±} : -s β -t β s β t - Set.MapsTo.neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} {Ξ² : Type u_3} [InvolutiveNeg Ξ²] {A : Set Ξ±} {B : Set Ξ²} {f : Ξ± β Ξ²} (h : Set.MapsTo f A B) : Set.MapsTo (-f) A (-B) - Set.inter_neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [Neg Ξ±] {s t : Set Ξ±} : -(s β© t) = -s β© -t - Set.union_neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [Neg Ξ±] {s t : Set Ξ±} : -(s βͺ t) = -s βͺ -t - Set.image_op_neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {s : Set Ξ±} : AddOpposite.op '' (-s) = -AddOpposite.op '' s - Set.neg_insert π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] (a : Ξ±) (s : Set Ξ±) : -insert a s = insert (-a) (-s) - Set.image_neg_of_apply_neg_eq π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} {Ξ² : Type u_3} [InvolutiveNeg Ξ±] {s : Set Ξ±} {f g : Ξ± β Ξ²} (H : β x β s, f (-x) = g x) : f '' (-s) = g '' s - Set.neg_pi π Mathlib.Algebra.Group.Pointwise.Set.Basic
{ΞΉ : Type u_4} {Ξ± : ΞΉ β Type u_5} [(i : ΞΉ) β Neg (Ξ± i)] (s : Set ΞΉ) (t : (i : ΞΉ) β Set (Ξ± i)) : -s.pi t = s.pi fun i => -t i - Set.neg_subset_sub_right π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [SubtractionMonoid Ξ±] {s t : Set Ξ±} (hs : 0 β s) : -t β s - t - Set.image_neg_of_apply_neg_eq_neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} {Ξ² : Type u_3} [InvolutiveNeg Ξ±] {s : Set Ξ±} [InvolutiveNeg Ξ²] {f g : Ξ± β Ξ²} (H : β x β s, f (-x) = -g x) : f '' (-s) = -g '' s - Set.neg_prod π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} {Ξ² : Type u_3} [Neg Ξ±] [Neg Ξ²] (s : Set Ξ±) (t : Set Ξ²) : -s ΓΛ’ t = (-s) ΓΛ’ (-t) - Set.image_neg π Mathlib.Algebra.Group.Pointwise.Set.Basic
{F : Type u_1} {Ξ± : Type u_2} {Ξ² : Type u_3} [AddGroup Ξ±] [SubtractionMonoid Ξ²] [FunLike F Ξ± Ξ²] [AddMonoidHomClass F Ξ± Ξ²] (f : F) (s : Set Ξ±) : βf '' (-s) = -βf '' s - Set.zero_mem_neg_add_iff π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [AddGroup Ξ±] {s t : Set Ξ±} : 0 β -t + s β Β¬Disjoint s t - Set.zero_notMem_neg_add_iff π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [AddGroup Ξ±] {s t : Set Ξ±} : 0 β -t + s β Disjoint s t - Set.nonempty_image_addLeft_neg_inter_iff π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [SubtractionMonoid Ξ±] {s t : Set Ξ±} {a : Ξ±} : ((fun x => -a + x) '' s β© t).Nonempty β ((fun x => x + a) '' (-s) β© -t).Nonempty - Set.nonempty_image_addRight_neg_inter_iff π Mathlib.Algebra.Group.Pointwise.Set.Basic
{Ξ± : Type u_2} [SubtractionMonoid Ξ±] {s t : Set Ξ±} {a : Ξ±} : ((fun x => x + -a) '' s β© t).Nonempty β ((fun x => a + x) '' (-s) β© -t).Nonempty - Set.Finite.neg π Mathlib.Algebra.Group.Pointwise.Set.Finite
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} : s.Finite β (-s).Finite - Set.Finite.of_neg π Mathlib.Algebra.Group.Pointwise.Set.Finite
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} : (-s).Finite β s.Finite - Set.finite_neg π Mathlib.Algebra.Group.Pointwise.Set.Finite
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} : (-s).Finite β s.Finite - Set.infinite_neg π Mathlib.Algebra.Group.Pointwise.Set.Finite
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} : (-s).Infinite β s.Infinite - Set.iInter_neg π Mathlib.Algebra.Group.Pointwise.Set.Lattice
{Ξ± : Type u_1} {ΞΉ : Sort u_3} [Neg Ξ±] (s : ΞΉ β Set Ξ±) : -β i, s i = β i, -s i - Set.iUnion_neg π Mathlib.Algebra.Group.Pointwise.Set.Lattice
{Ξ± : Type u_1} {ΞΉ : Sort u_3} [Neg Ξ±] (s : ΞΉ β Set Ξ±) : -β i, s i = β i, -s i - Set.sInter_neg π Mathlib.Algebra.Group.Pointwise.Set.Lattice
{Ξ± : Type u_1} [Neg Ξ±] (S : Set (Set Ξ±)) : -ββ S = β s β S, -s - Set.sUnion_neg π Mathlib.Algebra.Group.Pointwise.Set.Lattice
{Ξ± : Type u_1} [Neg Ξ±] (S : Set (Set Ξ±)) : -ββ S = β s β S, -s - IsSelfNeg.univ π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] : IsSelfNeg Set.univ - IsSelfNeg.empty π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] : IsSelfNeg β - IsSelfNeg.compl π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] {s : Set Ξ±} : IsSelfNeg s β IsSelfNeg sαΆ - IsSelfNeg.of_compl π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] {s : Set Ξ±} : IsSelfNeg sαΆ β IsSelfNeg s - isSelfNeg_compl_iff π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] {s : Set Ξ±} : IsSelfNeg sαΆ β IsSelfNeg s - isSelfNeg_singleton_iff π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {a : Ξ±} : IsSelfNeg {a} β IsSelfNeg a - IsSelfNeg.iInter π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] {ΞΉ : Sort u_3} {s : ΞΉ β Set Ξ±} (h : β (i : ΞΉ), IsSelfNeg (s i)) : IsSelfNeg (β i, s i) - IsSelfNeg.iUnion π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] {ΞΉ : Sort u_3} {s : ΞΉ β Set Ξ±} (h : β (i : ΞΉ), IsSelfNeg (s i)) : IsSelfNeg (β i, s i) - IsSelfNeg.neg_subset π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} : IsSelfNeg s β -s β s - IsSelfNeg.of_neg_subset π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} : -s β s β IsSelfNeg s - IsSelfNeg.of_subset_neg π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} : s β -s β IsSelfNeg s - IsSelfNeg.subset_neg π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} : IsSelfNeg s β s β -s - isSelfNeg_iff_neg_subset π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} : IsSelfNeg s β -s β s - isSelfNeg_iff_subset_neg π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} : IsSelfNeg s β s β -s - isSelfNeg_iff_forall_neg_mem_iff π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] {s : Set Ξ±} : IsSelfNeg s β β (x : Ξ±), -x β s β x β s - IsSelfNeg.inter π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] {s t : Set Ξ±} (hs : IsSelfNeg s) (ht : IsSelfNeg t) : IsSelfNeg (s β© t) - IsSelfNeg.union π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] {s t : Set Ξ±} (hs : IsSelfNeg s) (ht : IsSelfNeg t) : IsSelfNeg (s βͺ t) - IsSelfNeg.sInter π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] {S : Set (Set Ξ±)} (h : β s β S, IsSelfNeg s) : IsSelfNeg (ββ S) - IsSelfNeg.sUnion π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [Neg Ξ±] {S : Set (Set Ξ±)} (h : β s β S, IsSelfNeg s) : IsSelfNeg (ββ S) - IsSelfNeg.neg_mem π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} (h : IsSelfNeg s) {x : Ξ±} (hx : x β s) : -x β s - isSelfNeg_iff_forall_neg_mem π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s : Set Ξ±} : IsSelfNeg s β β β¦x : Ξ±β¦, x β s β -x β s - IsSelfNeg.diff π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} [InvolutiveNeg Ξ±] {s t : Set Ξ±} (hs : IsSelfNeg s) (ht : IsSelfNeg t) : IsSelfNeg (s \ t) - IsSelfNeg.sum π Mathlib.Algebra.Group.Pointwise.Set.SelfInv
{Ξ± : Type u_1} {Ξ² : Type u_2} [Neg Ξ±] [Neg Ξ²] {s : Set Ξ±} {t : Set Ξ²} (hs : IsSelfNeg s) (ht : IsSelfNeg t) : IsSelfNeg (s ΓΛ’ t) - Set.mem_vadd_set_neg π Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{Ξ± : Type u_2} [AddGroup Ξ±] {a b : Ξ±} {s : Set Ξ±} : a β b +α΅₯ -s β b β a +α΅₯ s - Set.neg_op_vadd_set_distrib π Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{Ξ± : Type u_2} [AddGroup Ξ±] (a : Ξ±) (s : Set Ξ±) : -(AddOpposite.op a +α΅₯ s) = -a +α΅₯ -s - Set.neg_vadd_set_distrib π Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{Ξ± : Type u_2} [AddGroup Ξ±] (a : Ξ±) (s : Set Ξ±) : -(a +α΅₯ s) = AddOpposite.op (-a) +α΅₯ -s - Set.exists_vadd_inter_vadd_subset_vadd_neg_add_inter_neg_add π Mathlib.Algebra.Group.Action.Pointwise.Set.Basic
{Ξ± : Type u_2} [AddGroup Ξ±] (s t : Set Ξ±) (a b : Ξ±) : β z, (a +α΅₯ s) β© (b +α΅₯ t) β z +α΅₯ (-s + s) β© (-t + t) - AddSubmonoid.closure_neg π Mathlib.Algebra.Group.Submonoid.Pointwise
{G : Type u_2} [AddGroup G] (s : Set G) : AddSubmonoid.closure (-s) = -AddSubmonoid.closure s - AddSubmonoid.coe_neg π Mathlib.Algebra.Group.Submonoid.Pointwise
{G : Type u_2} [AddGroup G] (S : AddSubmonoid G) : β(-S) = -βS - AddSubmonoid.mem_closure_neg π Mathlib.Algebra.Group.Submonoid.Pointwise
{G : Type u_2} [AddGroup G] (s : Set G) (x : G) : x β AddSubmonoid.closure (-s) β -x β AddSubmonoid.closure s - AddSubmonoid.coe_negOrderIso_apply π Mathlib.Algebra.Group.Submonoid.Pointwise
{G : Type u_2} [AddGroup G] (aβ : AddSubmonoid G) : β(AddSubmonoid.negOrderIso aβ) = -βaβ - AddSubmonoid.coe_negOrderIso_symm_apply π Mathlib.Algebra.Group.Submonoid.Pointwise
{G : Type u_2} [AddGroup G] (aβ : AddSubmonoid G) : β((RelIso.symm AddSubmonoid.negOrderIso) aβ) = -βaβ - IsSelfNeg.of_negMemClass π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} {S : Type u_4} [InvolutiveNeg G] [SetLike S G] [NegMemClass S G] (H : S) : IsSelfNeg βH - AddSubgroup.closure_neg π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] (s : Set G) : AddSubgroup.closure (-s) = AddSubgroup.closure s - neg_coe_set π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} {S : Type u_4} [InvolutiveNeg G] [SetLike S G] [NegMemClass S G] {H : S} : -βH = βH - AddSubgroup.neg_subset_closure π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] (S : Set G) : -S β β(AddSubgroup.closure S) - AddSubgroup.closure_toAddSubmonoid π Mathlib.Algebra.Group.Subgroup.Pointwise
{G : Type u_2} [AddGroup G] (S : Set G) : (AddSubgroup.closure S).toAddSubmonoid = AddSubmonoid.closure (S βͺ -S) - Submodule.coe_set_neg π Mathlib.Algebra.Module.Submodule.Pointwise
{R : Type u_2} {M : Type u_3} [Semiring R] [AddCommGroup M] [Module R M] (S : Submodule R M) : β(-S) = -βS - Submodule.span_neg π Mathlib.LinearAlgebra.Span.Basic
{R : Type u_10} {M : Type u_11} [Ring R] [AddCommGroup M] [Module R M] (s : Set M) : Submodule.span R (-s) = Submodule.span R s - Submodule.span_neg_eq_neg π Mathlib.LinearAlgebra.Span.Basic
{R : Type u_8} {M : Type u_9} [Semiring R] [AddCommGroup M] [Module R M] (s : Set M) : Submodule.span R (-s) = -Submodule.span R s - Finset.coe_neg π Mathlib.Algebra.Group.Pointwise.Finset.Basic
{Ξ± : Type u_2} [DecidableEq Ξ±] [InvolutiveNeg Ξ±] (s : Finset Ξ±) : β(-s) = -βs - resolventSet_neg π Mathlib.Algebra.Algebra.Spectrum.Basic
{R : Type u} {A : Type v} [CommRing R] [Ring A] [Algebra R A] (a : A) : resolventSet R (-a) = -resolventSet R a - spectrum.neg_eq π Mathlib.Algebra.Algebra.Spectrum.Basic
{R : Type u} {A : Type v} [CommRing R] [Ring A] [Algebra R A] (a : A) : -spectrum R a = spectrum R (-a) - Filter.neg_mem_neg π Mathlib.Order.Filter.Pointwise
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {f : Filter Ξ±} {s : Set Ξ±} (hs : s β f) : -s β -f - Filter.HasBasis.neg π Mathlib.Order.Filter.Pointwise
{Ξ± : Type u_2} [InvolutiveNeg Ξ±] {f : Filter Ξ±} {ΞΉ : Sort u_5} {p : ΞΉ β Prop} {s : ΞΉ β Set Ξ±} (h : f.HasBasis p s) : (-f).HasBasis p fun i => -s i - IsClosed.neg π Mathlib.Topology.Algebra.Group.ContinuousInv
{G : Type u_1} [TopologicalSpace G] [InvolutiveNeg G] [ContinuousNeg G] {s : Set G} (hs : IsClosed s) : IsClosed (-s) - IsCompact.neg π Mathlib.Topology.Algebra.Group.ContinuousInv
{G : Type u_1} [TopologicalSpace G] [InvolutiveNeg G] [ContinuousNeg G] {s : Set G} (hs : IsCompact s) : IsCompact (-s) - IsOpen.neg π Mathlib.Topology.Algebra.Group.ContinuousInv
{G : Type u_1} [TopologicalSpace G] [InvolutiveNeg G] [ContinuousNeg G] {s : Set G} (hs : IsOpen s) : IsOpen (-s) - neg_closure π Mathlib.Topology.Algebra.Group.ContinuousInv
{G : Type u_1} [TopologicalSpace G] [InvolutiveNeg G] [ContinuousNeg G] (s : Set G) : -closure s = closure (-s) - neg_mem_nhds_zero π Mathlib.Topology.Algebra.Group.Basic
(G : Type u_1) [TopologicalSpace G] [AddGroup G] [IsTopologicalAddGroup G] {S : Set G} (hS : S β nhds 0) : -S β nhds 0 - Filter.HasBasis.nhds_zero_neg π Mathlib.Topology.Algebra.Group.Neighborhood
{G : Type u_1} [TopologicalSpace G] [AddGroup G] [IsTopologicalAddGroup G] {ΞΉ : Sort u_2} {p : ΞΉ β Prop} {U : ΞΉ β Set G} (hU : (nhds 0).HasBasis p U) : (nhds 0).HasBasis p fun i => -U i - exists_closed_nhds_zero_neg_eq_add_subset π Mathlib.Topology.Algebra.Group.Pointwise
{G : Type w} [TopologicalSpace G] [AddGroup G] [IsTopologicalAddGroup G] {U : Set G} (hU : U β nhds 0) : β V β nhds 0, IsClosed V β§ -V = V β§ V + V β U - IsDiscrete.exists_nhds_eq_zero_of_image_addLeft_inter_nonempty π Mathlib.Topology.Algebra.Group.Pointwise
{G : Type w} [TopologicalSpace G] [AddGroup G] [IsTopologicalAddGroup G] (S : AddSubgroup G) (hS : IsDiscrete βS) : β U β nhds 0, -U = U β§ β g β S, ((fun x => g + x) '' U β© U).Nonempty β g = 0 - IsDiscrete.exists_nhds_eq_zero_of_image_addRight_inter_nonempty π Mathlib.Topology.Algebra.Group.Pointwise
{G : Type w} [TopologicalSpace G] [AddGroup G] [IsTopologicalAddGroup G] (S : AddSubgroup G) (hS : IsDiscrete βS) : β U β nhds 0, -U = U β§ β g β S, ((fun x => x + g) '' U β© U).Nonempty β g = 0 - TotallyBounded.neg π Mathlib.Topology.Algebra.IsUniformGroup.Basic
{Ξ± : Type u_1} [UniformSpace Ξ±] [AddGroup Ξ±] [IsUniformAddGroup Ξ±] {s : Set Ξ±} (hs : TotallyBounded s) : TotallyBounded (-s) - totallyBounded_neg π Mathlib.Topology.Algebra.IsUniformGroup.Basic
{Ξ± : Type u_1} [UniformSpace Ξ±] [AddGroup Ξ±] [IsUniformAddGroup Ξ±] {s : Set Ξ±} : TotallyBounded (-s) β TotallyBounded s - Set.neg_Ici π Mathlib.Algebra.Order.Group.Pointwise.Interval
{Ξ± : Type u_1} [AddCommGroup Ξ±] [PartialOrder Ξ±] [IsOrderedAddMonoid Ξ±] (a : Ξ±) : -Set.Ici a = Set.Iic (-a) - Set.neg_Iic π Mathlib.Algebra.Order.Group.Pointwise.Interval
{Ξ± : Type u_1} [AddCommGroup Ξ±] [PartialOrder Ξ±] [IsOrderedAddMonoid Ξ±] (a : Ξ±) : -Set.Iic a = Set.Ici (-a) - Set.neg_Iio π Mathlib.Algebra.Order.Group.Pointwise.Interval
{Ξ± : Type u_1} [AddCommGroup Ξ±] [PartialOrder Ξ±] [IsOrderedAddMonoid Ξ±] (a : Ξ±) : -Set.Iio a = Set.Ioi (-a) - Set.neg_Ioi π Mathlib.Algebra.Order.Group.Pointwise.Interval
{Ξ± : Type u_1} [AddCommGroup Ξ±] [PartialOrder Ξ±] [IsOrderedAddMonoid Ξ±] (a : Ξ±) : -Set.Ioi a = Set.Iio (-a) - Set.neg_Icc π Mathlib.Algebra.Order.Group.Pointwise.Interval
{Ξ± : Type u_1} [AddCommGroup Ξ±] [PartialOrder Ξ±] [IsOrderedAddMonoid Ξ±] (a b : Ξ±) : -Set.Icc a b = Set.Icc (-b) (-a) - Set.neg_Ico π Mathlib.Algebra.Order.Group.Pointwise.Interval
{Ξ± : Type u_1} [AddCommGroup Ξ±] [PartialOrder Ξ±] [IsOrderedAddMonoid Ξ±] (a b : Ξ±) : -Set.Ico a b = Set.Ioc (-b) (-a) - Set.neg_Ioc π Mathlib.Algebra.Order.Group.Pointwise.Interval
{Ξ± : Type u_1} [AddCommGroup Ξ±] [PartialOrder Ξ±] [IsOrderedAddMonoid Ξ±] (a b : Ξ±) : -Set.Ioc a b = Set.Ico (-b) (-a) - Set.neg_Ioo π Mathlib.Algebra.Order.Group.Pointwise.Interval
{Ξ± : Type u_1} [AddCommGroup Ξ±] [PartialOrder Ξ±] [IsOrderedAddMonoid Ξ±] (a b : Ξ±) : -Set.Ioo a b = Set.Ioo (-b) (-a) - Set.neg_uIcc π Mathlib.Algebra.Order.Group.Pointwise.Interval
{Ξ± : Type u_1} [AddCommGroup Ξ±] [LinearOrder Ξ±] [IsOrderedAddMonoid Ξ±] (a b : Ξ±) : -Set.uIcc a b = Set.uIcc (-a) (-b) - Set.smul_set_neg π Mathlib.Algebra.Ring.Action.Pointwise.Set
{Ξ± : Type u_1} {Ξ² : Type u_2} [AddGroup Ξ²] [DistribSMul Ξ± Ξ²] (a : Ξ±) (t : Set Ξ²) : a β’ -t = -(a β’ t) - Set.smul_neg π Mathlib.Algebra.Ring.Action.Pointwise.Set
{Ξ± : Type u_1} {Ξ² : Type u_2} [AddGroup Ξ²] [DistribSMul Ξ± Ξ²] (s : Set Ξ±) (t : Set Ξ²) : s β’ -t = -(s β’ t) - Set.neg_smul_set π Mathlib.Algebra.Ring.Action.Pointwise.Set
{Ξ± : Type u_1} {Ξ² : Type u_2} [Ring Ξ±] [AddCommGroup Ξ²] [Module Ξ± Ξ²] (a : Ξ±) (t : Set Ξ²) : -a β’ t = -(a β’ t) - Set.neg_smul π Mathlib.Algebra.Ring.Action.Pointwise.Set
{Ξ± : Type u_1} {Ξ² : Type u_2} [Ring Ξ±] [AddCommGroup Ξ²] [Module Ξ± Ξ²] (s : Set Ξ±) (t : Set Ξ²) : -s β’ t = -(s β’ t) - Set.encard_neg π Mathlib.Algebra.Group.Pointwise.Set.Card
{G : Type u_1} [InvolutiveNeg G] (s : Set G) : (-s).encard = s.encard - Set.ncard_neg π Mathlib.Algebra.Group.Pointwise.Set.Card
{G : Type u_1} [InvolutiveNeg G] (s : Set G) : (-s).ncard = s.ncard - Cardinal.mk_neg π Mathlib.Algebra.Group.Pointwise.Set.Card
{G : Type u_1} [InvolutiveNeg G] (s : Set G) : Cardinal.mk β(-s) = Cardinal.mk βs - Set.natCard_neg π Mathlib.Algebra.Group.Pointwise.Set.Card
{G : Type u_1} [InvolutiveNeg G] (s : Set G) : Nat.card β(-s) = Nat.card βs - small_neg π Mathlib.Algebra.Group.Pointwise.Set.Small
{Ξ± : Type u_1} (s : Set Ξ±) [InvolutiveNeg Ξ±] [Small.{u, u_1} βs] : Small.{u, u_1} β(-s) - AddSubmonoid.coe_support π Mathlib.Algebra.Group.Submonoid.Support
{G : Type u_1} [AddGroup G] (M : AddSubmonoid G) : βM.support = βM β© -βM - BddAbove.neg π Mathlib.Algebra.Order.Group.Pointwise.Bounds
{G : Type u_2} [AddGroup G] [Preorder G] [AddLeftMono G] [AddRightMono G] {s : Set G} (h : BddAbove s) : BddBelow (-s) - BddBelow.neg π Mathlib.Algebra.Order.Group.Pointwise.Bounds
{G : Type u_2} [AddGroup G] [Preorder G] [AddLeftMono G] [AddRightMono G] {s : Set G} (h : BddBelow s) : BddAbove (-s) - bddAbove_neg π Mathlib.Algebra.Order.Group.Pointwise.Bounds
{G : Type u_2} [AddGroup G] [Preorder G] [AddLeftMono G] [AddRightMono G] {s : Set G} : BddAbove (-s) β BddBelow s - bddBelow_neg π Mathlib.Algebra.Order.Group.Pointwise.Bounds
{G : Type u_2} [AddGroup G] [Preorder G] [AddLeftMono G] [AddRightMono G] {s : Set G} : BddBelow (-s) β BddAbove s - IsGLB.neg π Mathlib.Algebra.Order.Group.Pointwise.Bounds
{G : Type u_2} [AddGroup G] [Preorder G] [AddLeftMono G] [AddRightMono G] {s : Set G} {a : G} (h : IsGLB s a) : IsLUB (-s) (-a) - IsLUB.neg π Mathlib.Algebra.Order.Group.Pointwise.Bounds
{G : Type u_2} [AddGroup G] [Preorder G] [AddLeftMono G] [AddRightMono G] {s : Set G} {a : G} (h : IsLUB s a) : IsGLB (-s) (-a) - isGLB_neg π Mathlib.Algebra.Order.Group.Pointwise.Bounds
{G : Type u_2} [AddGroup G] [Preorder G] [AddLeftMono G] [AddRightMono G] {s : Set G} {a : G} : IsGLB (-s) a β IsLUB s (-a) - isGLB_neg' π Mathlib.Algebra.Order.Group.Pointwise.Bounds
{G : Type u_2} [AddGroup G] [Preorder G] [AddLeftMono G] [AddRightMono G] {s : Set G} {a : G} : IsGLB (-s) (-a) β IsLUB s a - isLUB_neg π Mathlib.Algebra.Order.Group.Pointwise.Bounds
{G : Type u_2} [AddGroup G] [Preorder G] [AddLeftMono G] [AddRightMono G] {s : Set G} {a : G} : IsLUB (-s) a β IsGLB s (-a) - isLUB_neg' π Mathlib.Algebra.Order.Group.Pointwise.Bounds
{G : Type u_2} [AddGroup G] [Preorder G] [AddLeftMono G] [AddRightMono G] {s : Set G} {a : G} : IsLUB (-s) (-a) β IsGLB s a - sInf_neg π Mathlib.Algebra.Order.Group.Pointwise.CompleteLattice
{M : Type u_1} [CompleteLattice M] [AddGroup M] [AddLeftMono M] [AddRightMono M] (s : Set M) : sInf (-s) = -sSup s - sSup_neg π Mathlib.Algebra.Order.Group.Pointwise.CompleteLattice
{M : Type u_1} [CompleteLattice M] [AddGroup M] [AddLeftMono M] [AddRightMono M] (s : Set M) : sSup (-s) = -sInf s - csInf_neg π Mathlib.Algebra.Order.Group.Pointwise.CompleteLattice
{M : Type u_1} [ConditionallyCompleteLattice M] [AddGroup M] [AddLeftMono M] [AddRightMono M] {s : Set M} (hsβ : s.Nonempty) (hsβ : BddAbove s) : sInf (-s) = -sSup s - csSup_neg π Mathlib.Algebra.Order.Group.Pointwise.CompleteLattice
{M : Type u_1} [ConditionallyCompleteLattice M] [AddGroup M] [AddLeftMono M] [AddRightMono M] {s : Set M} (hsβ : s.Nonempty) (hsβ : BddBelow s) : sSup (-s) = -sInf s - Real.sInf_def π Mathlib.Algebra.Order.Archimedean.Real.Basic
(s : Set β) : sInf s = -sSup (-s) - Real.sInf_neg π Mathlib.Algebra.Order.Archimedean.Real.Basic
(s : Set β) : sInf (-s) = -sSup s - Real.sSup_neg π Mathlib.Algebra.Order.Archimedean.Real.Basic
(s : Set β) : sSup (-s) = -sInf s - MeasurableSet.neg π Mathlib.MeasureTheory.Group.Arithmetic
{G : Type u_2} [Neg G] [MeasurableSpace G] [MeasurableNeg G] {s : Set G} (hs : MeasurableSet s) : MeasurableSet (-s) - MeasureTheory.Measure.neg_apply π Mathlib.MeasureTheory.Group.Measure
{G : Type u_1} [MeasurableSpace G] [InvolutiveNeg G] [MeasurableNeg G] (ΞΌ : MeasureTheory.Measure G) (s : Set G) : ΞΌ.neg s = ΞΌ (-s) - MeasureTheory.Measure.measure_neg π Mathlib.MeasureTheory.Group.Measure
{G : Type u_1} [MeasurableSpace G] [InvolutiveNeg G] [MeasurableNeg G] (ΞΌ : MeasureTheory.Measure G) [ΞΌ.IsNegInvariant] (A : Set G) : ΞΌ (-A) = ΞΌ A - MeasureTheory.eventuallyConst_neg_set_ae π Mathlib.MeasureTheory.Group.Prod
{G : Type u_1} [MeasurableSpace G] [AddGroup G] [MeasurableAddβ G] (ΞΌ : MeasureTheory.Measure G) [MeasureTheory.SFinite ΞΌ] {s : Set G} [MeasurableNeg G] [ΞΌ.IsAddLeftInvariant] : Filter.EventuallyConst (-s) (MeasureTheory.ae ΞΌ) β Filter.EventuallyConst s (MeasureTheory.ae ΞΌ) - MeasureTheory.measure_neg_null π Mathlib.MeasureTheory.Group.Prod
{G : Type u_1} [MeasurableSpace G] [AddGroup G] [MeasurableAddβ G] (ΞΌ : MeasureTheory.Measure G) [MeasureTheory.SFinite ΞΌ] {s : Set G} [MeasurableNeg G] [ΞΌ.IsAddLeftInvariant] : ΞΌ (-s) = 0 β ΞΌ s = 0 - Bornology.IsBounded.neg π Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddGroup E] {s : Set E} : Bornology.IsBounded s β Bornology.IsBounded (-s) - neg_ball π Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddCommGroup E] (Ξ΄ : β) (x : E) : -Metric.ball x Ξ΄ = Metric.ball (-x) Ξ΄ - neg_closedBall π Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddCommGroup E] (Ξ΄ : β) (x : E) : -Metric.closedBall x Ξ΄ = Metric.closedBall (-x) Ξ΄ - neg_sphere π Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddCommGroup E] (Ξ΄ : β) (x : E) : -Metric.sphere x Ξ΄ = Metric.sphere (-x) Ξ΄ - infEDist_neg π Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddCommGroup E] (x : E) (s : Set E) : Metric.infEDist (-x) s = Metric.infEDist x (-s) - infEDist_neg_neg π Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddCommGroup E] (x : E) (s : Set E) : Metric.infEDist (-x) (-s) = Metric.infEDist x s - neg_cthickening π Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddCommGroup E] (Ξ΄ : β) (s : Set E) : -Metric.cthickening Ξ΄ s = Metric.cthickening Ξ΄ (-s) - neg_thickening π Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddCommGroup E] (Ξ΄ : β) (s : Set E) : -Metric.thickening Ξ΄ s = Metric.thickening Ξ΄ (-s) - ball_sub_zero π Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddCommGroup E] (Ξ΄ : β) (s : Set E) : Metric.ball 0 Ξ΄ - s = Metric.thickening Ξ΄ (-s) - ball_sub π Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddCommGroup E] (Ξ΄ : β) (s : Set E) (x : E) : Metric.ball x Ξ΄ - s = x +α΅₯ Metric.thickening Ξ΄ (-s) - IsCompact.closedBall_zero_sub π Mathlib.Analysis.Normed.Group.Pointwise
{E : Type u_1} [SeminormedAddCommGroup E] {Ξ΄ : β} {s : Set E} (hs : IsCompact s) (hΞ΄ : 0 β€ Ξ΄) : Metric.closedBall 0 Ξ΄ - s = Metric.cthickening Ξ΄ (-s) - IsPathConnected.neg π Mathlib.Topology.Connected.PathConnected
{G : Type u_4} [InvolutiveNeg G] [TopologicalSpace G] [ContinuousNeg G] {s : Set G} (hs : IsPathConnected s) : IsPathConnected (-s) - JoinedIn.neg π Mathlib.Topology.Connected.PathConnected
{G : Type u_4} [InvolutiveNeg G] [TopologicalSpace G] [ContinuousNeg G] {s : Set G} {a b : G} (hs : JoinedIn s a b) : JoinedIn (-s) (-a) (-b) - StarConvex.neg π Mathlib.Analysis.Convex.Star
{π : Type u_1} {E : Type u_2} [Ring π] [PartialOrder π] [AddCommGroup E] [Module π E] {x : E} {s : Set E} (hs : StarConvex π x s) : StarConvex π (-x) (-s) - Convex.neg π Mathlib.Analysis.Convex.Basic
{π : Type u_1} {E : Type u_2} [Ring π] [PartialOrder π] [AddCommGroup E] [Module π E] {s : Set E} (hs : Convex π s) : Convex π (-s) - convexHull_neg π Mathlib.Analysis.Convex.Hull
{π : Type u_1} {E : Type u_2} [Ring π] [PartialOrder π] [AddCommGroup E] [Module π E] (s : Set E) : (convexHull π) (-s) = -(convexHull π) s - Absorbs.neg_neg π Mathlib.Topology.Bornology.Absorbs
{M : Type u_1} {E : Type u_2} [Monoid M] [AddGroup E] [DistribMulAction M E] [Bornology M] {s t : Set E} : Absorbs M s t β Absorbs M (-s) (-t) - Absorbs.of_neg_neg π Mathlib.Topology.Bornology.Absorbs
{M : Type u_1} {E : Type u_2} [Monoid M] [AddGroup E] [DistribMulAction M E] [Bornology M] {s t : Set E} : Absorbs M (-s) (-t) β Absorbs M s t - absorbs_neg_neg π Mathlib.Topology.Bornology.Absorbs
{M : Type u_1} {E : Type u_2} [Monoid M] [AddGroup E] [DistribMulAction M E] [Bornology M] {s t : Set E} : Absorbs M (-s) (-t) β Absorbs M s t - Balanced.neg_eq π Mathlib.Analysis.LocallyConvex.Basic
{π : Type u_1} {E : Type u_3} [SeminormedRing π] [AddCommGroup E] [Module π E] {s : Set E} [NormOneClass π] (h : Balanced π s) : -s = s - Balanced.neg π Mathlib.Analysis.LocallyConvex.Basic
{π : Type u_1} {E : Type u_3} [SeminormedRing π] [AddCommGroup E] [Module π E] {s : Set E} : Balanced π s β Balanced π (-s) - balanced_neg π Mathlib.Analysis.LocallyConvex.Basic
{π : Type u_1} {E : Type u_3} [SeminormedRing π] [AddCommGroup E] [Module π E] {s : Set E} : Balanced π (-s) β Balanced π s - Seminorm.neg_ball π Mathlib.Analysis.Normed.Module.Seminorm.Basic
{π : Type u_3} {E : Type u_7} [SeminormedRing π] [AddCommGroup E] [Module π E] (p : Seminorm π E) (r : β) (x : E) : -p.ball x r = p.ball (-x) r - Seminorm.neg_closedBall π Mathlib.Analysis.Normed.Module.Seminorm.Basic
{π : Type u_3} {E : Type u_7} [SeminormedRing π] [AddCommGroup E] [Module π E] (p : Seminorm π E) (r : β) (x : E) : -p.closedBall x r = p.closedBall (-x) r - Bornology.IsVonNBounded.neg π Mathlib.Analysis.LocallyConvex.Bounded
{π : Type u_1} {E : Type u_3} [SeminormedRing π] [AddGroup E] [TopologicalSpace E] [IsTopologicalAddGroup E] [DistribMulAction π E] {s : Set E} (hs : Bornology.IsVonNBounded π s) : Bornology.IsVonNBounded π (-s) - Bornology.IsVonNBounded.of_neg π Mathlib.Analysis.LocallyConvex.Bounded
{π : Type u_1} {E : Type u_3} [SeminormedRing π] [AddGroup E] [TopologicalSpace E] [IsTopologicalAddGroup E] [DistribMulAction π E] {s : Set E} : Bornology.IsVonNBounded π (-s) β Bornology.IsVonNBounded π s - Bornology.isVonNBounded_neg π Mathlib.Analysis.LocallyConvex.Bounded
{π : Type u_1} {E : Type u_3} [SeminormedRing π] [AddGroup E] [TopologicalSpace E] [IsTopologicalAddGroup E] [DistribMulAction π E] {s : Set E} : Bornology.IsVonNBounded π (-s) β Bornology.IsVonNBounded π s - StrictConvex.neg π Mathlib.Analysis.Convex.Strict
{π : Type u_1} {E : Type u_3} [Ring π] [PartialOrder π] [TopologicalSpace E] [AddCommGroup E] [Module π E] {s : Set E} [IsTopologicalAddGroup E] (hs : StrictConvex π s) : StrictConvex π (-s) - Convexity.IsStarConvexSet.neg π Mathlib.Geometry.Convex.ConvexSpace.Module
{R : Type u_2} {M : Type u_3} [Semiring R] [PartialOrder R] [IsStrictOrderedRing R] [AddCommGroup M] [Module R M] [Convexity.ConvexSpace R M] [Convexity.IsModuleConvexSpace R M] {x : M} {s : Set M} (hs : Convexity.IsStarConvexSet R x s) : Convexity.IsStarConvexSet R (-x) (-s) - MeasureTheory.Measure.haar.addIndex_union_eq π Mathlib.MeasureTheory.Measure.Haar.Basic
{G : Type u_1} [AddGroup G] [TopologicalSpace G] [IsTopologicalAddGroup G] (Kβ Kβ : TopologicalSpace.Compacts G) {V : Set G} (hV : (interior V).Nonempty) (h : Disjoint (Kβ.carrier + -V) (Kβ.carrier + -V)) : MeasureTheory.Measure.haar.addIndex (Kβ.carrier βͺ Kβ.carrier) V = MeasureTheory.Measure.haar.addIndex Kβ.carrier V + MeasureTheory.Measure.haar.addIndex Kβ.carrier V - MeasureTheory.Measure.haar.addPrehaar_sup_eq π Mathlib.MeasureTheory.Measure.Haar.Basic
{G : Type u_1} [AddGroup G] [TopologicalSpace G] [IsTopologicalAddGroup G] {Kβ : TopologicalSpace.PositiveCompacts G} {U : Set G} {Kβ Kβ : TopologicalSpace.Compacts G} (hU : (interior U).Nonempty) (h : Disjoint (Kβ.carrier + -U) (Kβ.carrier + -U)) : MeasureTheory.Measure.haar.addPrehaar (βKβ) U (Kβ β Kβ) = MeasureTheory.Measure.haar.addPrehaar (βKβ) U Kβ + MeasureTheory.Measure.haar.addPrehaar (βKβ) U Kβ - IsLowerSet.neg π Mathlib.Algebra.Order.UpperLower
{Ξ± : Type u_2} [AddCommGroup Ξ±] [PartialOrder Ξ±] [IsOrderedAddMonoid Ξ±] {s : Set Ξ±} (hs : IsLowerSet s) : IsUpperSet (-s) - IsUpperSet.neg π Mathlib.Algebra.Order.UpperLower
{Ξ± : Type u_2} [AddCommGroup Ξ±] [PartialOrder Ξ±] [IsOrderedAddMonoid Ξ±] {s : Set Ξ±} (hs : IsUpperSet s) : IsLowerSet (-s) - IsTopologicalAddGroup.addNegClosureNhd.neg π Mathlib.Topology.Algebra.OpenSubgroup
{G : Type u_1} [TopologicalSpace G] {T W : Set G} [AddGroup G] (self : IsTopologicalAddGroup.addNegClosureNhd T W) : -T = T - IsTopologicalAddGroup.addNegClosureNhd.mk π Mathlib.Topology.Algebra.OpenSubgroup
{G : Type u_1} [TopologicalSpace G] {T W : Set G} [AddGroup G] (nhds : T β nhds 0) (neg : -T = T) (isOpen : IsOpen T) (add : W + T β W) : IsTopologicalAddGroup.addNegClosureNhd T W - fderivWithin_comp_neg π Mathlib.Analysis.Calculus.FDeriv.Equiv
{π : Type u_1} [NontriviallyNormedField π] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] {f : π β F} {s : Set π} {x : π} : fderivWithin π (fun a => f (-a)) s x = -fderivWithin π f (-s) (-x) - iteratedFDerivWithin_comp_neg π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {f : π β F} {s : Set π} (n : β) (a : π) : iteratedFDerivWithin π n (fun x => f (-x)) s a = (-1) ^ n β’ iteratedFDerivWithin π n f (-s) (-a) - iteratedFDerivWithin_comp_const_sub π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {f : π β F} {s : Set π} (n : β) (c : π) : iteratedFDerivWithin π n (fun z => f (c - z)) s = fun x => (-1) ^ n β’ iteratedFDerivWithin π n f (c +α΅₯ -s) (c - x) - PointedCone.salient_iff_inter_neg_eq_singleton π Mathlib.Geometry.Convex.Cone.Pointed
{R : Type u_1} {E : Type u_2} [Semiring R] [PartialOrder R] [IsOrderedRing R] [AddCommGroup E] [Module R E] (C : PointedCone R E) : (βC).Salient β βC β© -βC = {0} - PointedCone.coe_lineal π Mathlib.Geometry.Convex.Cone.Pointed
{R : Type u_1} {E : Type u_2} [Ring R] [LinearOrder R] [IsOrderedRing R] [AddCommGroup E] [Module R E] (C : PointedCone R E) : βC.lineal = βC β© -βC - gauge_neg_set_eq_gauge_neg π Mathlib.Analysis.Convex.Gauge
{E : Type u_2} [AddCommGroup E] [Module β E] {s : Set E} (x : E) : gauge (-s) x = gauge s (-x) - gauge_neg_set_neg π Mathlib.Analysis.Convex.Gauge
{E : Type u_2} [AddCommGroup E] [Module β E] {s : Set E} (x : E) : gauge (-s) (-x) = gauge s x - derivWithin_comp_neg π Mathlib.Analysis.Calculus.Deriv.Shift
{π : Type u_1} {F : Type u_2} [NontriviallyNormedField π] [NormedAddCommGroup F] [NormedSpace π F] (f : π β F) (s : Set π) (x : π) : derivWithin (fun x => f (-x)) s x = -derivWithin f (-s) (-x) - derivWithin_comp_const_sub π Mathlib.Analysis.Calculus.Deriv.Shift
{π : Type u_1} {F : Type u_2} [NontriviallyNormedField π] [NormedAddCommGroup F] [NormedSpace π F] (f : π β F) (a : π) (s : Set π) (x : π) : derivWithin (fun x => f (a - x)) s x = -derivWithin f (a +α΅₯ -s) (a - x) - iteratedDerivWithin_comp_neg π Mathlib.Analysis.Calculus.IteratedDeriv.Lemmas
{π : Type u_1} [NontriviallyNormedField π] {F : Type u_2} [NormedAddCommGroup F] [NormedSpace π F] {n : β} {s : Set π} {f : π β F} (a : π) : iteratedDerivWithin n (fun x => f (-x)) s a = (-1) ^ n β’ iteratedDerivWithin n f (-s) (-a) - iteratedDerivWithin_comp_const_sub π Mathlib.Analysis.Calculus.IteratedDeriv.Lemmas
{π : Type u_1} [NontriviallyNormedField π] {F : Type u_2} [NormedAddCommGroup F] [NormedSpace π F] {n : β} {s : Set π} {f : π β F} (c : π) : iteratedDerivWithin n (fun z => f (c - z)) s = fun x => (-1) ^ n β’ iteratedDerivWithin n f (c +α΅₯ -s) (c - x) - balancedHull_subset_convexHull_union_neg π Mathlib.Analysis.LocallyConvex.AbsConvex
{E : Type u_2} [AddCommGroup E] [Module β E] {s : Set E} : balancedHull β s β (convexHull β) (s βͺ -s) - convexHull_union_neg_eq_absConvexHull π Mathlib.Analysis.LocallyConvex.AbsConvex
{E : Type u_2} [AddCommGroup E] [Module β E] {s : Set E} : (convexHull β) (s βͺ -s) = (absConvexHull β) s - MeasureTheory.convolution_integrand_bound_right_of_le_of_subset π Mathlib.Analysis.Convolution
{π : Type uπ} {G : Type uG} {E : Type uE} {E' : Type uE'} {F : Type uF} [NormedAddCommGroup E] [NormedAddCommGroup E'] [NormedAddCommGroup F] {f : G β E} {g : G β E'} [NontriviallyNormedField π] [NormedSpace π E] [NormedSpace π E'] [NormedSpace π F] (L : E βL[π] E' βL[π] F) [AddGroup G] [TopologicalSpace G] {C : β} (hC : β (i : G), βg iβ β€ C) {x t : G} {s u : Set G} (hx : x β s) (hu : -tsupport g + s β u) : β(L (f t)) (g (x - t))β β€ u.indicator (fun t => βLβ * βf tβ * C) t - HasCompactSupport.convolution_integrand_bound_left π Mathlib.Analysis.Convolution
{π : Type uπ} {G : Type uG} {E : Type uE} {E' : Type uE'} {F : Type uF} [NormedAddCommGroup E] [NormedAddCommGroup E'] [NormedAddCommGroup F] {f : G β E} {g : G β E'} [NontriviallyNormedField π] [NormedSpace π E] [NormedSpace π E'] [NormedSpace π F] (L : E βL[π] E' βL[π] F) [AddGroup G] [TopologicalSpace G] (hcf : HasCompactSupport f) (hf : Continuous f) {x t : G} {s : Set G} (hx : x β s) : β(L (f (x - t))) (g t)β β€ (-tsupport f + s).indicator (fun t => (βLβ * β¨ i, βf iβ) * βg tβ) t - HasCompactSupport.convolution_integrand_bound_right π Mathlib.Analysis.Convolution
{π : Type uπ} {G : Type uG} {E : Type uE} {E' : Type uE'} {F : Type uF} [NormedAddCommGroup E] [NormedAddCommGroup E'] [NormedAddCommGroup F] {f : G β E} {g : G β E'} [NontriviallyNormedField π] [NormedSpace π E] [NormedSpace π E'] [NormedSpace π F] (L : E βL[π] E' βL[π] F) [AddGroup G] [TopologicalSpace G] (hcg : HasCompactSupport g) (hg : Continuous g) {x t : G} {s : Set G} (hx : x β s) : β(L (f t)) (g (x - t))β β€ (-tsupport g + s).indicator (fun t => βLβ * βf tβ * β¨ i, βg iβ) t - HasCompactSupport.convolution_integrand_bound_right_of_subset π Mathlib.Analysis.Convolution
{π : Type uπ} {G : Type uG} {E : Type uE} {E' : Type uE'} {F : Type uF} [NormedAddCommGroup E] [NormedAddCommGroup E'] [NormedAddCommGroup F] {f : G β E} {g : G β E'} [NontriviallyNormedField π] [NormedSpace π E] [NormedSpace π E'] [NormedSpace π F] (L : E βL[π] E' βL[π] F) [AddGroup G] [TopologicalSpace G] (hcg : HasCompactSupport g) (hg : Continuous g) {x t : G} {s u : Set G} (hx : x β s) (hu : -tsupport g + s β u) : β(L (f t)) (g (x - t))β β€ u.indicator (fun t => βLβ * βf tβ * β¨ i, βg iβ) t - PointedCone.dual_neg π Mathlib.Geometry.Convex.Cone.Dual
{R : Type u_1} [CommRing R] [PartialOrder R] [IsOrderedRing R] {M : Type u_2} [AddCommGroup M] [Module R M] {N : Type u_4} [AddCommGroup N] [Module R N] {p : M ββ[R] N ββ[R] R} {s : Set M} : PointedCone.dual p (-s) = -PointedCone.dual p s - IsAddFreimanHom.neg π Mathlib.Combinatorics.Additive.FreimanHom
{Ξ± : Type u_2} {Ξ² : Type u_3} [AddCommMonoid Ξ±] [SubtractionCommMonoid Ξ²] {A : Set Ξ±} {B : Set Ξ²} {f : Ξ± β Ξ²} {n : β} (hf : IsAddFreimanHom n A B f) : IsAddFreimanHom n A (-B) (-f) - IsApproximateAddSubgroup.neg_eq_self π Mathlib.Combinatorics.Additive.ApproximateSubgroup
{G : Type u_2} [AddGroup G] {K : β} {A : Set G} (self : IsApproximateAddSubgroup K A) : -A = A - IsApproximateAddSubgroup.mk π Mathlib.Combinatorics.Additive.ApproximateSubgroup
{G : Type u_2} [AddGroup G] {K : β} {A : Set G} (zero_mem : 0 β A) (neg_eq_self : -A = A) (two_nsmul_covByVAdd : CovByVAdd G K (2 β’ A) A) : IsApproximateAddSubgroup K A
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