name stringlengths 2 347 | module stringlengths 6 90 | type stringlengths 1 5.67M | allowCompletion bool 2
classes |
|---|---|---|---|
Lean.Lsp.InitializationOptions.hasWidgets? | Lean.Data.Lsp.InitShutdown | Lean.Lsp.InitializationOptions → Option Bool | true |
_private.Mathlib.AlgebraicGeometry.EllipticCurve.Jacobian.Point.0.WeierstrassCurve.Jacobian.Point.toAffine_some._simp_1_1 | Mathlib.AlgebraicGeometry.EllipticCurve.Jacobian.Point | ∀ {R : Type r} (a b c : R), ![a, b, c] 0 = a | false |
Filter.Tendsto.atTop_of_add_le_const | Mathlib.Order.Filter.AtTopBot.Monoid | ∀ {α : Type u_1} {M : Type u_2} [inst : AddCommMonoid M] [inst_1 : Preorder M] [IsOrderedCancelAddMonoid M]
{l : Filter α} {f g : α → M},
(∃ C, ∀ (x : α), g x ≤ C) → Filter.Tendsto (fun x => f x + g x) l Filter.atTop → Filter.Tendsto f l Filter.atTop | true |
groupCohomology.coboundaries₁_le_cocycles₁ | Mathlib.RepresentationTheory.Homological.GroupCohomology.LowDegree | ∀ {k G : Type u} [inst : CommRing k] [inst_1 : Group G] (A : Rep.{max u u_1, u, u} k G),
groupCohomology.coboundaries₁ A ≤ groupCohomology.cocycles₁ A | true |
Padic.limSeq | Mathlib.NumberTheory.Padics.PadicNumbers | {p : ℕ} → [inst : Fact (Nat.Prime p)] → CauSeq ℚ_[p] ⇑padicNormE → ℕ → ℚ | true |
Vector.eq_empty | Init.Data.Vector.Lemmas | ∀ {α : Type u_1} {xs : Vector α 0}, xs = #v[] | true |
_private.Mathlib.LinearAlgebra.ExteriorAlgebra.Grading.0.ExteriorAlgebra.ιMulti_span.match_1_1 | Mathlib.LinearAlgebra.ExteriorAlgebra.Grading | ∀ (R : Type u_1) (M : Type u_2) [inst : CommRing R] [inst_1 : AddCommGroup M] [inst_2 : Module R M] {i : ℕ}
(motive : ↥(⋀[R]^i M) → Prop) (hm : ↥(⋀[R]^i M)),
(∀ (m : ExteriorAlgebra R M) (hm : m ∈ ⋀[R]^i M), motive ⟨m, hm⟩) → motive hm | false |
_private.Lean.Elab.PreDefinition.WF.GuessLex.0.Lean.Elab.WF.GuessLex.explainMutualFailure.match_1 | Lean.Elab.PreDefinition.WF.GuessLex | (motive : Array (Array String) × String → Sort u_1) →
(__discr : Array (Array String) × String) →
((headerss : Array (Array String)) → (footer : String) → motive (headerss, footer)) → motive __discr | false |
Lean.Meta.instReduceEvalUInt64_qq | Qq.ForLean.ReduceEval | Lean.Meta.ReduceEval UInt64 | true |
Std.Iterators.Types.Zip.right | Std.Data.Iterators.Combinators.Monadic.Zip | {α₁ : Type w} →
{m : Type w → Type w'} →
{β₁ : Type w} →
[inst : Std.Iterator α₁ m β₁] → {α₂ β₂ : Type w} → Std.Iterators.Types.Zip α₁ m α₂ β₂ → Std.IterM m β₂ | true |
Vector.eraseIdx_append_of_lt_size._proof_2 | Init.Data.Vector.Erase | ∀ {n k : ℕ}, k < n → n - 1 + n = n + n - 1 | false |
_private.Lean.Meta.Sym.Simp.EvalGround.0.Lean.Meta.Sym.Simp.evalUnaryBitVec'.match_1 | Lean.Meta.Sym.Simp.EvalGround | (motive : OptionT Id Lean.Meta.Sym.BitVecValue → Sort u_1) →
(x : OptionT Id Lean.Meta.Sym.BitVecValue) →
((a : Lean.Meta.Sym.BitVecValue) → motive (some a)) →
((x : OptionT Id Lean.Meta.Sym.BitVecValue) → motive x) → motive x | false |
Matrix.IsAdjMatrix.toGraph_adj | Mathlib.Combinatorics.SimpleGraph.AdjMatrix | ∀ {α : Type u_1} {V : Type u_2} {A : Matrix V V α} [inst : MulZeroOneClass α] [inst_1 : Nontrivial α]
(h : A.IsAdjMatrix) (i j : V), h.toGraph.Adj i j = (A i j = 1) | true |
Function.Surjective.moduleLeft._proof_3 | Mathlib.Algebra.Module.RingHom | ∀ {R : Type u_3} {S : Type u_2} {M : Type u_1} [inst : Semiring R] [inst_1 : AddCommMonoid M] [inst_2 : Module R M]
[inst_3 : Semiring S] [inst_4 : SMul S M] (f : R →+* S) (hf : Function.Surjective ⇑f)
(hsmul : ∀ (c : R) (x : M), f c • x = c • x) (y₁ y₂ : S) (x : M), (y₁ + y₂) • x = y₁ • x + y₂ • x | false |
Std.HashMap.getKeyD_alter_self | Std.Data.HashMap.Lemmas | ∀ {α : Type u} {β : Type v} {x : BEq α} {x_1 : Hashable α} {m : Std.HashMap α β} [EquivBEq α] [LawfulHashable α]
[Inhabited α] {k fallback : α} {f : Option β → Option β},
(m.alter k f).getKeyD k fallback = if (f m[k]?).isSome = true then k else fallback | true |
TopModuleCat.isColimitCoker._proof_4 | Mathlib.Algebra.Category.ModuleCat.Topology.Homology | ∀ {R : Type u_1} [inst : Ring R] [inst_1 : TopologicalSpace R] {M N : TopModuleCat R} (φ : M ⟶ N)
(s : CategoryTheory.Limits.CokernelCofork φ), ContinuousSMul R ↑s.1.toModuleCat | false |
ValuationRing.iff_dvd_total | Mathlib.RingTheory.Valuation.ValuationRing | ∀ {R : Type u_1} [inst : CommRing R] [inst_1 : IsDomain R], ValuationRing R ↔ Std.Total fun x1 x2 => x1 ∣ x2 | true |
disjointed_add_one | Mathlib.Algebra.Order.Disjointed | ∀ {α : Type u_1} {ι : Type u_2} [inst : GeneralizedBooleanAlgebra α] [inst_1 : LinearOrder ι]
[inst_2 : LocallyFiniteOrderBot ι] [inst_3 : Add ι] [inst_4 : One ι] [SuccAddOrder ι] [NoMaxOrder ι] (f : ι → α)
(i : ι), disjointed f (i + 1) = f (i + 1) \ (partialSups f) i | true |
MulEquiv.mapSubgroup.eq_1 | Mathlib.Algebra.Group.Subgroup.Map | ∀ {G : Type u_1} [inst : Group G] {H : Type u_6} [inst_1 : Group H] (f : G ≃* H),
f.mapSubgroup =
{ toFun := Subgroup.map ↑f, invFun := Subgroup.map ↑f.symm, left_inv := ⋯, right_inv := ⋯, map_rel_iff' := ⋯ } | true |
Lean.Lsp.ShowDocumentClientCapabilities | Lean.Data.Lsp.Capabilities | Type | true |
_private.Mathlib.Order.Partition.Finpartition.0.Finpartition.exists_le_of_le._proof_1_2 | Mathlib.Order.Partition.Finpartition | ∀ {α : Type u_1} [inst : Lattice α] [inst_1 : OrderBot α] {a b : α} {P Q : Finpartition a},
(∀ p ∈ P.parts, ∃ q ∈ Q.parts.erase b, p ≤ q) → P.parts.sup id ≤ (Q.parts.erase b).sup id | false |
_private.Mathlib.LinearAlgebra.Dimension.Finite.0.Module.finite_finsupp_iff._simp_1_4 | Mathlib.LinearAlgebra.Dimension.Finite | ∀ {α : Type u_1}, (¬Subsingleton α) = Nontrivial α | false |
SimpleGraph.Finsubgraph.coe_compl._simp_1 | Mathlib.Combinatorics.SimpleGraph.Finsubgraph | ∀ {V : Type u} {G : SimpleGraph V} [inst : Finite V] (G' : G.Finsubgraph), (↑G')ᶜ = ↑G'ᶜ | false |
MeasureTheory.Measure.isOpenPosMeasure_smul | Mathlib.MeasureTheory.Measure.OpenPos | ∀ {X : Type u_1} [inst : TopologicalSpace X] {m : MeasurableSpace X} (μ : MeasureTheory.Measure X) [μ.IsOpenPosMeasure]
{c : ENNReal}, c ≠ 0 → (c • μ).IsOpenPosMeasure | true |
_private.Mathlib.CategoryTheory.NatTrans.0.CategoryTheory.NatTrans.ext.match_1 | Mathlib.CategoryTheory.NatTrans | ∀ {C : Type u_3} {inst : CategoryTheory.Category.{u_1, u_3} C} {D : Type u_4}
{inst_1 : CategoryTheory.Category.{u_2, u_4} D} {F G : CategoryTheory.Functor C D}
(motive : CategoryTheory.NatTrans F G → Prop) (h : CategoryTheory.NatTrans F G),
(∀ (app : (X : C) → F.obj X ⟶ G.obj X)
(naturality :
autoP... | false |
Lean.IR.ExpandResetReuse.removeSelfSet | Lean.Compiler.IR.ExpandResetReuse | Lean.IR.ExpandResetReuse.Context → Lean.IR.FnBody → Lean.IR.FnBody | true |
CategoryTheory.Localization.instHasSmallLocalizedHomObjShiftFunctor | Mathlib.CategoryTheory.Localization.SmallShiftedHom | ∀ {C : Type u₁} [inst : CategoryTheory.Category.{v₁, u₁} C] (W : CategoryTheory.MorphismProperty C) {M : Type w'}
[inst_1 : AddMonoid M] [inst_2 : CategoryTheory.HasShift C M] (X Y : C)
[CategoryTheory.Localization.HasSmallLocalizedShiftedHom W M X Y] (m : M),
CategoryTheory.Localization.HasSmallLocalizedHom W X ... | true |
Lean.Meta.Hint.Suggestion | Lean.Meta.Hint | Type | true |
_private.Mathlib.MeasureTheory.Function.LpSpace.Basic.0.MeasureTheory.Lp.instNormedAddCommGroup._simp_3 | Mathlib.MeasureTheory.Function.LpSpace.Basic | ∀ {r q : NNReal}, (↑r ≤ ↑q) = (r ≤ q) | false |
Quaternion.instRing._proof_45 | Mathlib.Algebra.Quaternion | ∀ {R : Type u_1} [inst : CommRing R],
autoParam (∀ (n : ℕ), IntCast.intCast ↑n = ↑n) AddGroupWithOne.intCast_ofNat._autoParam | false |
OpenPartialHomeomorph.subtypeRestr_source | Mathlib.Topology.OpenPartialHomeomorph.Constructions | ∀ {X : Type u_1} {Y : Type u_3} [inst : TopologicalSpace X] [inst_1 : TopologicalSpace Y]
(e : OpenPartialHomeomorph X Y) {s : TopologicalSpace.Opens X} (hs : Nonempty ↥s),
(e.subtypeRestr hs).source = Subtype.val ⁻¹' e.source | true |
AddMonoidAlgebra.mapDomain.eq_1 | Mathlib.Algebra.MonoidAlgebra.MapDomain | ∀ {R : Type u_3} {M : Type u_6} {N : Type u_7} [inst : Semiring R] (f : M → N) (x : AddMonoidAlgebra R M),
AddMonoidAlgebra.mapDomain f x = Finsupp.mapDomain f x | true |
_private.Lean.Elab.PatternVar.0.Lean.Elab.Term.CollectPatternVars.collect.processCtorApp._sparseCasesOn_1 | Lean.Elab.PatternVar | {motive : Lean.Elab.Term.Arg → Sort u} →
(t : Lean.Elab.Term.Arg) →
((val : Lean.Syntax) → motive (Lean.Elab.Term.Arg.stx val)) → (Nat.hasNotBit 1 t.ctorIdx → motive t) → motive t | false |
Int.Linear.orOver_one | Init.Data.Int.Linear | ∀ {p : ℕ → Prop}, Int.Linear.OrOver 1 p → p 0 | true |
CategoryTheory.GlueData.mapGlueData._proof_6 | Mathlib.CategoryTheory.GlueData | ∀ {C : Type u_3} [inst : CategoryTheory.Category.{u_1, u_3} C] {C' : Type u_2}
[inst_1 : CategoryTheory.Category.{u_1, u_2} C'] (D : CategoryTheory.GlueData C) (F : CategoryTheory.Functor C C')
[inst_2 : ∀ (i j k : D.J), CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.cospan (D.f i j) (D.f i k)) F]
(i... | false |
_private.Mathlib.Order.Fin.Tuple.0.Fin.preimage_insertNth_Icc_of_notMem._simp_1_1 | Mathlib.Order.Fin.Tuple | ∀ {α : Type u} {β : Type v} {f : α → β} {s : Set β} {a : α}, (a ∈ f ⁻¹' s) = (f a ∈ s) | false |
_private.Mathlib.LinearAlgebra.Dimension.DivisionRing.0.rank_add_rank_split._simp_1_2 | Mathlib.LinearAlgebra.Dimension.DivisionRing | ∀ {R : Type u_1} {R₂ : Type u_2} {M : Type u_5} {M₂ : Type u_7} [inst : Semiring R] [inst_1 : Semiring R₂]
[inst_2 : AddCommMonoid M] [inst_3 : AddCommMonoid M₂] [inst_4 : Module R M] [inst_5 : Module R₂ M₂] {τ₁₂ : R →+* R₂}
{f : M →ₛₗ[τ₁₂] M₂} {y : M}, (y ∈ f.ker) = (f y = 0) | false |
WeierstrassCurve.Jacobian.fin3_def_ext | Mathlib.AlgebraicGeometry.EllipticCurve.Jacobian.Basic | ∀ {R : Type r} (a b c : R), ![a, b, c] 0 = a ∧ ![a, b, c] 1 = b ∧ ![a, b, c] 2 = c | true |
Hyperreal.Infinitesimal | Mathlib.Analysis.Real.Hyperreal | ℝ* → Prop | true |
LinearPMap._sizeOf_inst | Mathlib.LinearAlgebra.LinearPMap | (R : Type u) →
{inst : Ring R} →
(E : Type v) →
{inst_1 : AddCommGroup E} →
{inst_2 : Module R E} →
(F : Type w) →
{inst_3 : AddCommGroup F} →
{inst_4 : Module R F} → [SizeOf R] → [SizeOf E] → [SizeOf F] → SizeOf (E →ₗ.[R] F) | false |
hfdifferential._proof_2 | Mathlib.Geometry.Manifold.DerivationBundle | ∀ {𝕜 : Type u_1} [inst : NontriviallyNormedField 𝕜] {E : Type u_3} [inst_1 : NormedAddCommGroup E]
[inst_2 : NormedSpace 𝕜 E] {H : Type u_4} [inst_3 : TopologicalSpace H] {I : ModelWithCorners 𝕜 E H} {M : Type u_2}
[inst_4 : TopologicalSpace M] [inst_5 : ChartedSpace H M] {E' : Type u_5} [inst_6 : NormedAddComm... | false |
_private.Aesop.Forward.State.0.Aesop.instBEqRawHyp.beq._sparseCasesOn_2 | Aesop.Forward.State | {motive : Aesop.RawHyp → Sort u} →
(t : Aesop.RawHyp) →
((subst : Aesop.Substitution) → motive (Aesop.RawHyp.patSubst subst)) →
(Nat.hasNotBit 2 t.ctorIdx → motive t) → motive t | false |
Finpartition.casesOn | Mathlib.Order.Partition.Finpartition | {α : Type u_1} →
[inst : Lattice α] →
[inst_1 : OrderBot α] →
{a : α} →
{motive : Finpartition a → Sort u} →
(t : Finpartition a) →
((parts : Finset α) →
(supIndep : parts.SupIndep id) →
(sup_parts : parts.sup id = a) →
(bot... | false |
CategoryTheory.Bicategory.Adj.Hom.noConfusion | Mathlib.CategoryTheory.Bicategory.Adjunction.Adj | {P : Sort u_1} →
{B : Type u} →
{inst : CategoryTheory.Bicategory B} →
{a b : B} →
{t : CategoryTheory.Bicategory.Adj.Hom a b} →
{B' : Type u} →
{inst' : CategoryTheory.Bicategory B'} →
{a' b' : B'} →
{t' : CategoryTheory.Bicategory.Adj.Hom a' b'} ... | false |
Lean.Grind.CommRing.instBEqPoly.beq._sunfold | Init.Grind.Ring.CommSolver | Lean.Grind.CommRing.Poly → Lean.Grind.CommRing.Poly → Bool | false |
CategoryTheory.Adjunction.conesIsoComponentHom._proof_1 | Mathlib.CategoryTheory.Adjunction.Limits | ∀ {C : Type u_2} [inst : CategoryTheory.Category.{u_1, u_2} C] {D : Type u_6}
[inst_1 : CategoryTheory.Category.{u_5, u_6} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C}
(adj : F ⊣ G) {J : Type u_4} [inst_2 : CategoryTheory.Category.{u_3, u_4} J] {K : CategoryTheory.Functor J D}
(X : Cᵒᵖ) (t... | false |
primorial_one | Mathlib.NumberTheory.Primorial | primorial 1 = 1 | true |
ENormedAddMonoid.enorm_eq_zero | Mathlib.Analysis.Normed.Group.Defs | ∀ {E : Type u_8} {inst : TopologicalSpace E} [self : ENormedAddMonoid E] (x : E), ‖x‖ₑ = 0 ↔ x = 0 | true |
Lean.Meta.Omega.OmegaConfig.mk | Init.Meta.Defs | Bool → Bool → Bool → Bool → Lean.Meta.Omega.OmegaConfig | true |
Std.ExtTreeMap.isSome_maxKey?_modify_eq_isSome | Std.Data.ExtTreeMap.Lemmas | ∀ {α : Type u} {β : Type v} {cmp : α → α → Ordering} {t : Std.ExtTreeMap α β cmp} [inst : Std.TransCmp cmp] {k : α}
{f : β → β}, (t.modify k f).maxKey?.isSome = t.maxKey?.isSome | true |
CategoryTheory.ULift.equivalence_functor | Mathlib.CategoryTheory.Category.ULift | ∀ {C : Type u₁} [inst : CategoryTheory.Category.{v₁, u₁} C],
CategoryTheory.ULift.equivalence.functor = CategoryTheory.ULift.upFunctor | true |
ContinuousLinearMap.flipMultilinear._proof_6 | Mathlib.Analysis.Normed.Module.Multilinear.Basic | ∀ {𝕜 : Type u_3} {ι : Type u_4} {E : ι → Type u_5} {G : Type u_1} {G' : Type u_2} [inst : NontriviallyNormedField 𝕜]
[inst_1 : (i : ι) → SeminormedAddCommGroup (E i)] [inst_2 : (i : ι) → NormedSpace 𝕜 (E i)]
[inst_3 : SeminormedAddCommGroup G] [inst_4 : NormedSpace 𝕜 G] [inst_5 : SeminormedAddCommGroup G']
[i... | false |
Lean.ImportArtifacts.ofArray | Lean.Setup | Array System.FilePath → Lean.ImportArtifacts | true |
MonCat.of | Mathlib.Algebra.Category.MonCat.Basic | (M : Type u) → [Monoid M] → MonCat | true |
Std.DTreeMap.Raw.getKey!_diff_of_not_mem_right | Std.Data.DTreeMap.Raw.Lemmas | ∀ {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t₁ t₂ : Std.DTreeMap.Raw α β cmp} [inst : Inhabited α]
[Std.TransCmp cmp], t₁.WF → t₂.WF → ∀ {k : α}, k ∉ t₂ → (t₁ \ t₂).getKey! k = t₁.getKey! k | true |
Int16.toBitVec_div | Init.Data.SInt.Lemmas | ∀ {a b : Int16}, (a / b).toBitVec = a.toBitVec.sdiv b.toBitVec | true |
Filter.not_bddBelow_of_tendsto_atBot | Mathlib.Order.Filter.AtTopBot.Basic | ∀ {α : Type u_3} {β : Type u_4} [inst : Preorder β] {l : Filter α} [l.NeBot] {f : α → β} [NoMinOrder β],
Filter.Tendsto f l Filter.atBot → ¬BddBelow (Set.range f) | true |
entourageProd.match_1 | Mathlib.Topology.UniformSpace.Basic | {α : Type u_2} →
{β : Type u_1} →
(motive : (α × β) × α × β → Sort u_3) →
(x : (α × β) × α × β) → ((a₁ : α) → (b₁ : β) → (a₂ : α) → (b₂ : β) → motive ((a₁, b₁), a₂, b₂)) → motive x | false |
MeasureTheory.Measure.NullMeasurableSet.const_smul | Mathlib.MeasureTheory.Measure.Lebesgue.EqHaar | ∀ {E : Type u_1} [inst : NormedAddCommGroup E] [inst_1 : NormedSpace ℝ E] [inst_2 : MeasurableSpace E] [BorelSpace E]
[FiniteDimensional ℝ E] {μ : MeasureTheory.Measure E} [μ.IsAddHaarMeasure] {s : Set E},
MeasureTheory.NullMeasurableSet s μ → ∀ (r : ℝ), MeasureTheory.NullMeasurableSet (r • s) μ | true |
CategoryTheory.Enriched.FunctorCategory.functorEnrichedCategory._proof_2 | Mathlib.CategoryTheory.Enriched.FunctorCategory | ∀ (V : Type u_6) [inst : CategoryTheory.Category.{u_5, u_6} V] [inst_1 : CategoryTheory.MonoidalCategory V]
(C : Type u_4) [inst_2 : CategoryTheory.Category.{u_2, u_4} C] (J : Type u_3)
[inst_3 : CategoryTheory.Category.{u_1, u_3} J] [inst_4 : CategoryTheory.EnrichedOrdinaryCategory V C]
[inst_5 :
∀ (F₁ F₂ : ... | false |
Lean.Lsp.RpcCallParams.mk._flat_ctor | Lean.Data.Lsp.Extra | Lean.Lsp.TextDocumentIdentifier → Lean.Lsp.Position → UInt64 → Lean.Name → Lean.Json → Lean.Lsp.RpcCallParams | false |
Int.tdiv_dvd_tdiv | Init.Data.Int.DivMod.Lemmas | ∀ {a b c : ℤ}, a ∣ b → b ∣ c → b.tdiv a ∣ c.tdiv a | true |
Std.Tactic.BVDecide.BVBinPred.ult | Std.Tactic.BVDecide.Bitblast.BVExpr.Basic | Std.Tactic.BVDecide.BVBinPred | true |
_private.Lean.Meta.Basic.0.Lean.Meta.exposeRelevantUniverses._sparseCasesOn_1 | Lean.Meta.Basic | {motive : Lean.Expr → Sort u} →
(t : Lean.Expr) →
((declName : Lean.Name) → (us : List Lean.Level) → motive (Lean.Expr.const declName us)) →
((u : Lean.Level) → motive (Lean.Expr.sort u)) → (Nat.hasNotBit 24 t.ctorIdx → motive t) → motive t | false |
GroupCone.mk.injEq | Mathlib.Algebra.Order.Group.Cone | ∀ {G : Type u_1} [inst : CommGroup G] (toSubmonoid : Submonoid G)
(eq_one_of_mem_of_inv_mem' : ∀ {a : G}, a ∈ toSubmonoid.carrier → a⁻¹ ∈ toSubmonoid.carrier → a = 1)
(toSubmonoid_1 : Submonoid G)
(eq_one_of_mem_of_inv_mem'_1 : ∀ {a : G}, a ∈ toSubmonoid_1.carrier → a⁻¹ ∈ toSubmonoid_1.carrier → a = 1),
({ toSu... | true |
Set.BijOn.ncard_eq | Mathlib.Data.Set.Card | ∀ {α : Type u_1} {β : Type u_2} {s : Set α} {f : α → β} {t : Set β}, Set.BijOn f s t → s.ncard = t.ncard | true |
YoungDiagram.transpose_eq_iff | Mathlib.Combinatorics.Young.YoungDiagram | ∀ {μ ν : YoungDiagram}, μ.transpose = ν.transpose ↔ μ = ν | true |
_private.Lean.Elab.Tactic.BVDecide.Frontend.Normalize.Enums.0.Lean.Elab.Tactic.BVDecide.Frontend.Normalize.getMatchEqCondForAux.handleEnumWithDefault.intersperseDefault | Lean.Elab.Tactic.BVDecide.Frontend.Normalize.Enums | Lean.InductiveVal →
Lean.Expr → List Lean.Level → List (ℕ × Lean.Expr) → ℕ → List (ℕ × Lean.Expr) → Lean.MetaM (List (ℕ × Lean.Expr)) | true |
Nat.floor_sub_ofNat | Mathlib.Algebra.Order.Floor.Semiring | ∀ {R : Type u_1} [inst : Semiring R] [inst_1 : LinearOrder R] [inst_2 : FloorSemiring R] [IsStrictOrderedRing R]
[inst_4 : Sub R] [OrderedSub R] [ExistsAddOfLE R] (a : R) (n : ℕ) [inst_7 : n.AtLeastTwo],
⌊a - OfNat.ofNat n⌋₊ = ⌊a⌋₊ - OfNat.ofNat n | true |
WeierstrassCurve.Ψ₂Sq._proof_1 | Mathlib.AlgebraicGeometry.EllipticCurve.DivisionPolynomial.Basic | (3 + 1).AtLeastTwo | false |
Aesop.SafeRulesResult.ctorElimType | Aesop.Search.Expansion | {motive : Aesop.SafeRulesResult → Sort u} → ℕ → Sort (max 1 u) | false |
Std.Rcc.pairwise_toList_le | Init.Data.Range.Polymorphic.Lemmas | ∀ {α : Type u} {r : Std.Rcc α} [inst : LE α] [inst_1 : DecidableLE α] [LT α] [inst_3 : Std.PRange.UpwardEnumerable α]
[inst_4 : Std.PRange.LawfulUpwardEnumerable α] [Std.PRange.LawfulUpwardEnumerableLE α]
[inst_6 : Std.Rxc.IsAlwaysFinite α], List.Pairwise (fun a b => a ≤ b) r.toList | true |
Mathlib.Ineq.WithStrictness.casesOn | Mathlib.Tactic.LinearCombination.Lemmas | {motive : Mathlib.Ineq.WithStrictness → Sort u} →
(t : Mathlib.Ineq.WithStrictness) →
motive Mathlib.Ineq.WithStrictness.eq →
motive Mathlib.Ineq.WithStrictness.le →
((strict : Bool) → motive (Mathlib.Ineq.WithStrictness.lt strict)) → motive t | false |
CategoryTheory.CommGrp._sizeOf_inst | Mathlib.CategoryTheory.Monoidal.CommGrp_ | (C : Type u₁) →
{inst : CategoryTheory.Category.{v₁, u₁} C} →
{inst_1 : CategoryTheory.CartesianMonoidalCategory C} →
{inst_2 : CategoryTheory.BraidedCategory C} → [SizeOf C] → SizeOf (CategoryTheory.CommGrp C) | false |
CategoryTheory.Bicategory.Lan.CommuteWith.lanCompIso_inv | Mathlib.CategoryTheory.Bicategory.Kan.HasKan | ∀ {B : Type u} [inst : CategoryTheory.Bicategory B] {a b c : B} (f : a ⟶ b) (g : a ⟶ c)
[inst_1 : CategoryTheory.Bicategory.HasLeftKanExtension f g] {x : B} (h : c ⟶ x)
[inst_2 : CategoryTheory.Bicategory.Lan.CommuteWith f g h],
(CategoryTheory.Bicategory.Lan.CommuteWith.lanCompIso f g h).inv =
(CategoryTheor... | true |
Nat.ceil_ofNat | Mathlib.Algebra.Order.Floor.Semiring | ∀ {R : Type u_1} [inst : Semiring R] [inst_1 : LinearOrder R] [inst_2 : FloorSemiring R] [IsStrictOrderedRing R] (n : ℕ)
[inst_4 : n.AtLeastTwo], ⌈OfNat.ofNat n⌉₊ = OfNat.ofNat n | true |
SimplexCategory.orderIsoOfIso._proof_1 | Mathlib.AlgebraicTopology.SimplexCategory.Basic | ∀ {x y : SimplexCategory} (e : x ≅ y) (i : Fin (x.len + 1)),
(SimplexCategory.Hom.toOrderHom e.inv) ((SimplexCategory.Hom.toOrderHom e.hom) i) = i | false |
MulRingNormClass.mk | Mathlib.Algebra.Order.Hom.Basic | ∀ {F : Type u_7} {α : outParam (Type u_8)} {β : outParam (Type u_9)} [inst : NonAssocRing α] [inst_1 : Semiring β]
[inst_2 : PartialOrder β] [inst_3 : FunLike F α β] [toMulRingSeminormClass : MulRingSeminormClass F α β],
(∀ (f : F) {a : α}, f a = 0 → a = 0) → MulRingNormClass F α β | true |
Encodable.encode_prod_val | Mathlib.Logic.Encodable.Basic | ∀ {α : Type u_1} {β : Type u_2} [inst : Encodable α] [inst_1 : Encodable β] (a : α) (b : β),
Encodable.encode (a, b) = Nat.pair (Encodable.encode a) (Encodable.encode b) | true |
_private.Lean.Meta.Tactic.Simp.BuiltinSimprocs.String.0.String.reduceListChar._unsafe_rec | Lean.Meta.Tactic.Simp.BuiltinSimprocs.String | Lean.Expr → String → Lean.Meta.SimpM Lean.Meta.Simp.DStep | false |
USize.reduceToNat._regBuiltin.USize.reduceToNat.declare_1._@.Lean.Meta.Tactic.Simp.BuiltinSimprocs.UInt.1306150149._hygCtx._hyg.17 | Lean.Meta.Tactic.Simp.BuiltinSimprocs.UInt | IO Unit | false |
Relator.RightTotal.rel_forall | Mathlib.Logic.Relator | ∀ {α : Sort u₁} {β : Sort u₂} {R : α → β → Prop},
Relator.RightTotal R →
Relator.LiftFun (Relator.LiftFun R fun x1 x2 => ∀ (a : x1), x2) (fun x1 x2 => ∀ (a : x1), x2)
(fun p => (i : α) → p i) fun q => ∀ (i : β), q i | true |
_private.Lean.Elab.Tactic.Grind.BuiltinTactic.0.Lean.Elab.Tactic.Grind.evalFinish._regBuiltin._private.Lean.Elab.Tactic.Grind.BuiltinTactic.0.Lean.Elab.Tactic.Grind.evalFinish_1 | Lean.Elab.Tactic.Grind.BuiltinTactic | IO Unit | false |
posMulMono_iff | Mathlib.Algebra.Order.GroupWithZero.Unbundled.Defs | ∀ (α : Type u_1) [inst : Mul α] [inst_1 : Zero α] [inst_2 : Preorder α],
PosMulMono α ↔ ∀ ⦃a : α⦄, 0 ≤ a → ∀ ⦃b c : α⦄, b ≤ c → a * b ≤ a * c | true |
Relation.ReflGen.rec | Mathlib.Logic.Relation | ∀ {α : Sort u_1} {r : α → α → Prop} {a : α} {motive : (a_1 : α) → Relation.ReflGen r a a_1 → Prop},
motive a ⋯ → (∀ {b : α} (a_1 : r a b), motive b ⋯) → ∀ {a_1 : α} (t : Relation.ReflGen r a a_1), motive a_1 t | false |
Filter.HasBasis.prod | Mathlib.Order.Filter.Bases.Basic | ∀ {α : Type u_1} {β : Type u_2} {la : Filter α} {lb : Filter β} {ι : Type u_6} {ι' : Type u_7} {pa : ι → Prop}
{sa : ι → Set α} {pb : ι' → Prop} {sb : ι' → Set β},
la.HasBasis pa sa → lb.HasBasis pb sb → (la ×ˢ lb).HasBasis (fun i => pa i.1 ∧ pb i.2) fun i => sa i.1 ×ˢ sb i.2 | true |
_private.Mathlib.Algebra.Polynomial.CoeffMem.0.Polynomial.coeff_divModByMonicAux_mem_span_pow_mul_span._simp_1_4 | Mathlib.Algebra.Polynomial.CoeffMem | ∀ {R : Type u} [inst : Semiring R] {p : Polynomial R}, (p.degree = ⊥) = (p = 0) | false |
Function.Injective.sumElim | Mathlib.Data.Sum.Basic | ∀ {α : Type u} {β : Type v} {γ : Sort u_3} {f : α → γ} {g : β → γ},
Function.Injective f → Function.Injective g → (∀ (a : α) (b : β), f a ≠ g b) → Function.Injective (Sum.elim f g) | true |
_private.Mathlib.Data.Nat.Bitwise.0.Nat.binaryRec_of_ne_zero._simp_1_1 | Mathlib.Data.Nat.Bitwise | ∀ {n : ℕ} {b : Bool}, (Nat.bit b n = 0) = (n = 0 ∧ b = false) | false |
_private.Mathlib.Data.EReal.Operations.0.EReal.mul_bot_of_neg.match_1_1 | Mathlib.Data.EReal.Operations | ∀ (motive : (x : EReal) → x < 0 → Prop) (x : EReal) (x_1 : x < 0),
(∀ (x : ⊥ < 0), motive none x) →
(∀ (x : ℝ) (h : ↑x < 0), motive (some (some x)) h) → (∀ (h : ⊤ < 0), motive (some none) h) → motive x x_1 | false |
_private.Init.Data.String.Basic.0.String.Pos.Raw.isValid_iff_exists_append._simp_1_2 | Init.Data.String.Basic | ∀ {i₁ i₂ : String.Pos.Raw}, (i₁ ≤ i₂) = (i₁.byteIdx ≤ i₂.byteIdx) | false |
_private.Mathlib.Analysis.Calculus.Deriv.Slope.0.hasDerivAtFilter_iff_tendsto_slope._simp_1_2 | Mathlib.Analysis.Calculus.Deriv.Slope | ∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {f : β → γ} {g : α → β} {x : Filter α} {y : Filter γ},
Filter.Tendsto f (Filter.map g x) y = Filter.Tendsto (f ∘ g) x y | false |
AddGroupSeminorm.toFun_eq_coe | Mathlib.Analysis.Normed.Group.Seminorm | ∀ {E : Type u_3} [inst : AddGroup E] {p : AddGroupSeminorm E}, p.toFun = ⇑p | true |
instModuleWeakSpace | Mathlib.Topology.Algebra.Module.WeakDual | (𝕜 : Type u_1) →
(E : Type u_2) →
[inst : CommSemiring 𝕜] →
[inst_1 : TopologicalSpace 𝕜] →
[inst_2 : ContinuousAdd 𝕜] →
[inst_3 : ContinuousConstSMul 𝕜 𝕜] →
[inst_4 : AddCommMonoid E] →
[inst_5 : Module 𝕜 E] → [inst_6 : TopologicalSpace E] → Module 𝕜 (Wea... | true |
Matrix.l2OpNormedAddCommGroupAux._proof_5 | Mathlib.Analysis.CStarAlgebra.Matrix | ∀ {𝕜 : Type u_1} {m : Type u_2} [inst : RCLike 𝕜], SMulCommClass 𝕜 𝕜 (WithLp 2 (m → 𝕜)) | false |
Mathlib.Tactic.Rify.ratCast_lt._simp_1 | Mathlib.Tactic.Rify | ∀ (a b : ℚ), (a < b) = (↑a < ↑b) | false |
Lean.Language.Lean.waitForFinalCmdState? | Lean.Language.Lean | Lean.Language.Lean.InitialSnapshot → Option Lean.Elab.Command.State | true |
DivInvOneMonoid.inv_one | Mathlib.Algebra.Group.Defs | ∀ {G : Type u_2} [self : DivInvOneMonoid G], 1⁻¹ = 1 | true |
_private.Mathlib.LinearAlgebra.QuadraticForm.Radical.0.QuadraticForm.radical_weightedSumSquares._simp_1_3 | Mathlib.LinearAlgebra.QuadraticForm.Radical | ∀ {M : Type u_4} [inst : AddMonoid M] [IsRightCancelAdd M] {a b : M}, (a + b = b) = (a = 0) | false |
Ideal.quotTorsionOfEquivSpanSingleton | Mathlib.Algebra.Module.Torsion.Basic | (R : Type u_1) →
(M : Type u_2) →
[inst : Ring R] →
[inst_1 : AddCommGroup M] → [inst_2 : Module R M] → (x : M) → (R ⧸ Ideal.torsionOf R M x) ≃ₗ[R] ↥(R ∙ x) | true |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.