ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/Topology/Sheaves/LocalPredicate.lean
X : TopCat
T : ↑X → Type v
P✝ : PrelocalPredicate T
P : LocalPredicate T
ι : Type v
U : ι → Opens ↑X
sf : (i : ι) → (forget (Type v)).obj ((subpresheafToTypes P.toPrelocalPredicate).obj (op (U i)))
sf_comp : (subpresheafToTypes P.toPrelocalPredicate).IsCompatible U sf
sf' : (i : ι) → (X.presheafToTypes T).obj (op (U i)) := fun i => ↑(sf i)
sf'_comp : (X.presheafToTypes T).IsCompatible U sf'
\u22a2 ∃! s, (subpresheafToTypes P.toPrelocalPredicate).IsGluing U sf s
-- Mathlib/Topology/Sheaves/LocalPredicate.lean
X : TopCat
T : ↑X → Type v
P✝ : PrelocalPredicate T
P : LocalPredicate T
ι : Type v
U : ι → Opens ↑X
sf : (i : ι) → (forget (Type v)).obj ((subpresheafToTypes P.toPrelocalPredicate).obj (op (U i)))
sf_comp : (subpresheafToTypes P.toPrelocalPredicate).IsCompatible U sf
sf' : (i : ι) → (X.presheafToTypes T).obj (op (U i)) := fun i => ↑(sf i)
sf'_comp : (X.presheafToTypes T).IsCompatible U sf'
gl : (forget (Type v)).obj ((X.sheafToTypes T).val.obj (op (iSup U)))
gl_spec : IsGluing (X.sheafToTypes T).val U sf' gl
gl_uniq : ∀ (y : (forget (Type v)).obj ((X.sheafToTypes T).val.obj (op (iSup U)))), (fun s => IsGluing (X.sheafToTypes T).val U sf' s) y → y = gl
\u22a2 ∃! s, (subpresheafToTypes P.toPrelocalPredicate).IsGluing U sf s
-- Mathlib/MeasureTheory/Decomposition/SignedHahn.lean
α : Type u_1
β : Type u_2
inst✝³ : MeasurableSpace α
M : Type u_3
inst✝² : AddCommMonoid M
inst✝¹ : TopologicalSpace M
inst✝ : OrderedAddCommMonoid M
s : SignedMeasure α
i j : Set α
hi₁ : MeasurableSet i
hi₂ : ↑s i < 0
h : ¬restrict s i ≤ restrict 0 i
hn : ∃ n, restrict s (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
k : ℕ := Nat.find hn
\u22a2 ∃ j, MeasurableSet j ∧ j ⊆ i ∧ restrict s j ≤ restrict 0 j ∧ ↑s j < 0
-- Mathlib/MeasureTheory/Decomposition/SignedHahn.lean
α : Type u_1
β : Type u_2
inst✝³ : MeasurableSpace α
M : Type u_3
inst✝² : AddCommMonoid M
inst✝¹ : TopologicalSpace M
inst✝ : OrderedAddCommMonoid M
s : SignedMeasure α
i j : Set α
hi₁ : MeasurableSet i
hi₂ : ↑s i < 0
h : ¬restrict s i ≤ restrict 0 i
hn : ∃ n, restrict s (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
k : ℕ := Nat.find hn
hk₂ : restrict s (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
\u22a2 ∃ j, MeasurableSet j ∧ j ⊆ i ∧ restrict s j ≤ restrict 0 j ∧ ↑s j < 0
-- Mathlib/MeasureTheory/Decomposition/SignedHahn.lean
α : Type u_1
β : Type u_2
inst✝³ : MeasurableSpace α
M : Type u_3
inst✝² : AddCommMonoid M
inst✝¹ : TopologicalSpace M
inst✝ : OrderedAddCommMonoid M
s : SignedMeasure α
i j : Set α
hi₁ : MeasurableSet i
hi₂ : ↑s i < 0
h : ¬restrict s i ≤ restrict 0 i
hn : ∃ n, restrict s (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
k : ℕ := Nat.find hn
hk₂ : restrict s (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
hmeas : MeasurableSet (⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
\u22a2 ∃ j, MeasurableSet j ∧ j ⊆ i ∧ restrict s j ≤ restrict 0 j ∧ ↑s j < 0
-- Mathlib/MeasureTheory/Decomposition/SignedHahn.lean
α : Type u_1
β : Type u_2
inst✝³ : MeasurableSpace α
M : Type u_3
inst✝² : AddCommMonoid M
inst✝¹ : TopologicalSpace M
inst✝ : OrderedAddCommMonoid M
s : SignedMeasure α
i j : Set α
hi₁ : MeasurableSet i
hi₂ : ↑s i < 0
h : ¬restrict s i ≤ restrict 0 i
hn : ∃ n, restrict s (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
k : ℕ := Nat.find hn
hk₂ : restrict s (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
hmeas : MeasurableSet (⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
\u22a2 ↑s (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) < 0
-- Mathlib/MeasureTheory/Decomposition/SignedHahn.lean
α : Type u_1
β : Type u_2
inst✝³ : MeasurableSpace α
M : Type u_3
inst✝² : AddCommMonoid M
inst✝¹ : TopologicalSpace M
inst✝ : OrderedAddCommMonoid M
s : SignedMeasure α
i j : Set α
hi₁ : MeasurableSet i
hi₂ : ↑s i < 0
h : ¬restrict s i ≤ restrict 0 i
hn : ∃ n, restrict s (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
k : ℕ := Nat.find hn
hk₂ : restrict s (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
hmeas : MeasurableSet (⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
\u22a2 ↑s i - ∑' (i_1 : ℕ), ↑s (⋃ (_ : i_1 < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i i_1) < 0
-- Mathlib/MeasureTheory/Decomposition/SignedHahn.lean
α : Type u_1
β : Type u_2
inst✝³ : MeasurableSpace α
M : Type u_3
inst✝² : AddCommMonoid M
inst✝¹ : TopologicalSpace M
inst✝ : OrderedAddCommMonoid M
s : SignedMeasure α
i j : Set α
hi₁ : MeasurableSet i
hi₂ : ↑s i < 0
h : ¬restrict s i ≤ restrict 0 i
hn : ∃ n, restrict s (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
k : ℕ := Nat.find hn
hk₂ : restrict s (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
hmeas : MeasurableSet (⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
\u22a2 ∀ (i_1 : ℕ), MeasurableSet (⋃ (_ : i_1 < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i i_1)
-- Mathlib/MeasureTheory/Decomposition/SignedHahn.lean
α : Type u_1
β : Type u_2
inst✝³ : MeasurableSpace α
M : Type u_3
inst✝² : AddCommMonoid M
inst✝¹ : TopologicalSpace M
inst✝ : OrderedAddCommMonoid M
s : SignedMeasure α
i j : Set α
hi₁ : MeasurableSet i
hi₂ : ↑s i < 0
h : ¬restrict s i ≤ restrict 0 i
hn : ∃ n, restrict s (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
k : ℕ := Nat.find hn
hk₂ : restrict s (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
hmeas : MeasurableSet (⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
\u22a2 Pairwise (Disjoint on fun l => ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
-- Mathlib/MeasureTheory/Decomposition/SignedHahn.lean
α : Type u_1
β : Type u_2
inst✝³ : MeasurableSpace α
M : Type u_3
inst✝² : AddCommMonoid M
inst✝¹ : TopologicalSpace M
inst✝ : OrderedAddCommMonoid M
s : SignedMeasure α
i j : Set α
hi₁ : MeasurableSet i
hi₂ : ↑s i < 0
h : ¬restrict s i ≤ restrict 0 i
hn : ∃ n, restrict s (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < n), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
k : ℕ := Nat.find hn
hk₂ : restrict s (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l) ≤ restrict 0 (i \ ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
hmeas : MeasurableSet (⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l)
\u22a2 ⋃ l, ⋃ (_ : l < k), MeasureTheory.SignedMeasure.restrictNonposSeq s i l ⊆ i
-- Mathlib/Topology/Bornology/BoundedOperation.lean
R : Type u_1
inst✝¹ : PseudoMetricSpace R
inst✝ : Sub R
K : ℝ≥0
lip : LipschitzWith K fun p => p.1 - p.2
s t : Set R
s_bdd : Bornology.IsBounded s
t_bdd : Bornology.IsBounded t
\u22a2 Bornology.IsBounded (s - t)
-- Mathlib/Topology/Bornology/BoundedOperation.lean
R : Type u_1
inst✝¹ : PseudoMetricSpace R
inst✝ : Sub R
K : ℝ≥0
lip : LipschitzWith K fun p => p.1 - p.2
s t : Set R
s_bdd : Bornology.IsBounded s
t_bdd : Bornology.IsBounded t
bdd : Bornology.IsBounded (s ×ˢ t)
\u22a2 Bornology.IsBounded (s - t)
-- Mathlib/Topology/Bornology/BoundedOperation.lean
R : Type u_1
inst✝¹ : PseudoMetricSpace R
inst✝ : Sub R
K : ℝ≥0
lip : LipschitzWith K fun p => p.1 - p.2
s t : Set R
s_bdd : Bornology.IsBounded s
t_bdd : Bornology.IsBounded t
bdd : Bornology.IsBounded (s ×ˢ t)
\u22a2 s - t = (fun p => p.1 - p.2) '' s ×ˢ t
-- Mathlib/Topology/Bornology/BoundedOperation.lean
R : Type u_1
inst✝¹ : PseudoMetricSpace R
inst✝ : Sub R
K : ℝ≥0
lip : LipschitzWith K fun p => p.1 - p.2
s t : Set R
s_bdd : Bornology.IsBounded s
t_bdd : Bornology.IsBounded t
bdd : Bornology.IsBounded (s ×ˢ t)
p : R
\u22a2 p ∈ s - t ↔ p ∈ (fun p => p.1 - p.2) '' s ×ˢ t
-- Mathlib/Topology/Bornology/BoundedOperation.lean
R : Type u_1
inst✝¹ : PseudoMetricSpace R
inst✝ : Sub R
K : ℝ≥0
lip : LipschitzWith K fun p => p.1 - p.2
s t : Set R
s_bdd : Bornology.IsBounded s
t_bdd : Bornology.IsBounded t
bdd : Bornology.IsBounded (s ×ˢ t)
p : R
\u22a2 p ∈ s - t ↔ ∃ a b, (a ∈ s ∧ b ∈ t) ∧ a - b = p
-- Mathlib/Data/Nat/Defs.lean
a b c d m n k : ℕ
p q : ℕ → Prop
\u22a2 m ≤ n + 1 ↔ m ≤ n ∨ m = n + 1
-- Mathlib/Algebra/Order/CompleteField.lean
F : Type u_1
α : Type u_2
β : Type u_3
γ : Type u_4
inst✝³ : LinearOrderedField α
inst✝² : ConditionallyCompleteLinearOrderedField β
inst✝¹ : ConditionallyCompleteLinearOrderedField γ
inst✝ : Archimedean α
a : α
b : β
q : ℚ
x y : α
\u22a2 inducedMap α β (x + y) = inducedMap α β x + inducedMap α β y
-- Mathlib/Algebra/Order/CompleteField.lean
F : Type u_1
α : Type u_2
β : Type u_3
γ : Type u_4
inst✝³ : LinearOrderedField α
inst✝² : ConditionallyCompleteLinearOrderedField β
inst✝¹ : ConditionallyCompleteLinearOrderedField γ
inst✝ : Archimedean α
a : α
b : β
q : ℚ
x y : α
\u22a2 sSup (cutMap β x + cutMap β y) = inducedMap α β x + inducedMap α β y
-- Mathlib/Data/Matrix/Block.lean
l : Type u_1
m : Type u_2
n : Type u_3
o : Type u_4
p : Type u_5
q : Type u_6
m' : o → Type u_7
n' : o → Type u_8
p' : o → Type u_9
R : Type u_10
S : Type u_11
α : Type u_12
β : Type u_13
inst✝³ : DecidableEq o
inst✝² : Fintype n
inst✝¹ : Fintype o
inst✝ : NonUnitalNonAssocSemiring α
M : o → Matrix m n α
N : o → Matrix n p α
i : m
k : o
j : p
k' : o
\u22a2 blockDiagonal (fun k => M k * N k) (i, k) (j, k') = (blockDiagonal M * blockDiagonal N) (i, k) (j, k')
-- Mathlib/Data/Matrix/Block.lean
l : Type u_1
m : Type u_2
n : Type u_3
o : Type u_4
p : Type u_5
q : Type u_6
m' : o → Type u_7
n' : o → Type u_8
p' : o → Type u_9
R : Type u_10
S : Type u_11
α : Type u_12
β : Type u_13
inst✝³ : DecidableEq o
inst✝² : Fintype n
inst✝¹ : Fintype o
inst✝ : NonUnitalNonAssocSemiring α
M : o → Matrix m n α
N : o → Matrix n p α
i : m
k : o
j : p
k' : o
\u22a2 (if k = k' then ∑ j_1 : n, M k i j_1 * N k j_1 j else 0) = ∑ x : n, ∑ x_1 : o, (if k = x_1 then M k i x else 0) * if x_1 = k' then N x_1 x j else 0
-- Mathlib/Topology/UniformSpace/Basic.lean
α : Type ua
β : Type ub
γ : Type uc
δ : Type ud
ι : Sort u_1
inst✝ : UniformSpace α
x : α
S : Set α
V : Set (α × α)
x_in : x ∈ S
V_in : V ∈ 𝓤 α ⊓ 𝓟 (S ×ˢ S)
\u22a2 ball x V ∈ 𝓝[S] x
-- Mathlib/Topology/UniformSpace/Basic.lean
α : Type ua
β : Type ub
γ : Type uc
δ : Type ud
ι : Sort u_1
inst✝ : UniformSpace α
x : α
S : Set α
V : Set (α × α)
x_in : x ∈ S
V_in : V ∈ 𝓤 α ⊓ 𝓟 (S ×ˢ S)
\u22a2 ∃ t ∈ 𝓤 α ⊓ 𝓟 (S ×ˢ S), Prod.mk x ⁻¹' t ⊆ ball x V
-- Mathlib/NumberTheory/ADEInequality.lean
r : ℕ+
H : 1 < sumInv {2, 3, r}
h6 : 0 < 6
\u22a2 r < 6
-- Mathlib/NumberTheory/ADEInequality.lean
r : ℕ+
h6 : 0 < 6
H : 6 ≤ r
\u22a2 sumInv {2, 3, r} ≤ 1
-- Mathlib/NumberTheory/ADEInequality.lean
r : ℕ+
h6 : 0 < 6
H : 6 ≤ r
\u22a2 (↑↑2)⁻¹ + (↑↑3)⁻¹ + (↑↑r)⁻¹ ≤ 1
-- Mathlib/NumberTheory/ADEInequality.lean
r : ℕ+
h6 : 0 < 6
H : 6 ≤ r
hr : (↑↑r)⁻¹ ≤ 6⁻¹
\u22a2 (↑↑2)⁻¹ + (↑↑3)⁻¹ + (↑↑r)⁻¹ ≤ 1
-- Mathlib/AlgebraicTopology/SplitSimplicialObject.lean
C : Type u_1
inst✝ : Category.{u_2, u_1} C
X Y : SimplicialObject C
s : Splitting X
Z : C
Δ : SimplexCategoryᵒᵖ
F : (A : IndexSet Δ) → s.N (unop A.fst).len ⟶ Z
A : IndexSet Δ
\u22a2 (s.cofan Δ).inj A ≫ s.desc Δ F = F A
-- Mathlib/Analysis/Convex/Between.lean
R : Type u_1
V : Type u_2
V' : Type u_3
P : Type u_4
P' : Type u_5
inst✝³ : LinearOrderedField R
inst✝² : AddCommGroup V
inst✝¹ : Module R V
inst✝ : AddTorsor V P
x y z : P
\u22a2 Wbtw R x y z ↔ SameRay R (y -ᵥ x) (z -ᵥ y)
-- Mathlib/Analysis/Convex/Between.lean
R : Type u_1
V : Type u_2
V' : Type u_3
P : Type u_4
P' : Type u_5
inst✝³ : LinearOrderedField R
inst✝² : AddCommGroup V
inst✝¹ : Module R V
inst✝ : AddTorsor V P
x y z : P
h : SameRay R (y -ᵥ x) (z -ᵥ y)
\u22a2 Wbtw R x y z
-- Mathlib/Data/Complex/Abs.lean
z : ℂ
hz : z = 0
\u22a2 |z.re / abs z| ≤ 1
-- Mathlib/Data/Complex/Abs.lean
z : ℂ
hz : ¬z = 0
\u22a2 |z.re / abs z| ≤ 1
-- Mathlib/Computability/PartrecCode.lean
cf cg : Code
\u22a2 encode cf < encode (cf.comp cg) ∧ encode cg < encode (cf.comp cg)
-- Mathlib/Computability/PartrecCode.lean
cf cg : Code
this : encode (cf.pair cg) < encode (cf.comp cg)
\u22a2 encode cf < encode (cf.comp cg) ∧ encode cg < encode (cf.comp cg)
-- Mathlib/Topology/Baire/Lemmas.lean
X : Type u_1
α : Type u_2
ι : Sort u_3
inst✝¹ : TopologicalSpace X
inst✝ : BaireSpace X
s t : Set X
ts : t ⊆ s
ho : IsGδ t
hd : Dense t
\u22a2 s ∈ residual X
-- Mathlib/Data/Set/Image.lean
α : Type u_1
β : Type u_2
γ : Type u_3
ι : Sort u_4
ι' : Sort u_5
f : α → β
s t : Set α
p : Set β → Prop
\u22a2 (∀ t ⊆ f '' s, p t) ↔ ∀ t ⊆ s, p (f '' t)
-- Mathlib/Analysis/Complex/CauchyIntegral.lean
E : Type u
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedSpace ℂ E
inst✝ : CompleteSpace E
s : Set ℂ
f : ℂ → E
z : ℂ
hd : DifferentiableOn ℂ f s
hz : s ∈ 𝓝 z
\u22a2 AnalyticAt ℂ f z
-- Mathlib/Analysis/Complex/CauchyIntegral.lean
E : Type u
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedSpace ℂ E
inst✝ : CompleteSpace E
s : Set ℂ
f : ℂ → E
z : ℂ
hd : DifferentiableOn ℂ f s
hz : s ∈ 𝓝 z
R : ℝ
hR0 : 0 < R
hRs : closedBall z R ⊆ s
\u22a2 AnalyticAt ℂ f z
-- Mathlib/Analysis/Complex/CauchyIntegral.lean
E : Type u
inst✝² : NormedAddCommGroup E
inst✝¹ : NormedSpace ℂ E
inst✝ : CompleteSpace E
s : Set ℂ
f : ℂ → E
z : ℂ
hd : DifferentiableOn ℂ f s
hz : s ∈ 𝓝 z
R : ℝ≥0
hR0 : 0 < ↑R
hRs : closedBall z ↑R ⊆ s
\u22a2 AnalyticAt ℂ f z
-- Mathlib/Data/Fintype/Basic.lean
α : Type u_1
β : Type u_2
γ : Type u_3
inst✝¹ : Fintype α
s t : Finset α
inst✝ : DecidableEq α
a x : α
\u22a2 insert x {x}ᶜ = univ
-- Mathlib/Analysis/Normed/Module/FiniteDimension.lean
𝕜 : Type u
inst✝¹¹ : NontriviallyNormedField 𝕜
E : Type v
inst✝¹⁰ : NormedAddCommGroup E
inst✝⁹ : NormedSpace 𝕜 E
F : Type w
inst✝⁸ : NormedAddCommGroup F
inst✝⁷ : NormedSpace 𝕜 F
F' : Type x
inst✝⁶ : AddCommGroup F'
inst✝⁵ : Module 𝕜 F'
inst✝⁴ : TopologicalSpace F'
inst✝³ : TopologicalAddGroup F'
inst✝² : ContinuousSMul 𝕜 F'
inst✝¹ : CompleteSpace 𝕜
ι : Type u_1
inst✝ : Fintype ι
v : Basis ι 𝕜 E
u : E →L[𝕜] F
M : ℝ
hM : 0 ≤ M
hu : ∀ (i : ι), ‖u (v i)‖ ≤ M
\u22a2 ‖u‖ ≤ Fintype.card ι • ‖↑v.equivFunL‖ * M
-- Mathlib/Order/Filter/Basic.lean
α : Type u
β : Type v
γ : Type w
δ : Type u_1
ι : Sort x
l : Filter α
f : α → β
a : Filter α
b : β
\u22a2 Tendsto f a (pure b) ↔ ∀ᶠ (x : α) in a, f x = b
-- Mathlib/Algebra/BigOperators/Group/Finset.lean
ι : Type u_1
κ : Type u_2
α : Type u_3
β : Type u_4
γ : Type u_5
s s₁ s₂ : Finset α
a : α
f✝ g : α → β
inst✝¹ : CommMonoid β
M : Type u_6
inst✝ : CommGroup M
f : ℕ → M
n : ℕ
\u22a2 f n = f 0 * ∏ i ∈ range n, f (i + 1) / f i
-- Mathlib/NumberTheory/FLT/Four.lean
a b c : ℤ
h : Fermat42 a b c
\u22a2 ∃ a0 b0 c0, Minimal a0 b0 c0 ∧ a0 % 2 = 1 ∧ 0 < c0
-- Mathlib/NumberTheory/FLT/Four.lean
a b c : ℤ
h : Fermat42 a b c
a0 b0 c0 : ℤ
hf : Minimal a0 b0 c0
hc : a0 % 2 = 1
\u22a2 ∃ a0 b0 c0, Minimal a0 b0 c0 ∧ a0 % 2 = 1 ∧ 0 < c0
-- Mathlib/NumberTheory/FLT/Four.lean
a b c : ℤ
h : Fermat42 a b c
a0 b0 c0 : ℤ
hf : Minimal a0 b0 c0
hc : a0 % 2 = 1
h1 : 0 < c0
\u22a2 ∃ a0 b0 c0, Minimal a0 b0 c0 ∧ a0 % 2 = 1 ∧ 0 < c0
-- Mathlib/NumberTheory/FLT/Four.lean
a b c : ℤ
h : Fermat42 a b c
a0 b0 c0 : ℤ
hf : Minimal a0 b0 c0
hc : a0 % 2 = 1
h1 : 0 = c0
\u22a2 ∃ a0 b0 c0, Minimal a0 b0 c0 ∧ a0 % 2 = 1 ∧ 0 < c0
-- Mathlib/NumberTheory/FLT/Four.lean
a b c : ℤ
h : Fermat42 a b c
a0 b0 c0 : ℤ
hf : Minimal a0 b0 c0
hc : a0 % 2 = 1
h1 : c0 < 0
\u22a2 ∃ a0 b0 c0, Minimal a0 b0 c0 ∧ a0 % 2 = 1 ∧ 0 < c0
-- Mathlib/Analysis/SpecialFunctions/NonIntegrable.lean
E : Type u_1
F : Type u_2
inst✝⁴ : NormedAddCommGroup E
inst✝³ : NormedSpace ℝ E
inst✝² : NormedAddCommGroup F
f : ℝ → E
g : ℝ → F
k : Set ℝ
l : Filter ℝ
inst✝¹ : l.NeBot
inst✝ : TendstoIxxClass Icc l l
hl : k ∈ l
hd : ∀ᶠ (x : ℝ) in l, DifferentiableAt ℝ f x
hf : Tendsto (fun x => ‖f x‖) l atTop
hfg : deriv f =O[l] g
a : E →ₗᵢ[ℝ] UniformSpace.Completion E := UniformSpace.Completion.toComplₗᵢ
f' : ℝ → UniformSpace.Completion E := ⇑a ∘ f
\u22a2 ¬IntegrableOn g k volume
-- Mathlib/Analysis/SpecialFunctions/NonIntegrable.lean
E : Type u_1
F : Type u_2
inst✝⁴ : NormedAddCommGroup E
inst✝³ : NormedSpace ℝ E
inst✝² : NormedAddCommGroup F
f : ℝ → E
g : ℝ → F
k : Set ℝ
l : Filter ℝ
inst✝¹ : l.NeBot
inst✝ : TendstoIxxClass Icc l l
hl : k ∈ l
hd : ∀ᶠ (x : ℝ) in l, DifferentiableAt ℝ f x
hf : Tendsto (fun x => ‖f x‖) l atTop
hfg : deriv f =O[l] g
a : E →ₗᵢ[ℝ] UniformSpace.Completion E := UniformSpace.Completion.toComplₗᵢ
f' : ℝ → UniformSpace.Completion E := ⇑a ∘ f
h'd : ∀ᶠ (x : ℝ) in l, DifferentiableAt ℝ f' x
\u22a2 ¬IntegrableOn g k volume
-- Mathlib/Analysis/SpecialFunctions/NonIntegrable.lean
E : Type u_1
F : Type u_2
inst✝⁴ : NormedAddCommGroup E
inst✝³ : NormedSpace ℝ E
inst✝² : NormedAddCommGroup F
f : ℝ → E
g : ℝ → F
k : Set ℝ
l : Filter ℝ
inst✝¹ : l.NeBot
inst✝ : TendstoIxxClass Icc l l
hl : k ∈ l
hd : ∀ᶠ (x : ℝ) in l, DifferentiableAt ℝ f x
hf : Tendsto (fun x => ‖f x‖) l atTop
hfg : deriv f =O[l] g
a : E →ₗᵢ[ℝ] UniformSpace.Completion E := UniformSpace.Completion.toComplₗᵢ
f' : ℝ → UniformSpace.Completion E := ⇑a ∘ f
h'd : ∀ᶠ (x : ℝ) in l, DifferentiableAt ℝ f' x
h'f : Tendsto (fun x => ‖f' x‖) l atTop
\u22a2 ¬IntegrableOn g k volume
-- Mathlib/Analysis/SpecialFunctions/NonIntegrable.lean
E : Type u_1
F : Type u_2
inst✝⁴ : NormedAddCommGroup E
inst✝³ : NormedSpace ℝ E
inst✝² : NormedAddCommGroup F
f : ℝ → E
g : ℝ → F
k : Set ℝ
l : Filter ℝ
inst✝¹ : l.NeBot
inst✝ : TendstoIxxClass Icc l l
hl : k ∈ l
hd : ∀ᶠ (x : ℝ) in l, DifferentiableAt ℝ f x
hf : Tendsto (fun x => ‖f x‖) l atTop
hfg : deriv f =O[l] g
a : E →ₗᵢ[ℝ] UniformSpace.Completion E := UniformSpace.Completion.toComplₗᵢ
f' : ℝ → UniformSpace.Completion E := ⇑a ∘ f
h'd : ∀ᶠ (x : ℝ) in l, DifferentiableAt ℝ f' x
h'f : Tendsto (fun x => ‖f' x‖) l atTop
h'fg : deriv f' =O[l] g
\u22a2 ¬IntegrableOn g k volume
-- Mathlib/Data/NNRat/Defs.lean
p q : ℚ
\u22a2 0 < q.toNNRat ↔ 0 < q
-- Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean
C : Type u
inst✝ : Category.{v, u} C
X Y : C
f g : X ⟶ Y
s : Cofork f g
\u22a2 s.ι.app zero = f ≫ s.π
-- Mathlib/Data/Num/Lemmas.lean
α : Type u_1
n : ℕ
\u22a2 (↑(n + 1)).toZNumNeg = -↑(n + 1)
-- Mathlib/Data/Num/Lemmas.lean
α : Type u_1
n : ℕ
\u22a2 (↑n).toZNum.succ = (↑n).succ
-- Mathlib/LinearAlgebra/TensorAlgebra/Basic.lean
R : Type u_1
inst✝⁴ : CommSemiring R
M : Type u_2
inst✝³ : AddCommMonoid M
inst✝² : Module R M
A : Type u_3
inst✝¹ : Semiring A
inst✝ : Algebra R A
f : M →ₗ[R] A
x : M
\u22a2 ((lift R) f) ((ι R) x) = f x
-- Mathlib/LinearAlgebra/TensorAlgebra/Basic.lean
R : Type u_1
inst✝⁴ : CommSemiring R
M : Type u_2
inst✝³ : AddCommMonoid M
inst✝² : Module R M
A : Type u_3
inst✝¹ : Semiring A
inst✝ : Algebra R A
f : M →ₗ[R] A
x : M
\u22a2 ((lift R) f) ((ι R) x) = (((lift R) f).toLinearMap ∘ₗ ι R) x
-- Mathlib/Algebra/Algebra/Tower.lean
R : Type u
S : Type v
A : Type w
B : Type u₁
M : Type v₁
inst✝⁶ : Semiring R
inst✝⁵ : Semiring S
inst✝⁴ : AddCommMonoid A
inst✝³ : Module R S
inst✝² : Module S A
inst✝¹ : Module R A
inst✝ : IsScalarTower R S A
s : Set S
hs : span R s = ⊤
t : Set A
k : S
x : A
hx : x ∈ span R t
\u22a2 k • x ∈ span R (s • t)
-- Mathlib/Algebra/Algebra/Tower.lean
R : Type u
S : Type v
A : Type w
B : Type u₁
M : Type v₁
inst✝⁶ : Semiring R
inst✝⁵ : Semiring S
inst✝⁴ : AddCommMonoid A
inst✝³ : Module R S
inst✝² : Module S A
inst✝¹ : Module R A
inst✝ : IsScalarTower R S A
s : Set S
hs : span R s = ⊤
t : Set A
k : S
x : A
hx : x ∈ span R t
\u22a2 k • x ∈ restrictScalars R (span S t)
-- Mathlib/Geometry/Manifold/VectorBundle/Tangent.lean
𝕜 : Type u_1
inst✝¹⁴ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝¹³ : NormedAddCommGroup E
inst✝¹² : NormedSpace 𝕜 E
E' : Type u_3
inst✝¹¹ : NormedAddCommGroup E'
inst✝¹⁰ : NormedSpace 𝕜 E'
H : Type u_4
inst✝⁹ : TopologicalSpace H
I : ModelWithCorners 𝕜 E H
H' : Type u_5
inst✝⁸ : TopologicalSpace H'
I' : ModelWithCorners 𝕜 E' H'
M : Type u_6
inst✝⁷ : TopologicalSpace M
inst✝⁶ : ChartedSpace H M
inst✝⁵ : SmoothManifoldWithCorners I M
M' : Type u_7
inst✝⁴ : TopologicalSpace M'
inst✝³ : ChartedSpace H' M'
inst✝² : SmoothManifoldWithCorners I' M'
F : Type u_8
inst✝¹ : NormedAddCommGroup F
inst✝ : NormedSpace 𝕜 F
N : Type u_9
f : N → H
g : N → H'
ϕ : N → E →L[𝕜] E'
x₀ : N
\u22a2 inTangentCoordinates I I' f g ϕ x₀ = ϕ
-- Mathlib/Analysis/BoxIntegral/Partition/Basic.lean
ι : Type u_1
I J J₁ J₂ : Box ι
π π₁ π₂ : Prepartition I
x : ι → ℝ
πi πi₁ πi₂ : (J : Box ι) → Prepartition J
h : Disjoint π₁.iUnion π₂.iUnion
\u22a2 (π₁.disjUnion π₂ h).iUnion = π₁.iUnion ∪ π₂.iUnion
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
x y : (P F).W α
\u22a2 abs ((P F).wDest' x) = abs ((P F).wDest' y) → WEquiv x y
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
x y : (P F).W α
\u22a2 ∀ (a : (P F).A) (f' : (P F).drop.B a ⟹ α) (f : (P F).last.B a → (P F).W α), abs ((P F).wDest' ((P F).wMk a f' f)) = abs ((P F).wDest' y) → WEquiv ((P F).wMk a f' f) y
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
x y : (P F).W α
a₀ : (P F).A
f'₀ : (P F).drop.B a₀ ⟹ α
f₀ : (P F).last.B a₀ → (P F).W α
\u22a2 abs ((P F).wDest' ((P F).wMk a₀ f'₀ f₀)) = abs ((P F).wDest' y) → WEquiv ((P F).wMk a₀ f'₀ f₀) y
-- Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean
n : ℕ
F : TypeVec.{u} (n + 1) → Type u
q : MvQPF F
α : TypeVec.{u} n
x y : (P F).W α
a₀ : (P F).A
f'₀ : (P F).drop.B a₀ ⟹ α
f₀ : (P F).last.B a₀ → (P F).W α
\u22a2 ∀ (a : (P F).A) (f' : (P F).drop.B a ⟹ α) (f : (P F).last.B a → (P F).W α), abs ((P F).wDest' ((P F).wMk a₀ f'₀ f₀)) = abs ((P F).wDest' ((P F).wMk a f' f)) → WEquiv ((P F).wMk a₀ f'₀ f₀) ((P F).wMk a f' f)
-- Mathlib/AlgebraicTopology/DoldKan/SplitSimplicialObject.lean
C : Type u_1
inst✝¹ : Category.{u_2, u_1} C
X : SimplicialObject C
s : Splitting X
inst✝ : Preadditive C
j k : ℕ
A : IndexSet (op [j])
hA : ¬A.EqId
\u22a2 (s.cofan (op [j])).inj A ≫ K[X].d j k ≫ s.πSummand (IndexSet.id (op [k])) = 0
-- Mathlib/AlgebraicTopology/DoldKan/SplitSimplicialObject.lean
C : Type u_1
inst✝¹ : Category.{u_2, u_1} C
X : SimplicialObject C
s : Splitting X
inst✝ : Preadditive C
j k : ℕ
A : IndexSet (op [j])
hA : ¬Mono A.e
\u22a2 (s.cofan (op [j])).inj A ≫ K[X].d j k ≫ s.πSummand (IndexSet.id (op [k])) = 0
-- Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean
V : Type u_1
R : Type u_2
inst✝³ : Fintype V
inst✝² : DecidableEq V
G : SimpleGraph V
inst✝¹ : DecidableRel G.Adj
inst✝ : CommRing R
x : V → R
\u22a2 x ⬝ᵥ degMatrix R G *ᵥ x = ∑ i : V, ↑(G.degree i) * x i * x i
-- Mathlib/Data/Bool/Basic.lean
n m : Nat
h : n ≤ m
\u22a2 ofNat n ≤ ofNat m
-- Mathlib/Data/Bool/Basic.lean
n m : Nat
h : n ≤ m
\u22a2 (!decide (n = 0)) ≤ !decide (m = 0)