Loogle!
Result
Found 154 declarations mentioning Equiv.toEmbedding.
- Equiv.toEmbedding 📋 Mathlib.Logic.Embedding.Basic
{α : Sort u} {β : Sort v} (f : α ≃ β) : α ↪ β - Equiv.refl_toEmbedding 📋 Mathlib.Logic.Embedding.Basic
{α : Type u_1} : (Equiv.refl α).toEmbedding = Function.Embedding.refl α - Equiv.toEmbedding_injective 📋 Mathlib.Logic.Embedding.Basic
{α : Sort u} {β : Sort v} : Function.Injective Equiv.toEmbedding - Function.Embedding.equiv_symm_toEmbedding_trans_toEmbedding 📋 Mathlib.Logic.Embedding.Basic
{α : Sort u_1} {β : Sort u_2} (e : α ≃ β) : e.symm.toEmbedding.trans e.toEmbedding = Function.Embedding.refl β - Function.Embedding.equiv_toEmbedding_trans_symm_toEmbedding 📋 Mathlib.Logic.Embedding.Basic
{α : Sort u_1} {β : Sort u_2} (e : α ≃ β) : e.toEmbedding.trans e.symm.toEmbedding = Function.Embedding.refl α - Equiv.trans_toEmbedding 📋 Mathlib.Logic.Embedding.Basic
{α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : α ≃ β) (f : β ≃ γ) : (e.trans f).toEmbedding = e.toEmbedding.trans f.toEmbedding - Equiv.coe_toEmbedding 📋 Mathlib.Logic.Embedding.Basic
{α : Sort u} {β : Sort v} (f : α ≃ β) : ⇑f.toEmbedding = ⇑f - Equiv.toEmbedding_apply 📋 Mathlib.Logic.Embedding.Basic
{α : Sort u} {β : Sort v} (f : α ≃ β) (a : α) : f.toEmbedding a = f a - Function.Embedding.congr_apply 📋 Mathlib.Logic.Embedding.Basic
{α : Sort u} {β : Sort v} {γ : Sort w} {δ : Sort x} (e₁ : α ≃ β) (e₂ : γ ≃ δ) (f : α ↪ γ) : ⇑(Function.Embedding.congr e₁ e₂ f) = ⇑(f.trans e₂.toEmbedding) ∘ ⇑e₁.symm - RelIso.coe_toEmbedding 📋 Mathlib.Order.RelIso.Basic
{α : Type u_1} {β : Type u_2} {r : α → α → Prop} {s : β → β → Prop} (f : r ≃r s) : ⇑f.toEmbedding = ⇑f - Finset.map_cast_heq 📋 Mathlib.Data.Finset.Image
{α β : Type u_4} (h : α = β) (s : Finset α) : Finset.map (Equiv.cast h).toEmbedding s ≍ s - Equiv.finsetCongr_apply 📋 Mathlib.Data.Finset.Image
{α : Type u_1} {β : Type u_2} (e : α ≃ β) (s : Finset α) : e.finsetCongr s = Finset.map e.toEmbedding s - Finset.map_perm 📋 Mathlib.Data.Finset.Image
{α : Type u_1} {s : Finset α} {σ : Equiv.Perm α} (hs : {a | σ a ≠ a} ⊆ ↑s) : Finset.map (Equiv.toEmbedding σ) s = s - Finset.map_symm_subset 📋 Mathlib.Data.Finset.Image
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} {f : α ≃ β} : Finset.map f.symm.toEmbedding t ⊆ s ↔ t ⊆ Finset.map f.toEmbedding s - Finset.subset_map_symm 📋 Mathlib.Data.Finset.Image
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} {f : α ≃ β} : s ⊆ Finset.map f.symm.toEmbedding t ↔ Finset.map f.toEmbedding s ⊆ t - Finset.mem_map_equiv 📋 Mathlib.Data.Finset.Image
{α : Type u_1} {β : Type u_2} {s : Finset α} {f : α ≃ β} {b : β} : b ∈ Finset.map f.toEmbedding s ↔ f.symm b ∈ s - Equiv.finsetCongr_toEmbedding 📋 Mathlib.Data.Finset.Image
{α : Type u_1} {β : Type u_2} (e : α ≃ β) : e.finsetCongr.toEmbedding = (Finset.mapEmbedding e.toEmbedding).toEmbedding - Equiv.Finset.congr_toEmbedding 📋 Mathlib.Data.Finset.Image
{α : Type u_1} {β : Type u_2} (e : α ≃ β) : e.finsetCongr.toEmbedding = (Finset.mapEmbedding e.toEmbedding).toEmbedding - Finset.map_filter 📋 Mathlib.Data.Finset.Image
{α : Type u_1} {β : Type u_2} {s : Finset α} {f : α ≃ β} {p : α → Prop} [DecidablePred p] : Finset.map f.toEmbedding (Finset.filter p s) = Finset.filter (p ∘ ⇑f.symm) (Finset.map f.toEmbedding s) - Finset.map_univ_equiv 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {β : Type u_2} [Fintype α] [Fintype β] (f : β ≃ α) : Finset.map f.toEmbedding Finset.univ = Finset.univ - Finset.univ_map_equiv_to_embedding 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_3} {β : Type u_4} [Fintype α] [Fintype β] (e : α ≃ β) : Finset.map e.toEmbedding Finset.univ = Finset.univ - Fin.equivSubtype_symm_trans_valEmbedding 📋 Mathlib.Data.Fin.Embedding
{n : ℕ} : Fin.equivSubtype.symm.toEmbedding.trans Fin.valEmbedding = Function.Embedding.subtype fun x => x < n - Function.Embedding.toEmbedding_equivOfFiniteSelfEmbedding 📋 Mathlib.Data.Fintype.EquivFin
{α : Type u_1} [Finite α] (e : α ↪ α) : e.equivOfFiniteSelfEmbedding.toEmbedding = e - Finset.toLeft_map_sumComm 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {u : Finset (α ⊕ β)} : (Finset.map (Equiv.sumComm α β).toEmbedding u).toLeft = u.toRight - Finset.toRight_map_sumComm 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {u : Finset (α ⊕ β)} : (Finset.map (Equiv.sumComm α β).toEmbedding u).toRight = u.toLeft - Finset.Ici_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : α) : Finset.Ici (OrderDual.toDual a) = Finset.map OrderDual.toDual.toEmbedding (Finset.Iic a) - Finset.Iic_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderTop α] (a : α) : Finset.Iic (OrderDual.toDual a) = Finset.map OrderDual.toDual.toEmbedding (Finset.Ici a) - Finset.Iio_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderTop α] (a : α) : Finset.Iio (OrderDual.toDual a) = Finset.map OrderDual.toDual.toEmbedding (Finset.Ioi a) - Finset.Ioi_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : α) : Finset.Ioi (OrderDual.toDual a) = Finset.map OrderDual.toDual.toEmbedding (Finset.Iio a) - Finset.Ici_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderTop α] (a : αᵒᵈ) : Finset.Ici (OrderDual.ofDual a) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Iic a) - Finset.Iic_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : αᵒᵈ) : Finset.Iic (OrderDual.ofDual a) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Ici a) - Finset.Iio_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : αᵒᵈ) : Finset.Iio (OrderDual.ofDual a) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Ioi a) - Finset.Ioi_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderTop α] (a : αᵒᵈ) : Finset.Ioi (OrderDual.ofDual a) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Iio a) - Ici_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : αᵒᵈ) : Finset.Ici a = Finset.map OrderDual.toDual.toEmbedding (Finset.Iic (OrderDual.ofDual a)) - Iic_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderTop α] (a : αᵒᵈ) : Finset.Iic a = Finset.map OrderDual.toDual.toEmbedding (Finset.Ici (OrderDual.ofDual a)) - Iio_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderTop α] (a : αᵒᵈ) : Finset.Iio a = Finset.map OrderDual.toDual.toEmbedding (Finset.Ioi (OrderDual.ofDual a)) - Ioi_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : αᵒᵈ) : Finset.Ioi a = Finset.map OrderDual.toDual.toEmbedding (Finset.Iio (OrderDual.ofDual a)) - Finset.Icc_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) : Finset.Icc (OrderDual.toDual a) (OrderDual.toDual b) = Finset.map OrderDual.toDual.toEmbedding (Finset.Icc b a) - Finset.Ico_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) : Finset.Ico (OrderDual.toDual a) (OrderDual.toDual b) = Finset.map OrderDual.toDual.toEmbedding (Finset.Ioc b a) - Finset.Ioc_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (b a : α) : Finset.Ioc (OrderDual.toDual b) (OrderDual.toDual a) = Finset.map OrderDual.toDual.toEmbedding (Finset.Ico a b) - Finset.Ioo_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) : Finset.Ioo (OrderDual.toDual a) (OrderDual.toDual b) = Finset.map OrderDual.toDual.toEmbedding (Finset.Ioo b a) - Finset.Icc_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Icc (OrderDual.ofDual a) (OrderDual.ofDual b) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Icc b a) - Finset.Ico_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Ico (OrderDual.ofDual a) (OrderDual.ofDual b) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Ioc b a) - Finset.Ioc_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (b a : αᵒᵈ) : Finset.Ioc (OrderDual.ofDual b) (OrderDual.ofDual a) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Ico a b) - Finset.Ioo_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Ioo (OrderDual.ofDual a) (OrderDual.ofDual b) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Ioo b a) - Finset.Icc_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Icc a b = Finset.map OrderDual.toDual.toEmbedding (Finset.Icc (OrderDual.ofDual b) (OrderDual.ofDual a)) - Finset.Ico_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Ico a b = Finset.map OrderDual.toDual.toEmbedding (Finset.Ioc (OrderDual.ofDual b) (OrderDual.ofDual a)) - Finset.Ioc_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (b a : αᵒᵈ) : Finset.Ioc b a = Finset.map OrderDual.toDual.toEmbedding (Finset.Ico (OrderDual.ofDual a) (OrderDual.ofDual b)) - Finset.Ioo_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Ioo a b = Finset.map OrderDual.toDual.toEmbedding (Finset.Ioo (OrderDual.ofDual b) (OrderDual.ofDual a)) - Finset.uIcc_toDual 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Lattice α] [LocallyFiniteOrder α] (a b : α) : Finset.uIcc (OrderDual.toDual a) (OrderDual.toDual b) = Finset.map OrderDual.toDual.toEmbedding (Finset.uIcc a b) - Finset.prod_comp_equiv 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} {s : Finset ι} [CommMonoid M] {f : κ → M} (e : ι ≃ κ) : s.prod (f ∘ ⇑e) = (Finset.map e.toEmbedding s).prod f - Finset.sum_comp_equiv 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} {s : Finset ι} [AddCommMonoid M] {f : κ → M} (e : ι ≃ κ) : s.sum (f ∘ ⇑e) = (Finset.map e.toEmbedding s).sum f - Finset.prod_map_equiv 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} {s : Finset ι} [CommMonoid M] {f : ι → M} (e : ι ≃ κ) : (Finset.map e.toEmbedding s).prod (f ∘ ⇑e.symm) = s.prod f - Finset.sum_map_equiv 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} {s : Finset ι} [AddCommMonoid M] {f : ι → M} (e : ι ≃ κ) : (Finset.map e.toEmbedding s).sum (f ∘ ⇑e.symm) = s.sum f - Fin.map_revPerm_Ici 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Ici i) = Finset.Iic i.rev - Fin.map_revPerm_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Iic i) = Finset.Ici i.rev - Fin.map_revPerm_Iio 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Iio i) = Finset.Ioi i.rev - Fin.map_revPerm_Ioi 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Ioi i) = Finset.Iio i.rev - Fin.map_revPerm_uIcc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.uIcc i j) = Finset.uIcc i.rev j.rev - Fin.map_revPerm_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Icc i j) = Finset.Icc j.rev i.rev - Fin.map_revPerm_Ico 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Ico i j) = Finset.Ioc j.rev i.rev - Fin.map_revPerm_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Ioc i j) = Finset.Ico j.rev i.rev - Fin.map_revPerm_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Ioo i j) = Finset.Ioo j.rev i.rev - Fin.map_finCongr_Ici 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Ici i) = Finset.Ici (Fin.cast h i) - Fin.map_finCongr_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Iic i) = Finset.Iic (Fin.cast h i) - Fin.map_finCongr_Iio 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Iio i) = Finset.Iio (Fin.cast h i) - Fin.map_finCongr_Ioi 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Ioi i) = Finset.Ioi (Fin.cast h i) - Fin.map_finCongr_uIcc 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i j : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.uIcc i j) = Finset.uIcc (Fin.cast h i) (Fin.cast h j) - Fin.map_finCongr_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i j : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Icc i j) = Finset.Icc (Fin.cast h i) (Fin.cast h j) - Fin.map_finCongr_Ico 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i j : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Ico i j) = Finset.Ico (Fin.cast h i) (Fin.cast h j) - Fin.map_finCongr_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i j : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Ioc i j) = Finset.Ioc (Fin.cast h i) (Fin.cast h j) - Fin.map_finCongr_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i j : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Ioo i j) = Finset.Ioo (Fin.cast h i) (Fin.cast h j) - Finset.HasAntidiagonal.map_prodComm_antidiagonal 📋 Mathlib.Algebra.Order.Antidiag.Prod
{A : Type u_1} [AddCommMagma A] [Finset.HasAntidiagonal A] {n : A} : Finset.map (Equiv.prodComm A A).toEmbedding (Finset.HasAntidiagonal.antidiagonal n) = Finset.HasAntidiagonal.antidiagonal n - Finset.HasMulAntidiagonal.map_prodComm_mulAntidiagonal 📋 Mathlib.Algebra.Order.Antidiag.Prod
{A : Type u_1} [CommMagma A] [Finset.HasMulAntidiagonal A] {n : A} : Finset.map (Equiv.prodComm A A).toEmbedding (Finset.HasMulAntidiagonal.mulAntidiagonal n) = Finset.HasMulAntidiagonal.mulAntidiagonal n - Finset.map_op_one 📋 Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [One α] : Finset.map MulOpposite.opEquiv.toEmbedding 1 = 1 - Finset.map_op_zero 📋 Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [Zero α] : Finset.map AddOpposite.opEquiv.toEmbedding 0 = 0 - Finset.map_op_inv 📋 Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [DecidableEq α] [Inv α] (s : Finset α) : Finset.map MulOpposite.opEquiv.toEmbedding s⁻¹ = (Finset.map MulOpposite.opEquiv.toEmbedding s)⁻¹ - Finset.map_op_neg 📋 Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [DecidableEq α] [Neg α] (s : Finset α) : Finset.map AddOpposite.opEquiv.toEmbedding (-s) = -Finset.map AddOpposite.opEquiv.toEmbedding s - Finset.map_op_add 📋 Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [DecidableEq α] [Add α] (s t : Finset α) : Finset.map AddOpposite.opEquiv.toEmbedding (s + t) = Finset.map AddOpposite.opEquiv.toEmbedding t + Finset.map AddOpposite.opEquiv.toEmbedding s - Finset.map_op_mul 📋 Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [DecidableEq α] [Mul α] (s t : Finset α) : Finset.map MulOpposite.opEquiv.toEmbedding (s * t) = Finset.map MulOpposite.opEquiv.toEmbedding t * Finset.map MulOpposite.opEquiv.toEmbedding s - Finset.map_op_nsmul 📋 Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [DecidableEq α] [AddMonoid α] (s : Finset α) (n : ℕ) : Finset.map AddOpposite.opEquiv.toEmbedding (n • s) = n • Finset.map AddOpposite.opEquiv.toEmbedding s - Finset.map_op_pow 📋 Mathlib.Algebra.Group.Pointwise.Finset.Basic
{α : Type u_2} [DecidableEq α] [Monoid α] (s : Finset α) (n : ℕ) : Finset.map MulOpposite.opEquiv.toEmbedding (s ^ n) = Finset.map MulOpposite.opEquiv.toEmbedding s ^ n - AddMonoidAlgebra.domCongr_support 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {M : Type u_7} {N : Type u_8} [CommSemiring R] [Semiring A] [Algebra R A] [AddMonoid M] [AddMonoid N] (e : M ≃+ N) (x : AddMonoidAlgebra A M) : ((AddMonoidAlgebra.domCongr R A e) x).coeff.support = Finset.map (↑e).toEmbedding x.coeff.support - MonoidAlgebra.domCongr_support 📋 Mathlib.Algebra.MonoidAlgebra.Basic
{R : Type u_1} {A : Type u_4} {M : Type u_7} {N : Type u_8} [CommSemiring R] [Semiring A] [Algebra R A] [Monoid M] [Monoid N] (e : M ≃* N) (x : MonoidAlgebra A M) : ((MonoidAlgebra.domCongr R A e) x).coeff.support = Finset.map (↑e).toEmbedding x.coeff.support - Int.map_prodComm_divisorsAntidiag 📋 Mathlib.NumberTheory.Divisors
{z : ℤ} : Finset.map (Equiv.prodComm ℤ ℤ).toEmbedding z.divisorsAntidiag = z.divisorsAntidiag - Nat.map_swap_divisorsAntidiagonal 📋 Mathlib.NumberTheory.Divisors
{n : ℕ} : Finset.map (Equiv.prodComm ℕ ℕ).toEmbedding n.divisorsAntidiagonal = n.divisorsAntidiagonal - Int.divisorsAntidiag_neg 📋 Mathlib.NumberTheory.Divisors
{z : ℤ} : (-z).divisorsAntidiag = Finset.map ((Function.Embedding.refl ℤ).prodMap (Equiv.toEmbedding (Equiv.neg ℤ))) z.divisorsAntidiag - Int.map_neg_divisorsAntidiag 📋 Mathlib.NumberTheory.Divisors
{z : ℤ} : Finset.map (Equiv.toEmbedding (Equiv.neg (ℤ × ℤ))) z.divisorsAntidiag = z.divisorsAntidiag - Int.divisorsAntidiag_natCast 📋 Mathlib.NumberTheory.Divisors
(n : ℕ) : (↑n).divisorsAntidiag = (Finset.map (Nat.castEmbedding.prodMap Nat.castEmbedding) n.divisorsAntidiagonal).disjUnion (Finset.map ((Nat.castEmbedding.trans (Equiv.toEmbedding (Equiv.neg ℤ))).prodMap (Nat.castEmbedding.trans (Equiv.toEmbedding (Equiv.neg ℤ)))) n.divisorsAntidiagonal) ⋯ - Int.divisorsAntidiag_ofNat 📋 Mathlib.NumberTheory.Divisors
(n : ℕ) : (OfNat.ofNat n).divisorsAntidiag = (Finset.map (Nat.castEmbedding.prodMap Nat.castEmbedding) n.divisorsAntidiagonal).disjUnion (Finset.map ((Nat.castEmbedding.trans (Equiv.toEmbedding (Equiv.neg ℤ))).prodMap (Nat.castEmbedding.trans (Equiv.toEmbedding (Equiv.neg ℤ)))) n.divisorsAntidiagonal) ⋯ - Int.divisorsAntidiag_neg_natCast 📋 Mathlib.NumberTheory.Divisors
(n : ℕ) : (-↑n).divisorsAntidiag = (Finset.map (Nat.castEmbedding.prodMap (Nat.castEmbedding.trans (Equiv.toEmbedding (Equiv.neg ℤ)))) n.divisorsAntidiagonal).disjUnion (Finset.map ((Nat.castEmbedding.trans (Equiv.toEmbedding (Equiv.neg ℤ))).prodMap Nat.castEmbedding) n.divisorsAntidiagonal) ⋯ - Finset.dens_map_equiv 📋 Mathlib.Data.Finset.Density
{α : Type u_2} {β : Type u_3} [Fintype α] {s : Finset α} [Fintype β] (e : α ≃ β) : (Finset.map e.toEmbedding s).dens = s.dens - Function.Odd.finsetSum_eq_zero 📋 Mathlib.Algebra.Group.EvenFunction
{α : Type u_3} {β : Type u_4} [AddCommGroup β] [IsAddTorsionFree β] [InvolutiveNeg α] {f : α → β} (hf : Function.Odd f) {s : Finset α} (hs : Finset.map (Equiv.toEmbedding (Equiv.neg α)) s = s) : s.sum f = 0 - Function.Odd.finset_sum_eq_zero 📋 Mathlib.Algebra.Group.EvenFunction
{α : Type u_3} {β : Type u_4} [AddCommGroup β] [IsAddTorsionFree β] [InvolutiveNeg α] {f : α → β} (hf : Function.Odd f) {s : Finset α} (hs : Finset.map (Equiv.toEmbedding (Equiv.neg α)) s = s) : s.sum f = 0 - Finset.Nat.antidiagonalTuple_two 📋 Mathlib.Data.Fin.Tuple.NatAntidiagonal
(n : ℕ) : Finset.Nat.antidiagonalTuple 2 n = Finset.map (piFinTwoEquiv fun x => ℕ).symm.toEmbedding (Finset.HasAntidiagonal.antidiagonal n) - Finset.mapRange_finsuppAntidiag_eq 📋 Mathlib.Algebra.Order.Antidiag.Finsupp
{ι : Type u_1} {μ : Type u_2} {μ' : Type u_3} [DecidableEq ι] [AddCommMonoid μ] [Finset.HasAntidiagonal μ] [DecidableEq μ] [AddCommMonoid μ'] [Finset.HasAntidiagonal μ'] [DecidableEq μ'] {e : μ ≃+ μ'} {s : Finset ι} {n : μ} : Finset.map (Finsupp.mapRange.addEquiv e).toEmbedding (s.finsuppAntidiag n) = s.finsuppAntidiag (e n) - Finset.mapRange_finsuppAntidiag_subset 📋 Mathlib.Algebra.Order.Antidiag.Finsupp
{ι : Type u_1} {μ : Type u_2} {μ' : Type u_3} [DecidableEq ι] [AddCommMonoid μ] [Finset.HasAntidiagonal μ] [DecidableEq μ] [AddCommMonoid μ'] [Finset.HasAntidiagonal μ'] [DecidableEq μ'] {e : μ ≃+ μ'} {s : Finset ι} {n : μ} : Finset.map (Finsupp.mapRange.addEquiv e).toEmbedding (s.finsuppAntidiag n) ⊆ s.finsuppAntidiag (e n) - Equiv.Perm.support_conj 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [Fintype α] [DecidableEq α] {σ τ : Equiv.Perm α} : (σ * τ * σ⁻¹).support = Finset.map (Equiv.toEmbedding σ) τ.support - Equiv.Perm.exists_map_finset_eq 📋 Mathlib.Logic.Equiv.Fintype
{β : Type u_2} (s t : Finset β) (h : s.card = t.card) : ∃ σ, Finset.map (Equiv.toEmbedding σ) s = t - Finset.univ_perm_option 📋 Mathlib.GroupTheory.Perm.Option
{α : Type u_1} [DecidableEq α] [Fintype α] : Finset.univ = Finset.map Equiv.Perm.decomposeOption.symm.toEmbedding Finset.univ - Finset.univ_perm_fin_succ 📋 Mathlib.GroupTheory.Perm.Fin
{n : ℕ} : Finset.univ = Finset.map Equiv.Perm.decomposeFin.symm.toEmbedding Finset.univ - Multiset.toEmbedding_coeEquiv_trans 📋 Mathlib.Data.Multiset.Fintype
{α : Type u_1} [DecidableEq α] (m : Multiset α) : m.coeEquiv.toEmbedding.trans (Function.Embedding.subtype fun x => x ∈ m.toEnumFinset) = m.coeEmbedding - Affine.Simplex.range_face_reindex 📋 Mathlib.LinearAlgebra.AffineSpace.Simplex.Basic
{k : Type u_1} {V : Type u_2} {P : Type u_5} [Ring k] [AddCommGroup V] [Module k V] [AddTorsor V P] {m n : ℕ} (s : Affine.Simplex k P m) (e : Fin (m + 1) ≃ Fin (n + 1)) {fs : Finset (Fin (n + 1))} {n' : ℕ} (h : fs.card = n' + 1) : Set.range ((s.reindex e).face h).points = Set.range (s.face ⋯).points - Finset.filter_piFinset_eq_map_snocEquiv 📋 Mathlib.Data.Fin.Tuple.Finset
{n : ℕ} {α : Fin (n + 1) → Type u_1} (S : (i : Fin (n + 1)) → Finset (α i)) (P : ((i : Fin n) → α i.castSucc) → Prop) [DecidablePred P] : {r ∈ Fintype.piFinset S | P (Fin.init r)} = Finset.map (Fin.snocEquiv α).toEmbedding (S (Fin.last n) ×ˢ {r ∈ Fintype.piFinset (Fin.init S) | P r}) - Finset.map_snocEquiv_filter_piFinset 📋 Mathlib.Data.Fin.Tuple.Finset
{n : ℕ} {α : Fin (n + 1) → Type u_1} (S : (i : Fin (n + 1)) → Finset (α i)) (P : ((i : Fin n) → α i.castSucc) → Prop) [DecidablePred P] : Finset.map (Fin.snocEquiv α).symm.toEmbedding ({r ∈ Fintype.piFinset S | P (Fin.init r)}) = S (Fin.last n) ×ˢ {r ∈ Fintype.piFinset (Fin.init S) | P r} - Finset.filter_piFinset_eq_map_insertNthEquiv 📋 Mathlib.Data.Fin.Tuple.Finset
{n : ℕ} {α : Fin (n + 1) → Type u_1} {p : Fin (n + 1)} (S : (i : Fin (n + 1)) → Finset (α i)) (P : ((i : Fin n) → α (p.succAbove i)) → Prop) [DecidablePred P] : {r ∈ Fintype.piFinset S | P (p.removeNth r)} = Finset.map (Fin.insertNthEquiv α p).toEmbedding (S p ×ˢ {r ∈ Fintype.piFinset (p.removeNth S) | P r}) - Finset.map_insertNthEquiv_filter_piFinset 📋 Mathlib.Data.Fin.Tuple.Finset
{n : ℕ} {α : Fin (n + 1) → Type u_1} {p : Fin (n + 1)} (S : (i : Fin (n + 1)) → Finset (α i)) (P : ((i : Fin n) → α (p.succAbove i)) → Prop) [DecidablePred P] : Finset.map (Fin.insertNthEquiv α p).symm.toEmbedding ({r ∈ Fintype.piFinset S | P (p.removeNth r)}) = S p ×ˢ {r ∈ Fintype.piFinset (p.removeNth S) | P r} - Finset.filter_piFinset_eq_map_consEquiv 📋 Mathlib.Data.Fin.Tuple.Finset
{n : ℕ} {α : Fin (n + 1) → Type u_1} (S : (i : Fin (n + 1)) → Finset (α i)) (P : ((i : Fin n) → α i.succ) → Prop) [DecidablePred P] : {r ∈ Fintype.piFinset S | P (Fin.tail r)} = Finset.map (Fin.consEquiv α).toEmbedding (S 0 ×ˢ {r ∈ Fintype.piFinset (Fin.tail S) | P r}) - Finset.map_consEquiv_filter_piFinset 📋 Mathlib.Data.Fin.Tuple.Finset
{n : ℕ} {α : Fin (n + 1) → Type u_1} (S : (i : Fin (n + 1)) → Finset (α i)) (P : ((i : Fin n) → α i.succ) → Prop) [DecidablePred P] : Finset.map (Fin.consEquiv α).symm.toEmbedding ({r ∈ Fintype.piFinset S | P (Fin.tail r)}) = S 0 ×ˢ {r ∈ Fintype.piFinset (Fin.tail S) | P r} - SkewMonoidAlgebra.domCongr_support 📋 Mathlib.Algebra.SkewMonoidAlgebra.Lift
(k : Type u_1) {G : Type u_2} {H : Type u_3} (A : Type u_4) [Monoid G] [Monoid H] [Semiring A] [CommSemiring k] [Algebra k A] [MulSemiringAction G A] [MulSemiringAction H A] [SMulCommClass G k A] [SMulCommClass H k A] {e : G ≃* H} (he : ∀ (a : G) (x : A), a • x = e a • x) (f : SkewMonoidAlgebra A G) : ((SkewMonoidAlgebra.domCongrAlg k A he) f).support = Finset.map (↑e).toEmbedding f.support - SkewPolynomial.support_eq_skewMonoidAlgebra_support 📋 Mathlib.Algebra.SkewPolynomial.Basic
{R : Type u_1} [Semiring R] (p : SkewPolynomial R) : p.support = Finset.map Multiplicative.toAdd.toEmbedding (SkewMonoidAlgebra.support p) - FormalMultilinearSeries.changeOriginIndexEquiv_symm_apply_snd_snd_coe 📋 Mathlib.Analysis.Analytic.ChangeOrigin
(s : (n : ℕ) × Finset (Fin n)) : ↑(FormalMultilinearSeries.changeOriginIndexEquiv.symm s).snd.snd = Finset.map (finCongr ⋯).toEmbedding s.snd - SimpleGraph.Iso.toEmbedding_completeGraph 📋 Mathlib.Combinatorics.SimpleGraph.Maps
{α : Type u_5} {β : Type u_6} (f : α ≃ β) : (SimpleGraph.Iso.completeGraph f).toEmbedding = SimpleGraph.Embedding.completeGraph f.toEmbedding - SimpleGraph.comap_symm 📋 Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (G : SimpleGraph V) (e : V ≃ W) : SimpleGraph.comap (⇑e.symm.toEmbedding) G = SimpleGraph.map (⇑e.toEmbedding) G - SimpleGraph.map_symm 📋 Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (G : SimpleGraph W) (e : V ≃ W) : SimpleGraph.map (⇑e.symm.toEmbedding) G = SimpleGraph.comap (⇑e.toEmbedding) G - Finpartition.parts_map 📋 Mathlib.Order.Partition.Finpartition
{α : Type u_1} [Lattice α] [OrderBot α] {β : Type u_2} [Lattice β] [OrderBot β] {a : α} {e : α ≃o β} {P : Finpartition a} : (Finpartition.map e P).parts = Finset.map (↑e).toEmbedding P.parts - SimpleGraph.cliqueSet_map_of_equiv 📋 Mathlib.Combinatorics.SimpleGraph.Clique
{α : Type u_1} {β : Type u_2} (G : SimpleGraph α) (e : α ≃ β) (n : ℕ) : (SimpleGraph.map (⇑e) G).cliqueSet n = Finset.map e.toEmbedding '' G.cliqueSet n - SimpleGraph.cliqueFinset_map_of_equiv 📋 Mathlib.Combinatorics.SimpleGraph.Clique
{α : Type u_1} {β : Type u_2} (G : SimpleGraph α) [Fintype α] [DecidableEq α] [DecidableRel G.Adj] [Fintype β] [DecidableEq β] (e : α ≃ β) (n : ℕ) : (SimpleGraph.map (⇑e) G).cliqueFinset n = Finset.map { toFun := Finset.map e.toEmbedding, inj' := ⋯ } (G.cliqueFinset n) - Finset.map_truncatedInf 📋 Mathlib.Combinatorics.SetFamily.AhlswedeZhang
{α : Type u_1} {β : Type u_2} [SemilatticeInf α] [SemilatticeInf β] [BoundedOrder β] [DecidableLE β] [DecidableLE α] [BoundedOrder α] (e : α ≃o β) (s : Finset α) (a : α) : e (s.truncatedInf a) = (Finset.map e.toEmbedding s).truncatedInf (e a) - Finset.map_truncatedSup 📋 Mathlib.Combinatorics.SetFamily.AhlswedeZhang
{α : Type u_1} {β : Type u_2} [SemilatticeSup α] [SemilatticeSup β] [BoundedOrder β] [DecidableLE α] [OrderTop α] [DecidableLE β] (e : α ≃o β) (s : Finset α) (a : α) : e (s.truncatedSup a) = (Finset.map e.toEmbedding s).truncatedSup (e a) - SimpleGraph.coe_recolorOfEquiv 📋 Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex
{V : Type u} (G : SimpleGraph V) {α : Type u_2} {β : Type u_3} (f : α ≃ β) : ⇑(G.recolorOfEquiv f) = (SimpleGraph.Embedding.completeGraph f.toEmbedding).toHom.comp - Multiset.uIcc_eq 📋 Mathlib.Data.Multiset.Interval
{α : Type u_1} [DecidableEq α] (s t : Multiset α) : Finset.uIcc s t = Finset.map Multiset.equivDFinsupp.symm.toEmbedding (Finset.uIcc (Multiset.toDFinsupp s) (Multiset.toDFinsupp t)) - Multiset.Icc_eq 📋 Mathlib.Data.Multiset.Interval
{α : Type u_1} [DecidableEq α] (s t : Multiset α) : Finset.Icc s t = Finset.map Multiset.equivDFinsupp.symm.toEmbedding (Finset.Icc (Multiset.toDFinsupp s) (Multiset.toDFinsupp t)) - Sum.Lex.Ici_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderTop α] [Fintype β] [LocallyFiniteOrderTop β] (a : α) : Finset.Ici (Sum.inlₗ a) = Finset.map toLex.toEmbedding ((Finset.Ici a).disjSum Finset.univ) - Sum.Lex.Iic_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [Fintype α] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (b : β) : Finset.Iic (Sum.inrₗ b) = Finset.map toLex.toEmbedding (Finset.univ.disjSum (Finset.Iic b)) - Sum.Lex.Iio_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [Fintype α] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (b : β) : Finset.Iio (Sum.inrₗ b) = Finset.map toLex.toEmbedding (Finset.univ.disjSum (Finset.Iio b)) - Sum.Lex.Ioi_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderTop α] [Fintype β] [LocallyFiniteOrderTop β] (a : α) : Finset.Ioi (Sum.inlₗ a) = Finset.map toLex.toEmbedding ((Finset.Ioi a).disjSum Finset.univ) - Sum.Lex.Ici_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderTop α] [Fintype β] [LocallyFiniteOrderTop β] (b : β) : Finset.Ici (Sum.inrₗ b) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Ici b) - Sum.Lex.Iic_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [Fintype α] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (a : α) : Finset.Iic (Sum.inlₗ a) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Iic a) - Sum.Lex.Iio_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [Fintype α] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (a : α) : Finset.Iio (Sum.inlₗ a) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Iio a) - Sum.Lex.Ioi_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderTop α] [Fintype β] [LocallyFiniteOrderTop β] (b : β) : Finset.Ioi (Sum.inrₗ b) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Ioi b) - Sum.Lex.Icc_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Icc (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ici a).disjSum (Finset.Iic b)) - Sum.Lex.Ico_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Ico (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ici a).disjSum (Finset.Iio b)) - Sum.Lex.Ioc_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Ioc (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ioi a).disjSum (Finset.Iic b)) - Sum.Lex.Ioo_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Ioo (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ioi a).disjSum (Finset.Iio b)) - Sum.Lex.Icc_inl_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a₁ a₂ : α) : Finset.Icc (Sum.inlₗ a₁) (Sum.inlₗ a₂) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Icc a₁ a₂) - Sum.Lex.Icc_inr_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (b₁ b₂ : β) : Finset.Icc (Sum.inrₗ b₁) (Sum.inrₗ b₂) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Icc b₁ b₂) - Sum.Lex.Ico_inl_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a₁ a₂ : α) : Finset.Ico (Sum.inlₗ a₁) (Sum.inlₗ a₂) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Ico a₁ a₂) - Sum.Lex.Ico_inr_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (b₁ b₂ : β) : Finset.Ico (Sum.inrₗ b₁) (Sum.inrₗ b₂) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Ico b₁ b₂) - Sum.Lex.Ioc_inl_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a₁ a₂ : α) : Finset.Ioc (Sum.inlₗ a₁) (Sum.inlₗ a₂) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Ioc a₁ a₂) - Sum.Lex.Ioc_inr_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (b₁ b₂ : β) : Finset.Ioc (Sum.inrₗ b₁) (Sum.inrₗ b₂) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Ioc b₁ b₂) - Sum.Lex.Ioo_inl_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a₁ a₂ : α) : Finset.Ioo (Sum.inlₗ a₁) (Sum.inlₗ a₂) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Ioo a₁ a₂) - Sum.Lex.Ioo_inr_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (b₁ b₂ : β) : Finset.Ioo (Sum.inrₗ b₁) (Sum.inrₗ b₂) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Ioo b₁ b₂) - Affine.Simplex.excenterExists_reindex 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {m n : ℕ} [NeZero m] [NeZero n] (s : Affine.Simplex ℝ P n) {e : Fin (n + 1) ≃ Fin (m + 1)} {signs : Finset (Fin (m + 1))} : (s.reindex e).ExcenterExists signs ↔ s.ExcenterExists (Finset.map e.symm.toEmbedding signs) - Affine.Simplex.excenter_reindex 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {m n : ℕ} [NeZero m] [NeZero n] (s : Affine.Simplex ℝ P n) (e : Fin (n + 1) ≃ Fin (m + 1)) (signs : Finset (Fin (m + 1))) : (s.reindex e).excenter signs = s.excenter (Finset.map e.symm.toEmbedding signs) - Affine.Simplex.exradius_reindex 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {m n : ℕ} [NeZero m] [NeZero n] (s : Affine.Simplex ℝ P n) (e : Fin (n + 1) ≃ Fin (m + 1)) (signs : Finset (Fin (m + 1))) : (s.reindex e).exradius signs = s.exradius (Finset.map e.symm.toEmbedding signs) - Affine.Simplex.exsphere_reindex 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {m n : ℕ} [NeZero m] [NeZero n] (s : Affine.Simplex ℝ P n) (e : Fin (n + 1) ≃ Fin (m + 1)) (signs : Finset (Fin (m + 1))) : (s.reindex e).exsphere signs = s.exsphere (Finset.map e.symm.toEmbedding signs) - Affine.Simplex.touchpoint_reindex 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {m n : ℕ} [NeZero m] [NeZero n] (s : Affine.Simplex ℝ P n) (e : Fin (n + 1) ≃ Fin (m + 1)) (signs : Finset (Fin (m + 1))) (i : Fin (m + 1)) : (s.reindex e).touchpoint signs i = s.touchpoint (Finset.map e.symm.toEmbedding signs) (e.symm i) - Affine.Simplex.excenterWeightsUnnorm_reindex 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {m n : ℕ} [NeZero m] [NeZero n] (s : Affine.Simplex ℝ P n) (e : Fin (n + 1) ≃ Fin (m + 1)) (signs : Finset (Fin (m + 1))) : (s.reindex e).excenterWeightsUnnorm signs = s.excenterWeightsUnnorm (Finset.map e.symm.toEmbedding signs) ∘ ⇑e.symm - Affine.Simplex.excenterWeights_reindex 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {m n : ℕ} [NeZero m] [NeZero n] (s : Affine.Simplex ℝ P n) (e : Fin (n + 1) ≃ Fin (m + 1)) (signs : Finset (Fin (m + 1))) : (s.reindex e).excenterWeights signs = s.excenterWeights (Finset.map e.symm.toEmbedding signs) ∘ ⇑e.symm - Affine.Simplex.touchpointWeights_reindex 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {m n : ℕ} [NeZero m] [NeZero n] (s : Affine.Simplex ℝ P n) (e : Fin (n + 1) ≃ Fin (m + 1)) (signs : Finset (Fin (m + 1))) (i : Fin (m + 1)) : (s.reindex e).touchpointWeights signs i = s.touchpointWeights (Finset.map e.symm.toEmbedding signs) (e.symm i) ∘ ⇑e.symm - Function.Embedding.smul_def 📋 Mathlib.GroupTheory.GroupAction.Embedding
{G : Type u_1} {α : Type u_3} {β : Type u_4} [Group G] [MulAction G β] (g : G) (f : α ↪ β) : g • f = f.trans (Equiv.toEmbedding (MulAction.toPerm g)) - Function.Embedding.vadd_def 📋 Mathlib.GroupTheory.GroupAction.Embedding
{G : Type u_1} {α : Type u_3} {β : Type u_4} [AddGroup G] [AddAction G β] (g : G) (f : α ↪ β) : g +ᵥ f = f.trans (Equiv.toEmbedding (AddAction.toPerm g)) - Equiv.Perm.cycleFactorsFinset_conj 📋 Mathlib.GroupTheory.Perm.ConjAct
{α : Type u_1} [DecidableEq α] [Fintype α] (g k : Equiv.Perm α) : (ConjAct.toConjAct k • g).cycleFactorsFinset = Finset.map (MulAut.conj k).toEmbedding g.cycleFactorsFinset
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