name stringlengths 2 347 | module stringlengths 6 90 | type stringlengths 1 5.42M |
|---|---|---|
_private.Lean.Meta.Tactic.Grind.Arith.Cutsat.EqCnstr.0.Lean.Meta.Grind.Arith.Cutsat.SupportedTermKind.natAbs.sizeOf_spec | Lean.Meta.Tactic.Grind.Arith.Cutsat.EqCnstr | sizeOf Lean.Meta.Grind.Arith.Cutsat.SupportedTermKind.natAbs✝ = 1 |
Std.Iter.foldM_filterM | Init.Data.Iterators.Lemmas.Combinators.FilterMap | ∀ {α β δ : Type w} {n : Type w → Type w''} {o : Type w → Type w'''} [inst : Std.Iterator α Id β]
[Std.Iterators.Finite α Id] [inst_2 : Monad n] [inst_3 : MonadAttach n] [LawfulMonad n] [WeaklyLawfulMonadAttach n]
[inst_6 : Monad o] [LawfulMonad o] [inst_8 : Std.IteratorLoop α Id n] [inst_9 : Std.IteratorLoop α Id o]
[Std.LawfulIteratorLoop α Id n] [Std.LawfulIteratorLoop α Id o] [inst_12 : MonadLiftT n o] [LawfulMonadLiftT n o]
{f : β → n (ULift.{w, 0} Bool)} {g : δ → β → o δ} {init : δ} {it : Std.Iter β},
Std.IterM.foldM g init (Std.Iter.filterM f it) =
Std.Iter.foldM
(fun d b => do
let __do_lift ← liftM (f b)
if __do_lift.down = true then g d b else pure d)
init it |
_private.Init.Data.String.Lemmas.Pattern.String.ForwardSearcher.0.String.Slice.Pattern.Model.ForwardSliceSearcher.prefixFunctionRecurrence._unary._proof_5 | Init.Data.String.Lemmas.Pattern.String.ForwardSearcher | ∀ (pat : ByteArray) (stackPos : ℕ) (hst : stackPos < pat.size) (guess : ℕ) (hg : guess < stackPos)
(this : String.Slice.Pattern.Model.ForwardSliceSearcher.prefixFunction✝ pat (guess - 1) ⋯ < guess),
String.Slice.Pattern.Model.ForwardSliceSearcher.prefixFunction✝¹ pat (guess - 1) ⋯ < stackPos |
CategoryTheory.ComonObj.comul | Mathlib.CategoryTheory.Monoidal.Comon_ | {C : Type u₁} →
{inst : CategoryTheory.Category.{v₁, u₁} C} →
{inst_1 : CategoryTheory.MonoidalCategory C} →
{X : C} → [self : CategoryTheory.ComonObj X] → X ⟶ CategoryTheory.MonoidalCategoryStruct.tensorObj X X |
PointedCone.mem_closure | Mathlib.Analysis.Convex.Cone.Closure | ∀ {𝕜 : Type u_1} [inst : Semiring 𝕜] [inst_1 : PartialOrder 𝕜] [inst_2 : IsOrderedRing 𝕜] {E : Type u_2}
[inst_3 : AddCommMonoid E] [inst_4 : TopologicalSpace E] [inst_5 : ContinuousAdd E] [inst_6 : Module 𝕜 E]
[inst_7 : ContinuousConstSMul 𝕜 E] {K : PointedCone 𝕜 E} {a : E}, a ∈ K.closure ↔ a ∈ closure ↑K |
Continuous.fourier_inversion | Mathlib.Analysis.Fourier.Inversion | ∀ {V : Type u_1} {E : Type u_2} [inst : NormedAddCommGroup V] [inst_1 : InnerProductSpace ℝ V]
[inst_2 : MeasurableSpace V] [inst_3 : BorelSpace V] [inst_4 : FiniteDimensional ℝ V] [inst_5 : NormedAddCommGroup E]
[inst_6 : NormedSpace ℂ E] {f : V → E} [CompleteSpace E],
Continuous f →
MeasureTheory.Integrable f MeasureTheory.volume →
MeasureTheory.Integrable (FourierTransform.fourier f) MeasureTheory.volume →
FourierTransformInv.fourierInv (FourierTransform.fourier f) = f |
SeparationQuotient.instRing._proof_12 | Mathlib.Topology.Algebra.SeparationQuotient.Basic | ∀ {R : Type u_1} [inst : TopologicalSpace R] [inst_1 : Ring R] [inst_2 : IsTopologicalRing R] (x y : R),
SeparationQuotient.mk (x - y) = SeparationQuotient.mk x - SeparationQuotient.mk y |
Prod.instBornology._proof_1 | Mathlib.Topology.Bornology.Constructions | ∀ {α : Type u_1} {β : Type u_2} [inst : Bornology α] [inst_1 : Bornology β],
(Bornology.cobounded α).coprod (Bornology.cobounded β) ≤ Filter.cofinite |
_private.Mathlib.Combinatorics.SimpleGraph.Triangle.Removal.0.Mathlib.Meta.Positivity.evalTriangleRemovalBound.match_4 | Mathlib.Combinatorics.SimpleGraph.Triangle.Removal | (α : Q(Type)) →
(_zα : Q(Zero «$α»)) →
(_pα : Q(PartialOrder «$α»)) →
(ε : Q(ℝ)) →
(motive : Mathlib.Meta.Positivity.Strictness q(inferInstance) q(inferInstance) ε → Sort u_1) →
(__discr : Mathlib.Meta.Positivity.Strictness q(inferInstance) q(inferInstance) ε) →
((hε : Q(0 < «$ε»)) → motive (Mathlib.Meta.Positivity.Strictness.positive hε)) →
((x : Mathlib.Meta.Positivity.Strictness q(inferInstance) q(inferInstance) ε) → motive x) → motive __discr |
Lean.Compiler.LCNF.instTraverseFVarArg | Lean.Compiler.LCNF.FVarUtil | {pu : Lean.Compiler.LCNF.Purity} → Lean.Compiler.LCNF.TraverseFVar (Lean.Compiler.LCNF.Arg pu) |
Nat.mem_divisors_self | Mathlib.NumberTheory.Divisors | ∀ (n : ℕ), n ≠ 0 → n ∈ n.divisors |
CochainComplex.mappingCone.δ_descCochain._proof_2 | Mathlib.Algebra.Homology.HomotopyCategory.MappingCone | ∀ {n : ℤ} (n' : ℤ), n + 1 = n' → 1 + n = n' |
AlgebraicGeometry.Scheme.Cover.Over | Mathlib.AlgebraicGeometry.Cover.Over | (S : AlgebraicGeometry.Scheme) →
{P : CategoryTheory.MorphismProperty AlgebraicGeometry.Scheme} →
[P.IsStableUnderBaseChange] →
[AlgebraicGeometry.Scheme.IsJointlySurjectivePreserving P] →
{X : AlgebraicGeometry.Scheme} →
[X.Over S] → AlgebraicGeometry.Scheme.Cover (AlgebraicGeometry.Scheme.precoverage P) X → Type (max u u_1) |
Ordering.swap.eq_3 | Std.Data.DTreeMap.Internal.Model | Ordering.gt.swap = Ordering.lt |
ValuativeRel.ValueGroupWithZero.exact | Mathlib.RingTheory.Valuation.ValuativeRel.Basic | ∀ {R : Type u_1} [inst : CommRing R] [inst_1 : ValuativeRel R] {x y : R} {t s : ↥(ValuativeRel.posSubmonoid R)},
ValuativeRel.ValueGroupWithZero.mk x t = ValuativeRel.ValueGroupWithZero.mk y s → x * ↑s ≤ᵥ y * ↑t ∧ y * ↑t ≤ᵥ x * ↑s |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.