Loogle!
Result
Found 15 declarations mentioning CategoryTheory.Functor.PullbackObjObj.fst.
- CategoryTheory.Functor.PullbackObjObj.fst š 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ā] {G : CategoryTheory.Functor Cāįµįµ (CategoryTheory.Functor Cā Cā)} {Xā Yā : Cā} {fā : Xā ā¶ Yā} {Xā Yā : Cā} {fā : Xā ā¶ Yā} (self : G.PullbackObjObj fā fā) : self.pt ā¶ (G.obj (Opposite.op Xā)).obj Xā - CategoryTheory.Functor.PullbackObjObj.ofIsTerminal_fst š 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ā] (G : CategoryTheory.Functor Cāįµįµ (CategoryTheory.Functor Cā Cā)) {Xā Yā : Cā} (fā : Xā ā¶ Yā) {Xā Yā : Cā} (fā : Xā ā¶ Yā) [CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) (G.obj (Opposite.op Xā))] [CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) (G.obj (Opposite.op Yā))] (h : CategoryTheory.Limits.IsTerminal Yā) : (CategoryTheory.Functor.PullbackObjObj.ofIsTerminal G fā fā h).fst = CategoryTheory.CategoryStruct.id ((G.obj (Opposite.op Xā)).obj Xā) - CategoryTheory.Functor.PullbackObjObj.isPullback š 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ā] {G : CategoryTheory.Functor Cāįµįµ (CategoryTheory.Functor Cā Cā)} {Xā Yā : Cā} {fā : Xā ā¶ Yā} {Xā Yā : Cā} {fā : Xā ā¶ Yā} (self : G.PullbackObjObj fā fā) : CategoryTheory.IsPullback self.fst self.snd ((G.obj (Opposite.op Xā)).map fā) ((G.map fā.op).app Yā) - CategoryTheory.Functor.PullbackObjObj.Ļ_fst š 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ā] {G : CategoryTheory.Functor Cāįµįµ (CategoryTheory.Functor Cā Cā)} {Xā Yā : Cā} {fā : Xā ā¶ Yā} {Xā Yā : Cā} {fā : Xā ā¶ Yā} (self : G.PullbackObjObj fā fā) : CategoryTheory.CategoryStruct.comp self.Ļ self.fst = (G.map fā.op).app Xā - CategoryTheory.Functor.PullbackObjObj.ofIsInitial_fst š 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ā] (G : CategoryTheory.Functor Cāįµįµ (CategoryTheory.Functor Cā Cā)) {Xā Yā : Cā} (fā : Xā ā¶ Yā) {Xā Yā : Cā} (fā : Xā ā¶ Yā) [CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) (G.flip.obj Xā)] [CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete PEmpty.{1}) (G.flip.obj Yā)] (h : CategoryTheory.Limits.IsInitial Xā) : (CategoryTheory.Functor.PullbackObjObj.ofIsInitial G fā fā h).fst = (CategoryTheory.Limits.IsTerminal.isTerminalObj (G.flip.obj Xā) (Opposite.op Xā) (CategoryTheory.Limits.IsInitial.op Cā h)).from ((G.obj (Opposite.op Yā)).obj Yā) - CategoryTheory.Functor.PullbackObjObj.Ļ_fst_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ā] {G : CategoryTheory.Functor Cāįµįµ (CategoryTheory.Functor Cā Cā)} {Xā Yā : Cā} {fā : Xā ā¶ Yā} {Xā Yā : Cā} {fā : Xā ā¶ Yā} (self : G.PullbackObjObj fā fā) {Z : Cā} (h : (G.obj (Opposite.op Xā)).obj Xā ā¶ Z) : CategoryTheory.CategoryStruct.comp self.Ļ (CategoryTheory.CategoryStruct.comp self.fst h) = CategoryTheory.CategoryStruct.comp ((G.map fā.op).app Xā) h - CategoryTheory.Functor.PullbackObjObj.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ā] {G : CategoryTheory.Functor Cāįµįµ (CategoryTheory.Functor Cā Cā)} {Xā Yā : Cā} {fā : Xā ā¶ Yā} {Xā Yā : Cā} {fā : Xā ā¶ Yā} (sq : G.PullbackObjObj fā fā) {Xā : Cā} {f g : Xā ā¶ sq.pt} (hā : CategoryTheory.CategoryStruct.comp f sq.fst = CategoryTheory.CategoryStruct.comp g sq.fst) (hā : CategoryTheory.CategoryStruct.comp f sq.snd = CategoryTheory.CategoryStruct.comp g sq.snd) : f = g - CategoryTheory.Functor.PullbackObjObj.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ā] {G : CategoryTheory.Functor Cāįµįµ (CategoryTheory.Functor Cā Cā)} {Xā Yā : Cā} {fā : Xā ā¶ Yā} {Xā Yā : Cā} {fā : Xā ā¶ Yā} {sq : G.PullbackObjObj fā fā} {Xā : Cā} {f g : Xā ā¶ sq.pt} : f = g ā CategoryTheory.CategoryStruct.comp f sq.fst = CategoryTheory.CategoryStruct.comp g sq.fst ā§ CategoryTheory.CategoryStruct.comp f sq.snd = CategoryTheory.CategoryStruct.comp g sq.snd - CategoryTheory.Functor.PullbackObjObj.ofHasPullback_fst š 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ā] (G : CategoryTheory.Functor Cāįµįµ (CategoryTheory.Functor Cā Cā)) {Xā Yā : Cā} (fā : Xā ā¶ Yā) {Xā Yā : Cā} (fā : Xā ā¶ Yā) [CategoryTheory.Limits.HasPullback ((G.obj (Opposite.op Xā)).map fā) ((G.map fā.op).app Yā)] : (CategoryTheory.Functor.PullbackObjObj.ofHasPullback G fā fā).fst = CategoryTheory.Limits.pullback.fst ((G.obj (Opposite.op Xā)).map fā) ((G.map fā.op).app Yā) - CategoryTheory.Functor.PullbackObjObj.mapArrowRight_right š 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ā] {G : CategoryTheory.Functor Cāįµįµ (CategoryTheory.Functor Cā Cā)} {fā : CategoryTheory.Arrow Cā} {fā fā' : CategoryTheory.Arrow Cā} (sqāā : G.PullbackObjObj fā.hom fā.hom) (sqāā' : G.PullbackObjObj fā.hom fā'.hom) (sq : fā ā¶ fā') : (sqāā.mapArrowRight sqāā' sq).right = āÆ.lift (CategoryTheory.CategoryStruct.comp sqāā.fst ((G.obj (Opposite.op fā.left)).map (CategoryTheory.Arrow.Hom.left sq))) (CategoryTheory.CategoryStruct.comp sqāā.snd ((G.obj (Opposite.op fā.right)).map (CategoryTheory.Arrow.Hom.right sq))) ⯠- CategoryTheory.Functor.PullbackObjObj.mapArrowLeft_right š 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ā] {G : CategoryTheory.Functor Cāįµįµ (CategoryTheory.Functor Cā Cā)} {fā fā' : CategoryTheory.Arrow Cā} {fā : CategoryTheory.Arrow Cā} (sqāā : G.PullbackObjObj fā.hom fā.hom) (sqāā' : G.PullbackObjObj fā'.hom fā.hom) (sq : fā' ā¶ fā) : (sqāā.mapArrowLeft sqāā' sq).right = āÆ.lift (CategoryTheory.CategoryStruct.comp sqāā.fst ((G.map (CategoryTheory.Arrow.Hom.left sq).op).app fā.left)) (CategoryTheory.CategoryStruct.comp sqāā.snd ((G.map (CategoryTheory.Arrow.Hom.right sq).op).app fā.right)) ⯠- CategoryTheory.ParametrizedAdjunction.arrowHomEquiv_apply_right_fst š 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ā) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right ((adjā.arrowHomEquiv sqāā sqāā) α)) sqāā.fst = adjā.homEquiv (CategoryTheory.CategoryStruct.comp sqāā.inr (CategoryTheory.Arrow.Hom.left α)) - CategoryTheory.ParametrizedAdjunction.arrowHomEquiv_apply_right_fst_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 sqāā.ι ā¶ CategoryTheory.Arrow.mk fā) {Z : Cā} (h : (G.obj (Opposite.op Xā)).obj Xā ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right ((adjā.arrowHomEquiv sqāā sqāā) α)) (CategoryTheory.CategoryStruct.comp sqāā.fst h) = CategoryTheory.CategoryStruct.comp (adjā.homEquiv (CategoryTheory.CategoryStruct.comp sqāā.inr (CategoryTheory.Arrow.Hom.left α))) h - CategoryTheory.ParametrizedAdjunction.inr_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āā.inr (CategoryTheory.Arrow.Hom.left ((adjā.arrowHomEquiv sqāā sqāā).symm β)) = adjā.homEquiv.symm (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right β) sqāā.fst) - CategoryTheory.ParametrizedAdjunction.inr_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āā.inr (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.left ((adjā.arrowHomEquiv sqāā sqāā).symm β)) h) = CategoryTheory.CategoryStruct.comp (adjā.homEquiv.symm (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right β) sqāā.fst)) h
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