name stringlengths 2 347 | module stringlengths 6 90 | type stringlengths 1 5.42M |
|---|---|---|
Std.Sat.AIG.Entrypoint.ctorIdx | Std.Sat.AIG.Basic | {α : Type} → {inst : DecidableEq α} → {inst_1 : Hashable α} → Std.Sat.AIG.Entrypoint α → ℕ |
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} →
(e : K ≌ J) → (e.functor.comp F ≅ G) → (CategoryTheory.Limits.Cone F ≌ CategoryTheory.Limits.Cone G) |
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 |
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 |
CategoryTheory.Pseudofunctor.DescentData'.pullHom'_self'._auto_1 | Mathlib.CategoryTheory.Sites.Descent.DescentDataPrime | Lean.Syntax |
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₁ |
UInt8.toFin_inj | Init.Data.UInt.Lemmas | ∀ {a b : UInt8}, a.toFin = b.toFin ↔ a = b |
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 |
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 |
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 β |
_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 |
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 |
Rat.le_coe_toNNRat | Mathlib.Data.NNRat.Defs | ∀ (q : ℚ), q ≤ ↑q.toNNRat |
_private.Init.Grind.Ordered.Rat.0.Lean.Grind.instOrderedAddRat._simp_1 | Init.Grind.Ordered.Rat | ∀ {a b c : ℚ}, (c + a ≤ c + b) = (a ≤ b) |
Aesop.RulePattern.mk | Aesop.RulePattern | Lean.Meta.AbstractMVarsResult → Array (Option ℕ) → Array (Option ℕ) → Array Lean.Meta.DiscrTree.Key → Aesop.RulePattern |
_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 |
_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 |
WeierstrassCurve.toCharTwoJNeZeroNF | Mathlib.AlgebraicGeometry.EllipticCurve.NormalForms | {F : Type u_2} → [inst : Field F] → (W : WeierstrassCurve F) → W.a₁ ≠ 0 → WeierstrassCurve.VariableChange F |
Nat.psub | Mathlib.Data.Nat.PSub | ℕ → ℕ → Option ℕ |
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 |
PreAbstractSimplicialComplex.instMin | Mathlib.AlgebraicTopology.SimplicialComplex.Basic | (ι : Type u_1) → Min (PreAbstractSimplicialComplex ι) |
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₂] →
[inst_5 : AddTorsor V₁ P₁] → [inst_6 : AddTorsor V₂ P₂] → EquivLike (P₁ ≃ᵃ[k] P₂) P₁ P₂ |
_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) |
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 |
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) |
Nat.lt.base | Init.Data.Nat.Basic | ∀ (n : ℕ), n < n.succ |
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 |
_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 : α) (b : Batteries.RBNode α)
(ay : Batteries.RBNode.All (fun x => Batteries.RBNode.cmpLT cmp x y) a)
(yb : Batteries.RBNode.All (fun x => Batteries.RBNode.cmpLT cmp y x) b) (ha : Batteries.RBNode.Ordered cmp a)
(hb : Batteries.RBNode.Ordered cmp b), motive (Batteries.RBNode.node Batteries.RBColor.red a y b) ⋯) →
(∀ (a : Batteries.RBNode α) (y : α) (b : Batteries.RBNode α)
(ay : Batteries.RBNode.All (fun x => Batteries.RBNode.cmpLT cmp x y) a)
(yb : Batteries.RBNode.All (fun x => Batteries.RBNode.cmpLT cmp y x) b) (ha : Batteries.RBNode.Ordered cmp a)
(hb : Batteries.RBNode.Ordered cmp b), motive (Batteries.RBNode.node Batteries.RBColor.black a y b) ⋯) →
motive x x_1 |
_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) |
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 |
_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 |
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 + MeasureTheory.weightedSMul μ t |
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 |
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) |
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₂ |
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 |
_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) |
ONote.split._sunfold | Mathlib.SetTheory.Ordinal.Notation | ONote → ONote × ℕ |
Lean.Doc.DocScope.local.sizeOf_spec | Lean.Elab.DocString.Builtin.Scopes | sizeOf Lean.Doc.DocScope.local = 1 |
Std.Time.PlainDateTime.instHSubDuration | Std.Time.DateTime | HSub Std.Time.PlainDateTime Std.Time.PlainDateTime Std.Time.Duration |
_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) |
ArchimedeanOrder.of | Mathlib.Algebra.Order.Archimedean.Class | {M : Type u_1} → M ≃ ArchimedeanOrder M |
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') |
USize.ofBitVec.sizeOf_spec | Init.SizeOf | ∀ (toBitVec : BitVec System.Platform.numBits), sizeOf { toBitVec := toBitVec } = 1 + sizeOf toBitVec |
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 |
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) |
WithLp.instProdPseudoMetricSpace | Mathlib.Analysis.Normed.Lp.ProdLp | (p : ENNReal) →
(α : Type u_2) →
(β : Type u_3) →
[hp : Fact (1 ≤ p)] → [PseudoMetricSpace α] → [PseudoMetricSpace β] → PseudoMetricSpace (WithLp p (α × β)) |
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 |
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 |
Denumerable | Mathlib.Logic.Denumerable | Type u_3 → Type u_3 |
BitVec.toInt_sshiftRight' | Init.Data.BitVec.Lemmas | ∀ {w : ℕ} {x y : BitVec w}, (x.sshiftRight' y).toInt = x.toInt >>> y.toNat |
TopologicalSpace.Opens.map_id_obj | Mathlib.Topology.Category.TopCat.Opens | ∀ {X : TopCat} (U : TopologicalSpace.Opens ↑X),
(TopologicalSpace.Opens.map (CategoryTheory.CategoryStruct.id X)).obj U = U |
_private.Mathlib.Tactic.NormNum.Ineq.0.Mathlib.Meta.NormNum.evalLT.core.nnratArm | Mathlib.Tactic.NormNum.Ineq | {u : Lean.Level} →
{α : Q(Type u)} →
(lα : Q(LT «$α»)) →
{a b : Q(«$α»)} →
Mathlib.Meta.NormNum.Result a →
Mathlib.Meta.NormNum.Result b →
have e := q(«$a» < «$b»);
Lean.MetaM (Mathlib.Meta.NormNum.Result e) |
Std.Internal.IO.Async.Signal.sigttou.elim | Std.Internal.Async.Signal | {motive : Std.Internal.IO.Async.Signal → Sort u} →
(t : Std.Internal.IO.Async.Signal) → t.ctorIdx = 14 → motive Std.Internal.IO.Async.Signal.sigttou → motive t |
normSeminorm | Mathlib.Analysis.Seminorm | (𝕜 : Type u_3) →
(E : Type u_7) →
[inst : NormedField 𝕜] → [inst_1 : SeminormedAddCommGroup E] → [inst_2 : NormedSpace 𝕜 E] → Seminorm 𝕜 E |
_private.Mathlib.Algebra.GroupWithZero.Basic.0.zero_pow.match_1_1 | Mathlib.Algebra.GroupWithZero.Basic | ∀ (motive : (x : ℕ) → x ≠ 0 → Prop) (x : ℕ) (x_1 : x ≠ 0), (∀ (n : ℕ) (x : n + 1 ≠ 0), motive n.succ x) → motive x x_1 |
CategoryTheory.ShortComplex.Splitting.map | Mathlib.Algebra.Homology.ShortComplex.Exact | {C : Type u_1} →
{D : Type u_2} →
[inst : CategoryTheory.Category.{v_1, u_1} C] →
[inst_1 : CategoryTheory.Category.{v_2, u_2} D] →
[inst_2 : CategoryTheory.Preadditive C] →
[inst_3 : CategoryTheory.Preadditive D] →
{S : CategoryTheory.ShortComplex C} →
S.Splitting → (F : CategoryTheory.Functor C D) → [inst_4 : F.Additive] → (S.map F).Splitting |
Lean.PersistentHashMap.Node.brecOn_3 | Lean.Data.PersistentHashMap | {α : Type u} →
{β : Type v} →
{motive_1 : Lean.PersistentHashMap.Node α β → Sort u_1} →
{motive_2 : Array (Lean.PersistentHashMap.Entry α β (Lean.PersistentHashMap.Node α β)) → Sort u_1} →
{motive_3 : List (Lean.PersistentHashMap.Entry α β (Lean.PersistentHashMap.Node α β)) → Sort u_1} →
{motive_4 : Lean.PersistentHashMap.Entry α β (Lean.PersistentHashMap.Node α β) → Sort u_1} →
(t : Lean.PersistentHashMap.Entry α β (Lean.PersistentHashMap.Node α β)) →
((t : Lean.PersistentHashMap.Node α β) → t.below → motive_1 t) →
((t : Array (Lean.PersistentHashMap.Entry α β (Lean.PersistentHashMap.Node α β))) →
Lean.PersistentHashMap.Node.below_1 t → motive_2 t) →
((t : List (Lean.PersistentHashMap.Entry α β (Lean.PersistentHashMap.Node α β))) →
Lean.PersistentHashMap.Node.below_2 t → motive_3 t) →
((t : Lean.PersistentHashMap.Entry α β (Lean.PersistentHashMap.Node α β)) →
Lean.PersistentHashMap.Node.below_3 t → motive_4 t) →
motive_4 t |
_private.Mathlib.Analysis.InnerProductSpace.Reproducing.0.RKHS.isSelfAdjoint_finsuppSum | Mathlib.Analysis.InnerProductSpace.Reproducing | ∀ {𝕜 : Type u_1} [inst : RCLike 𝕜] {X : Type u_2} {V : Type u_3} [inst_1 : NormedAddCommGroup V]
[inst_2 : InnerProductSpace 𝕜 V] [inst_3 : CompleteSpace V] {K : Matrix X X (V →L[𝕜] V)},
K.IsHermitian → ∀ (f : X →₀ V →L[𝕜] V), IsSelfAdjoint (f.sum fun i xi => f.sum fun j xj => star xi * K i j * xj) |
MeasureTheory.L1.SimpleFunc.setToL1SCLM.congr_simp | Mathlib.MeasureTheory.Integral.SetToL1 | ∀ (α : Type u_1) (E : Type u_2) {F : Type u_3} [inst : NormedAddCommGroup E] [inst_1 : NormedSpace ℝ E]
[inst_2 : NormedAddCommGroup F] [inst_3 : NormedSpace ℝ F] {m : MeasurableSpace α} (μ : MeasureTheory.Measure α)
{T T_1 : Set α → E →L[ℝ] F} (e_T : T = T_1) {C C_1 : ℝ} (e_C : C = C_1)
(hT : MeasureTheory.DominatedFinMeasAdditive μ T C),
MeasureTheory.L1.SimpleFunc.setToL1SCLM α E μ hT = MeasureTheory.L1.SimpleFunc.setToL1SCLM α E μ ⋯ |
Subgroup.prod_eq_bot_iff._simp_2 | Mathlib.Algebra.Group.Subgroup.Basic | ∀ {G : Type u_1} [inst : Group G] {N : Type u_5} [inst_1 : Group N] {H : Subgroup G} {K : Subgroup N},
(H.prod K = ⊥) = (H = ⊥ ∧ K = ⊥) |
specializingMap_iff_isClosed_image_closure_singleton | Mathlib.Topology.Inseparable | ∀ {X : Type u_1} {Y : Type u_2} [inst : TopologicalSpace X] [inst_1 : TopologicalSpace Y] {f : X → Y},
Continuous f → (SpecializingMap f ↔ ∀ (x : X), IsClosed (f '' closure {x})) |
Module.Basis.traceDual_traceDual | Mathlib.RingTheory.Trace.Basic | ∀ {K : Type u_4} {L : Type u_5} [inst : Field K] [inst_1 : Field L] [inst_2 : Algebra K L] {ι : Type w}
[inst_3 : FiniteDimensional K L] [inst_4 : Algebra.IsSeparable K L] [inst_5 : Finite ι] [inst_6 : DecidableEq ι]
(b : Module.Basis ι K L), b.traceDual.traceDual = b |
Lean.Meta.Match.Pattern.val.sizeOf_spec | Lean.Meta.Match.Basic | ∀ (e : Lean.Expr), sizeOf (Lean.Meta.Match.Pattern.val e) = 1 + sizeOf e |
MeasureTheory.MemLp.of_fst_of_snd_prodLp | Mathlib.MeasureTheory.SpecificCodomains.WithLp | ∀ {X : Type u_1} {mX : MeasurableSpace X} {μ : MeasureTheory.Measure X} {p q : ENNReal} [inst : Fact (1 ≤ q)]
{E : Type u_2} {F : Type u_3} [inst_1 : NormedAddCommGroup E] [inst_2 : NormedAddCommGroup F]
{f : X → WithLp q (E × F)},
MeasureTheory.MemLp (fun x => (f x).fst) p μ ∧ MeasureTheory.MemLp (fun x => (f x).snd) p μ →
MeasureTheory.MemLp f p μ |
Delone.DeloneSet.mapIsometry_refl | Mathlib.Analysis.AperiodicOrder.Delone.Basic | ∀ {X : Type u_1} [inst : MetricSpace X] (D : Delone.DeloneSet X),
(Delone.DeloneSet.mapIsometry (IsometryEquiv.refl X)) D = D |
_private.Lean.Server.FileWorker.WidgetRequests.0.Lean.Widget.TaggedTextHighlightState.mk.inj | Lean.Server.FileWorker.WidgetRequests | ∀ {query : String} {ms : Array String.Pos.Raw} {p : String.Pos.Raw} {anyHighlight : Bool} {query_1 : String}
{ms_1 : Array String.Pos.Raw} {p_1 : String.Pos.Raw} {anyHighlight_1 : Bool},
{ query := query, ms := ms, p := p, anyHighlight := anyHighlight } =
{ query := query_1, ms := ms_1, p := p_1, anyHighlight := anyHighlight_1 } →
query = query_1 ∧ ms = ms_1 ∧ p = p_1 ∧ anyHighlight = anyHighlight_1 |
Set.inv_mem_center | Mathlib.Algebra.Group.Center | ∀ {M : Type u_1} [inst : DivisionMonoid M] {a : M}, a ∈ Set.center M → a⁻¹ ∈ Set.center M |
MeasureTheory.Measure.pi.isOpenPosMeasure | Mathlib.MeasureTheory.Constructions.Pi | ∀ {ι : Type u_1} {α : ι → Type u_3} [inst : Fintype ι] [inst_1 : (i : ι) → MeasurableSpace (α i)]
(μ : (i : ι) → MeasureTheory.Measure (α i)) [∀ (i : ι), MeasureTheory.SigmaFinite (μ i)]
[inst_3 : (i : ι) → TopologicalSpace (α i)] [∀ (i : ι), (μ i).IsOpenPosMeasure],
(MeasureTheory.Measure.pi μ).IsOpenPosMeasure |
LocallyConstant.indicator_of_notMem | Mathlib.Topology.LocallyConstant.Basic | ∀ {X : Type u_1} [inst : TopologicalSpace X] {R : Type u_5} [inst_1 : Zero R] {U : Set X} (f : LocallyConstant X R)
{a : X} (hU : IsClopen U), a ∉ U → (f.indicator hU) a = 0 |
Lean.Grind.instCommRingUSize._proof_5 | Init.GrindInstances.Ring.UInt | ∀ (n : ℕ) (a : USize), ↑↑n * a = ↑n * a |
_private.Init.Data.BitVec.Bitblast.0.BitVec.msb_srem._proof_1_1 | Init.Data.BitVec.Bitblast | ∀ {w : ℕ} {x : BitVec w}, x.toInt < 0 → 0 ≤ x.toInt → False |
Lean.Compiler.LCNF.specExtension | Lean.Compiler.LCNF.SpecInfo | Lean.SimplePersistentEnvExtension Lean.Compiler.LCNF.SpecEntry Lean.Compiler.LCNF.SpecState |
Bipointed.swapEquiv_functor_map_toFun | Mathlib.CategoryTheory.Category.Bipointed | ∀ {X Y : Bipointed} (f : X ⟶ Y) (a : X.X), (Bipointed.swapEquiv.functor.map f).toFun a = f.toFun a |
Batteries.RBNode.foldr.match_1 | Batteries.Data.RBMap.Basic | {α : Type u_1} →
{σ : Sort u_3} →
(motive : Batteries.RBNode α → σ → Sort u_2) →
(x : Batteries.RBNode α) →
(x_1 : σ) →
((b : σ) → motive Batteries.RBNode.nil b) →
((c : Batteries.RBColor) →
(l : Batteries.RBNode α) →
(v : α) → (r : Batteries.RBNode α) → (b : σ) → motive (Batteries.RBNode.node c l v r) b) →
motive x x_1 |
Nat.greatestFib.eq_1 | Mathlib.Data.Nat.Fib.Zeckendorf | ∀ (n : ℕ), n.greatestFib = Nat.findGreatest (fun k => Nat.fib k ≤ n) (n + 1) |
_private.Lean.Elab.Structure.0.Lean.Elab.Command.Structure.getFieldDefaultValue? | Lean.Elab.Structure | Lean.Name → Array Lean.Expr → Lean.Name → Lean.Elab.Command.Structure.StructElabM✝ (Option Lean.Expr) |
surjOn_Icc_of_monotone_surjective | Mathlib.Order.Interval.Set.SurjOn | ∀ {α : Type u_1} {β : Type u_2} [inst : LinearOrder α] [inst_1 : PartialOrder β] {f : α → β},
Monotone f → Function.Surjective f → ∀ {a b : α}, a ≤ b → Set.SurjOn f (Set.Icc a b) (Set.Icc (f a) (f b)) |
MeasureTheory.JordanDecomposition.zero_posPart | Mathlib.MeasureTheory.VectorMeasure.Decomposition.Jordan | ∀ {α : Type u_1} [inst : MeasurableSpace α], MeasureTheory.JordanDecomposition.posPart 0 = 0 |
_private.Mathlib.Data.List.Triplewise.0.List.triplewise_iff_getElem._proof_1_14 | Mathlib.Data.List.Triplewise | ∀ {α : Type u_1} (tail : List α) (i j k : ℕ), i < j → j < k → k < tail.length + 1 → i < tail.length |
MapClusterPt.prodMap | Mathlib.Topology.Constructions | ∀ {X : Type u} {Y : Type v} [inst : TopologicalSpace X] [inst_1 : TopologicalSpace Y] {α : Type u_5} {β : Type u_6}
{f : α → X} {g : β → Y} {la : Filter α} {lb : Filter β} {x : X} {y : Y},
MapClusterPt x la f → MapClusterPt y lb g → MapClusterPt (x, y) (la ×ˢ lb) (Prod.map f g) |
Std.Tactic.BVDecide.Normalize.BitVec.zero_ult' | Std.Tactic.BVDecide.Normalize.BitVec | ∀ {w : ℕ} (a : BitVec w), (0#w).ult a = !a == 0#w |
GroupExtension.Splitting.semidirectProductMulEquiv | Mathlib.GroupTheory.GroupExtension.Basic | {N : Type u_1} →
{G : Type u_2} →
[inst : Group N] →
[inst_1 : Group G] →
{E : Type u_3} → [inst_2 : Group E] → {S : GroupExtension N E G} → (s : S.Splitting) → N ⋊[s.conjAct] G ≃* E |
CompTriple.IsId.rec | Mathlib.Logic.Function.CompTypeclasses | {M : Type u_1} →
{σ : M → M} →
{motive : CompTriple.IsId σ → Sort u} → ((eq_id : σ = id) → motive ⋯) → (t : CompTriple.IsId σ) → motive t |
_private.Lean.Data.Array.0.Array.mask.match_1 | Lean.Data.Array | {α : Type u_1} →
(motive : Option (α × Subarray α) → Sort u_2) →
(x : Option (α × Subarray α)) →
(Unit → motive none) → ((x : α) → (s' : Subarray α) → motive (some (x, s'))) → motive x |
Std.Tactic.BVDecide.BVExpr.bitblast.blastShiftLeftConst.go._unary._proof_3 | Std.Tactic.BVDecide.Bitblast.BVExpr.Circuit.Impl.Operations.ShiftLeft | ∀ {α : Type} [inst : Hashable α] [inst_1 : DecidableEq α] {w : ℕ} (aig : Std.Sat.AIG α) (input : aig.RefVec w)
(distance curr : ℕ) (hcurr : curr ≤ w) (s : aig.RefVec curr) (hidx : curr < w) (hdist : ¬curr < distance),
InvImage (fun x1 x2 => x1 < x2)
(fun x => PSigma.casesOn x fun curr hcurr => PSigma.casesOn hcurr fun hcurr s => w - curr)
⟨curr + 1, ⟨⋯, s.push (input.get (curr - distance) ⋯)⟩⟩ ⟨curr, ⟨hcurr, s⟩⟩ |
neg_add_cancel_comm_assoc | Mathlib.Algebra.Group.Defs | ∀ {G : Type u_1} [inst : AddCommGroup G] (a b : G), -a + (b + a) = b |
Set.countable_setOf_finite_subset | Mathlib.Data.Set.Countable | ∀ {α : Type u} {s : Set α}, s.Countable → {t | t.Finite ∧ t ⊆ s}.Countable |
CategoryTheory.Pi.μ_def | Mathlib.CategoryTheory.Pi.Monoidal | ∀ {I : Type w₁} {C : I → Type u₁} [inst : (i : I) → CategoryTheory.Category.{v₁, u₁} (C i)]
[inst_1 : (i : I) → CategoryTheory.MonoidalCategory (C i)] (i : I) (X Y : (i : I) → C i),
CategoryTheory.Functor.LaxMonoidal.μ (CategoryTheory.Pi.eval C i) X Y =
CategoryTheory.CategoryStruct.id (CategoryTheory.MonoidalCategoryStruct.tensorObj (X i) (Y i)) |
IntervalIntegrable.mono_set | Mathlib.MeasureTheory.Integral.IntervalIntegral.Basic | ∀ {ε : Type u_3} [inst : TopologicalSpace ε] [inst_1 : ENormedAddMonoid ε] {f : ℝ → ε} {a b c d : ℝ}
{μ : MeasureTheory.Measure ℝ} [TopologicalSpace.PseudoMetrizableSpace ε],
IntervalIntegrable f μ a b → Set.uIcc c d ⊆ Set.uIcc a b → IntervalIntegrable f μ c d |
Set.restrict_ite_compl | Mathlib.Data.Set.Restrict | ∀ {α : Type u_1} {β : Type u_2} (f g : α → β) (s : Set α) [inst : (x : α) → Decidable (x ∈ s)],
(sᶜ.restrict fun a => if a ∈ s then f a else g a) = sᶜ.restrict g |
CategoryTheory.LocalizerMorphism.IsRightDerivabilityStructure.Constructor.fromRightResolution_map | Mathlib.CategoryTheory.Localization.DerivabilityStructure.Constructor | ∀ {C₁ : Type u_1} {C₂ : Type u_2} [inst : CategoryTheory.Category.{v_1, u_1} C₁]
[inst_1 : CategoryTheory.Category.{v_2, u_2} C₂] {W₁ : CategoryTheory.MorphismProperty C₁}
{W₂ : CategoryTheory.MorphismProperty C₂} (Φ : CategoryTheory.LocalizerMorphism W₁ W₂) {D : Type u_3}
[inst_2 : CategoryTheory.Category.{v_3, u_3} D] (L : CategoryTheory.Functor C₂ D) [inst_3 : L.IsLocalization W₂]
{X₂ : C₂} {X₃ : D} (y : L.obj X₂ ⟶ X₃) {R R' : Φ.RightResolution X₂} (φ : R ⟶ R'),
(CategoryTheory.LocalizerMorphism.IsRightDerivabilityStructure.Constructor.fromRightResolution Φ L y).map φ =
CategoryTheory.CostructuredArrow.homMk (CategoryTheory.StructuredArrow.homMk φ.f ⋯) ⋯ |
descPochhammer_eval_eq_descFactorial | Mathlib.RingTheory.Polynomial.Pochhammer | ∀ (R : Type u) [inst : Ring R] (n k : ℕ), Polynomial.eval (↑n) (descPochhammer R k) = ↑(n.descFactorial k) |
ONote.NFBelow | Mathlib.SetTheory.Ordinal.Notation | ONote → Ordinal.{0} → Prop |
Units.instDecidableEq | Mathlib.Algebra.Group.Units.Defs | {α : Type u} → [inst : Monoid α] → [DecidableEq α] → DecidableEq αˣ |
_private.Mathlib.Analysis.Complex.Convex.0.Complex.instPathConnectedSpaceUnits._simp_3 | Mathlib.Analysis.Complex.Convex | ∀ {a b : Prop}, (¬(a ∧ b)) = (¬a ∨ ¬b) |
OneHomClass | Mathlib.Algebra.Group.Hom.Defs | (F : Type u_10) → (M : outParam (Type u_11)) → (N : outParam (Type u_12)) → [One M] → [One N] → [FunLike F M N] → Prop |
Std.Do.«term_∧ₚ_» | Std.Do.PostCond | Lean.TrailingParserDescr |
R0Space.closure_singleton | Mathlib.Topology.Separation.Basic | ∀ {X : Type u_1} [inst : TopologicalSpace X] [R0Space X] (x : X), closure {x} = (nhds x).ker |
Fin.val_natCast | Mathlib.Data.Fin.Basic | ∀ (a n : ℕ) [inst : NeZero n], ↑↑a = a % n |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.