ruc-ai4math/mathlib_handler_benchmark_410 huggingface dataset:
-- Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean
Ω : Type u_1
inst✝² : Nonempty Ω
m0 : MeasurableSpace Ω
μ : FiniteMeasure Ω
inst✝¹ : TopologicalSpace Ω
inst✝ : OpensMeasurableSpace Ω
γ : Type u_2
F : Filter γ
μs : γ → FiniteMeasure Ω
μs_lim : Tendsto (fun i => (μs i).normalize) F (𝓝 μ.normalize)
mass_lim : Tendsto (fun i => (μs i).mass) F (𝓝 μ.mass)
\u22a2 ∀ (f : Ω →ᵇ ℝ≥0), Tendsto (fun i => (μs i).testAgainstNN f) F (𝓝 (μ.testAgainstNN f))
-- Mathlib/Order/Heyting/Basic.lean
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝ : GeneralizedHeytingAlgebra α
a b c d : α
\u22a2 b ⇨ c ≤ (a ⇨ b) ⇨ a ⇨ c
-- Mathlib/Order/Heyting/Basic.lean
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝ : GeneralizedHeytingAlgebra α
a b c d : α
\u22a2 c ⊓ (b ⊓ a) ≤ c
-- Mathlib/Algebra/Homology/ShortComplex/ConcreteCategory.lean
C : Type u
inst✝⁶ : Category.{v, u} C
inst✝⁵ : ConcreteCategory C
inst✝⁴ : HasForget₂ C Ab
inst✝³ : Preadditive C
inst✝² : (forget₂ C Ab).Additive
inst✝¹ : (forget₂ C Ab).PreservesHomology
inst✝ : HasZeroObject C
S : ShortComplex C
X Y : C
f : X ⟶ Y
\u22a2 Epi f ↔ Function.Surjective ((forget C).map f)
-- Mathlib/Algebra/Homology/ShortComplex/ConcreteCategory.lean
C : Type u
inst✝⁶ : Category.{v, u} C
inst✝⁵ : ConcreteCategory C
inst✝⁴ : HasForget₂ C Ab
inst✝³ : Preadditive C
inst✝² : (forget₂ C Ab).Additive
inst✝¹ : (forget₂ C Ab).PreservesHomology
inst✝ : HasZeroObject C
S : ShortComplex C
X Y : C
f : X ⟶ Y
\u22a2 Epi ⇑((forget₂ C Ab).map f) ↔ Epi ((forget C).map f)
-- Mathlib/Algebra/Homology/ShortComplex/ConcreteCategory.lean
C : Type u
inst✝⁶ : Category.{v, u} C
inst✝⁵ : ConcreteCategory C
inst✝⁴ : HasForget₂ C Ab
inst✝³ : Preadditive C
inst✝² : (forget₂ C Ab).Additive
inst✝¹ : (forget₂ C Ab).PreservesHomology
inst✝ : HasZeroObject C
S : ShortComplex C
X Y : C
f : X ⟶ Y
\u22a2 Arrow.mk ⇑((forget₂ C Ab).map f) ≅ Arrow.mk ((forget C).map f)
-- Mathlib/Algebra/Homology/ShortComplex/ConcreteCategory.lean
C : Type u
inst✝⁶ : Category.{v, u} C
inst✝⁵ : ConcreteCategory C
inst✝⁴ : HasForget₂ C Ab
inst✝³ : Preadditive C
inst✝² : (forget₂ C Ab).Additive
inst✝¹ : (forget₂ C Ab).PreservesHomology
inst✝ : HasZeroObject C
S : ShortComplex C
X Y : C
f : X ⟶ Y
e : forget₂ C Ab ⋙ forget Ab ≅ forget C
\u22a2 Arrow.mk ⇑((forget₂ C Ab).map f) ≅ Arrow.mk ((forget C).map f)
-- Mathlib/Data/Int/Bitwise.lean
a : Bool
m : ℤ
b : Bool
n : ℤ
\u22a2 (bit a m).xor (bit b n) = bit (xor a b) (m.xor n)
-- Mathlib/CategoryTheory/Triangulated/Opposite.lean
C : Type u_1
inst✝¹ : Category.{u_2, u_1} C
inst✝ : HasShift C ℤ
X : Cᵒᵖ
a₁ a₂ a₃ : ℤ
h : a₁ + a₂ = a₃
b₁ b₂ b₃ : ℤ
h₁ : a₁ + b₁ = 0
h₂ : a₂ + b₂ = 0
h₃ : a₃ + b₃ = 0
\u22a2 (shiftFunctorAdd' Cᵒᵖ a₁ a₂ a₃ h).hom.app X = (shiftFunctorOpIso C a₃ b₃ h₃).hom.app X ≫ ((shiftFunctorAdd' C b₁ b₂ b₃ ⋯).inv.app (Opposite.unop X)).op ≫ (shiftFunctorOpIso C a₂ b₂ h₂).inv.app (Opposite.op ((shiftFunctor C b₁).toPrefunctor.1 (Opposite.unop X))) ≫ (shiftFunctor Cᵒᵖ a₂).map ((shiftFunctorOpIso C a₁ b₁ h₁).inv.app X)
-- Mathlib/CategoryTheory/Triangulated/Opposite.lean
C : Type u_1
inst✝¹ : Category.{u_2, u_1} C
inst✝ : HasShift C ℤ
X : Cᵒᵖ
a₁ a₂ a₃ : ℤ
h : a₁ + a₂ = a₃
b₁ b₂ b₃ : ℤ
h₁ : a₁ + b₁ = 0
h₂ : a₂ + b₂ = 0
h₃ : a₃ + b₃ = 0
\u22a2 (pullbackShiftIso (OppositeShift C ℤ) (AddMonoidHom.mk' (fun n => -n) CategoryTheory.Pretriangulated.Opposite.OppositeShiftAux.proof_1) a₃ b₃ ⋯).hom.app X ≫ (shiftFunctorAdd' (OppositeShift C ℤ) b₁ b₂ b₃ ⋯).hom.app X ≫ (pullbackShiftIso (OppositeShift C ℤ) (AddMonoidHom.mk' (fun n => -n) CategoryTheory.Pretriangulated.Opposite.OppositeShiftAux.proof_1) a₂ b₂ ⋯).inv.app ((shiftFunctor (OppositeShift C ℤ) b₁).obj X) ≫ (shiftFunctor (PullbackShift (OppositeShift C ℤ) (AddMonoidHom.mk' (fun n => -n) CategoryTheory.Pretriangulated.Opposite.OppositeShiftAux.proof_1)) a₂).map ((pullbackShiftIso (OppositeShift C ℤ) (AddMonoidHom.mk' (fun n => -n) CategoryTheory.Pretriangulated.Opposite.OppositeShiftAux.proof_1) a₁ b₁ ⋯).inv.app X) = (shiftFunctorOpIso C a₃ b₃ h₃).hom.app X ≫ ((shiftFunctorAdd' C b₁ b₂ b₃ ⋯).inv.app (Opposite.unop X)).op ≫ (shiftFunctorOpIso C a₂ b₂ h₂).inv.app (Opposite.op ((shiftFunctor C b₁).toPrefunctor.1 (Opposite.unop X))) ≫ (shiftFunctor Cᵒᵖ a₂).map ((shiftFunctorOpIso C a₁ b₁ h₁).inv.app X)
-- Mathlib/CategoryTheory/Triangulated/Opposite.lean
C : Type u_1
inst✝¹ : Category.{u_2, u_1} C
inst✝ : HasShift C ℤ
X : Cᵒᵖ
a₁ a₂ a₃ : ℤ
h : a₁ + a₂ = a₃
b₁ b₂ b₃ : ℤ
h₁ : a₁ + b₁ = 0
h₂ : a₂ + b₂ = 0
h₃ : a₃ + b₃ = 0
\u22a2 (pullbackShiftIso (OppositeShift C ℤ) (AddMonoidHom.mk' (fun n => -n) CategoryTheory.Pretriangulated.Opposite.OppositeShiftAux.proof_1) a₃ b₃ ⋯).hom.app X ≫ ((shiftFunctorAdd' C b₁ b₂ b₃ ⋯).inv.app (Opposite.unop X)).op ≫ (pullbackShiftIso (OppositeShift C ℤ) (AddMonoidHom.mk' (fun n => -n) CategoryTheory.Pretriangulated.Opposite.OppositeShiftAux.proof_1) a₂ b₂ ⋯).inv.app ((shiftFunctor (OppositeShift C ℤ) b₁).obj X) ≫ (shiftFunctor (PullbackShift (OppositeShift C ℤ) (AddMonoidHom.mk' (fun n => -n) CategoryTheory.Pretriangulated.Opposite.OppositeShiftAux.proof_1)) a₂).map ((pullbackShiftIso (OppositeShift C ℤ) (AddMonoidHom.mk' (fun n => -n) CategoryTheory.Pretriangulated.Opposite.OppositeShiftAux.proof_1) a₁ b₁ ⋯).inv.app X) = (shiftFunctorOpIso C a₃ b₃ h₃).hom.app X ≫ ((shiftFunctorAdd' C b₁ b₂ b₃ ⋯).inv.app (Opposite.unop X)).op ≫ (shiftFunctorOpIso C a₂ b₂ h₂).inv.app (Opposite.op ((shiftFunctor C b₁).toPrefunctor.1 (Opposite.unop X))) ≫ (shiftFunctor Cᵒᵖ a₂).map ((shiftFunctorOpIso C a₁ b₁ h₁).inv.app X)
-- Mathlib/Probability/Kernel/RadonNikodym.lean
α : Type u_1
γ : Type u_2
mα : MeasurableSpace α
mγ : MeasurableSpace γ
κ✝ η✝ : Kernel α γ
hαγ : MeasurableSpace.CountableOrCountablyGenerated α γ
κ η : Kernel α γ
a : α
x : γ
\u22a2 κ.rnDeriv η a x = ⊤ ↔ x ∈ κ.mutuallySingularSetSlice η a
-- Mathlib/Algebra/Regular/Basic.lean
R : Type u_1
inst✝ : MulZeroClass R
a b : R
hb : IsLeftRegular b
\u22a2 b * a = 0 ↔ a = 0
-- Mathlib/Algebra/Regular/Basic.lean
R : Type u_1
inst✝ : MulZeroClass R
a b : R
hb : IsLeftRegular b
\u22a2 b * a = b * 0 ↔ a = 0
-- Mathlib/Algebra/Order/Monoid/Unbundled/Pow.lean
β : Type u_1
G : Type u_2
M : Type u_3
inst✝² : Monoid M
inst✝¹ : Preorder M
inst✝ : CovariantClass M M (fun x x_1 => x * x_1) fun x x_1 => x ≤ x_1
x a : M
n m : ℕ
ha : 1 ≤ a
h : n ≤ m
k : ℕ
hk : n + k = m
\u22a2 a ^ n * a ^ k = a ^ m
-- Mathlib/CategoryTheory/Monad/EquivMon.lean
C : Type u
inst✝ : Category.{v, u} C
M : Monad C
x✝ : C
\u22a2 (MonoidalCategory.whiskerRight M.μ M.toFunctor ≫ M.μ).app x✝ = ((MonoidalCategory.associator M.toFunctor M.toFunctor M.toFunctor).hom ≫ MonoidalCategory.whiskerLeft M.toFunctor M.μ ≫ M.μ).app x✝
-- Mathlib/Algebra/Category/ModuleCat/Presheaf/ChangeOfRings.lean
C : Type u'
inst✝ : Category.{v', u'} C
R R' : Cᵒᵖ ⥤ RingCat
M' : PresheafOfModules R'
α : R ⟶ R'
X Y : Cᵒᵖ
f : X ⟶ Y
r : ↑(R.obj X)
x : ↑((fun X => (ModuleCat.restrictScalars (α.app X)).obj (M'.obj X)) X)
\u22a2 { toFun := ⇑(M'.map f), map_add' := ⋯ }.toFun (r • x) = (RingHom.id ↑(R.obj X)) r • { toFun := ⇑(M'.map f), map_add' := ⋯ }.toFun x
-- Mathlib/Algebra/Category/ModuleCat/Presheaf/ChangeOfRings.lean
C : Type u'
inst✝ : Category.{v', u'} C
R R' : Cᵒᵖ ⥤ RingCat
M' : PresheafOfModules R'
α : R ⟶ R'
X Y : Cᵒᵖ
f : X ⟶ Y
r : ↑(R.obj X)
x : ↑((fun X => (ModuleCat.restrictScalars (α.app X)).obj (M'.obj X)) X)
eq : (R.map f ≫ α.app Y) r = (α.app X ≫ R'.map f) r
\u22a2 { toFun := ⇑(M'.map f), map_add' := ⋯ }.toFun (r • x) = (RingHom.id ↑(R.obj X)) r • { toFun := ⇑(M'.map f), map_add' := ⋯ }.toFun x
-- Mathlib/Algebra/Category/ModuleCat/Presheaf/ChangeOfRings.lean
C : Type u'
inst✝ : Category.{v', u'} C
R R' : Cᵒᵖ ⥤ RingCat
M' : PresheafOfModules R'
α : R ⟶ R'
X Y : Cᵒᵖ
f : X ⟶ Y
r : ↑(R.obj X)
x : ↑((fun X => (ModuleCat.restrictScalars (α.app X)).obj (M'.obj X)) X)
eq : (R.map f ≫ α.app Y) r = (α.app X ≫ R'.map f) r
\u22a2 (R'.map f) ((α.app X) r) • (M'.presheaf.map f) x = (RingHom.id ↑(R.obj X)) r • { toFun := ⇑(M'.map f), map_add' := ⋯ }.toFun x
-- Mathlib/Algebra/Category/ModuleCat/Presheaf/ChangeOfRings.lean
C : Type u'
inst✝ : Category.{v', u'} C
R R' : Cᵒᵖ ⥤ RingCat
M' : PresheafOfModules R'
α : R ⟶ R'
X : Cᵒᵖ
x : ↑((fun X => (ModuleCat.restrictScalars (α.app X)).obj (M'.obj X)) X)
\u22a2 ((fun {X Y} f => { toFun := ⇑(M'.map f), map_add' := ⋯, map_smul' := ⋯ }) (𝟙 X)) x = ((ModuleCat.restrictScalarsId' (R.map (𝟙 X)) ⋯).inv.app ((fun X => (ModuleCat.restrictScalars (α.app X)).obj (M'.obj X)) X)) x
-- Mathlib/Algebra/Category/ModuleCat/Presheaf/ChangeOfRings.lean
C : Type u'
inst✝ : Category.{v', u'} C
R R' : Cᵒᵖ ⥤ RingCat
M' : PresheafOfModules R'
α : R ⟶ R'
X✝ Y✝ Z✝ : Cᵒᵖ
f : X✝ ⟶ Y✝
g : Y✝ ⟶ Z✝
x : ↑((fun X => (ModuleCat.restrictScalars (α.app X)).obj (M'.obj X)) X✝)
\u22a2 ((fun {X Y} f => { toFun := ⇑(M'.map f), map_add' := ⋯, map_smul' := ⋯ }) (f ≫ g)) x = ((fun {X Y} f => { toFun := ⇑(M'.map f), map_add' := ⋯, map_smul' := ⋯ }) f ≫ (ModuleCat.restrictScalars (R.map f)).map ((fun {X Y} f => { toFun := ⇑(M'.map f), map_add' := ⋯, map_smul' := ⋯ }) g) ≫ (ModuleCat.restrictScalarsComp' (R.map f) (R.map g) (R.map (f ≫ g)) ⋯).inv.app ((fun X => (ModuleCat.restrictScalars (α.app X)).obj (M'.obj X)) Z✝)) x
-- Mathlib/Algebra/Free.lean
α : Type u
β : Type v
inst✝ : Mul β
f g : FreeSemigroup α →ₙ* β
h : ⇑f ∘ of = ⇑g ∘ of
x✝ : FreeSemigroup α
x : α
y : FreeSemigroup α
hx : f (of x) = g (of x)
hy : f y = g y
\u22a2 f (of x * y) = g (of x * y)
-- Mathlib/RepresentationTheory/Rep.lean
k G : Type u
inst✝¹ : CommRing k
inst✝ : Monoid G
V : Rep k G
g : G
x : CoeSort.coe V
\u22a2 (RestrictScalars.addEquiv k (MonoidAlgebra k G) V.ρ.asModule).symm (V.ρ.asModuleEquiv.symm ((V.ρ g) x)) = ((Representation.ofModule ↑(ModuleCat.of (MonoidAlgebra k G) V.ρ.asModule)) g) ((RestrictScalars.addEquiv k (MonoidAlgebra k G) V.ρ.asModule).symm (V.ρ.asModuleEquiv.symm x))
-- Mathlib/RepresentationTheory/Rep.lean
k G : Type u
inst✝¹ : CommRing k
inst✝ : Monoid G
V : Rep k G
g : G
x : CoeSort.coe V
\u22a2 (MonoidAlgebra.of k G) g • V.ρ.asModuleEquiv.symm x = ((Representation.ofModule ↑(ModuleCat.of (MonoidAlgebra k G) V.ρ.asModule)) g) ((RestrictScalars.addEquiv k (MonoidAlgebra k G) V.ρ.asModule).symm (V.ρ.asModuleEquiv.symm x))
-- Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean
P : MorphismProperty Scheme
Q : {R S : Type u} → [inst : CommRing R] → [inst_1 : CommRing S] → (R →+* S) → Prop
inst✝¹ : HasRingHomProperty P Q
X Y Z : Scheme
f : X ⟶ Y
g : Y ⟶ Z
inst✝ : IsAffine Y
ι : Type u_1
U : ι → ↑X.affineOpens
hU : ⨆ i, ↑(U i) = ⊤
H : ∀ (i : ι), Q (Scheme.Hom.appLE f ⊤ ↑(U i) ⋯)
\u22a2 P f
-- Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean
P : MorphismProperty Scheme
Q : {R S : Type u} → [inst : CommRing R] → [inst_1 : CommRing S] → (R →+* S) → Prop
inst✝¹ : HasRingHomProperty P Q
X Y Z : Scheme
f : X ⟶ Y
g : Y ⟶ Z
inst✝ : IsAffine Y
ι : Type u_1
U : ι → ↑X.affineOpens
hU : ⨆ i, ↑(U i) = ⊤
H : ∀ (i : ι), Q (Scheme.Hom.appLE f ⊤ ↑(U i) ⋯)
this : ∀ (i : (X.openCoverOfISupEqTop (fun i => ↑(U i)) hU).J), IsAffine ((X.openCoverOfISupEqTop (fun i => ↑(U i)) hU).obj i)
\u22a2 P f
-- Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean
P : MorphismProperty Scheme
Q : {R S : Type u} → [inst : CommRing R] → [inst_1 : CommRing S] → (R →+* S) → Prop
inst✝¹ : HasRingHomProperty P Q
X Y Z : Scheme
f : X ⟶ Y
g : Y ⟶ Z
inst✝ : IsAffine Y
ι : Type u_1
U : ι → ↑X.affineOpens
hU : ⨆ i, ↑(U i) = ⊤
H : ∀ (i : ι), Q (Scheme.Hom.appLE f ⊤ ↑(U i) ⋯)
this : ∀ (i : (X.openCoverOfISupEqTop (fun i => ↑(U i)) hU).J), IsAffine ((X.openCoverOfISupEqTop (fun i => ↑(U i)) hU).obj i)
i : (X.openCoverOfISupEqTop (fun i => ↑(U i)) hU).J
\u22a2 Q (Scheme.Hom.app ((X.openCoverOfISupEqTop (fun i => ↑(U i)) hU).map i ≫ f) ⊤)
-- Mathlib/Algebra/Order/CauSeq/Completion.lean
α : Type u_1
inst✝³ : LinearOrderedField α
β : Type u_2
inst✝² : Ring β
abv : β → α
inst✝¹ : IsAbsoluteValue abv
inst✝ : IsComplete β abv
f : CauSeq β abv
\u22a2 (-f - const abv (-f.lim)).LimZero
-- Mathlib/Algebra/Order/CauSeq/Completion.lean
α : Type u_1
inst✝³ : LinearOrderedField α
β : Type u_2
inst✝² : Ring β
abv : β → α
inst✝¹ : IsAbsoluteValue abv
inst✝ : IsComplete β abv
f : CauSeq β abv
\u22a2 (const abv f.lim - f).LimZero
-- Mathlib/SetTheory/Cardinal/Basic.lean
α β : Type u
a : Cardinal.{u}
\u22a2 0 < lift.{v, u} a ↔ 0 < a
-- Mathlib/Analysis/Calculus/Implicit.lean
𝕜 : Type u_1
inst✝⁹ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝⁸ : NormedAddCommGroup E
inst✝⁷ : NormedSpace 𝕜 E
inst✝⁶ : CompleteSpace E
F : Type u_3
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
inst✝³ : CompleteSpace F
G : Type u_4
inst✝² : NormedAddCommGroup G
inst✝¹ : NormedSpace 𝕜 G
inst✝ : CompleteSpace G
φ : ImplicitFunctionData 𝕜 E F G
g'inv : G →L[𝕜] E
hg'inv : φ.rightDeriv.comp g'inv = ContinuousLinearMap.id 𝕜 G
hg'invf : φ.leftDeriv.comp g'inv = 0
\u22a2 HasStrictFDerivAt (φ.implicitFunction (φ.leftFun φ.pt)) g'inv (φ.rightFun φ.pt)
-- Mathlib/Analysis/Calculus/Implicit.lean
𝕜 : Type u_1
inst✝⁹ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝⁸ : NormedAddCommGroup E
inst✝⁷ : NormedSpace 𝕜 E
inst✝⁶ : CompleteSpace E
F : Type u_3
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
inst✝³ : CompleteSpace F
G : Type u_4
inst✝² : NormedAddCommGroup G
inst✝¹ : NormedSpace 𝕜 G
inst✝ : CompleteSpace G
φ : ImplicitFunctionData 𝕜 E F G
g'inv : G →L[𝕜] E
hg'inv : φ.rightDeriv.comp g'inv = ContinuousLinearMap.id 𝕜 G
hg'invf : φ.leftDeriv.comp g'inv = 0
this : HasStrictFDerivAt (HasStrictFDerivAt.localInverse φ.prodFun (φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯) φ.pt ⋯) (↑(φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯).symm) (φ.prodFun φ.pt)
\u22a2 HasStrictFDerivAt (φ.implicitFunction (φ.leftFun φ.pt)) g'inv (φ.rightFun φ.pt)
-- Mathlib/Analysis/Calculus/Implicit.lean
𝕜 : Type u_1
inst✝⁹ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝⁸ : NormedAddCommGroup E
inst✝⁷ : NormedSpace 𝕜 E
inst✝⁶ : CompleteSpace E
F : Type u_3
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
inst✝³ : CompleteSpace F
G : Type u_4
inst✝² : NormedAddCommGroup G
inst✝¹ : NormedSpace 𝕜 G
inst✝ : CompleteSpace G
φ : ImplicitFunctionData 𝕜 E F G
g'inv : G →L[𝕜] E
hg'inv : φ.rightDeriv.comp g'inv = ContinuousLinearMap.id 𝕜 G
hg'invf : φ.leftDeriv.comp g'inv = 0
this : HasStrictFDerivAt (HasStrictFDerivAt.localInverse φ.prodFun (φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯) φ.pt ⋯) ↑(φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯).symm (φ.leftFun φ.pt, φ.rightFun φ.pt)
\u22a2 HasStrictFDerivAt (φ.implicitFunction (φ.leftFun φ.pt)) g'inv (φ.rightFun φ.pt)
-- Mathlib/Analysis/Calculus/Implicit.lean
𝕜 : Type u_1
inst✝⁹ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝⁸ : NormedAddCommGroup E
inst✝⁷ : NormedSpace 𝕜 E
inst✝⁶ : CompleteSpace E
F : Type u_3
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
inst✝³ : CompleteSpace F
G : Type u_4
inst✝² : NormedAddCommGroup G
inst✝¹ : NormedSpace 𝕜 G
inst✝ : CompleteSpace G
φ : ImplicitFunctionData 𝕜 E F G
g'inv : G →L[𝕜] E
hg'inv : φ.rightDeriv.comp g'inv = ContinuousLinearMap.id 𝕜 G
hg'invf : φ.leftDeriv.comp g'inv = 0
this : HasStrictFDerivAt (HasStrictFDerivAt.localInverse φ.prodFun (φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯) φ.pt ⋯) ↑(φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯).symm (φ.leftFun φ.pt, φ.rightFun φ.pt)
\u22a2 g'inv = (↑(φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯).symm).comp (ContinuousLinearMap.prod 0 (ContinuousLinearMap.id 𝕜 G))
-- Mathlib/Analysis/Calculus/Implicit.lean
𝕜 : Type u_1
inst✝⁹ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝⁸ : NormedAddCommGroup E
inst✝⁷ : NormedSpace 𝕜 E
inst✝⁶ : CompleteSpace E
F : Type u_3
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
inst✝³ : CompleteSpace F
G : Type u_4
inst✝² : NormedAddCommGroup G
inst✝¹ : NormedSpace 𝕜 G
inst✝ : CompleteSpace G
φ : ImplicitFunctionData 𝕜 E F G
g'inv : G →L[𝕜] E
this : HasStrictFDerivAt (HasStrictFDerivAt.localInverse φ.prodFun (φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯) φ.pt ⋯) ↑(φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯).symm (φ.leftFun φ.pt, φ.rightFun φ.pt)
hg'inv : ∀ (x : G), φ.rightDeriv (g'inv x) = (ContinuousLinearMap.id 𝕜 G) x
hg'invf : ∀ (x : G), φ.leftDeriv (g'inv x) = 0 x
\u22a2 ∀ (x : G), g'inv x = ↑(φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯).symm ((ContinuousLinearMap.prod 0 (ContinuousLinearMap.id 𝕜 G)) x)
-- Mathlib/Analysis/Calculus/Implicit.lean
𝕜 : Type u_1
inst✝⁹ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝⁸ : NormedAddCommGroup E
inst✝⁷ : NormedSpace 𝕜 E
inst✝⁶ : CompleteSpace E
F : Type u_3
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
inst✝³ : CompleteSpace F
G : Type u_4
inst✝² : NormedAddCommGroup G
inst✝¹ : NormedSpace 𝕜 G
inst✝ : CompleteSpace G
φ : ImplicitFunctionData 𝕜 E F G
g'inv : G →L[𝕜] E
this : HasStrictFDerivAt (HasStrictFDerivAt.localInverse φ.prodFun (φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯) φ.pt ⋯) ↑(φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯).symm (φ.leftFun φ.pt, φ.rightFun φ.pt)
hg'inv : ∀ (x : G), φ.rightDeriv (g'inv x) = (ContinuousLinearMap.id 𝕜 G) x
hg'invf : ∀ (x : G), φ.leftDeriv (g'inv x) = 0 x
x : G
\u22a2 g'inv x = ↑(φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯).symm ((ContinuousLinearMap.prod 0 (ContinuousLinearMap.id 𝕜 G)) x)
-- Mathlib/Analysis/Calculus/Implicit.lean
𝕜 : Type u_1
inst✝⁹ : NontriviallyNormedField 𝕜
E : Type u_2
inst✝⁸ : NormedAddCommGroup E
inst✝⁷ : NormedSpace 𝕜 E
inst✝⁶ : CompleteSpace E
F : Type u_3
inst✝⁵ : NormedAddCommGroup F
inst✝⁴ : NormedSpace 𝕜 F
inst✝³ : CompleteSpace F
G : Type u_4
inst✝² : NormedAddCommGroup G
inst✝¹ : NormedSpace 𝕜 G
inst✝ : CompleteSpace G
φ : ImplicitFunctionData 𝕜 E F G
g'inv : G →L[𝕜] E
this : HasStrictFDerivAt (HasStrictFDerivAt.localInverse φ.prodFun (φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯) φ.pt ⋯) ↑(φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯).symm (φ.leftFun φ.pt, φ.rightFun φ.pt)
hg'inv : ∀ (x : G), φ.rightDeriv (g'inv x) = (ContinuousLinearMap.id 𝕜 G) x
hg'invf : ∀ (x : G), φ.leftDeriv (g'inv x) = 0 x
x : G
\u22a2 (φ.leftDeriv.equivProdOfSurjectiveOfIsCompl φ.rightDeriv ⋯ ⋯ ⋯) (g'inv x) = (ContinuousLinearMap.prod 0 (ContinuousLinearMap.id 𝕜 G)) x
-- Mathlib/Data/Set/Pointwise/Basic.lean
F : Type u_1
α : Type u_2
β : Type u_3
γ : Type u_4
inst✝ : Monoid α
s t : Set α
a : α
m n✝ n : ℕ
x✝ : n + 2 ≠ 0
\u22a2 univ ^ (n + 2) = univ
-- Mathlib/CategoryTheory/Monoidal/OfChosenFiniteProducts/Symmetric.lean
C : Type u
inst✝ : Category.{v, u} C
X✝ Y✝ : C
𝒯 : LimitCone (Functor.empty C)
ℬ : (X Y : C) → LimitCone (pair X Y)
X Y : C
\u22a2 ((ℬ X Y).isLimit.conePointUniqueUpToIso (ℬ Y X).isLimit.swapBinaryFan).hom ≫ ((ℬ Y X).isLimit.conePointUniqueUpToIso (ℬ X Y).isLimit.swapBinaryFan).hom = 𝟙 (tensorObj ℬ X Y)
-- Mathlib/CategoryTheory/Monoidal/OfChosenFiniteProducts/Symmetric.lean
C : Type u
inst✝ : Category.{v, u} C
X✝ Y✝ : C
𝒯 : LimitCone (Functor.empty C)
ℬ : (X Y : C) → LimitCone (pair X Y)
X Y : C
\u22a2 ∀ (j : Discrete WalkingPair), (((ℬ X Y).isLimit.conePointUniqueUpToIso (ℬ Y X).isLimit.swapBinaryFan).hom ≫ ((ℬ Y X).isLimit.conePointUniqueUpToIso (ℬ X Y).isLimit.swapBinaryFan).hom) ≫ (ℬ X Y).cone.π.app j = 𝟙 (tensorObj ℬ X Y) ≫ (ℬ X Y).cone.π.app j
-- Mathlib/Data/List/Basic.lean
ι : Type u_1
α : Type u
β : Type v
γ : Type w
l₁ l₂ : List α
p : α → Prop
f : (a : α) → p a → β
l : List α
H : ∀ (a : α), a ∈ l → p a
b : β
\u22a2 b ∈ pmap f l H ↔ ∃ a h, f a ⋯ = b
-- Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean
R : Type u
S : Type v
inst✝¹ : CommRing R
inst✝ : CommRing S
W : Affine R
f : R →+* S
x₁ x₂ y₁ L : R
\u22a2 span {(mk W) (C (X - C (W.addX x₁ x₂ L))), (mk W) (Y - C (C (-(L * (W.addX x₁ x₂ L - x₁) + y₁) - W.a₁ * W.addX x₁ x₂ L - W.a₃)))} = span {(mk W) (-Y - C (C W.a₁ * X + C W.a₃) - C (C L * (X - C x₁) + C y₁))} ⊔ span {(mk W) (C (X - C (W.addX x₁ x₂ L)))}
-- Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean
R : Type u
S : Type v
inst✝¹ : CommRing R
inst✝ : CommRing S
W : Affine R
f : R →+* S
x₁ x₂ y₁ L : R
\u22a2 span {(mk W) (C (X - C (W.addX x₁ x₂ L))), (mk W) (Y - C (C (-(L * (W.addX x₁ x₂ L - x₁) + y₁) - W.a₁ * W.addX x₁ x₂ L - W.a₃)) + C (X - C (W.addX x₁ x₂ L)) * C (C (W.a₁ + L)))} = span {(mk W) (C (X - C (W.addX x₁ x₂ L))), (mk W) (C (C W.a₁ * X + C W.a₃) + C (C L * (X - C x₁) + C y₁) + Y)}
-- Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean
R : Type u
S : Type v
inst✝¹ : CommRing R
inst✝ : CommRing S
W : Affine R
f : R →+* S
x₁ x₂ y₁ L : R
\u22a2 Y - C (C (-(L * (W.addX x₁ x₂ L - x₁) + y₁) - W.a₁ * W.addX x₁ x₂ L - W.a₃)) + C (X - C (W.addX x₁ x₂ L)) * C (C (W.a₁ + L)) = C (C W.a₁ * X + C W.a₃) + C (C L * (X - C x₁) + C y₁) + Y
-- Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean
R : Type u
S : Type v
inst✝¹ : CommRing R
inst✝ : CommRing S
W : Affine R
f : R →+* S
x₁ x₂ y₁ L : R
\u22a2 Y - (-(C (C L) * (C (C (W.addX x₁ x₂ L)) - C (C x₁)) + C (C y₁)) - C (C W.a₁) * C (C (W.addX x₁ x₂ L)) - C (C W.a₃)) + (C X - C (C (W.addX x₁ x₂ L))) * (C (C W.a₁) + C (C L)) = C (C W.a₁) * C X + C (C W.a₃) + (C (C L) * (C X - C (C x₁)) + C (C y₁)) + Y
-- Mathlib/Computability/DFA.lean
α : Type u
σ : Type v
M : DFA α σ
inst✝ : Fintype σ
x : List α
s t : σ
hlen : Fintype.card σ ≤ x.length
hx : M.evalFrom s x = t
\u22a2 ∃ q a b c, x = a ++ b ++ c ∧ a.length + b.length ≤ Fintype.card σ ∧ b ≠ [] ∧ M.evalFrom s a = q ∧ M.evalFrom q b = q ∧ M.evalFrom q c = t
-- Mathlib/Computability/DFA.lean
α : Type u
σ : Type v
M : DFA α σ
inst✝ : Fintype σ
x : List α
s t : σ
hlen : Fintype.card σ ≤ x.length
hx : M.evalFrom s x = t
n m : Fin (Fintype.card σ + 1)
hneq : n ≠ m
heq : M.evalFrom s (List.take (↑n) x) = M.evalFrom s (List.take (↑m) x)
\u22a2 ∃ q a b c, x = a ++ b ++ c ∧ a.length + b.length ≤ Fintype.card σ ∧ b ≠ [] ∧ M.evalFrom s a = q ∧ M.evalFrom q b = q ∧ M.evalFrom q c = t
-- Mathlib/Computability/DFA.lean
α : Type u
σ : Type v
M : DFA α σ
inst✝ : Fintype σ
x : List α
s t : σ
hlen : Fintype.card σ ≤ x.length
hx : M.evalFrom s x = t
n m : Fin (Fintype.card σ + 1)
hneq : n ≠ m
heq : M.evalFrom s (List.take (↑n) x) = M.evalFrom s (List.take (↑m) x)
hle : ↑n ≤ ↑m
\u22a2 ∃ q a b c, x = a ++ b ++ c ∧ a.length + b.length ≤ Fintype.card σ ∧ b ≠ [] ∧ M.evalFrom s a = q ∧ M.evalFrom q b = q ∧ M.evalFrom q c = t
-- Mathlib/Computability/DFA.lean
α : Type u
σ : Type v
M : DFA α σ
inst✝ : Fintype σ
x : List α
s t : σ
hlen : Fintype.card σ ≤ x.length
hx : M.evalFrom s x = t
n m : Fin (Fintype.card σ + 1)
hneq : n ≠ m
heq : M.evalFrom s (List.take (↑n) x) = M.evalFrom s (List.take (↑m) x)
hle : ↑n ≤ ↑m
hm : ↑m ≤ Fintype.card σ
\u22a2 ∃ q a b c, x = a ++ b ++ c ∧ a.length + b.length ≤ Fintype.card σ ∧ b ≠ [] ∧ M.evalFrom s a = q ∧ M.evalFrom q b = q ∧ M.evalFrom q c = t
-- Mathlib/Computability/DFA.lean
α : Type u
σ : Type v
M : DFA α σ
inst✝ : Fintype σ
x : List α
s t : σ
hlen : Fintype.card σ ≤ x.length
hx : M.evalFrom s x = t
n m : Fin (Fintype.card σ + 1)
hneq : n ≠ m
heq : M.evalFrom s (List.take (↑n) x) = M.evalFrom s (List.take (↑m) x)
hle : ↑n ≤ ↑m
hm : ↑m ≤ Fintype.card σ
\u22a2 M.evalFrom (M.evalFrom s (List.take (↑n) (List.take (↑m) x))) (List.drop (↑n) (List.take (↑m) x)) = M.evalFrom s (List.take (↑n) (List.take (↑m) x)) ∧ M.evalFrom (M.evalFrom s (List.take (↑n) (List.take (↑m) x))) (List.drop (↑m) x) = t
-- Mathlib/Computability/DFA.lean
α : Type u
σ : Type v
M : DFA α σ
inst✝ : Fintype σ
x : List α
s t : σ
hlen : Fintype.card σ ≤ x.length
hx : M.evalFrom s x = t
n m : Fin (Fintype.card σ + 1)
hneq : n ≠ m
heq : M.evalFrom s (List.take (↑n) x) = M.evalFrom s (List.take (↑m) x)
hle : ↑n ≤ ↑m
hm : ↑m ≤ Fintype.card σ
hq : M.evalFrom (M.evalFrom s (List.take (↑n) (List.take (↑m) x))) (List.drop (↑n) (List.take (↑m) x)) = M.evalFrom s (List.take (↑n) (List.take (↑m) x))
\u22a2 M.evalFrom (M.evalFrom s (List.take (↑n) (List.take (↑m) x))) (List.drop (↑n) (List.take (↑m) x)) = M.evalFrom s (List.take (↑n) (List.take (↑m) x)) ∧ M.evalFrom (M.evalFrom s (List.take (↑n) (List.take (↑m) x))) (List.drop (↑m) x) = t