name stringlengths 2 347 | module stringlengths 6 90 | type stringlengths 1 5.67M | allowCompletion bool 2
classes |
|---|---|---|---|
CategoryTheory.FreeMonoidalCategory.Hom.ρ_hom.elim | Mathlib.CategoryTheory.Monoidal.Free.Basic | {C : Type u} →
{motive : (a a_1 : CategoryTheory.FreeMonoidalCategory C) → a.Hom a_1 → Sort u_1} →
{a a_1 : CategoryTheory.FreeMonoidalCategory C} →
(t : a.Hom a_1) →
t.ctorIdx = 5 →
((X : CategoryTheory.FreeMonoidalCategory C) →
motive (X.tensor CategoryTheory.FreeMonoidalCa... | false |
UpperHalfPlane.dist_triangle | Mathlib.Analysis.Complex.UpperHalfPlane.Metric | ∀ (a b c : UpperHalfPlane), dist a c ≤ dist a b + dist b c | true |
CategoryTheory.Functor.LaxMonoidal.prod'._aux_1 | Mathlib.CategoryTheory.Monoidal.Functor | {C : Type u_6} →
[inst : CategoryTheory.Category.{u_5, u_6} C] →
[inst_1 : CategoryTheory.MonoidalCategory C] →
{D : Type u_3} →
[inst_2 : CategoryTheory.Category.{u_1, u_3} D] →
[inst_3 : CategoryTheory.MonoidalCategory D] →
{E : Type u_4} →
[inst_4 : CategoryThe... | false |
_private.Mathlib.Combinatorics.Pigeonhole.0.Fintype.exists_card_fiber_lt_of_card_lt_nsmul.match_1_1 | Mathlib.Combinatorics.Pigeonhole | ∀ {α : Type u_3} {β : Type u_1} {M : Type u_2} [inst : DecidableEq β] [inst_1 : Fintype α] [inst_2 : Fintype β]
(f : α → β) {b : M} [inst_3 : CommSemiring M] [inst_4 : LinearOrder M]
(motive : (∃ y ∈ Finset.univ, ↑{x | f x = y}.card < b) → Prop) (x : ∃ y ∈ Finset.univ, ↑{x | f x = y}.card < b),
(∀ (y : β) (left :... | false |
MeasureTheory.average_const | Mathlib.MeasureTheory.Integral.Average | ∀ {α : Type u_1} {E : Type u_2} {m0 : MeasurableSpace α} [inst : NormedAddCommGroup E] [inst_1 : NormedSpace ℝ E]
[CompleteSpace E] (μ : MeasureTheory.Measure α) [MeasureTheory.IsFiniteMeasure μ] [h : NeZero μ] (c : E),
⨍ (_x : α), c ∂μ = c | true |
Batteries.UnionFind.link | Batteries.Data.UnionFind.Basic | (self : Batteries.UnionFind) → Fin self.size → (y : Fin self.size) → self.parent ↑y = ↑y → Batteries.UnionFind | true |
CategoryTheory.Iso.self_symm_conj | Mathlib.CategoryTheory.Conj | ∀ {C : Type u} [inst : CategoryTheory.Category.{v, u} C] {X Y : C} (α : X ≅ Y) (f : CategoryTheory.End Y),
α.conj (α.symm.conj f) = f | true |
_private.Mathlib.Analysis.Complex.Poisson.0.le_re_herglotzRieszKernel_aux._simp_1_4 | Mathlib.Analysis.Complex.Poisson | ∀ {M₀ : Type u_1} [inst : Mul M₀] [inst_1 : Zero M₀] [NoZeroDivisors M₀] {a b : M₀}, a ≠ 0 → b ≠ 0 → (a * b = 0) = False | false |
EmbeddingLike.comp_injective._simp_1 | Mathlib.Data.FunLike.Embedding | ∀ {α : Sort u_2} {β : Sort u_3} {γ : Sort u_4} {F : Sort u_5} [inst : FunLike F β γ] [EmbeddingLike F β γ] (f : α → β)
(e : F), Function.Injective (⇑e ∘ f) = Function.Injective f | false |
_private.Mathlib.Order.OrderIsoNat.0.exists_covBy_seq_of_wellFoundedLT_wellFoundedGT_of_le._simp_1_2 | Mathlib.Order.OrderIsoNat | ∀ {α : Sort u} {p : α → Prop} {a1 a2 : { x // p x }}, (a1 = a2) = (↑a1 = ↑a2) | false |
AddSubmonoid.matrix._proof_1 | Mathlib.Data.Matrix.Basic | ∀ {m : Type u_1} {n : Type u_2} {A : Type u_3} [inst : AddMonoid A] (S : AddSubmonoid A) {a b : Matrix m n A},
a ∈ (↑S).matrix → b ∈ (↑S).matrix → ∀ (i : m) (j : n), a i j + b i j ∈ S | false |
CategoryTheory.Pretriangulated.Triangle.shiftFunctorZero_hom_app_hom₃ | Mathlib.CategoryTheory.Triangulated.TriangleShift | ∀ (C : Type u) [inst : CategoryTheory.Category.{v, u} C] [inst_1 : CategoryTheory.Preadditive C]
[inst_2 : CategoryTheory.HasShift C ℤ] (X : CategoryTheory.Pretriangulated.Triangle C),
((CategoryTheory.Pretriangulated.Triangle.shiftFunctorZero C).hom.app X).hom₃ =
(CategoryTheory.shiftFunctorZero C ℤ).hom.app X... | true |
IsCyclotomicExtension.Rat.ramificationIdxIn_eq | Mathlib.NumberTheory.NumberField.Cyclotomic.Ideal | ∀ (n : ℕ) {m p k : ℕ} [hp : Fact (Nat.Prime p)] (K : Type u_1) [inst : Field K] [inst_1 : NumberField K]
[IsCyclotomicExtension {n} ℚ K],
n = p ^ (k + 1) * m → ¬p ∣ m → (Ideal.span {↑p}).ramificationIdxIn (NumberField.RingOfIntegers K) = p ^ k * (p - 1) | true |
_private.Std.Data.Internal.List.Associative.0.Std.Internal.List.Option.map_dmap | Std.Data.Internal.List.Associative | ∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} (x : Option α) (f : (a : α) → x = some a → β) (g : β → γ),
Option.map g (Std.Internal.List.Option.dmap✝ x f) = Std.Internal.List.Option.dmap✝¹ x fun a h => g (f a h) | true |
Lean.Grind.CommRing.Mon.beq' | Init.Grind.Ring.CommSolver | Lean.Grind.CommRing.Mon → Lean.Grind.CommRing.Mon → Bool | true |
Polynomial.natDegree_multiset_prod_of_monic | Mathlib.Algebra.Polynomial.BigOperators | ∀ {R : Type u} [inst : CommSemiring R] (t : Multiset (Polynomial R)),
(∀ f ∈ t, f.Monic) → t.prod.natDegree = (Multiset.map Polynomial.natDegree t).sum | true |
Complex.UnitI | Mathlib.Analysis.InnerProductSpace.StandardSubspace | ℂˣ | true |
CategoryTheory.Bicategory.rightUnitor_comp_inv | Mathlib.CategoryTheory.Bicategory.Basic | ∀ {B : Type u} [inst : CategoryTheory.Bicategory B] {a b c : B} (f : a ⟶ b) (g : b ⟶ c),
(CategoryTheory.Bicategory.rightUnitor (CategoryTheory.CategoryStruct.comp f g)).inv =
CategoryTheory.CategoryStruct.comp
(CategoryTheory.Bicategory.whiskerLeft f (CategoryTheory.Bicategory.rightUnitor g).inv)
(Ca... | true |
ISize.toBitVec_or | Init.Data.SInt.Bitwise | ∀ (a b : ISize), (a ||| b).toBitVec = a.toBitVec ||| b.toBitVec | true |
Mathlib.Tactic.BicategoryLike.HorizontalComp.cons.sizeOf_spec | Mathlib.Tactic.CategoryTheory.Coherence.Normalize | ∀ (e : Mathlib.Tactic.BicategoryLike.Mor₂) (η : Mathlib.Tactic.BicategoryLike.WhiskerRight)
(ηs : Mathlib.Tactic.BicategoryLike.HorizontalComp),
sizeOf (Mathlib.Tactic.BicategoryLike.HorizontalComp.cons e η ηs) = 1 + sizeOf e + sizeOf η + sizeOf ηs | true |
Std.DTreeMap.Raw.instInhabited | Std.Data.DTreeMap.Raw.Basic | {α : Type u} → {β : α → Type v} → {cmp : α → α → Ordering} → Inhabited (Std.DTreeMap.Raw α β cmp) | true |
AlgCat.instCategory._proof_1 | Mathlib.Algebra.Category.AlgCat.Basic | ∀ (R : Type u_2) [inst : CommRing R] {X Y : AlgCat R} (f : X.Hom Y),
{ hom' := f.hom'.comp { hom' := AlgHom.id R ↑X }.hom' } = f | false |
CategoryTheory.MonoidalCategory.MonoidalRightAction.actionOfMonoidalFunctorToEndofunctor._proof_14 | Mathlib.CategoryTheory.Monoidal.Action.End | ∀ {C : Type u_2} {D : Type u_4} [inst : CategoryTheory.Category.{u_1, u_2} C]
[inst_1 : CategoryTheory.MonoidalCategory C] [inst_2 : CategoryTheory.Category.{u_3, u_4} D]
(F : CategoryTheory.Functor C (CategoryTheory.Functor D D)) [inst_3 : F.Monoidal] (c : C) {c' c'' : C} (f : c' ⟶ c'')
(d : D),
(F.map (Catego... | false |
ContinuousMonoidHom.compLeft._proof_1 | Mathlib.Topology.Algebra.Group.CompactOpen | ∀ {A : Type u_1} {B : Type u_3} (E : Type u_2) [inst : Monoid A] [inst_1 : Monoid B] [inst_2 : CommGroup E]
[inst_3 : TopologicalSpace A] [inst_4 : TopologicalSpace B] [inst_5 : TopologicalSpace E]
[inst_6 : IsTopologicalGroup E] (f : A →ₜ* B), ContinuousMonoidHom.comp 1 f = ContinuousMonoidHom.comp 1 f | false |
Finsupp.Lex.wellFounded | Mathlib.Data.Finsupp.WellFounded | ∀ {α : Type u_1} {N : Type u_2} [inst : Zero N] {r : α → α → Prop} {s : N → N → Prop},
(∀ ⦃n : N⦄, ¬s n 0) → WellFounded s → WellFounded (rᶜ ⊓ fun x1 x2 => x1 ≠ x2) → WellFounded (Finsupp.Lex r s) | true |
Lean.Elab.Tactic.Conv.evalUnfold | Lean.Elab.Tactic.Conv.Unfold | Lean.Elab.Tactic.Tactic | true |
ENNReal.add_lt_add_iff_right | Mathlib.Data.ENNReal.Operations | ∀ {a b c : ENNReal}, a ≠ ⊤ → (b + a < c + a ↔ b < c) | true |
PSigma.Lex.orderTop._proof_1 | Mathlib.Data.PSigma.Order | ∀ {ι : Type u_1} {α : ι → Type u_2} [inst : PartialOrder ι] [inst_1 : OrderTop ι] [inst_2 : (i : ι) → Preorder (α i)]
[inst_3 : OrderTop (α ⊤)] (a : ι) (b : α a), ⟨a, b⟩ ≤ ⟨⊤, ⊤⟩ | false |
Std.DTreeMap.Internal.Unit.RioSliceData._sizeOf_inst | Std.Data.DTreeMap.Internal.Zipper | (α : Type u) → {inst : Ord α} → [SizeOf α] → SizeOf (Std.DTreeMap.Internal.Unit.RioSliceData α) | false |
Bundle.Trivialization.coordChangeL | Mathlib.Topology.VectorBundle.Basic | (R : Type u_1) →
{B : Type u_2} →
{F : Type u_3} →
{E : B → Type u_4} →
[inst : Semiring R] →
[inst_1 : TopologicalSpace F] →
[inst_2 : TopologicalSpace B] →
[inst_3 : TopologicalSpace (Bundle.TotalSpace F E)] →
[inst_4 : AddCommMonoid F] →
... | true |
Std.ExtDTreeMap.maxKeyD_le | Std.Data.ExtDTreeMap.Lemmas | ∀ {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Std.ExtDTreeMap α β cmp} [inst : Std.TransCmp cmp],
t ≠ ∅ → ∀ {k fallback : α}, (cmp (t.maxKeyD fallback) k).isLE = true ↔ ∀ k' ∈ t, (cmp k' k).isLE = true | true |
Set.subset_symmDiff_union_symmDiff_left | Mathlib.Data.Set.SymmDiff | ∀ {α : Type u} {s t u : Set α}, Disjoint s t → u ⊆ symmDiff s u ∪ symmDiff t u | true |
HomologicalComplex.extend.d_eq | Mathlib.Algebra.Homology.Embedding.Extend | ∀ {ι : Type u_1} {c : ComplexShape ι} {C : Type u_3} [inst : CategoryTheory.Category.{v_1, u_3} C]
[inst_1 : CategoryTheory.Limits.HasZeroObject C] [inst_2 : CategoryTheory.Limits.HasZeroMorphisms C]
(K : HomologicalComplex C c) {i j : Option ι} {a b : ι} (hi : i = some a) (hj : j = some b),
HomologicalComplex.ex... | true |
ContinuousMap.tendsto_iff_tendstoLocallyUniformly | Mathlib.Topology.UniformSpace.CompactConvergence | ∀ {α : Type u₁} {β : Type u₂} [inst : TopologicalSpace α] [inst_1 : UniformSpace β] {f : C(α, β)} {ι : Type u₃}
{p : Filter ι} {F : ι → C(α, β)} [WeaklyLocallyCompactSpace α],
Filter.Tendsto F p (nhds f) ↔ TendstoLocallyUniformly (fun i a => (F i) a) (⇑f) p | true |
CompletelyRegularSpace.mk | Mathlib.Topology.Separation.CompletelyRegular | ∀ {X : Type u} [inst : TopologicalSpace X],
(∀ (x : X) (K : Set X), IsClosed K → x ∉ K → ∃ f, Continuous f ∧ f x = 0 ∧ Set.EqOn f 1 K) → CompletelyRegularSpace X | true |
BitVec.carry_extractLsb'_eq_carry | Init.Data.BitVec.Bitblast | ∀ {w i len : ℕ},
i < len →
∀ {x y : BitVec w} {b : Bool},
BitVec.carry i (BitVec.extractLsb' 0 len x) (BitVec.extractLsb' 0 len y) b = BitVec.carry i x y b | true |
CategoryTheory.Bicategory.InducedBicategory.bicategory._proof_2 | Mathlib.CategoryTheory.Bicategory.InducedBicategory | ∀ {B : Type u_1} {C : Type u_2} [inst : CategoryTheory.Bicategory C] {F : B → C}
{a b c : CategoryTheory.Bicategory.InducedBicategory C F} (f : a ⟶ b) (g : b ⟶ c),
CategoryTheory.Bicategory.InducedBicategory.mkHom₂
(CategoryTheory.Bicategory.whiskerLeft f.hom (CategoryTheory.CategoryStruct.id g).hom) =
Ca... | false |
Flag.ofIsMaxChain._proof_2 | Mathlib.Order.Preorder.Chain | ∀ {α : Type u_1} [inst : LE α] (c : Set α),
IsMaxChain (fun x1 x2 => x1 ≤ x2) c → ∀ ⦃t : Set α⦄, IsChain (fun x1 x2 => x1 ≤ x2) t → c ⊆ t → c = t | false |
Mathlib.Tactic.IntervalCases.Bound._sizeOf_1 | Mathlib.Tactic.IntervalCases | Mathlib.Tactic.IntervalCases.Bound → ℕ | false |
TopCommRingCat.isCommRing | Mathlib.Topology.Category.TopCommRingCat | (self : TopCommRingCat) → CommRing self.α | true |
mulActionSphereClosedBall._proof_2 | Mathlib.Analysis.Normed.Module.Ball.Action | ∀ {𝕜 : Type u_2} {E : Type u_1} [inst : NormedField 𝕜] [inst_1 : SeminormedAddCommGroup E] [inst_2 : NormedSpace 𝕜 E]
{r : ℝ} (x : ↑(Metric.closedBall 0 r)), 1 • x = x | false |
Submonoid.map.congr_simp | Mathlib.Algebra.Group.Submonoid.Operations | ∀ {M : Type u_1} {N : Type u_2} [inst : MulOneClass M] [inst_1 : MulOneClass N] {F : Type u_4} [inst_2 : FunLike F M N]
[mc : MonoidHomClass F M N] (f f_1 : F),
f = f_1 → ∀ (S S_1 : Submonoid M), S = S_1 → Submonoid.map f S = Submonoid.map f_1 S_1 | true |
CategoryTheory.Limits.idZeroEquivIsoZero_apply_hom | Mathlib.CategoryTheory.Limits.Shapes.ZeroMorphisms | ∀ {C : Type u} [inst : CategoryTheory.Category.{v, u} C] [inst_1 : CategoryTheory.Limits.HasZeroObject C]
[inst_2 : CategoryTheory.Limits.HasZeroMorphisms C] (X : C) (h : CategoryTheory.CategoryStruct.id X = 0),
((CategoryTheory.Limits.idZeroEquivIsoZero X) h).hom = 0 | true |
divisionRingOfFiniteDimensional._proof_15 | Mathlib.LinearAlgebra.FiniteDimensional.Basic | ∀ (F : Type u_2) (K : Type u_1) [inst : Field F] [inst_1 : Ring K] [inst_2 : IsDomain K] [inst_3 : Algebra F K]
[inst_4 : FiniteDimensional F K], (if H : 0 = 0 then 0 else Classical.choose ⋯) = 0 | false |
CentroidHom.instFunLike._proof_1 | Mathlib.Algebra.Ring.CentroidHom | ∀ {α : Type u_1} [inst : NonUnitalNonAssocSemiring α] (f g : CentroidHom α),
(fun f => (↑f.toAddMonoidHom).toFun) f = (fun f => (↑f.toAddMonoidHom).toFun) g → f = g | false |
CommGroupWithZero.ctorIdx | Mathlib.Algebra.GroupWithZero.Defs | {G₀ : Type u_2} → CommGroupWithZero G₀ → ℕ | false |
HomologicalComplex.units_smul_f_apply | Mathlib.Algebra.Homology.Linear | ∀ {R : Type u_1} [inst : Semiring R] {C : Type u_2} [inst_1 : CategoryTheory.Category.{v_1, u_2} C]
[inst_2 : CategoryTheory.Preadditive C] [inst_3 : CategoryTheory.Linear R C] {ι : Type u_4} {c : ComplexShape ι}
{X Y : HomologicalComplex C c} (r : Rˣ) (f : X ⟶ Y) (n : ι), (r • f).f n = r • f.f n | true |
CategoryTheory.Limits.IsImage.lift | Mathlib.CategoryTheory.Limits.Shapes.Images | {C : Type u} →
[inst : CategoryTheory.Category.{v, u} C] →
{X Y : C} →
{f : X ⟶ Y} →
{F : CategoryTheory.Limits.MonoFactorisation f} →
CategoryTheory.Limits.IsImage F → (F' : CategoryTheory.Limits.MonoFactorisation f) → F.I ⟶ F'.I | true |
Std.Sat.AIG.Entrypoint.ctorIdx | Std.Sat.AIG.Basic | {α : Type} → {inst : DecidableEq α} → {inst_1 : Hashable α} → Std.Sat.AIG.Entrypoint α → ℕ | false |
_private.Mathlib.Tactic.ComputeAsymptotics.Multiseries.Defs.0.ComputeAsymptotics.MultiseriesExpansion.Multiseries.destruct_eq_destruct_map.match_1 | Mathlib.Tactic.ComputeAsymptotics.Multiseries.Defs | {basis_hd : ℝ → ℝ} →
{basis_tl : ComputeAsymptotics.Basis} →
(motive :
ℝ ×
ComputeAsymptotics.MultiseriesExpansion basis_tl ×
ComputeAsymptotics.MultiseriesExpansion.Multiseries basis_hd basis_tl →
Sort u_1) →
(x :
ℝ ×
ComputeAsymptotics.Mult... | false |
CategoryTheory.Limits.Cone.equivalenceOfReindexing | Mathlib.CategoryTheory.Limits.Cones | {J : Type u₁} →
[inst : CategoryTheory.Category.{v₁, u₁} J] →
{K : Type u₂} →
[inst_1 : CategoryTheory.Category.{v₂, u₂} K] →
{C : Type u₃} →
[inst_2 : CategoryTheory.Category.{v₃, u₃} C] →
{F : CategoryTheory.Functor J C} →
{G : CategoryTheory.Functor K C} →
... | true |
Lean.Unhygienic.Context.mk.inj | Lean.Hygiene | ∀ {ref : Lean.Syntax} {scope : Lean.MacroScope} {ref_1 : Lean.Syntax} {scope_1 : Lean.MacroScope},
{ ref := ref, scope := scope } = { ref := ref_1, scope := scope_1 } → ref = ref_1 ∧ scope = scope_1 | true |
Std.DHashMap.insert_eq_insert | Std.Data.DHashMap.Lemmas | ∀ {α : Type u} {β : α → Type v} {x : BEq α} {x_1 : Hashable α} {m : Std.DHashMap α β} {p : (a : α) × β a},
insert p m = m.insert p.fst p.snd | true |
CategoryTheory.Pseudofunctor.DescentData'.pullHom'_self'._auto_1 | Mathlib.CategoryTheory.Sites.Descent.DescentDataPrime | Lean.Syntax | false |
Std.DHashMap.Equiv.symm | Std.Data.DHashMap.Lemmas | ∀ {α : Type u} {β : α → Type v} {x : BEq α} {x_1 : Hashable α} {m₁ m₂ : Std.DHashMap α β}, m₁.Equiv m₂ → m₂.Equiv m₁ | true |
UInt8.toFin_inj | Init.Data.UInt.Lemmas | ∀ {a b : UInt8}, a.toFin = b.toFin ↔ a = b | true |
Representation.IsIrreducible.finrank_intertwiningMap_self | Mathlib.RepresentationTheory.Irreducible | ∀ {G : Type u_1} {k : Type u_2} {V : Type u_3} [inst : Monoid G] [inst_1 : Field k] [inst_2 : AddCommGroup V]
[inst_3 : Module k V] (ρ : Representation k G V) [ρ.IsIrreducible] [FiniteDimensional k V] [IsAlgClosed k],
Module.finrank k (ρ.IntertwiningMap ρ) = 1 | true |
Set.encard_exchange' | Mathlib.Data.Set.Card | ∀ {α : Type u_1} {s : Set α} {a b : α}, a ∉ s → b ∈ s → (insert a s \ {b}).encard = s.encard | true |
Std.IterM.dropWhileWithPostcondition | Std.Data.Iterators.Combinators.Monadic.DropWhile | {α : Type w} →
{m : Type w → Type w'} →
{β : Type w} → (P : β → Std.Iterators.PostconditionT m (ULift.{w, 0} Bool)) → Std.IterM m β → Std.IterM m β | true |
_private.Init.Data.FloatArray.Basic.0.FloatArray.forIn.loop._proof_3 | Init.Data.FloatArray.Basic | ∀ (as : FloatArray) (i : ℕ), as.size - 1 < as.size → as.size - 1 - i < as.size | false |
Matrix.self_mul_conjTranspose_mulVec_eq_zero | Mathlib.LinearAlgebra.Matrix.DotProduct | ∀ {m : Type u_1} {n : Type u_2} {R : Type u_4} [inst : Fintype m] [inst_1 : Fintype n] [inst_2 : PartialOrder R]
[inst_3 : NonUnitalRing R] [inst_4 : StarRing R] [StarOrderedRing R] [NoZeroDivisors R] (A : Matrix m n R)
(v : m → R), (A * A.conjTranspose).mulVec v = 0 ↔ A.conjTranspose.mulVec v = 0 | true |
Rat.le_coe_toNNRat | Mathlib.Data.NNRat.Defs | ∀ (q : ℚ), q ≤ ↑q.toNNRat | true |
_private.Init.Grind.Ordered.Rat.0.Lean.Grind.instOrderedAddRat._simp_1 | Init.Grind.Ordered.Rat | ∀ {a b c : ℚ}, (c + a ≤ c + b) = (a ≤ b) | false |
Aesop.RulePattern.mk | Aesop.RulePattern | Lean.Meta.AbstractMVarsResult → Array (Option ℕ) → Array (Option ℕ) → Array Lean.Meta.DiscrTree.Key → Aesop.RulePattern | true |
_private.Std.Time.Format.Basic.0.Std.Time.formatMarkerShort.match_1 | Std.Time.Format.Basic | (motive : Std.Time.HourMarker → Sort u_1) →
(marker : Std.Time.HourMarker) →
(Unit → motive Std.Time.HourMarker.am) → (Unit → motive Std.Time.HourMarker.pm) → motive marker | false |
_private.Mathlib.CategoryTheory.Limits.Types.Images.0.CategoryTheory.Limits.Types.surjective_π_app_zero_of_surjective_map_aux.match_1_1 | Mathlib.CategoryTheory.Limits.Types.Images | (motive : ℕᵒᵖ → Sort u_1) → (x : ℕᵒᵖ) → ((n : ℕ) → motive (Opposite.op n)) → motive x | false |
WeierstrassCurve.toCharTwoJNeZeroNF | Mathlib.AlgebraicGeometry.EllipticCurve.NormalForms | {F : Type u_2} → [inst : Field F] → (W : WeierstrassCurve F) → W.a₁ ≠ 0 → WeierstrassCurve.VariableChange F | true |
Nat.psub | Mathlib.Data.Nat.PSub | ℕ → ℕ → Option ℕ | true |
Quiver.Path.addWeightOfEPs_cons | Mathlib.Combinatorics.Quiver.Path.Weight | ∀ {V : Type u_1} [inst : Quiver V] {R : Type u_2} [inst_1 : AddMonoid R] (w : V → V → R) {a b c : V}
(p : Quiver.Path a b) (e : b ⟶ c), Quiver.Path.addWeightOfEPs w (p.cons e) = Quiver.Path.addWeightOfEPs w p + w b c | true |
PreAbstractSimplicialComplex.instMin | Mathlib.AlgebraicTopology.SimplicialComplex.Basic | (ι : Type u_1) → Min (PreAbstractSimplicialComplex ι) | true |
AffineEquiv.equivLike | Mathlib.LinearAlgebra.AffineSpace.AffineEquiv | {k : Type u_1} →
{P₁ : Type u_2} →
{P₂ : Type u_3} →
{V₁ : Type u_6} →
{V₂ : Type u_7} →
[inst : Ring k] →
[inst_1 : AddCommGroup V₁] →
[inst_2 : AddCommGroup V₂] →
[inst_3 : Module k V₁] →
[inst_4 : Module k V₂] →
... | true |
_private.Lean.Server.FileWorker.RequestHandling.0.Lean.Server.FileWorker.findGoalsAt?.getPositions | Lean.Server.FileWorker.RequestHandling | Lean.Syntax → Option (String.Pos.Raw × String.Pos.Raw × String.Pos.Raw) | true |
UpperSet.mem_iInf_iff | Mathlib.Order.UpperLower.CompleteLattice | ∀ {α : Type u_1} {ι : Sort u_4} [inst : LE α] {a : α} {f : ι → UpperSet α}, a ∈ ⨅ i, f i ↔ ∃ i, a ∈ f i | true |
ModularGroup.denom_apply | Mathlib.Analysis.Complex.UpperHalfPlane.MoebiusAction | ∀ (g : Matrix.SpecialLinearGroup (Fin 2) ℤ) (z : UpperHalfPlane),
UpperHalfPlane.denom (Matrix.SpecialLinearGroup.toGL ((Matrix.SpecialLinearGroup.map (Int.castRingHom ℝ)) g)) ↑z =
↑(↑g 1 0) * ↑z + ↑(↑g 1 1) | true |
Nat.lt.base | Init.Data.Nat.Basic | ∀ (n : ℕ), n < n.succ | true |
finprod_apply | Mathlib.Algebra.BigOperators.Finprod | ∀ {N : Type u_6} [inst : CommMonoid N] {α : Type u_7} {ι : Type u_8} {f : ι → α → N},
Function.HasFiniteMulSupport f → ∀ (a : α), (∏ᶠ (i : ι), f i) a = ∏ᶠ (i : ι), f i a | true |
_private.Batteries.Data.RBMap.WF.0.Batteries.RBNode.Ordered.ins.match_1_1 | Batteries.Data.RBMap.WF | ∀ {α : Type u_1} {cmp : α → α → Ordering} (motive : (x : Batteries.RBNode α) → Batteries.RBNode.Ordered cmp x → Prop)
(x : Batteries.RBNode α) (x_1 : Batteries.RBNode.Ordered cmp x),
(∀ (x : Batteries.RBNode.Ordered cmp Batteries.RBNode.nil), motive Batteries.RBNode.nil x) →
(∀ (a : Batteries.RBNode α) (y : α) ... | false |
_private.Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph.0.SimpleGraph.Walk.IsCycle.neighborSet_toSubgraph_endpoint._simp_1_5 | Mathlib.Combinatorics.SimpleGraph.Connectivity.Subgraph | ∀ {α : Type u_1} {a b c d : α}, (s(a, b) = s(c, d)) = Sym2.Rel α (a, b) (c, d) | false |
AddUnits.neg_mul_left | Mathlib.Algebra.Ring.Invertible | ∀ {R : Type u_1} [inst : NonUnitalNonAssocSemiring R] {x : AddUnits R} {y : R}, -x.mulLeft y = (-x).mulLeft y | true |
_private.Lean.Data.RBMap.0.Lean.RBMap.erase.match_1 | Lean.Data.RBMap | {α : Type u_1} →
{β : Type u_2} →
{cmp : α → α → Ordering} →
(motive : Lean.RBMap α β cmp → α → Sort u_3) →
(x : Lean.RBMap α β cmp) →
(x_1 : α) →
((t : Lean.RBNode α fun x => β) → (w : Lean.RBNode.WellFormed cmp t) → (k : α) → motive ⟨t, w⟩ k) →
motive x x_1 | false |
MeasureTheory.weightedSMul_union' | Mathlib.MeasureTheory.Integral.Bochner.L1 | ∀ {α : Type u_1} {F : Type u_3} [inst : NormedAddCommGroup F] [inst_1 : NormedSpace ℝ F] {m : MeasurableSpace α}
{μ : MeasureTheory.Measure α} (s t : Set α),
MeasurableSet t →
μ s ≠ ⊤ →
μ t ≠ ⊤ →
Disjoint s t →
MeasureTheory.weightedSMul μ (s ∪ t) = MeasureTheory.weightedSMul μ s + Measu... | true |
AlgebraicGeometry.IsAffine.casesOn | Mathlib.AlgebraicGeometry.AffineScheme | {X : AlgebraicGeometry.Scheme} →
{motive : AlgebraicGeometry.IsAffine X → Sort u} →
(t : AlgebraicGeometry.IsAffine X) → ((affine : CategoryTheory.IsIso X.toSpecΓ) → motive ⋯) → motive t | false |
Std.ExtDHashMap.Const.getD_union | Std.Data.ExtDHashMap.Lemmas | ∀ {α : Type u} {x : BEq α} {x_1 : Hashable α} {β : Type v} {m₁ m₂ : Std.ExtDHashMap α fun x => β} [inst : EquivBEq α]
[inst_1 : LawfulHashable α] {k : α} {fallback : β},
Std.ExtDHashMap.Const.getD (m₁.union m₂) k fallback =
Std.ExtDHashMap.Const.getD m₂ k (Std.ExtDHashMap.Const.getD m₁ k fallback) | true |
Filter.prod_mono_right | Mathlib.Order.Filter.Prod | ∀ {α : Type u_1} {β : Type u_2} (f : Filter α) {g₁ g₂ : Filter β}, g₁ ≤ g₂ → f ×ˢ g₁ ≤ f ×ˢ g₂ | true |
Lean.Meta.Grind.Order.Weight.casesOn | Lean.Meta.Tactic.Grind.Order.Types | {motive : Lean.Meta.Grind.Order.Weight → Sort u} →
(t : Lean.Meta.Grind.Order.Weight) → ((k : ℤ) → (strict : Bool) → motive { k := k, strict := strict }) → motive t | false |
_private.Mathlib.NumberTheory.NumberField.CanonicalEmbedding.NormLeOne.0.NumberField.mixedEmbedding.fundamentalCone.expMap_sum._simp_1_1 | Mathlib.NumberTheory.NumberField.CanonicalEmbedding.NormLeOne | ∀ {α : Type u_1} (s : Finset α) (f : α → ℝ), ∏ x ∈ s, Real.exp (f x) = Real.exp (∑ x ∈ s, f x) | false |
ONote.split._sunfold | Mathlib.SetTheory.Ordinal.Notation | ONote → ONote × ℕ | false |
Lean.Doc.DocScope.local.sizeOf_spec | Lean.Elab.DocString.Builtin.Scopes | sizeOf Lean.Doc.DocScope.local = 1 | true |
Std.Time.PlainDateTime.instHSubDuration | Std.Time.DateTime | HSub Std.Time.PlainDateTime Std.Time.PlainDateTime Std.Time.Duration | true |
_private.Std.Data.DTreeMap.Internal.WF.Lemmas.0.Std.DTreeMap.Internal.Impl.entryAtIdx?_eq_getElem?._simp_1_3 | Std.Data.DTreeMap.Internal.WF.Lemmas | ∀ {a b : ℕ}, (compare a b = Ordering.eq) = (a = b) | false |
ArchimedeanOrder.of | Mathlib.Algebra.Order.Archimedean.Class | {M : Type u_1} → M ≃ ArchimedeanOrder M | true |
WriterT.uliftable' | Mathlib.Control.ULiftable | {w : Type u_3} →
{w' : Type u_4} →
{m : Type u_3 → Type u_5} →
{m' : Type u_4 → Type u_6} → [ULiftable m m'] → w ≃ w' → ULiftable (WriterT w m) (WriterT w' m') | true |
USize.ofBitVec.sizeOf_spec | Init.SizeOf | ∀ (toBitVec : BitVec System.Platform.numBits), sizeOf { toBitVec := toBitVec } = 1 + sizeOf toBitVec | true |
CommRingCat.instCategory._proof_1 | Mathlib.Algebra.Category.Ring.Basic | ∀ {X Y : CommRingCat} (f : X.Hom Y), { hom' := f.hom'.comp { hom' := RingHom.id ↑X }.hom' } = f | false |
mul_eq_zero_iff_right | Mathlib.Algebra.GroupWithZero.Defs | ∀ {M₀ : Type u_1} [inst : MulZeroClass M₀] [NoZeroDivisors M₀] {a b : M₀}, b ≠ 0 → (a * b = 0 ↔ a = 0) | true |
WithLp.instProdPseudoMetricSpace | Mathlib.Analysis.Normed.Lp.ProdLp | (p : ENNReal) →
(α : Type u_2) →
(β : Type u_3) →
[hp : Fact (1 ≤ p)] → [PseudoMetricSpace α] → [PseudoMetricSpace β] → PseudoMetricSpace (WithLp p (α × β)) | true |
CategoryTheory.Limits.LimitPresentation.changeDiag | Mathlib.CategoryTheory.Limits.Presentation | {C : Type u} →
[inst : CategoryTheory.Category.{v, u} C] →
{J : Type w} →
[inst_1 : CategoryTheory.Category.{t, w} J] →
{X : C} →
(P : CategoryTheory.Limits.LimitPresentation J X) →
{F : CategoryTheory.Functor J C} → (F ≅ P.diag) → CategoryTheory.Limits.LimitPresentation J X | true |
Stream'.Seq.cons_not_terminatedAt_zero._simp_1 | Mathlib.Data.Seq.Defs | ∀ {α : Type u} {x : α} {s : Stream'.Seq α}, (Stream'.Seq.cons x s).TerminatedAt 0 = False | false |
Denumerable | Mathlib.Logic.Denumerable | Type u_3 → Type u_3 | true |
BitVec.toInt_sshiftRight' | Init.Data.BitVec.Lemmas | ∀ {w : ℕ} {x y : BitVec w}, (x.sshiftRight' y).toInt = x.toInt >>> y.toNat | true |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.