Loogle!
Result
Found 20 declarations mentioning CategoryTheory.Functor.PushoutObjObj.inl.
- CategoryTheory.Functor.PushoutObjObj.inl 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} (self : F.PushoutObjObj f₁ f₂) : (F.obj Y₁).obj X₂ ⟶ self.pt - CategoryTheory.Functor.PushoutObjObj.flip_inl 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} (sq : F.PushoutObjObj f₁ f₂) : sq.flip.inl = sq.inr - CategoryTheory.Functor.PushoutObjObj.flip_inr 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} (sq : F.PushoutObjObj f₁ f₂) : sq.flip.inr = sq.inl - CategoryTheory.Functor.PushoutObjObj.ofIsInitialLeft_inl 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)) {X₁ Y₁ : C₁} (f₁ : X₁ ⟶ Y₁) {X₂ Y₂ : C₂} (f₂ : X₂ ⟶ Y₂) [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) (F.flip.obj X₂)] [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) (F.flip.obj Y₂)] (h : CategoryTheory.Limits.IsInitial X₁) : (CategoryTheory.Functor.PushoutObjObj.ofIsInitialLeft F f₁ f₂ h).inl = CategoryTheory.CategoryStruct.id ((F.obj Y₁).obj X₂) - CategoryTheory.Functor.PushoutObjObj.inl_ι 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} (self : F.PushoutObjObj f₁ f₂) : CategoryTheory.CategoryStruct.comp self.inl self.ι = (F.obj Y₁).map f₂ - CategoryTheory.Functor.PushoutObjObj.isPushout 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} (self : F.PushoutObjObj f₁ f₂) : CategoryTheory.IsPushout ((F.map f₁).app X₂) ((F.obj X₁).map f₂) self.inl self.inr - CategoryTheory.Functor.PushoutObjObj.ofIsInitialRight_inl 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)) {X₁ Y₁ : C₁} (f₁ : X₁ ⟶ Y₁) {X₂ Y₂ : C₂} (f₂ : X₂ ⟶ Y₂) [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) (F.obj X₁)] [CategoryTheory.Limits.PreservesColimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) (F.obj Y₁)] (h : CategoryTheory.Limits.IsInitial X₂) : (CategoryTheory.Functor.PushoutObjObj.ofIsInitialRight F f₁ f₂ h).inl = (CategoryTheory.Limits.IsInitial.isInitialObj (F.obj Y₁) X₂ h).to ((F.obj X₁).obj Y₂) - CategoryTheory.Functor.PushoutObjObj.inl_ι_assoc 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} (self : F.PushoutObjObj f₁ f₂) {Z : C₃} (h : (F.obj Y₁).obj Y₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp self.inl (CategoryTheory.CategoryStruct.comp self.ι h) = CategoryTheory.CategoryStruct.comp ((F.obj Y₁).map f₂) h - CategoryTheory.Functor.PushoutObjObj.ofNatIso_inl 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} (sq : F.PushoutObjObj f₁ f₂) {F' : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} (e : F ≅ F') : (sq.ofNatIso e).inl = CategoryTheory.CategoryStruct.comp ((e.inv.app Y₁).app X₂) sq.inl - CategoryTheory.Functor.PushoutObjObj.hom_ext 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} (sq : F.PushoutObjObj f₁ f₂) {X₃ : C₃} {f g : sq.pt ⟶ X₃} (hₗ : CategoryTheory.CategoryStruct.comp sq.inl f = CategoryTheory.CategoryStruct.comp sq.inl g) (hᵣ : CategoryTheory.CategoryStruct.comp sq.inr f = CategoryTheory.CategoryStruct.comp sq.inr g) : f = g - CategoryTheory.Functor.PushoutObjObj.hom_ext_iff 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} {sq : F.PushoutObjObj f₁ f₂} {X₃ : C₃} {f g : sq.pt ⟶ X₃} : f = g ↔ CategoryTheory.CategoryStruct.comp sq.inl f = CategoryTheory.CategoryStruct.comp sq.inl g ∧ CategoryTheory.CategoryStruct.comp sq.inr f = CategoryTheory.CategoryStruct.comp sq.inr g - CategoryTheory.Functor.PushoutObjObj.ofHasPushout_inl 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)) {X₁ Y₁ : C₁} (f₁ : X₁ ⟶ Y₁) {X₂ Y₂ : C₂} (f₂ : X₂ ⟶ Y₂) [CategoryTheory.Limits.HasPushout ((F.map f₁).app X₂) ((F.obj X₁).map f₂)] : (CategoryTheory.Functor.PushoutObjObj.ofHasPushout F f₁ f₂).inl = CategoryTheory.Limits.pushout.inl ((F.map f₁).app X₂) ((F.obj X₁).map f₂) - CategoryTheory.Functor.PushoutObjObj.mapArrowRight_left 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {f₁ : CategoryTheory.Arrow C₁} {f₂ f₂' : CategoryTheory.Arrow C₂} (sq₁₂ : F.PushoutObjObj f₁.hom f₂.hom) (sq₁₂' : F.PushoutObjObj f₁.hom f₂'.hom) (sq : f₂ ⟶ f₂') : (sq₁₂.mapArrowRight sq₁₂' sq).left = ⋯.desc (CategoryTheory.CategoryStruct.comp ((F.obj f₁.right).map (CategoryTheory.Arrow.Hom.left sq)) sq₁₂'.inl) (CategoryTheory.CategoryStruct.comp ((F.obj f₁.left).map (CategoryTheory.Arrow.Hom.right sq)) sq₁₂'.inr) ⋯ - CategoryTheory.Functor.PushoutObjObj.mapArrowLeft_left 📋 Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {f₁ f₁' : CategoryTheory.Arrow C₁} {f₂ : CategoryTheory.Arrow C₂} (sq₁₂ : F.PushoutObjObj f₁.hom f₂.hom) (sq₁₂' : F.PushoutObjObj f₁'.hom f₂.hom) (sq : f₁ ⟶ f₁') : (sq₁₂.mapArrowLeft sq₁₂' sq).left = ⋯.desc (CategoryTheory.CategoryStruct.comp ((F.map (CategoryTheory.Arrow.Hom.right sq)).app f₂.left) sq₁₂'.inl) (CategoryTheory.CategoryStruct.comp ((F.map (CategoryTheory.Arrow.Hom.left sq)).app f₂.right) sq₁₂'.inr) ⋯ - SSet.Subcomplex.unionProd.pushoutObjObj_inl 📋 Mathlib.AlgebraicTopology.SimplicialSet.PushoutProduct
{X Y : SSet} (S : X.Subcomplex) (T : Y.Subcomplex) : (SSet.Subcomplex.unionProd.pushoutObjObj S T).inl = SSet.Subcomplex.unionProd.ι₁ S T - CategoryTheory.ParametrizedAdjunction.arrowHomEquiv_apply_left 📋 Mathlib.CategoryTheory.LiftingProperties.ParametrizedAdjunction
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {G : CategoryTheory.Functor C₁ᵒᵖ (CategoryTheory.Functor C₃ C₂)} (adj₂ : F ⊣₂ G) {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} {X₃ Y₃ : C₃} {f₃ : X₃ ⟶ Y₃} (sq₁₂ : F.PushoutObjObj f₁ f₂) (sq₁₃ : G.PullbackObjObj f₁ f₃) (α : CategoryTheory.Arrow.mk sq₁₂.ι ⟶ CategoryTheory.Arrow.mk f₃) : ((adj₂.arrowHomEquiv sq₁₂ sq₁₃) α).left = adj₂.homEquiv (CategoryTheory.CategoryStruct.comp sq₁₂.inl (CategoryTheory.Arrow.Hom.left α)) - CategoryTheory.ParametrizedAdjunction.inl_arrowHomEquiv_symm_apply_left 📋 Mathlib.CategoryTheory.LiftingProperties.ParametrizedAdjunction
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {G : CategoryTheory.Functor C₁ᵒᵖ (CategoryTheory.Functor C₃ C₂)} (adj₂ : F ⊣₂ G) {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} {X₃ Y₃ : C₃} {f₃ : X₃ ⟶ Y₃} (sq₁₂ : F.PushoutObjObj f₁ f₂) (sq₁₃ : G.PullbackObjObj f₁ f₃) (β : CategoryTheory.Arrow.mk f₂ ⟶ CategoryTheory.Arrow.mk sq₁₃.π) : CategoryTheory.CategoryStruct.comp sq₁₂.inl (CategoryTheory.Arrow.Hom.left ((adj₂.arrowHomEquiv sq₁₂ sq₁₃).symm β)) = adj₂.homEquiv.symm (CategoryTheory.Arrow.Hom.left β) - CategoryTheory.ParametrizedAdjunction.inl_arrowHomEquiv_symm_apply_left_assoc 📋 Mathlib.CategoryTheory.LiftingProperties.ParametrizedAdjunction
{C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [CategoryTheory.Category.{v₁, u₁} C₁] [CategoryTheory.Category.{v₂, u₂} C₂] [CategoryTheory.Category.{v₃, u₃} C₃] {F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ C₃)} {G : CategoryTheory.Functor C₁ᵒᵖ (CategoryTheory.Functor C₃ C₂)} (adj₂ : F ⊣₂ G) {X₁ Y₁ : C₁} {f₁ : X₁ ⟶ Y₁} {X₂ Y₂ : C₂} {f₂ : X₂ ⟶ Y₂} {X₃ Y₃ : C₃} {f₃ : X₃ ⟶ Y₃} (sq₁₂ : F.PushoutObjObj f₁ f₂) (sq₁₃ : G.PullbackObjObj f₁ f₃) (β : CategoryTheory.Arrow.mk f₂ ⟶ CategoryTheory.Arrow.mk sq₁₃.π) {Z : C₃} (h : (CategoryTheory.Arrow.mk f₃).left ⟶ Z) : CategoryTheory.CategoryStruct.comp sq₁₂.inl (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.left ((adj₂.arrowHomEquiv sq₁₂ sq₁₃).symm β)) h) = CategoryTheory.CategoryStruct.comp (adj₂.homEquiv.symm (CategoryTheory.Arrow.Hom.left β)) h - CategoryTheory.Functor.PushoutObjObj.flipTensor_inl 📋 Mathlib.CategoryTheory.Monoidal.Braided.PushoutObjObj
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] {X₁ Y₁ X₂ Y₂ : C} {f₁ : X₁ ⟶ Y₁} {f₂ : X₂ ⟶ Y₂} (sq : (CategoryTheory.MonoidalCategory.curriedTensor C).PushoutObjObj f₁ f₂) : sq.flipTensor.inl = CategoryTheory.CategoryStruct.comp (β_ Y₂ X₁).hom sq.inr - CategoryTheory.Functor.PushoutObjObj.flipTensor_inr 📋 Mathlib.CategoryTheory.Monoidal.Braided.PushoutObjObj
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] {X₁ Y₁ X₂ Y₂ : C} {f₁ : X₁ ⟶ Y₁} {f₂ : X₂ ⟶ Y₂} (sq : (CategoryTheory.MonoidalCategory.curriedTensor C).PushoutObjObj f₁ f₂) : sq.flipTensor.inr = CategoryTheory.CategoryStruct.comp (β_ X₂ Y₁).hom sq.inl
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