ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/NumberTheory/LSeries/MellinEqDirichlet.lean
ι : Type u_1
inst✝ : Countable ι
a : ι → ℂ
p : ι → ℝ
F : ℝ → ℂ
s : ℂ
hp : ∀ (i : ι), 0 ≤ p i
hs : 0 < s.re
h_sum : Summable fun i => ‖a i‖ / p i ^ s.re
hs' : s ≠ 0
a' : ι → ℂ := fun i => if p i = 0 then 0 else a i
hp' : ∀ (i : ι), a' i = 0 ∨ 0 < p i
this : ∀ (i : ι) (t : ℝ), (if p i = 0 then 0 else a i * ↑(rexp (-π * p i * t))) = a' i * ↑(rexp (-π * p i * t))
hF : ∀ t ∈ Ioi 0, HasSum (fun i => a' i * ↑(rexp (-π * p i * t))) (F t)
i : ι

⊢ ↑π ^ (-s) * Complex.Gamma s * a i / ↑(p i) ^ s = ↑π ^ (-s) * Complex.Gamma s * a' i / ↑(p i) ^ s
-- Mathlib/NumberTheory/LSeries/MellinEqDirichlet.lean
ι : Type u_1
inst✝ : Countable ι
a : ι → ℂ
p : ι → ℝ
F : ℝ → ℂ
s : ℂ
hp : ∀ (i : ι), 0 ≤ p i
hs : 0 < s.re
h_sum : Summable fun i => ‖a i‖ / p i ^ s.re
hs' : s ≠ 0
a' : ι → ℂ := fun i => if p i = 0 then 0 else a i
hp' : ∀ (i : ι), a' i = 0 ∨ 0 < p i
this : ∀ (i : ι) (t : ℝ), (if p i = 0 then 0 else a i * ↑(rexp (-π * p i * t))) = a' i * ↑(rexp (-π * p i * t))
hF : ∀ t ∈ Ioi 0, HasSum (fun i => a' i * ↑(rexp (-π * p i * t))) (F t)

⊢ Summable fun i => ‖a' i‖ / p i ^ s.re
-- Mathlib/CategoryTheory/Limits/Shapes/ZeroMorphisms.lean
C : Type u
inst✝² : Category.{v, u} C
D : Type u'
inst✝¹ : Category.{v', u'} D
inst✝ : HasZeroMorphisms C
X : C
hX : IsInitial X

⊢ IsZero X
-- Mathlib/CategoryTheory/Limits/Shapes/ZeroMorphisms.lean
C : Type u
inst✝² : Category.{v, u} C
D : Type u'
inst✝¹ : Category.{v', u'} D
inst✝ : HasZeroMorphisms C
X : C
hX : IsInitial X

⊢ 𝟙 X = 0
-- Mathlib/CategoryTheory/GradedObject/Unitor.lean
C : Type u_1
D : Type u_2
I : Type u_3
J : Type u_4
inst✝⁷ : Category.{u_6, u_1} C
inst✝⁶ : Category.{u_5, u_2} D
inst✝⁵ : Zero I
inst✝⁴ : DecidableEq I
inst✝³ : HasInitial C
F : D ⥤ C ⥤ D
Y : C
e : F.flip.obj Y ≅ 𝟭 D
inst✝² : (X : D) → PreservesColimit (Functor.empty C) (F.obj X)
p : J × I → J
hp : ∀ (j : J), p (j, 0) = j
X X' : GradedObject J D
φ : X ⟶ X'
inst✝¹ : (((mapBifunctor F J I).obj X).obj ((single₀ I).obj Y)).HasMap p
inst✝ : (((mapBifunctor F J I).obj X').obj ((single₀ I).obj Y)).HasMap p
Y' : ?m.145927

⊢ mapBifunctorMapMap F p φ (𝟙 ((single₀ I).obj Y)) ≫ (mapBifunctorRightUnitor F Y e p hp X').hom = (mapBifunctorRightUnitor F Y e p hp X).hom ≫ φ
-- Mathlib/Data/Complex/Module.lean
A : Type u_1
inst✝³ : AddCommGroup A
inst✝² : Module ℂ A
inst✝¹ : StarAddMonoid A
inst✝ : StarModule ℂ A
z : ℂ

⊢ ↑(ℜ z) = ?m.419985
-- Mathlib/Data/Complex/Module.lean
A : Type u_1
inst✝³ : AddCommGroup A
inst✝² : Module ℂ A
inst✝¹ : StarAddMonoid A
inst✝ : StarModule ℂ A
z : ℂ

⊢ ↑(ℜ (↑z.re + ↑z.im * I)) = ↑z.re
-- Mathlib/Data/Complex/Module.lean
A : Type u_1
inst✝³ : AddCommGroup A
inst✝² : Module ℂ A
inst✝¹ : StarAddMonoid A
inst✝ : StarModule ℂ A
z : ℂ

⊢ ↑(ℜ ↑z.re) + ↑(-ℑ ↑z.im) = ↑z.re
-- Mathlib/Data/Finset/Pairwise.lean
α : Type u_1
ι : Type u_2
ι' : Type u_3
inst✝² : SemilatticeInf α
inst✝¹ : OrderBot α
s✝ : Finset ι
f✝ : ι → α
inst✝ : DecidableEq ι
s : Finset ι
f : ι → α
hs : (↑s).PairwiseDisjoint f
g : ι → ι
hf : ∀ (a : ι), f (g a) ≤ f a

⊢ (↑(Finset.image g s)).PairwiseDisjoint f
-- Mathlib/Data/Finset/Pairwise.lean
α : Type u_1
ι : Type u_2
ι' : Type u_3
inst✝² : SemilatticeInf α
inst✝¹ : OrderBot α
s✝ : Finset ι
f✝ : ι → α
inst✝ : DecidableEq ι
s : Finset ι
f : ι → α
hs : (↑s).PairwiseDisjoint f
g : ι → ι
hf : ∀ (a : ι), f (g a) ≤ f a

⊢ (g '' ↑s).PairwiseDisjoint f
-- Mathlib/RingTheory/UniqueFactorizationDomain.lean
α : Type u_1
inst✝¹ : CancelCommMonoidWithZero α
inst✝ : UniqueFactorizationMonoid α
a x : α
hx : x ∈ factors a

⊢ Prime x
-- Mathlib/RingTheory/UniqueFactorizationDomain.lean
α : Type u_1
inst✝¹ : CancelCommMonoidWithZero α
inst✝ : UniqueFactorizationMonoid α
a x : α
hx : x ∈ factors a
ane0 : a ≠ 0

⊢ Prime x
-- Mathlib/RingTheory/UniqueFactorizationDomain.lean
α : Type u_1
inst✝¹ : CancelCommMonoidWithZero α
inst✝ : UniqueFactorizationMonoid α
a x : α
ane0 : a ≠ 0
hx : x ∈ Classical.choose ⋯

⊢ Prime x
-- Mathlib/Algebra/CharP/Basic.lean
R : Type u_1
inst✝² : CommSemiring R
p : ℕ
inst✝¹ : Fact (Nat.Prime p)
inst✝ : CharP R p
n : ℕ
x y : R

⊢ (x + y) ^ n = (x + y) ^ (n % p) * (x ^ p + y ^ p) ^ (n / p)
-- Mathlib/Topology/MetricSpace/Pseudo/Lemmas.lean
ι : Type u_1
α : Type u_2
inst✝ : PseudoMetricSpace α
x : α
u : Set α
hu : u ∈ 𝓝 x

⊢ ∀ᶠ (r : ℝ) in 𝓝 0, closedBall x r ⊆ u
-- Mathlib/Topology/MetricSpace/Pseudo/Lemmas.lean
ι : Type u_1
α : Type u_2
inst✝ : PseudoMetricSpace α
x : α
u : Set α
hu : u ∈ 𝓝 x
ε : ℝ
εpos : 0 < ε
hε : closedBall x ε ⊆ u

⊢ ∀ᶠ (r : ℝ) in 𝓝 0, closedBall x r ⊆ u
-- Mathlib/Topology/MetricSpace/Pseudo/Lemmas.lean
ι : Type u_1
α : Type u_2
inst✝ : PseudoMetricSpace α
x : α
u : Set α
hu : u ∈ 𝓝 x
ε : ℝ
εpos : 0 < ε
hε : closedBall x ε ⊆ u
this : Iic ε ∈ 𝓝 0

⊢ ∀ᶠ (r : ℝ) in 𝓝 0, closedBall x r ⊆ u
-- Mathlib/GroupTheory/CoprodI.lean
ι : Type u_1
M : ι → Type u_2
inst✝² : (i : ι) → Monoid (M i)
N : Type u_3
inst✝¹ : Monoid N
inst✝ : (i : ι) → DecidableEq (M i)
i : ι
m : M i
w : Word M
h1 : m ≠ 1
h2 : w.fstIdx ≠ some i

⊢ (cons m w h2 h1).prod = of m * w.prod
-- Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean
x : ℝ≥0∞
z : ℝ

⊢ x.toNNReal ^ z = (x ^ z).toNNReal
-- Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean
x : ℝ≥0∞
z : ℝ
H : z < 0

⊢ x.toNNReal ^ z = (x ^ z).toNNReal
-- Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean
x : ℝ≥0∞
z : ℝ
H : z = 0

⊢ x.toNNReal ^ z = (x ^ z).toNNReal
-- Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean
x : ℝ≥0∞
z : ℝ
H : 0 < z

⊢ x.toNNReal ^ z = (x ^ z).toNNReal
-- Mathlib/LinearAlgebra/Matrix/NonsingularInverse.lean
l : Type u_1
m : Type u
n : Type u'
α : Type v
inst✝² : Fintype n
inst✝¹ : DecidableEq n
inst✝ : CommRing α
A B : Matrix n n α

⊢ A⁻¹ᵀ = Aᵀ⁻¹
-- Mathlib/RingTheory/PiTensorProduct.lean
ι : Type u_1
R' : Type u_2
R : Type u_3
A : ι → Type u_4
inst✝⁴ : CommSemiring R
inst✝³ : (i : ι) → NonAssocSemiring (A i)
inst✝² : (i : ι) → Module R (A i)
inst✝¹ : ∀ (i : ι), SMulCommClass R (A i) (A i)
inst✝ : ∀ (i : ι), IsScalarTower R (A i) (A i)
x : ⨂[R] (i : ι), A i

⊢ (mul ((tprod R) 1)) x = x
-- Mathlib/Order/Interval/Set/Basic.lean
α : Type u_1
β : Type u_2
inst✝¹ : Preorder α
inst✝ : OrderTop α
a : α

⊢ Icc a ⊤ = Ici a
-- Mathlib/Order/LiminfLimsup.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι : Type u_4
ι' : Type u_5
inst✝ : CompleteLattice α
f : Filter β

⊢ limsup (fun x => ⊥) f = ⊥
-- Mathlib/Order/LiminfLimsup.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι : Type u_4
ι' : Type u_5
inst✝ : CompleteLattice α
f : Filter β

⊢ sInf {a | ∀ᶠ (n : β) in f, ⊥ ≤ a} ≤ ⊥
-- Mathlib/Geometry/Euclidean/MongePoint.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P (n + 2)
i₁ i₂ : Fin (n + 3)
h : ¬i₁ = i₂

⊢ ⟪s.mongePoint -ᵥ centroid ℝ {i₁, i₂}ᶜ s.points, s.points i₁ -ᵥ s.points i₂⟫_ℝ = 0
-- Mathlib/Geometry/Euclidean/MongePoint.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P (n + 2)
i₁ i₂ : Fin (n + 3)
h : ¬i₁ = i₂

⊢ ⟪(univ.weightedVSub s.pointsWithCircumcenter) (mongePointVSubFaceCentroidWeightsWithCircumcenter i₁ i₂), (univ.weightedVSub s.pointsWithCircumcenter) (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂)⟫_ℝ = 0
-- Mathlib/Geometry/Euclidean/MongePoint.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P (n + 2)
i₁ i₂ : Fin (n + 3)
h : ¬i₁ = i₂
hs : ∑ i : PointsWithCircumcenterIndex (n + 2), (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) i = 0

⊢ ⟪(univ.weightedVSub s.pointsWithCircumcenter) (mongePointVSubFaceCentroidWeightsWithCircumcenter i₁ i₂), (univ.weightedVSub s.pointsWithCircumcenter) (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂)⟫_ℝ = 0
-- Mathlib/Geometry/Euclidean/MongePoint.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P (n + 2)
i₁ i₂ : Fin (n + 3)
h : ¬i₁ = i₂
hs : ∑ i : PointsWithCircumcenterIndex (n + 2), (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) i = 0

⊢ -(∑ i : Fin (n + 2 + 1), ∑ i₂_1 : PointsWithCircumcenterIndex (n + 2), mongePointVSubFaceCentroidWeightsWithCircumcenter i₁ i₂ (pointIndex i) * (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) i₂_1 * (dist (s.pointsWithCircumcenter (pointIndex i)) (s.pointsWithCircumcenter i₂_1) * dist (s.pointsWithCircumcenter (pointIndex i)) (s.pointsWithCircumcenter i₂_1)) + ∑ i₂_1 : PointsWithCircumcenterIndex (n + 2), mongePointVSubFaceCentroidWeightsWithCircumcenter i₁ i₂ circumcenterIndex * (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) i₂_1 * (dist s.circumcenter (s.pointsWithCircumcenter i₂_1) * dist s.circumcenter (s.pointsWithCircumcenter i₂_1))) / 2 = 0
-- Mathlib/Geometry/Euclidean/MongePoint.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P (n + 2)
i₁ i₂ : Fin (n + 3)
h : ¬i₁ = i₂
hs : ∑ i : PointsWithCircumcenterIndex (n + 2), (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) i = 0

⊢ -(∑ x : Fin (n + 2 + 1), ∑ x_1 : PointsWithCircumcenterIndex (n + 2), (if x = i₁ ∨ x = i₂ then (↑(n + 1))⁻¹ else 0) * (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) x_1 * (dist (s.points x) (s.pointsWithCircumcenter x_1) * dist (s.points x) (s.pointsWithCircumcenter x_1)) + ∑ x : PointsWithCircumcenterIndex (n + 2), -2 / ↑(n + 1) * (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) x * (dist s.circumcenter (s.pointsWithCircumcenter x) * dist s.circumcenter (s.pointsWithCircumcenter x))) / 2 = 0
-- Mathlib/Geometry/Euclidean/MongePoint.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P (n + 2)
i₁ i₂ : Fin (n + 3)
h : ¬i₁ = i₂
hs : ∑ i : PointsWithCircumcenterIndex (n + 2), (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) i = 0
fs : Finset (Fin (n + 3)) := {i₁, i₂}
hfs : ∀ i ∉ fs, i ≠ i₁ ∧ i ≠ i₂

⊢ -(∑ x : Fin (n + 2 + 1), ∑ x_1 : PointsWithCircumcenterIndex (n + 2), (if x = i₁ ∨ x = i₂ then (↑(n + 1))⁻¹ else 0) * (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) x_1 * (dist (s.points x) (s.pointsWithCircumcenter x_1) * dist (s.points x) (s.pointsWithCircumcenter x_1)) + ∑ x : PointsWithCircumcenterIndex (n + 2), -2 / ↑(n + 1) * (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) x * (dist s.circumcenter (s.pointsWithCircumcenter x) * dist s.circumcenter (s.pointsWithCircumcenter x))) / 2 = 0
-- Mathlib/Geometry/Euclidean/MongePoint.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P (n + 2)
i₁ i₂ : Fin (n + 3)
h : ¬i₁ = i₂
hs : ∑ i : PointsWithCircumcenterIndex (n + 2), (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) i = 0
fs : Finset (Fin (n + 3)) := {i₁, i₂}
hfs : ∀ i ∉ fs, i ≠ i₁ ∧ i ≠ i₂

⊢ -(∑ x ∈ fs, ∑ x_1 : PointsWithCircumcenterIndex (n + 2), (if x = i₁ ∨ x = i₂ then (↑(n + 1))⁻¹ else 0) * (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) x_1 * (dist (s.points x) (s.pointsWithCircumcenter x_1) * dist (s.points x) (s.pointsWithCircumcenter x_1)) + ∑ x : PointsWithCircumcenterIndex (n + 2), -2 / ↑(n + 1) * (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) x * (dist s.circumcenter (s.pointsWithCircumcenter x) * dist s.circumcenter (s.pointsWithCircumcenter x))) / 2 = 0
-- Mathlib/Geometry/Euclidean/MongePoint.lean
V : Type u_1
P : Type u_2
inst✝³ : NormedAddCommGroup V
inst✝² : InnerProductSpace ℝ V
inst✝¹ : MetricSpace P
inst✝ : NormedAddTorsor V P
n : ℕ
s : Simplex ℝ P (n + 2)
i₁ i₂ : Fin (n + 3)
h : ¬i₁ = i₂
hs : ∑ i : PointsWithCircumcenterIndex (n + 2), (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) i = 0
fs : Finset (Fin (n + 3)) := {i₁, i₂}
hfs : ∀ i ∉ fs, i ≠ i₁ ∧ i ≠ i₂

⊢ ∀ x ∈ univ, x ∉ fs → ∑ x_1 : PointsWithCircumcenterIndex (n + 2), (if x = i₁ ∨ x = i₂ then (↑(n + 1))⁻¹ else 0) * (pointWeightsWithCircumcenter i₁ - pointWeightsWithCircumcenter i₂) x_1 * (dist (s.points x) (s.pointsWithCircumcenter x_1) * dist (s.points x) (s.pointsWithCircumcenter x_1)) = 0
-- Mathlib/LinearAlgebra/Matrix/Transvection.lean
n : Type u_1
p : Type u_2
R : Type u₂
𝕜 : Type u_3
inst✝⁴ : Field 𝕜
inst✝³ : DecidableEq n
inst✝² : DecidableEq p
inst✝¹ : CommRing R
i j : n
inst✝ : Finite n
c : R

⊢ updateRow 1 i (1 i + c • 1 j) = transvection i j c
-- Mathlib/LinearAlgebra/Matrix/Transvection.lean
n : Type u_1
p : Type u_2
R : Type u₂
𝕜 : Type u_3
inst✝⁴ : Field 𝕜
inst✝³ : DecidableEq n
inst✝² : DecidableEq p
inst✝¹ : CommRing R
i j : n
inst✝ : Finite n
c : R
val✝ : Fintype n

⊢ updateRow 1 i (1 i + c • 1 j) = transvection i j c
-- Mathlib/Analysis/Convex/SpecificFunctions/Pow.lean

⊢ StrictConcaveOn ℝ (Ici 0) fun x => √x
-- Mathlib/Analysis/Convex/SpecificFunctions/Pow.lean

⊢ StrictConcaveOn ℝ (Ici 0) fun x => (fun x => x ^ (1 / 2)) x
-- 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✝⁵ : NormedField 𝕜
inst✝⁴ : NormedSpace 𝕜 E
G'' : Type u_7
G' : Type u_8
inst✝³ : NormedLatticeAddCommGroup G'
inst✝² : NormedSpace ℝ G'
inst✝¹ : NormedLatticeAddCommGroup G''
inst✝ : NormedSpace ℝ G''
T : Set α → G'' →L[ℝ] G'
h_zero : ∀ (s : Set α), MeasurableSet s → μ s = 0 → T s = 0
h_add : FinMeasAdditive μ T
hT_nonneg : ∀ (s : Set α), MeasurableSet s → μ s < ⊤ → ∀ (x : G''), 0 ≤ x → 0 ≤ (T s) x
f : ↥(simpleFunc G'' 1 μ)
hf : 0 ≤ f

⊢ 0 ≤ SimpleFunc.setToSimpleFunc T (toSimpleFunc f)
-- 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✝⁵ : NormedField 𝕜
inst✝⁴ : NormedSpace 𝕜 E
G'' : Type u_7
G' : Type u_8
inst✝³ : NormedLatticeAddCommGroup G'
inst✝² : NormedSpace ℝ G'
inst✝¹ : NormedLatticeAddCommGroup G''
inst✝ : NormedSpace ℝ G''
T : Set α → G'' →L[ℝ] G'
h_zero : ∀ (s : Set α), MeasurableSet s → μ s = 0 → T s = 0
h_add : FinMeasAdditive μ T
hT_nonneg : ∀ (s : Set α), MeasurableSet s → μ s < ⊤ → ∀ (x : G''), 0 ≤ x → 0 ≤ (T s) x
f : ↥(simpleFunc G'' 1 μ)
hf : 0 ≤ f
f' : α →ₛ G''
hf' : 0 ≤ f'
hff' : ↑(toSimpleFunc f) =ᶠ[ae μ] ↑f'

⊢ 0 ≤ SimpleFunc.setToSimpleFunc T (toSimpleFunc f)
-- 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✝⁵ : NormedField 𝕜
inst✝⁴ : NormedSpace 𝕜 E
G'' : Type u_7
G' : Type u_8
inst✝³ : NormedLatticeAddCommGroup G'
inst✝² : NormedSpace ℝ G'
inst✝¹ : NormedLatticeAddCommGroup G''
inst✝ : NormedSpace ℝ G''
T : Set α → G'' →L[ℝ] G'
h_zero : ∀ (s : Set α), MeasurableSet s → μ s = 0 → T s = 0
h_add : FinMeasAdditive μ T
hT_nonneg : ∀ (s : Set α), MeasurableSet s → μ s < ⊤ → ∀ (x : G''), 0 ≤ x → 0 ≤ (T s) x
f : ↥(simpleFunc G'' 1 μ)
hf : 0 ≤ f
f' : α →ₛ G''
hf' : 0 ≤ f'
hff' : ↑(toSimpleFunc f) =ᶠ[ae μ] ↑f'

⊢ 0 ≤ SimpleFunc.setToSimpleFunc T f'
-- Mathlib/Algebra/BigOperators/Finprod.lean
α : Type u_1
β : Type u_2
ι : Type u_3
G : Type u_4
M : Type u_5
N : Type u_6
inst✝¹ : CommMonoid M
inst✝ : CommMonoid N
f : α → M
s : Set α

⊢ ∏ᶠ (i : α) (_ : i ∈ s ∩ mulSupport f), f i = ∏ᶠ (i : α) (_ : i ∈ s), f i
-- Mathlib/Algebra/Homology/QuasiIso.lean
ι : Type u_1
C : Type u
inst✝¹² : Category.{v, u} C
inst✝¹¹ : HasZeroMorphisms C
c : ComplexShape ι
K✝ L✝ M K' L' : HomologicalComplex C c
C₁ : Type u_2
C₂ : Type u_3
inst✝¹⁰ : Category.{u_4, u_2} C₁
inst✝⁹ : Category.{u_5, u_3} C₂
inst✝⁸ : Preadditive C₁
inst✝⁷ : Preadditive C₂
K L : HomologicalComplex C₁ c
φ : K ⟶ L
F : C₁ ⥤ C₂
inst✝⁶ : F.Additive
inst✝⁵ : F.PreservesHomology
i : ι
inst✝⁴ : K.HasHomology i
inst✝³ : L.HasHomology i
inst✝² : ((F.mapHomologicalComplex c).obj K).HasHomology i
inst✝¹ : ((F.mapHomologicalComplex c).obj L).HasHomology i
inst✝ : F.ReflectsIsomorphisms

⊢ QuasiIsoAt ((F.mapHomologicalComplex c).map φ) i ↔ QuasiIsoAt φ i
-- Mathlib/Algebra/Homology/QuasiIso.lean
ι : Type u_1
C : Type u
inst✝¹² : Category.{v, u} C
inst✝¹¹ : HasZeroMorphisms C
c : ComplexShape ι
K✝ L✝ M K' L' : HomologicalComplex C c
C₁ : Type u_2
C₂ : Type u_3
inst✝¹⁰ : Category.{u_4, u_2} C₁
inst✝⁹ : Category.{u_5, u_3} C₂
inst✝⁸ : Preadditive C₁
inst✝⁷ : Preadditive C₂
K L : HomologicalComplex C₁ c
φ : K ⟶ L
F : C₁ ⥤ C₂
inst✝⁶ : F.Additive
inst✝⁵ : F.PreservesHomology
i : ι
inst✝⁴ : K.HasHomology i
inst✝³ : L.HasHomology i
inst✝² : ((F.mapHomologicalComplex c).obj K).HasHomology i
inst✝¹ : ((F.mapHomologicalComplex c).obj L).HasHomology i
inst✝ : F.ReflectsIsomorphisms

⊢ ShortComplex.QuasiIso ((shortComplexFunctor C₂ c i).map ((F.mapHomologicalComplex c).map φ)) ↔ ShortComplex.QuasiIso ((shortComplexFunctor C₁ c i).map φ)
-- Mathlib/CategoryTheory/Limits/HasLimits.lean
J : Type u₁
inst✝⁴ : Category.{v₁, u₁} J
K : Type u₂
inst✝³ : Category.{v₂, u₂} K
C : Type u
inst✝² : Category.{v, u} C
F✝ F : J ⥤ C
inst✝¹ : HasLimit F
G : K ⥤ C
inst✝ : HasLimit G
e : J ≌ K
w : e.functor ⋙ G ≅ F
j : J

⊢ (isoOfEquivalence e w).inv ≫ limit.π F j = limit.π G (e.functor.obj j) ≫ w.hom.app j
-- Mathlib/CategoryTheory/Limits/HasLimits.lean
J : Type u₁
inst✝⁴ : Category.{v₁, u₁} J
K : Type u₂
inst✝³ : Category.{v₂, u₂} K
C : Type u
inst✝² : Category.{v, u} C
F✝ F : J ⥤ C
inst✝¹ : HasLimit F
G : K ⥤ C
inst✝ : HasLimit G
e : J ≌ K
w : e.functor ⋙ G ≅ F
j : J

⊢ ((limit.isLimit F).conePointsIsoOfEquivalence (limit.isLimit G) e w).inv ≫ limit.π F j = limit.π G (e.functor.obj j) ≫ w.hom.app j
-- Mathlib/Logic/Relation.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ε : Type u_5
ζ : Type u_6
r : α → β → Prop
p : β → γ → Prop
q : γ → δ → Prop

⊢ (r ∘r p) ∘r q = r ∘r p ∘r q
-- Mathlib/Logic/Relation.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ε : Type u_5
ζ : Type u_6
r : α → β → Prop
p : β → γ → Prop
q : γ → δ → Prop
a : α
d : δ

⊢ ((r ∘r p) ∘r q) a d = (r ∘r p ∘r q) a d
-- Mathlib/CategoryTheory/Sites/DenseSubsite.lean
C : Type u_1
inst✝⁵ : Category.{u_6, u_1} C
D : Type u_2
inst✝⁴ : Category.{u_5, u_2} D
E : Type u_3
inst✝³ : Category.{?u.45377, u_3} E
J : GrothendieckTopology C
K : GrothendieckTopology D
L : GrothendieckTopology E
A : Type u_4
inst✝² : Category.{?u.45429, u_4} A
G : C ⥤ D
inst✝¹ : G.IsCoverDense K
inst✝ : G.IsLocallyFull K
ℱ : Dᵒᵖ ⥤ Type v
ℱ' : SheafOfTypes K
α : G.op ⋙ ℱ ⟶ G.op ⋙ ℱ'.val
X : D
x : ℱ.obj (op X)
Y : C
f : G.obj Y ⟶ X

⊢ pushforwardFamily α x f ⋯ = α.app (op Y) (ℱ.map f.op x)
-- Mathlib/CategoryTheory/Sites/DenseSubsite.lean
C : Type u_1
inst✝⁵ : Category.{u_6, u_1} C
D : Type u_2
inst✝⁴ : Category.{u_5, u_2} D
E : Type u_3
inst✝³ : Category.{?u.45377, u_3} E
J : GrothendieckTopology C
K : GrothendieckTopology D
L : GrothendieckTopology E
A : Type u_4
inst✝² : Category.{?u.45429, u_4} A
G : C ⥤ D
inst✝¹ : G.IsCoverDense K
inst✝ : G.IsLocallyFull K
ℱ : Dᵒᵖ ⥤ Type v
ℱ' : SheafOfTypes K
α : G.op ⋙ ℱ ⟶ G.op ⋙ ℱ'.val
X : D
x : ℱ.obj (op X)
Y : C
f : G.obj Y ⟶ X

⊢ ℱ'.val.map (Nonempty.some ⋯).lift.op (α.app (op (Nonempty.some ⋯).1) (ℱ.map (Nonempty.some ⋯).map.op x)) = α.app (op Y) (ℱ.map f.op x)
-- Mathlib/CategoryTheory/Sites/DenseSubsite.lean
C : Type u_1
inst✝⁵ : Category.{u_6, u_1} C
D : Type u_2
inst✝⁴ : Category.{u_5, u_2} D
E : Type u_3
inst✝³ : Category.{?u.45377, u_3} E
J : GrothendieckTopology C
K : GrothendieckTopology D
L : GrothendieckTopology E
A : Type u_4
inst✝² : Category.{?u.45429, u_4} A
G : C ⥤ D
inst✝¹ : G.IsCoverDense K
inst✝ : G.IsLocallyFull K
ℱ : Dᵒᵖ ⥤ Type v
ℱ' : SheafOfTypes K
α : G.op ⋙ ℱ ⟶ G.op ⋙ ℱ'.val
X : D
x : ℱ.obj (op X)
Y : C
f : G.obj Y ⟶ X
l : CoverByImageStructure G f

⊢ ℱ'.val.map l.lift.op (α.app (op l.1) (ℱ.map l.map.op x)) = α.app (op Y) (ℱ.map f.op x)
-- Mathlib/CategoryTheory/Sites/DenseSubsite.lean
C : Type u_1
inst✝⁵ : Category.{u_6, u_1} C
D : Type u_2
inst✝⁴ : Category.{u_5, u_2} D
E : Type u_3
inst✝³ : Category.{?u.45377, u_3} E
J : GrothendieckTopology C
K : GrothendieckTopology D
L : GrothendieckTopology E
A : Type u_4
inst✝² : Category.{?u.45429, u_4} A
G : C ⥤ D
inst✝¹ : G.IsCoverDense K
inst✝ : G.IsLocallyFull K
ℱ : Dᵒᵖ ⥤ Type v
ℱ' : SheafOfTypes K
α : G.op ⋙ ℱ ⟶ G.op ⋙ ℱ'.val
X : D
x : ℱ.obj (op X)
Y W : C
iYW : G.obj Y ⟶ G.obj W
iWX : G.obj W ⟶ X

⊢ ℱ'.val.map { obj := W, lift := iYW, map := iWX, fac := ⋯ }.lift.op (α.app (op { obj := W, lift := iYW, map := iWX, fac := ⋯ }.1) (ℱ.map { obj := W, lift := iYW, map := iWX, fac := ⋯ }.map.op x)) = α.app (op Y) (ℱ.map (iYW ≫ iWX).op x)
-- Mathlib/Data/Matroid/Closure.lean
ι : Type u_1
α : Type u_2
M✝ : Matroid α
F X✝ Y : Set α
e : α
M : Matroid α
X : Set α

⊢ X ∩ M.E ⊆ M.closure X
-- Mathlib/Data/Matroid/Closure.lean
ι : Type u_1
α : Type u_2
M✝ : Matroid α
F X✝ Y : Set α
e : α
M : Matroid α
X : Set α

⊢ ∀ t' ∈ {F | M.Flat F ∧ X ∩ M.E ⊆ F}, X ∩ M.E ⊆ t'
-- Mathlib/Topology/UniformSpace/Compact.lean
α : Type u_1
β : Type u_2
γ : Type u_3
inst✝² : UniformSpace α
inst✝¹ : UniformSpace β
t : TopologicalSpace γ
inst✝ : CompactSpace γ
u u' : UniformSpace γ
h : toTopologicalSpace = t
h' : toTopologicalSpace = t

⊢ u = u'
-- Mathlib/Topology/UniformSpace/Compact.lean
α : Type u_1
β : Type u_2
γ : Type u_3
inst✝² : UniformSpace α
inst✝¹ : UniformSpace β
t : TopologicalSpace γ
inst✝ : CompactSpace γ
u u' : UniformSpace γ
h : toTopologicalSpace = t
h' : toTopologicalSpace = t

⊢ 𝓤 γ = 𝓤 γ
-- Mathlib/Topology/UniformSpace/Compact.lean
α : Type u_1
β : Type u_2
γ : Type u_3
inst✝² : UniformSpace α
inst✝¹ : UniformSpace β
t : TopologicalSpace γ
inst✝ : CompactSpace γ
u u' : UniformSpace γ
h : toTopologicalSpace = t
h' : toTopologicalSpace = t
this✝ : CompactSpace γ
this : CompactSpace γ

⊢ 𝓤 γ = 𝓤 γ
-- Mathlib/LinearAlgebra/PiTensorProduct.lean
ι : Type u_1
ι₂ : Type u_2
ι₃ : Type u_3
R : Type u_4
inst✝¹⁰ : CommSemiring R
R₁ : Type u_5
R₂ : Type u_6
s : ι → Type u_7
inst✝⁹ : (i : ι) → AddCommMonoid (s i)
inst✝⁸ : (i : ι) → Module R (s i)
M : Type u_8
inst✝⁷ : AddCommMonoid M
inst✝⁶ : Module R M
E : Type u_9
inst✝⁵ : AddCommMonoid E
inst✝⁴ : Module R E
F : Type u_10
inst✝³ : AddCommMonoid F
t : ι → Type u_11
inst✝² : (i : ι) → AddCommMonoid (t i)
inst✝¹ : (i : ι) → Module R (t i)
inst✝ : Subsingleton ι
i₀ : ι
x : ⨂[R] (x : ι), M

⊢ ((tprod R) fun x_1 => (lift ((ofSubsingleton R M M i₀) LinearMap.id)) x) = x
-- Mathlib/LinearAlgebra/PiTensorProduct.lean
ι : Type u_1
ι₂ : Type u_2
ι₃ : Type u_3
R : Type u_4
inst✝¹⁰ : CommSemiring R
R₁ : Type u_5
R₂ : Type u_6
s : ι → Type u_7
inst✝⁹ : (i : ι) → AddCommMonoid (s i)
inst✝⁸ : (i : ι) → Module R (s i)
M : Type u_8
inst✝⁷ : AddCommMonoid M
inst✝⁶ : Module R M
E : Type u_9
inst✝⁵ : AddCommMonoid E
inst✝⁴ : Module R E
F : Type u_10
inst✝³ : AddCommMonoid F
t : ι → Type u_11
inst✝² : (i : ι) → AddCommMonoid (t i)
inst✝¹ : (i : ι) → Module R (t i)
inst✝ : Subsingleton ι
i₀ : ι
x : ⨂[R] (x : ι), M
this : ∀ (f : ι → M) (z : M), (fun x => z) = update f i₀ z

⊢ ((tprod R) fun x_1 => (lift ((ofSubsingleton R M M i₀) LinearMap.id)) x) = x