ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/NumberTheory/NumberField/Discriminant.lean
K : Type u_1
inst✝¹ : Field K
inst✝ : NumberField K
I : (FractionalIdeal (𝓞 K)⁰ K)ˣ
B : ℝ := (minkowskiBound K I * ↑(convexBodySumFactor K)⁻¹).toReal ^ (1 / ↑(finrank ℚ K))
h_le : minkowskiBound K I ≤ volume (convexBodySum K B)
\u22a2 ∃ a ∈ ↑I, a ≠ 0 ∧ ↑|(Algebra.norm ℚ) a| ≤ ↑(FractionalIdeal.absNorm ↑I) * (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
I : (FractionalIdeal (𝓞 K)⁰ K)ˣ
B : ℝ := (minkowskiBound K I * ↑(convexBodySumFactor K)⁻¹).toReal ^ (1 / ↑(finrank ℚ K))
h_le : minkowskiBound K I ≤ volume (convexBodySum K B)
x✝ : K
\u22a2 ↑(FractionalIdeal.absNorm ↑I) * (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial / ↑(finrank ℚ K) ^ finrank ℚ K * √|↑(discr K)| = (B / ↑(finrank ℚ K)) ^ finrank ℚ K
-- Mathlib/NumberTheory/NumberField/Discriminant.lean
K : Type u_1
inst✝¹ : Field K
inst✝ : NumberField K
I : (FractionalIdeal (𝓞 K)⁰ K)ˣ
B : ℝ := (minkowskiBound K I * ↑(convexBodySumFactor K)⁻¹).toReal ^ (1 / ↑(finrank ℚ K))
h_le : minkowskiBound K I ≤ volume (convexBodySum K B)
x✝ : K
\u22a2 ↑(FractionalIdeal.absNorm ↑I) * (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial * √|↑(discr K)| / ↑(finrank ℚ K) ^ finrank ℚ K = (minkowskiBound K I * ↑(convexBodySumFactor K)⁻¹).toReal / ↑(finrank ℚ K) ^ finrank ℚ K
-- Mathlib/NumberTheory/NumberField/Discriminant.lean
K : Type u_1
inst✝¹ : Field K
inst✝ : NumberField K
I : (FractionalIdeal (𝓞 K)⁰ K)ˣ
B : ℝ := (minkowskiBound K I * ↑(convexBodySumFactor K)⁻¹).toReal ^ (1 / ↑(finrank ℚ K))
h_le : minkowskiBound K I ≤ volume (convexBodySum K B)
x✝ : K
\u22a2 ↑(FractionalIdeal.absNorm ↑I) * (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial * √|↑(discr K)| = (minkowskiBound K I * ↑(convexBodySumFactor K)⁻¹).toReal
-- Mathlib/NumberTheory/NumberField/Discriminant.lean
K : Type u_1
inst✝¹ : Field K
inst✝ : NumberField K
I : (FractionalIdeal (𝓞 K)⁰ K)ˣ
B : ℝ := (minkowskiBound K I * ↑(convexBodySumFactor K)⁻¹).toReal ^ (1 / ↑(finrank ℚ K))
h_le : minkowskiBound K I ≤ volume (convexBodySum K B)
x✝ : K
\u22a2 (minkowskiBound K I * ↑(convexBodySumFactor K)⁻¹).toReal = ↑(FractionalIdeal.absNorm ↑I) * (4 / π) ^ NrComplexPlaces K * ↑(finrank ℚ K).factorial * √|↑(discr K)|
-- Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean
z : ℍ
n : ℤ
\u22a2 ModularGroup.T ^ n • z = ↑n +ᵥ z
-- Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean
z : ℍ
n : ℤ
\u22a2 (↑((algebraMap ℤ ℝ) (↑↑(ModularGroup.T ^ n) 0 0)) * ↑z + ↑((algebraMap ℤ ℝ) (↑↑(ModularGroup.T ^ n) 0 1))) / (↑((algebraMap ℤ ℝ) (↑↑(ModularGroup.T ^ n) 1 0)) * ↑z + ↑((algebraMap ℤ ℝ) (↑↑(ModularGroup.T ^ n) 1 1))) = ↑z + ↑↑n
-- Mathlib/Data/List/Sublists.lean
α : Type u
β : Type v
γ : Type w
n : ℕ
a : α
l : List α
\u22a2 (sublistsLen (n + 1) (a :: l)).length = (a :: l).length.choose (n + 1)
-- Mathlib/AlgebraicTopology/DoldKan/EquivalencePseudoabelian.lean
C : Type u_1
inst✝³ : Category.{u_2, u_1} C
inst✝² : Preadditive C
inst✝¹ : IsIdempotentComplete C
inst✝ : HasFiniteCoproducts C
\u22a2 (Compatibility.υ toKaroubiCompN₂IsoN₁).hom = Γ₂N₁.hom
-- Mathlib/AlgebraicTopology/DoldKan/EquivalencePseudoabelian.lean
C : Type u_1
inst✝³ : Category.{u_2, u_1} C
inst✝² : Preadditive C
inst✝¹ : IsIdempotentComplete C
inst✝ : HasFiniteCoproducts C
\u22a2 Γ₂N₁.inv ≫ (Compatibility.υ toKaroubiCompN₂IsoN₁).hom = 𝟙 (N₁ ⋙ Γ₂)
-- Mathlib/AlgebraicTopology/DoldKan/EquivalencePseudoabelian.lean
C : Type u_1
inst✝³ : Category.{u_2, u_1} C
inst✝² : Preadditive C
inst✝¹ : IsIdempotentComplete C
inst✝ : HasFiniteCoproducts C
X : SimplicialObject C
\u22a2 (Γ₂N₁.inv ≫ (Compatibility.υ toKaroubiCompN₂IsoN₁).hom).app X = (𝟙 (N₁ ⋙ Γ₂)).app X
-- Mathlib/AlgebraicTopology/DoldKan/EquivalencePseudoabelian.lean
C : Type u_1
inst✝³ : Category.{u_2, u_1} C
inst✝² : Preadditive C
inst✝¹ : IsIdempotentComplete C
inst✝ : HasFiniteCoproducts C
X : SimplicialObject C
\u22a2 Γ₂N₁.inv.app X ≫ (Compatibility.υ toKaroubiCompN₂IsoN₁).hom.app X = (𝟙 (N₁ ⋙ Γ₂)).app X
-- Mathlib/AlgebraicTopology/DoldKan/EquivalencePseudoabelian.lean
C : Type u_1
inst✝³ : Category.{u_2, u_1} C
inst✝² : Preadditive C
inst✝¹ : IsIdempotentComplete C
inst✝ : HasFiniteCoproducts C
X : SimplicialObject C
\u22a2 ((Γ₂N₂ToKaroubiIso.app X).inv ≫ Γ₂N₂.natTrans.app ((toKaroubi (SimplicialObject C)).obj X)) ≫ (Compatibility.υ toKaroubiCompN₂IsoN₁).hom.app X = (𝟙 (N₁ ⋙ Γ₂)).app X
-- Mathlib/AlgebraicTopology/DoldKan/EquivalencePseudoabelian.lean
C : Type u_1
inst✝³ : Category.{u_2, u_1} C
inst✝² : Preadditive C
inst✝¹ : IsIdempotentComplete C
inst✝ : HasFiniteCoproducts C
X : SimplicialObject C
\u22a2 Γ₂N₂ToKaroubiIso.inv.app X ≫ Γ₂N₂.natTrans.app ((toKaroubi (SimplicialObject C)).obj X) ≫ Γ₂N₂.hom.app ((toKaroubiEquivalence (SimplicialObject C)).functor.obj X) ≫ Preadditive.DoldKan.equivalence.inverse.map (toKaroubiCompN₂IsoN₁.hom.app X) = (𝟙 (N₁ ⋙ Γ₂)).app X
-- Mathlib/AlgebraicTopology/DoldKan/EquivalencePseudoabelian.lean
C : Type u_1
inst✝³ : Category.{u_2, u_1} C
inst✝² : Preadditive C
inst✝¹ : IsIdempotentComplete C
inst✝ : HasFiniteCoproducts C
X : SimplicialObject C
\u22a2 Γ₂N₂ToKaroubiIso.inv.app X ≫ (𝟙 (N₂ ⋙ Γ₂)).app ((toKaroubi (SimplicialObject C)).obj X) ≫ Preadditive.DoldKan.equivalence.inverse.map (toKaroubiCompN₂IsoN₁.hom.app X) = (𝟙 (N₁ ⋙ Γ₂)).app X
-- Mathlib/AlgebraicTopology/DoldKan/EquivalencePseudoabelian.lean
C : Type u_1
inst✝³ : Category.{u_2, u_1} C
inst✝² : Preadditive C
inst✝¹ : IsIdempotentComplete C
inst✝ : HasFiniteCoproducts C
X : SimplicialObject C
\u22a2 Γ₂.map (toKaroubiCompN₂IsoN₁.inv.app X) ≫ Preadditive.DoldKan.equivalence.inverse.map (toKaroubiCompN₂IsoN₁.hom.app X) = 𝟙 ((N₁ ⋙ Γ₂).obj X)
-- Mathlib/AlgebraicTopology/DoldKan/EquivalencePseudoabelian.lean
C : Type u_1
inst✝³ : Category.{u_2, u_1} C
inst✝² : Preadditive C
inst✝¹ : IsIdempotentComplete C
inst✝ : HasFiniteCoproducts C
X : SimplicialObject C
\u22a2 Γ₂.map (toKaroubiCompN₂IsoN₁.inv.app X) ≫ Γ₂.map (toKaroubiCompN₂IsoN₁.hom.app X) = 𝟙 ((N₁ ⋙ Γ₂).obj X)
-- Mathlib/AlgebraicTopology/DoldKan/EquivalencePseudoabelian.lean
C : Type u_1
inst✝³ : Category.{u_2, u_1} C
inst✝² : Preadditive C
inst✝¹ : IsIdempotentComplete C
inst✝ : HasFiniteCoproducts C
X : SimplicialObject C
\u22a2 𝟙 (Γ₂.obj (N₁.obj X)) = 𝟙 ((N₁ ⋙ Γ₂).obj X)
-- Mathlib/NumberTheory/FermatPsp.lean
a b : ℕ
ha : 2 ≤ a
hb : 2 < b
\u22a2 2 ≤ (a ^ b + 1) / (a + 1)
-- Mathlib/NumberTheory/FermatPsp.lean
a b : ℕ
ha : 2 ≤ a
hb : 2 < b
\u22a2 2 * a.succ ≤ a ^ b + 1
-- Mathlib/NumberTheory/FermatPsp.lean
a b : ℕ
ha : 2 ≤ a
hb : 2 < b
\u22a2 Nat.mul 2 a + 1 ≤ a ^ b
-- Mathlib/CategoryTheory/Limits/Preserves/Shapes/Zero.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
inst✝³ : HasZeroMorphisms C
inst✝² : HasZeroMorphisms D
inst✝¹ : HasZeroMorphisms E
F : C ⥤ D
inst✝ : F.PreservesZeroMorphisms
X : C
hX : IsZero X
\u22a2 IsZero (F.obj X)
-- Mathlib/CategoryTheory/Limits/Preserves/Shapes/Zero.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
inst✝³ : HasZeroMorphisms C
inst✝² : HasZeroMorphisms D
inst✝¹ : HasZeroMorphisms E
F : C ⥤ D
inst✝ : F.PreservesZeroMorphisms
X : C
hX : 𝟙 X = 0
\u22a2 𝟙 (F.obj X) = 0
-- Mathlib/Topology/Instances/ENNReal.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι✝ : Type u_4
ι : Type u_5
F : Filter ι
inst✝ : F.NeBot
b : ℝ≥0∞
b_ne_top : b ≠ ⊤
xs : ι → ℝ≥0∞
le_b : ∀ᶠ (i : ι) in F, xs i ≤ b
\u22a2 liminf (fun i => (xs i).toReal) F = (liminf xs F).toReal
-- Mathlib/Topology/Instances/ENNReal.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι✝ : Type u_4
ι : Type u_5
F : Filter ι
inst✝ : F.NeBot
b : ℝ≥0∞
b_ne_top : b ≠ ⊤
xs : ι → ℝ≥0∞
le_b : ∀ᶠ (i : ι) in F, xs i ≤ b
liminf_le : liminf xs F ≤ b
\u22a2 liminf (fun i => (xs i).toReal) F = (liminf xs F).toReal
-- Mathlib/Topology/Instances/ENNReal.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι✝ : Type u_4
ι : Type u_5
F : Filter ι
inst✝ : F.NeBot
b : ℝ≥0∞
b_ne_top : b ≠ ⊤
xs : ι → ℝ≥0∞
le_b : ∀ᶠ (i : ι) in F, xs i ≤ b
liminf_le : liminf xs F ≤ b
aux : ∀ᶠ (i : ι) in F, (xs i).toReal = b.truncateToReal (xs i)
\u22a2 liminf (fun i => (xs i).toReal) F = (liminf xs F).toReal
-- Mathlib/Topology/Instances/ENNReal.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι✝ : Type u_4
ι : Type u_5
F : Filter ι
inst✝ : F.NeBot
b : ℝ≥0∞
b_ne_top : b ≠ ⊤
xs : ι → ℝ≥0∞
le_b : ∀ᶠ (i : ι) in F, xs i ≤ b
liminf_le : liminf xs F ≤ b
aux : ∀ᶠ (i : ι) in F, (xs i).toReal = b.truncateToReal (xs i)
aux' : (liminf xs F).toReal = b.truncateToReal (liminf xs F)
\u22a2 liminf (fun i => (xs i).toReal) F = (liminf xs F).toReal
-- Mathlib/Topology/Instances/ENNReal.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι✝ : Type u_4
ι : Type u_5
F : Filter ι
inst✝ : F.NeBot
b : ℝ≥0∞
b_ne_top : b ≠ ⊤
xs : ι → ℝ≥0∞
le_b : ∀ᶠ (i : ι) in F, xs i ≤ b
liminf_le : liminf xs F ≤ b
aux : ∀ᶠ (i : ι) in F, (xs i).toReal = b.truncateToReal (xs i)
aux' : (liminf xs F).toReal = b.truncateToReal (liminf xs F)
\u22a2 liminf (fun a => b.truncateToReal (xs a)) F = b.truncateToReal (liminf xs F)
-- Mathlib/Topology/Instances/ENNReal.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι✝ : Type u_4
ι : Type u_5
F : Filter ι
inst✝ : F.NeBot
b : ℝ≥0∞
b_ne_top : b ≠ ⊤
xs : ι → ℝ≥0∞
le_b : ∀ᶠ (i : ι) in F, xs i ≤ b
liminf_le : liminf xs F ≤ b
aux : ∀ᶠ (i : ι) in F, (xs i).toReal = b.truncateToReal (xs i)
aux' : (liminf xs F).toReal = b.truncateToReal (liminf xs F)
key : b.truncateToReal (liminf xs F) = liminf (b.truncateToReal ∘ xs) F
\u22a2 liminf (fun a => b.truncateToReal (xs a)) F = b.truncateToReal (liminf xs F)
-- 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
a : I
z : I → Bool
hz : z ∈ C
hx : ↑⟨Proj (fun x => x ∈ s) z, ⋯⟩ a = true
\u22a2 e (π C fun x => x ∈ s) a ∈ factors C s ⟨Proj (fun x => x ∈ s) z, ⋯⟩
-- 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
a : I
z : I → Bool
hz : z ∈ C
hx : ↑⟨Proj (fun x => x ∈ s) z, ⋯⟩ a = true
\u22a2 ∃ a_1 ∈ s, (if Proj (fun x => x ∈ s) z a_1 = true then e (π C fun x => x ∈ s) a_1 else 1 - e (π C fun x => x ∈ s) a_1) = e (π C fun x => x ∈ s) a
-- 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
a : I
z : I → Bool
hz : z ∈ C
hx : ↑⟨Proj (fun x => x ∈ s) z, ⋯⟩ a = true
\u22a2 a ∈ s
-- Mathlib/RingTheory/MvPowerSeries/Basic.lean
σ : Type u_1
R : Type u_2
inst✝ : Semiring R
m n : σ →₀ ℕ
h : m ≠ n
a : R
\u22a2 (coeff R m) ((monomial R n) a) = 0
-- Mathlib/Order/Interval/Set/Basic.lean
α : Type u_1
β : Type u_2
inst✝ : PartialOrder α
a b c : α
h : a < b
\u22a2 insert a (Ioo a b) = Ico a b
-- Mathlib/Data/Nat/Choose/Multinomial.lean
α : Type u_1
s : Finset α
f : α → ℕ
a✝ b✝ : α
n a b c : ℕ
\u22a2 multinomial univ ![a, b, c] = (a + b + c)! / (a ! * b ! * c !)
-- Mathlib/Data/Nat/Choose/Multinomial.lean
α : Type u_1
s : Finset α
f : α → ℕ
a✝ b✝ : α
n a b c : ℕ
\u22a2 (![a, b, c] 0 + ![a, b, c] 1 + ![a, b, c] 2)! / ((![a, b, c] 0)! * (![a, b, c] 1)! * (![a, b, c] 2)!) = (a + b + c)! / (a ! * b ! * c !)
-- Mathlib/Algebra/Lie/OfAssociative.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
A : Type v
inst✝¹ : Ring A
inst✝ : Algebra R A
a b : A
\u22a2 ((ad R A) a) b = ((LinearMap.mulLeft R - LinearMap.mulRight R) a) b
-- Mathlib/NumberTheory/LSeries/Dirichlet.lean
s : ℂ
hs : 1 < s.re
\u22a2 L (fun n => ↑(ζ n)) s * L (fun n => ↑(μ n)) s = 1
-- Mathlib/NumberTheory/LSeries/Dirichlet.lean
s : ℂ
hs : 1 < s.re
\u22a2 L ((fun x => ↑(ζ x)) ⍟ fun n => ↑(μ n)) s = 1
-- Mathlib/Data/Num/Lemmas.lean
α : Type u_1
m n : PosNum
h : ↑m = ↑n
\u22a2 pos m = pos n
-- Mathlib/MeasureTheory/PiSystem.lean
α : Type u_1
ι : Type u_2
π : ι → Set (Set α)
S : Set ι
i : ι
his : i ∈ S
\u22a2 π i ⊆ piiUnionInter π S
-- Mathlib/MeasureTheory/PiSystem.lean
α : Type u_1
ι : Type u_2
π : ι → Set (Set α)
S : Set ι
i : ι
his : i ∈ S
h_ss : {i} ⊆ S
\u22a2 π i ⊆ piiUnionInter π S
-- Mathlib/MeasureTheory/PiSystem.lean
α : Type u_1
ι : Type u_2
π : ι → Set (Set α)
S : Set ι
i : ι
his : i ∈ S
h_ss : {i} ⊆ S
\u22a2 π i ⊆ piiUnionInter π {i}
-- Mathlib/MeasureTheory/PiSystem.lean
α : Type u_1
ι : Type u_2
π : ι → Set (Set α)
S : Set ι
i : ι
his : i ∈ S
h_ss : {i} ⊆ S
\u22a2 π i ⊆ π i ∪ {univ}
-- Mathlib/Topology/Algebra/Group/Basic.lean
G : Type w
H : Type x
α : Type u
β : Type v
inst✝² : TopologicalSpace G
inst✝¹ : Group G
inst✝ : ContinuousMul G
h : IsClosed {1}
x : G
\u22a2 IsClosed {x}
-- Mathlib/Order/Atoms.lean
ι : Sort u_1
α : Type u_2
β : Type u_3
inst✝ : CompleteLattice α
h : IsCoatomistic αᵒᵈ
b : α
\u22a2 ∃ s, b = sSup s ∧ ∀ a ∈ s, IsAtom a
-- Mathlib/Order/Atoms.lean
ι : Sort u_1
α : Type u_2
β : Type u_3
inst✝ : CompleteLattice α
h : IsAtomistic α
b : αᵒᵈ
\u22a2 ∃ s, b = sInf s ∧ ∀ a ∈ s, IsCoatom a
-- Mathlib/CategoryTheory/Subobject/Lattice.lean
C : Type u₁
inst✝³ : Category.{v₁, u₁} C
X Y Z : C
D : Type u₂
inst✝² : Category.{v₂, u₂} D
inst✝¹ : HasPullbacks C
A : C
f₁ f₂ : Subobject A
inst✝ : HasBinaryProduct f₁ f₂
\u22a2 (f₁ ⨯ f₂) = f₁ ⊓ f₂
-- Mathlib/CategoryTheory/Subobject/Lattice.lean
C : Type u₁
inst✝³ : Category.{v₁, u₁} C
X Y Z : C
D : Type u₂
inst✝² : Category.{v₂, u₂} D
inst✝¹ : HasPullbacks C
A : C
f₁ f₂ : Subobject A
inst✝ : HasBinaryProduct f₁ f₂
\u22a2 (f₁ ⨯ f₂) ≤ f₁ ⊓ f₂
-- Mathlib/CategoryTheory/Subobject/Lattice.lean
C : Type u₁
inst✝³ : Category.{v₁, u₁} C
X Y Z : C
D : Type u₂
inst✝² : Category.{v₂, u₂} D
inst✝¹ : HasPullbacks C
A : C
f₁ f₂ : Subobject A
inst✝ : HasBinaryProduct f₁ f₂
\u22a2 f₁ ⊓ f₂ ≤ (f₁ ⨯ f₂)
-- Mathlib/MeasureTheory/Measure/VectorMeasure.lean
α : Type u_1
β : Type u_2
m : MeasurableSpace α
M : Type u_3
inst✝² : AddCommMonoid M
inst✝¹ : TopologicalSpace M
inst✝ : T2Space M
v : VectorMeasure α M
f : ℕ → Set α
A B : Set α
hA : MeasurableSet A
hB : MeasurableSet B
h : A ⊆ B
\u22a2 ↑v A + ↑v (B \ A) = ↑v B
-- Mathlib/Combinatorics/Quiver/Covering.lean
U : Type u_1
inst✝² : Quiver U
V : Type u_2
inst✝¹ : Quiver V
φ : U ⥤q V
W : Type ?u.7311
inst✝ : Quiver W
ψ : V ⥤q W
u : U
\u22a2 φ.symmetrify.costar u = ⇑(symmetrifyCostar (φ.obj u)).symm ∘ Sum.map (φ.costar u) (φ.star u) ∘ ⇑(symmetrifyCostar u)
-- Mathlib/Combinatorics/Quiver/Covering.lean
U : Type u_1
inst✝² : Quiver U
V : Type u_2
inst✝¹ : Quiver V
φ : U ⥤q V
W : Type ?u.7311
inst✝ : Quiver W
ψ : V ⥤q W
u : U
\u22a2 ⇑(symmetrifyCostar (φ.obj u)) ∘ φ.symmetrify.costar u = Sum.map (φ.costar u) (φ.star u) ∘ ⇑(symmetrifyCostar u)
-- Mathlib/Data/Real/ConjExponents.lean
a b p q : ℝ
h : p.IsConjExponent q
ha : 0 < a
hb : 0 < b
hab : a + b = 1
\u22a2 a⁻¹⁻¹ + b⁻¹⁻¹ = 1
-- Mathlib/Logic/Equiv/Option.lean
α : Type u_1
β : Type u_2
γ : Type u_3
e : Option α ≃ Option β
x : α
h : e (some x) = none
\u22a2 some (e.removeNone_aux x) = e none
-- Mathlib/SetTheory/Cardinal/Basic.lean
α✝ β✝ : Type u
a b : Cardinal.{v}
α β : Type v
\u22a2 lift.{u, v} #α ≤ lift.{u, v} #β ↔ #α ≤ #β
-- Mathlib/SetTheory/Cardinal/Basic.lean
α✝ β✝ : Type u
a b : Cardinal.{v}
α β : Type v
\u22a2 lift.{max v u, v} #α ≤ lift.{max v u, v} #β ↔ #α ≤ #β
-- Mathlib/MeasureTheory/Measure/Hausdorff.lean
ι : Type u_1
X : Type u_2
Y : Type u_3
inst✝¹ : EMetricSpace X
inst✝ : EMetricSpace Y
\u22a2 (mkMetric fun x => ⊤) = ⊤
-- Mathlib/MeasureTheory/Measure/Hausdorff.lean
ι : Type u_1
X : Type u_2
Y : Type u_3
inst✝¹ : EMetricSpace X
inst✝ : EMetricSpace Y
\u22a2 ⊤ ≤ ⨆ r, ⨆ (_ : r > 0), ⊤
-- Mathlib/MeasureTheory/Measure/Hausdorff.lean
ι : Type u_1
X : Type u_2
Y : Type u_3
inst✝¹ : EMetricSpace X
inst✝ : EMetricSpace Y
\u22a2 ∀ (b : OuterMeasure X), (∀ (i : ℝ≥0∞), ⨆ (_ : i > 0), ⊤ ≤ b) → ⊤ ≤ b
-- Mathlib/MeasureTheory/Function/Jacobian.lean
E : Type u_1
F : Type u_2
inst✝⁷ : NormedAddCommGroup E
inst✝⁶ : NormedSpace ℝ E
inst✝⁵ : FiniteDimensional ℝ E
inst✝⁴ : NormedAddCommGroup F
inst✝³ : NormedSpace ℝ F
s : Set E
f✝ : E → E
f' : E → E →L[ℝ] E
inst✝² : MeasurableSpace E
inst✝¹ : BorelSpace E
μ : Measure E
inst✝ : μ.IsAddHaarMeasure
hs : MeasurableSet s
f : E ≃ᵐ E
g : E → ℝ
hg : ∀ᵐ (x : E) ∂μ, x ∈ ⇑f '' s → 0 ≤ g x
hg_int : IntegrableOn g (⇑f '' s) μ
hf' : ∀ x ∈ s, HasFDerivWithinAt (⇑f) (f' x) s x
\u22a2 (Measure.map (⇑f.symm) (μ.withDensity fun x => ENNReal.ofReal (g x))) s = ENNReal.ofReal (∫ (x : E) in s, |(f' x).det| * g (f x) ∂μ)
-- Mathlib/Data/Set/Card.lean
α : Type u_1
β : Type u_2
s t : Set α
f : α → β
h : (f '' s).ncard = s.ncard
hs : autoParam s.Finite _auto✝
\u22a2 InjOn f s
-- Mathlib/Data/Set/Card.lean
α : Type u_1
β : Type u_2
s t : Set α
f : α → β
h : (f '' s).encard = s.encard
hs : autoParam s.Finite _auto✝
\u22a2 InjOn f s
-- Mathlib/Order/Basic.lean
ι : Type u_1
α : Type u_2
β : Type u_3
π : ι → Type u_4
inst✝¹ : DecidableEq ι
inst✝ : (i : ι) → Preorder (π i)
x y : (i : ι) → π i
i : ι
a b : π i
\u22a2 update x i a ≤ update x i b ↔ a ≤ b
-- Mathlib/Probability/Independence/Kernel.lean
α : Type u_1
Ω : Type u_2
ι : Type u_3
_mα : MeasurableSpace α
f : ι → Set Ω
_mΩ : MeasurableSpace Ω
κ : Kernel α Ω
μ : Measure α
\u22a2 iIndep (fun i => MeasurableSpace.comap (fun x => x ∈ f i) ⊤) κ μ ↔ iIndepSet f κ μ
-- Mathlib/Tactic/NormNum/Pow.lean
a b✝ c : ℕ
α : Type u_1
inst✝ : Ring α
an : ℤ
ad b : ℕ
inv✝ : Invertible ↑ad
this : Invertible (↑ad ^ b)
\u22a2 IsRat ((↑an * ⅟↑ad) ^ b) (an ^ b) (ad ^ b)
-- Mathlib/Tactic/NormNum/Pow.lean
a b✝ c : ℕ
α : Type u_1
inst✝ : Ring α
an : ℤ
ad b : ℕ
inv✝ : Invertible ↑ad
this : Invertible ↑(ad ^ b)
\u22a2 IsRat ((↑an * ⅟↑ad) ^ b) (an ^ b) (ad ^ b)
-- Mathlib/Tactic/NormNum/Pow.lean
a b✝ c : ℕ
α : Type u_1
inst✝ : Ring α
an : ℤ
ad b : ℕ
inv✝ : Invertible ↑ad
this : Invertible ↑(ad ^ b)
\u22a2 (↑an * ⅟↑ad) ^ b = ↑(an ^ b) * ⅟↑(ad ^ b)
-- Mathlib/Data/Set/Prod.lean
ι : Type u_1
α : ι → Type u_2
β : ι → Type u_3
s s₁ s₂ : Set ι
t t₁ t₂ : (i : ι) → Set (α i)
i : ι
\u22a2 univ.pi t₁ ⊆ univ.pi t₂ ↔ (∀ (i : ι), t₁ i ⊆ t₂ i) ∨ ∃ i, t₁ i = ∅
-- Mathlib/NumberTheory/NumberField/Embeddings.lean
k : Type u_1
inst✝⁷ : Field k
K : Type u_2
inst✝⁶ : Field K
F : Type u_3
inst✝⁵ : Field F
inst✝⁴ : NumberField K
inst✝³ : Algebra k K
inst✝² : Algebra k F
inst✝¹ : Algebra K F
inst✝ : IsScalarTower k K F
σ : K ≃ₐ[k] K
w : InfinitePlace K
\u22a2 ¬IsUnramified k w ↔ w.IsComplex ∧ (w.comap (algebraMap k K)).IsReal
-- Mathlib/NumberTheory/NumberField/Embeddings.lean
k : Type u_1
inst✝⁷ : Field k
K : Type u_2
inst✝⁶ : Field K
F : Type u_3
inst✝⁵ : Field F
inst✝⁴ : NumberField K
inst✝³ : Algebra k K
inst✝² : Algebra k F
inst✝¹ : Algebra K F
inst✝ : IsScalarTower k K F
σ : K ≃ₐ[k] K
w : InfinitePlace K
\u22a2 (¬(if (w.comap (algebraMap k K)).IsReal then 1 else 2) = if w.IsReal then 1 else 2) ↔ ¬w.IsReal ∧ (w.comap (algebraMap k K)).IsReal
-- Mathlib/NumberTheory/NumberField/Embeddings.lean
k : Type u_1
inst✝⁷ : Field k
K : Type u_2
inst✝⁶ : Field K
F : Type u_3
inst✝⁵ : Field F
inst✝⁴ : NumberField K
inst✝³ : Algebra k K
inst✝² : Algebra k F
inst✝¹ : Algebra K F
inst✝ : IsScalarTower k K F
σ : K ≃ₐ[k] K
w : InfinitePlace K
h₁ : ¬(w.comap (algebraMap k K)).IsReal
h₂ : w.IsReal
\u22a2 False
-- Mathlib/LinearAlgebra/CliffordAlgebra/Basic.lean
R : Type u_1
inst✝¹⁰ : CommRing R
M : Type u_2
inst✝⁹ : AddCommGroup M
inst✝⁸ : Module R M
Q : QuadraticForm R M
n : ℕ
A : Type u_3
inst✝⁷ : Semiring A
inst✝⁶ : Algebra R A
M₁ : Type u_4
M₂ : Type u_5
M₃ : Type u_6
inst✝⁵ : AddCommGroup M₁
inst✝⁴ : AddCommGroup M₂
inst✝³ : AddCommGroup M₃
inst✝² : Module R M₁
inst✝¹ : Module R M₂
inst✝ : Module R M₃
Q₁ : QuadraticForm R M₁
Q₂ : QuadraticForm R M₂
Q₃ : QuadraticForm R M₃
f : Q₂ →qᵢ Q₃
g : Q₁ →qᵢ Q₂
m : M₁
\u22a2 (((map f).comp (map g)).toLinearMap ∘ₗ ι Q₁) m = ((map (f.comp g)).toLinearMap ∘ₗ ι Q₁) m
-- Mathlib/LinearAlgebra/CliffordAlgebra/Basic.lean
R : Type u_1
inst✝¹⁰ : CommRing R
M : Type u_2
inst✝⁹ : AddCommGroup M
inst✝⁸ : Module R M
Q : QuadraticForm R M
n : ℕ
A : Type u_3
inst✝⁷ : Semiring A
inst✝⁶ : Algebra R A
M₁ : Type u_4
M₂ : Type u_5
M₃ : Type u_6
inst✝⁵ : AddCommGroup M₁
inst✝⁴ : AddCommGroup M₂
inst✝³ : AddCommGroup M₃
inst✝² : Module R M₁
inst✝¹ : Module R M₂
inst✝ : Module R M₃
Q₁ : QuadraticForm R M₁
Q₂ : QuadraticForm R M₂
Q₃ : QuadraticForm R M₃
f : Q₂ →qᵢ Q₃
g : Q₁ →qᵢ Q₂
m : M₁
\u22a2 (map f) ((map g) ((ι Q₁) m)) = (map (f.comp g)) ((ι Q₁) m)
-- Mathlib/FieldTheory/IsAlgClosed/Spectrum.lean
𝕜 : Type u
A : Type v
inst✝⁴ : Field 𝕜
inst✝³ : Ring A
inst✝² : Algebra 𝕜 A
inst✝¹ : IsAlgClosed 𝕜
inst✝ : Nontrivial A
I : FiniteDimensional 𝕜 A
a : A
\u22a2 (σ a).Nonempty
-- Mathlib/FieldTheory/IsAlgClosed/Spectrum.lean
𝕜 : Type u
A : Type v
inst✝⁴ : Field 𝕜
inst✝³ : Ring A
inst✝² : Algebra 𝕜 A
inst✝¹ : IsAlgClosed 𝕜
inst✝ : Nontrivial A
I : FiniteDimensional 𝕜 A
a : A
p : 𝕜[X]
h_mon : p.Monic
h_eval_p : eval₂ ↑ₐ a p = 0
\u22a2 (σ a).Nonempty
-- Mathlib/FieldTheory/IsAlgClosed/Spectrum.lean
𝕜 : Type u
A : Type v
inst✝⁴ : Field 𝕜
inst✝³ : Ring A
inst✝² : Algebra 𝕜 A
inst✝¹ : IsAlgClosed 𝕜
inst✝ : Nontrivial A
I : FiniteDimensional 𝕜 A
a : A
p : 𝕜[X]
h_mon : p.Monic
h_eval_p : eval₂ ↑ₐ a p = 0
nu : ¬IsUnit ((aeval a) p)
\u22a2 (σ a).Nonempty
-- Mathlib/FieldTheory/IsAlgClosed/Spectrum.lean
𝕜 : Type u
A : Type v
inst✝⁴ : Field 𝕜
inst✝³ : Ring A
inst✝² : Algebra 𝕜 A
inst✝¹ : IsAlgClosed 𝕜
inst✝ : Nontrivial A
I : FiniteDimensional 𝕜 A
a : A
p : 𝕜[X]
h_mon : p.Monic
h_eval_p : eval₂ ↑ₐ a p = 0
nu : ¬IsUnit ((aeval a) (Multiset.map (fun a => X - C a) p.roots).prod)
\u22a2 (σ a).Nonempty
-- Mathlib/FieldTheory/IsAlgClosed/Spectrum.lean
𝕜 : Type u
A : Type v
inst✝⁴ : Field 𝕜
inst✝³ : Ring A
inst✝² : Algebra 𝕜 A
inst✝¹ : IsAlgClosed 𝕜
inst✝ : Nontrivial A
I : FiniteDimensional 𝕜 A
a : A
p : 𝕜[X]
h_mon : p.Monic
h_eval_p : eval₂ ↑ₐ a p = 0
nu : ¬IsUnit ((aeval a) (Multiset.map (fun a => X - C a) p.roots).prod)
k : 𝕜
hk : k ∈ σ a
right✝ : eval k p = 0
\u22a2 (σ a).Nonempty
-- Mathlib/Analysis/Calculus/TangentCone.lean
𝕜 : Type u_1
inst✝⁶ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝⁵ : NormedAddCommGroup E
inst✝⁴ : NormedSpace 𝕜 E
F : Type u_3
inst✝³ : NormedAddCommGroup F
inst✝² : NormedSpace 𝕜 F
G : Type u_4
inst✝¹ : NormedAddCommGroup G
inst✝ : NormedSpace ℝ G
x y : E
s t : Set E
h : s ∈ 𝓝 x
\u22a2 UniqueDiffWithinAt 𝕜 s x
-- Mathlib/CategoryTheory/Filtered/Final.lean
C : Type u₁
inst✝² : Category.{v₁, u₁} C
D : Type u₂
inst✝¹ : Category.{v₂, u₂} D
F : C ⥤ D
inst✝ : IsFilteredOrEmpty C
h₁ : ∀ (d : D), ∃ c, Nonempty (d ⟶ F.obj c)
h₂ : ∀ {d : D} {c : C} (s s' : d ⟶ F.obj c), ∃ c' t, s ≫ F.map t = s' ≫ F.map t
\u22a2 F.Final
-- Mathlib/CategoryTheory/Filtered/Final.lean
C : Type u₁
inst✝² : Category.{v₁, u₁} C
D : Type u₂
inst✝¹ : Category.{v₂, u₂} D
F : C ⥤ D
inst✝ : IsFilteredOrEmpty C
h₁ : ∀ (d : D), ∃ c, Nonempty (d ⟶ F.obj c)
h₂ : ∀ {d : D} {c : C} (s s' : d ⟶ F.obj c), ∃ c' t, s ≫ F.map t = s' ≫ F.map t
\u22a2 ∀ (d : D), IsFiltered (StructuredArrow d F)
-- Mathlib/Combinatorics/Additive/ErdosGinzburgZiv.lean
ι : Type u_1
n : ℕ
s : Finset ι
a : ι → ZMod n
hs : 2 * n - 1 ≤ s.card
\u22a2 ∃ t ⊆ s, t.card = n ∧ ∑ i ∈ t, a i = 0
-- Mathlib/Algebra/MvPolynomial/Monad.lean
σ : Type u_1
τ : Type u_2
R : Type u_3
S : Type u_4
T : Type u_5
inst✝² : CommSemiring R
inst✝¹ : CommSemiring S
inst✝ : CommSemiring T
f✝ : σ → MvPolynomial τ R
f : R →+* S
g : τ → S
h : σ → MvPolynomial τ R
φ : MvPolynomial σ R
\u22a2 (eval₂Hom f g) ((bind₁ h) φ) = (eval₂Hom f fun i => (eval₂Hom f g) (h i)) φ
-- Mathlib/Analysis/Complex/CauchyIntegral.lean
E : Type u
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedSpace ℂ E
inst✝ : CompleteSpace E
R : ℝ
c w : ℂ
f : ℂ → E
hf : DiffContOnCl ℂ f (ball c R)
hw : w ∈ ball c R
\u22a2 ((2 * ↑π * I)⁻¹ • ∮ (z : ℂ) in C(c, R), (z - w)⁻¹ • f z) = f w
-- Mathlib/Analysis/Complex/CauchyIntegral.lean
E : Type u
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedSpace ℂ E
inst✝ : CompleteSpace E
R : ℝ
c w : ℂ
f : ℂ → E
hf : DiffContOnCl ℂ f (ball c R)
hw : w ∈ ball c R
hR : 0 < R
\u22a2 ((2 * ↑π * I)⁻¹ • ∮ (z : ℂ) in C(c, R), (z - w)⁻¹ • f z) = f w