Loogle!
Result
Found 123 declarations mentioning Set.toFinset.
- Set.toFinset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} (s : Set Ξ±) [Fintype βs] : Finset Ξ± - Set.Aesop.toFinset_nonempty_of_nonempty π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s : Set Ξ±} [Fintype βs] : s.Nonempty β s.toFinset.Nonempty - Set.toFinset_nonempty π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s : Set Ξ±} [Fintype βs] : s.toFinset.Nonempty β s.Nonempty - Set.toFinset_nontrivial π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s : Set Ξ±} [Fintype βs] : s.toFinset.Nontrivial β s.Nontrivial - Set.toFinset_univ π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} [Fintype Ξ±] [Fintype βSet.univ] : Set.univ.toFinset = Finset.univ - Set.coe_toFinset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} (s : Set Ξ±) [Fintype βs] : βs.toFinset = s - Set.toFinset_empty π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} [Fintype ββ ] : β .toFinset = β - Set.toFinset_eq_univ π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s : Set Ξ±} [Fintype Ξ±] [Fintype βs] : s.toFinset = Finset.univ β s = Set.univ - Finset.toFinset_coe π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} (s : Finset Ξ±) [Fintype ββs] : (βs).toFinset = s - Set.toFinset_congr π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s t : Set Ξ±} [Fintype βs] [Fintype βt] (h : s = t) : s.toFinset = t.toFinset - Set.toFinset_eq_empty π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s : Set Ξ±} [Fintype βs] : s.toFinset = β β s = β - Set.subsingleton_toFinset_iff π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s : Set Ξ±} [Fintype βs] : Subsingleton β₯s.toFinset β s.Subsingleton - Set.toFinset_inj π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s t : Set Ξ±} [Fintype βs] [Fintype βt] : s.toFinset = t.toFinset β s = t - Set.mem_toFinset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s : Set Ξ±} [Fintype βs] {a : Ξ±} : a β s.toFinset β a β s - Set.toFinset_singleton π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} (a : Ξ±) [Fintype β{a}] : {a}.toFinset = {a} - Set.toFinset_range π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {Ξ² : Type u_2} [DecidableEq Ξ±] [Fintype Ξ²] (f : Ξ² β Ξ±) [Fintype β(Set.range f)] : (Set.range f).toFinset = Finset.image f Finset.univ - Set.toFinset_ofPred π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} [Fintype Ξ±] (p : Ξ± β Prop) [DecidablePred p] [Fintype β{x | p x}] : {x | p x}.toFinset = Finset.filter p Finset.univ - Set.toFinset_setOf π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} [Fintype Ξ±] (p : Ξ± β Prop) [DecidablePred p] [Fintype β{x | p x}] : {x | p x}.toFinset = Finset.filter p Finset.univ - Set.subset_toFinset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {t : Set Ξ±} {s : Finset Ξ±} [Fintype βt] : s β t.toFinset β βs β t - Set.toFinset_mono π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s t : Set Ξ±} [Fintype βs] [Fintype βt] : s β t β s.toFinset β t.toFinset - Set.toFinset_ofFinset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {p : Set Ξ±} (s : Finset Ξ±) (H : β (x : Ξ±), x β s β x β p) : p.toFinset = s - Set.toFinset_subset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s : Set Ξ±} [Fintype βs] {t : Finset Ξ±} : s.toFinset β t β s β βt - Set.toFinset_image π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {Ξ² : Type u_2} [DecidableEq Ξ²] (f : Ξ± β Ξ²) (s : Set Ξ±) [Fintype βs] [Fintype β(f '' s)] : (f '' s).toFinset = Finset.image f s.toFinset - Set.toFinset_subset_toFinset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s t : Set Ξ±} [Fintype βs] [Fintype βt] : s.toFinset β t.toFinset β s β t - Set.filter_mem_univ_eq_toFinset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} [Fintype Ξ±] (s : Set Ξ±) [Fintype βs] [DecidablePred fun x => x β s] : {x | x β s} = s.toFinset - Set.toFinset_compl π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} (s : Set Ξ±) [DecidableEq Ξ±] [Fintype βs] [Fintype Ξ±] [Fintype βsαΆ] : sαΆ.toFinset = s.toFinsetαΆ - Set.toFinset_insert π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} [DecidableEq Ξ±] {a : Ξ±} {s : Set Ξ±} [Fintype β(insert a s)] [Fintype βs] : (insert a s).toFinset = insert a s.toFinset - Fintype.finsetEquivSet_symm_apply π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} [Fintype Ξ±] (s : Set Ξ±) [Fintype βs] : Fintype.finsetEquivSet.symm s = s.toFinset - Set.toFinset_diff π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} (s t : Set Ξ±) [DecidableEq Ξ±] [Fintype βs] [Fintype βt] [Fintype β(s \ t)] : (s \ t).toFinset = s.toFinset \ t.toFinset - Set.toFinset_inter π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} (s t : Set Ξ±) [DecidableEq Ξ±] [Fintype βs] [Fintype βt] [Fintype β(s β© t)] : (s β© t).toFinset = s.toFinset β© t.toFinset - Set.toFinset_sdiff π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} (s t : Set Ξ±) [DecidableEq Ξ±] [Fintype βs] [Fintype βt] [Fintype β(s \ t)] : (s \ t).toFinset = s.toFinset \ t.toFinset - Set.toFinset_union π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} (s t : Set Ξ±) [DecidableEq Ξ±] [Fintype βs] [Fintype βt] [Fintype β(s βͺ t)] : (s βͺ t).toFinset = s.toFinset βͺ t.toFinset - Set.toFinset_ssubset_univ π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} [Fintype Ξ±] {s : Set Ξ±} [Fintype βs] : s.toFinset β Finset.univ β s β Set.univ - Set.ssubset_toFinset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {t : Set Ξ±} {s : Finset Ξ±} [Fintype βt] : s β t.toFinset β βs β t - Set.toFinset_ssubset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s : Set Ξ±} [Fintype βs] {t : Finset Ξ±} : s.toFinset β t β s β βt - Set.toFinset_strict_mono π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s t : Set Ξ±} [Fintype βs] [Fintype βt] : s β t β s.toFinset β t.toFinset - Set.toFinset_ssubset_toFinset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s t : Set Ξ±} [Fintype βs] [Fintype βt] : s.toFinset β t.toFinset β s β t - Set.disjoint_toFinset π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} {s t : Set Ξ±} [Fintype βs] [Fintype βt] : Disjoint s.toFinset t.toFinset β Disjoint s t - Set.toFinset_symmDiff π Mathlib.Data.Fintype.Sets
{Ξ± : Type u_1} (s t : Set Ξ±) [DecidableEq Ξ±] [Fintype βs] [Fintype βt] [Fintype β(symmDiff s t)] : (symmDiff s t).toFinset = symmDiff s.toFinset t.toFinset - Set.toFinset_card π Mathlib.Data.Fintype.Card
{Ξ± : Type u_3} (s : Set Ξ±) [Fintype βs] : s.toFinset.card = Fintype.card βs - Set.Finite.toFinset_eq_toFinset π Mathlib.Data.Set.Finite.Basic
{Ξ± : Type u} {s : Set Ξ±} [Fintype βs] (h : s.Finite) : h.toFinset = s.toFinset - Set.toFinite_toFinset π Mathlib.Data.Set.Finite.Basic
{Ξ± : Type u} (s : Set Ξ±) [Fintype βs] : β―.toFinset = s.toFinset - Set.Finite.toFinset_diff π Mathlib.Data.Set.Finite.Basic
{Ξ± : Type u_1} (s t : Set Ξ±) [DecidableEq Ξ±] [Fintype βs] [Fintype βt] [Fintype β(s \ t)] : (s \ t).toFinset = s.toFinset \ t.toFinset - Set.toFinset_offDiag π Mathlib.Data.Fintype.Prod
{Ξ± : Type u_1} {s : Set Ξ±} [Fintype βs] [Fintype βs.offDiag] : s.offDiag.toFinset = s.toFinset.offDiag - Set.toFinset_prod π Mathlib.Data.Fintype.Prod
{Ξ± : Type u_1} {Ξ² : Type u_2} (s : Set Ξ±) (t : Set Ξ²) [Fintype βs] [Fintype βt] [Fintype β(s ΓΛ’ t)] : (s ΓΛ’ t).toFinset = s.toFinset ΓΛ’ t.toFinset - Set.toFinset_iUnion π Mathlib.Data.Set.Finite.Lattice
{Ξ± : Type u} {Ξ² : Type v} [Fintype Ξ²] [DecidableEq Ξ±] (f : Ξ² β Set Ξ±) [(w : Ξ²) β Fintype β(f w)] : (β x, f x).toFinset = Finset.univ.biUnion fun x => (f x).toFinset - Set.toFinset_Ici π Mathlib.Order.Interval.Finset.Defs
{Ξ± : Type u_3} [Preorder Ξ±] [LocallyFiniteOrderTop Ξ±] (a : Ξ±) [Fintype β(Set.Ici a)] : (Set.Ici a).toFinset = Finset.Ici a - Set.toFinset_Iic π Mathlib.Order.Interval.Finset.Defs
{Ξ± : Type u_3} [Preorder Ξ±] [LocallyFiniteOrderBot Ξ±] (a : Ξ±) [Fintype β(Set.Iic a)] : (Set.Iic a).toFinset = Finset.Iic a - Set.toFinset_Iio π Mathlib.Order.Interval.Finset.Defs
{Ξ± : Type u_3} [Preorder Ξ±] [LocallyFiniteOrderBot Ξ±] (a : Ξ±) [Fintype β(Set.Iio a)] : (Set.Iio a).toFinset = Finset.Iio a - Set.toFinset_Ioi π Mathlib.Order.Interval.Finset.Defs
{Ξ± : Type u_3} [Preorder Ξ±] [LocallyFiniteOrderTop Ξ±] (a : Ξ±) [Fintype β(Set.Ioi a)] : (Set.Ioi a).toFinset = Finset.Ioi a - Set.toFinset_Icc π Mathlib.Order.Interval.Finset.Defs
{Ξ± : Type u_3} [Preorder Ξ±] [LocallyFiniteOrder Ξ±] (a b : Ξ±) [Fintype β(Set.Icc a b)] : (Set.Icc a b).toFinset = Finset.Icc a b - Set.toFinset_Ico π Mathlib.Order.Interval.Finset.Defs
{Ξ± : Type u_3} [Preorder Ξ±] [LocallyFiniteOrder Ξ±] (a b : Ξ±) [Fintype β(Set.Ico a b)] : (Set.Ico a b).toFinset = Finset.Ico a b - Set.toFinset_Ioc π Mathlib.Order.Interval.Finset.Defs
{Ξ± : Type u_3} [Preorder Ξ±] [LocallyFiniteOrder Ξ±] (b a : Ξ±) [Fintype β(Set.Ioc b a)] : (Set.Ioc b a).toFinset = Finset.Ioc b a - Set.toFinset_Ioo π Mathlib.Order.Interval.Finset.Defs
{Ξ± : Type u_3} [Preorder Ξ±] [LocallyFiniteOrder Ξ±] (a b : Ξ±) [Fintype β(Set.Ioo a b)] : (Set.Ioo a b).toFinset = Finset.Ioo a b - Finset.prod_set_coe π Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ΞΉ : Type u_1} {M : Type u_4} [CommMonoid M] {f : ΞΉ β M} (s : Set ΞΉ) [Fintype βs] : β i, f βi = β i β s.toFinset, f i - Finset.sum_set_coe π Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ΞΉ : Type u_1} {M : Type u_4} [AddCommMonoid M] {f : ΞΉ β M} (s : Set ΞΉ) [Fintype βs] : β i, f βi = β i β s.toFinset, f i - Finset.prod_toFinset_eq_subtype π Mathlib.Data.Fintype.BigOperators
{Ξ± : Type u_1} {M : Type u_4} [CommMonoid M] [Fintype Ξ±] (p : Ξ± β Prop) [DecidablePred p] (f : Ξ± β M) : β a β {x | p x}.toFinset, f a = β a, f βa - Finset.sum_toFinset_eq_subtype π Mathlib.Data.Fintype.BigOperators
{Ξ± : Type u_1} {M : Type u_4} [AddCommMonoid M] [Fintype Ξ±] (p : Ξ± β Prop) [DecidablePred p] (f : Ξ± β M) : β a β {x | p x}.toFinset, f a = β a, f βa - finprod_mem_eq_toFinset_prod π Mathlib.Algebra.BigOperators.Finprod
{Ξ± : Type u_1} {M : Type u_5} [CommMonoid M] (f : Ξ± β M) (s : Set Ξ±) [Fintype βs] : βαΆ (i : Ξ±) (_ : i β s), f i = β i β s.toFinset, f i - finsum_mem_eq_toFinset_sum π Mathlib.Algebra.BigOperators.Finprod
{Ξ± : Type u_1} {M : Type u_5} [AddCommMonoid M] (f : Ξ± β M) (s : Set Ξ±) [Fintype βs] : βαΆ (i : Ξ±) (_ : i β s), f i = β i β s.toFinset, f i - Nat.card_eq_card_toFinset π Mathlib.SetTheory.Cardinal.Finite
{Ξ± : Type u_1} (s : Set Ξ±) [Fintype βs] : Nat.card βs = s.toFinset.card - Set.ncard_eq_toFinset_card' π Mathlib.Data.Set.Card
{Ξ± : Type u_1} (s : Set Ξ±) [Fintype βs] : s.ncard = s.toFinset.card - Set.encard_eq_coe_toFinset_card π Mathlib.Data.Set.Card
{Ξ± : Type u_1} (s : Set Ξ±) [Fintype βs] : s.encard = βs.toFinset.card - Set.toFinset_image2 π Mathlib.Data.Finset.NAry
{Ξ± : Type u_1} {Ξ² : Type u_3} {Ξ³ : Type u_5} [DecidableEq Ξ³] (f : Ξ± β Ξ² β Ξ³) (s : Set Ξ±) (t : Set Ξ²) [Fintype βs] [Fintype βt] [Fintype β(Set.image2 f s t)] : (Set.image2 f s t).toFinset = Finset.imageβ f s.toFinset t.toFinset - Set.toFinset_one π Mathlib.Algebra.Group.Pointwise.Finset.Basic
{Ξ± : Type u_2} [One Ξ±] : Set.toFinset 1 = 1 - Set.toFinset_zero π Mathlib.Algebra.Group.Pointwise.Finset.Basic
{Ξ± : Type u_2} [Zero Ξ±] : Set.toFinset 0 = 0 - Set.toFinset_add π Mathlib.Algebra.Group.Pointwise.Finset.Basic
{Ξ± : Type u_2} [DecidableEq Ξ±] [Add Ξ±] (s t : Set Ξ±) [Fintype βs] [Fintype βt] [Fintype β(s + t)] : (s + t).toFinset = s.toFinset + t.toFinset - Set.toFinset_mul π Mathlib.Algebra.Group.Pointwise.Finset.Basic
{Ξ± : Type u_2} [DecidableEq Ξ±] [Mul Ξ±] (s t : Set Ξ±) [Fintype βs] [Fintype βt] [Fintype β(s * t)] : (s * t).toFinset = s.toFinset * t.toFinset - span_lt_top_of_card_lt_finrank π Mathlib.LinearAlgebra.Dimension.Constructions
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] [StrongRankCondition R] {s : Set M} [Fintype βs] (card_lt : s.toFinset.card < Module.finrank R M) : Submodule.span R s < β€ - finrank_span_le_card π Mathlib.LinearAlgebra.Dimension.Constructions
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] [StrongRankCondition R] (s : Set M) [Fintype βs] : Module.finrank R β₯(Submodule.span R s) β€ s.toFinset.card - finrank_span_set_eq_card π Mathlib.LinearAlgebra.Dimension.Constructions
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] [StrongRankCondition R] {s : Set M} [Fintype βs] (hs : LinearIndepOn R id s) : Module.finrank R β₯(Submodule.span R s) = s.toFinset.card - span_lt_of_subset_of_card_lt_finrank π Mathlib.LinearAlgebra.Dimension.Constructions
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] [StrongRankCondition R] {s : Set M} [Fintype βs] {t : Submodule R M} (subset : s β βt) (card_lt : s.toFinset.card < Module.finrank R β₯t) : Submodule.span R s < t - image_range_addOrderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [AddGroup G] [Fintype G] {x : G} [DecidableEq G] : Finset.image (fun i => i β’ x) (Finset.range (addOrderOf x)) = (β(AddSubgroup.zmultiples x)).toFinset - image_range_orderOf π Mathlib.GroupTheory.OrderOfElement
{G : Type u_1} [Group G] [Fintype G] {x : G} [DecidableEq G] : Finset.image (fun i => x ^ i) (Finset.range (orderOf x)) = (β(Subgroup.zpowers x)).toFinset - 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.toFinset_smul_set π Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{Ξ± : Type u_1} {Ξ² : Type u_2} [DecidableEq Ξ²] [SMul Ξ± Ξ²] (a : Ξ±) (s : Set Ξ²) [Fintype βs] [Fintype β(a β’ s)] : (a β’ s).toFinset = a β’ s.toFinset - Set.toFinset_vadd_set π Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{Ξ± : Type u_1} {Ξ² : Type u_2} [DecidableEq Ξ²] [VAdd Ξ± Ξ²] (a : Ξ±) (s : Set Ξ²) [Fintype βs] [Fintype β(a +α΅₯ s)] : (a +α΅₯ s).toFinset = a +α΅₯ s.toFinset - Set.toFinset_smul π Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{Ξ± : Type u_1} {Ξ² : Type u_2} [SMul Ξ± Ξ²] [DecidableEq Ξ²] (s : Set Ξ±) (t : Set Ξ²) [Fintype βs] [Fintype βt] [Fintype β(s β’ t)] : (s β’ t).toFinset = s.toFinset β’ t.toFinset - Set.toFinset_vadd π Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{Ξ± : Type u_1} {Ξ² : Type u_2} [VAdd Ξ± Ξ²] [DecidableEq Ξ²] (s : Set Ξ±) (t : Set Ξ²) [Fintype βs] [Fintype βt] [Fintype β(s +α΅₯ t)] : (s +α΅₯ t).toFinset = s.toFinset +α΅₯ t.toFinset - setBasisOfLinearIndependentOfCardEqFinrank π Mathlib.LinearAlgebra.FiniteDimensional.Lemmas
{K : Type u} {V : Type v} [DivisionRing K] [AddCommGroup V] [Module K V] {s : Set V} [Nonempty βs] [Fintype βs] (lin_ind : LinearIndependent K Subtype.val) (card_eq : s.toFinset.card = Module.finrank K V) : Module.Basis (βs) K V - coe_setBasisOfLinearIndependentOfCardEqFinrank π Mathlib.LinearAlgebra.FiniteDimensional.Lemmas
{K : Type u} {V : Type v} [DivisionRing K] [AddCommGroup V] [Module K V] {s : Set V} [Nonempty βs] [Fintype βs] (lin_ind : LinearIndependent K Subtype.val) (card_eq : s.toFinset.card = Module.finrank K V) : β(setBasisOfLinearIndependentOfCardEqFinrank lin_ind card_eq) = Subtype.val - setBasisOfLinearIndependentOfCardEqFinrank_repr_apply π Mathlib.LinearAlgebra.FiniteDimensional.Lemmas
{K : Type u} {V : Type v} [DivisionRing K] [AddCommGroup V] [Module K V] {s : Set V} [Nonempty βs] [Fintype βs] (lin_ind : LinearIndependent K Subtype.val) (card_eq : s.toFinset.card = Module.finrank K V) (x : V) : (setBasisOfLinearIndependentOfCardEqFinrank lin_ind card_eq).repr x = lin_ind.repr ((LinearMap.codRestrict (Submodule.span K (Set.range Subtype.val)) LinearMap.id β―) x) - Lagrange.nodal_subgroup_eq_X_pow_card_sub_one π Mathlib.LinearAlgebra.Lagrange
{R : Type u_1} [CommRing R] [IsDomain R] (G : Subgroup RΛ£) [Fintype β₯G] : Lagrange.nodal (βG).toFinset Units.val = Polynomial.X ^ Fintype.card β₯G - 1 - setBasisOfTopLeSpanOfCardEqFinrank π Mathlib.LinearAlgebra.Dimension.OrzechProperty
{R : Type u_1} {M : Type u_2} [Semiring R] [OrzechProperty R] [AddCommMonoid M] [Module R M] {s : Set M} [Fintype βs] (le_span : β€ β€ Submodule.span R s) (card_eq : s.toFinset.card = Module.finrank R M) : Module.Basis (βs) R M - setBasisOfTopLeSpanOfCardEqFinrank_repr_apply π Mathlib.LinearAlgebra.Dimension.OrzechProperty
{R : Type u_1} {M : Type u_2} [Semiring R] [OrzechProperty R] [AddCommMonoid M] [Module R M] {s : Set M} [Fintype βs] (le_span : β€ β€ Submodule.span R s) (card_eq : s.toFinset.card = Module.finrank R M) (x : M) : (setBasisOfTopLeSpanOfCardEqFinrank le_span card_eq).repr x = β―.repr ((LinearMap.codRestrict (Submodule.span R (Set.range Subtype.val)) LinearMap.id β―) x) - Ideal.map_algebraMap_eq_finsetProd_pow π Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] [IsDedekindDomain R] {S : Type u_3} [CommRing S] [Algebra S R] [Algebra.IsIntegral S R] [IsDomain S] [Module.IsTorsionFree S R] {p : Ideal S} [p.IsMaximal] (hp : p β 0) : Ideal.map (algebraMap S R) p = β P β (p.primesOver R).toFinset, P ^ P.ramificationIdx S - Ideal.map_algebraMap_eq_finset_prod_pow π Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] [IsDedekindDomain R] {S : Type u_3} [CommRing S] [Algebra S R] [Algebra.IsIntegral S R] [IsDomain S] [Module.IsTorsionFree S R] {p : Ideal S} [p.IsMaximal] (hp : p β 0) : Ideal.map (algebraMap S R) p = β P β (p.primesOver R).toFinset, P ^ P.ramificationIdx S - hasProd_fintype_support π Mathlib.Topology.Algebra.InfiniteSum.Defs
{Ξ± : Type u_1} {Ξ² : Type u_2} [CommMonoid Ξ±] [TopologicalSpace Ξ±] [Fintype Ξ²] (f : Ξ² β Ξ±) (L : SummationFilter Ξ²) [L.HasSupport] [DecidablePred fun x => x β L.support] : HasProd f (β b β L.support.toFinset, f b) L - hasSum_fintype_support π Mathlib.Topology.Algebra.InfiniteSum.Defs
{Ξ± : Type u_1} {Ξ² : Type u_2} [AddCommMonoid Ξ±] [TopologicalSpace Ξ±] [Fintype Ξ²] (f : Ξ² β Ξ±) (L : SummationFilter Ξ²) [L.HasSupport] [DecidablePred fun x => x β L.support] : HasSum f (β b β L.support.toFinset, f b) L - hasProd_prod_support_of_ne_finset_one π Mathlib.Topology.Algebra.InfiniteSum.Defs
{Ξ± : Type u_1} {Ξ² : Type u_2} [CommMonoid Ξ±] [TopologicalSpace Ξ±] {L : SummationFilter Ξ²} {f : Ξ² β Ξ±} {s : Finset Ξ²} (hf : β b β L.support, b β s β f b = 1) [L.HasSupport] [DecidablePred fun x => x β L.support] : HasProd f (β b β (βs β© L.support).toFinset, f b) L - hasSum_sum_support_of_ne_finset_zero π Mathlib.Topology.Algebra.InfiniteSum.Defs
{Ξ± : Type u_1} {Ξ² : Type u_2} [AddCommMonoid Ξ±] [TopologicalSpace Ξ±] {L : SummationFilter Ξ²} {f : Ξ² β Ξ±} {s : Finset Ξ²} (hf : β b β L.support, b β s β f b = 0) [L.HasSupport] [DecidablePred fun x => x β L.support] : HasSum f (β b β (βs β© L.support).toFinset, f b) L - Finset.hasProd_support π Mathlib.Topology.Algebra.InfiniteSum.Defs
{Ξ± : Type u_1} {Ξ² : Type u_2} [CommMonoid Ξ±] [TopologicalSpace Ξ±] (s : Finset Ξ²) (f : Ξ² β Ξ±) (L : SummationFilter ββs := SummationFilter.unconditional ββs) [L.HasSupport] [DecidablePred fun x => x β L.support] : HasProd (f β Subtype.val) (β b β Finset.map (Function.Embedding.subtype fun x => x β βs) L.support.toFinset, f b) L - Finset.hasSum_support π Mathlib.Topology.Algebra.InfiniteSum.Defs
{Ξ± : Type u_1} {Ξ² : Type u_2} [AddCommMonoid Ξ±] [TopologicalSpace Ξ±] (s : Finset Ξ²) (f : Ξ² β Ξ±) (L : SummationFilter ββs := SummationFilter.unconditional ββs) [L.HasSupport] [DecidablePred fun x => x β L.support] : HasSum (f β Subtype.val) (β b β Finset.map (Function.Embedding.subtype fun x => x β βs) L.support.toFinset, f b) L - FormalMultilinearSeries.radius_right_inv_pos_of_radius_pos_aux1 π Mathlib.Analysis.Analytic.Inverse
(n : β) (p : β β β) (hp : β (k : β), 0 β€ p k) {r a : β} (hr : 0 β€ r) (ha : 0 β€ a) : β k β Finset.Ico 2 (n + 1), a ^ k * β c β {c | 1 < c.length}.toFinset, r ^ c.length * β j, p (c.blocksFun j) β€ β j β Finset.Ico 2 (n + 1), r ^ j * (β k β Finset.Ico 1 n, a ^ k * p k) ^ j - FormalMultilinearSeries.rightInv_coeff π Mathlib.Analysis.Analytic.Inverse
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] (p : FormalMultilinearSeries π E F) (i : E βL[π] F) (x : E) (n : β) (hn : 2 β€ n) : p.rightInv i x n = -(βi.symm).compContinuousMultilinearMap (β c β {c | 1 < c.length}.toFinset, p.compAlongComposition (p.rightInv i x) c) - FormalMultilinearSeries.comp_rightInv_aux1 π Mathlib.Analysis.Analytic.Inverse
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] {n : β} (hn : 0 < n) (p : FormalMultilinearSeries π E F) (q : FormalMultilinearSeries π F E) (v : Fin n β F) : (p.comp q n) v = β c β {c | 1 < c.length}.toFinset, (p c.length) (q.applyComposition c v) + (p 1) fun x => (q n) v - FormalMultilinearSeries.comp_rightInv_aux2 π Mathlib.Analysis.Analytic.Inverse
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] (p : FormalMultilinearSeries π E F) (i : E βL[π] F) (x : E) (n : β) (v : Fin (n + 2) β F) : β c β {c | 1 < c.length}.toFinset, (p c.length) (FormalMultilinearSeries.applyComposition (fun k => if k < n + 2 then p.rightInv i x k else 0) c v) = β c β {c | 1 < c.length}.toFinset, (p c.length) ((p.rightInv i x).applyComposition c v) - Polynomial.Gal.card_complex_roots_eq_card_real_add_card_not_gal_inv π Mathlib.Analysis.Complex.Polynomial.Basic
(p : Polynomial β) : (p.rootSet β).toFinset.card = (p.rootSet β).toFinset.card + ((Polynomial.Gal.galActionHom p β) ((Polynomial.Gal.restrict p β) (AlgEquiv.restrictScalars β Complex.conjAe))).support.card - SimpleGraph.card_neighborSet_union_compl_neighborSet π Mathlib.Combinatorics.SimpleGraph.Basic
{V : Type u} [Fintype V] (G : SimpleGraph V) (v : V) [Fintype β(G.neighborSet v βͺ GαΆ.neighborSet v)] : (G.neighborSet v βͺ GαΆ.neighborSet v).toFinset.card = Fintype.card V - 1 - SimpleGraph.neighborFinset_def π Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) (v : V) [Fintype β(G.neighborSet v)] : G.neighborFinset v = (G.neighborSet v).toFinset - SimpleGraph.edgeFinset_subset_sym2_of_support_subset π Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {s : Set V} [DecidablePred fun x => x β s] [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] (h : G.support β s) : G.edgeFinset β s.toFinset.sym2 - SimpleGraph.edgeFinset_top π Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} [Fintype V] [DecidableEq V] : β€.edgeFinset = Sym2.diagSetαΆ.toFinset - SimpleGraph.map_edgeFinset_induce π Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {s : Set V} [DecidablePred fun x => x β s] [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] [DecidableEq V] : Finset.map (Function.Embedding.subtype fun x => x β s).sym2Map (SimpleGraph.induce s G).edgeFinset = G.edgeFinset β© s.toFinset.sym2 - SimpleGraph.map_neighborFinset_induce π Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {s : Set V} [DecidablePred fun x => x β s] [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] [DecidableEq V] (v : βs) : Finset.map (Function.Embedding.subtype fun x => x β s) ((SimpleGraph.induce s G).neighborFinset v) = G.neighborFinset βv β© s.toFinset - SimpleGraph.sum_degrees_support_eq_twice_card_edges π Mathlib.Combinatorics.SimpleGraph.DegreeSum
{V : Type u} (G : SimpleGraph V) [Fintype V] [DecidableRel G.Adj] : β v β G.support.toFinset, G.degree v = 2 * G.edgeFinset.card - SimpleGraph.Subgraph.finset_card_neighborSet_eq_degree π Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} {v : V} [Fintype β(G'.neighborSet v)] : (G'.neighborSet v).toFinset.card = G'.degree v - SimpleGraph.Subgraph.IsSpanning.card_verts π Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} [Fintype V] {G' : G.Subgraph} [Fintype βG'.verts] (h : G'.IsSpanning) : G'.verts.toFinset.card = Fintype.card V - OrderIso.infIrredUpperSet_symm_apply π Mathlib.Order.Birkhoff
{Ξ± : Type u_1} [SemilatticeInf Ξ±] [OrderTop Ξ±] [Finite Ξ±] (s : { s // InfIrred s }) [Fintype β₯βs] : OrderIso.infIrredUpperSet.symm s = (ββs).toFinset.inf id - OrderIso.supIrredLowerSet_symm_apply π Mathlib.Order.Birkhoff
{Ξ± : Type u_1} [SemilatticeSup Ξ±] [OrderBot Ξ±] [Finite Ξ±] (s : { s // SupIrred s }) [Fintype β₯βs] : OrderIso.supIrredLowerSet.symm s = (ββs).toFinset.sup id - SimpleGraph.set_walk_length_toFinset_eq π Mathlib.Combinatorics.SimpleGraph.Walk.Counting
{V : Type u} (G : SimpleGraph V) [DecidableEq V] [G.LocallyFinite] (n : β) (u v : V) : {p | p.length = n}.toFinset = G.finsetWalkLength n u v - SimpleGraph.disjiUnion_supp_toFinset_eq_supp_toFinset π Mathlib.Combinatorics.SimpleGraph.Connectivity.Finite
{V : Type u} {G : SimpleGraph V} [DecidableEq V] [Fintype V] [DecidableRel G.Adj] {G' : SimpleGraph V} (h : G β€ G') (c' : G'.ConnectedComponent) [Fintype βc'.supp] [DecidablePred fun c => c.supp β c'.supp] : {c | c.supp β c'.supp}.disjiUnion (fun c => c.supp.toFinset) β― = c'.supp.toFinset - SimpleGraph.Subgraph.IsMatching.even_card π Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} [Fintype βM.verts] (h : M.IsMatching) : Even M.verts.toFinset.card - ConjRootClass.aroots_minpoly_eq_carrier_val π Mathlib.FieldTheory.Minpoly.ConjRootClass
{K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L] [Algebra.IsSeparable K L] (c : ConjRootClass K L) [Fintype βc.carrier] : c.minpoly.aroots L = c.carrier.toFinset.val - ConjRootClass.carrier_eq_mk_aroots_minpoly π Mathlib.FieldTheory.Minpoly.ConjRootClass
{K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L] [Algebra.IsSeparable K L] (c : ConjRootClass K L) [Fintype βc.carrier] : c.carrier.toFinset = { val := c.minpoly.aroots L, nodup := β― } - ConjRootClass.minpoly.map_eq_prod π Mathlib.FieldTheory.Minpoly.ConjRootClass
{K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L] [Algebra.IsSeparable K L] [Normal K L] (c : ConjRootClass K L) [Fintype βc.carrier] : Polynomial.map (algebraMap K L) c.minpoly = β x β c.carrier.toFinset, (Polynomial.X - Polynomial.C x) - sum_conjClasses_card_eq_card π Mathlib.GroupTheory.ClassEquation
(G : Type u_1) [Group G] [Fintype (ConjClasses G)] [Fintype G] [(x : ConjClasses G) β Fintype βx.carrier] : β x, x.carrier.toFinset.card = Fintype.card G - Group.card_center_add_sum_card_noncenter_eq_card π Mathlib.GroupTheory.ClassEquation
(G : Type u_2) [Group G] [(x : ConjClasses G) β Fintype βx.carrier] [Fintype G] [Fintype β₯(Subgroup.center G)] [Fintype β(ConjClasses.noncenter G)] : Fintype.card β₯(Subgroup.center G) + β x β (ConjClasses.noncenter G).toFinset, x.carrier.toFinset.card = Fintype.card G - quadraticChar_card_sqrts π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) (a : F) : β{x | x ^ 2 = a}.toFinset.card = (quadraticChar F) a + 1 - legendreSym.card_sqrts π Mathlib.NumberTheory.LegendreSymbol.Basic
(p : β) [Fact (Nat.Prime p)] (hp : p β 2) (a : β€) : β{x | x ^ 2 = βa}.toFinset.card = legendreSym p a + 1 - NumberField.InfinitePlace.sum_inertiaDeg_eq_finrank π Mathlib.NumberTheory.NumberField.Completion.Ramification
(K : Type u_1) (L : Type u_2) [Field K] [Field L] [Algebra K L] (v : NumberField.InfinitePlace K) [NumberField K] [NumberField L] : β w β (NumberField.InfinitePlace.placesOver L v).toFinset, v.inertiaDeg w = Module.finrank K L - Set.einfsep_of_fintype π Mathlib.Topology.MetricSpace.Infsep
{Ξ± : Type u_1} [EDist Ξ±] {s : Set Ξ±} [Fintype βs] : s.einfsep = s.offDiag.toFinset.inf (Function.uncurry edist) - Set.Nontrivial.infsep_of_fintype π Mathlib.Topology.MetricSpace.Infsep
{Ξ± : Type u_1} [PseudoMetricSpace Ξ±] {s : Set Ξ±} [Fintype βs] (hs : s.Nontrivial) : s.infsep = s.offDiag.toFinset.inf' β― (Function.uncurry dist) - Set.infsep_of_fintype π Mathlib.Topology.MetricSpace.Infsep
{Ξ± : Type u_1} [PseudoMetricSpace Ξ±] {s : Set Ξ±} [Decidable s.Nontrivial] [Fintype βs] : s.infsep = if hs : s.Nontrivial then s.offDiag.toFinset.inf' β― (Function.uncurry dist) else 0
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