name stringlengths 2 347 | module stringlengths 6 90 | type stringlengths 1 5.42M | docString stringlengths 0 11k ⌀ | allowCompletion bool 2
classes |
|---|---|---|---|---|
CategoryTheory.Functor.PullbackObjObj.ofIsTerminal_π | Mathlib.CategoryTheory.Limits.Shapes.Pullback.PullbackObjObj | ∀ {C₁ : Type u₁} {C₂ : Type u₂} {C₃ : Type u₃} [inst : CategoryTheory.Category.{v₁, u₁} C₁]
[inst_1 : CategoryTheory.Category.{v₂, u₂} C₂] [inst_2 : 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₃)
[inst... | null | true |
CategoryTheory.NatTrans.naturality_app_map_assoc | Mathlib.CategoryTheory.Functor.Category | ∀ {C : Type u₁} [inst : CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [inst_1 : CategoryTheory.Category.{v₂, u₂} D]
{E : Type u₃} [inst_2 : CategoryTheory.Category.{v₃, u₃} E]
{F G : CategoryTheory.Functor C (CategoryTheory.Functor D E)} (T : F ⟶ G) (Z : D) {X Y : C} (f : X ⟶ Y)
{D_1 : Type u_1} [_instD : Cat... | null | true |
Std.PRange.UpwardEnumerable.Map.lt_iff | Init.Data.Range.Polymorphic.Map | ∀ {α : Type u_1} {β : Type u_2} [inst : Std.PRange.UpwardEnumerable α] [inst_1 : Std.PRange.UpwardEnumerable β]
(f : Std.PRange.UpwardEnumerable.Map α β) {a b : α},
Std.PRange.UpwardEnumerable.LT a b ↔ Std.PRange.UpwardEnumerable.LT (f.toFun a) (f.toFun b) | null | true |
ProbabilityTheory.Kernel.fst | Mathlib.Probability.Kernel.Composition.MapComap | {α : Type u_1} →
{β : Type u_2} →
{γ : Type u_3} →
{mα : MeasurableSpace α} →
{mβ : MeasurableSpace β} →
{mγ : MeasurableSpace γ} → ProbabilityTheory.Kernel α (β × γ) → ProbabilityTheory.Kernel α β | Define a `Kernel α β` from a `Kernel α (β × γ)` by taking the map of the first projection.
We use `mapOfMeasurable` for better defeqs. | true |
_private.Init.Data.SInt.Lemmas.0.Int64.ne_of_lt._simp_1_2 | Init.Data.SInt.Lemmas | ∀ {x y : Int64}, (x = y) = (x.toInt = y.toInt) | null | false |
_private.Std.Data.DHashMap.Internal.WF.0.Std.DHashMap.Internal.Raw₀.Const.alterₘ.match_1.eq_1 | Std.Data.DHashMap.Internal.WF | ∀ {β : Type u_1} (motive : Option β → Sort u_2) (h_1 : Unit → motive none) (h_2 : (b : β) → motive (some b)),
(match none with
| none => h_1 ()
| some b => h_2 b) =
h_1 () | null | true |
CategoryTheory.MorphismProperty.isColocal_iff | Mathlib.CategoryTheory.ObjectProperty.Local | ∀ {C : Type u} [inst : CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (X : C),
W.isColocal X ↔ ∀ ⦃Y Z : C⦄ (g : Y ⟶ Z), W g → Function.Bijective fun f => CategoryTheory.CategoryStruct.comp f g | null | true |
CategoryTheory.Abelian.AbelianStruct.imageι_π._autoParam | Mathlib.CategoryTheory.Abelian.Basic | Lean.Syntax | null | false |
CategoryTheory.ObjectProperty.shift | Mathlib.CategoryTheory.ObjectProperty.Shift | {C : Type u_1} →
[inst : CategoryTheory.Category.{v_1, u_1} C] →
CategoryTheory.ObjectProperty C →
{A : Type u_2} → [inst_1 : AddMonoid A] → [CategoryTheory.HasShift C A] → A → CategoryTheory.ObjectProperty C | Given a predicate `P : C → Prop` on objects of a category equipped with a shift by `A`,
this is the predicate which is satisfied by `X` if `P (X⟦a⟧)`. | true |
SemiRingCat.HasLimits.limitConeIsLimit._simp_1 | Mathlib.Algebra.Category.Ring.Limits | ∀ {α : Type u_2} [inst : Small.{v, u_2} α] [inst_1 : Mul α] (x y : α),
(equivShrink α) x * (equivShrink α) y = (equivShrink α) (x * y) | null | false |
Lean.Linter.MissingDocs.checkMixfix | Lean.Linter.MissingDocs | Lean.Linter.MissingDocs.SimpleHandler | null | true |
Lean.Meta.Grind.State.instanceMap._default | Lean.Meta.Tactic.Grind.Types | Std.HashMap Lean.Name Lean.Meta.Grind.EMatchTheorem | null | false |
Metric.isBounded_image_iff | Mathlib.Topology.MetricSpace.Bounded | ∀ {α : Type u} {β : Type v} [inst : PseudoMetricSpace α] {f : β → α} {s : Set β},
Bornology.IsBounded (f '' s) ↔ ∃ C, ∀ x ∈ s, ∀ y ∈ s, dist (f x) (f y) ≤ C | null | true |
AdjoinRoot.powerBasisAux'._proof_3 | Mathlib.RingTheory.AdjoinRoot | ∀ {R : Type u_1} [inst : CommRing R] {g : Polynomial R} (hg : g.Monic) (f₁ : R) (f₂ : AdjoinRoot g)
(i : Fin g.natDegree),
((AdjoinRoot.modByMonicHom hg) (f₁ • f₂)).coeff ↑i =
((RingHom.id R) f₁ • fun i => ((AdjoinRoot.modByMonicHom hg) f₂).coeff ↑i) i | null | false |
AlgebraicGeometry.instCanonicallyOverSpecStalkCommRingCatPresheaf | Mathlib.AlgebraicGeometry.Stalk | (X : AlgebraicGeometry.Scheme) → (x : ↥X) → (AlgebraicGeometry.Spec (X.presheaf.stalk x)).CanonicallyOver X | null | true |
String.Slice.Pos.not_endPos_lt._simp_1 | Init.Data.String.Lemmas.Order | ∀ {s : String.Slice} {p : s.Pos}, (s.endPos < p) = False | null | false |
CategoryTheory.Functor.Elements.isInitialElementsMkShrinkYonedaObjObjEquivId._proof_1 | Mathlib.CategoryTheory.Limits.Presheaf | ∀ {C : Type u_3} [inst : CategoryTheory.Category.{u_2, u_3} C] [inst_1 : CategoryTheory.LocallySmall.{u_1, u_2, u_3} C]
(X : C) (u : (CategoryTheory.shrinkYoneda.{u_1, u_2, u_3}.flip.obj (Opposite.op X)).Elements),
(CategoryTheory.ConcreteCategory.hom
((CategoryTheory.shrinkYoneda.{u_1, u_2, u_3}.flip.obj (... | null | false |
Subfield.comap_top | Mathlib.Algebra.Field.Subfield.Basic | ∀ {K : Type u} {L : Type v} [inst : DivisionRing K] [inst_1 : DivisionRing L] (f : K →+* L), Subfield.comap f ⊤ = ⊤ | null | true |
Mathlib.Tactic.Order.orderCoreImp | Mathlib.Tactic.Order | Bool → Array Lean.Expr → Lean.Expr → Lean.MVarId → Mathlib.Tactic.AtomM Unit | Implementation of `orderCore` in `AtomM`. | true |
CategoryTheory.MonoidalCategory.DayConvolution.braidingInvCorepresenting._proof_1 | Mathlib.CategoryTheory.Monoidal.DayConvolution.Braided | ∀ {C : Type u_4} [inst : CategoryTheory.Category.{u_3, u_4} C] {V : Type u_2}
[inst_1 : CategoryTheory.Category.{u_1, u_2} V] [inst_2 : CategoryTheory.MonoidalCategory C]
[inst_3 : CategoryTheory.BraidedCategory C] [inst_4 : CategoryTheory.MonoidalCategory V]
[inst_5 : CategoryTheory.BraidedCategory V] (F G : Cat... | null | false |
SSet.OneTruncation₂.ofNerve₂ | Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat | (C : Type u) →
[inst : CategoryTheory.Category.{u, u} C] →
↧(SSet.OneTruncation₂ ((SSet.truncation 2).obj (CategoryTheory.nerve C))) ≅ ↧C | The refl quiver underlying a nerve is isomorphic to the refl quiver underlying the category. | true |
Set.pairwise_univ | Mathlib.Data.Set.Pairwise.Basic | ∀ {α : Type u_1} {r : α → α → Prop}, Set.univ.Pairwise r ↔ Pairwise r | null | true |
StarSubalgebra.mem_top | Mathlib.Algebra.Star.Subalgebra | ∀ {R : Type u_1} {A : Type u_2} [inst : CommSemiring R] [inst_1 : StarRing R] [inst_2 : Semiring A]
[inst_3 : Algebra R A] [inst_4 : StarRing A] [inst_5 : StarModule R A] {x : A}, x ∈ ⊤ | null | true |
neg_iff_pos_of_mul_neg | Mathlib.Algebra.Order.Ring.Unbundled.Basic | ∀ {R : Type u} [inst : Semiring R] [inst_1 : LinearOrder R] {a b : R} [ExistsAddOfLE R] [PosMulMono R] [MulPosMono R]
[AddRightMono R] [AddRightReflectLE R], a * b < 0 → (a < 0 ↔ 0 < b) | null | true |
FirstOrder.Language.Substructure.instInhabited_fg | Mathlib.ModelTheory.FinitelyGenerated | {L : FirstOrder.Language} → {M : Type u_1} → [inst : L.Structure M] → Inhabited { S // S.FG } | null | true |
LatticeCon.mk | Mathlib.Order.Lattice.Congruence | {α : Type u_2} →
[inst : Lattice α] →
(toSetoid : Setoid α) →
(∀ {w x y z : α}, toSetoid w x → toSetoid y z → toSetoid (w ⊓ y) (x ⊓ z)) →
(∀ {w x y z : α}, toSetoid w x → toSetoid y z → toSetoid (w ⊔ y) (x ⊔ z)) → LatticeCon α | null | true |
Nat.gcd_sub_self_right | Init.Data.Nat.Gcd | ∀ {m n : ℕ}, m ≤ n → m.gcd (n - m) = m.gcd n | null | true |
_private.Lean.Compiler.LCNF.PullLetDecls.0.Lean.Compiler.LCNF.Decl.pullInstances._sparseCasesOn_1 | Lean.Compiler.LCNF.PullLetDecls | {pu : Lean.Compiler.LCNF.Purity} →
{motive : Lean.Compiler.LCNF.LetValue pu → Sort u} →
(t : Lean.Compiler.LCNF.LetValue pu) →
((declName : Lean.Name) →
(us : List Lean.Level) →
(args : Array (Lean.Compiler.LCNF.Arg pu)) →
(h : pu = Lean.Compiler.LCNF.Purity.pure) →
... | null | false |
Lean.Meta.Simp.NormCastConfig.singlePass._inherited_default | Init.MetaTypes | Bool | null | false |
NonUnitalAlgebra.range_id | Mathlib.Algebra.Algebra.NonUnitalSubalgebra | ∀ {R : Type u} {A : Type v} [inst : CommSemiring R] [inst_1 : NonUnitalNonAssocSemiring A] [inst_2 : Module R A]
[inst_3 : IsScalarTower R A A] [inst_4 : SMulCommClass R A A], (NonUnitalAlgHom.id R A).range = ⊤ | null | true |
Filter.Tendsto.finCons | Mathlib.Topology.Constructions | ∀ {Y : Type v} {n : ℕ} {A : Fin (n + 1) → Type u_6} [inst : (i : Fin (n + 1)) → TopologicalSpace (A i)] {f : Y → A 0}
{g : Y → (j : Fin n) → A j.succ} {l : Filter Y} {x : A 0} {y : (j : Fin n) → A j.succ},
Filter.Tendsto f l (nhds x) →
Filter.Tendsto g l (nhds y) → Filter.Tendsto (fun a => Fin.cons (f a) (g a))... | null | true |
WithTop.untop.congr_simp | Mathlib.Order.WithBot | ∀ {α : Type u_1} (x x_1 : WithTop α) (e_x : x = x_1) (a : x ≠ ⊤), x.untop a = x_1.untop ⋯ | null | true |
CategoryTheory.ComonadicLeftAdjoint.R | Mathlib.CategoryTheory.Monad.Adjunction | {C : Type u₁} →
{inst : CategoryTheory.Category.{v₁, u₁} C} →
{D : Type u₂} →
{inst_1 : CategoryTheory.Category.{v₂, u₂} D} →
(L : CategoryTheory.Functor C D) → [self : CategoryTheory.ComonadicLeftAdjoint L] → CategoryTheory.Functor D C | a choice of right adjoint for `L` | true |
RootPairing.rootForm_symmetric | Mathlib.LinearAlgebra.RootSystem.Finite.CanonicalBilinear | ∀ {ι : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [inst : CommRing R] [inst_1 : AddCommGroup M]
[inst_2 : Module R M] [inst_3 : AddCommGroup N] [inst_4 : Module R N] (P : RootPairing ι R M N) [inst_5 : Fintype ι],
LinearMap.IsSymm P.RootForm | null | true |
_private.Mathlib.LinearAlgebra.RootSystem.GeckConstruction.Relations.0.RootPairing.GeckConstruction.lie_h_e._simp_1_6 | Mathlib.LinearAlgebra.RootSystem.GeckConstruction.Relations | ∀ {M : Type u_4} [inst : AddMonoid M] [IsRightCancelAdd M] {a b : M}, (b = a + b) = (a = 0) | null | false |
Fin.cast_eq_cast | Mathlib.Data.Fin.SuccPred | ∀ {n m : ℕ} (h : n = m), Fin.cast h = cast ⋯ | While in many cases `Fin.cast` is better than `Equiv.cast`/`cast`, sometimes we want to apply
a generic theorem about `cast`. | true |
Submodule.lTensorOne'._proof_1 | Mathlib.LinearAlgebra.TensorProduct.Submodule | ∀ {R : Type u_2} {S : Type u_1} [inst : CommSemiring R] [inst_1 : Semiring S] [inst_2 : Algebra R S]
(N : Submodule R S), ((Subalgebra.toSubmodule ⊥).mulMap N).range = N | null | false |
CategoryTheory.CostructuredArrow.toOver_obj_left | Mathlib.CategoryTheory.Comma.Over.Basic | ∀ {T : Type u₁} [inst : CategoryTheory.Category.{v₁, u₁} T] {D : Type u₂} [inst_1 : CategoryTheory.Category.{v₂, u₂} D]
(F : CategoryTheory.Functor D T) (X : T)
(X_1 : CategoryTheory.Comma (F.comp (CategoryTheory.Functor.id T)) (CategoryTheory.Functor.fromPUnit X)),
((CategoryTheory.CostructuredArrow.toOver F X).... | null | true |
uniformContinuous_of_const | Mathlib.Topology.UniformSpace.Defs | ∀ {α : Type ua} {β : Type ub} [inst : UniformSpace α] [inst_1 : UniformSpace β] {c : α → β},
(∀ (a b : α), c a = c b) → UniformContinuous c | null | true |
Lean.Lsp.TextDocumentIdentifier.uri | Lean.Data.Lsp.Basic | Lean.Lsp.TextDocumentIdentifier → Lean.Lsp.DocumentUri | null | true |
CategoryTheory.Functor.mapCommGrpNatTrans_app_hom_hom_hom | Mathlib.CategoryTheory.Monoidal.CommGrp_ | ∀ {C : Type u₁} [inst : CategoryTheory.Category.{v₁, u₁} C] [inst_1 : CategoryTheory.CartesianMonoidalCategory C]
[inst_2 : CategoryTheory.BraidedCategory C] {D : Type u₂} [inst_3 : CategoryTheory.Category.{v₂, u₂} D]
[inst_4 : CategoryTheory.CartesianMonoidalCategory D] [inst_5 : CategoryTheory.BraidedCategory D]
... | null | true |
_private.Mathlib.CategoryTheory.WithTerminal.Cone.0.CategoryTheory.WithTerminal.coneBack._proof_9 | Mathlib.CategoryTheory.WithTerminal.Cone | ∀ {C : Type u_2} [inst : CategoryTheory.Category.{u_1, u_2} C] {J : Type u_4}
[inst_1 : CategoryTheory.Category.{u_3, u_4} J] {X : C} {K : CategoryTheory.Functor J (CategoryTheory.Over X)}
{X_1 Y Z : CategoryTheory.Limits.Cone (CategoryTheory.WithTerminal.liftFromOver.obj K)} (f : X_1 ⟶ Y) (g : Y ⟶ Z)
(j : J),
... | null | false |
Aesop.BuilderName.constructors.sizeOf_spec | Aesop.Rule.Name | sizeOf Aesop.BuilderName.constructors = 1 | null | true |
Nat.testBit_two_pow_sub_one | Init.Data.Nat.Bitwise.Lemmas | ∀ (n i : ℕ), (2 ^ n - 1).testBit i = decide (i < n) | null | true |
CategoryTheory.MorphismProperty.regularMono.respectsIso | Mathlib.CategoryTheory.Limits.Shapes.RegularMono | ∀ {C : Type u₁} [inst : CategoryTheory.Category.{v₁, u₁} C], (CategoryTheory.MorphismProperty.regularMono C).RespectsIso | null | true |
_private.Mathlib.MeasureTheory.Function.SimpleFuncDense.0.HasCompactSupport.exists_simpleFunc_approx_of_prod.match_1_1 | Mathlib.MeasureTheory.Function.SimpleFuncDense | ∀ {X : Type u_1} {Y : Type u_2} {α : Type u_3} [inst : MeasurableSpace X] [inst_1 : MeasurableSpace Y]
[inst_2 : PseudoMetricSpace α] {f : X × Y → α} {ε : ℝ} ⦃t' : Set (X × Y)⦄
(motive : (∃ g s, MeasurableSet s ∧ t' ⊆ s ∧ ∀ x ∈ s, dist (f x) (g x) < ε) → Prop)
(h : ∃ g s, MeasurableSet s ∧ t' ⊆ s ∧ ∀ x ∈ s, dist ... | null | false |
Nat.lcm.eq_1 | Mathlib.Algebra.Order.Antidiag.Nat | ∀ (m n : ℕ), m.lcm n = m * n / m.gcd n | null | true |
WithZero.exp_add | Mathlib.Algebra.GroupWithZero.WithZero | ∀ {M : Type u_4} [inst : AddMonoid M] (a b : M), WithZero.exp (a + b) = WithZero.exp a * WithZero.exp b | null | true |
PresheafOfModules.isColimitFreeYonedaCoproductsCokernelCofork._proof_6 | Mathlib.Algebra.Category.ModuleCat.Presheaf.Generator | ∀ {C : Type u_1} [inst : CategoryTheory.SmallCategory C] {R : CategoryTheory.Functor Cᵒᵖ RingCat}
(M : PresheafOfModules R),
CategoryTheory.Epi
{ X₁ := (CategoryTheory.Limits.kernel M.fromFreeYonedaCoproduct).freeYonedaCoproduct, X₂ := M.freeYonedaCoproduct,
X₃ := M, f := M.toFreeYonedaCoproduct, g :=... | null | false |
nonZeroDivisors.associated_coe._simp_1 | Mathlib.Algebra.GroupWithZero.NonZeroDivisors | ∀ {M₀ : Type u_1} [inst : MonoidWithZero M₀] {a b : ↥(nonZeroDivisors M₀)}, Associated ↑a ↑b = Associated a b | null | false |
CompHaus.toCondensed | Mathlib.Condensed.Functors | CompHaus → CondensedSet | Dot notation for the value of `compHausToCondensed`. | true |
IsCauSeq.cauchy₃ | Mathlib.Algebra.Order.CauSeq.Basic | ∀ {α : Type u_1} {β : Type u_2} [inst : Field α] [inst_1 : LinearOrder α] [inst_2 : IsStrictOrderedRing α]
[inst_3 : Ring β] {abv : β → α} [IsAbsoluteValue abv] {f : ℕ → β},
IsCauSeq abv f → ∀ {ε : α}, 0 < ε → ∃ i, ∀ j ≥ i, ∀ k ≥ j, abv (f k - f j) < ε | null | true |
Std.DHashMap.getKeyD_union_of_not_mem_right | Std.Data.DHashMap.Lemmas | ∀ {α : Type u} {β : α → Type v} {x : BEq α} {x_1 : Hashable α} {m₁ m₂ : Std.DHashMap α β} [EquivBEq α]
[LawfulHashable α] {k fallback : α}, k ∉ m₂ → (m₁ ∪ m₂).getKeyD k fallback = m₁.getKeyD k fallback | null | true |
Lean.Parser.Term.macroArg | Lean.Parser.Term | Lean.Parser.Parser | null | true |
Std.TreeSet.Raw.get?_eq_some_get | Std.Data.TreeSet.Raw.Lemmas | ∀ {α : Type u} {cmp : α → α → Ordering} {t : Std.TreeSet.Raw α cmp} [Std.TransCmp cmp],
t.WF → ∀ {a : α} (h' : a ∈ t), t.get? a = some (t.get a h') | null | true |
_private.Lean.Meta.Injective.0.Lean.Meta.mkInjectiveTheoremValue | Lean.Meta.Injective | Lean.Name → Lean.Expr → Lean.MetaM Lean.Expr | null | true |
_private.Mathlib.CategoryTheory.Presentable.SharplyLT.Basic.0.Cardinal.SharplyLT.existsIsCardinalFilteredSetOfExistsCofinal.hasCardinalLT_transfiniteIterate_φ._simp_1_8 | Mathlib.CategoryTheory.Presentable.SharplyLT.Basic | ∀ {α : Sort u_1} {p : α → Prop} {a' : α}, (∃ a, p a ∧ a = a') = p a' | null | false |
Lean.Lsp.SignatureHelpParams.context? | Lean.Data.Lsp.LanguageFeatures | Lean.Lsp.SignatureHelpParams → Option Lean.Lsp.SignatureHelpContext | null | true |
Lean.IR.Expr.ctor.elim | Lean.Compiler.IR.Basic | {motive : Lean.IR.Expr → Sort u} →
(t : Lean.IR.Expr) →
t.ctorIdx = 0 → ((i : Lean.IR.CtorInfo) → (ys : Array Lean.IR.Arg) → motive (Lean.IR.Expr.ctor i ys)) → motive t | null | false |
_private.Mathlib.MeasureTheory.Integral.DivergenceTheorem.0.MeasureTheory.integral_divergence_prod_Icc_of_hasFDerivAt_off_countable_of_le._abel_1_1 | Mathlib.MeasureTheory.Integral.DivergenceTheorem | ∀ {E : Type u_1} [inst : NormedAddCommGroup E] [inst_1 : NormedSpace ℝ E] (f g : ℝ × ℝ → E) (a b : ℝ × ℝ),
((∫ (y : ℝ) in Set.Icc a.2 b.2, f (b.1, y)) - ∫ (y : ℝ) in Set.Icc a.2 b.2, f (a.1, y)) +
((∫ (x : ℝ) in Set.Icc a.1 b.1, g (x, b.2)) - ∫ (x : ℝ) in Set.Icc a.1 b.1, g (x, a.2)) =
(((∫ (x : ℝ) in Set.I... | null | false |
Fin.natAddLEFunctor._proof_4 | Mathlib.CategoryTheory.ComposableArrows.Basic | ∀ {n k l : ℕ}, k + l ≤ n → ∀ i < l + 1, k + i < n + 1 | null | false |
USize.not_inj | Init.Data.UInt.Bitwise | ∀ {a b : USize}, ~~~a = ~~~b ↔ a = b | null | true |
_private.Mathlib.Data.Seq.Computation.0.Computation.LiftRelAux.match_1.splitter | Mathlib.Data.Seq.Computation | {α : Type u_1} →
{β : Type u_2} →
(motive : α ⊕ Computation α → β ⊕ Computation β → Sort u_3) →
(x : α ⊕ Computation α) →
(x_1 : β ⊕ Computation β) →
((a : α) → (b : β) → motive (Sum.inl a) (Sum.inl b)) →
((a : α) → (cb : Computation β) → motive (Sum.inl a) (Sum.inr cb)) →
... | null | true |
FreeAlgebra.star_ι | Mathlib.Algebra.Star.Free | ∀ {R : Type u_1} [inst : CommSemiring R] {X : Type u_2} (x : X), star (FreeAlgebra.ι R x) = FreeAlgebra.ι R x | null | true |
UniformSpace.ball | Mathlib.Topology.UniformSpace.Defs | {β : Type ub} → β → Set (β × β) → Set β | The ball around `(x : β)` with respect to `(V : Set (β × β))`. Intended to be
used for `V ∈ 𝓤 β`, but this is not needed for the definition. Recovers the
notions of metric space ball when `V = {p | dist p.1 p.2 < r }`. | true |
CategoryTheory.Precoverage.Saturate.below.pullback | Mathlib.CategoryTheory.Sites.PrecoverageToGrothendieck | ∀ {C : Type u_1} [inst : CategoryTheory.Category.{u_2, u_1} C] {J : CategoryTheory.Precoverage C}
{motive : (X : C) → (a : CategoryTheory.Sieve X) → J.Saturate X a → Prop} (X : C) (S : CategoryTheory.Sieve X)
(a : J.Saturate X S) (Y : C) (f : Y ⟶ X),
CategoryTheory.Precoverage.Saturate.below a → motive X S a → Ca... | null | true |
_private.Std.Data.DTreeMap.Internal.Operations.0.Std.DTreeMap.Internal.Impl.alter._proof_6 | Std.Data.DTreeMap.Internal.Operations | ∀ {α : Type u_1} {β : α → Type u_2}, Std.DTreeMap.Internal.Impl.leaf.size ≤ Std.DTreeMap.Internal.Impl.leaf.size + 1 | null | false |
Std.DTreeMap.Raw.containsThenInsertIfNew_snd | Std.Data.DTreeMap.Raw.Lemmas | ∀ {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Std.DTreeMap.Raw α β cmp} [Std.TransCmp cmp],
t.WF → ∀ {k : α} {v : β k}, (t.containsThenInsertIfNew k v).2 = t.insertIfNew k v | null | true |
CategoryTheory.Under.pushout._proof_2 | Mathlib.CategoryTheory.Comma.Over.Pullback | ∀ {C : Type u_2} [inst : CategoryTheory.Category.{u_1, u_2} C] {X Y : C} (f : X ⟶ Y)
[inst_1 : CategoryTheory.Limits.HasPushoutsAlong f] (x : CategoryTheory.Under X) {x' : CategoryTheory.Under X}
{u : x ⟶ x'},
CategoryTheory.CategoryStruct.comp x.hom
(CategoryTheory.CategoryStruct.comp (CategoryTheory.Under... | null | false |
_private.Batteries.Data.List.Basic.0.List.takeListTR.go._sunfold | Batteries.Data.List.Basic | {α : Type u_1} → List ℕ → List α → Array (List α) → List (List α) × List α | null | false |
Aesop.handleNonfatalError | Aesop.Search.Main | {Q : Type} → [inst : Aesop.Queue Q] → Lean.MessageData → Aesop.SearchM Q (Array Lean.MVarId) | null | true |
Std.Rxo.IsAlwaysFinite.mk | Init.Data.Range.Polymorphic.PRange | ∀ {α : Type u} [inst : Std.PRange.UpwardEnumerable α] [inst_1 : LT α],
(∀ (init hi : α), ∃ n, (Std.PRange.succMany? n init).elim True fun x => ¬x < hi) → Std.Rxo.IsAlwaysFinite α | null | true |
Std.DHashMap.Internal.Raw₀.find?_toList_eq_some_iff_get?_eq_some | Std.Data.DHashMap.Internal.RawLemmas | ∀ {α : Type u} {β : α → Type v} (m : Std.DHashMap.Internal.Raw₀ α β) [inst : BEq α] [inst_1 : Hashable α]
[inst_2 : LawfulBEq α],
(↑m).WF → ∀ {k : α} {v : β k}, List.find? (fun x => x.fst == k) (↑m).toList = some ⟨k, v⟩ ↔ m.get? k = some v | null | true |
PartitionOfUnity.exists_finset_nhds | Mathlib.Topology.PartitionOfUnity | ∀ {ι : Type u} {X : Type v} [inst : TopologicalSpace X] (ρ : PartitionOfUnity ι X) (x₀ : X),
∃ I, ∀ᶠ (x : X) in nhds x₀, ∑ i ∈ I, (ρ i) x = 1 ∧ (Function.support fun x_1 => (ρ x_1) x) ⊆ ↑I | null | true |
SeparationQuotient.liftNormedAddGroupHomEquiv._proof_1 | Mathlib.Analysis.Normed.Group.SeparationQuotient | ∀ {M : Type u_1} [inst : SeminormedAddCommGroup M] {N : Type u_2} [inst_1 : SeminormedAddCommGroup N]
(g : NormedAddGroupHom (SeparationQuotient M) N) (x : M), ‖x‖ = 0 → (g.comp SeparationQuotient.normedMk) x = 0 | null | false |
CategoryTheory.BraidedCategory.ofBifunctor | Mathlib.CategoryTheory.Monoidal.Braided.Multifunctor | {C : Type u_1} →
[inst : CategoryTheory.Category.{v_1, u_1} C] →
[inst_1 : CategoryTheory.MonoidalCategory C] →
(β : CategoryTheory.MonoidalCategory.curriedTensor C ≅ (CategoryTheory.MonoidalCategory.curriedTensor C).flip) →
CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategory.curried... | Given a braiding `β : curriedTensor C ≅ (curriedTensor C).flip` as a natural isomorphism between
bifunctors, and the two equalities `hexagon_forward` and `hexagon_reverse` of natural
transformations between trifunctors, we obtain a braided category structure.
| true |
ArchimedeanClass.mk.eq_1 | Mathlib.Algebra.Order.Archimedean.Class | ∀ {M : Type u_1} [inst : AddCommGroup M] [inst_1 : LinearOrder M] [inst_2 : IsOrderedAddMonoid M] (a : M),
ArchimedeanClass.mk a = toAntisymmetrization (fun x1 x2 => x1 ≤ x2) (ArchimedeanOrder.of a) | null | true |
Std.ExtDTreeMap.forIn.congr_simp | Std.Data.ExtDTreeMap.Lemmas | ∀ {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {δ : Type w} {m : Type w → Type w₂} [inst : Monad m]
[inst_1 : LawfulMonad m] [inst_2 : Std.TransCmp cmp] (f f_1 : (a : α) → β a → δ → m (ForInStep δ)),
f = f_1 →
∀ (init init_1 : δ),
init = init_1 →
∀ (t t_1 : Std.ExtDTreeMap α β cmp),
... | null | true |
isConjRoot_algHom_iff | Mathlib.FieldTheory.Minpoly.IsConjRoot | ∀ {R : Type u_1} {B : Type u_6} [inst : CommRing R] [inst_1 : Ring B] [inst_2 : Algebra R B] {A : Type u_7}
[inst_3 : DivisionRing A] [inst_4 : Algebra R A] [Nontrivial B] {x y : A} (f : A →ₐ[R] B),
IsConjRoot R (f x) (f y) ↔ IsConjRoot R x y | If `y` is a conjugate root of `x` in some division ring and `f` is an `R`-algebra homomorphism, then
`f y` is a conjugate root of `f x`.
| true |
Nat.instMeasurableSingletonClass | Mathlib.MeasureTheory.MeasurableSpace.Instances | MeasurableSingletonClass ℕ | null | true |
UniformConvergenceCLM.piEquivL._proof_9 | Mathlib.Topology.Algebra.Module.Spaces.UniformConvergenceCLM | ∀ (𝕜 : Type u_1) [inst : NormedField 𝕜] {ι : Type u_2} (F : ι → Type u_3) [inst_1 : (i : ι) → AddCommGroup (F i)]
[inst_2 : (i : ι) → Module 𝕜 (F i)], SMulCommClass 𝕜 𝕜 ((i : ι) → F i) | null | false |
_private.Mathlib.Analysis.Convex.Deriv.0.StrictMonoOn.exists_slope_lt_deriv._simp_1_1 | Mathlib.Analysis.Convex.Deriv | ∀ {G₀ : Type u_3} [inst : GroupWithZero G₀] [inst_1 : PartialOrder G₀] [MulPosReflectLT G₀] {a b c : G₀},
0 < c → (b / c < a) = (b < a * c) | null | false |
List.findM?'.match_1 | Mathlib.Data.List.Defs | (motive : ULift.{u_1, 0} Bool → Sort u_2) → (x : ULift.{u_1, 0} Bool) → ((px : Bool) → motive { down := px }) → motive x | null | false |
SeqCompactSpace.tendsto_subseq | Mathlib.Topology.Sequences | ∀ {X : Type u_1} [inst : TopologicalSpace X] [SeqCompactSpace X] (x : ℕ → X),
∃ a φ, StrictMono φ ∧ Filter.Tendsto (x ∘ φ) Filter.atTop (nhds a) | null | true |
Lean.Grind.Field.IsOrdered.mul_lt_mul_iff_of_pos_left | Init.Grind.Ordered.Field | ∀ {R : Type u} [inst : Lean.Grind.Field R] [inst_1 : LE R] [inst_2 : LT R] [Std.LawfulOrderLT R]
[inst_4 : Std.IsLinearOrder R] [Lean.Grind.OrderedRing R] {a b c : R}, 0 < c → (c * a < c * b ↔ a < b) | null | true |
eqRec_heq_iff._simp_1 | Init.SimpLemmas | ∀ {β : Sort v} {α : Sort u} {a : α} {motive : (b : α) → a = b → Sort v} {b : α} {refl : motive a ⋯} {h : a = b} {c : β},
(h ▸ refl ≍ c) = (refl ≍ c) | null | false |
Substring.Raw.ValidFor.atEnd | Batteries.Data.String.Lemmas | ∀ {l m r : List Char} {p : ℕ} {s : Substring.Raw},
Substring.Raw.ValidFor l m r s → (s.atEnd { byteIdx := p } = true ↔ p = String.utf8Len m) | null | true |
List.Vector.scanl.eq_1 | Mathlib.Data.Vector.Basic | ∀ {α : Type u_1} {n : ℕ} {β : Type u_6} (f : β → α → β) (b : β) (v : List.Vector α n),
List.Vector.scanl f b v = ⟨List.scanl f b v.toList, ⋯⟩ | null | true |
_private.Mathlib.AlgebraicGeometry.EllipticCurve.Jacobian.Basic.0.WeierstrassCurve.Jacobian.X_eq_of_equiv._simp_1_2 | Mathlib.AlgebraicGeometry.EllipticCurve.Jacobian.Basic | ∀ {R : Type r} [inst : CommRing R] (P : Fin 3 → R) (u : R), (u • P) 1 = u ^ 3 * P 1 | null | false |
instSelfSliceSubarrayDataSubarray | Init.Data.Array.Subarray | ∀ {α : Type u}, Std.Slice.Self (Std.Slice (Std.Slice.Internal.SubarrayData α)) (Subarray α) | null | true |
norm_div | Mathlib.Analysis.Normed.Field.Basic | ∀ {α : Type u_1} [inst : NormedDivisionRing α] (a b : α), ‖a / b‖ = ‖a‖ / ‖b‖ | null | true |
_private.Batteries.Data.List.Basic.0.List.all₂._sparseCasesOn_1.else_eq | Batteries.Data.List.Basic | ∀ {α : Type u} {motive : List α → Sort u_1} (t : List α) (nil : motive [])
(«else» : Nat.hasNotBit 1 t.ctorIdx → motive t) (h : Nat.hasNotBit 1 t.ctorIdx),
List.all₂._sparseCasesOn_1✝ t nil «else» = «else» h | null | false |
TietzeExtension.of_homeo | Mathlib.Topology.TietzeExtension | ∀ {Y : Type v} {Z : Type w} [inst : TopologicalSpace Y] [inst_1 : TopologicalSpace Z] [TietzeExtension Z] (e : Y ≃ₜ Z),
TietzeExtension Y | Any homeomorphism from a `TietzeExtension` space is one itself. | true |
CategoryTheory.Limits.Cotrident.mkHom._proof_1 | Mathlib.CategoryTheory.Limits.Shapes.WideEqualizers | ∀ {J : Type u_1} {C : Type u_3} [inst : CategoryTheory.Category.{u_2, u_3} C] {X Y : C} {f : J → (X ⟶ Y)} [Nonempty J]
{s t : CategoryTheory.Limits.Cotrident f} (k : s.pt ⟶ t.pt),
CategoryTheory.CategoryStruct.comp s.π k = t.π →
∀ (j : CategoryTheory.Limits.WalkingParallelFamily J), CategoryTheory.CategoryStruc... | null | false |
CategoryTheory.Comonad.ComonadicityInternal.main_pair_coreflexive | Mathlib.CategoryTheory.Monad.Comonadicity | ∀ {C : Type u₁} {D : Type u₂} [inst : CategoryTheory.Category.{v₁, u₁} C] [inst_1 : CategoryTheory.Category.{v₁, u₂} D]
{F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (A : adj.toComonad.Coalgebra),
CategoryTheory.IsCoreflexivePair (G.map A.a) (adj.unit.app (G.obj A.A)) | The "main pair" for a coalgebra `(A, α)` is the pair of morphisms `(G α, η_GA)`. It is always a
coreflexive pair, and will be used to construct the left adjoint to the comparison functor and show
it is an equivalence.
| true |
Batteries.Tactic.Lint.LintVerbosity.low.elim | Batteries.Tactic.Lint.Frontend | {motive : Batteries.Tactic.Lint.LintVerbosity → Sort u} →
(t : Batteries.Tactic.Lint.LintVerbosity) → t.ctorIdx = 0 → motive Batteries.Tactic.Lint.LintVerbosity.low → motive t | null | false |
TopologicalSpace.Opens.openPartialHomeomorphSubtypeCoe._proof_1 | Mathlib.Topology.OpenPartialHomeomorph.Basic | ∀ {X : Type u_1} [inst : TopologicalSpace X] (s : TopologicalSpace.Opens X), Topology.IsOpenEmbedding Subtype.val | null | false |
Equiv.Perm.sigmaCongrRightHom | Mathlib.Algebra.Group.End | {α : Type u_7} → (β : α → Type u_8) → ((a : α) → Equiv.Perm (β a)) →* Equiv.Perm ((a : α) × β a) | `Equiv.Perm.sigmaCongrRight` as a `MonoidHom`.
This is particularly useful for its `MonoidHom.range` projection, which is the subgroup of
permutations which do not exchange elements between fibers. | true |
ContMDiffMap.coeFnAlgHom._proof_7 | Mathlib.Geometry.Manifold.Algebra.SmoothFunctions | ∀ {𝕜 : Type u_3} [inst : NontriviallyNormedField 𝕜] {E : Type u_4} [inst_1 : NormedAddCommGroup E]
[inst_2 : NormedSpace 𝕜 E] {H : Type u_5} [inst_3 : TopologicalSpace H] {I : ModelWithCorners 𝕜 E H} {N : Type u_2}
[inst_4 : TopologicalSpace N] [inst_5 : ChartedSpace H N] {n : WithTop ℕ∞} {A : Type u_1} [inst_6... | null | false |
_private.Mathlib.AlgebraicTopology.SimplexCategory.DeltaZeroIter.0.SimplexCategory.δ₀Iter_σ._proof_1_3 | Mathlib.AlgebraicTopology.SimplexCategory.DeltaZeroIter | ∀ (i : ℕ) {n m : ℕ}, n + (i + 1) = m + 1 → ∀ (k : Fin ({ len := n }.len + 1)), i + ↑k + 1 < m + 1 + 1 | null | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.