Loogle!
Result
Found 70 declarations mentioning Sum.map.
- Sum.map π Init.Data.Sum.Basic
{Ξ± : Type u_1} {Ξ±' : Type u_2} {Ξ² : Type u_3} {Ξ²' : Type u_4} (f : Ξ± β Ξ±') (g : Ξ² β Ξ²') : Ξ± β Ξ² β Ξ±' β Ξ²' - Sum.map_inl π Init.Data.Sum.Basic
{Ξ± : Type u_1} {Ξ±' : Type u_2} {Ξ² : Type u_3} {Ξ²' : Type u_4} (f : Ξ± β Ξ±') (g : Ξ² β Ξ²') (x : Ξ±) : Sum.map f g (Sum.inl x) = Sum.inl (f x) - Sum.map_inr π Init.Data.Sum.Basic
{Ξ± : Type u_1} {Ξ±' : Type u_2} {Ξ² : Type u_3} {Ξ²' : Type u_4} (f : Ξ± β Ξ±') (g : Ξ² β Ξ²') (x : Ξ²) : Sum.map f g (Sum.inr x) = Sum.inr (g x) - Sum.map_id_id π Init.Data.Sum.Lemmas
{Ξ± : Type u_1} {Ξ² : Type u_2} : Sum.map id id = id - Sum.isLeft_map π Init.Data.Sum.Lemmas
{Ξ± : Type u_1} {Ξ² : Type u_2} {Ξ³ : Type u_3} {Ξ΄ : Type u_4} (f : Ξ± β Ξ²) (g : Ξ³ β Ξ΄) (x : Ξ± β Ξ³) : (Sum.map f g x).isLeft = x.isLeft - Sum.isRight_map π Init.Data.Sum.Lemmas
{Ξ± : Type u_1} {Ξ² : Type u_2} {Ξ³ : Type u_3} {Ξ΄ : Type u_4} (f : Ξ± β Ξ²) (g : Ξ³ β Ξ΄) (x : Ξ± β Ξ³) : (Sum.map f g x).isRight = x.isRight - Sum.getLeft?_map π Init.Data.Sum.Lemmas
{Ξ± : Type u_1} {Ξ² : Type u_2} {Ξ³ : Type u_3} {Ξ΄ : Type u_4} (f : Ξ± β Ξ²) (g : Ξ³ β Ξ΄) (x : Ξ± β Ξ³) : (Sum.map f g x).getLeft? = Option.map f x.getLeft? - Sum.getRight?_map π Init.Data.Sum.Lemmas
{Ξ± : Type u_1} {Ξ² : Type u_2} {Ξ³ : Type u_3} {Ξ΄ : Type u_4} (f : Ξ± β Ξ²) (g : Ξ³ β Ξ΄) (x : Ξ± β Ξ³) : (Sum.map f g x).getRight? = Option.map g x.getRight? - Sum.elim_map π Init.Data.Sum.Lemmas
{Ξ± : Type u_1} {Ξ² : Type u_2} {Ξ΅ : Sort u_3} {Ξ³ : Type u_4} {Ξ΄ : Type u_5} {fβ : Ξ± β Ξ²} {fβ : Ξ² β Ξ΅} {gβ : Ξ³ β Ξ΄} {gβ : Ξ΄ β Ξ΅} {x : Ξ± β Ξ³} : Sum.elim fβ gβ (Sum.map fβ gβ x) = Sum.elim (fβ β fβ) (gβ β gβ) x - Sum.map_map π Init.Data.Sum.Lemmas
{Ξ±' : Type u_1} {Ξ±'' : Type u_2} {Ξ²' : Type u_3} {Ξ²'' : Type u_4} {Ξ± : Type u_5} {Ξ² : Type u_6} (f' : Ξ±' β Ξ±'') (g' : Ξ²' β Ξ²'') (f : Ξ± β Ξ±') (g : Ξ² β Ξ²') (x : Ξ± β Ξ²) : Sum.map f' g' (Sum.map f g x) = Sum.map (f' β f) (g' β g) x - Sum.elim_comp_map π Init.Data.Sum.Lemmas
{Ξ± : Type u_1} {Ξ² : Type u_2} {Ξ΅ : Sort u_3} {Ξ³ : Type u_4} {Ξ΄ : Type u_5} {fβ : Ξ± β Ξ²} {fβ : Ξ² β Ξ΅} {gβ : Ξ³ β Ξ΄} {gβ : Ξ΄ β Ξ΅} : Sum.elim fβ gβ β Sum.map fβ gβ = Sum.elim (fβ β fβ) (gβ β gβ) - Sum.map_comp_map π Init.Data.Sum.Lemmas
{Ξ±' : Type u_1} {Ξ±'' : Type u_2} {Ξ²' : Type u_3} {Ξ²'' : Type u_4} {Ξ± : Type u_5} {Ξ² : Type u_6} (f' : Ξ±' β Ξ±'') (g' : Ξ²' β Ξ²'') (f : Ξ± β Ξ±') (g : Ξ² β Ξ²') : Sum.map f' g' β Sum.map f g = Sum.map (f' β f) (g' β g) - Function.Bijective.sumMap π Mathlib.Data.Sum.Basic
{Ξ± : Type u} {Ξ±' : Type w} {Ξ² : Type v} {Ξ²' : Type x} {f : Ξ± β Ξ²} {g : Ξ±' β Ξ²'} (hf : Function.Bijective f) (hg : Function.Bijective g) : Function.Bijective (Sum.map f g) - Function.Injective.sumMap π Mathlib.Data.Sum.Basic
{Ξ± : Type u} {Ξ±' : Type w} {Ξ² : Type v} {Ξ²' : Type x} {f : Ξ± β Ξ²} {g : Ξ±' β Ξ²'} (hf : Function.Injective f) (hg : Function.Injective g) : Function.Injective (Sum.map f g) - Function.Surjective.sumMap π Mathlib.Data.Sum.Basic
{Ξ± : Type u} {Ξ±' : Type w} {Ξ² : Type v} {Ξ²' : Type x} {f : Ξ± β Ξ²} {g : Ξ±' β Ξ²'} (hf : Function.Surjective f) (hg : Function.Surjective g) : Function.Surjective (Sum.map f g) - Sum.map_bijective π Mathlib.Data.Sum.Basic
{Ξ± : Type u} {Ξ² : Type v} {Ξ³ : Type u_1} {Ξ΄ : Type u_2} {f : Ξ± β Ξ³} {g : Ξ² β Ξ΄} : Function.Bijective (Sum.map f g) β Function.Bijective f β§ Function.Bijective g - Sum.map_injective π Mathlib.Data.Sum.Basic
{Ξ± : Type u} {Ξ² : Type v} {Ξ³ : Type u_1} {Ξ΄ : Type u_2} {f : Ξ± β Ξ³} {g : Ξ² β Ξ΄} : Function.Injective (Sum.map f g) β Function.Injective f β§ Function.Injective g - Sum.map_surjective π Mathlib.Data.Sum.Basic
{Ξ± : Type u} {Ξ² : Type v} {Ξ³ : Type u_1} {Ξ΄ : Type u_2} {f : Ξ± β Ξ³} {g : Ξ² β Ξ΄} : Function.Surjective (Sum.map f g) β Function.Surjective f β§ Function.Surjective g - Equiv.Perm.sumCongr_apply π Mathlib.Logic.Equiv.Sum
{Ξ± : Type u_9} {Ξ² : Type u_10} (ea : Equiv.Perm Ξ±) (eb : Equiv.Perm Ξ²) (x : Ξ± β Ξ²) : (ea.sumCongr eb) x = Sum.map (βea) (βeb) x - Equiv.sumCongr_apply π Mathlib.Logic.Equiv.Sum
{Ξ±β : Type u_9} {Ξ±β : Type u_10} {Ξ²β : Type u_11} {Ξ²β : Type u_12} (ea : Ξ±β β Ξ±β) (eb : Ξ²β β Ξ²β) (aβ : Ξ±β β Ξ²β) : (ea.sumCongr eb) aβ = Sum.map (βea) (βeb) aβ - Equiv.sigmaSumDistrib_apply π Mathlib.Logic.Equiv.Sum
{ΞΉ : Type u_11} (Ξ± : ΞΉ β Type u_9) (Ξ² : ΞΉ β Type u_10) (p : (i : ΞΉ) Γ (Ξ± i β Ξ² i)) : (Equiv.sigmaSumDistrib Ξ± Ξ²) p = Sum.map (Sigma.mk p.fst) (Sigma.mk p.fst) p.snd - Equiv.sumSumSumComm_apply π Mathlib.Logic.Equiv.Sum
(Ξ± : Type u_9) (Ξ² : Type u_10) (Ξ³ : Type u_11) (Ξ΄ : Type u_12) (aβ : (Ξ± β Ξ²) β Ξ³ β Ξ΄) : (Equiv.sumSumSumComm Ξ± Ξ² Ξ³ Ξ΄) aβ = (β(Equiv.sumAssoc (Ξ± β Ξ³) Ξ² Ξ΄) β Sum.map (β(Equiv.sumAssoc Ξ± Ξ³ Ξ²).symm) id β Sum.map (Sum.map id β(Equiv.sumComm Ξ² Ξ³)) id β Sum.map (β(Equiv.sumAssoc Ξ± Ξ² Ξ³)) id β β(Equiv.sumAssoc (Ξ± β Ξ²) Ξ³ Ξ΄).symm) aβ - Function.Embedding.coe_sumMap π Mathlib.Logic.Embedding.Basic
{Ξ± : Type u_1} {Ξ² : Type u_2} {Ξ³ : Type u_3} {Ξ΄ : Type u_4} (eβ : Ξ± βͺ Ξ²) (eβ : Ξ³ βͺ Ξ΄) : β(eβ.sumMap eβ) = Sum.map βeβ βeβ - RelEmbedding.sumLexMap_apply π Mathlib.Order.RelIso.Basic
{Ξ± : Type u_1} {Ξ² : Type u_2} {Ξ³ : Type u_3} {Ξ΄ : Type u_4} {r : Ξ± β Ξ± β Prop} {s : Ξ² β Ξ² β Prop} {t : Ξ³ β Ξ³ β Prop} {u : Ξ΄ β Ξ΄ β Prop} (f : r βͺr s) (g : t βͺr u) (aβ : Ξ± β Ξ³) : (f.sumLexMap g) aβ = Sum.map (βf) (βg) aβ - RelEmbedding.sumLiftRelMap_apply π Mathlib.Order.RelIso.Basic
{Ξ± : Type u_1} {Ξ² : Type u_2} {Ξ³ : Type u_3} {Ξ΄ : Type u_4} {r : Ξ± β Ξ± β Prop} {s : Ξ² β Ξ² β Prop} {t : Ξ³ β Ξ³ β Prop} {u : Ξ΄ β Ξ΄ β Prop} (f : r βͺr s) (g : t βͺr u) (aβ : Ξ± β Ξ³) : (f.sumLiftRelMap g) aβ = Sum.map (βf) (βg) aβ - OrderIso.sumCongr_apply π Mathlib.Order.Sum.Order
{Ξ±β : Type u_4} {Ξ±β : Type u_5} {Ξ²β : Type u_6} {Ξ²β : Type u_7} [LE Ξ±β] [LE Ξ±β] [LE Ξ²β] [LE Ξ²β] (ea : Ξ±β βo Ξ±β) (eb : Ξ²β βo Ξ²β) (aβ : Ξ±β β Ξ²β) : (ea.sumCongr eb) aβ = Sum.map (βea) (βeb) aβ - OrderIso.sumLexCongr_apply π Mathlib.Order.Sum.Order
{Ξ±β : Type u_4} {Ξ±β : Type u_5} {Ξ²β : Type u_6} {Ξ²β : Type u_7} [LE Ξ±β] [LE Ξ±β] [LE Ξ²β] [LE Ξ²β] (ea : Ξ±β βo Ξ±β) (eb : Ξ²β βo Ξ²β) (aβ : Ξ±β ββ Ξ²β) : (ea.sumLexCongr eb) aβ = toLex (Sum.map (βea) (βeb) (ofLex aβ)) - Prod.Lex.sumLexProdLexDistrib_apply π Mathlib.Order.Hom.Lex
(Ξ± : Type u_4) (Ξ² : Type u_5) (Ξ³ : Type u_6) [Preorder Ξ±] [Preorder Ξ²] [Preorder Ξ³] (aβ : Lex ((Ξ± ββ Ξ²) Γ Ξ³)) : (Prod.Lex.sumLexProdLexDistrib Ξ± Ξ² Ξ³) aβ = toLex (Sum.map (βtoLex) (βtoLex) ((Equiv.sumProdDistrib Ξ± Ξ² Ξ³) (Prod.map (βofLex) id (ofLex aβ)))) - Prod.Lex.sumLexProdLexDistrib_symm_apply π Mathlib.Order.Hom.Lex
(Ξ± : Type u_4) (Ξ² : Type u_5) (Ξ³ : Type u_6) [Preorder Ξ±] [Preorder Ξ²] [Preorder Ξ³] (aβ : Lex (Ξ± Γ Ξ³) ββ Lex (Ξ² Γ Ξ³)) : (RelIso.symm (Prod.Lex.sumLexProdLexDistrib Ξ± Ξ² Ξ³)) aβ = toLex (Prod.map (βtoLex) id ((Equiv.sumProdDistrib Ξ± Ξ² Ξ³).symm (Sum.map (βofLex) (βofLex) (ofLex aβ)))) - MvPolynomial.exists_fin_left_rename π Mathlib.Algebra.MvPolynomial.Rename
{Ο : Type u_1} {Ο : Type u_2} {R : Type u_4} [CommSemiring R] (p : MvPolynomial (Ο β Ο) R) : β n f, β (_ : Function.Injective f), β q, p = (MvPolynomial.rename (Sum.map f id)) q - MvPolynomial.exists_fin_right_rename π Mathlib.Algebra.MvPolynomial.Rename
{Ο : Type u_1} {Ο : Type u_2} {R : Type u_4} [CommSemiring R] (p : MvPolynomial (Ο β Ο) R) : β n f, β (_ : Function.Injective f), β q, p = (MvPolynomial.rename (Sum.map id f)) q - MvPolynomial.exists_finset_left_rename π Mathlib.Algebra.MvPolynomial.Rename
{Ο : Type u_1} {Ο : Type u_2} {R : Type u_4} [CommSemiring R] (p : MvPolynomial (Ο β Ο) R) : β t q, p = (MvPolynomial.rename (Sum.map Subtype.val id)) q - MvPolynomial.exists_finset_right_rename π Mathlib.Algebra.MvPolynomial.Rename
{Ο : Type u_1} {Ο : Type u_2} {R : Type u_4} [CommSemiring R] (p : MvPolynomial (Ο β Ο) R) : β t q, p = (MvPolynomial.rename (Sum.map id Subtype.val)) q - Prefunctor.symmetrify_map π Mathlib.Combinatorics.Quiver.Symmetric
{U : Type u_1} {V : Type u_2} [Quiver U] [Quiver V] (Ο : U β₯€q V) {Xβ Yβ : Quiver.Symmetrify U} (aβ : (Xβ βΆ Yβ) β (Yβ βΆ Xβ)) : Ο.symmetrify.map aβ = Sum.map Ο.map Ο.map aβ - Continuous.sumMap π Mathlib.Topology.Constructions.SumProd
{X : Type u} {Y : Type v} {W : Type u_1} {Z : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace W] [TopologicalSpace Z] {f : X β Y} {g : Z β W} (hf : Continuous f) (hg : Continuous g) : Continuous (Sum.map f g) - IsClosedMap.sumMap π Mathlib.Topology.Constructions.SumProd
{X : Type u} {Y : Type v} {W : Type u_1} {Z : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace W] [TopologicalSpace Z] {f : X β Y} {g : Z β W} (hf : IsClosedMap f) (hg : IsClosedMap g) : IsClosedMap (Sum.map f g) - IsOpenMap.sumMap π Mathlib.Topology.Constructions.SumProd
{X : Type u} {Y : Type v} {W : Type u_1} {Z : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace W] [TopologicalSpace Z] {f : X β Y} {g : Z β W} (hf : IsOpenMap f) (hg : IsOpenMap g) : IsOpenMap (Sum.map f g) - continuous_sumMap π Mathlib.Topology.Constructions.SumProd
{X : Type u} {Y : Type v} {W : Type u_1} {Z : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace W] [TopologicalSpace Z] {f : X β Y} {g : Z β W} : Continuous (Sum.map f g) β Continuous f β§ Continuous g - IsHomeomorph.sumMap π Mathlib.Topology.Homeomorph.Lemmas
{X : Type u_1} {Y : Type u_2} {Z : Type u_4} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace Z] {W : Type u_5} [TopologicalSpace W] {f : X β Y} {g : Z β W} (hf : IsHomeomorph f) (hg : IsHomeomorph g) : IsHomeomorph (Sum.map f g) - Sum.smul_def π Mathlib.Algebra.Group.Action.Sum
{M : Type u_1} {Ξ± : Type u_3} {Ξ² : Type u_4} [SMul M Ξ±] [SMul M Ξ²] (a : M) (x : Ξ± β Ξ²) : a β’ x = Sum.map (fun x => a β’ x) (fun x => a β’ x) x - Sum.vadd_def π Mathlib.Algebra.Group.Action.Sum
{M : Type u_1} {Ξ± : Type u_3} {Ξ² : Type u_4} [VAdd M Ξ±] [VAdd M Ξ²] (a : M) (x : Ξ± β Ξ²) : a +α΅₯ x = Sum.map (fun x => a +α΅₯ x) (fun x => a +α΅₯ x) x - Measurable.sumMap π Mathlib.MeasureTheory.MeasurableSpace.Constructions
{Ξ± : Type u_1} {Ξ² : Type u_2} {Ξ³ : Type u_3} {Ξ΄ : Type u_4} {m : MeasurableSpace Ξ±} {mΞ² : MeasurableSpace Ξ²} {xβ : MeasurableSpace Ξ³} {xβΒΉ : MeasurableSpace Ξ΄} {f : Ξ± β Ξ²} {g : Ξ³ β Ξ΄} (hf : Measurable f) (hg : Measurable g) : Measurable (Sum.map f g) - ContMDiff.sumMap π Mathlib.Geometry.Manifold.ContMDiff.Constructions
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {H : Type u_3} [TopologicalSpace H] {I : ModelWithCorners π E H} {M : Type u_4} [TopologicalSpace M] [ChartedSpace H M] {M' : Type u_16} [TopologicalSpace M'] [ChartedSpace H M'] {n : WithTop ββ} {E' : Type u_17} [NormedAddCommGroup E'] [NormedSpace π E'] {H' : Type u_18} [TopologicalSpace H'] {J : ModelWithCorners π E' H'} {N : Type u_20} {N' : Type u_21} [TopologicalSpace N] [TopologicalSpace N'] [ChartedSpace H' N] [ChartedSpace H' N'] {f : M β N} {g : M' β N'} (hf : ContMDiff I J n f) (hg : ContMDiff I J n g) : ContMDiff I J n (Sum.map f g) - contMDiff_sum_map π Mathlib.Geometry.Manifold.ContMDiff.Constructions
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {H : Type u_3} [TopologicalSpace H] {I : ModelWithCorners π E H} {M : Type u_4} [TopologicalSpace M] [ChartedSpace H M] {M' : Type u_16} [TopologicalSpace M'] [ChartedSpace H M'] {n : WithTop ββ} {E' : Type u_17} [NormedAddCommGroup E'] [NormedSpace π E'] {H' : Type u_18} [TopologicalSpace H'] {J : ModelWithCorners π E' H'} {N : Type u_20} {N' : Type u_21} [TopologicalSpace N] [TopologicalSpace N'] [ChartedSpace H' N] [ChartedSpace H' N'] {f : M β N} {g : M' β N'} : ContMDiff I J n (Sum.map f g) β ContMDiff I J n f β§ ContMDiff I J n g - Diffeomorph.sumCongr_coe π Mathlib.Geometry.Manifold.Diffeomorph
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {E' : Type u_3} [NormedAddCommGroup E'] [NormedSpace π E'] {H : Type u_5} [TopologicalSpace H] {I : ModelWithCorners π E H} {M : Type u_9} [TopologicalSpace M] [ChartedSpace H M] {n : WithTop ββ} {M' : Type u_13} [TopologicalSpace M'] [ChartedSpace H M'] {N : Type u_15} [TopologicalSpace N] [ChartedSpace H N] {J : ModelWithCorners π E' H} {N' : Type u_17} [TopologicalSpace N'] [ChartedSpace H N'] (Ο : Diffeomorph I J M N n) (Ο : Diffeomorph I J M' N' n) : β(Ο.sumCongr Ο) = Sum.map βΟ βΟ - CategoryTheory.FunctorToTypes.coprod_map π Mathlib.CategoryTheory.Limits.Shapes.FunctorToTypes
{C : Type u} [CategoryTheory.Category.{v, u} C] (F G : CategoryTheory.Functor C (Type w)) {Xβ Yβ : C} (f : Xβ βΆ Yβ) : (CategoryTheory.FunctorToTypes.coprod F G).map f = TypeCat.ofHom (Sum.map β(CategoryTheory.ConcreteCategory.hom (F.map f)) β(CategoryTheory.ConcreteCategory.hom (G.map f))) - CategoryTheory.FunctorToTypes.binaryCoproductCocone_pt_map_hom_apply π Mathlib.CategoryTheory.Limits.Shapes.FunctorToTypes
{C : Type u} [CategoryTheory.Category.{v, u} C] (F G : CategoryTheory.Functor C (Type w)) {Xβ Yβ : C} (f : Xβ βΆ Yβ) (aβ : F.obj Xβ β G.obj Xβ) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.FunctorToTypes.binaryCoproductCocone F G).pt.map f)) aβ = Sum.map (β(CategoryTheory.ConcreteCategory.hom (F.map f))) (β(CategoryTheory.ConcreteCategory.hom (G.map f))) aβ - SimpleGraph.completeBipartiteGraphCongr_apply π Mathlib.Combinatorics.SimpleGraph.Maps
{Vβ : Type u_5} {Vβ : Type u_6} {Wβ : Type u_7} {Wβ : Type u_8} (hV : Vβ β Vβ) (hW : Wβ β Wβ) (aβ : Vβ β Wβ) : (SimpleGraph.completeBipartiteGraphCongr hV hW) aβ = Sum.map (βhV) (βhW) aβ - SimpleGraph.completeBipartiteGraphCongr_symm_apply π Mathlib.Combinatorics.SimpleGraph.Maps
{Vβ : Type u_5} {Vβ : Type u_6} {Wβ : Type u_7} {Wβ : Type u_8} (hV : Vβ β Vβ) (hW : Wβ β Wβ) (aβ : Vβ β Wβ) : (RelIso.symm (SimpleGraph.completeBipartiteGraphCongr hV hW)) aβ = Sum.map (βhV.symm) (βhW.symm) aβ - Prefunctor.symmetrifyCostar π Mathlib.Combinatorics.Quiver.Covering
{U : Type u_1} [Quiver U] {V : Type u_2} [Quiver V] (Ο : U β₯€q V) (u : U) : Ο.symmetrify.costar u = β(Quiver.symmetrifyCostar (Ο.obj u)).symm β Sum.map (Ο.costar u) (Ο.star u) β β(Quiver.symmetrifyCostar u) - Prefunctor.symmetrifyStar π Mathlib.Combinatorics.Quiver.Covering
{U : Type u_1} [Quiver U] {V : Type u_2} [Quiver V] (Ο : U β₯€q V) (u : U) : Ο.symmetrify.star u = β(Quiver.symmetrifyStar (Ο.obj u)).symm β Sum.map (Ο.star u) (Ο.costar u) β β(Quiver.symmetrifyStar u) - SimpleGraph.Embedding.sum_apply π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (f : G βͺg G') (g : H βͺg H') (aβ : V β W) : (f.sum g) aβ = Sum.map (βf) (βg) aβ - SimpleGraph.Hom.sum_apply π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (f : G βg G') (g : H βg H') (aβ : V β W) : (f.sum g) aβ = Sum.map (βf) (βg) aβ - SimpleGraph.Iso.sumCongr_apply π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (f : G βg G') (g : H βg H') (aβ : V β W) : (f.sumCongr g) aβ = Sum.map (βf) (βg) aβ - SimpleGraph.Iso.sumCongr_symm_apply π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (f : G βg G') (g : H βg H') (aβ : V' β W') : (RelIso.symm (f.sumCongr g)) aβ = Sum.map (βf.symm) (βg.symm) aβ - SimpleGraph.Iso.sumBoxProdDistrib_apply π Mathlib.Combinatorics.SimpleGraph.Prod
{Vβ : Type u_5} {Vβ : Type u_6} {W : Type u_7} (Gβ : SimpleGraph Vβ) (Gβ : SimpleGraph Vβ) (H : SimpleGraph W) (p : (Vβ β Vβ) Γ W) : (SimpleGraph.Iso.sumBoxProdDistrib Gβ Gβ H) p = Sum.map (fun x => (x, p.2)) (fun x => (x, p.2)) p.1 - SimpleGraph.Iso.boxProdSumDistrib_apply π Mathlib.Combinatorics.SimpleGraph.Prod
{V : Type u_4} {Wβ : Type u_8} {Wβ : Type u_9} (G : SimpleGraph V) (Hβ : SimpleGraph Wβ) (Hβ : SimpleGraph Wβ) (aβ : V Γ (Wβ β Wβ)) : (SimpleGraph.Iso.boxProdSumDistrib G Hβ Hβ) aβ = Sum.map Prod.swap Prod.swap ((Equiv.sumProdDistrib Wβ Wβ V) aβ.swap) - SimpleGraph.Iso.boxProdSumDistrib_symm_apply π Mathlib.Combinatorics.SimpleGraph.Prod
{V : Type u_4} {Wβ : Type u_8} {Wβ : Type u_9} (G : SimpleGraph V) (Hβ : SimpleGraph Wβ) (Hβ : SimpleGraph Wβ) (aβ : V Γ Wβ β V Γ Wβ) : (RelIso.symm (SimpleGraph.Iso.boxProdSumDistrib G Hβ Hβ)) aβ = ((Equiv.sumProdDistrib Wβ Wβ V).symm (Sum.map Prod.swap Prod.swap aβ)).swap - FirstOrder.Language.LHom.sumMap_onFunction π Mathlib.ModelTheory.LanguageMap
{L : FirstOrder.Language} {L' : FirstOrder.Language} (Ο : L βα΄Έ L') {Lβ : FirstOrder.Language} {Lβ : FirstOrder.Language} (Ο : Lβ βα΄Έ Lβ) (_n : β) (aβ : L.Functions _n β Lβ.Functions _n) : (Ο.sumMap Ο).onFunction aβ = Sum.map (fun f => Ο.onFunction f) (fun f => Ο.onFunction f) aβ - FirstOrder.Language.LHom.sumMap_onRelation π Mathlib.ModelTheory.LanguageMap
{L : FirstOrder.Language} {L' : FirstOrder.Language} (Ο : L βα΄Έ L') {Lβ : FirstOrder.Language} {Lβ : FirstOrder.Language} (Ο : Lβ βα΄Έ Lβ) (_n : β) (aβ : L.Relations _n β Lβ.Relations _n) : (Ο.sumMap Ο).onRelation aβ = Sum.map (fun f => Ο.onRelation f) (fun f => Ο.onRelation f) aβ - FirstOrder.Language.BoundedFormula.relabelAux_sumInl π Mathlib.ModelTheory.Syntax
{Ξ± : Type u'} {n : β} (k : β) : FirstOrder.Language.BoundedFormula.relabelAux Sum.inl k = Sum.map id (Fin.natAdd n) - FirstOrder.Language.Term.realize_liftAt π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {Ξ± : Type u'} {n n' m : β} {t : L.Term (Ξ± β Fin n)} {v : Ξ± β Fin (n + n') β M} : FirstOrder.Language.Term.realize v (FirstOrder.Language.Term.liftAt n' m t) = FirstOrder.Language.Term.realize (v β Sum.map id fun i => if βi < m then Fin.castAdd n' i else i.addNat n') t - AddMonoid.Coprod.con_neg_add_cancel π Mathlib.GroupTheory.Coprod.Basic
{G : Type u_1} {H : Type u_2} [AddGroup G] [AddGroup H] (x : FreeAddMonoid (G β H)) : (AddMonoid.coprodCon G H) (FreeAddMonoid.ofList (List.map (Sum.map Neg.neg Neg.neg) (FreeAddMonoid.toList x)).reverse + x) 0 - Monoid.Coprod.con_inv_mul_cancel π Mathlib.GroupTheory.Coprod.Basic
{G : Type u_1} {H : Type u_2} [Group G] [Group H] (x : FreeMonoid (G β H)) : (Monoid.coprodCon G H) (FreeMonoid.ofList (List.map (Sum.map Inv.inv Inv.inv) (FreeMonoid.toList x)).reverse * x) 1 - AddMonoid.Coprod.map_mk_ofList π Mathlib.GroupTheory.Coprod.Basic
{M : Type u_1} {N : Type u_2} {M' : Type u_3} {N' : Type u_4} [AddZeroClass M] [AddZeroClass N] [AddZeroClass M'] [AddZeroClass N'] (f : M β+ M') (g : N β+ N') (l : List (M β N)) : (AddMonoid.Coprod.map f g) (AddMonoid.Coprod.mk (FreeAddMonoid.ofList l)) = AddMonoid.Coprod.mk (FreeAddMonoid.ofList (List.map (Sum.map βf βg) l)) - Monoid.Coprod.map_mk_ofList π Mathlib.GroupTheory.Coprod.Basic
{M : Type u_1} {N : Type u_2} {M' : Type u_3} {N' : Type u_4} [MulOneClass M] [MulOneClass N] [MulOneClass M'] [MulOneClass N'] (f : M β* M') (g : N β* N') (l : List (M β N)) : (Monoid.Coprod.map f g) (Monoid.Coprod.mk (FreeMonoid.ofList l)) = Monoid.Coprod.mk (FreeMonoid.ofList (List.map (Sum.map βf βg) l)) - AddMonoid.Coprod.neg_def π Mathlib.GroupTheory.Coprod.Basic
{G : Type u_1} {H : Type u_2} [AddGroup G] [AddGroup H] (w : FreeAddMonoid (G β H)) : -AddMonoid.Coprod.mk w = AddMonoid.Coprod.mk (FreeAddMonoid.ofList (List.map (Sum.map Neg.neg Neg.neg) (FreeAddMonoid.toList w)).reverse) - Monoid.Coprod.inv_def π Mathlib.GroupTheory.Coprod.Basic
{G : Type u_1} {H : Type u_2} [Group G] [Group H] (w : FreeMonoid (G β H)) : (Monoid.Coprod.mk w)β»ΒΉ = Monoid.Coprod.mk (FreeMonoid.ofList (List.map (Sum.map Inv.inv Inv.inv) (FreeMonoid.toList w)).reverse) - AddMonoid.Coprod.mk_of_neg_add π Mathlib.GroupTheory.Coprod.Basic
{G : Type u_1} {H : Type u_2} [AddGroup G] [AddGroup H] (x : G β H) : AddMonoid.Coprod.mk (FreeAddMonoid.of (Sum.map Neg.neg Neg.neg x)) + AddMonoid.Coprod.mk (FreeAddMonoid.of x) = 0 - Monoid.Coprod.mk_of_inv_mul π Mathlib.GroupTheory.Coprod.Basic
{G : Type u_1} {H : Type u_2} [Group G] [Group H] (x : G β H) : Monoid.Coprod.mk (FreeMonoid.of (Sum.map Inv.inv Inv.inv x)) * Monoid.Coprod.mk (FreeMonoid.of x) = 1
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 90fc5d6