ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/Probability/Process/Stopping.lean
Ω : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace Ω
inst✝¹ : Preorder ι
𝒢 : Filtration ι m
τ η : Ω → ι
i j : ι
s : Set Ω
inst✝ : DecidablePred fun x => x ∈ s
hτ_st : IsStoppingTime 𝒢 τ
hη_st : IsStoppingTime 𝒢 η
hτ : ∀ (ω : Ω), i ≤ τ ω
hη : ∀ (ω : Ω), i ≤ η ω
hs : MeasurableSet s
n : ι
\u22a2 MeasurableSet {ω | s.piecewise τ η ω ≤ n}
-- Mathlib/Probability/Process/Stopping.lean
Ω : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace Ω
inst✝¹ : Preorder ι
𝒢 : Filtration ι m
τ η : Ω → ι
i j : ι
s : Set Ω
inst✝ : DecidablePred fun x => x ∈ s
hτ_st : IsStoppingTime 𝒢 τ
hη_st : IsStoppingTime 𝒢 η
hτ : ∀ (ω : Ω), i ≤ τ ω
hη : ∀ (ω : Ω), i ≤ η ω
hs : MeasurableSet s
n : ι
this : {ω | s.piecewise τ η ω ≤ n} = s ∩ {ω | τ ω ≤ n} ∪ sᶜ ∩ {ω | η ω ≤ n}
\u22a2 MeasurableSet {ω | s.piecewise τ η ω ≤ n}
-- Mathlib/CategoryTheory/Comma/Arrow.lean
T : Type u
inst✝¹ : Category.{v, u} T
f g : Arrow T
sq : f ⟶ g
inst✝ : IsIso sq
\u22a2 sq.left ≫ (inv sq).left = 𝟙 f.left
-- Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean
K : Type v
V : Type w
inst✝³ : Field K
inst✝² : AddCommGroup V
inst✝¹ : Module K V
inst✝ : FiniteDimensional K V
f : End K V
μ : K
\u22a2 Set.Finite f.HasEigenvalue
-- Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean
K : Type v
V : Type w
inst✝³ : Field K
inst✝² : AddCommGroup V
inst✝¹ : Module K V
inst✝ : FiniteDimensional K V
f : End K V
μ : K
h : minpoly K f ≠ 0
\u22a2 Set.Finite f.HasEigenvalue
-- Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean
K : Type v
V : Type w
inst✝³ : Field K
inst✝² : AddCommGroup V
inst✝¹ : Module K V
inst✝ : FiniteDimensional K V
f : End K V
μ : K
h : minpoly K f ≠ 0
\u22a2 f.HasEigenvalue = (minpoly K f).rootSet K
-- Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean
K : Type v
V : Type w
inst✝³ : Field K
inst✝² : AddCommGroup V
inst✝¹ : Module K V
inst✝ : FiniteDimensional K V
f : End K V
μ✝ : K
h : minpoly K f ≠ 0
μ : K
\u22a2 f.HasEigenvalue μ ↔ μ ∈ (minpoly K f).rootSet K
-- Mathlib/Combinatorics/SimpleGraph/Turan.lean
V : Type u_1
inst✝² : Fintype V
inst✝¹ : DecidableEq V
G : SimpleGraph V
inst✝ : DecidableRel G.Adj
n r : ℕ
H : SimpleGraph V
hG : G.IsTuranMaximal r
hH : H.CliqueFree (r + 1)
\u22a2 G ≤ H ↔ G = H
-- Mathlib/Data/DFinsupp/Basic.lean
ι : Type u
γ : Type w
β : ι → Type v
β₁ : ι → Type v₁
β₂ : ι → Type v₂
inst✝⁴ : DecidableEq ι
inst✝³ : Fintype ι
inst✝² : (i : ι) → Zero (β i)
inst✝¹ : (i : ι) → (x : β i) → Decidable (x ≠ 0)
inst✝ : CommMonoid γ
v : Π₀ (i : ι), β i
f : (i : ι) → β i → γ
hf : ∀ (i : ι), f i 0 = 1
\u22a2 ∏ i ∈ v.support, f i (v i) = ∏ i : ι, f i (v i)
-- Mathlib/Data/DFinsupp/Basic.lean
ι : Type u
γ : Type w
β : ι → Type v
β₁ : ι → Type v₁
β₂ : ι → Type v₂
inst✝⁴ : DecidableEq ι
inst✝³ : Fintype ι
inst✝² : (i : ι) → Zero (β i)
inst✝¹ : (i : ι) → (x : β i) → Decidable (x ≠ 0)
inst✝ : CommMonoid γ
v : Π₀ (i : ι), β i
f : (i : ι) → β i → γ
hf : ∀ (i : ι), f i 0 = 1
\u22a2 ∀ x ∈ Finset.univ, x ∉ v.support → f x (v x) = 1
-- Mathlib/Data/DFinsupp/Basic.lean
ι : Type u
γ : Type w
β : ι → Type v
β₁ : ι → Type v₁
β₂ : ι → Type v₂
inst✝⁴ : DecidableEq ι
inst✝³ : Fintype ι
inst✝² : (i : ι) → Zero (β i)
inst✝¹ : (i : ι) → (x : β i) → Decidable (x ≠ 0)
inst✝ : CommMonoid γ
v : Π₀ (i : ι), β i
f : (i : ι) → β i → γ
hf : ∀ (i : ι), f i 0 = 1
i : ι
a✝ : i ∈ Finset.univ
hi : i ∉ v.support
\u22a2 f i (v i) = 1
-- Mathlib/Data/DFinsupp/Basic.lean
ι : Type u
γ : Type w
β : ι → Type v
β₁ : ι → Type v₁
β₂ : ι → Type v₂
inst✝⁴ : DecidableEq ι
inst✝³ : Fintype ι
inst✝² : (i : ι) → Zero (β i)
inst✝¹ : (i : ι) → (x : β i) → Decidable (x ≠ 0)
inst✝ : CommMonoid γ
v : Π₀ (i : ι), β i
f : (i : ι) → β i → γ
hf : ∀ (i : ι), f i 0 = 1
i : ι
a✝ : i ∈ Finset.univ
hi : v i = 0
\u22a2 f i (v i) = 1
-- Mathlib/RingTheory/Norm/Basic.lean
R : Type u_1
S : Type u_2
T : Type u_3
inst✝⁸ : CommRing R
inst✝⁷ : Ring S
inst✝⁶ : Algebra R S
K : Type u_4
L : Type u_5
F : Type u_6
inst✝⁵ : Field K
inst✝⁴ : Field L
inst✝³ : Field F
inst✝² : Algebra K L
inst✝¹ : Algebra K F
ι : Type w
inst✝ : Algebra R F
pb : PowerBasis R S
hf : Splits (algebraMap R F) (minpoly R pb.gen)
\u22a2 (algebraMap R F) ((norm R) pb.gen) = ((minpoly R pb.gen).aroots F).prod
-- Mathlib/RingTheory/Norm/Basic.lean
R : Type u_1
S : Type u_2
T : Type u_3
inst✝⁸ : CommRing R
inst✝⁷ : Ring S
inst✝⁶ : Algebra R S
K : Type u_4
L : Type u_5
F : Type u_6
inst✝⁵ : Field K
inst✝⁴ : Field L
inst✝³ : Field F
inst✝² : Algebra K L
inst✝¹ : Algebra K F
ι : Type w
inst✝ : Algebra R F
pb : PowerBasis R S
hf : Splits (algebraMap R F) (minpoly R pb.gen)
this : Nontrivial R
\u22a2 (algebraMap R F) ((norm R) pb.gen) = ((minpoly R pb.gen).aroots F).prod
-- Mathlib/RingTheory/Norm/Basic.lean
R : Type u_1
S : Type u_2
T : Type u_3
inst✝⁸ : CommRing R
inst✝⁷ : Ring S
inst✝⁶ : Algebra R S
K : Type u_4
L : Type u_5
F : Type u_6
inst✝⁵ : Field K
inst✝⁴ : Field L
inst✝³ : Field F
inst✝² : Algebra K L
inst✝¹ : Algebra K F
ι : Type w
inst✝ : Algebra R F
pb : PowerBasis R S
hf : Splits (algebraMap R F) (minpoly R pb.gen)
this✝ : Nontrivial R
this : (minpoly R pb.gen).Monic
\u22a2 (algebraMap R F) ((norm R) pb.gen) = ((minpoly R pb.gen).aroots F).prod
-- Mathlib/RingTheory/Norm/Basic.lean
R : Type u_1
S : Type u_2
T : Type u_3
inst✝⁸ : CommRing R
inst✝⁷ : Ring S
inst✝⁶ : Algebra R S
K : Type u_4
L : Type u_5
F : Type u_6
inst✝⁵ : Field K
inst✝⁴ : Field L
inst✝³ : Field F
inst✝² : Algebra K L
inst✝¹ : Algebra K F
ι : Type w
inst✝ : Algebra R F
pb : PowerBasis R S
hf : Splits (algebraMap R F) (minpoly R pb.gen)
this✝ : Nontrivial R
this : (minpoly R pb.gen).Monic
\u22a2 ((algebraMap R F) (-1) * -1) ^ (minpoly R pb.gen).natDegree * (Polynomial.map (algebraMap R F) (minpoly R pb.gen)).roots.prod = ((minpoly R pb.gen).aroots F).prod
-- Mathlib/Order/Interval/Finset/Nat.lean
a✝ b c a : ℕ
h : 0 < a
\u22a2 Ico (a - 1) a = {a - 1}
-- Mathlib/AlgebraicGeometry/Scheme.lean
X : Scheme
U V : X.Opens
i : U = V
\u22a2 X.presheaf.map (eqToHom i).op = eqToHom ⋯
-- Mathlib/SetTheory/Cardinal/ENat.lean
m : ℕ∞
n : ℕ
\u22a2 ↑m = ↑n ↔ m = ↑n
-- Mathlib/Topology/Category/Profinite/Nobeling.lean
I : Type u
inst✝¹ : LinearOrder I
inst✝ : IsWellOrder I fun x x_1 => x < x_1
C : Set (I → Bool)
s : Finset I
x y : ↑(π C fun x => x ∈ s)
h : y ≠ x
\u22a2 (List.map (⇑(LocallyConstant.evalMonoidHom y)) (factors C s x)).prod = 0
-- Mathlib/Topology/Category/Profinite/Nobeling.lean
I : Type u
inst✝¹ : LinearOrder I
inst✝ : IsWellOrder I fun x x_1 => x < x_1
C : Set (I → Bool)
s : Finset I
x y : ↑(π C fun x => x ∈ s)
h : y ≠ x
\u22a2 0 ∈ List.map (⇑(LocallyConstant.evalMonoidHom y)) (factors C s x)
-- Mathlib/Topology/Category/Profinite/Nobeling.lean
I : Type u
inst✝¹ : LinearOrder I
inst✝ : IsWellOrder I fun x x_1 => x < x_1
C : Set (I → Bool)
s : Finset I
x y : ↑(π C fun x => x ∈ s)
h : y ≠ x
\u22a2 ∃ a ∈ factors C s x, (LocallyConstant.evalMonoidHom y) a = 0
-- Mathlib/Topology/Category/Profinite/Nobeling.lean
I : Type u
inst✝¹ : LinearOrder I
inst✝ : IsWellOrder I fun x x_1 => x < x_1
C : Set (I → Bool)
s : Finset I
x y : ↑(π C fun x => x ∈ s)
h : y ≠ x
a : I
ha : ↑y a ≠ ↑x a
\u22a2 ∃ a ∈ factors C s x, (LocallyConstant.evalMonoidHom y) a = 0
-- Mathlib/MeasureTheory/Integral/Bochner.lean
α : Type u_1
E : Type u_2
F : Type u_3
𝕜 : Type u_4
inst✝⁹ : NormedAddCommGroup E
inst✝⁸ : NormedSpace ℝ E
hE : CompleteSpace E
inst✝⁷ : NontriviallyNormedField 𝕜
inst✝⁶ : NormedSpace 𝕜 E
inst✝⁵ : SMulCommClass ℝ 𝕜 E
inst✝⁴ : NormedAddCommGroup F
inst✝³ : NormedSpace ℝ F
inst✝² : CompleteSpace F
G : Type u_5
inst✝¹ : NormedAddCommGroup G
inst✝ : NormedSpace ℝ G
f✝ g : α → E
m : MeasurableSpace α
μ : Measure α
ι : Type u_6
f : α → G
hf : HasFiniteIntegral f μ
l : Filter ι
s : ι → Set α
hs : Tendsto (⇑μ ∘ s) l (𝓝 0)
\u22a2 Tendsto (fun i => ∫ (x : α) in s i, f x ∂μ) l (𝓝 0)
-- Mathlib/MeasureTheory/Integral/Bochner.lean
α : Type u_1
E : Type u_2
F : Type u_3
𝕜 : Type u_4
inst✝⁹ : NormedAddCommGroup E
inst✝⁸ : NormedSpace ℝ E
hE : CompleteSpace E
inst✝⁷ : NontriviallyNormedField 𝕜
inst✝⁶ : NormedSpace 𝕜 E
inst✝⁵ : SMulCommClass ℝ 𝕜 E
inst✝⁴ : NormedAddCommGroup F
inst✝³ : NormedSpace ℝ F
inst✝² : CompleteSpace F
G : Type u_5
inst✝¹ : NormedAddCommGroup G
inst✝ : NormedSpace ℝ G
f✝ g : α → E
m : MeasurableSpace α
μ : Measure α
ι : Type u_6
f : α → G
hf : HasFiniteIntegral f μ
l : Filter ι
s : ι → Set α
hs : Tendsto (⇑μ ∘ s) l (𝓝 0)
\u22a2 Tendsto (fun x => ‖∫ (x : α) in s x, f x ∂μ‖) l (𝓝 0)
-- Mathlib/MeasureTheory/Integral/Bochner.lean
α : Type u_1
E : Type u_2
F : Type u_3
𝕜 : Type u_4
inst✝⁹ : NormedAddCommGroup E
inst✝⁸ : NormedSpace ℝ E
hE : CompleteSpace E
inst✝⁷ : NontriviallyNormedField 𝕜
inst✝⁶ : NormedSpace 𝕜 E
inst✝⁵ : SMulCommClass ℝ 𝕜 E
inst✝⁴ : NormedAddCommGroup F
inst✝³ : NormedSpace ℝ F
inst✝² : CompleteSpace F
G : Type u_5
inst✝¹ : NormedAddCommGroup G
inst✝ : NormedSpace ℝ G
f✝ g : α → E
m : MeasurableSpace α
μ : Measure α
ι : Type u_6
f : α → G
hf : HasFiniteIntegral f μ
l : Filter ι
s : ι → Set α
hs : Tendsto (⇑μ ∘ s) l (𝓝 0)
\u22a2 Tendsto (fun a => ↑‖∫ (x : α) in s a, f x ∂μ‖₊) l (𝓝 0)
-- Mathlib/Combinatorics/SetFamily/AhlswedeZhang.lean
α : Type u_1
β : Type u_2
inst✝⁶ : SemilatticeInf α
inst✝⁵ : BoundedOrder α
inst✝⁴ : DecidableRel fun x x_1 => x ≤ x_1
inst✝³ : SemilatticeInf β
inst✝² : BoundedOrder β
inst✝¹ : DecidableRel fun x x_1 => x ≤ x_1
s t : Finset α
a : α
inst✝ : DecidableEq α
hs : a ∉ upperClosure ↑s
ht : a ∈ upperClosure ↑t
\u22a2 (s ∪ t).truncatedInf a = t.truncatedInf a
-- Mathlib/Order/Bounds/Basic.lean
α : Type u
β : Type v
γ : Type w
ι : Sort x
inst✝¹ : Preorder α
inst✝ : Preorder β
s t : Set α
a b : α
\u22a2 upperBounds ∅ = univ
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
n : ℕ
ihn : 0 ≤ ∏ k ∈ Finset.range (n + n), (m - ↑k)
\u22a2 0 ≤ ∏ k ∈ Finset.range (n + 1 + (n + 1)), (m - ↑k)
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
n : ℕ
ihn : 0 ≤ ∏ k ∈ Finset.range (2 * n), (m - ↑k)
\u22a2 0 ≤ ∏ k ∈ Finset.range (n + 1 + (n + 1)), (m - ↑k)
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
n : ℕ
ihn : 0 ≤ ∏ k ∈ Finset.range (2 * n), (m - ↑k)
\u22a2 0 ≤ (∏ x ∈ Finset.range ((1 + 1) * n), (m - ↑x)) * ((m - ↑((1 + 1) * n)) * (m - ↑((1 + 1) * n + 1)))
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
n : ℕ
ihn : 0 ≤ ∏ k ∈ Finset.range (2 * n), (m - ↑k)
k : ℕ
\u22a2 0 ≤ (m - ↑k) * (m - ↑(k + 1))
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
n : ℕ
ihn : 0 ≤ ∏ k ∈ Finset.range (2 * n), (m - ↑k)
k : ℕ
hmk : m ≤ ↑k
\u22a2 0 ≤ (m - ↑k) * (m - ↑(k + 1))
-- Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean
m : ℤ
n : ℕ
ihn : 0 ≤ ∏ k ∈ Finset.range (2 * n), (m - ↑k)
k : ℕ
hmk : ↑k < m
\u22a2 0 ≤ (m - ↑k) * (m - ↑(k + 1))
-- Mathlib/Data/Finset/Lattice.lean
F : Type u_1
α✝ : Type u_2
β✝ : Type u_3
γ : Type u_4
ι : Type u_5
κ : Type u_6
α : Type u_7
β : Type u_8
inst✝ : DecidableEq β
s : Finset α
t : α → Finset β
a✝ : β
\u22a2 a✝ ∈ s.sup t ↔ a✝ ∈ s.biUnion t
-- Mathlib/Order/Iterate.lean
α : Type u_1
inst✝ : Preorder α
f : α → α
h : id ≤ f
n : ℕ
x : α
\u22a2 f^[n] x ≤ f^[n + 1] x
-- Mathlib/Order/Iterate.lean
α : Type u_1
inst✝ : Preorder α
f : α → α
h : id ≤ f
n : ℕ
x : α
\u22a2 f^[n] x ≤ f (f^[n] x)
-- 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 α
hs : s.Finite
\u22a2 s ∩ mulSupport f = ↑hs.toFinset ∩ mulSupport f
-- Mathlib/Algebra/DirectLimit.lean
R : Type u
inst✝⁷ : Ring R
ι : Type v
inst✝⁶ : Preorder ι
G : ι → Type w
inst✝⁵ : DecidableEq ι
inst✝⁴ : (i : ι) → AddCommGroup (G i)
f : (i j : ι) → i ≤ j → G i →+ G j
P : Type u₁
inst✝³ : AddCommGroup P
g✝ : (i : ι) → G i →+ P
Hg : ∀ (i j : ι) (hij : i ≤ j) (x : G i), (g✝ j) ((f i j hij) x) = (g✝ i) x
G' : ι → Type v'
inst✝² : (i : ι) → AddCommGroup (G' i)
f' : (i j : ι) → i ≤ j → G' i →+ G' j
G'' : ι → Type v''
inst✝¹ : (i : ι) → AddCommGroup (G'' i)
f'' : (i j : ι) → i ≤ j → G'' i →+ G'' j
inst✝ : IsDirected ι fun x x_1 => x ≤ x_1
e : (i : ι) → G i ≃+ G' i
he : ∀ (i j : ι) (h : i ≤ j), (e j).toAddMonoidHom.comp (f i j h) = (f' i j h).comp ↑(e i)
i : ι
g : G' i
\u22a2 (congr e he).symm ((of G' f' i) g) = (of G f i) ((e i).symm g)
-- Mathlib/CategoryTheory/Limits/Final.lean
C : Type u₁
inst✝² : Category.{v₁, u₁} C
D : Type u₂
inst✝¹ : Category.{v₂, u₂} D
E : Type u₃
inst✝ : Category.{v₃, u₃} E
F : C ⥤ D
G : D ⥤ E
hF : F.Final
hFG : (F ⋙ G).Final
s₁ : C ≌ AsSmall C := AsSmall.equiv
s₂ : D ≌ AsSmall D := AsSmall.equiv
s₃ : E ≌ AsSmall E := AsSmall.equiv
_i : s₁.inverse ⋙ (F ⋙ G) ⋙ s₃.functor ≅ (s₁.inverse ⋙ F ⋙ s₂.functor) ⋙ s₂.inverse ⋙ G ⋙ s₃.functor := isoWhiskerLeft (s₁.inverse ⋙ F) (isoWhiskerRight s₂.unitIso (G ⋙ s₃.functor))
\u22a2 G.Final
-- Mathlib/CategoryTheory/Limits/Final.lean
C : Type u₁
inst✝² : Category.{v₁, u₁} C
D : Type u₂
inst✝¹ : Category.{v₂, u₂} D
E : Type u₃
inst✝ : Category.{v₃, u₃} E
F : C ⥤ D
G : D ⥤ E
hF : F.Final
hFG : (F ⋙ G).Final
s₁ : C ≌ AsSmall C := AsSmall.equiv
s₂ : D ≌ AsSmall D := AsSmall.equiv
s₃ : E ≌ AsSmall E := AsSmall.equiv
_i : s₁.inverse ⋙ (F ⋙ G) ⋙ s₃.functor ≅ (s₁.inverse ⋙ F ⋙ s₂.functor) ⋙ s₂.inverse ⋙ G ⋙ s₃.functor := isoWhiskerLeft (s₁.inverse ⋙ F) (isoWhiskerRight s₂.unitIso (G ⋙ s₃.functor))
\u22a2 ∀ (G_1 : AsSmall E ⥤ Type (max (max (max (max (max u₁ u₂) u₃) v₁) v₂) v₃)), IsIso (colimit.pre G_1 (s₂.inverse ⋙ G ⋙ s₃.functor))
-- Mathlib/CategoryTheory/Limits/Final.lean
C : Type u₁
inst✝² : Category.{v₁, u₁} C
D : Type u₂
inst✝¹ : Category.{v₂, u₂} D
E : Type u₃
inst✝ : Category.{v₃, u₃} E
F : C ⥤ D
G : D ⥤ E
hFG : (F ⋙ G).Final
s₁ : C ≌ AsSmall C := AsSmall.equiv
s₂ : D ≌ AsSmall D := AsSmall.equiv
hF : ∀ (G : AsSmall D ⥤ Type (max (max (max (max (max u₁ u₂) u₃) v₁) v₂) v₃)), IsIso (colimit.pre G (s₁.inverse ⋙ F ⋙ s₂.functor))
s₃ : E ≌ AsSmall E := AsSmall.equiv
_i : s₁.inverse ⋙ (F ⋙ G) ⋙ s₃.functor ≅ (s₁.inverse ⋙ F ⋙ s₂.functor) ⋙ s₂.inverse ⋙ G ⋙ s₃.functor := isoWhiskerLeft (s₁.inverse ⋙ F) (isoWhiskerRight s₂.unitIso (G ⋙ s₃.functor))
\u22a2 ∀ (G_1 : AsSmall E ⥤ Type (max (max (max (max (max u₁ u₂) u₃) v₁) v₂) v₃)), IsIso (colimit.pre G_1 (s₂.inverse ⋙ G ⋙ s₃.functor))
-- Mathlib/CategoryTheory/Limits/Final.lean
C : Type u₁
inst✝² : Category.{v₁, u₁} C
D : Type u₂
inst✝¹ : Category.{v₂, u₂} D
E : Type u₃
inst✝ : Category.{v₃, u₃} E
F : C ⥤ D
G : D ⥤ E
s₁ : C ≌ AsSmall C := AsSmall.equiv
s₂ : D ≌ AsSmall D := AsSmall.equiv
hF : ∀ (G : AsSmall D ⥤ Type (max (max (max (max (max u₁ u₂) u₃) v₁) v₂) v₃)), IsIso (colimit.pre G (s₁.inverse ⋙ F ⋙ s₂.functor))
s₃ : E ≌ AsSmall E := AsSmall.equiv
hFG : ∀ (G_1 : AsSmall E ⥤ Type (max (max (max (max (max u₁ u₂) u₃) v₁) v₂) v₃)), IsIso (colimit.pre G_1 ((s₁.inverse ⋙ F ⋙ s₂.functor) ⋙ s₂.inverse ⋙ G ⋙ s₃.functor))
_i : s₁.inverse ⋙ (F ⋙ G) ⋙ s₃.functor ≅ (s₁.inverse ⋙ F ⋙ s₂.functor) ⋙ s₂.inverse ⋙ G ⋙ s₃.functor := isoWhiskerLeft (s₁.inverse ⋙ F) (isoWhiskerRight s₂.unitIso (G ⋙ s₃.functor))
\u22a2 ∀ (G_1 : AsSmall E ⥤ Type (max (max (max (max (max u₁ u₂) u₃) v₁) v₂) v₃)), IsIso (colimit.pre G_1 (s₂.inverse ⋙ G ⋙ s₃.functor))
-- Mathlib/CategoryTheory/Limits/Final.lean
C : Type u₁
inst✝² : Category.{v₁, u₁} C
D : Type u₂
inst✝¹ : Category.{v₂, u₂} D
E : Type u₃
inst✝ : Category.{v₃, u₃} E
F : C ⥤ D
G : D ⥤ E
s₁ : C ≌ AsSmall C := AsSmall.equiv
s₂ : D ≌ AsSmall D := AsSmall.equiv
hF : ∀ (G : AsSmall D ⥤ Type (max (max (max (max (max u₁ u₂) u₃) v₁) v₂) v₃)), IsIso (colimit.pre G (s₁.inverse ⋙ F ⋙ s₂.functor))
s₃ : E ≌ AsSmall E := AsSmall.equiv
_i : s₁.inverse ⋙ (F ⋙ G) ⋙ s₃.functor ≅ (s₁.inverse ⋙ F ⋙ s₂.functor) ⋙ s₂.inverse ⋙ G ⋙ s₃.functor := isoWhiskerLeft (s₁.inverse ⋙ F) (isoWhiskerRight s₂.unitIso (G ⋙ s₃.functor))
H : AsSmall E ⥤ Type (max (max (max (max (max u₁ u₂) u₃) v₁) v₂) v₃)
hFG : IsIso (colimit.pre H ((s₁.inverse ⋙ F ⋙ s₂.functor) ⋙ s₂.inverse ⋙ G ⋙ s₃.functor))
\u22a2 IsIso (colimit.pre H (s₂.inverse ⋙ G ⋙ s₃.functor))
-- Mathlib/CategoryTheory/Limits/Final.lean
C : Type u₁
inst✝² : Category.{v₁, u₁} C
D : Type u₂
inst✝¹ : Category.{v₂, u₂} D
E : Type u₃
inst✝ : Category.{v₃, u₃} E
F : C ⥤ D
G : D ⥤ E
s₁ : C ≌ AsSmall C := AsSmall.equiv
s₂ : D ≌ AsSmall D := AsSmall.equiv
hF : ∀ (G : AsSmall D ⥤ Type (max (max (max (max (max u₁ u₂) u₃) v₁) v₂) v₃)), IsIso (colimit.pre G (s₁.inverse ⋙ F ⋙ s₂.functor))
s₃ : E ≌ AsSmall E := AsSmall.equiv
_i : s₁.inverse ⋙ (F ⋙ G) ⋙ s₃.functor ≅ (s₁.inverse ⋙ F ⋙ s₂.functor) ⋙ s₂.inverse ⋙ G ⋙ s₃.functor := isoWhiskerLeft (s₁.inverse ⋙ F) (isoWhiskerRight s₂.unitIso (G ⋙ s₃.functor))
H : AsSmall E ⥤ Type (max (max (max (max (max u₁ u₂) u₃) v₁) v₂) v₃)
hFG : IsIso (colimit.pre ((s₂.inverse ⋙ G ⋙ s₃.functor) ⋙ H) (s₁.inverse ⋙ F ⋙ s₂.functor) ≫ colimit.pre H (s₂.inverse ⋙ G ⋙ s₃.functor))
\u22a2 IsIso (colimit.pre H (s₂.inverse ⋙ G ⋙ s₃.functor))
-- Mathlib/CategoryTheory/Monoidal/Internal/Module.lean
R : Type u
inst✝ : CommRing R
A : AlgebraCat R
\u22a2 CategoryTheory.MonoidalCategory.whiskerRight (Algebra.linearMap R ↑A) (of R ↑A) ≫ mul' R ↑A = (CategoryTheory.MonoidalCategory.leftUnitor (of R ↑A)).hom
-- Mathlib/CategoryTheory/Monoidal/Internal/Module.lean
R : Type u
inst✝ : CommRing R
A : AlgebraCat R
x : ↑(of R ↑A)
\u22a2 (((TensorProduct.mk R ↑(𝟙_ (ModuleCat R)) ↑(of R ↑A)).compr₂ (CategoryTheory.MonoidalCategory.whiskerRight (Algebra.linearMap R ↑A) (of R ↑A) ≫ mul' R ↑A)) 1) x = (((TensorProduct.mk R ↑(𝟙_ (ModuleCat R)) ↑(of R ↑A)).compr₂ (CategoryTheory.MonoidalCategory.leftUnitor (of R ↑A)).hom) 1) x
-- Mathlib/CategoryTheory/Monoidal/Internal/Module.lean
R : Type u
inst✝ : CommRing R
A : AlgebraCat R
x : ↑(of R ↑A)
\u22a2 (mul' R ↑A) ((CategoryTheory.MonoidalCategory.whiskerRight (Algebra.linearMap R ↑A) (of R ↑A)) (((TensorProduct.mk R ↑(𝟙_ (ModuleCat R)) ↑(of R ↑A)) 1) x)) = (CategoryTheory.MonoidalCategory.leftUnitor (of R ↑A)).hom (((TensorProduct.mk R ↑(𝟙_ (ModuleCat R)) ↑(of R ↑A)) 1) x)
-- Mathlib/CategoryTheory/Monoidal/Internal/Module.lean
R : Type u
inst✝ : CommRing R
A : AlgebraCat R
x : ↑(of R ↑A)
\u22a2 (1, x).1 • LinearMap.id (1, x).2 = 1 • x
-- Mathlib/CategoryTheory/Monoidal/Internal/Module.lean
R : Type u
inst✝ : CommRing R
A : AlgebraCat R
\u22a2 CategoryTheory.MonoidalCategory.whiskerLeft (of R ↑A) (Algebra.linearMap R ↑A) ≫ mul' R ↑A = (CategoryTheory.MonoidalCategory.rightUnitor (of R ↑A)).hom
-- Mathlib/CategoryTheory/Monoidal/Internal/Module.lean
R : Type u
inst✝ : CommRing R
A : AlgebraCat R
x : ↑(of R ↑A)
\u22a2 (((TensorProduct.mk R ↑(of R ↑A) ↑(𝟙_ (ModuleCat R))).compr₂ (CategoryTheory.MonoidalCategory.whiskerLeft (of R ↑A) (Algebra.linearMap R ↑A) ≫ mul' R ↑A)) x) 1 = (((TensorProduct.mk R ↑(of R ↑A) ↑(𝟙_ (ModuleCat R))).compr₂ (CategoryTheory.MonoidalCategory.rightUnitor (of R ↑A)).hom) x) 1
-- Mathlib/CategoryTheory/Monoidal/Internal/Module.lean
R : Type u
inst✝ : CommRing R
A : AlgebraCat R
x : ↑(of R ↑A)
\u22a2 (CategoryTheory.MonoidalCategory.whiskerLeft (of R ↑A) (Algebra.linearMap R ↑A) ≫ mul' R ↑A) (((TensorProduct.mk R ↑(of R ↑A) ↑(𝟙_ (ModuleCat R))) x) 1) = (CategoryTheory.MonoidalCategory.rightUnitor (of R ↑A)).hom (((TensorProduct.mk R ↑(of R ↑A) ↑(𝟙_ (ModuleCat R))) x) 1)
-- Mathlib/CategoryTheory/Monoidal/Internal/Module.lean
R : Type u
inst✝ : CommRing R
A : AlgebraCat R
x : ↑(of R ↑A)
\u22a2 (mul' R ↑A) ((CategoryTheory.MonoidalCategory.whiskerLeft (of R ↑A) (Algebra.linearMap R ↑A)) (((TensorProduct.mk R ↑(of R ↑A) ↑(𝟙_ (ModuleCat R))) x) 1)) = (CategoryTheory.MonoidalCategory.rightUnitor (of R ↑A)).hom (((TensorProduct.mk R ↑(of R ↑A) ↑(𝟙_ (ModuleCat R))) x) 1)
-- Mathlib/CategoryTheory/Monoidal/Internal/Module.lean
R : Type u
inst✝ : CommRing R
A : AlgebraCat R
x : ↑(of R ↑A)
\u22a2 (x, 1).2 • LinearMap.id (x, 1).1 = 1 • x
-- Mathlib/CategoryTheory/Monoidal/Internal/Module.lean
R : Type u
inst✝ : CommRing R
A : AlgebraCat R
\u22a2 CategoryTheory.MonoidalCategory.whiskerRight (mul' R ↑A) (of R ↑A) ≫ mul' R ↑A = (CategoryTheory.MonoidalCategory.associator (of R ↑A) (of R ↑A) (of R ↑A)).hom ≫ CategoryTheory.MonoidalCategory.whiskerLeft (of R ↑A) (mul' R ↑A) ≫ mul' R ↑A
-- Mathlib/RingTheory/OreLocalization/Ring.lean
R : Type u_1
inst✝³ : Semiring R
S : Submonoid R
inst✝² : OreSet S
X : Type u_2
inst✝¹ : AddCommMonoid X
inst✝ : Module R X
\u22a2 (↑__spread✝⁻⁰).toFun 0 = 0
-- Mathlib/MeasureTheory/Group/Measure.lean
𝕜 : Type u_1
G : Type u_2
H : Type u_3
inst✝⁷ : MeasurableSpace G
inst✝⁶ : MeasurableSpace H
inst✝⁵ : TopologicalSpace G
inst✝⁴ : BorelSpace G
μ : Measure G
inst✝³ : Group G
inst✝² : TopologicalGroup G
inst✝¹ : μ.IsMulLeftInvariant
inst✝ : μ.Regular
hμ : μ ≠ 0
s : Set G
hs : IsOpen s
\u22a2 μ s ≠ 0 ↔ s.Nonempty
-- Mathlib/Analysis/CstarAlgebra/ContinuousFunctionalCalculus/Unital.lean
R : Type u_1
A : Type u_2
p : A → Prop
inst✝¹¹ : Semifield R
inst✝¹⁰ : StarRing R
inst✝⁹ : MetricSpace R
inst✝⁸ : TopologicalSemiring R
inst✝⁷ : ContinuousStar R
inst✝⁶ : HasContinuousInv₀ R
inst✝⁵ : TopologicalSpace A
inst✝⁴ : Ring A
inst✝³ : StarRing A
inst✝² : Algebra R A
inst✝¹ : ContinuousFunctionalCalculus R p
f✝ : R → R
a✝ : A
inst✝ : UniqueContinuousFunctionalCalculus R A
f : R → R
n : ℤ
a : Aˣ
hf : autoParam (ContinuousOn f ((fun x => x ^ n) '' spectrum R ↑a)) _auto✝
ha : autoParam (p ↑a) _auto✝
\u22a2 cfc (fun x => f (x ^ n)) ↑a = cfc f ↑(a ^ n)
-- Mathlib/Analysis/SpecialFunctions/Log/Basic.lean
e : ℝ
d n : ℕ
h : NormNum.IsNat e n
\u22a2 0 ≤ Real.log e
-- Mathlib/Analysis/SpecialFunctions/Log/Basic.lean
e : ℝ
d n : ℕ
h : NormNum.IsNat e n
\u22a2 0 ≤ Real.log ↑n
-- Mathlib/Topology/Category/Profinite/Nobeling.lean
I : Type u
inst✝¹ : LinearOrder I
inst✝ : IsWellOrder I fun x x_1 => x < x_1
C : Set (I → Bool)
o : Ordinal.{u}
hC : IsClosed C
hsC : contained C (Order.succ o)
ho : o < Ordinal.type fun x x_1 => x < x_1
y : I → Bool
left✝¹ : y ∈ C1 C ho
left✝ : Proj (fun x => ord I x < o) y ∈ C0 C ho
\u22a2 Proj (fun x => ord I x < o) y (term I ho) = false
-- Mathlib/Computability/AkraBazzi/AkraBazzi.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : Nonempty α
T : ℕ → ℝ
g : ℝ → ℝ
a b : α → ℝ
r : α → ℕ → ℕ
R : AkraBazziRecurrence T g a b r
n : ℕ
hn : 0 < n
b' : ℝ := b (min_bi b)
\u22a2 (Ico ⌊b (min_bi b) / 2 * ↑n⌋₊ n).Nonempty
-- Mathlib/Computability/AkraBazzi/AkraBazzi.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : Nonempty α
T : ℕ → ℝ
g : ℝ → ℝ
a b : α → ℝ
r : α → ℕ → ℕ
R : AkraBazziRecurrence T g a b r
n : ℕ
hn : 0 < n
b' : ℝ := b (min_bi b)
hb_pos : 0 < b'
\u22a2 (Ico ⌊b (min_bi b) / 2 * ↑n⌋₊ n).Nonempty
-- Mathlib/Computability/AkraBazzi/AkraBazzi.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : Nonempty α
T : ℕ → ℝ
g : ℝ → ℝ
a b : α → ℝ
r : α → ℕ → ℕ
R : AkraBazziRecurrence T g a b r
n : ℕ
hn : 0 < n
b' : ℝ := b (min_bi b)
hb_pos : 0 < b'
\u22a2 ⌊b (min_bi b) / 2 * ↑n⌋₊ < n
-- Mathlib/Order/Filter/AtTopBot.lean
ι : Type u_1
ι' : Type u_2
α : Type u_3
β : Type u_4
γ : Type u_5
inst✝¹ : Nonempty α
inst✝ : SemilatticeSup α
f : α → β
l : Filter β
\u22a2 Tendsto f atTop l ↔ ∀ s ∈ l, ∃ a, ∀ b ≥ a, f b ∈ s
-- Mathlib/AlgebraicTopology/DoldKan/FunctorGamma.lean
C : Type u_1
inst✝² : Category.{?u.71152, u_1} C
inst✝¹ : Preadditive C
K✝ K'✝ : ChainComplex C ℕ
f✝ : K✝ ⟶ K'✝
Δ✝ Δ'✝ Δ'' : SimplexCategory
inst✝ : HasFiniteCoproducts C
K K' : ChainComplex C ℕ
f : K ⟶ K'
Δ' Δ : SimplexCategoryᵒᵖ
θ : Δ' ⟶ Δ
\u22a2 (obj K).map θ ≫ (fun Δ => (splitting K).desc Δ fun A => f.f (unop A.fst).len ≫ ((splitting K').cofan Δ).inj A) Δ = (fun Δ => (splitting K).desc Δ fun A => f.f (unop A.fst).len ≫ ((splitting K').cofan Δ).inj A) Δ' ≫ (obj K').map θ
-- Mathlib/AlgebraicTopology/DoldKan/FunctorGamma.lean
C : Type u_1
inst✝² : Category.{?u.71152, u_1} C
inst✝¹ : Preadditive C
K✝ K'✝ : ChainComplex C ℕ
f✝ : K✝ ⟶ K'✝
Δ✝ Δ'✝ Δ'' : SimplexCategory
inst✝ : HasFiniteCoproducts C
K K' : ChainComplex C ℕ
f : K ⟶ K'
Δ' Δ : SimplexCategoryᵒᵖ
θ : Δ' ⟶ Δ
\u22a2 ∀ (A : Splitting.IndexSet Δ'), ((splitting K).cofan Δ').inj A ≫ (obj K).map θ ≫ (fun Δ => (splitting K).desc Δ fun A => f.f (unop A.fst).len ≫ ((splitting K').cofan Δ).inj A) Δ = ((splitting K).cofan Δ').inj A ≫ (fun Δ => (splitting K).desc Δ fun A => f.f (unop A.fst).len ≫ ((splitting K').cofan Δ).inj A) Δ' ≫ (obj K').map θ