ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/Algebra/Homology/Single.lean
V : Type u
inst✝² : Category.{v, u} V
inst✝¹ : HasZeroMorphisms V
inst✝ : HasZeroObject V
A B : V
f : A ⟶ B
\u22a2 (HomologicalComplex.singleObjXSelf (ComplexShape.up ℕ) 0 A).hom ≫ f ≫ (HomologicalComplex.singleObjXSelf (ComplexShape.up ℕ) 0 B).inv = f
-- Mathlib/GroupTheory/Perm/Cycle/Concrete.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : DecidableEq α
p : Perm α
x y : α
\u22a2 y ∈ p.toList x ↔ p.SameCycle x y ∧ x ∈ p.support
-- Mathlib/GroupTheory/Perm/Cycle/Concrete.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : DecidableEq α
p : Perm α
x y : α
\u22a2 (∃ a < (p.cycleOf x).support.card, (p ^ a) x = y) ↔ p.SameCycle x y ∧ x ∈ p.support
-- Mathlib/Algebra/Polynomial/Reverse.lean
R : Type u_1
inst✝ : Semiring R
f p : R[X]
\u22a2 (X * p).reverse = p.reverse
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
f g : α → ℝ≥0∞
hf : f ∈ measurableLE μ ν
hg : g ∈ measurableLE μ ν
\u22a2 (fun a => f a ⊔ g a) ∈ measurableLE μ ν
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
f g : α → ℝ≥0∞
hf : f ∈ measurableLE μ ν
hg : g ∈ measurableLE μ ν
\u22a2 (fun a => max (f a) (g a)) ∈ measurableLE μ ν
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
f g : α → ℝ≥0∞
hf : f ∈ measurableLE μ ν
hg : g ∈ measurableLE μ ν
A : Set α
hA : MeasurableSet A
\u22a2 ∫⁻ (x : α) in A, (fun a => max (f a) (g a)) x ∂μ ≤ ν A
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
f g : α → ℝ≥0∞
hf : f ∈ measurableLE μ ν
hg : g ∈ measurableLE μ ν
A : Set α
hA : MeasurableSet A
h₁ : MeasurableSet (A ∩ {a | f a ≤ g a})
\u22a2 ∫⁻ (x : α) in A, (fun a => max (f a) (g a)) x ∂μ ≤ ν A
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
f g : α → ℝ≥0∞
hf : f ∈ measurableLE μ ν
hg : g ∈ measurableLE μ ν
A : Set α
hA : MeasurableSet A
h₁ : MeasurableSet (A ∩ {a | f a ≤ g a})
h₂ : MeasurableSet (A ∩ {a | g a < f a})
\u22a2 ∫⁻ (x : α) in A, (fun a => max (f a) (g a)) x ∂μ ≤ ν A
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
f g : α → ℝ≥0∞
hf : f ∈ measurableLE μ ν
hg : g ∈ measurableLE μ ν
A : Set α
hA : MeasurableSet A
h₁ : MeasurableSet (A ∩ {a | f a ≤ g a})
h₂ : MeasurableSet (A ∩ {a | g a < f a})
\u22a2 ∫⁻ (x : α) in A ∩ {x | f x ≤ g x}, g x ∂μ + ∫⁻ (x : α) in A ∩ {x | g x < f x}, f x ∂μ ≤ ν A
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
f g : α → ℝ≥0∞
hf : f ∈ measurableLE μ ν
hg : g ∈ measurableLE μ ν
A : Set α
hA : MeasurableSet A
h₁ : MeasurableSet (A ∩ {a | f a ≤ g a})
h₂ : MeasurableSet (A ∩ {a | g a < f a})
\u22a2 ν (A ∩ {a | f a ≤ g a}) + ν (A ∩ {a | g a < f a}) = ν A
-- Mathlib/MeasureTheory/Decomposition/Lebesgue.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
μ ν : Measure α
f g : α → ℝ≥0∞
hf : f ∈ measurableLE μ ν
hg : g ∈ measurableLE μ ν
A : Set α
hA : MeasurableSet A
h₁ : MeasurableSet (A ∩ {a | f a ≤ g a})
h₂ : MeasurableSet (A ∩ {a | g a < f a})
\u22a2 ν (A ∩ {a | f a ≤ g a}) + ν (A \ {a | f a ≤ g a}) = ν A
-- Mathlib/RingTheory/Kaehler/Basic.lean
R : Type u
S : Type v
inst✝⁶ : CommRing R
inst✝⁵ : CommRing S
inst✝⁴ : Algebra R S
M : Type u_1
inst✝³ : AddCommGroup M
inst✝² : Module R M
inst✝¹ : Module S M
inst✝ : IsScalarTower R S M
x : R
y : S
\u22a2 (y𝖣(algebraMap R S) x) = 0
-- Mathlib/RingTheory/Kaehler/Basic.lean
R : Type u
S : Type v
inst✝⁶ : CommRing R
inst✝⁵ : CommRing S
inst✝⁴ : Algebra R S
M : Type u_1
inst✝³ : AddCommGroup M
inst✝² : Module R M
inst✝¹ : Module S M
inst✝ : IsScalarTower R S M
x : R
y : S
\u22a2 y • single ((algebraMap R S) x) 1 ∈ kerTotal R S
-- Mathlib/Topology/Order/T5.lean
X : Type u_1
inst✝² : LinearOrder X
inst✝¹ : TopologicalSpace X
inst✝ : OrderTopology X
a b c : X
s t : Set X
hd : Disjoint s (closure t)
ha : a ∈ s
\u22a2 (s.ordSeparatingSet t).ordConnectedSectionᶜ ∈ 𝓝 a
-- Mathlib/Topology/Order/T5.lean
X : Type u_1
inst✝² : LinearOrder X
inst✝¹ : TopologicalSpace X
inst✝ : OrderTopology X
a b c : X
s t : Set X
hd : Disjoint s (closure t)
ha : a ∈ s
\u22a2 (s.ordSeparatingSet t).ordConnectedSectionᶜ ∈ 𝓝[≤] a ∧ (s.ordSeparatingSet t).ordConnectedSectionᶜ ∈ 𝓝[≥] a
-- Mathlib/Topology/Algebra/InfiniteSum/Group.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝² : CommGroup α
inst✝¹ : UniformSpace α
inst✝ : UniformGroup α
f g : β → α
a a₁ a₂ : α
\u22a2 (CauchySeq fun s => ∏ b ∈ s, f b) ↔ ∀ e ∈ 𝓝 1, ∃ s, ∀ (t : Set β), Disjoint t ↑s → ∏' (b : ↑t), f ↑b ∈ e
-- Mathlib/Topology/Algebra/InfiniteSum/Group.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
inst✝² : CommGroup α
inst✝¹ : UniformSpace α
inst✝ : UniformGroup α
f g : β → α
a a₁ a₂ : α
\u22a2 (∀ e ∈ 𝓝 1, ∃ s, ∀ (t : Finset β), (∀ ⦃a : β⦄, a ∈ t → a ∉ s) → ∏ b ∈ t, f b ∈ e) ↔ ∀ e ∈ 𝓝 1, ∃ s, ∀ (t : Set β), (∀ ⦃a : β⦄, a ∈ t → a ∉ ↑s) → ∏' (b : ↑t), f ↑b ∈ e
-- Mathlib/CategoryTheory/Monad/Adjunction.lean
C : Type u₁
inst✝¹ : Category.{v₁, u₁} C
D : Type u₂
inst✝ : Category.{v₂, u₂} D
L : C ⥤ D
R : D ⥤ C
h : L ⊣ R
X : D
\u22a2 L.map (h.unit.app (R.obj X)) ≫ L.map (R.map (L.map (h.unit.app (R.obj X)))) = L.map (h.unit.app (R.obj X)) ≫ L.map (h.unit.app (R.obj (L.obj (R.obj X))))
-- Mathlib/CategoryTheory/Monad/Adjunction.lean
C : Type u₁
inst✝¹ : Category.{v₁, u₁} C
D : Type u₂
inst✝ : Category.{v₂, u₂} D
L : C ⥤ D
R : D ⥤ C
h : L ⊣ R
X : D
\u22a2 L.map (h.unit.app (R.obj X) ≫ R.map (L.map (h.unit.app (R.obj X)))) = L.map (h.unit.app (R.obj X)) ≫ L.map (h.unit.app (R.obj (L.obj (R.obj X))))
-- Mathlib/CategoryTheory/Monad/Adjunction.lean
C : Type u₁
inst✝¹ : Category.{v₁, u₁} C
D : Type u₂
inst✝ : Category.{v₂, u₂} D
L : C ⥤ D
R : D ⥤ C
h : L ⊣ R
X : D
\u22a2 L.map (h.unit.app (R.obj X)) ≫ L.map (R.map (h.counit.app X)) = 𝟙 (L.obj (R.obj X))
-- Mathlib/CategoryTheory/Monad/Adjunction.lean
C : Type u₁
inst✝¹ : Category.{v₁, u₁} C
D : Type u₂
inst✝ : Category.{v₂, u₂} D
L : C ⥤ D
R : D ⥤ C
h : L ⊣ R
X : D
\u22a2 L.map (h.unit.app (R.obj X) ≫ R.map (h.counit.app X)) = 𝟙 (L.obj (R.obj X))
-- Mathlib/CategoryTheory/Sites/Coherent/LocallySurjective.lean
C : Type u_1
D : Type u_2
inst✝⁶ : Category.{u_3, u_1} C
inst✝⁵ : Category.{?u.24208, u_2} D
inst✝⁴ : ConcreteCategory D
inst✝³ : Preregular C
inst✝² : FinitaryPreExtensive C
F G : Cᵒᵖ ⥤ Type w
f : F ⟶ G
inst✝¹ : PreservesFiniteProducts F
inst✝ : PreservesFiniteProducts G
h : Presheaf.IsLocallySurjective (coherentTopology C) f
U✝ : C
y : (forget (Type w)).obj (G.obj (op U✝))
\u22a2 Presheaf.imageSieve f y ∈ (regularTopology C).sieves U✝
-- Mathlib/CategoryTheory/Sites/Coherent/LocallySurjective.lean
C : Type u_1
D : Type u_2
inst✝⁶ : Category.{u_3, u_1} C
inst✝⁵ : Category.{?u.24208, u_2} D
inst✝⁴ : ConcreteCategory D
inst✝³ : Preregular C
inst✝² : FinitaryPreExtensive C
F G : Cᵒᵖ ⥤ Type w
f : F ⟶ G
inst✝¹ : PreservesFiniteProducts F
inst✝ : PreservesFiniteProducts G
U✝ : C
y : (forget (Type w)).obj (G.obj (op U✝))
h : Presheaf.imageSieve f y ∈ (coherentTopology C).sieves U✝
\u22a2 Presheaf.imageSieve f y ∈ (regularTopology C).sieves U✝
-- Mathlib/CategoryTheory/Sites/Coherent/LocallySurjective.lean
C : Type u_1
D : Type u_2
inst✝⁶ : Category.{u_3, u_1} C
inst✝⁵ : Category.{?u.24208, u_2} D
inst✝⁴ : ConcreteCategory D
inst✝³ : Preregular C
inst✝² : FinitaryPreExtensive C
F G : Cᵒᵖ ⥤ Type w
f : F ⟶ G
inst✝¹ : PreservesFiniteProducts F
inst✝ : PreservesFiniteProducts G
U✝ : C
y : (forget (Type w)).obj (G.obj (op U✝))
h : ∃ α, ∃ (_ : Finite α), ∃ Y π, EffectiveEpiFamily Y π ∧ ∀ (a : α), (Presheaf.imageSieve f y).arrows (π a)
\u22a2 Presheaf.imageSieve f y ∈ (regularTopology C).sieves U✝
-- Mathlib/CategoryTheory/Sites/Coherent/LocallySurjective.lean
C : Type u_1
D : Type u_2
inst✝⁶ : Category.{u_3, u_1} C
inst✝⁵ : Category.{?u.24208, u_2} D
inst✝⁴ : ConcreteCategory D
inst✝³ : Preregular C
inst✝² : FinitaryPreExtensive C
F G : Cᵒᵖ ⥤ Type w
f : F ⟶ G
inst✝¹ : PreservesFiniteProducts F
inst✝ : PreservesFiniteProducts G
U✝ : C
y : (forget (Type w)).obj (G.obj (op U✝))
α : Type
w✝ : Finite α
Z : α → C
π : (a : α) → Z a ⟶ U✝
h : EffectiveEpiFamily Z π
h' : ∀ (a : α), (Presheaf.imageSieve f y).arrows (π a)
\u22a2 Presheaf.imageSieve f y ∈ (regularTopology C).sieves U✝
-- Mathlib/CategoryTheory/Sites/Coherent/LocallySurjective.lean
C : Type u_1
D : Type u_2
inst✝⁶ : Category.{u_3, u_1} C
inst✝⁵ : Category.{?u.24208, u_2} D
inst✝⁴ : ConcreteCategory D
inst✝³ : Preregular C
inst✝² : FinitaryPreExtensive C
F G : Cᵒᵖ ⥤ Type w
f : F ⟶ G
inst✝¹ : PreservesFiniteProducts F
inst✝ : PreservesFiniteProducts G
U✝ : C
y : (forget (Type w)).obj (G.obj (op U✝))
α : Type
w✝ : Finite α
Z : α → C
π : (a : α) → Z a ⟶ U✝
h : EffectiveEpiFamily Z π
h' : ∀ (a : α), (Presheaf.imageSieve f y).arrows (π a)
\u22a2 ∃ Y π, EffectiveEpi π ∧ (Presheaf.imageSieve f y).arrows π
-- Mathlib/CategoryTheory/Sites/Coherent/LocallySurjective.lean
C : Type u_1
D : Type u_2
inst✝⁶ : Category.{u_3, u_1} C
inst✝⁵ : Category.{?u.24208, u_2} D
inst✝⁴ : ConcreteCategory D
inst✝³ : Preregular C
inst✝² : FinitaryPreExtensive C
F G : Cᵒᵖ ⥤ Type w
f : F ⟶ G
inst✝¹ : PreservesFiniteProducts F
inst✝ : PreservesFiniteProducts G
U✝ : C
y : (forget (Type w)).obj (G.obj (op U✝))
α : Type
w✝ : Finite α
Z : α → C
π : (a : α) → Z a ⟶ U✝
h : EffectiveEpiFamily Z π
h' : ∀ (a : α), (Presheaf.imageSieve f y).arrows (π a)
x : (a : α) → F.obj (op (Z a)) := fun a => Exists.choose ⋯
x✝ : Fintype α := Fintype.ofFinite α
i' : ((a : α) → F.obj (op (Z a))) ≅ F.obj (op (∐ Z)) := (Types.productIso fun a => F.obj (op (Z a))).symm ≪≫ (PreservesProduct.iso F fun a => op (Z a)).symm ≪≫ F.mapIso (opCoproductIsoProduct Z).symm
this : PreservesLimitsOfShape (Discrete α)ᵒᵖ G
\u22a2 (f.app (op (∐ Z))) (i'.hom x) = (G.map (Sigma.desc π).op) y
-- Mathlib/CategoryTheory/Sites/Coherent/LocallySurjective.lean
C : Type u_1
D : Type u_2
inst✝⁶ : Category.{u_3, u_1} C
inst✝⁵ : Category.{?u.24208, u_2} D
inst✝⁴ : ConcreteCategory D
inst✝³ : Preregular C
inst✝² : FinitaryPreExtensive C
F G : Cᵒᵖ ⥤ Type w
f : F ⟶ G
inst✝¹ : PreservesFiniteProducts F
inst✝ : PreservesFiniteProducts G
U✝ : C
y : (forget (Type w)).obj (G.obj (op U✝))
α : Type
w✝ : Finite α
Z : α → C
π : (a : α) → Z a ⟶ U✝
h : EffectiveEpiFamily Z π
h' : ∀ (a : α), (Presheaf.imageSieve f y).arrows (π a)
x : (a : α) → F.obj (op (Z a)) := fun a => Exists.choose ⋯
x✝ : Fintype α := Fintype.ofFinite α
i' : ((a : α) → F.obj (op (Z a))) ≅ F.obj (op (∐ Z)) := (Types.productIso fun a => F.obj (op (Z a))).symm ≪≫ (PreservesProduct.iso F fun a => op (Z a)).symm ≪≫ F.mapIso (opCoproductIsoProduct Z).symm
this : PreservesLimitsOfShape (Discrete α)ᵒᵖ G
\u22a2 ∀ (j : (Discrete α)ᵒᵖ), ((G.mapCone (Cocone.op (Cofan.mk (∐ Z) (Sigma.ι Z)))).π.app j) ((f.app (op (∐ Z))) (i'.hom x)) = ((G.mapCone (Cocone.op (Cofan.mk (∐ Z) (Sigma.ι Z)))).π.app j) ((G.map (Sigma.desc π).op) y)
-- Mathlib/CategoryTheory/Sites/Coherent/LocallySurjective.lean
C : Type u_1
D : Type u_2
inst✝⁶ : Category.{u_3, u_1} C
inst✝⁵ : Category.{?u.24208, u_2} D
inst✝⁴ : ConcreteCategory D
inst✝³ : Preregular C
inst✝² : FinitaryPreExtensive C
F G : Cᵒᵖ ⥤ Type w
f : F ⟶ G
inst✝¹ : PreservesFiniteProducts F
inst✝ : PreservesFiniteProducts G
U✝ : C
y : (forget (Type w)).obj (G.obj (op U✝))
α : Type
w✝ : Finite α
Z : α → C
π : (a : α) → Z a ⟶ U✝
h : EffectiveEpiFamily Z π
h' : ∀ (a : α), (Presheaf.imageSieve f y).arrows (π a)
x : (a : α) → F.obj (op (Z a)) := fun a => Exists.choose ⋯
x✝ : Fintype α := Fintype.ofFinite α
i' : ((a : α) → F.obj (op (Z a))) ≅ F.obj (op (∐ Z)) := (Types.productIso fun a => F.obj (op (Z a))).symm ≪≫ (PreservesProduct.iso F fun a => op (Z a)).symm ≪≫ F.mapIso (opCoproductIsoProduct Z).symm
this : PreservesLimitsOfShape (Discrete α)ᵒᵖ G
a : α
\u22a2 ((G.mapCone (Cocone.op (Cofan.mk (∐ Z) (Sigma.ι Z)))).π.app (op { as := a })) ((f.app (op (∐ Z))) (i'.hom x)) = ((G.mapCone (Cocone.op (Cofan.mk (∐ Z) (Sigma.ι Z)))).π.app (op { as := a })) ((G.map (Sigma.desc π).op) y)
-- Mathlib/CategoryTheory/Sites/Coherent/LocallySurjective.lean
C : Type u_1
D : Type u_2
inst✝⁶ : Category.{u_3, u_1} C
inst✝⁵ : Category.{?u.24208, u_2} D
inst✝⁴ : ConcreteCategory D
inst✝³ : Preregular C
inst✝² : FinitaryPreExtensive C
F G : Cᵒᵖ ⥤ Type w
f : F ⟶ G
inst✝¹ : PreservesFiniteProducts F
inst✝ : PreservesFiniteProducts G
U✝ : C
y : (forget (Type w)).obj (G.obj (op U✝))
α : Type
w✝ : Finite α
Z : α → C
π : (a : α) → Z a ⟶ U✝
h : EffectiveEpiFamily Z π
h' : ∀ (a : α), (Presheaf.imageSieve f y).arrows (π a)
x : (a : α) → F.obj (op (Z a)) := fun a => Exists.choose ⋯
x✝ : Fintype α := Fintype.ofFinite α
i' : ((a : α) → F.obj (op (Z a))) ≅ F.obj (op (∐ Z)) := (Types.productIso fun a => F.obj (op (Z a))).symm ≪≫ (PreservesProduct.iso F fun a => op (Z a)).symm ≪≫ F.mapIso (opCoproductIsoProduct Z).symm
this : PreservesLimitsOfShape (Discrete α)ᵒᵖ G
a : α
\u22a2 (f.app (op (Z a))) ((F.map (Sigma.ι Z a).op) (F.map (opCoproductIsoProduct Z).inv ((PreservesProduct.iso F fun a => op (Z a)).inv ((Types.productIso fun a => F.obj (op (Z a))).inv x)))) = (G.map (Sigma.ι Z a).op) ((G.map (Sigma.desc π).op) y)
-- Mathlib/CategoryTheory/Sites/Coherent/LocallySurjective.lean
C : Type u_1
D : Type u_2
inst✝⁶ : Category.{u_3, u_1} C
inst✝⁵ : Category.{?u.24208, u_2} D
inst✝⁴ : ConcreteCategory D
inst✝³ : Preregular C
inst✝² : FinitaryPreExtensive C
F G : Cᵒᵖ ⥤ Type w
f : F ⟶ G
inst✝¹ : PreservesFiniteProducts F
inst✝ : PreservesFiniteProducts G
U✝ : C
y : (forget (Type w)).obj (G.obj (op U✝))
α : Type
w✝ : Finite α
Z : α → C
π : (a : α) → Z a ⟶ U✝
h : EffectiveEpiFamily Z π
h' : ∀ (a : α), (Presheaf.imageSieve f y).arrows (π a)
x : (a : α) → F.obj (op (Z a)) := fun a => Exists.choose ⋯
x✝ : Fintype α := Fintype.ofFinite α
i' : ((a : α) → F.obj (op (Z a))) ≅ F.obj (op (∐ Z)) := (Types.productIso fun a => F.obj (op (Z a))).symm ≪≫ (PreservesProduct.iso F fun a => op (Z a)).symm ≪≫ F.mapIso (opCoproductIsoProduct Z).symm
this✝ : PreservesLimitsOfShape (Discrete α)ᵒᵖ G
a : α
this : f.app (op (Z a)) (x a) = G.map (π a).op y
\u22a2 (f.app (op (Z a))) ((F.map (Sigma.ι Z a).op) (F.map (opCoproductIsoProduct Z).inv ((PreservesProduct.iso F fun a => op (Z a)).inv ((Types.productIso fun a => F.obj (op (Z a))).inv x)))) = (G.map (Sigma.ι Z a).op) ((G.map (Sigma.desc π).op) y)
-- Mathlib/NumberTheory/LegendreSymbol/JacobiSymbol.lean
p : ℕ
x✝ : Fact (Nat.Prime p)
a : ℤ
\u22a2 legendreSym p a = fastLegendreSym p a
-- Mathlib/Analysis/SpecialFunctions/Log/Basic.lean
x✝ y x : ℝ
hx : 0 < x
\u22a2 cosh (log x) = (x + x⁻¹) / 2
-- Mathlib/FieldTheory/Cardinality.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : Field α
\u22a2 IsPrimePow ‖α‖
-- Mathlib/FieldTheory/Cardinality.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : Field α
p : ℕ
h✝ : CharP α p
\u22a2 IsPrimePow ‖α‖
-- Mathlib/FieldTheory/Cardinality.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : Field α
p : ℕ
h✝ : CharP α p
hp : Fact (Nat.Prime p)
\u22a2 IsPrimePow ‖α‖
-- Mathlib/FieldTheory/Cardinality.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : Field α
p : ℕ
h✝ : CharP α p
hp : Fact (Nat.Prime p)
this : Algebra (ZMod p) α := ZMod.algebra α p
b : Basis { x // x ∈ IsNoetherian.finsetBasisIndex (ZMod p) α } (ZMod p) α := IsNoetherian.finsetBasis (ZMod p) α
\u22a2 IsPrimePow ‖α‖
-- Mathlib/FieldTheory/Cardinality.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : Field α
p : ℕ
h✝ : CharP α p
hp : Fact (Nat.Prime p)
this : Algebra (ZMod p) α := ZMod.algebra α p
b : Basis { x // x ∈ IsNoetherian.finsetBasisIndex (ZMod p) α } (ZMod p) α := IsNoetherian.finsetBasis (ZMod p) α
\u22a2 IsPrimePow p
-- Mathlib/FieldTheory/Cardinality.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : Field α
p : ℕ
h✝ : CharP α p
hp : Fact (Nat.Prime p)
this : Algebra (ZMod p) α := ZMod.algebra α p
b : Basis { x // x ∈ IsNoetherian.finsetBasisIndex (ZMod p) α } (ZMod p) α := IsNoetherian.finsetBasis (ZMod p) α
\u22a2 ‖{ x // x ∈ IsNoetherian.finsetBasisIndex (ZMod p) α }‖ ≠ 0
-- Mathlib/FieldTheory/Cardinality.lean
α : Type u_1
inst✝¹ : Fintype α
inst✝ : Field α
p : ℕ
h✝ : CharP α p
hp : Fact (Nat.Prime p)
this : Algebra (ZMod p) α := ZMod.algebra α p
b : Basis { x // x ∈ IsNoetherian.finsetBasisIndex (ZMod p) α } (ZMod p) α := IsNoetherian.finsetBasis (ZMod p) α
\u22a2 FiniteDimensional.finrank (ZMod p) α ≠ 0
-- Mathlib/MeasureTheory/Integral/Lebesgue.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
m : MeasurableSpace α
μ ν : Measure α
ι : Type u_5
inst✝ : Countable ι
f : α → ℝ≥0∞
s : ι → Set α
hd : Directed (fun x x_1 => x ⊆ x_1) s
\u22a2 ∫⁻ (x : α) in ⋃ i, s i, f x ∂μ = ⨆ i, ∫⁻ (x : α) in s i, f x ∂μ
-- .lake/packages/batteries/Batteries/Data/String/Lemmas.lean
x✝¹ : Substring
h✝ : x✝¹.Valid
x✝ : Nat
w✝² w✝¹ w✝ : List Char
h : ValidFor w✝² w✝¹ w✝ x✝¹
\u22a2 (x✝¹.take x✝).toString.data = List.take x✝ x✝¹.toString.data
-- Mathlib/Analysis/SpecialFunctions/Log/Base.lean
b✝ x y : ℝ
b : ℕ
r : ℝ
hb : 1 < b
hr✝ : 0 ≤ r
hr : 0 < r
\u22a2 ⌊logb (↑b) r⌋ = Int.log b r
-- Mathlib/Analysis/SpecialFunctions/Log/Base.lean
b✝ x y : ℝ
b : ℕ
r : ℝ
hb : 1 < b
hr✝ : 0 ≤ r
hr : 0 < r
hb1' : 1 < ↑b
\u22a2 ⌊logb (↑b) r⌋ = Int.log b r
-- Mathlib/Analysis/SpecialFunctions/Log/Base.lean
b✝ x y : ℝ
b : ℕ
r : ℝ
hb : 1 < b
hr✝ : 0 ≤ r
hr : 0 < r
hb1' : 1 < ↑b
\u22a2 ⌊logb (↑b) r⌋ ≤ Int.log b r
-- Mathlib/Analysis/SpecialFunctions/Log/Base.lean
b✝ x y : ℝ
b : ℕ
r : ℝ
hb : 1 < b
hr✝ : 0 ≤ r
hr : 0 < r
hb1' : 1 < ↑b
\u22a2 Int.log b r ≤ ⌊logb (↑b) r⌋
-- Mathlib/NumberTheory/LegendreSymbol/QuadraticChar/Basic.lean
F : Type u_1
inst✝² : Field F
inst✝¹ : Fintype F
inst✝ : DecidableEq F
hF : ringChar F ≠ 2
\u22a2 quadraticChar F ≠ 1
-- Mathlib/NumberTheory/LegendreSymbol/QuadraticChar/Basic.lean
F : Type u_1
inst✝² : Field F
inst✝¹ : Fintype F
inst✝ : DecidableEq F
hF : ringChar F ≠ 2
a : Fˣ
ha : (quadraticChar F) ↑a = -1
\u22a2 quadraticChar F ≠ 1
-- Mathlib/NumberTheory/LegendreSymbol/QuadraticChar/Basic.lean
F : Type u_1
inst✝² : Field F
inst✝¹ : Fintype F
inst✝ : DecidableEq F
hF : ringChar F ≠ 2
a : Fˣ
ha : (quadraticChar F) ↑a = -1
hχ : quadraticChar F = 1
\u22a2 False
-- Mathlib/RingTheory/Multiplicity.lean
α : Type u_1
β : Type u_2
inst✝³ : Monoid α
inst✝² : Monoid β
inst✝¹ : DecidableRel fun x x_1 => x ∣ x_1
inst✝ : DecidableRel fun x x_1 => x ∣ x_1
a b : α
k : ℕ
\u22a2 multiplicity a b < ↑k ↔ ¬a ^ k ∣ b
-- Mathlib/Analysis/NormedSpace/Connected.lean
E : Type u_1
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℝ E
h : 1 < Module.rank ℝ E
x : E
r : ℝ
hr : 0 ≤ r
rpos : 0 < r
f : E → E := fun y => x + (r * ‖y‖⁻¹) • y
\u22a2 IsPathConnected (sphere x r)
-- Mathlib/Analysis/NormedSpace/Connected.lean
E : Type u_1
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℝ E
h : 1 < Module.rank ℝ E
x : E
r : ℝ
hr : 0 ≤ r
rpos : 0 < r
f : E → E := fun y => x + (r * ‖y‖⁻¹) • y
A : ContinuousOn f {0}ᶜ
\u22a2 IsPathConnected (sphere x r)
-- Mathlib/Analysis/NormedSpace/Connected.lean
E : Type u_1
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℝ E
h : 1 < Module.rank ℝ E
x : E
r : ℝ
hr : 0 ≤ r
rpos : 0 < r
f : E → E := fun y => x + (r * ‖y‖⁻¹) • y
A : ContinuousOn f {0}ᶜ
B : IsPathConnected {0}ᶜ
\u22a2 IsPathConnected (sphere x r)
-- Mathlib/Analysis/NormedSpace/Connected.lean
E : Type u_1
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℝ E
h : 1 < Module.rank ℝ E
x : E
r : ℝ
hr : 0 ≤ r
rpos : 0 < r
f : E → E := fun y => x + (r * ‖y‖⁻¹) • y
A : ContinuousOn f {0}ᶜ
B : IsPathConnected {0}ᶜ
C : IsPathConnected (f '' {0}ᶜ)
\u22a2 IsPathConnected (sphere x r)
-- Mathlib/MeasureTheory/Measure/MeasureSpace.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝¹ : MeasurableSpace β
inst✝ : MeasurableSpace γ
μ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s✝ s' t✝ s t u : Set α
hs : MeasurableSet s
h : μ t = μ u
htu : t ⊆ u
ht_ne_top : μ u ≠ ⊤
\u22a2 μ (t ∩ s) = μ (u ∩ s)
-- Mathlib/MeasureTheory/Measure/MeasureSpace.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝¹ : MeasurableSpace β
inst✝ : MeasurableSpace γ
μ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s✝ s' t✝ s t u : Set α
hs : MeasurableSet s
h : μ t = μ u
htu : t ⊆ u
ht_ne_top : μ u ≠ ⊤
\u22a2 μ (u ∩ s) ≤ μ (t ∩ s)
-- Mathlib/MeasureTheory/Measure/MeasureSpace.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝¹ : MeasurableSpace β
inst✝ : MeasurableSpace γ
μ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s✝ s' t✝ s t u : Set α
hs : MeasurableSet s
h : μ t = μ u
htu : t ⊆ u
ht_ne_top : μ u ≠ ⊤
A : μ (u ∩ s) + μ (u \ s) ≤ μ (t ∩ s) + μ (u \ s)
\u22a2 μ (u ∩ s) ≤ μ (t ∩ s)
-- Mathlib/MeasureTheory/Measure/MeasureSpace.lean
α : Type u_1
β : Type u_2
γ : Type u_3
δ : Type u_4
ι : Type u_5
R : Type u_6
R' : Type u_7
m0 : MeasurableSpace α
inst✝¹ : MeasurableSpace β
inst✝ : MeasurableSpace γ
μ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α
s✝ s' t✝ s t u : Set α
hs : MeasurableSet s
h : μ t = μ u
htu : t ⊆ u
ht_ne_top : μ u ≠ ⊤
A : μ (u ∩ s) + μ (u \ s) ≤ μ (t ∩ s) + μ (u \ s)
B : μ (u \ s) ≠ ⊤
\u22a2 μ (u ∩ s) ≤ μ (t ∩ s)
-- Mathlib/MeasureTheory/Function/UniformIntegrable.lean
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ : Measure α
inst✝ : NormedAddCommGroup β
p : ℝ≥0∞
f : α → β
hf : Memℒp f 1 μ
ε : ℝ
hε : 0 < ε
\u22a2 ∃ M, 0 ≤ M ∧ ∫⁻ (x : α), ↑‖{x | M ≤ ↑‖f x‖₊}.indicator f x‖₊ ∂μ ≤ ENNReal.ofReal ε
-- Mathlib/MeasureTheory/Function/UniformIntegrable.lean
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ : Measure α
inst✝ : NormedAddCommGroup β
p : ℝ≥0∞
f : α → β
hf : Memℒp f 1 μ
ε : ℝ
hε : 0 < ε
hf_mk : Memℒp (AEStronglyMeasurable.mk f ⋯) 1 μ
\u22a2 ∃ M, 0 ≤ M ∧ ∫⁻ (x : α), ↑‖{x | M ≤ ↑‖f x‖₊}.indicator f x‖₊ ∂μ ≤ ENNReal.ofReal ε
-- Mathlib/MeasureTheory/Function/UniformIntegrable.lean
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ : Measure α
inst✝ : NormedAddCommGroup β
p : ℝ≥0∞
f : α → β
hf : Memℒp f 1 μ
ε : ℝ
hε : 0 < ε
hf_mk : Memℒp (AEStronglyMeasurable.mk f ⋯) 1 μ
M : ℝ
hM_pos : 0 ≤ M
hfM : ∫⁻ (x : α), ↑‖{x | M ≤ ↑‖AEStronglyMeasurable.mk f ⋯ x‖₊}.indicator (AEStronglyMeasurable.mk f ⋯) x‖₊ ∂μ ≤ ENNReal.ofReal ε
\u22a2 ∃ M, 0 ≤ M ∧ ∫⁻ (x : α), ↑‖{x | M ≤ ↑‖f x‖₊}.indicator f x‖₊ ∂μ ≤ ENNReal.ofReal ε
-- Mathlib/MeasureTheory/Function/UniformIntegrable.lean
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ : Measure α
inst✝ : NormedAddCommGroup β
p : ℝ≥0∞
f : α → β
hf : Memℒp f 1 μ
ε : ℝ
hε : 0 < ε
hf_mk : Memℒp (AEStronglyMeasurable.mk f ⋯) 1 μ
M : ℝ
hM_pos : 0 ≤ M
hfM : ∫⁻ (x : α), ↑‖{x | M ≤ ↑‖AEStronglyMeasurable.mk f ⋯ x‖₊}.indicator (AEStronglyMeasurable.mk f ⋯) x‖₊ ∂μ ≤ ENNReal.ofReal ε
\u22a2 ∫⁻ (x : α), ↑‖{x | M ≤ ↑‖f x‖₊}.indicator f x‖₊ ∂μ = ∫⁻ (x : α), ↑‖{x | M ≤ ↑‖AEStronglyMeasurable.mk f ⋯ x‖₊}.indicator (AEStronglyMeasurable.mk f ⋯) x‖₊ ∂μ
-- Mathlib/MeasureTheory/Function/UniformIntegrable.lean
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ : Measure α
inst✝ : NormedAddCommGroup β
p : ℝ≥0∞
f : α → β
hf : Memℒp f 1 μ
ε : ℝ
hε : 0 < ε
hf_mk : Memℒp (AEStronglyMeasurable.mk f ⋯) 1 μ
M : ℝ
hM_pos : 0 ≤ M
hfM : ∫⁻ (x : α), ↑‖{x | M ≤ ↑‖AEStronglyMeasurable.mk f ⋯ x‖₊}.indicator (AEStronglyMeasurable.mk f ⋯) x‖₊ ∂μ ≤ ENNReal.ofReal ε
\u22a2 (fun x => ↑‖{x | M ≤ ↑‖f x‖₊}.indicator f x‖₊) =ᶠ[ae μ] fun x => ↑‖{x | M ≤ ↑‖AEStronglyMeasurable.mk f ⋯ x‖₊}.indicator (AEStronglyMeasurable.mk f ⋯) x‖₊
-- Mathlib/MeasureTheory/Function/UniformIntegrable.lean
α : Type u_1
β : Type u_2
ι : Type u_3
m : MeasurableSpace α
μ : Measure α
inst✝ : NormedAddCommGroup β
p : ℝ≥0∞
f : α → β
hf : Memℒp f 1 μ
ε : ℝ
hε : 0 < ε
hf_mk : Memℒp (AEStronglyMeasurable.mk f ⋯) 1 μ
M : ℝ
hM_pos : 0 ≤ M
hfM : ∫⁻ (x : α), ↑‖{x | M ≤ ↑‖AEStronglyMeasurable.mk f ⋯ x‖₊}.indicator (AEStronglyMeasurable.mk f ⋯) x‖₊ ∂μ ≤ ENNReal.ofReal ε
x : α
hx : f x = AEStronglyMeasurable.mk f ⋯ x
\u22a2 ↑‖{x | M ≤ ↑‖f x‖₊}.indicator f x‖₊ = ↑‖{x | M ≤ ↑‖AEStronglyMeasurable.mk f ⋯ x‖₊}.indicator (AEStronglyMeasurable.mk f ⋯) x‖₊
-- Mathlib/Analysis/SpecialFunctions/Trigonometric/Series.lean
x : ℝ
\u22a2 cosh x ≤ rexp (x ^ 2 / 2)
-- Mathlib/Analysis/SpecialFunctions/Trigonometric/Series.lean
x : ℝ
\u22a2 ∑' (n : ℕ), x ^ (2 * n) / ↑(2 * n)! ≤ (fun x => ∑' (n : ℕ), (↑n !)⁻¹ • x ^ n) (x ^ 2 / 2)