name stringlengths 2 347 | module stringlengths 6 90 | type stringlengths 1 5.67M | allowCompletion bool 2
classes |
|---|---|---|---|
Std.Rio.pairwise_toList_upwardEnumerableLt | Init.Data.Range.Polymorphic.Lemmas | ∀ {α : Type u} {r : Std.Rio α} [inst : LT α] [inst_1 : DecidableLT α] [inst_2 : Std.PRange.Least? α]
[inst_3 : Std.PRange.UpwardEnumerable α] [inst_4 : Std.PRange.LawfulUpwardEnumerable α]
[Std.PRange.LawfulUpwardEnumerableLT α] [Std.PRange.LawfulUpwardEnumerableLeast? α]
[inst_7 : Std.Rxo.IsAlwaysFinite α], List... | true |
_private.Std.Data.DTreeMap.Internal.Lemmas.0.Std.DTreeMap.Internal.Impl.Const.get?_empty._simp_1_2 | Std.Data.DTreeMap.Internal.Lemmas | ∀ {α : Type u} {instOrd : Ord α} {a b : α}, (compare a b ≠ Ordering.eq) = ((a == b) = false) | false |
_private.Aesop.Util.EqualUpToIds.0.Aesop.EqualUpToIds.Unsafe.exprsEqualUpToIdsCore₃.match_5 | Aesop.Util.EqualUpToIds | (motive : Lean.Expr → Lean.Expr → Sort u_1) →
(x x_1 : Lean.Expr) →
((i j : ℕ) → motive (Lean.Expr.bvar i) (Lean.Expr.bvar j)) →
((fvarId₁ fvarId₂ : Lean.FVarId) → motive (Lean.Expr.fvar fvarId₁) (Lean.Expr.fvar fvarId₂)) →
((u v : Lean.Level) → motive (Lean.Expr.sort u) (Lean.Expr.sort v)) →
... | false |
Std.TreeMap.isEmpty_emptyc | Std.Data.TreeMap.Lemmas | ∀ {α : Type u} {β : Type v} {cmp : α → α → Ordering}, ∅.isEmpty = true | true |
_private.Mathlib.Geometry.Manifold.MFDeriv.SpecificFunctions.0.hasMFDerivAt_inr._simp_1_1 | Mathlib.Geometry.Manifold.MFDeriv.SpecificFunctions | ∀ {𝕜 : Type u_1} [inst : NontriviallyNormedField 𝕜] {E : Type u_2} [inst_1 : NormedAddCommGroup E]
[inst_2 : NormedSpace 𝕜 E] {H : Type u_3} [inst_3 : TopologicalSpace H] {I : ModelWithCorners 𝕜 E H} {M : Type u_4}
[inst_4 : TopologicalSpace M] [inst_5 : ChartedSpace H M] {E' : Type u_5} [inst_6 : NormedAddComm... | false |
Int.neg_modEq_neg._simp_1 | Mathlib.Data.Int.ModEq | ∀ {n a b : ℤ}, (-a ≡ -b [ZMOD n]) = (a ≡ b [ZMOD n]) | false |
SimpleGraph.Walk.isSubwalk_nil_iff_mem_support._simp_1 | Mathlib.Combinatorics.SimpleGraph.Walk.Subwalks | ∀ {V : Type u_1} {G : SimpleGraph V} {u v v' : V} (p : G.Walk u v), SimpleGraph.Walk.nil.IsSubwalk p = (v' ∈ p.support) | false |
CliffordAlgebra.changeFormEquiv._proof_2 | Mathlib.LinearAlgebra.CliffordAlgebra.Contraction | ∀ {R : Type u_1} [inst : CommRing R] {M : Type u_2} [inst_1 : AddCommGroup M] [inst_2 : Module R M]
{Q Q' : QuadraticForm R M} {B : LinearMap.BilinForm R M} (h : LinearMap.BilinMap.toQuadraticMap B = Q' - Q)
(x : CliffordAlgebra Q), (CliffordAlgebra.changeForm ⋯) ((CliffordAlgebra.changeForm h) x) = x | false |
Std.DTreeMap.Raw.WF.casesOn | Std.Data.DTreeMap.Raw.Basic | {α : Type u} →
{β : α → Type v} →
{cmp : α → α → Ordering} →
{t : Std.DTreeMap.Raw α β cmp} →
{motive : t.WF → Sort u_1} → (t_1 : t.WF) → ((out : t.inner.WF) → motive ⋯) → motive t_1 | false |
_private.Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.FinTwo.0.Matrix.isParabolic_iff_exists._simp_1_3 | Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.FinTwo | ∀ {G : Type u_7} {H : Type u_8} {F : Type u_9} [inst : FunLike F G H] [inst_1 : AddGroup G]
[inst_2 : SubtractionMonoid H] [AddMonoidHomClass F G H] (f : F) (a b : G), f a - f b = f (a - b) | false |
Part.getOrElse_of_not_dom | Mathlib.Data.Part | ∀ {α : Type u_1} (a : Part α), ¬a.Dom → ∀ [inst : Decidable a.Dom] (d : α), a.getOrElse d = d | true |
CategoryTheory.Functor.PreOneHypercoverDenseData.multicospanIndex_left | Mathlib.CategoryTheory.Sites.DenseSubsite.OneHypercoverDense | ∀ {C₀ : Type u₀} {C : Type u} [inst : CategoryTheory.Category.{v₀, u₀} C₀] [inst_1 : CategoryTheory.Category.{v, u} C]
{F : CategoryTheory.Functor C₀ C} {A : Type u'} [inst_2 : CategoryTheory.Category.{v', u'} A] {X : C}
(data : F.PreOneHypercoverDenseData X) (P : CategoryTheory.Functor C₀ᵒᵖ A) (i : data.multicospa... | true |
_private.Mathlib.MeasureTheory.OuterMeasure.AE.0.MeasureTheory.diff_ae_eq_self._simp_1_1 | Mathlib.MeasureTheory.OuterMeasure.AE | ∀ {α : Type u} {β : Type v} [inst : PartialOrder β] {l : Filter α} {f g : α → β}, (f =ᶠ[l] g) = (f ≤ᶠ[l] g ∧ g ≤ᶠ[l] f) | false |
Mathlib.TacticAnalysis.TacticNode.ctxI | Mathlib.Tactic.TacticAnalysis | Mathlib.TacticAnalysis.TacticNode → Lean.Elab.ContextInfo | true |
Set.Ico_subset_Icc_union_Ico | Mathlib.Order.Interval.Set.LinearOrder | ∀ {α : Type u_1} [inst : LinearOrder α] {a b c : α}, Set.Ico a c ⊆ Set.Icc a b ∪ Set.Ico b c | true |
_private.Init.Data.String.Decode.0.String.utf8EncodeChar_eq_utf8EncodeCharFast._proof_1_12 | Init.Data.String.Decode | ∀ (c : Char), ¬c.val.toNat ≤ 2047 → c.val.toNat ≤ 65535 → ¬c.val.toNat / 2 ^ 12 < 256 → False | false |
Equiv.group.eq_1 | Mathlib.Algebra.Group.TransferInstance | ∀ {α : Type u_2} {β : Type u_3} (e : α ≃ β) [inst : Group β], e.group = Function.Injective.group ⇑e ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ | true |
Submonoid.orderOf_le_card | Mathlib.GroupTheory.OrderOfElement | ∀ {G : Type u_6} [inst : Group G] (s : Submonoid G), (↑s).Finite → ∀ {x : G}, x ∈ s → orderOf x ≤ Nat.card ↥s | true |
_private.Mathlib.Data.Fintype.Quotient.0.Quotient.list_ind.match_1_1 | Mathlib.Data.Fintype.Quotient | ∀ {ι : Type u_1} (motive : (a : ι) → a ∈ [] → Prop) (a : ι) (a_1 : a ∈ []), motive a a_1 | false |
IsCoveringMap.exists_path_lifts | Mathlib.Topology.Homotopy.Lifting | ∀ {E : Type u_1} {X : Type u_2} [inst : TopologicalSpace E] [inst_1 : TopologicalSpace X] {p : E → X},
IsCoveringMap p → ∀ (γ : C(↑unitInterval, X)) (e : E), γ 0 = p e → ∃ Γ, p ∘ ⇑Γ = ⇑γ ∧ Γ 0 = e | true |
String.isNat_iff | Std.Data.String.ToNat | ∀ {s : String},
s.isNat = true ↔
s ≠ "" ∧
(∀ c ∈ s.toList, c.isDigit = true ∨ c = '_') ∧
¬['_', '_'] <:+: s.toList ∧ s.toList.head? ≠ some '_' ∧ s.toList.getLast? ≠ some '_' | true |
MvPolynomial.algebraTensorAlgEquiv_symm_monomial | Mathlib.RingTheory.TensorProduct.MvPolynomial | ∀ (R : Type u) [inst : CommSemiring R] {σ : Type u_1} (A : Type u_4) [inst_1 : CommSemiring A] [inst_2 : Algebra R A]
(m : σ →₀ ℕ) (a : A),
(MvPolynomial.algebraTensorAlgEquiv R A).symm ((MvPolynomial.monomial m) a) = a ⊗ₜ[R] (MvPolynomial.monomial m) 1 | true |
Nat.doubleFactorial.eq_2 | Mathlib.Data.Nat.Factorial.DoubleFactorial | Nat.doubleFactorial 1 = 1 | true |
PresentedGroup.mk_eq_mk_of_inv_mul_mem | Mathlib.GroupTheory.PresentedGroup | ∀ {α : Type u_1} {rels : Set (FreeGroup α)} {x y : FreeGroup α},
x⁻¹ * y ∈ rels → (PresentedGroup.mk rels) x = (PresentedGroup.mk rels) y | true |
Std.Ric.LawfulRcoIntersection.mk | Init.Data.Range.Polymorphic.PRange | ∀ {α : Type w} [inst : LT α] [inst_1 : LE α] [inst_2 : Std.Ric.HasRcoIntersection α],
(∀ {a : α} {r : Std.Ric α} {s : Std.Rco α}, a ∈ Std.Ric.HasRcoIntersection.intersection r s ↔ a ∈ r ∧ a ∈ s) →
Std.Ric.LawfulRcoIntersection α | true |
CategoryTheory.MorphismProperty.RightFraction.rec | Mathlib.CategoryTheory.Localization.CalculusOfFractions | {C : Type u_1} →
[inst : CategoryTheory.Category.{v_1, u_1} C] →
{W : CategoryTheory.MorphismProperty C} →
{X Y : C} →
{motive : W.RightFraction X Y → Sort u} →
({X' : C} → (s : X' ⟶ X) → (hs : W s) → (f : X' ⟶ Y) → motive { X' := X', s := s, hs := hs, f := f }) →
(t : W.RightF... | false |
CategoryTheory.ObjectProperty.ContainsUnit.mk | Mathlib.CategoryTheory.Monoidal.Subcategory | ∀ {C : Type u} [inst : CategoryTheory.Category.{v, u} C] [inst_1 : CategoryTheory.MonoidalCategory C]
{P : CategoryTheory.ObjectProperty C}, P (CategoryTheory.MonoidalCategoryStruct.tensorUnit C) → P.ContainsUnit | true |
MeasureTheory.Measure.ext_prod₃_iff' | Mathlib.MeasureTheory.Measure.Prod | ∀ {α : Type u_4} {β : Type u_5} {γ : Type u_6} {mα : MeasurableSpace α} {mβ : MeasurableSpace β}
{mγ : MeasurableSpace γ} {μ ν : MeasureTheory.Measure ((α × β) × γ)} [MeasureTheory.IsFiniteMeasure μ],
μ = ν ↔
∀ {s : Set α} {t : Set β} {u : Set γ},
MeasurableSet s → MeasurableSet t → MeasurableSet u → μ ((... | true |
Std.Iterators.Types.Map | Init.Data.Iterators.Combinators.Monadic.FilterMap | Type w →
{β γ : Type w} →
(m : Type w → Type w') →
(n : Type w → Type w'') →
(⦃α : Type w⦄ → m α → n α) → [Functor n] → (β → Std.Iterators.PostconditionT n γ) → Type w | true |
Qq.SortLocalDecls.Context | Qq.SortLocalDecls | Type | true |
Std.TreeSet.max!_erase_eq_of_not_compare_max!_eq | Std.Data.TreeSet.Lemmas | ∀ {α : Type u} {cmp : α → α → Ordering} {t : Std.TreeSet α cmp} [Std.TransCmp cmp] [inst : Inhabited α] {k : α},
(t.erase k).isEmpty = false → ¬cmp k t.max! = Ordering.eq → (t.erase k).max! = t.max! | true |
List.length_sym._unary | Mathlib.Data.List.Sym | ∀ {α : Type u_1} (_x : (_ : ℕ) ×' List α), (List.sym _x.1 _x.2).length = _x.2.length.multichoose _x.1 | false |
Lean.Elab.WF.GuessLex.RecCallWithContext.mk.injEq | Lean.Elab.PreDefinition.WF.GuessLex | ∀ (ref : Lean.Syntax) (caller : ℕ) (params : Array Lean.Expr) (callee : ℕ) (args : Array Lean.Expr)
(ctxt : Lean.Elab.WF.GuessLex.SavedLocalContext) (ref_1 : Lean.Syntax) (caller_1 : ℕ) (params_1 : Array Lean.Expr)
(callee_1 : ℕ) (args_1 : Array Lean.Expr) (ctxt_1 : Lean.Elab.WF.GuessLex.SavedLocalContext),
({ re... | true |
Fin.add.match_1 | Init.Data.Fin.Basic | {n : ℕ} →
(motive : Fin n → Fin n → Sort u_1) →
(x x_1 : Fin n) → ((a : ℕ) → (h : a < n) → (b : ℕ) → (isLt : b < n) → motive ⟨a, h⟩ ⟨b, isLt⟩) → motive x x_1 | false |
_private.Lean.Data.RArray.0.Lean.RArray.ofFn.go | Lean.Data.RArray | {α : Type u_1} → {n : ℕ} → (Fin n → α) → (lb ub : ℕ) → lb < ub → ub ≤ n → Lean.RArray α | true |
Polynomial.Chebyshev.coeff_le_of_forall_abs_le_one | Mathlib.Analysis.SpecialFunctions.Trigonometric.Chebyshev.Extremal | ∀ {n : ℕ} {P : Polynomial ℝ},
P.degree ≤ ↑n → (∀ x ∈ Set.Icc (-1) 1, |Polynomial.eval x P| ≤ 1) → P.coeff n ≤ 2 ^ (n - 1) | true |
Lean.instReprBinderInfo | Lean.Expr | Repr Lean.BinderInfo | true |
CategoryTheory.Arrow.augmentedCechNerve._proof_2 | Mathlib.AlgebraicTopology.CechNerve | ∀ {C : Type u_2} [inst : CategoryTheory.Category.{u_1, u_2} C] (f : CategoryTheory.Arrow C)
[inst_1 : ∀ (n : ℕ), CategoryTheory.Limits.HasWidePullback f.right (fun x => f.left) fun x => f.hom]
⦃X Y : SimplexCategoryᵒᵖ⦄ (f_1 : X ⟶ Y),
CategoryTheory.CategoryStruct.comp
(((CategoryTheory.Functor.id (CategoryT... | false |
Mathlib.Meta.FunProp.Mor.isCoeFunName | Mathlib.Tactic.FunProp.Mor | Lean.Name → Lean.CoreM Bool | true |
BitVec._sizeOf_1 | Init.SizeOf | {w : ℕ} → BitVec w → ℕ | false |
QuadraticModuleCat.mk | Mathlib.LinearAlgebra.QuadraticForm.QuadraticModuleCat | {R : Type u} → [inst : CommRing R] → (toModuleCat : ModuleCat R) → QuadraticForm R ↑toModuleCat → QuadraticModuleCat R | true |
_private.Lean.Class.0.Lean.addClass._sparseCasesOn_1 | Lean.Class | {motive : Lean.ConstantInfo → Sort u} →
(t : Lean.ConstantInfo) →
((val : Lean.InductiveVal) → motive (Lean.ConstantInfo.inductInfo val)) →
((val : Lean.AxiomVal) → motive (Lean.ConstantInfo.axiomInfo val)) →
(Nat.hasNotBit 33 t.ctorIdx → motive t) → motive t | false |
irrational_sqrt_of_multiplicity_odd | Mathlib.NumberTheory.Real.Irrational | ∀ (m : ℤ), 0 < m → ∀ (p : ℕ) [hp : Fact (Nat.Prime p)], multiplicity (↑p) m % 2 = 1 → Irrational √↑m | true |
PosNum.cast_to_num | Mathlib.Data.Num.Lemmas | ∀ (n : PosNum), ↑n = Num.pos n | true |
_private.Lean.Meta.Sym.Simp.DiscrTree.0.Lean.Meta.Sym.getMatchLoop._proof_5 | Lean.Meta.Sym.Simp.DiscrTree | ∀ {α : Type} (cs : Array (Lean.Meta.DiscrTree.Key × Lean.Meta.DiscrTree.Trie α)), ¬cs.size = 0 → ¬0 < cs.size → False | false |
Lean.Lsp.DidOpenTextDocumentParams.recOn | Lean.Data.Lsp.TextSync | {motive : Lean.Lsp.DidOpenTextDocumentParams → Sort u} →
(t : Lean.Lsp.DidOpenTextDocumentParams) →
((textDocument : Lean.Lsp.TextDocumentItem) → motive { textDocument := textDocument }) → motive t | false |
Filter.instCountableInterFilterCountableGenerate | Mathlib.Order.Filter.CountableInter | ∀ {α : Type u_1} (g : Set (Set α)), CountableInterFilter (Filter.countableGenerate g) | true |
_private.Mathlib.CategoryTheory.Limits.Shapes.Pullback.IsPullback.Defs.0.CategoryTheory.IsPullback.isoIsPullback_inv_fst._simp_1_1 | Mathlib.CategoryTheory.Limits.Shapes.Pullback.IsPullback.Defs | ∀ {C : Type u} [inst : CategoryTheory.Category.{v, u} C] {X Y Z : C} (α : X ≅ Y) {f : X ⟶ Z} {g : Y ⟶ Z},
(CategoryTheory.CategoryStruct.comp α.inv f = g) = (f = CategoryTheory.CategoryStruct.comp α.hom g) | false |
Aesop.EqualUpToIds.readAllowAssignmentDiff | Aesop.Util.EqualUpToIds | Aesop.EqualUpToIdsM Bool | true |
_private.Init.Core.0.dif_pos.match_1_1 | Init.Core | ∀ {c : Prop} (motive : Decidable c → Prop) (h : Decidable c),
(∀ (h : c), motive (isTrue h)) → (∀ (hnc : ¬c), motive (isFalse hnc)) → motive h | false |
Seminorm._sizeOf_inst | Mathlib.Analysis.Seminorm | (𝕜 : Type u_12) →
(E : Type u_13) →
{inst : SeminormedRing 𝕜} →
{inst_1 : AddGroup E} → {inst_2 : SMul 𝕜 E} → [SizeOf 𝕜] → [SizeOf E] → SizeOf (Seminorm 𝕜 E) | false |
Matrix.exp_nsmul | Mathlib.Analysis.Normed.Algebra.MatrixExponential | ∀ {m : Type u_1} {𝔸 : Type u_4} [inst : Fintype m] [inst_1 : DecidableEq m] [inst_2 : NormedRing 𝔸] [NormedAlgebra ℚ 𝔸]
[CompleteSpace 𝔸] (n : ℕ) (A : Matrix m m 𝔸), NormedSpace.exp (n • A) = NormedSpace.exp A ^ n | true |
Module.Finite.of_localizationSpan_finite | Mathlib.RingTheory.Localization.Finiteness | ∀ {R : Type u} [inst : CommRing R] {M : Type w} [inst_1 : AddCommMonoid M] [inst_2 : Module R M] (t : Finset R),
Ideal.span ↑t = ⊤ →
(∀ (g : ↥t), Module.Finite (Localization.Away ↑g) (LocalizedModule (Submonoid.powers ↑g) M)) → Module.Finite R M | true |
MvPFunctor.M.Path._sizeOf_inst | Mathlib.Data.PFunctor.Multivariate.M | {n : ℕ} → (P : MvPFunctor.{u} (n + 1)) → (a : P.last.M) → (a_1 : Fin2 n) → SizeOf (MvPFunctor.M.Path P a a_1) | false |
_private.Lean.PrettyPrinter.Delaborator.Builtins.0.Lean.PrettyPrinter.Delaborator.delabLit.match_1 | Lean.PrettyPrinter.Delaborator.Builtins | (motive : Lean.Literal → Sort u_1) →
(l : Lean.Literal) →
((n : ℕ) → motive (Lean.Literal.natVal n)) → ((s : String) → motive (Lean.Literal.strVal s)) → motive l | false |
MulHom.coeFn | Mathlib.Algebra.Group.Pi.Lemmas | (α : Type u_4) → (β : Type u_5) → [inst : Mul α] → [inst_1 : CommSemigroup β] → (α →ₙ* β) →ₙ* α → β | true |
Polynomial.Chebyshev.roots_U_real_nodup | Mathlib.Analysis.SpecialFunctions.Trigonometric.Chebyshev.RootsExtrema | ∀ (n : ℕ), (Multiset.map (fun k => Real.cos ((↑k + 1) * Real.pi / (↑n + 1))) (Multiset.range n)).Nodup | true |
TopCat.Sheaf.objSupIsoProdEqLocus_inv_fst | Mathlib.Topology.Sheaves.CommRingCat | ∀ {X : TopCat} (F : TopCat.Sheaf CommRingCat X) (U V : TopologicalSpace.Opens ↑X)
(x :
↑(CommRingCat.of
↥(((CommRingCat.Hom.hom (F.obj.map (CategoryTheory.homOfLE ⋯).op)).comp
(RingHom.fst ↑(F.obj.obj (Opposite.op U)) ↑(F.obj.obj (Opposite.op V)))).eqLocus
((CommRingCat.Hom.hom... | true |
IsPrimitiveRoot.subOneIntegralPowerBasis_gen | Mathlib.NumberTheory.NumberField.Cyclotomic.Basic | ∀ {n : ℕ} {K : Type u} [inst : Field K] {ζ : K} [inst_1 : NeZero n] [inst_2 : CharZero K]
[inst_3 : IsCyclotomicExtension {n} ℚ K] (hζ : IsPrimitiveRoot ζ n), hζ.subOneIntegralPowerBasis.gen = ⟨ζ - 1, ⋯⟩ | true |
Lean.Doc.Parser.bold | Lean.DocString.Parser | Lean.Doc.Parser.InlineCtxt → Lean.Parser.ParserFn | true |
Std.DHashMap.Internal.List.HashesTo.mk._flat_ctor | Std.Data.DHashMap.Internal.Defs | ∀ {α : Type u} {β : α → Type v} [inst : BEq α] [inst_1 : Hashable α] {l : List ((a : α) × β a)} {i size : ℕ},
(∀ (h : 0 < size), ∀ p ∈ l, (↑(Std.DHashMap.Internal.mkIdx size h (hash p.fst))).toNat = i) →
Std.DHashMap.Internal.List.HashesTo l i size | false |
ProbabilityTheory.integrable_rpow_abs_mul_exp_add_of_integrable_exp_mul | Mathlib.Probability.Moments.IntegrableExpMul | ∀ {Ω : Type u_1} {m : MeasurableSpace Ω} {X : Ω → ℝ} {μ : MeasureTheory.Measure Ω} {t v x : ℝ},
MeasureTheory.Integrable (fun ω => Real.exp ((v + t) * X ω)) μ →
MeasureTheory.Integrable (fun ω => Real.exp ((v - t) * X ω)) μ →
0 ≤ x →
x < |t| → ∀ {p : ℝ}, 0 ≤ p → MeasureTheory.Integrable (fun a => |X... | true |
Set.infinite_union._simp_1 | Mathlib.Data.Set.Finite.Basic | ∀ {α : Type u} {s t : Set α}, (s ∪ t).Infinite = (s.Infinite ∨ t.Infinite) | false |
Real.logb_lt_logb_iff_of_base_lt_one._simp_1 | Mathlib.Analysis.SpecialFunctions.Log.Base | ∀ {b x y : ℝ}, 0 < b → b < 1 → 0 < x → 0 < y → (Real.logb b x < Real.logb b y) = (y < x) | false |
Std.DHashMap.Internal.Raw₀.Const.size_le_size_insertMany | Std.Data.DHashMap.Internal.RawLemmas | ∀ {α : Type u} [inst : BEq α] [inst_1 : Hashable α] {β : Type v} (m : Std.DHashMap.Internal.Raw₀ α fun x => β)
{ρ : Type w} [inst_2 : ForIn Id ρ (α × β)] [EquivBEq α] [LawfulHashable α],
(↑m).WF → ∀ {l : ρ}, (↑m).size ≤ (↑↑(Std.DHashMap.Internal.Raw₀.Const.insertMany m l)).size | true |
GenContFract.IntFractPair.of_inv_fr_num_lt_num_of_pos | Mathlib.Algebra.ContinuedFractions.Computation.TerminatesIffRat | ∀ {q : ℚ}, 0 < q → (GenContFract.IntFractPair.of q⁻¹).fr.num < q.num | true |
Batteries.Tactic.CollectOpaques.M | Batteries.Tactic.PrintOpaques | Type → Type | true |
ProfiniteGrp.ofFiniteGrp._proof_2 | Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic | ∀ (G : FiniteGrp.{u_1}), CompactSpace ↑G.toGrp | false |
differentiable_pow | Mathlib.Analysis.Calculus.FDeriv.Pow | ∀ {𝕜 : Type u_1} {𝔸 : Type u_2} [inst : NontriviallyNormedField 𝕜] [inst_1 : NormedRing 𝔸] [inst_2 : NormedAlgebra 𝕜 𝔸]
(n : ℕ), Differentiable 𝕜 fun x => x ^ n | true |
_private.Mathlib.Topology.Algebra.Valued.WithVal.0.WithVal.valueGroupOrderIso₀_restrict._simp_1_1 | Mathlib.Topology.Algebra.Valued.WithVal | ∀ {R : Type u_1} {Γ₀ : Type u_2} [inst : LinearOrderedCommGroupWithZero Γ₀] [inst_1 : Ring R] (v : Valuation R Γ₀)
(r : WithVal v), Valued.v r = v r.ofVal | false |
Function.invFunOn_apply_mem._simp_1 | Mathlib.Data.Set.Function | ∀ {α : Type u_1} {β : Type u_2} {s : Set α} {f : α → β} {a : α} [inst : Nonempty α],
a ∈ s → (Function.invFunOn f s (f a) ∈ s) = True | false |
Std.Roo.size.eq_1 | Init.Data.Range.Polymorphic.Lemmas | ∀ {α : Type u} [inst : Std.Rxo.HasSize α] [inst_1 : Std.PRange.UpwardEnumerable α] (r : Std.Roo α),
r.size =
match Std.PRange.succ? r.lower with
| none => 0
| some lower => Std.Rxo.HasSize.size lower r.upper | true |
_private.Mathlib.Analysis.Analytic.IteratedFDeriv.0.HasFPowerSeriesOnBall.iteratedFDeriv_eq_sum_of_completeSpace._simp_1_2 | Mathlib.Analysis.Analytic.IteratedFDeriv | ∀ {𝕜 : Type u_1} {E : Type u_2} {F : Type u_3} [inst : NontriviallyNormedField 𝕜] [inst_1 : NormedAddCommGroup E]
[inst_2 : NormedSpace 𝕜 E] [inst_3 : NormedAddCommGroup F] [inst_4 : NormedSpace 𝕜 F] {f : E → F}
{p : FormalMultilinearSeries 𝕜 E F} {x : E} {r : ENNReal},
HasFPowerSeriesOnBall f p x r = HasFPo... | false |
_private.Init.Grind.ToIntLemmas.0.Lean.Grind.ToInt.isNonempty._proof_1_2 | Init.Grind.ToIntLemmas | ∀ {α : Type u_1} (a : α) (lo hi : ℤ) [inst : Lean.Grind.ToInt α (Lean.Grind.IntInterval.co lo hi)],
lo ≤ ↑a ∧ ↑a < hi → ¬lo < hi → False | false |
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) | 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 α β | true |
Order.Frame.MinimalAxioms.inf_sSup_eq | Mathlib.Order.CompleteBooleanAlgebra | ∀ {α : Type u} (minAx : Order.Frame.MinimalAxioms α) {s : Set α} {a : α}, a ⊓ sSup s = ⨆ b ∈ s, a ⊓ b | 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) | 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 () | 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 | true |
CategoryTheory.Abelian.AbelianStruct.imageι_π._autoParam | Mathlib.CategoryTheory.Abelian.Basic | Lean.Syntax | 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 | true |
Lean.Linter.MissingDocs.checkMixfix | Lean.Linter.MissingDocs | Lean.Linter.MissingDocs.SimpleHandler | true |
Lean.Meta.Grind.State.instanceMap._default | Lean.Meta.Tactic.Grind.Types | Std.HashMap Lean.Name Lean.Meta.Grind.EMatchTheorem | 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 | 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 | false |
AlgebraicGeometry.instCanonicallyOverSpecStalkCommRingCatPresheaf | Mathlib.AlgebraicGeometry.Stalk | (X : AlgebraicGeometry.Scheme) → (x : ↥X) → (AlgebraicGeometry.Spec (X.presheaf.stalk x)).CanonicallyOver X | true |
String.Slice.Pos.not_endPos_lt._simp_1 | Init.Data.String.Lemmas.Order | ∀ {s : String.Slice} {p : s.Pos}, (s.endPos < p) = False | 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.shrinkYoneda.{u_1, u_2, u_3}.flip.obj (Opposite.op X)).map
(CategoryTheory.shri... | 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 ⊤ = ⊤ | true |
Mathlib.Tactic.Order.orderCoreImp | Mathlib.Tactic.Order | Bool → Array Lean.Expr → Lean.Expr → Lean.MVarId → Mathlib.Tactic.AtomM Unit | 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... | false |
SSet.OneTruncation₂.ofNerve₂ | Mathlib.AlgebraicTopology.SimplicialSet.HomotopyCat | (C : Type u) →
[inst : CategoryTheory.Category.{u, u} C] →
CategoryTheory.ReflQuiv.of (SSet.OneTruncation₂ ((SSet.truncation 2).obj (CategoryTheory.nerve C))) ≅
CategoryTheory.ReflQuiv.of C | true |
Set.pairwise_univ | Mathlib.Data.Set.Pairwise.Basic | ∀ {α : Type u_1} {r : α → α → Prop}, Set.univ.Pairwise r ↔ Pairwise r | true |
StarSubalgebra.mem_top | Mathlib.Algebra.Star.Subalgebra | ∀ {R : Type u_2} {A : Type u_3} [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 ∈ ⊤ | 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) | true |
FirstOrder.Language.Substructure.instInhabited_fg | Mathlib.ModelTheory.FinitelyGenerated | {L : FirstOrder.Language} → {M : Type u_1} → [inst : L.Structure M] → Inhabited { S // S.FG } | 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 α | true |
Nat.gcd_sub_self_right | Init.Data.Nat.Gcd | ∀ {m n : ℕ}, m ≤ n → m.gcd (n - m) = m.gcd n | 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) →
... | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.