ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/MeasureTheory/Integral/SetToL1.lean
α : Type u_1
E : Type u_2
F : Type u_3
F' : Type u_4
G : Type u_5
𝕜 : Type u_6
p : ℝ≥0∞
inst✝⁷ : NormedAddCommGroup E
inst✝⁶ : NormedSpace ℝ E
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace ℝ F
inst✝³ : NormedAddCommGroup F'
inst✝² : NormedSpace ℝ F'
inst✝¹ : NormedAddCommGroup G
m : MeasurableSpace α
μ : Measure α
inst✝ : CompleteSpace F
T T' T'' : Set α → E →L[ℝ] F
C C' C'' : ℝ
f g : α → E
hT : DominatedFinMeasAdditive μ T C
hf : Integrable f μ
hg : Integrable g μ
\u22a2 setToFun μ T hT (f + g) = setToFun μ T hT f + setToFun μ T hT g
-- Mathlib/Control/Traversable/Instances.lean
σ : Type u
F G : Type u → Type u
inst✝³ : Applicative F
inst✝² : Applicative G
inst✝¹ : LawfulApplicative G
inst✝ : LawfulApplicative F
η : ApplicativeTransformation F G
α : Type u_1
β : Type u
f : α → F β
x : σ ⊕ α
\u22a2 (fun {α} => η.app α) (Sum.traverse f x) = Sum.traverse ((fun {α} => η.app α) ∘ f) x
-- Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean
α : Type u_1
𝕜 : Type u_2
inst✝¹ : LinearOrderedField 𝕜
G : SimpleGraph α
inst✝ : DecidableRel G.Adj
ε : 𝕜
s t : Finset α
a b : α
hG : G.IsUniform ε s t
hε : ε ≤ 0
\u22a2 ↑s.card * ε ≤ ↑∅.card
-- Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean
α : Type u_1
𝕜 : Type u_2
inst✝¹ : LinearOrderedField 𝕜
G : SimpleGraph α
inst✝ : DecidableRel G.Adj
ε : 𝕜
s t : Finset α
a b : α
hG : G.IsUniform ε s t
hε : ε ≤ 0
\u22a2 ↑t.card * ε ≤ ↑∅.card
-- Mathlib/CategoryTheory/Simple.lean
C : Type u
inst✝² : Category.{v, u} C
inst✝¹ : HasZeroMorphisms C
inst✝ : HasZeroObject C
X : C
h : IsSimpleOrder (Subobject X)
\u22a2 Simple X
-- Mathlib/Topology/UniformSpace/Basic.lean
α : Type ua
β : Type ub
γ : Type uc
δ : Type ud
ι : Sort u_1
inst✝ : UniformSpace α
s : Set α
\u22a2 IsOpen s ↔ ∀ x ∈ s, ∃ V ∈ 𝓤 α, IsOpen V ∧ ball x V ⊆ s
-- Mathlib/Topology/UniformSpace/Basic.lean
α : Type ua
β : Type ub
γ : Type uc
δ : Type ud
ι : Sort u_1
inst✝ : UniformSpace α
s : Set α
\u22a2 (∀ x ∈ s, ∃ V ∈ 𝓤 α, ball x V ⊆ s) ↔ ∀ x ∈ s, ∃ V ∈ 𝓤 α, IsOpen V ∧ ball x V ⊆ s
-- Mathlib/Algebra/Order/Group/MinMax.lean
α : Type u_1
inst✝ : LinearOrderedCommGroup α
a✝ b✝ c✝ a b c : α
\u22a2 min (a / b) (a / c) = a / max b c
-- Mathlib/RingTheory/Ideal/QuotientOperations.lean
R : Type u
S : Type v
inst✝¹ : CommRing R
inst✝ : Semiring S
f✝ : R →+* S
I : Ideal R
f : R →+* S
H : ∀ a ∈ I, f a = 0
hI : ker f ≤ I
\u22a2 Function.Injective ⇑(Ideal.Quotient.lift I f H)
-- Mathlib/RingTheory/Ideal/QuotientOperations.lean
R : Type u
S : Type v
inst✝¹ : CommRing R
inst✝ : Semiring S
f✝ : R →+* S
I : Ideal R
f : R →+* S
H : ∀ a ∈ I, f a = 0
hI : ker f ≤ I
\u22a2 ∀ (x : R ⧸ I), (Ideal.Quotient.lift I f H) x = 0 → x = 0
-- Mathlib/RingTheory/Ideal/QuotientOperations.lean
R : Type u
S : Type v
inst✝¹ : CommRing R
inst✝ : Semiring S
f✝ : R →+* S
I : Ideal R
f : R →+* S
H : ∀ a ∈ I, f a = 0
hI : ker f ≤ I
u : R ⧸ I
hu : (Ideal.Quotient.lift I f H) u = 0
\u22a2 u = 0
-- Mathlib/RingTheory/Ideal/QuotientOperations.lean
R : Type u
S : Type v
inst✝¹ : CommRing R
inst✝ : Semiring S
f✝ : R →+* S
I : Ideal R
f : R →+* S
H : ∀ a ∈ I, f a = 0
hI : ker f ≤ I
v : R
hu : (Ideal.Quotient.lift I f H) ((Ideal.Quotient.mk I) v) = 0
\u22a2 (Ideal.Quotient.mk I) v = 0
-- Mathlib/RingTheory/Ideal/QuotientOperations.lean
R : Type u
S : Type v
inst✝¹ : CommRing R
inst✝ : Semiring S
f✝ : R →+* S
I : Ideal R
f : R →+* S
H : ∀ a ∈ I, f a = 0
hI : ker f ≤ I
v : R
hu : f v = 0
\u22a2 (Ideal.Quotient.mk I) v = 0
-- Mathlib/RingTheory/Ideal/QuotientOperations.lean
R : Type u
S : Type v
inst✝¹ : CommRing R
inst✝ : Semiring S
f✝ : R →+* S
I : Ideal R
f : R →+* S
H : ∀ a ∈ I, f a = 0
hI : ker f ≤ I
v : R
hu : f v = 0
\u22a2 v ∈ I
-- Mathlib/RingTheory/FractionalIdeal/Operations.lean
R : Type u_1
inst✝⁷ : CommRing R
S : Submonoid R
P : Type u_2
inst✝⁶ : CommRing P
inst✝⁵ : Algebra R P
loc : IsLocalization S P
R₁ : Type u_3
inst✝⁴ : CommRing R₁
K : Type u_4
inst✝³ : Field K
inst✝² : Algebra R₁ K
inst✝¹ : IsFractionRing R₁ K
inst✝ : NoZeroSMulDivisors R P
x y : P
\u22a2 spanSingleton S x = spanSingleton S y ↔ ∃ z, z • x = y
-- Mathlib/RingTheory/FractionalIdeal/Operations.lean
R : Type u_1
inst✝⁷ : CommRing R
S : Submonoid R
P : Type u_2
inst✝⁶ : CommRing P
inst✝⁵ : Algebra R P
loc : IsLocalization S P
R₁ : Type u_3
inst✝⁴ : CommRing R₁
K : Type u_4
inst✝³ : Field K
inst✝² : Algebra R₁ K
inst✝¹ : IsFractionRing R₁ K
inst✝ : NoZeroSMulDivisors R P
x y : P
\u22a2 ⟨span R {x}, ⋯⟩ = ⟨span R {y}, ⋯⟩ ↔ span R {x} = span R {y}
-- Mathlib/Data/Nat/Factorial/Basic.lean
n k : ℕ
\u22a2 (n - k) * (n - k + 1).ascFactorial k = (n - k).ascFactorial (k + 1)
-- Mathlib/Algebra/Polynomial/Basic.lean
R : Type u
a b : R
m n : ℕ
inst✝ : Semiring R
p q : R[X]
\u22a2 ((monomial n) a).coeff m = if n = m then a else 0
-- Mathlib/MeasureTheory/Integral/SetToL1.lean
α : Type u_1
E : Type u_2
F : Type u_3
F' : Type u_4
G : Type u_5
𝕜 : Type u_6
p : ℝ≥0∞
inst✝⁷ : NormedAddCommGroup E
inst✝⁶ : NormedSpace ℝ E
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace ℝ F
inst✝³ : NormedAddCommGroup F'
inst✝² : NormedSpace ℝ F'
inst✝¹ : NormedAddCommGroup G
m : MeasurableSpace α
μ : Measure α
inst✝ : CompleteSpace F
T T' T'' : Set α → E →L[ℝ] F
C C' C'' : ℝ
f✝ g : α → E
hT : DominatedFinMeasAdditive μ T C
ι : Type u_7
s : Finset ι
f : ι → α → E
\u22a2 (∀ i ∈ s, Integrable (f i) μ) → setToFun μ T hT (∑ i ∈ s, f i) = ∑ i ∈ s, setToFun μ T hT (f i)
-- Mathlib/MeasureTheory/Integral/SetToL1.lean
α : Type u_1
E : Type u_2
F : Type u_3
F' : Type u_4
G : Type u_5
𝕜 : Type u_6
p : ℝ≥0∞
inst✝⁷ : NormedAddCommGroup E
inst✝⁶ : NormedSpace ℝ E
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace ℝ F
inst✝³ : NormedAddCommGroup F'
inst✝² : NormedSpace ℝ F'
inst✝¹ : NormedAddCommGroup G
m : MeasurableSpace α
μ : Measure α
inst✝ : CompleteSpace F
T T' T'' : Set α → E →L[ℝ] F
C C' C'' : ℝ
f✝ g : α → E
hT : DominatedFinMeasAdditive μ T C
ι : Type u_7
s : Finset ι
f : ι → α → E
\u22a2 (∀ i ∈ ∅, Integrable (f i) μ) → setToFun μ T hT (∑ i ∈ ∅, f i) = ∑ i ∈ ∅, setToFun μ T hT (f i)
-- Mathlib/MeasureTheory/Integral/SetToL1.lean
α : Type u_1
E : Type u_2
F : Type u_3
F' : Type u_4
G : Type u_5
𝕜 : Type u_6
p : ℝ≥0∞
inst✝⁷ : NormedAddCommGroup E
inst✝⁶ : NormedSpace ℝ E
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace ℝ F
inst✝³ : NormedAddCommGroup F'
inst✝² : NormedSpace ℝ F'
inst✝¹ : NormedAddCommGroup G
m : MeasurableSpace α
μ : Measure α
inst✝ : CompleteSpace F
T T' T'' : Set α → E →L[ℝ] F
C C' C'' : ℝ
f✝ g : α → E
hT : DominatedFinMeasAdditive μ T C
ι : Type u_7
s : Finset ι
f : ι → α → E
\u22a2 ∀ ⦃a : ι⦄ {s : Finset ι}, a ∉ s → ((∀ i ∈ s, Integrable (f i) μ) → setToFun μ T hT (∑ i ∈ s, f i) = ∑ i ∈ s, setToFun μ T hT (f i)) → (∀ i ∈ insert a s, Integrable (f i) μ) → setToFun μ T hT (∑ i ∈ insert a s, f i) = ∑ i ∈ insert a s, setToFun μ T hT (f i)
-- Mathlib/Data/Finset/Sups.lean
F : Type u_1
α : Type u_2
β : Type u_3
inst✝⁵ : DecidableEq α
inst✝⁴ : DecidableEq β
inst✝³ : SemilatticeSup α
inst✝² : SemilatticeSup β
inst✝¹ : FunLike F α β
inst✝ : SupHomClass F α β
s✝ s₁ s₂ t✝ t₁ t₂ u v : Finset α
a b c : α
f : F
hf : Injective ⇑f
s t : Finset α
\u22a2 map { toFun := ⇑f, inj' := hf } (s ⊻ t) = map { toFun := ⇑f, inj' := hf } s ⊻ map { toFun := ⇑f, inj' := hf } t
-- Mathlib/Algebra/Order/BigOperators/Group/Finset.lean
ι : Type u_1
α : Type u_2
β : Type u_3
M : Type u_4
N : Type u_5
G : Type u_6
k : Type u_7
R : Type u_8
inst✝¹ : DecidableEq α
s : Finset α
B : Finset (Finset α)
n : ℕ
inst✝ : Fintype α
h : ∀ (a : α), (filter (fun x => a ∈ x) B).card = n
\u22a2 ∑ s ∈ B, s.card = Fintype.card α * n
-- Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean
α : Type u_1
β : Type u_2
l : Filter α
k f g g' : α → β
inst✝¹ : NormedLinearOrderedField β
inst✝ : OrderTopology β
hk : Tendsto k l atTop
\u22a2 SuperpolynomialDecay l k f ↔ ∀ (z : ℤ), f =O[l] fun a => k a ^ z
-- Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean
α : Type u_1
β : Type u_2
l : Filter α
k f g g' : α → β
inst✝¹ : NormedLinearOrderedField β
inst✝ : OrderTopology β
hk : Tendsto k l atTop
\u22a2 (∀ (z : ℤ), Tendsto (fun a => k a ^ z * f a) l (𝓝 0)) ↔ ∀ (z : ℤ), f =O[l] fun a => k a ^ z
-- Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean
α : Type u_1
β : Type u_2
l : Filter α
k f g g' : α → β
inst✝¹ : NormedLinearOrderedField β
inst✝ : OrderTopology β
hk : Tendsto k l atTop
hk0 : ∀ᶠ (x : α) in l, k x ≠ 0
\u22a2 (∀ (z : ℤ), Tendsto (fun a => k a ^ z * f a) l (𝓝 0)) ↔ ∀ (z : ℤ), f =O[l] fun a => k a ^ z
-- Mathlib/Geometry/Manifold/MFDeriv/Basic.lean
𝕜 : Type u_1
inst✝¹⁵ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝¹⁴ : NormedAddCommGroup E
inst✝¹³ : NormedSpace 𝕜 E
H : Type u_3
inst✝¹² : TopologicalSpace H
I : ModelWithCorners 𝕜 E H
M : Type u_4
inst✝¹¹ : TopologicalSpace M
inst✝¹⁰ : ChartedSpace H M
E' : Type u_5
inst✝⁹ : NormedAddCommGroup E'
inst✝⁸ : NormedSpace 𝕜 E'
H' : Type u_6
inst✝⁷ : TopologicalSpace H'
I' : ModelWithCorners 𝕜 E' H'
M' : Type u_7
inst✝⁶ : TopologicalSpace M'
inst✝⁵ : ChartedSpace H' M'
E'' : Type u_8
inst✝⁴ : NormedAddCommGroup E''
inst✝³ : NormedSpace 𝕜 E''
H'' : Type u_9
inst✝² : TopologicalSpace H''
I'' : ModelWithCorners 𝕜 E'' H''
M'' : Type u_10
inst✝¹ : TopologicalSpace M''
inst✝ : ChartedSpace H'' M''
f f₀ f₁ : M → M'
x : M
s t : Set M
g : M' → M''
u : Set M'
Is : SmoothManifoldWithCorners I M
I's : SmoothManifoldWithCorners I' M'
I''s : SmoothManifoldWithCorners I'' M''
f' f₀' f₁' : TangentSpace I x →L[𝕜] TangentSpace I' (f x)
g' : TangentSpace I' (f x) →L[𝕜] TangentSpace I'' (g (f x))
h : MDifferentiableWithinAt I I' f s x
hs : s ∈ 𝓝 x
\u22a2 MDifferentiableAt I I' f x
-- Mathlib/Geometry/Manifold/MFDeriv/Basic.lean
𝕜 : Type u_1
inst✝¹⁵ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝¹⁴ : NormedAddCommGroup E
inst✝¹³ : NormedSpace 𝕜 E
H : Type u_3
inst✝¹² : TopologicalSpace H
I : ModelWithCorners 𝕜 E H
M : Type u_4
inst✝¹¹ : TopologicalSpace M
inst✝¹⁰ : ChartedSpace H M
E' : Type u_5
inst✝⁹ : NormedAddCommGroup E'
inst✝⁸ : NormedSpace 𝕜 E'
H' : Type u_6
inst✝⁷ : TopologicalSpace H'
I' : ModelWithCorners 𝕜 E' H'
M' : Type u_7
inst✝⁶ : TopologicalSpace M'
inst✝⁵ : ChartedSpace H' M'
E'' : Type u_8
inst✝⁴ : NormedAddCommGroup E''
inst✝³ : NormedSpace 𝕜 E''
H'' : Type u_9
inst✝² : TopologicalSpace H''
I'' : ModelWithCorners 𝕜 E'' H''
M'' : Type u_10
inst✝¹ : TopologicalSpace M''
inst✝ : ChartedSpace H'' M''
f f₀ f₁ : M → M'
x : M
s t : Set M
g : M' → M''
u : Set M'
Is : SmoothManifoldWithCorners I M
I's : SmoothManifoldWithCorners I' M'
I''s : SmoothManifoldWithCorners I'' M''
f' f₀' f₁' : TangentSpace I x →L[𝕜] TangentSpace I' (f x)
g' : TangentSpace I' (f x) →L[𝕜] TangentSpace I'' (g (f x))
h : MDifferentiableWithinAt I I' f s x
hs : s ∈ 𝓝 x
this : s = univ ∩ s
\u22a2 MDifferentiableAt I I' f x
-- Mathlib/SetTheory/Game/Nim.lean
x✝ : PGame
inst✝ : x✝.Impartial
G : PGame := x✝
\u22a2 x✝ ≈ nim x✝.grundyValue
-- Mathlib/SetTheory/Game/Nim.lean
x✝ : PGame
inst✝ : x✝.Impartial
G : PGame := x✝
\u22a2 ∀ (i : (x✝ + nim x✝.grundyValue).LeftMoves), (x✝ + nim x✝.grundyValue).moveLeft i ‖ 0
-- Mathlib/SetTheory/Game/Nim.lean
x✝ : PGame
inst✝ : x✝.Impartial
G : PGame := x✝
i : (x✝ + nim x✝.grundyValue).LeftMoves
\u22a2 (x✝ + nim x✝.grundyValue).moveLeft i ‖ 0
-- Mathlib/SetTheory/Game/Nim.lean
x✝ : PGame
inst✝ : x✝.Impartial
G : PGame := x✝
i : (x✝ + nim x✝.grundyValue).LeftMoves
\u22a2 ∀ (i : x✝.LeftMoves), (x✝ + nim x✝.grundyValue).moveLeft (toLeftMovesAdd (Sum.inl i)) ‖ 0
-- Mathlib/SetTheory/Game/Nim.lean
x✝ : PGame
inst✝ : x✝.Impartial
G : PGame := x✝
i : (x✝ + nim x✝.grundyValue).LeftMoves
\u22a2 ∀ (i : (nim x✝.grundyValue).LeftMoves), (x✝ + nim x✝.grundyValue).moveLeft (toLeftMovesAdd (Sum.inr i)) ‖ 0
-- Mathlib/SetTheory/Game/Nim.lean
G✝ : PGame
inst✝ : G✝.Impartial
a✝ : ∀ (y : (G : PGame) ×' G.Impartial), (invImage (fun x => PSigma.casesOn x fun G inst => G) instWellFoundedRelation).1 y ⟨G✝, inst✝⟩ → y.1 ≈ nim y.1.grundyValue
G : PGame := G✝
i₁ : G✝.LeftMoves
\u22a2 (invImage (fun x => PSigma.casesOn x fun G inst => G) instWellFoundedRelation).1 ⟨G.moveLeft i₁, ⋯⟩ ⟨G✝, inst✝⟩
-- Mathlib/SetTheory/Game/Nim.lean
G✝ : PGame
inst✝ : G✝.Impartial
a✝ : ∀ (y : (G : PGame) ×' G.Impartial), (invImage (fun x => PSigma.casesOn x fun G inst => G) instWellFoundedRelation).1 y ⟨G✝, inst✝⟩ → y.1 ≈ nim y.1.grundyValue
G : PGame := G✝
i₂ : (mk (Quotient.out G✝.grundyValue).α (Quotient.out G✝.grundyValue).α (fun o₂ => nim (typein (fun x x_1 => x < x_1) o₂)) fun o₂ => nim (typein (fun x x_1 => x < x_1) o₂)).LeftMoves
h' : ∃ i, (G.moveLeft i).grundyValue = typein (Quotient.out G.grundyValue).r i₂
i : G.LeftMoves
hi : (G.moveLeft i).grundyValue = typein (Quotient.out G.grundyValue).r i₂
h✝ : h' = ⋯
\u22a2 (invImage (fun x => PSigma.casesOn x fun G inst => G) instWellFoundedRelation).1 ⟨G.moveLeft i, ⋯⟩ ⟨G✝, inst✝⟩
-- Mathlib/CategoryTheory/GlueData.lean
C : Type u₁
inst✝¹ : Category.{v, u₁} C
C' : Type u₂
inst✝ : Category.{v, u₂} C'
D : GlueData C
i j : D.J
eq : (pullbackSymmetry (D.f i i) (D.f i j)).hom = pullback.snd (D.f i i) (D.f i j) ≫ inv (pullback.fst (D.f i j) (D.f i i))
\u22a2 D.t i j ≫ D.t j i = 𝟙 (D.V (i, j))
-- Mathlib/CategoryTheory/GlueData.lean
C : Type u₁
inst✝¹ : Category.{v, u₁} C
C' : Type u₂
inst✝ : Category.{v, u₂} C'
D : GlueData C
i j : D.J
eq : (pullbackSymmetry (D.f i i) (D.f i j)).hom = pullback.snd (D.f i i) (D.f i j) ≫ inv (pullback.fst (D.f i j) (D.f i i))
this : D.t' i j i ≫ D.t' j i i ≫ D.t' i i j = 𝟙 (pullback (D.f i j) (D.f i i))
\u22a2 D.t i j ≫ D.t j i = 𝟙 (D.V (i, j))
-- Mathlib/CategoryTheory/GlueData.lean
C : Type u₁
inst✝¹ : Category.{v, u₁} C
C' : Type u₂
inst✝ : Category.{v, u₂} C'
D : GlueData C
i j : D.J
eq : (pullbackSymmetry (D.f i i) (D.f i j)).hom = pullback.snd (D.f i i) (D.f i j) ≫ inv (pullback.fst (D.f i j) (D.f i i))
this : (pullback.fst (D.f i j) (D.f i i) ≫ D.t i j ≫ inv (pullback.snd (D.f j i) (D.f j i))) ≫ (pullback.snd (D.f j i) (D.f j i) ≫ D.t j i ≫ inv (pullback.snd (D.f i i) (D.f i j))) ≫ pullback.snd (D.f i i) (D.f i j) ≫ inv (pullback.fst (D.f i j) (D.f i i)) = 𝟙 (pullback (D.f i j) (D.f i i))
\u22a2 D.t i j ≫ D.t j i = 𝟙 (D.V (i, j))
-- Mathlib/CategoryTheory/GlueData.lean
C : Type u₁
inst✝¹ : Category.{v, u₁} C
C' : Type u₂
inst✝ : Category.{v, u₂} C'
D : GlueData C
i j : D.J
eq : (pullbackSymmetry (D.f i i) (D.f i j)).hom = pullback.snd (D.f i i) (D.f i j) ≫ inv (pullback.fst (D.f i j) (D.f i i))
this : pullback.fst (D.f i j) (D.f i i) ≫ D.t i j ≫ D.t j i ≫ inv (pullback.fst (D.f i j) (D.f i i)) = 𝟙 (pullback (D.f i j) (D.f i i))
\u22a2 D.t i j ≫ D.t j i = 𝟙 (D.V (i, j))
-- Mathlib/CategoryTheory/GlueData.lean
C : Type u₁
inst✝¹ : Category.{v, u₁} C
C' : Type u₂
inst✝ : Category.{v, u₂} C'
D : GlueData C
i j : D.J
eq : (pullbackSymmetry (D.f i i) (D.f i j)).hom = pullback.snd (D.f i i) (D.f i j) ≫ inv (pullback.fst (D.f i j) (D.f i i))
this : D.t i j ≫ D.t j i = (inv (pullback.fst (D.f i j) (D.f i i)) ≫ 𝟙 (pullback (D.f i j) (D.f i i))) ≫ pullback.fst (D.f i j) (D.f i i)
\u22a2 D.t i j ≫ D.t j i = 𝟙 (D.V (i, j))
-- Mathlib/SetTheory/Game/PGame.lean
xl xr : Type u
\u22a2 star ⧏ 0
-- Mathlib/SetTheory/Game/PGame.lean
xl xr : Type u
\u22a2 ∃ j, ∀ (i : (star.moveRight j).LeftMoves), (star.moveRight j).moveLeft i ⧏ 0
-- Mathlib/SetTheory/Game/PGame.lean
xl xr : Type u
\u22a2 ∀ (i : (star.moveRight default).LeftMoves), (star.moveRight default).moveLeft i ⧏ 0
-- Mathlib/SetTheory/Game/PGame.lean
xl xr : Type u
\u22a2 0 ⧏ star
-- Mathlib/SetTheory/Game/PGame.lean
xl xr : Type u
\u22a2 ∃ i, ∀ (j : (star.moveLeft i).RightMoves), 0 ⧏ (star.moveLeft i).moveRight j
-- Mathlib/SetTheory/Game/PGame.lean
xl xr : Type u
\u22a2 ∀ (j : (star.moveLeft default).RightMoves), 0 ⧏ (star.moveLeft default).moveRight j
-- Mathlib/RingTheory/PowerSeries/Order.lean
R : Type u_1
inst✝¹ : CommRing R
inst✝ : IsDomain R
\u22a2 divided_by_X_pow_order ⋯ = 1
-- Mathlib/RingTheory/PowerSeries/Order.lean
R : Type u_1
inst✝¹ : CommRing R
inst✝ : IsDomain R
\u22a2 X * divided_by_X_pow_order ⋯ = X
-- Mathlib/RingTheory/GradedAlgebra/HomogeneousIdeal.lean
ι : Type u_1
σ : Type u_2
R : Type u_3
A : Type u_4
inst✝⁵ : Semiring A
inst✝⁴ : SetLike σ A
inst✝³ : AddSubmonoidClass σ A
𝒜 : ι → σ
inst✝² : DecidableEq ι
inst✝¹ : AddMonoid ι
inst✝ : GradedRing 𝒜
I✝ I : Ideal A
hI : IsHomogeneous 𝒜 I
x : A
\u22a2 x ∈ I ↔ ∀ (i : ι), ↑(((decompose 𝒜) x) i) ∈ I
-- Mathlib/Data/PNat/Xgcd.lean
u : XgcdType
\u22a2 u.zp + u.wp + u.zp * u.wp = u.y * u.x ↔ u.wp + u.zp + u.wp * u.zp = u.x * u.y
-- Mathlib/Analysis/Analytic/Basic.lean
𝕜 : Type u_1
E : Type u_2
F : Type u_3
G : Type u_4
inst✝⁶ : NontriviallyNormedField 𝕜
inst✝⁵ : NormedAddCommGroup E
inst✝⁴ : NormedSpace 𝕜 E
inst✝³ : NormedAddCommGroup F
inst✝² : NormedSpace 𝕜 F
inst✝¹ : NormedAddCommGroup G
inst✝ : NormedSpace 𝕜 G
f g : E → F
p pf pg : FormalMultilinearSeries 𝕜 E F
x : E
r r' : ℝ≥0∞
hf : HasFPowerSeriesAt f pf x
hg : HasFPowerSeriesAt g pg x
\u22a2 HasFPowerSeriesAt (f + g) (pf + pg) x
-- Mathlib/Analysis/Analytic/Basic.lean
𝕜 : Type u_1
E : Type u_2
F : Type u_3
G : Type u_4
inst✝⁶ : NontriviallyNormedField 𝕜
inst✝⁵ : NormedAddCommGroup E
inst✝⁴ : NormedSpace 𝕜 E
inst✝³ : NormedAddCommGroup F
inst✝² : NormedSpace 𝕜 F
inst✝¹ : NormedAddCommGroup G
inst✝ : NormedSpace 𝕜 G
f g : E → F
p pf pg : FormalMultilinearSeries 𝕜 E F
x : E
r✝ r' : ℝ≥0∞
hf : HasFPowerSeriesAt f pf x
hg : HasFPowerSeriesAt g pg x
r : ℝ≥0∞
hr : HasFPowerSeriesOnBall f pf x r ∧ HasFPowerSeriesOnBall g pg x r
\u22a2 HasFPowerSeriesAt (f + g) (pf + pg) x
-- Mathlib/MeasureTheory/MeasurableSpace/Basic.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
δ' : Type u_5
ι : Sort uι
s✝ t u : Set α
inst✝ : MeasurableSpace α
s : ℕ → Set α
hs : ∀ (n : ℕ), MeasurableSet (s n)
\u22a2 MeasurableSet (liminf s atTop)
-- Mathlib/Probability/ConditionalProbability.lean
Ω : Type u_1
Ω' : Type u_2
α : Type u_3
m : MeasurableSpace Ω
m' : MeasurableSpace Ω'
μ : Measure Ω
s t : Set Ω
inst✝ : IsProbabilityMeasure μ
\u22a2 μ[|univ] = μ
-- Mathlib/MeasureTheory/Integral/IntervalIntegral.lean
ι : Type u_1
𝕜 : Type u_2
E : Type u_3
F : Type u_4
A : Type u_5
inst✝² : NormedAddCommGroup E
inst✝¹ : CompleteSpace E
inst✝ : NormedSpace ℝ E
a✝ b✝ : ℝ
f g : ℝ → E
μ : Measure ℝ
a b : ℝ
\u22a2 ∫ (x : ℝ) in b..a, f x ∂μ = -∫ (x : ℝ) in a..b, f x ∂μ
-- Mathlib/Algebra/Homology/HomotopyCategory/HomComplexShift.lean
C : Type u
inst✝³ : Category.{v, u} C
inst✝² : Preadditive C
R : Type u_1
inst✝¹ : Ring R
inst✝ : Linear R C
K L M : CochainComplex C ℤ
n✝ : ℤ
γ✝ γ₁ γ₂ : Cochain K L n✝
n' a : ℤ
γ : Cochain ((CategoryTheory.shiftFunctor (CochainComplex C ℤ) a).obj K) L n'
n : ℤ
hn : n + a = n'
\u22a2 (leftShiftAddEquiv K L n a n' hn).symm (-γ) = -γ.leftUnshift n hn
-- Mathlib/Analysis/Convex/Between.lean
R : Type u_1
V : Type u_2
V' : Type u_3
P : Type u_4
P' : Type u_5
inst✝⁶ : OrderedRing R
inst✝⁵ : AddCommGroup V
inst✝⁴ : Module R V
inst✝³ : AddTorsor V P
inst✝² : AddCommGroup V'
inst✝¹ : Module R V'
inst✝ : AddTorsor V' P'
x y : V
\u22a2 affineSegment R x y = segment R x y
-- Mathlib/Data/Fintype/CardEmbedding.lean
α : Type u_1
β : Type u_2
inst✝¹ : Fintype α
inst✝ : Fintype β
emb : Fintype (α ↪ β)
\u22a2 ‖α ↪ β‖ = ‖β‖.descFactorial ‖α‖
-- Mathlib/Data/Fintype/CardEmbedding.lean
β : Type u_2
inst✝ : Fintype β
α₁ α₂ : Type u_1
h₂ : Fintype α₂
e : α₁ ≃ α₂
ih : (fun t [Fintype t] => ‖t ↪ β‖ = ‖β‖.descFactorial ‖t‖) α₁
\u22a2 ‖α₂ ↪ β‖ = ‖β‖.descFactorial ‖α₂‖
-- Mathlib/Data/Fintype/CardEmbedding.lean
β : Type u_2
inst✝ : Fintype β
\u22a2 ‖PEmpty.{u_1 + 1} ↪ β‖ = ‖β‖.descFactorial ‖PEmpty.{u_1 + 1}‖
-- Mathlib/Data/Fintype/CardEmbedding.lean
β : Type u_2
inst✝ : Fintype β
γ : Type u_1
h : Fintype γ
ih : (fun t [Fintype t] => ‖t ↪ β‖ = ‖β‖.descFactorial ‖t‖) γ
\u22a2 ‖Option γ ↪ β‖ = ‖β‖.descFactorial ‖Option γ‖
-- Mathlib/Order/Bounded.lean
α : Type u_1
r : α → α → Prop
s t : Set α
inst✝¹ : Preorder α
inst✝ : NoMaxOrder α
\u22a2 Bounded (fun x x_1 => x ≤ x_1) s ↔ Bounded (fun x x_1 => x < x_1) s
-- Mathlib/Order/Bounded.lean
α : Type u_1
r : α → α → Prop
s t : Set α
inst✝¹ : Preorder α
inst✝ : NoMaxOrder α
h : Bounded (fun x x_1 => x ≤ x_1) s
\u22a2 Bounded (fun x x_1 => x < x_1) s
-- Mathlib/Order/Bounded.lean
α : Type u_1
r : α → α → Prop
s t : Set α
inst✝¹ : Preorder α
inst✝ : NoMaxOrder α
a : α
ha : ∀ b ∈ s, (fun x x_1 => x ≤ x_1) b a
\u22a2 Bounded (fun x x_1 => x < x_1) s
-- Mathlib/Order/Bounded.lean
α : Type u_1
r : α → α → Prop
s t : Set α
inst✝¹ : Preorder α
inst✝ : NoMaxOrder α
a : α
ha : ∀ b ∈ s, (fun x x_1 => x ≤ x_1) b a
b : α
hb : a < b
\u22a2 Bounded (fun x x_1 => x < x_1) s
-- Mathlib/NumberTheory/NumberField/Discriminant.lean
K : Type u_1
inst✝¹ : Field K
inst✝ : NumberField K
\u22a2 ∃ a, a ≠ 0 ∧ ↑|(Algebra.norm ℚ) ↑a| ≤ (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial / ↑(finrank ℚ K) ^ finrank ℚ K * √|↑(discr K)|
-- Mathlib/NumberTheory/NumberField/Discriminant.lean
K : Type u_1
inst✝¹ : Field K
inst✝ : NumberField K
w✝ : K
h_mem : w✝ ∈ ↑1
h_nz : w✝ ≠ 0
h_nm : ↑|(Algebra.norm ℚ) w✝| ≤ ↑(FractionalIdeal.absNorm ↑1) * (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial / ↑(finrank ℚ K) ^ finrank ℚ K * √|↑(discr K)|
\u22a2 ∃ a, a ≠ 0 ∧ ↑|(Algebra.norm ℚ) ↑a| ≤ (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial / ↑(finrank ℚ K) ^ finrank ℚ K * √|↑(discr K)|
-- Mathlib/NumberTheory/NumberField/Discriminant.lean
K : Type u_1
inst✝¹ : Field K
inst✝ : NumberField K
a : 𝓞 K
h_mem : (algebraMap (𝓞 K) K) a ∈ ↑1
h_nz : (algebraMap (𝓞 K) K) a ≠ 0
h_nm : ↑|(Algebra.norm ℚ) ((algebraMap (𝓞 K) K) a)| ≤ ↑(FractionalIdeal.absNorm ↑1) * (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial / ↑(finrank ℚ K) ^ finrank ℚ K * √|↑(discr K)|
\u22a2 ∃ a, a ≠ 0 ∧ ↑|(Algebra.norm ℚ) ↑a| ≤ (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial / ↑(finrank ℚ K) ^ finrank ℚ K * √|↑(discr K)|
-- Mathlib/NumberTheory/NumberField/Discriminant.lean
K : Type u_1
inst✝¹ : Field K
inst✝ : NumberField K
a : 𝓞 K
h_mem : (algebraMap (𝓞 K) K) a ∈ ↑1
h_nz : (algebraMap (𝓞 K) K) a ≠ 0
h_nm : ↑|(Algebra.norm ℚ) ((algebraMap (𝓞 K) K) a)| ≤ ↑(FractionalIdeal.absNorm ↑1) * (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial / ↑(finrank ℚ K) ^ finrank ℚ K * √|↑(discr K)|
\u22a2 ↑|(Algebra.norm ℚ) ↑a| ≤ (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial / ↑(finrank ℚ K) ^ finrank ℚ K * √|↑(discr K)|
-- Mathlib/NumberTheory/NumberField/Discriminant.lean
K : Type u_1
inst✝¹ : Field K
inst✝ : NumberField K
a : 𝓞 K
h_mem : (algebraMap (𝓞 K) K) a ∈ ↑1
h_nz : (algebraMap (𝓞 K) K) a ≠ 0
h_nm : ↑|(Algebra.norm ℚ) ((algebraMap (𝓞 K) K) a)| ≤ (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial / ↑(finrank ℚ K) ^ finrank ℚ K * √|↑(discr K)|
\u22a2 ↑|(Algebra.norm ℚ) ↑a| ≤ (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial / ↑(finrank ℚ K) ^ finrank ℚ K * √|↑(discr K)|
-- .lake/packages/batteries/Batteries/Data/RBMap/WF.lean
α : Type u_1
cmp : α → α → Ordering
v : α
t : RBNode α
\u22a2 (match t.isRed with | red => (ins cmp v t).setBlack | black => ins cmp v t).setBlack = (ins cmp v t).setBlack
-- Mathlib/Geometry/Euclidean/Angle/Unoriented/Basic.lean
V : Type u_1
inst✝¹ : NormedAddCommGroup V
inst✝ : InnerProductSpace ℝ V
x✝ y x : V
hx : x ≠ 0
\u22a2 arccos (⟪x, x⟫_ℝ / (‖x‖ * ‖x‖)) = 0
-- Mathlib/Data/Set/Finite.lean
α : Type u
β : Type v
ι : Sort w
γ : Type x
s : Set α
h : s.Finite
val✝ : Fintype ↑s
\u22a2 ∃ s', ∀ (a : α), a ∈ s' ↔ a ∈ s
-- Mathlib/Algebra/Lie/Submodule.lean
R : Type u
L : Type v
M : Type w
inst✝⁶ : CommRing R
inst✝⁵ : LieRing L
inst✝⁴ : LieAlgebra R L
inst✝³ : AddCommGroup M
inst✝² : Module R M
inst✝¹ : LieRingModule L M
inst✝ : LieModule R L M
N N' : LieSubmodule R L M
I J : LieIdeal R L
ι : Sort u_1
p : ι → LieSubmodule R L M
\u22a2 ↑(⨆ i, p i) = ⨆ i, ↑(p i)
-- Mathlib/Algebra/Lie/Submodule.lean
R : Type u
L : Type v
M : Type w
inst✝⁶ : CommRing R
inst✝⁵ : LieRing L
inst✝⁴ : LieAlgebra R L
inst✝³ : AddCommGroup M
inst✝² : Module R M
inst✝¹ : LieRingModule L M
inst✝ : LieModule R L M
N N' : LieSubmodule R L M
I J : LieIdeal R L
ι : Sort u_1
p : ι → LieSubmodule R L M
\u22a2 sSup {x | ∃ s ∈ range fun i => p i, ↑s = x} = ⨆ i, ↑(p i)
-- Mathlib/Algebra/Lie/Submodule.lean
R : Type u
L : Type v
M : Type w
inst✝⁶ : CommRing R
inst✝⁵ : LieRing L
inst✝⁴ : LieAlgebra R L
inst✝³ : AddCommGroup M
inst✝² : Module R M
inst✝¹ : LieRingModule L M
inst✝ : LieModule R L M
N N' : LieSubmodule R L M
I J : LieIdeal R L
ι : Sort u_1
p : ι → LieSubmodule R L M
x✝ : M
\u22a2 x✝ ∈ sSup {x | ∃ s ∈ range fun i => p i, ↑s = x} ↔ x✝ ∈ ⨆ i, ↑(p i)