name stringlengths 2 347 | module stringlengths 6 90 | type stringlengths 1 5.42M |
|---|---|---|
Option.toArray_eq_empty_iff._simp_1 | Init.Data.Option.Array | ∀ {α : Type u_1} {o : Option α}, (o.toArray = #[]) = (o = none) |
_private.Lean.Meta.InferType.0.Lean.Meta.typeFormerTypeLevel.go.match_1 | Lean.Meta.InferType | (motive : Lean.Expr → Sort u_1) →
(type : Lean.Expr) →
((l : Lean.Level) → motive (Lean.Expr.sort l)) →
((binderName : Lean.Name) →
(binderType body : Lean.Expr) →
(binderInfo : Lean.BinderInfo) → motive (Lean.Expr.forallE binderName binderType body binderInfo)) →
((x : Lean.Expr) → motive x) → motive type |
_private.Mathlib.Combinatorics.SimpleGraph.Trails.0.SimpleGraph.Walk.IsEulerian.card_filter_odd_degree._simp_1_3 | Mathlib.Combinatorics.SimpleGraph.Trails | ∀ {α : Sort u_1} {p : α → Prop}, (¬∀ (x : α), p x) = ∃ x, ¬p x |
CategoryTheory.MorphismProperty.exists_isPushout_of_isFiltered | Mathlib.CategoryTheory.MorphismProperty.Ind | ∀ {C : Type u} {inst : CategoryTheory.Category.{v, u} C} {P : CategoryTheory.MorphismProperty C}
[self : P.PreIndSpreads] {J : Type w} [inst_1 : CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J]
{D : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone D} (x : CategoryTheory.Limits.IsColimit c) {T : C}
(f : c.pt ⟶ T), P f → ∃ j T' f' g, CategoryTheory.IsPushout (c.ι.app j) f' f g ∧ P f' |
CategoryTheory.Mod_._sizeOf_1 | Mathlib.CategoryTheory.Monoidal.Mod_ | {C : Type u₁} →
{inst : CategoryTheory.Category.{v₁, u₁} C} →
{inst_1 : CategoryTheory.MonoidalCategory C} →
{D : Type u₂} →
{inst_2 : CategoryTheory.Category.{v₂, u₂} D} →
{inst_3 : CategoryTheory.MonoidalCategory.MonoidalLeftAction C D} →
{A : C} → {inst_4 : CategoryTheory.MonObj A} → [SizeOf C] → [SizeOf D] → CategoryTheory.Mod_ D A → ℕ |
PseudoMetricSpace.ofDistTopology._proof_3 | Mathlib.Topology.MetricSpace.Pseudo.Defs | ∀ {α : Type u_1} [inst : TopologicalSpace α] (dist : α → α → ℝ) (dist_self : ∀ (x : α), dist x x = 0)
(dist_comm : ∀ (x y : α), dist x y = dist y x) (dist_triangle : ∀ (x y z : α), dist x z ≤ dist x y + dist y z)
(H : ∀ (s : Set α), IsOpen s ↔ ∀ x ∈ s, ∃ ε > 0, ∀ (y : α), dist x y < ε → y ∈ s), uniformity α = uniformity α |
Stream'.Seq.set_cons_zero | Mathlib.Data.Seq.Basic | ∀ {α : Type u} (hd : α) (tl : Stream'.Seq α) (hd' : α), (Stream'.Seq.cons hd tl).set 0 hd' = Stream'.Seq.cons hd' tl |
Int8.neg_sub | Init.Data.SInt.Lemmas | ∀ {a b : Int8}, -(a - b) = b - a |
Matroid.loopyOn_isBasis_iff._simp_1 | Mathlib.Combinatorics.Matroid.Constructions | ∀ {α : Type u_1} {E I X : Set α}, (Matroid.loopyOn E).IsBasis I X = (I = ∅ ∧ X ⊆ E) |
CategoryTheory.NatTrans.IsMonoidal.instHomFunctorAssociator | Mathlib.CategoryTheory.Monoidal.NaturalTransformation | ∀ {C : Type u₁} [inst : CategoryTheory.Category.{v₁, u₁} C] [inst_1 : CategoryTheory.MonoidalCategory C] {D : Type u₂}
[inst_2 : CategoryTheory.Category.{v₂, u₂} D] [inst_3 : CategoryTheory.MonoidalCategory D] {E : Type u₃}
[inst_4 : CategoryTheory.Category.{v₃, u₃} E] [inst_5 : CategoryTheory.MonoidalCategory E] {E' : Type u₄}
[inst_6 : CategoryTheory.Category.{v₄, u₄} E'] [inst_7 : CategoryTheory.MonoidalCategory E']
(F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D E) (H : CategoryTheory.Functor E E')
[inst_8 : F.LaxMonoidal] [inst_9 : G.LaxMonoidal] [inst_10 : H.LaxMonoidal],
CategoryTheory.NatTrans.IsMonoidal (F.associator G H).hom |
AlgebraicGeometry.Scheme.Pullback.base_affine_hasPullback | Mathlib.AlgebraicGeometry.Pullbacks | ∀ {C : CommRingCat} {X Y : AlgebraicGeometry.Scheme} (f : X ⟶ AlgebraicGeometry.Spec C)
(g : Y ⟶ AlgebraicGeometry.Spec C), CategoryTheory.Limits.HasPullback f g |
_private.Mathlib.Data.Option.NAry.0.Option.map₂_assoc._proof_1_1 | Mathlib.Data.Option.NAry | ∀ {α : Type u_4} {β : Type u_5} {γ : Type u_3} {δ : Type u_2} {a : Option α} {b : Option β} {c : Option γ}
{ε : Type u_1} {ε' : Type u_6} {f : δ → γ → ε} {g : α → β → δ} {f' : α → ε' → ε} {g' : β → γ → ε'},
(∀ (a : α) (b : β) (c : γ), f (g a b) c = f' a (g' b c)) →
Option.map₂ f (Option.map₂ g a b) c = Option.map₂ f' a (Option.map₂ g' b c) |
ZFSet.Subset | Mathlib.SetTheory.ZFC.Basic | ZFSet.{u} → ZFSet.{u} → Prop |
CategoryTheory.Limits.sigmaConst_obj_map | Mathlib.CategoryTheory.Limits.Shapes.Products | ∀ {C : Type u} [inst : CategoryTheory.Category.{v, u} C] [inst_1 : CategoryTheory.Limits.HasCoproducts C] (X : C)
{X_1 Y : Type w} (f : X_1 ⟶ Y),
(CategoryTheory.Limits.sigmaConst.obj X).map f =
CategoryTheory.Limits.Sigma.map' f fun x => CategoryTheory.CategoryStruct.id X |
Std.ExtDTreeMap.Const.get_insertMany_list_of_mem | Std.Data.ExtDTreeMap.Lemmas | ∀ {α : Type u} {cmp : α → α → Ordering} {β : Type v} {t : Std.ExtDTreeMap α (fun x => β) cmp} [inst : Std.TransCmp cmp]
{l : List (α × β)} {k k' : α},
cmp k k' = Ordering.eq →
∀ {v : β},
List.Pairwise (fun a b => ¬cmp a.1 b.1 = Ordering.eq) l →
(k, v) ∈ l →
∀ {h' : k' ∈ Std.ExtDTreeMap.Const.insertMany t l},
Std.ExtDTreeMap.Const.get (Std.ExtDTreeMap.Const.insertMany t l) k' h' = v |
_private.Mathlib.Topology.Algebra.Constructions.0.Units.isOpenMap_map.match_1_9 | Mathlib.Topology.Algebra.Constructions | ∀ {M : Type u_1} {N : Type u_2} [inst : Monoid M] [inst_1 : Monoid N] {f : M →* N} (U : Set (M × Mᵐᵒᵖ)) (y : Nˣ)
(motive : (∃ x, (↑x, MulOpposite.op ↑x⁻¹) ∈ U ∧ (Units.map f) x = y) → Prop)
(x : ∃ x, (↑x, MulOpposite.op ↑x⁻¹) ∈ U ∧ (Units.map f) x = y),
(∀ (x : Mˣ) (hxV : (↑x, MulOpposite.op ↑x⁻¹) ∈ U) (hx : (Units.map f) x = y), motive ⋯) → motive x |
KaehlerDifferential.linearCombination_surjective | Mathlib.RingTheory.Kaehler.Basic | ∀ (R : Type u) (S : Type v) [inst : CommRing R] [inst_1 : CommRing S] [inst_2 : Algebra R S],
Function.Surjective ⇑(Finsupp.linearCombination S ⇑(KaehlerDifferential.D R S)) |
UniformEquiv.refl_symm | Mathlib.Topology.UniformSpace.Equiv | ∀ {α : Type u} [inst : UniformSpace α], (UniformEquiv.refl α).symm = UniformEquiv.refl α |
_private.Init.Data.List.Nat.TakeDrop.0.List.mem_drop_iff_getElem._proof_1_2 | Init.Data.List.Nat.TakeDrop | ∀ {α : Type u_1} {i : ℕ} {l : List α} (i_1 : ℕ), i_1 + i < l.length → ¬i_1 < l.length - i → False |
Lean.Widget.RpcEncodablePacket._sizeOf_1._@.Lean.Widget.InteractiveDiagnostic.1765450820._hygCtx._hyg.1 | Lean.Widget.InteractiveDiagnostic | Lean.Widget.RpcEncodablePacket✝ → ℕ |
Turing.TM0.Stmt.move.elim | Mathlib.Computability.PostTuringMachine | {Γ : Type u_1} →
{motive : Turing.TM0.Stmt Γ → Sort u} →
(t : Turing.TM0.Stmt Γ) → t.ctorIdx = 0 → ((a : Turing.Dir) → motive (Turing.TM0.Stmt.move a)) → motive t |
MulOneClass.mk._flat_ctor | Mathlib.Algebra.Group.Defs | {M : Type u} → (one : M) → (mul : M → M → M) → (∀ (a : M), 1 * a = a) → (∀ (a : M), a * 1 = a) → MulOneClass M |
List.Nodup.count | Init.Data.List.Pairwise | ∀ {α : Type u_1} [inst : BEq α] [inst_1 : LawfulBEq α] {a : α} {l : List α},
l.Nodup → List.count a l = if a ∈ l then 1 else 0 |
Fin.coe_castPred | Mathlib.Data.Fin.SuccPred | ∀ {n : ℕ} (i : Fin (n + 1)) (h : i ≠ Fin.last n), ↑(i.castPred h) = ↑i |
Std.TreeMap.alter | Std.Data.TreeMap.Basic | {α : Type u} →
{β : Type v} → {cmp : α → α → Ordering} → Std.TreeMap α β cmp → α → (Option β → Option β) → Std.TreeMap α β cmp |
CategoryTheory.Oplax.StrongTrans.isoMk_inv_as_app | Mathlib.CategoryTheory.Bicategory.Modification.Oplax | ∀ {B : Type u₁} [inst : CategoryTheory.Bicategory B] {C : Type u₂} [inst_1 : CategoryTheory.Bicategory C]
{F G : CategoryTheory.OplaxFunctor B C} {η θ : F ⟶ G} (app : (a : B) → η.app a ≅ θ.app a)
(naturality :
autoParam
(∀ {a b : B} (f : a ⟶ b),
CategoryTheory.CategoryStruct.comp (CategoryTheory.Bicategory.whiskerLeft (F.map f) (app b).hom)
(θ.naturality f).hom =
CategoryTheory.CategoryStruct.comp (η.naturality f).hom
(CategoryTheory.Bicategory.whiskerRight (app a).hom (G.map f)))
CategoryTheory.Oplax.StrongTrans.isoMk._auto_1)
(a : B), (CategoryTheory.Oplax.StrongTrans.isoMk app naturality).inv.as.app a = (app a).inv |
Bornology.IsVonNBounded.image_multilinear | Mathlib.Topology.Algebra.Module.Multilinear.Bounded | ∀ {ι : Type u_1} {𝕜 : Type u_2} {F : Type u_3} {E : ι → Type u_4} [inst : NormedField 𝕜]
[inst_1 : (i : ι) → AddCommGroup (E i)] [inst_2 : (i : ι) → Module 𝕜 (E i)]
[inst_3 : (i : ι) → TopologicalSpace (E i)] [inst_4 : AddCommGroup F] [inst_5 : Module 𝕜 F]
[inst_6 : TopologicalSpace F] [ContinuousSMul 𝕜 F] {s : Set ((i : ι) → E i)},
Bornology.IsVonNBounded 𝕜 s → ∀ (f : ContinuousMultilinearMap 𝕜 E F), Bornology.IsVonNBounded 𝕜 (⇑f '' s) |
UInt64.toUInt16_lt._simp_1 | Init.Data.UInt.Lemmas | ∀ {a b : UInt64}, (a.toUInt16 < b.toUInt16) = (a % 65536 < b % 65536) |
CategoryTheory.Functor.leftOpRightOpEquiv._proof_1 | Mathlib.CategoryTheory.Opposites | ∀ (C : Type u_2) [inst : CategoryTheory.Category.{u_4, u_2} C] (D : Type u_1)
[inst_1 : CategoryTheory.Category.{u_3, u_1} D] (X : (CategoryTheory.Functor Cᵒᵖ D)ᵒᵖ),
CategoryTheory.NatTrans.rightOp (CategoryTheory.CategoryStruct.id X).unop =
CategoryTheory.CategoryStruct.id (Opposite.unop X).rightOp |
_private.Std.Data.DTreeMap.Internal.WF.Lemmas.0.Std.Internal.List.insertEntry.eq_1 | Std.Data.DTreeMap.Internal.WF.Lemmas | ∀ {α : Type u} {β : α → Type v} [inst : BEq α] (k : α) (v : β k) (l : List ((a : α) × β a)),
Std.Internal.List.insertEntry k v l =
bif Std.Internal.List.containsKey k l then Std.Internal.List.replaceEntry k v l else ⟨k, v⟩ :: l |
curveIntegral_symm | Mathlib.MeasureTheory.Integral.CurveIntegral.Basic | ∀ {𝕜 : Type u_1} {E : Type u_2} {F : Type u_3} [inst : RCLike 𝕜] [inst_1 : NormedAddCommGroup E]
[inst_2 : NormedSpace 𝕜 E] [inst_3 : NormedAddCommGroup F] [inst_4 : NormedSpace 𝕜 F] {a b : E} (ω : E → E →L[𝕜] F)
(γ : Path a b), ∫ᶜ (x : E) in γ.symm, ω x = -∫ᶜ (x : E) in γ, ω x |
_private.Mathlib.MeasureTheory.Measure.AddContent.0.MeasureTheory.addContent_iUnion_eq_tsum_of_disjoint_of_addContent_iUnion_le._simp_1_5 | Mathlib.MeasureTheory.Measure.AddContent | ∀ {α : Sort u_2} {β : Sort u_1} {f : α → β} {p : α → Prop} {q : β → Prop},
(∀ (b : β) (a : α), p a → f a = b → q b) = ∀ (a : α), p a → q (f a) |
smul_mem_asymptoticCone_iff | Mathlib.Topology.Algebra.AsymptoticCone | ∀ {k : Type u_1} {V : Type u_2} {P : Type u_3} [inst : Field k] [inst_1 : LinearOrder k] [inst_2 : AddCommGroup V]
[inst_3 : Module k V] [inst_4 : AddTorsor V P] [inst_5 : TopologicalSpace V] [inst_6 : TopologicalSpace k]
[OrderTopology k] [IsStrictOrderedRing k] [IsTopologicalAddGroup V] [ContinuousSMul k V] {s : Set P} {c : k} {v : V},
0 < c → (c • v ∈ asymptoticCone k s ↔ v ∈ asymptoticCone k s) |
Matrix.transposeInvertibleEquivInvertible._proof_1 | Mathlib.Data.Matrix.Invertible | ∀ {n : Type u_1} {α : Type u_2} [inst : Fintype n] [inst_1 : DecidableEq n] [inst_2 : CommSemiring α] (A : Matrix n n α)
(x : Invertible A.transpose), A.invertibleTranspose = x |
Std.Tactic.BVDecide.BVUnOp.eval_not | Std.Tactic.BVDecide.Bitblast.BVExpr.Basic | ∀ {w : ℕ}, Std.Tactic.BVDecide.BVUnOp.not.eval = fun x => ~~~x |
CategoryTheory.PreGaloisCategory.autMapHom_apply | Mathlib.CategoryTheory.Galois.GaloisObjects | ∀ {C : Type u₁} [inst : CategoryTheory.Category.{u₂, u₁} C] [inst_1 : CategoryTheory.GaloisCategory C] {A B : C}
[inst_2 : CategoryTheory.PreGaloisCategory.IsConnected A] [inst_3 : CategoryTheory.PreGaloisCategory.IsGalois B]
(f : A ⟶ B) (σ : CategoryTheory.Aut A),
(CategoryTheory.PreGaloisCategory.autMapHom f) σ = CategoryTheory.PreGaloisCategory.autMap f σ |
Std.DHashMap.Raw.Equiv.mem_iff | Std.Data.DHashMap.RawLemmas | ∀ {α : Type u} {β : α → Type v} [inst : BEq α] [inst_1 : Hashable α] {m₁ m₂ : Std.DHashMap.Raw α β} [EquivBEq α]
[LawfulHashable α] {k : α}, m₁.WF → m₂.WF → m₁.Equiv m₂ → (k ∈ m₁ ↔ k ∈ m₂) |
Set.BijOn.union | Mathlib.Data.Set.Function | ∀ {α : Type u_1} {β : Type u_2} {s₁ s₂ : Set α} {t₁ t₂ : Set β} {f : α → β},
Set.BijOn f s₁ t₁ → Set.BijOn f s₂ t₂ → Set.InjOn f (s₁ ∪ s₂) → Set.BijOn f (s₁ ∪ s₂) (t₁ ∪ t₂) |
LieSubmodule.lowerCentralSeries_eq_lcs_comap | Mathlib.Algebra.Lie.Nilpotent | ∀ {R : Type u} {L : Type v} {M : Type w} [inst : CommRing R] [inst_1 : LieRing L] [inst_2 : LieAlgebra R L]
[inst_3 : AddCommGroup M] [inst_4 : Module R M] [inst_5 : LieRingModule L M] (k : ℕ) (N : LieSubmodule R L M)
[LieModule R L M], LieModule.lowerCentralSeries R L (↥N) k = LieSubmodule.comap N.incl (LieSubmodule.lcs k N) |
HopfAlgCat.noConfusionType | Mathlib.Algebra.Category.HopfAlgCat.Basic | Sort u_1 →
{R : Type u} → [inst : CommRing R] → HopfAlgCat R → {R' : Type u} → [inst' : CommRing R'] → HopfAlgCat R' → Sort u_1 |
CategoryTheory.ShortComplex.instPreservesLimitsOfShapeπ₂ | Mathlib.Algebra.Homology.ShortComplex.Limits | ∀ {J : Type u_1} {C : Type u_2} [inst : CategoryTheory.Category.{v_1, u_1} J]
[inst_1 : CategoryTheory.Category.{v_2, u_2} C] [inst_2 : CategoryTheory.Limits.HasZeroMorphisms C]
[CategoryTheory.Limits.HasLimitsOfShape J C],
CategoryTheory.Limits.PreservesLimitsOfShape J CategoryTheory.ShortComplex.π₂ |
CategoryTheory.Idempotents.functorExtension₁._proof_1 | Mathlib.CategoryTheory.Idempotents.FunctorExtension | ∀ (C : Type u_1) (D : Type u_4) [inst : CategoryTheory.Category.{u_2, u_1} C]
[inst_1 : CategoryTheory.Category.{u_3, u_4} D] (F : CategoryTheory.Functor C (CategoryTheory.Idempotents.Karoubi D)),
CategoryTheory.Idempotents.FunctorExtension₁.map (CategoryTheory.CategoryStruct.id F) =
CategoryTheory.CategoryStruct.id (CategoryTheory.Idempotents.FunctorExtension₁.obj F) |
ContinuousLinearMap.instSMul._proof_1 | Mathlib.Topology.Algebra.Module.LinearMap | ∀ {R₁ : Type u_4} {R₂ : Type u_5} [inst : Semiring R₁] [inst_1 : Semiring R₂] {σ₁₂ : R₁ →+* R₂} {M₁ : Type u_1}
[inst_2 : TopologicalSpace M₁] [inst_3 : AddCommMonoid M₁] {M₂ : Type u_2} [inst_4 : TopologicalSpace M₂]
[inst_5 : AddCommMonoid M₂] [inst_6 : Module R₁ M₁] [inst_7 : Module R₂ M₂] {S₂ : Type u_3}
[inst_8 : DistribSMul S₂ M₂] [ContinuousConstSMul S₂ M₂] (c : S₂) (f : M₁ →SL[σ₁₂] M₂),
Continuous fun x => c • (↑f).toFun x |
_private.Mathlib.Combinatorics.Additive.VerySmallDoubling.0.Finset.doubling_lt_golden_ratio._simp_1_23 | Mathlib.Combinatorics.Additive.VerySmallDoubling | ∀ {A : Type u_1} {B : Type u_2} [i : SetLike A B] {p : A} {x : B}, (x ∈ ↑p) = (x ∈ p) |
Matrix.diagonal_mulVec_single | Mathlib.Data.Matrix.Mul | ∀ {n : Type u_3} {R : Type u_7} [inst : Fintype n] [inst_1 : DecidableEq n] [inst_2 : NonUnitalNonAssocSemiring R]
(v : n → R) (j : n) (x : R), (Matrix.diagonal v).mulVec (Pi.single j x) = Pi.single j (v j * x) |
_private.Mathlib.Analysis.Asymptotics.Theta.0.Asymptotics.isTheta_const_const_iff._simp_1_2 | Mathlib.Analysis.Asymptotics.Theta | ∀ {α : Type u_1} {E'' : Type u_9} {F'' : Type u_10} [inst : NormedAddCommGroup E''] [inst_1 : NormedAddCommGroup F'']
{c : E''} {c' : F''} (l : Filter α) [l.NeBot], ((fun _x => c) =O[l] fun _x => c') = (c' = 0 → c = 0) |
Lean.Doc.instBEqListItem.beq | Lean.DocString.Types | {α : Type u_1} → [BEq α] → Lean.Doc.ListItem α → Lean.Doc.ListItem α → Bool |
Std.DTreeMap.isSome_maxKey?_iff_isEmpty_eq_false | Std.Data.DTreeMap.Lemmas | ∀ {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Std.DTreeMap α β cmp} [Std.TransCmp cmp],
t.maxKey?.isSome = true ↔ t.isEmpty = false |
Mathlib.Tactic.Monoidal.instMonadNormalizeNaturalityMonoidalM.match_1 | Mathlib.Tactic.CategoryTheory.Monoidal.PureCoherence | (ctx : Mathlib.Tactic.Monoidal.Context) →
(motive : Option Q(CategoryTheory.MonoidalCategory unknown_1) → Sort u_1) →
(x : Option Q(CategoryTheory.MonoidalCategory unknown_1)) →
((_monoidal : Q(CategoryTheory.MonoidalCategory unknown_1)) → motive (some _monoidal)) →
((x : Option Q(CategoryTheory.MonoidalCategory unknown_1)) → motive x) → motive x |
ProbabilityTheory.preCDF_le_one | Mathlib.Probability.Kernel.Disintegration.CondCDF | ∀ {α : Type u_1} {mα : MeasurableSpace α} (ρ : MeasureTheory.Measure (α × ℝ)) [MeasureTheory.IsFiniteMeasure ρ],
∀ᵐ (a : α) ∂ρ.fst, ∀ (r : ℚ), ProbabilityTheory.preCDF ρ r a ≤ 1 |
Metric.Snowflaking.preimage_toSnowflaking_emetricBall | Mathlib.Topology.MetricSpace.Snowflaking | ∀ {X : Type u_1} {α : ℝ} {hα₀ : 0 < α} {hα₁ : α ≤ 1} [inst : PseudoEMetricSpace X] (x : Metric.Snowflaking X α hα₀ hα₁)
(d : ENNReal),
⇑Metric.Snowflaking.toSnowflaking ⁻¹' Metric.eball x d = Metric.eball (Metric.Snowflaking.ofSnowflaking x) (d ^ α⁻¹) |
Finset.min_union | Mathlib.Data.Finset.Max | ∀ {α : Type u_2} [inst : LinearOrder α] {s t : Finset α}, (s ∪ t).min = min s.min t.min |
Lean.Compiler.LCNF.Code.collectUsed | Lean.Compiler.LCNF.Basic | {pu : Lean.Compiler.LCNF.Purity} → Lean.Compiler.LCNF.Code pu → optParam Lean.FVarIdHashSet ∅ → Lean.FVarIdHashSet |
CategoryTheory.Subgroupoid.instSetLikeSigmaHom | Mathlib.CategoryTheory.Groupoid.Subgroupoid | {C : Type u} → [inst : CategoryTheory.Groupoid C] → SetLike (CategoryTheory.Subgroupoid C) ((c : C) × (d : C) × (c ⟶ d)) |
ENat.one_lt_card._simp_1 | Mathlib.SetTheory.Cardinal.Finite | ∀ {α : Type u_1} [Nontrivial α], (1 < ENat.card α) = True |
Lean.Expr.isDIte | Lean.Util.Recognizers | Lean.Expr → Bool |
edist_lt_top | Mathlib.Topology.MetricSpace.Pseudo.Defs | ∀ {α : Type u_3} [inst : PseudoMetricSpace α] (x y : α), edist x y < ⊤ |
CategoryTheory.Functor.PullbackObjObj.mk.inj | 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₃} {pt : C₂} {fst : pt ⟶ (G.obj (Opposite.op X₁)).obj X₃} {snd : pt ⟶ (G.obj (Opposite.op Y₁)).obj Y₃}
{isPullback : CategoryTheory.IsPullback fst snd ((G.obj (Opposite.op X₁)).map f₃) ((G.map f₁.op).app Y₃)} {pt_1 : C₂}
{fst_1 : pt_1 ⟶ (G.obj (Opposite.op X₁)).obj X₃} {snd_1 : pt_1 ⟶ (G.obj (Opposite.op Y₁)).obj Y₃}
{isPullback_1 : CategoryTheory.IsPullback fst_1 snd_1 ((G.obj (Opposite.op X₁)).map f₃) ((G.map f₁.op).app Y₃)},
{ pt := pt, fst := fst, snd := snd, isPullback := isPullback } =
{ pt := pt_1, fst := fst_1, snd := snd_1, isPullback := isPullback_1 } →
pt = pt_1 ∧ fst ≍ fst_1 ∧ snd ≍ snd_1 |
FirstOrder.Language.DefinableSet.coe_bot | Mathlib.ModelTheory.Definability | ∀ {L : FirstOrder.Language} {M : Type w} [inst : L.Structure M] {A : Set M} {α : Type u₁}, ↑⊥ = ∅ |
ArchimedeanClass.orderHom | Mathlib.Algebra.Order.Archimedean.Class | {M : Type u_1} →
[inst : AddCommGroup M] →
[inst_1 : LinearOrder M] →
[inst_2 : IsOrderedAddMonoid M] →
{N : Type u_2} →
[inst_3 : AddCommGroup N] →
[inst_4 : LinearOrder N] →
[inst_5 : IsOrderedAddMonoid N] → (M →+o N) → ArchimedeanClass M →o ArchimedeanClass N |
_private.Mathlib.CategoryTheory.Shift.Localization.0.CategoryTheory.Functor.commShiftOfLocalization._simp_1 | Mathlib.CategoryTheory.Shift.Localization | ∀ {C : Type u₁} [inst : CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [inst_1 : CategoryTheory.Category.{v₂, u₂} D]
{F G : CategoryTheory.Functor C D} (self : CategoryTheory.NatTrans F G) ⦃X Y : C⦄ (f : X ⟶ Y) {Z : D}
(h : G.obj Y ⟶ Z),
CategoryTheory.CategoryStruct.comp (self.app X) (CategoryTheory.CategoryStruct.comp (G.map f) h) =
CategoryTheory.CategoryStruct.comp (F.map f) (CategoryTheory.CategoryStruct.comp (self.app Y) h) |
ExteriorAlgebra.ιInv | Mathlib.LinearAlgebra.ExteriorAlgebra.Basic | {R : Type u1} →
[inst : CommRing R] → {M : Type u2} → [inst_1 : AddCommGroup M] → [inst_2 : Module R M] → ExteriorAlgebra R M →ₗ[R] M |
_private.Lean.Meta.InferType.0.Lean.Meta.inferMVarType | Lean.Meta.InferType | Lean.MVarId → Lean.MetaM Lean.Expr |
AddOpposite.instCommMonoid._proof_2 | Mathlib.Algebra.Group.Opposite | ∀ {α : Type u_1} [inst : CommMonoid α] (x x_1 : αᵃᵒᵖ), AddOpposite.unop (x * x_1) = AddOpposite.unop (x * x_1) |
ENormedCommMonoid.toESeminormedCommMonoid | Mathlib.Analysis.Normed.Group.Defs | {E : Type u_8} → {inst : TopologicalSpace E} → [self : ENormedCommMonoid E] → ESeminormedCommMonoid E |
_private.Init.Data.Nat.Lcm.0.Nat.lcm_pos._simp_1_1 | Init.Data.Nat.Lcm | ∀ {n : ℕ}, (n ≠ 0) = (0 < n) |
Equiv.algebra | Mathlib.Algebra.Algebra.TransferInstance | (R : Type u_1) →
{α : Type u_2} →
{β : Type u_3} →
[inst : CommSemiring R] →
(e : α ≃ β) →
[inst_1 : Semiring β] →
have x := e.semiring;
[Algebra R β] → Algebra R α |
ZMod.intCast_cast_mul | Mathlib.Data.ZMod.Basic | ∀ {n : ℕ} (x y : ZMod n), (x * y).cast = x.cast * y.cast % ↑n |
Lean.Elab.InlayHintLinkLocation._sizeOf_inst | Lean.Elab.InfoTree.InlayHints | SizeOf Lean.Elab.InlayHintLinkLocation |
Lean.Meta.Grind.EMatch.State.recOn | Lean.Meta.Tactic.Grind.Types | {motive : Lean.Meta.Grind.EMatch.State → Sort u} →
(t : Lean.Meta.Grind.EMatch.State) →
((thmMap : Lean.Meta.Grind.EMatchTheoremsArray) →
(gmt : ℕ) →
(thms newThms : Lean.PArray Lean.Meta.Grind.EMatchTheorem) →
(numInstances numDelayedInstances num : ℕ) →
(preInstances : Lean.Meta.Grind.PreInstanceSet) →
(nextThmIdx : ℕ) →
(matchEqNames : Lean.PHashSet Lean.Name) →
(delayedThmInsts :
Lean.PHashMap Lean.Meta.Sym.ExprPtr (List Lean.Meta.Grind.DelayedTheoremInstance)) →
motive
{ thmMap := thmMap, gmt := gmt, thms := thms, newThms := newThms, numInstances := numInstances,
numDelayedInstances := numDelayedInstances, num := num, preInstances := preInstances,
nextThmIdx := nextThmIdx, matchEqNames := matchEqNames,
delayedThmInsts := delayedThmInsts }) →
motive t |
Vector.append_assoc_symm | Init.Data.Vector.Lemmas | ∀ {α : Type u_1} {n m k : ℕ} {xs : Vector α n} {ys : Vector α m} {zs : Vector α k},
xs ++ (ys ++ zs) = Vector.cast ⋯ (xs ++ ys ++ zs) |
_private.Mathlib.Data.Seq.Parallel.0.Computation.BisimO.match_1.splitter._sparseCasesOn_3 | Mathlib.Data.Seq.Parallel | {α : Type u} →
{β : Type v} →
{motive : α ⊕ β → Sort u_1} →
(t : α ⊕ β) → ((val : α) → motive (Sum.inl val)) → (Nat.hasNotBit 1 t.ctorIdx → motive t) → motive t |
List.anyM_pure | Init.Data.List.Monadic | ∀ {m : Type → Type u_1} {α : Type u_2} [inst : Monad m] [LawfulMonad m] {p : α → Bool} {as : List α},
List.anyM (fun x => pure (p x)) as = pure (as.any p) |
Option.forIn_toList | Init.Data.Option.List | ∀ {m : Type u_1 → Type u_2} {α : Type u_3} {β : Type u_1} [inst : Monad m] (o : Option α) (b : β)
(f : α → β → m (ForInStep β)), forIn o.toList b f = forIn o b f |
Filter.le_limsup_of_frequently_le' | Mathlib.Order.LiminfLimsup | ∀ {α : Type u_6} {β : Type u_7} [inst : CompleteLattice β] {f : Filter α} {u : α → β} {x : β},
(∃ᶠ (a : α) in f, x ≤ u a) → x ≤ Filter.limsup u f |
MeasureTheory.posConvolution._proof_1 | Mathlib.Analysis.Convolution | ∀ {F : Type u_1} [inst : NormedAddCommGroup F] [inst_1 : NormedSpace ℝ F], SMulCommClass ℝ ℝ F |
Shrink.instNonUnitalCommRing | Mathlib.Algebra.Ring.Shrink | {α : Type u_1} → [inst : Small.{v, u_1} α] → [NonUnitalCommRing α] → NonUnitalCommRing (Shrink.{v, u_1} α) |
injective_frobenius._simp_1 | Mathlib.FieldTheory.Perfect | ∀ (R : Type u_1) (p : ℕ) [inst : CommSemiring R] [inst_1 : ExpChar R p] [PerfectRing R p],
Function.Injective ⇑(frobenius R p) = True |
ULift.distribMulAction'._proof_2 | Mathlib.Algebra.Module.ULift | ∀ {R : Type u_3} {M : Type u_2} [inst : Monoid R] [inst_1 : AddMonoid M] [inst_2 : DistribMulAction R M] (a : R)
(x y : ULift.{u_1, u_2} M), a • (x + y) = a • x + a • y |
CategoryTheory.Limits.colimitLimitToLimitColimitCone._proof_4 | Mathlib.CategoryTheory.Limits.ColimitLimit | ∀ {J : Type u_2} {K : Type u_5} [inst : CategoryTheory.Category.{u_1, u_2} J]
[inst_1 : CategoryTheory.Category.{u_6, u_5} K] {C : Type u_4} [inst_2 : CategoryTheory.Category.{u_3, u_4} C]
[CategoryTheory.Limits.HasLimitsOfShape J C] [inst_4 : CategoryTheory.Limits.HasColimitsOfShape K C]
(G : CategoryTheory.Functor J (CategoryTheory.Functor K C)),
CategoryTheory.Limits.HasLimit
((CategoryTheory.Functor.curry.obj (CategoryTheory.Functor.uncurry.obj G)).comp CategoryTheory.Limits.colim) |
RelHom.instFintype | Mathlib.Data.Fintype.Pi | {α : Type u_3} →
{β : Type u_4} →
[Fintype α] →
[Fintype β] →
[DecidableEq α] →
{r : α → α → Prop} → {s : β → β → Prop} → [DecidableRel r] → [DecidableRel s] → Fintype (r →r s) |
CategoryTheory.Limits.widePushoutShapeOp._proof_3 | Mathlib.CategoryTheory.Limits.Shapes.WidePullbacks | ∀ (J : Type u_1) {X Y Z : CategoryTheory.Limits.WidePushoutShape J} (f : X ⟶ Y) (g : Y ⟶ Z),
CategoryTheory.Limits.widePushoutShapeOpMap J X Z (CategoryTheory.CategoryStruct.comp f g) =
CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.widePushoutShapeOpMap J X Y f)
(CategoryTheory.Limits.widePushoutShapeOpMap J Y Z g) |
Lean.Elab.Command.InductiveElabStep2.prefinalize | Lean.Elab.MutualInductive | Lean.Elab.Command.InductiveElabStep2 →
List Lean.Name →
Array Lean.Expr → (Lean.Expr → Lean.MetaM Lean.Expr) → Lean.Elab.TermElabM Lean.Elab.Command.InductiveElabStep3 |
Std.DTreeMap.containsThenInsert_snd | Std.Data.DTreeMap.Lemmas | ∀ {α : Type u} {β : α → Type v} {cmp : α → α → Ordering} {t : Std.DTreeMap α β cmp} [Std.TransCmp cmp] {k : α}
{v : β k}, (t.containsThenInsert k v).2 = t.insert k v |
UInt32.toNat_ofNat_of_lt | Init.Data.UInt.Lemmas | ∀ {n : ℕ}, n < UInt32.size → UInt32.toNat (OfNat.ofNat n) = n |
Subgroup.map_symm_eq_iff_map_eq | Mathlib.Algebra.Group.Subgroup.Map | ∀ {G : Type u_1} [inst : Group G] (K : Subgroup G) {N : Type u_5} [inst_1 : Group N] {H : Subgroup N} {e : G ≃* N},
Subgroup.map (↑e.symm) H = K ↔ Subgroup.map (↑e) K = H |
Std.Iterators.Types.Flatten.IsPlausibleStep.rec | Init.Data.Iterators.Combinators.Monadic.FlatMap | ∀ {α α₂ β : Type w} {m : Type w → Type w'} [inst : Std.Iterator α m (Std.IterM m β)] [inst_1 : Std.Iterator α₂ m β]
{motive :
(it : Std.IterM m β) →
(step : Std.IterStep (Std.IterM m β) β) → Std.Iterators.Types.Flatten.IsPlausibleStep it step → Prop},
(∀ {it₁ it₁' : Std.IterM m (Std.IterM m β)} {it₂' : Std.IterM m β}
(a : it₁.IsPlausibleStep (Std.IterStep.yield it₁' it₂')),
motive { internalState := { it₁ := it₁, it₂ := none } }
(Std.IterStep.skip { internalState := { it₁ := it₁', it₂ := some it₂' } }) ⋯) →
(∀ {it₁ it₁' : Std.IterM m (Std.IterM m β)} (a : it₁.IsPlausibleStep (Std.IterStep.skip it₁')),
motive { internalState := { it₁ := it₁, it₂ := none } }
(Std.IterStep.skip { internalState := { it₁ := it₁', it₂ := none } }) ⋯) →
(∀ {it₁ : Std.IterM m (Std.IterM m β)} (a : it₁.IsPlausibleStep Std.IterStep.done),
motive { internalState := { it₁ := it₁, it₂ := none } } Std.IterStep.done ⋯) →
(∀ {it₁ : Std.IterM m (Std.IterM m β)} {it₂ it₂' : Std.IterM m β} {b : β}
(a : it₂.IsPlausibleStep (Std.IterStep.yield it₂' b)),
motive { internalState := { it₁ := it₁, it₂ := some it₂ } }
(Std.IterStep.yield { internalState := { it₁ := it₁, it₂ := some it₂' } } b) ⋯) →
(∀ {it₁ : Std.IterM m (Std.IterM m β)} {it₂ it₂' : Std.IterM m β}
(a : it₂.IsPlausibleStep (Std.IterStep.skip it₂')),
motive { internalState := { it₁ := it₁, it₂ := some it₂ } }
(Std.IterStep.skip { internalState := { it₁ := it₁, it₂ := some it₂' } }) ⋯) →
(∀ {it₁ : Std.IterM m (Std.IterM m β)} {it₂ : Std.IterM m β} (a : it₂.IsPlausibleStep Std.IterStep.done),
motive { internalState := { it₁ := it₁, it₂ := some it₂ } }
(Std.IterStep.skip { internalState := { it₁ := it₁, it₂ := none } }) ⋯) →
∀ {it : Std.IterM m β} {step : Std.IterStep (Std.IterM m β) β}
(t : Std.Iterators.Types.Flatten.IsPlausibleStep it step), motive it step t |
Lean.Meta.Simp.instInhabitedContext | Lean.Meta.Tactic.Simp.Types | Inhabited Lean.Meta.Simp.Context |
_private.Mathlib.MeasureTheory.Integral.IntegrableOn.0.MeasureTheory.integrableAtFilter_atBot_iff.match_1_1 | Mathlib.MeasureTheory.Integral.IntegrableOn | ∀ {α : Type u_1} {ε : Type u_2} {mα : MeasurableSpace α} {f : α → ε} {μ : MeasureTheory.Measure α}
[inst : TopologicalSpace ε] [inst_1 : ContinuousENorm ε] [inst_2 : Preorder α]
(motive : MeasureTheory.IntegrableAtFilter f Filter.atBot μ → Prop)
(x : MeasureTheory.IntegrableAtFilter f Filter.atBot μ),
(∀ (s : Set α) (hs : s ∈ Filter.atBot) (hi : MeasureTheory.IntegrableOn f s μ), motive ⋯) → motive x |
Fintype.one_lt_card_iff_nontrivial | Mathlib.Data.Fintype.EquivFin | ∀ {α : Type u_1} [inst : Fintype α], 1 < Fintype.card α ↔ Nontrivial α |
Order.isSuccPrelimit_iff_of_noMax | Mathlib.Order.SuccPred.Limit | ∀ {α : Type u_1} {a : α} [inst : Preorder α] [inst_1 : SuccOrder α] [IsSuccArchimedean α] [NoMaxOrder α],
Order.IsSuccPrelimit a ↔ IsMin a |
Std.Roo.noConfusionType | Init.Data.Range.Polymorphic.PRange | Sort u_1 → {α : Type u} → Std.Roo α → {α' : Type u} → Std.Roo α' → Sort u_1 |
Set.instCompleteAtomicBooleanAlgebra._proof_5 | Mathlib.Data.Set.BooleanAlgebra | ∀ {α : Type u_1} (a : Set α), ⊥ ≤ a |
CategoryTheory.Limits.WalkingMulticospan.Hom.casesOn | Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer | {J : CategoryTheory.Limits.MulticospanShape} →
{motive : (x x_1 : CategoryTheory.Limits.WalkingMulticospan J) → x.Hom x_1 → Sort u} →
{x x_1 : CategoryTheory.Limits.WalkingMulticospan J} →
(t : x.Hom x_1) →
((A : CategoryTheory.Limits.WalkingMulticospan J) →
motive A A (CategoryTheory.Limits.WalkingMulticospan.Hom.id A)) →
((b : J.R) →
motive (CategoryTheory.Limits.WalkingMulticospan.left (J.fst b))
(CategoryTheory.Limits.WalkingMulticospan.right b)
(CategoryTheory.Limits.WalkingMulticospan.Hom.fst b)) →
((b : J.R) →
motive (CategoryTheory.Limits.WalkingMulticospan.left (J.snd b))
(CategoryTheory.Limits.WalkingMulticospan.right b)
(CategoryTheory.Limits.WalkingMulticospan.Hom.snd b)) →
motive x x_1 t |
Lean.Grind.CommRing.Mon.mult.injEq | Init.Grind.Ring.CommSolver | ∀ (p : Lean.Grind.CommRing.Power) (m : Lean.Grind.CommRing.Mon) (p_1 : Lean.Grind.CommRing.Power)
(m_1 : Lean.Grind.CommRing.Mon),
(Lean.Grind.CommRing.Mon.mult p m = Lean.Grind.CommRing.Mon.mult p_1 m_1) = (p = p_1 ∧ m = m_1) |
Equiv.Perm.two_le_card_support_cycleOf_iff._simp_1 | Mathlib.GroupTheory.Perm.Cycle.Factors | ∀ {α : Type u_2} {f : Equiv.Perm α} {x : α} [inst : DecidableEq α] [inst_1 : Fintype α],
(2 ≤ (f.cycleOf x).support.card) = (f x ≠ x) |
LinearIndependent.repr | Mathlib.LinearAlgebra.LinearIndependent.Defs | {ι : Type u'} →
{R : Type u_2} →
{M : Type u_4} →
{v : ι → M} →
[inst : Semiring R] →
[inst_1 : AddCommMonoid M] →
[inst_2 : Module R M] → LinearIndependent R v → ↥(Submodule.span R (Set.range v)) →ₗ[R] ι →₀ R |
Lean.Meta.LiftLetsConfig.noConfusion | Init.MetaTypes | {P : Sort u} → {t t' : Lean.Meta.LiftLetsConfig} → t = t' → Lean.Meta.LiftLetsConfig.noConfusionType P t t' |
_private.Batteries.Data.DList.Lemmas.0.Batteries.DList.push.match_1.eq_1 | Batteries.Data.DList.Lemmas | ∀ {α : Type u_1} (motive : Batteries.DList α → α → Sort u_2) (f : List α → List α) (h : ∀ (l : List α), f l = f [] ++ l)
(a : α)
(h_1 :
(f : List α → List α) → (h : ∀ (l : List α), f l = f [] ++ l) → (a : α) → motive { apply := f, invariant := h } a),
(match { apply := f, invariant := h }, a with
| { apply := f, invariant := h }, a => h_1 f h a) =
h_1 f h a |
Functor._aux_Mathlib_Control_Functor___unexpand_Functor_mapConstRev_1 | Mathlib.Control.Functor | Lean.PrettyPrinter.Unexpander |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.