module stringlengths 16 90 | startPos dict | endPos dict | goals listlengths 0 96 | ppTac stringlengths 1 14.5k | elaborator stringclasses 365
values | kind stringclasses 368
values |
|---|---|---|---|---|---|---|
Mathlib.CategoryTheory.Monad.Adjunction | {
"line": 307,
"column": 2
} | {
"line": 308,
"column": 16
} | [
{
"pp": "C : Type u₁\ninst✝² : Category.{v₁, u₁} C\nD : Type u₂\ninst✝¹ : Category.{v₂, u₂} D\nL : C ⥤ D\nR : D ⥤ C\ninst✝ : Reflective R\n⊢ IsIso (reflectorAdjunction R).toMonad.μ",
"usedConstants": [
"CategoryTheory.Functor",
"CategoryTheory.IsIso",
"CategoryTheory.Functor.isIso_whiskerR... | dsimp
infer_instance | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.CategoryTheory.Monad.Adjunction | {
"line": 307,
"column": 2
} | {
"line": 308,
"column": 16
} | [
{
"pp": "C : Type u₁\ninst✝² : Category.{v₁, u₁} C\nD : Type u₂\ninst✝¹ : Category.{v₂, u₂} D\nL : C ⥤ D\nR : D ⥤ C\ninst✝ : Reflective R\n⊢ IsIso (reflectorAdjunction R).toMonad.μ",
"usedConstants": [
"CategoryTheory.Functor",
"CategoryTheory.IsIso",
"CategoryTheory.Functor.isIso_whiskerR... | dsimp
infer_instance | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.CategoryTheory.Monad.Adjunction | {
"line": 312,
"column": 2
} | {
"line": 313,
"column": 16
} | [
{
"pp": "C : Type u₁\ninst✝² : Category.{v₁, u₁} C\nD : Type u₂\ninst✝¹ : Category.{v₂, u₂} D\nL : C ⥤ D\nR : D ⥤ C\ninst✝ : Coreflective R\n⊢ IsIso (coreflectorAdjunction R).toComonad.δ",
"usedConstants": [
"CategoryTheory.coreflector",
"CategoryTheory.Functor",
"CategoryTheory.IsIso",
... | dsimp
infer_instance | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.CategoryTheory.Monad.Adjunction | {
"line": 312,
"column": 2
} | {
"line": 313,
"column": 16
} | [
{
"pp": "C : Type u₁\ninst✝² : Category.{v₁, u₁} C\nD : Type u₂\ninst✝¹ : Category.{v₂, u₂} D\nL : C ⥤ D\nR : D ⥤ C\ninst✝ : Coreflective R\n⊢ IsIso (coreflectorAdjunction R).toComonad.δ",
"usedConstants": [
"CategoryTheory.coreflector",
"CategoryTheory.Functor",
"CategoryTheory.IsIso",
... | dsimp
infer_instance | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.CategoryTheory.Monad.Comonadicity | {
"line": 232,
"column": 65
} | {
"line": 237,
"column": 18
} | [
{
"pp": "C : Type u₁\nD : Type u₂\ninst✝³ : Category.{v₁, u₁} C\ninst✝² : Category.{v₁, u₂} D\nF : C ⥤ D\nG : D ⥤ C\nadj : F ⊣ G\ninst✝¹ : ComonadicLeftAdjoint F\nA B : C\nf g : A ⟶ B\ninst✝ : F.IsCosplitPair f g\n⊢ CreatesLimit (parallelPair f g) F",
"usedConstants": [
"CategoryTheory.map_is_cosplit_... | by
apply +allowSynthFailures comonadicCreatesLimitOfPreservesLimit
all_goals
apply @preservesLimit_of_iso_diagram _ _ _ _ _ _ _ _ _ (diagramIsoParallelPair.{v₁} _).symm ?_
dsimp
infer_instance | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.RingTheory.Ideal.Pointwise | {
"line": 131,
"column": 94
} | {
"line": 132,
"column": 51
} | [
{
"pp": "M : Type u_1\nR : Type u_2\ninst✝² : Group M\ninst✝¹ : Semiring R\ninst✝ : MulSemiringAction M R\na : M\nS : Ideal R\nx : R\n⊢ x ∈ a⁻¹ • S ↔ a • x ∈ S",
"usedConstants": [
"Eq.mpr",
"NonAssocSemiring.toAddCommMonoidWithOne",
"Submodule.instAddCommMonoidWithOne",
"instHSMul",... | by
rw [mem_pointwise_smul_iff_inv_smul_mem, inv_inv] | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.RingTheory.Ideal.Over | {
"line": 179,
"column": 10
} | {
"line": 179,
"column": 57
} | [
{
"pp": "A : Type u_2\ninst✝⁶ : CommSemiring A\nB : Type u_3\ninst✝⁵ : CommSemiring B\nC : Type u_4\ninst✝⁴ : Semiring C\ninst✝³ : Algebra A B\ninst✝² : Algebra B C\ninst✝¹ : Algebra A C\ninst✝ : IsScalarTower A B C\n𝔓 : Ideal C\nP : Ideal B\np : Ideal A\nhp : 𝔓.LiesOver p\nhP : 𝔓.LiesOver P\n⊢ p = under A P... | by rw [𝔓.over_def p, 𝔓.over_def P, under_under] | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.RingTheory.Ideal.IsPrimary | {
"line": 59,
"column": 10
} | {
"line": 59,
"column": 38
} | [
{
"pp": "case pos\nR : Type u_1\ninst✝ : CommSemiring R\nI : Ideal R\nhi : I.radical.IsMaximal\nx y : R\nhxy : x * y ∈ I\nh : I + span {y} = ⊤\n⊢ x ∈ I ∨ y ∈ I.radical",
"usedConstants": [
"Eq.mpr",
"Semiring.toModule",
"congrArg",
"CommSemiring.toSemiring",
"PartialOrder.toPre... | ← span_singleton_le_iff_mem, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.Ideal.IsPrimary | {
"line": 59,
"column": 66
} | {
"line": 59,
"column": 74
} | [
{
"pp": "case pos\nR : Type u_1\ninst✝ : CommSemiring R\nI : Ideal R\nhi : I.radical.IsMaximal\nx y : R\nhxy : x * y ∈ I\nh : I + span {y} = ⊤\n⊢ span {x} * (I + span {y}) ≤ I ∨ y ∈ I.radical",
"usedConstants": [
"Distrib.leftDistribClass",
"Eq.mpr",
"Semiring.toModule",
"HMul.hMul",... | mul_add, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.PolynomialAlgebra | {
"line": 88,
"column": 13
} | {
"line": 88,
"column": 30
} | [
{
"pp": "case a\nR : Type u_1\nA : Type u_3\ninst✝² : CommSemiring R\ninst✝¹ : Semiring A\ninst✝ : Algebra R A\na₁ a₂ : A\np₁ p₂ : R[X]\nk : ℕ\n⊢ (if ¬(p₁ * p₂).coeff k = 0 then a₁ * a₂ * (algebraMap R A) ((p₁ * p₂).coeff k) else 0) =\n ∑ x ∈ Finset.antidiagonal k,\n (∑ n ∈ p₁.support, (monomial n) (a₁ ... | finset_sum_coeff, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.RingTheory.PolynomialAlgebra | {
"line": 89,
"column": 6
} | {
"line": 89,
"column": 15
} | [
{
"pp": "case a\nR : Type u_1\nA : Type u_3\ninst✝² : CommSemiring R\ninst✝¹ : Semiring A\ninst✝ : Algebra R A\na₁ a₂ : A\np₁ p₂ : R[X]\nk : ℕ\n⊢ (if ¬(p₁ * p₂).coeff k = 0 then a₁ * a₂ * (algebraMap R A) ((p₁ * p₂).coeff k) else 0) =\n ∑ x ∈ Finset.antidiagonal k,\n if ¬p₂.coeff x.2 = 0 then\n (... | mul_zero, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.Algebra.Category.ModuleCat.ChangeOfRings | {
"line": 543,
"column": 8
} | {
"line": 543,
"column": 23
} | [
{
"pp": "R✝ : Type u₁\nS✝ : Type u₂\ninst✝³ : CommRing R✝\ninst✝² : CommRing S✝\nf✝ : R✝ →+* S✝\nR : Type u₁\nS : Type u₂\ninst✝¹ : Ring R\ninst✝ : Ring S\nf : R →+* S\nX : ModuleCat R\nY : ModuleCat S\ng : (restrictScalars f).obj Y ⟶ X\ns : S\ny : ↑Y\nt : S\n⊢ { toFun := fun s_1 ↦ (ConcreteCategory.hom g) (s_1... | simp [mul_smul] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.Algebra.Category.ModuleCat.ChangeOfRings | {
"line": 543,
"column": 8
} | {
"line": 543,
"column": 23
} | [
{
"pp": "R✝ : Type u₁\nS✝ : Type u₂\ninst✝³ : CommRing R✝\ninst✝² : CommRing S✝\nf✝ : R✝ →+* S✝\nR : Type u₁\nS : Type u₂\ninst✝¹ : Ring R\ninst✝ : Ring S\nf : R →+* S\nX : ModuleCat R\nY : ModuleCat S\ng : (restrictScalars f).obj Y ⟶ X\ns : S\ny : ↑Y\nt : S\n⊢ { toFun := fun s_1 ↦ (ConcreteCategory.hom g) (s_1... | simp [mul_smul] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Algebra.Category.ModuleCat.ChangeOfRings | {
"line": 543,
"column": 8
} | {
"line": 543,
"column": 23
} | [
{
"pp": "R✝ : Type u₁\nS✝ : Type u₂\ninst✝³ : CommRing R✝\ninst✝² : CommRing S✝\nf✝ : R✝ →+* S✝\nR : Type u₁\nS : Type u₂\ninst✝¹ : Ring R\ninst✝ : Ring S\nf : R →+* S\nX : ModuleCat R\nY : ModuleCat S\ng : (restrictScalars f).obj Y ⟶ X\ns : S\ny : ↑Y\nt : S\n⊢ { toFun := fun s_1 ↦ (ConcreteCategory.hom g) (s_1... | simp [mul_smul] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.RingTheory.Localization.AtPrime.Basic | {
"line": 210,
"column": 2
} | {
"line": 210,
"column": 29
} | [
{
"pp": "case h.e'_3\nR : Type u_1\ninst✝ : CommSemiring R\nI : Ideal R\nhI : I.IsPrime\n⊢ IsLocalRing.maximalIdeal (Localization I.primeCompl) =\n Ideal.map (algebraMap R (Localization.AtPrime I))\n (Ideal.comap (algebraMap R (Localization.AtPrime I)) (IsLocalRing.maximalIdeal (Localization I.primeComp... | rw [map_comap I.primeCompl] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.RingTheory.Localization.AtPrime.Basic | {
"line": 278,
"column": 45
} | {
"line": 278,
"column": 49
} | [
{
"pp": "R : Type u_1\ninst✝⁴ : CommSemiring R\nS✝ : Type u_2\ninst✝³ : CommSemiring S✝\ninst✝² : Algebra R S✝\nP : Type u_3\ninst✝¹ : CommSemiring P\nI : Ideal R\nhI : I.IsPrime\nS : Type u_4\ninst✝ : CommSemiring S\nJ : Ideal S\nhJ : J.IsPrime\nK : Ideal P\nhK : K.IsPrime\nf : R →+* S\nhIJ : I = Ideal.comap f... | hJK, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.LocalProperties.Exactness | {
"line": 82,
"column": 2
} | {
"line": 82,
"column": 40
} | [
{
"pp": "R : Type u_1\nM : Type u_2\nN : Type u_3\nL : Type u_4\ninst✝¹⁵ : CommSemiring R\ninst✝¹⁴ : AddCommMonoid M\ninst✝¹³ : Module R M\ninst✝¹² : AddCommMonoid N\ninst✝¹¹ : Module R N\ninst✝¹⁰ : AddCommMonoid L\ninst✝⁹ : Module R L\nMₚ : (P : Ideal R) → [P.IsMaximal] → Type u_6\ninst✝⁸ : (P : Ideal R) → [in... | apply eq_of_localization₀_maximal Nₚ g | Lean.Elab.Tactic.evalApply | Lean.Parser.Tactic.apply |
Mathlib.RingTheory.EssentialFiniteness | {
"line": 76,
"column": 2
} | {
"line": 76,
"column": 26
} | [
{
"pp": "R : Type u_1\nS : Type u_2\ninst✝² : CommRing R\ninst✝¹ : CommRing S\ninst✝ : Algebra R S\nσ : Finset S\n⊢ IsLocalization (Submonoid.comap (algebraMap (↥(adjoin R ↑σ)) S) (IsUnit.submonoid S)) S ↔\n ∀ (s : S), ∃ t ∈ adjoin R ↑σ, IsUnit t ∧ s * t ∈ adjoin R ↑σ",
"usedConstants": [
"Subalgeb... | constructor <;> intro hσ | Lean.Parser.Tactic.«_aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tactic_<;>__1» | Lean.Parser.Tactic.«tactic_<;>_» |
Mathlib.RingTheory.EssentialFiniteness | {
"line": 83,
"column": 6
} | {
"line": 83,
"column": 36
} | [
{
"pp": "case mpr.toIsLocalizationMap.surj\nR : Type u_1\nS : Type u_2\ninst✝² : CommRing R\ninst✝¹ : CommRing S\ninst✝ : Algebra R S\nσ : Finset S\nhσ : ∀ (s : S), ∃ t ∈ adjoin R ↑σ, IsUnit t ∧ s * t ∈ adjoin R ↑σ\ns : S\n⊢ ∃ x, s * (algebraMap (↥(adjoin R ↑σ)) S) ↑x.2 = (algebraMap (↥(adjoin R ↑σ)) S) x.1",
... | obtain ⟨t, ht, ht', h⟩ := hσ s | _private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalObtain | Lean.Parser.Tactic.obtain |
Mathlib.RingTheory.EssentialFiniteness | {
"line": 121,
"column": 4
} | {
"line": 123,
"column": 77
} | [
{
"pp": "case refine_1\nR : Type u_1\nS : Type u_2\nT : Type u_3\ninst✝⁶ : CommRing R\ninst✝⁵ : CommRing S\ninst✝⁴ : CommRing T\ninst✝³ : Algebra R S\ninst✝² : Algebra R T\ninst✝¹ : Algebra S T\ninst✝ : IsScalarTower R S T\nσ : Subalgebra R S\nhσ : ∀ (s : S), ∃ t ∈ σ, IsUnit t ∧ s * t ∈ σ\nτ : Set T\nt : T\nht ... | intro t ht
exact ⟨1, Subalgebra.one_mem _, isUnit_one,
(one_smul S t).symm ▸ Algebra.mem_sup_right (Algebra.subset_adjoin ht)⟩ | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.RingTheory.EssentialFiniteness | {
"line": 121,
"column": 4
} | {
"line": 123,
"column": 77
} | [
{
"pp": "case refine_1\nR : Type u_1\nS : Type u_2\nT : Type u_3\ninst✝⁶ : CommRing R\ninst✝⁵ : CommRing S\ninst✝⁴ : CommRing T\ninst✝³ : Algebra R S\ninst✝² : Algebra R T\ninst✝¹ : Algebra S T\ninst✝ : IsScalarTower R S T\nσ : Subalgebra R S\nhσ : ∀ (s : S), ∃ t ∈ σ, IsUnit t ∧ s * t ∈ σ\nτ : Set T\nt : T\nht ... | intro t ht
exact ⟨1, Subalgebra.one_mem _, isUnit_one,
(one_smul S t).symm ▸ Algebra.mem_sup_right (Algebra.subset_adjoin ht)⟩ | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.RingTheory.Localization.AtPrime.Basic | {
"line": 559,
"column": 2
} | {
"line": 560,
"column": 86
} | [
{
"pp": "case refine_1\nR✝ : Type u_1\ninst✝²⁸ : CommSemiring R✝\nS✝ : Type u_2\ninst✝²⁷ : CommSemiring S✝\ninst✝²⁶ : Algebra R✝ S✝\nP✝ : Type u_3\ninst✝²⁵ : CommSemiring P✝\np✝ : Ideal R✝\ninst✝²⁴ : p✝.IsPrime\nRₚ✝ : Type u_4\ninst✝²³ : CommSemiring Rₚ✝\ninst✝²² : Algebra R✝ Rₚ✝\ninst✝²¹ : IsLocalization.AtPri... | · rw [IsScalarTower.algebraMap_eq S Sₚ, Ideal.Quotient.algebraMap_eq, ← RingHom.comap_ker,
Ideal.mk_ker, h, Ideal.map_map, ← IsScalarTower.algebraMap_eq, comap_map_eq_map] | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.RingTheory.Localization.Submodule | {
"line": 140,
"column": 4
} | {
"line": 140,
"column": 76
} | [
{
"pp": "case mp.refine_2\nR : Type u_1\ninst✝⁷ : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst✝⁶ : CommSemiring S\ninst✝⁵ : Algebra R S\ninst✝⁴ : IsLocalization M S\nN : Type u_3\ninst✝³ : AddCommMonoid N\ninst✝² : Module R N\ninst✝¹ : Module S N\ninst✝ : IsScalarTower R S N\nx : N\na : Set N\nh : x ∈ Su... | · exact ⟨0, Submodule.zero_mem _, 1, by rw [mk'_one, map_one, one_smul]⟩ | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.Algebra.Ring.Regular | {
"line": 68,
"column": 8
} | {
"line": 68,
"column": 16
} | [
{
"pp": "α : Type u_1\ninst✝ : Ring α\nh : ∀ (x y z : α), x * y = 1 → x * z = 1 → y = z\nx y : α\neq : x * y = 1\n⊢ x * (1 - y * x + y) = 1",
"usedConstants": [
"Distrib.leftDistribClass",
"Eq.mpr",
"HMul.hMul",
"Ring.toNonAssocRing",
"AddGroupWithOne.toAddGroup",
"congrA... | mul_add, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.EssentialFiniteness | {
"line": 162,
"column": 88
} | {
"line": 166,
"column": 19
} | [
{
"pp": "R : Type u_1\nS : Type u_2\ninst✝² : CommRing R\ninst✝¹ : CommRing S\ninst✝ : Algebra R S\n⊢ EssFiniteType R S ↔ ∃ S₀ M, FiniteType R ↥S₀ ∧ IsLocalization M S",
"usedConstants": [
"Subalgebra.instSetLike",
"Algebra.EssFiniteType.subalgebra",
"IsScalarTower.right",
"IsLocaliz... | by
refine ⟨fun h ↦ ⟨subalgebra R S, submonoid R S, inferInstance, inferInstance⟩, ?_⟩
rintro ⟨S₀, M, _, _⟩
letI := of_isLocalization S M
exact comp R S₀ S | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.LinearAlgebra.Matrix.Polynomial | {
"line": 64,
"column": 17
} | {
"line": 64,
"column": 34
} | [
{
"pp": "n : Type u_1\nα : Type u_2\ninst✝² : DecidableEq n\ninst✝¹ : Fintype n\ninst✝ : CommRing α\nA B : Matrix n n α\n⊢ (∑ σ, sign σ • ∏ i, (X • A.map ⇑C + B.map ⇑C) (σ i) i).coeff 0 = B.det",
"usedConstants": [
"Eq.mpr",
"Polynomial.C",
"Matrix.smul",
"instHSMul",
"MonoidHo... | finset_sum_coeff, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Polynomial.Laurent | {
"line": 252,
"column": 2
} | {
"line": 252,
"column": 21
} | [
{
"pp": "R : Type u_1\ninst✝ : Semiring R\nM : R[T;T⁻¹] → Prop\np : R[T;T⁻¹]\nh_C : ∀ (a : R), M (C a)\nh_add : ∀ {p q : R[T;T⁻¹]}, M p → M q → M (p + q)\nh_C_mul_T : ∀ (n : ℕ) (a : R), M (C a * T ↑n) → M (C a * T (↑n + 1))\nh_C_mul_T_Z : ∀ (n : ℕ) (a : R), M (C a * T (-↑n)) → M (C a * T (-↑n - 1))\nA : ∀ {n : ... | convert B p.support | Mathlib.Tactic._aux_Mathlib_Tactic_Convert___elabRules_Mathlib_Tactic_convert_1 | Mathlib.Tactic.convert |
Mathlib.Algebra.Polynomial.Laurent | {
"line": 288,
"column": 18
} | {
"line": 288,
"column": 26
} | [
{
"pp": "case add\nR : Type u_1\ninst✝ : Semiring R\nr : R\np✝ q✝ : R[T;T⁻¹]\nhp : r • p✝ = C r * p✝\nhq : r • q✝ = C r * q✝\n⊢ r • p✝ + r • q✝ = C r * (p✝ + q✝)",
"usedConstants": [
"Distrib.leftDistribClass",
"Eq.mpr",
"NonAssocSemiring.toAddCommMonoidWithOne",
"instHSMul",
"... | mul_add, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.LinearAlgebra.Matrix.Adjugate | {
"line": 134,
"column": 29
} | {
"line": 134,
"column": 95
} | [
{
"pp": "n : Type v\nα : Type w\ninst✝³ : DecidableEq n\ninst✝² : Fintype n\ninst✝¹ : CommRing α\ninst✝ : Subsingleton n\nA : Matrix n n α\nb : n → α\ni : n\n⊢ A.cramer b i = b i",
"usedConstants": [
"Eq.mpr",
"Pi.Function.module",
"Matrix.updateCol_self",
"NonUnitalCommRing.toNonUni... | rw [cramer_apply, det_eq_elem_of_subsingleton _ i, updateCol_self] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.LinearAlgebra.Matrix.Adjugate | {
"line": 134,
"column": 29
} | {
"line": 134,
"column": 95
} | [
{
"pp": "n : Type v\nα : Type w\ninst✝³ : DecidableEq n\ninst✝² : Fintype n\ninst✝¹ : CommRing α\ninst✝ : Subsingleton n\nA : Matrix n n α\nb : n → α\ni : n\n⊢ A.cramer b i = b i",
"usedConstants": [
"Eq.mpr",
"Pi.Function.module",
"Matrix.updateCol_self",
"NonUnitalCommRing.toNonUni... | rw [cramer_apply, det_eq_elem_of_subsingleton _ i, updateCol_self] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.LinearAlgebra.Matrix.Adjugate | {
"line": 134,
"column": 29
} | {
"line": 134,
"column": 95
} | [
{
"pp": "n : Type v\nα : Type w\ninst✝³ : DecidableEq n\ninst✝² : Fintype n\ninst✝¹ : CommRing α\ninst✝ : Subsingleton n\nA : Matrix n n α\nb : n → α\ni : n\n⊢ A.cramer b i = b i",
"usedConstants": [
"Eq.mpr",
"Pi.Function.module",
"Matrix.updateCol_self",
"NonUnitalCommRing.toNonUni... | rw [cramer_apply, det_eq_elem_of_subsingleton _ i, updateCol_self] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.LinearAlgebra.Matrix.Adjugate | {
"line": 248,
"column": 28
} | {
"line": 248,
"column": 40
} | [
{
"pp": "n : Type v\nα : Type w\ninst✝² : DecidableEq n\ninst✝¹ : Fintype n\ninst✝ : CommRing α\nA : Matrix n n α\nb : n → α\n⊢ A.cramer b = Aᵀ.adjugateᵀ *ᵥ b",
"usedConstants": [
"Eq.mpr",
"Pi.Function.module",
"NonUnitalCommRing.toNonUnitalNonAssocCommRing",
"Semiring.toModule",
... | adjugate_def | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.LinearAlgebra.Matrix.Transvection | {
"line": 101,
"column": 4
} | {
"line": 103,
"column": 27
} | [
{
"pp": "case neg\nn : Type u_1\nR : Type u₂\ninst✝² : DecidableEq n\ninst✝¹ : CommRing R\ni j : n\ninst✝ : Finite n\nc : R\nval✝ : Fintype n\na b : n\nha : i = a\nhb : ¬j = b\n⊢ updateRow 1 i (1 i + c • 1 j) a b = transvection i j c a b",
"usedConstants": [
"False",
"instHSMul",
"NonUnita... | · simp only [ha, updateRow_self, Pi.add_apply, one_apply, Pi.smul_apply, hb, ↓reduceIte,
smul_eq_mul, mul_zero, add_zero, transvection, add_apply, and_false, not_false_eq_true,
single_apply_of_ne] | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.Algebra.Polynomial.Laurent | {
"line": 433,
"column": 42
} | {
"line": 433,
"column": 53
} | [
{
"pp": "R : Type u_1\ninst✝ : Semiring R\nf : R[T;T⁻¹]\nh : f = 0\n⊢ degree 0 = ⊥",
"usedConstants": [
"Eq.mpr",
"WithBot",
"congrArg",
"AddMonoidAlgebra.nonUnitalNonAssocSemiring",
"LaurentPolynomial",
"NonUnitalNonAssocSemiring.toMulZeroClass",
"id",
"Bot.b... | degree_zero | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.LinearAlgebra.Matrix.Adjugate | {
"line": 366,
"column": 30
} | {
"line": 366,
"column": 39
} | [
{
"pp": "α : Type w\ninst✝ : CommRing α\nn : ℕ\nA : Matrix (Fin n.succ) (Fin n.succ) α\ni j h : Fin n.succ\nhjk : h ≠ i\n⊢ (-1) ^ (↑j + ↑h) * 0 * (A.submatrix j.succAbove h.succAbove).det = 0",
"usedConstants": [
"Fin.succAbove",
"Eq.mpr",
"NegZeroClass.toNeg",
"NonUnitalCommRing.toN... | mul_zero, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Polynomial.Laurent | {
"line": 684,
"column": 8
} | {
"line": 684,
"column": 16
} | [
{
"pp": "case add\nR : Type u_1\nS : Type u_2\ninst✝³ : Semiring R\ninst✝² : AddCommMonoid S\ninst✝¹ : Module R S\ninst✝ : Monoid S\nf : R[T;T⁻¹]\nx : Sˣ\nr : R\np q : R[T;T⁻¹]\nhp : (C r * p).smeval x = r • p.smeval x\nhq : (C r * q).smeval x = r • q.smeval x\n⊢ (C r * (p + q)).smeval x = r • (p + q).smeval x"... | mul_add, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.LinearAlgebra.Matrix.Adjugate | {
"line": 412,
"column": 2
} | {
"line": 412,
"column": 28
} | [
{
"pp": "case mk\nn : Type v\nα : Type w\ninst✝² : DecidableEq n\ninst✝¹ : Fintype n\ninst✝ : CommRing α\nA : Matrix n n α\ni : n\nthis : Nonempty n\nn' : ℕ\nhn' : Fintype.card n = n'.succ\nx✝ : Trunc (n ≃ Fin n'.succ)\ne : n ≃ Fin n'.succ\nA' : Matrix (Fin n'.succ) (Fin n'.succ) α := (reindex e e) A\n⊢ A'.det ... | rw [det_succ_row A' (e i)] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.LinearAlgebra.Dimension.Localization | {
"line": 213,
"column": 4
} | {
"line": 221,
"column": 86
} | [
{
"pp": "case succ\nR : Type u_1\ninst✝¹ : Ring R\ninst✝ : IsDomain R\nr : R\ns : ↥R⁰\nh : ∀ (r' : R) (s' : ↥R⁰), ↑s' * r ≠ r' * ↑s\nn : ℕ\nIH : ∀ (g : ℕ → R) (x : ℕ), ∑ i ∈ Finset.range n, g i • (r * ↑s ^ (i + x)) = 0 → ∀ i < n, g i = 0\ng : ℕ → R\nx : ℕ\nhg : ∑ i ∈ Finset.range (n + 1), g i • (r * ↑s ^ (i + x... | rw [Finset.sum_range_succ'] at hg
by_cases hg0 : g 0 = 0
· simp only [hg0, zero_smul, add_zero, add_assoc] at hg
cases i; exacts [hg0, IH _ _ hg _ (Nat.succ_lt_succ_iff.mp hin)]
simp only [zero_add, pow_add _ _ x,
← mul_assoc, pow_succ, ← Finset.sum_mul, smul_eq_mul] at hg
rw [← neg_eq_iff_a... | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.LinearAlgebra.Dimension.Localization | {
"line": 213,
"column": 4
} | {
"line": 221,
"column": 86
} | [
{
"pp": "case succ\nR : Type u_1\ninst✝¹ : Ring R\ninst✝ : IsDomain R\nr : R\ns : ↥R⁰\nh : ∀ (r' : R) (s' : ↥R⁰), ↑s' * r ≠ r' * ↑s\nn : ℕ\nIH : ∀ (g : ℕ → R) (x : ℕ), ∑ i ∈ Finset.range n, g i • (r * ↑s ^ (i + x)) = 0 → ∀ i < n, g i = 0\ng : ℕ → R\nx : ℕ\nhg : ∑ i ∈ Finset.range (n + 1), g i • (r * ↑s ^ (i + x... | rw [Finset.sum_range_succ'] at hg
by_cases hg0 : g 0 = 0
· simp only [hg0, zero_smul, add_zero, add_assoc] at hg
cases i; exacts [hg0, IH _ _ hg _ (Nat.succ_lt_succ_iff.mp hin)]
simp only [zero_add, pow_add _ _ x,
← mul_assoc, pow_succ, ← Finset.sum_mul, smul_eq_mul] at hg
rw [← neg_eq_iff_a... | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.LinearAlgebra.Matrix.NonsingularInverse | {
"line": 281,
"column": 10
} | {
"line": 281,
"column": 31
} | [
{
"pp": "n : Type u'\nα : Type v\ninst✝³ : Fintype n\ninst✝² : DecidableEq n\ninst✝¹ : CommRing α\nA : Matrix n n α\ninst✝ : Invertible A\nu v : n → α\nhM : u = A *ᵥ v\n⊢ A⁻¹ *ᵥ A *ᵥ v = v",
"usedConstants": [
"Eq.mpr",
"NonUnitalCommRing.toNonUnitalNonAssocCommRing",
"HMul.hMul",
"C... | Matrix.mulVec_mulVec, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.Nilpotent.Lemmas | {
"line": 126,
"column": 2
} | {
"line": 126,
"column": 36
} | [
{
"pp": "case h.h.a.a\nR : Type u_1\nM : Type u_3\ninst✝² : Semiring R\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\nf : End R M\np q : Submodule R M\nhp : MapsTo ⇑f ↑p ↑p\nhq : MapsTo ⇑f ↑q ↑q\nh : p ≤ q\nn : ℕ\nx : M\nhx : x ∈ p\nhn : ⟨(f ^ n) ↑⟨x, ⋯⟩, ⋯⟩ = 0\n⊢ ↑⟨(f ^ n) ↑⟨x, hx⟩, ⋯⟩ = ↑0",
"usedConstan... | exact (congr_arg Subtype.val hn :) | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.RingTheory.Polynomial.Nilpotent | {
"line": 65,
"column": 2
} | {
"line": 66,
"column": 29
} | [
{
"pp": "R : Type u_1\ninst✝ : Semiring R\nP : R[X]\n⊢ IsNilpotent (P * X) ↔ IsNilpotent P",
"usedConstants": [
"Eq.mpr",
"Polynomial.isNilpotent_X_mul_iff",
"HMul.hMul",
"congrArg",
"id",
"Polynomial",
"Monoid.toPow",
"Polynomial.commute_X",
"Iff",
... | rw [← commute_X P]
exact isNilpotent_X_mul_iff | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.RingTheory.Polynomial.Nilpotent | {
"line": 65,
"column": 2
} | {
"line": 66,
"column": 29
} | [
{
"pp": "R : Type u_1\ninst✝ : Semiring R\nP : R[X]\n⊢ IsNilpotent (P * X) ↔ IsNilpotent P",
"usedConstants": [
"Eq.mpr",
"Polynomial.isNilpotent_X_mul_iff",
"HMul.hMul",
"congrArg",
"id",
"Polynomial",
"Monoid.toPow",
"Polynomial.commute_X",
"Iff",
... | rw [← commute_X P]
exact isNilpotent_X_mul_iff | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.RingTheory.MatrixAlgebra | {
"line": 142,
"column": 8
} | {
"line": 142,
"column": 25
} | [
{
"pp": "case a\nl : Type u_1\nm : Type u_2\nn : Type u_3\np : Type u_4\nR : Type u_5\nS : Type u_6\nA : Type u_7\nB : Type u_8\nM : Type u_9\nN : Type u_10\ninst✝⁶ : CommSemiring R\ninst✝⁵ : Semiring A\ninst✝⁴ : Semiring B\ninst✝³ : Algebra R A\ninst✝² : Algebra R B\ninst✝¹ : DecidableEq n\ninst✝ : Fintype n\n... | _root_.mul_assoc, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.RingTheory.Polynomial.Nilpotent | {
"line": 141,
"column": 4
} | {
"line": 141,
"column": 33
} | [
{
"pp": "case left\nR : Type u_1\ninst✝ : CommRing R\nP : R[X]\nhunit : IsUnit P\nQ : R[X]\nhQ : P * Q = 1\nh : P.coeff 0 * Q.coeff 0 = (P * Q).coeff 0\n⊢ P.coeff 0 * Q.coeff 0 = 1",
"usedConstants": [
"NonAssocSemiring.toAddCommMonoidWithOne",
"MulOne.toOne",
"Polynomial.instOne",
"... | rwa [hQ, coeff_one_zero] at h | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tacticRwa___1 | Lean.Parser.Tactic.tacticRwa__ |
Mathlib.RingTheory.IntegralClosure.IsIntegral.Basic | {
"line": 39,
"column": 2
} | {
"line": 40,
"column": 79
} | [
{
"pp": "R : Type u_1\nS : Type u_2\nT : Type u_4\ninst✝² : CommRing R\ninst✝¹ : Ring S\ninst✝ : Ring T\nf : R →+* S\nx : S\nhx : f.IsIntegralElem x\ng : S →+* T\n⊢ (g.comp f).IsIntegralElem (g x)",
"usedConstants": [
"Eq.mpr",
"Polynomial.eval",
"RingHom.instRingHomClass",
"Ring.toN... | obtain ⟨p, hp, hx⟩ := hx
exact ⟨p, hp, by simp_rw [← hom_eval₂, eval₂_eq_eval_map] at hx ⊢; simp [hx]⟩ | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.RingTheory.IntegralClosure.IsIntegral.Basic | {
"line": 39,
"column": 2
} | {
"line": 40,
"column": 79
} | [
{
"pp": "R : Type u_1\nS : Type u_2\nT : Type u_4\ninst✝² : CommRing R\ninst✝¹ : Ring S\ninst✝ : Ring T\nf : R →+* S\nx : S\nhx : f.IsIntegralElem x\ng : S →+* T\n⊢ (g.comp f).IsIntegralElem (g x)",
"usedConstants": [
"Eq.mpr",
"Polynomial.eval",
"RingHom.instRingHomClass",
"Ring.toN... | obtain ⟨p, hp, hx⟩ := hx
exact ⟨p, hp, by simp_rw [← hom_eval₂, eval₂_eq_eval_map] at hx ⊢; simp [hx]⟩ | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.RingTheory.IntegralClosure.IsIntegral.Basic | {
"line": 176,
"column": 4
} | {
"line": 176,
"column": 33
} | [
{
"pp": "case mp\nR : Type u_5\nS : Type u_6\nT : Type u_7\ninst✝⁴ : CommRing R\ninst✝³ : Ring S\ninst✝² : CommRing T\ninst✝¹ : Algebra R S\ninst✝ : Algebra T S\nφ : R ≃+* T\nh : (algebraMap T S).comp φ.toRingHom = algebraMap R S\na : S\nha : IsIntegral R a\nthis✝ : Algebra R T := φ.toRingHom.toAlgebra\nthis : ... | exact IsIntegral.tower_top ha | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.RingTheory.IntegralClosure.IsIntegral.Basic | {
"line": 183,
"column": 4
} | {
"line": 183,
"column": 33
} | [
{
"pp": "case mpr\nR : Type u_5\nS : Type u_6\nT : Type u_7\ninst✝⁴ : CommRing R\ninst✝³ : Ring S\ninst✝² : CommRing T\ninst✝¹ : Algebra R S\ninst✝ : Algebra T S\nφ : R ≃+* T\nh : (algebraMap T S).comp φ.toRingHom = algebraMap R S\na : S\nha : IsIntegral T a\nh' : algebraMap T S = (algebraMap R S).comp φ.symm.t... | exact IsIntegral.tower_top ha | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.Algebra.Polynomial.Lifts | {
"line": 153,
"column": 49
} | {
"line": 153,
"column": 66
} | [
{
"pp": "R : Type u\ninst✝¹ : Semiring R\nS : Type v\ninst✝ : Semiring S\nf : R →+* S\np : S[X]\nhlifts : ∀ (n : ℕ), p.coeff n ∈ Set.range ⇑f\ng : ℕ → R := fun k ↦ Exists.choose ⋯\nhg : ∀ (k : ℕ), f (g k) = p.coeff k\nq : R[X] := ∑ k ∈ p.support, (monomial k) (g k)\nhq : map f q = p\n⊢ ∀ (a : ℕ), (∑ k ∈ p.suppo... | finset_sum_coeff, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.Algebra.Polynomial.Lifts | {
"line": 146,
"column": 55
} | {
"line": 156,
"column": 20
} | [
{
"pp": "R : Type u\ninst✝¹ : Semiring R\nS : Type v\ninst✝ : Semiring S\nf : R →+* S\np : S[X]\nhlifts : p ∈ lifts f\n⊢ ∃ q, map f q = p ∧ q.support = p.support",
"usedConstants": [
"Eq.mpr",
"RingHom.instRingHomClass",
"Exists.choose_spec",
"Subsemiring.instSetLike",
"Semirin... | by
rw [lifts_iff_coeff_lifts] at hlifts
let g : ℕ → R := fun k ↦ (hlifts k).choose
have hg : ∀ k, f (g k) = p.coeff k := fun k ↦ (hlifts k).choose_spec
let q : R[X] := ∑ k ∈ p.support, monomial k (g k)
have hq : map f q = p := by simp_rw [q, Polynomial.map_sum, map_monomial, hg, ← as_sum_support]
have hq' :... | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.Algebra.Polynomial.Lifts | {
"line": 161,
"column": 2
} | {
"line": 162,
"column": 40
} | [
{
"pp": "R : Type u\ninst✝¹ : Semiring R\nS : Type v\ninst✝ : Semiring S\nf : R →+* S\np : S[X]\nhlifts : p ∈ lifts f\n⊢ ∃ q, map f q = p ∧ q.degree = p.degree",
"usedConstants": [
"WithBot",
"congrArg",
"Finset",
"Exists",
"Polynomial.degree",
"Polynomial.exists_support_... | obtain ⟨q, hq, hq'⟩ := exists_support_eq_of_mem_lifts hlifts
exact ⟨q, hq, congrArg Finset.max hq'⟩ | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Algebra.Polynomial.Lifts | {
"line": 161,
"column": 2
} | {
"line": 162,
"column": 40
} | [
{
"pp": "R : Type u\ninst✝¹ : Semiring R\nS : Type v\ninst✝ : Semiring S\nf : R →+* S\np : S[X]\nhlifts : p ∈ lifts f\n⊢ ∃ q, map f q = p ∧ q.degree = p.degree",
"usedConstants": [
"WithBot",
"congrArg",
"Finset",
"Exists",
"Polynomial.degree",
"Polynomial.exists_support_... | obtain ⟨q, hq, hq'⟩ := exists_support_eq_of_mem_lifts hlifts
exact ⟨q, hq, congrArg Finset.max hq'⟩ | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.RingTheory.IntegralClosure.IsIntegral.Basic | {
"line": 219,
"column": 52
} | {
"line": 219,
"column": 66
} | [
{
"pp": "case empty\nR : Type u_1\nA : Type u_2\ninst✝² : CommRing R\ninst✝¹ : CommRing A\ninst✝ : Algebra R A\ns : Set A\nhis : ∀ x ∈ ∅, IsIntegral R x\nx : A\n⊢ x ∈ R ∙ 1 ↔ x ∈ Subalgebra.toSubmodule ⊥",
"usedConstants": [
"Eq.mpr",
"NonAssocSemiring.toAddCommMonoidWithOne",
"Submodule",... | ← one_eq_span, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.IntegralClosure.IsIntegral.Basic | {
"line": 252,
"column": 74
} | {
"line": 252,
"column": 83
} | [
{
"pp": "R : Type u_1\nA : Type u_2\nB : Type u_3\ninst✝⁴ : CommRing R\ninst✝³ : Ring A\ninst✝² : Ring B\ninst✝¹ : Algebra R A\ninst✝ : Algebra R B\nx : A × B\np₁ : R[X]\nhp₁Monic : p₁.Monic\nhp₁Eval : (aeval x.1) p₁ = 0\np₂ : R[X]\nhp₂Monic : p₂.Monic\nhp₂Eval : (aeval x.2) p₂ = 0\n⊢ (0, (aeval x.2) p₁ * 0) = ... | mul_zero, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff | {
"line": 212,
"column": 52
} | {
"line": 225,
"column": 50
} | [
{
"pp": "R : Type u\ninst✝³ : CommRing R\nn : Type v\ninst✝² : DecidableEq n\ninst✝¹ : Fintype n\nM : Matrix n n R\ninst✝ : Nontrivial R\nhn : Fintype.card n = 2\n⊢ M.charpoly = X ^ 2 - C M.trace * X + C M.det",
"usedConstants": [
"one_pow",
"Eq.mpr",
"Polynomial.C",
"NegZeroClass.to... | by
have : Nonempty n := by rw [← Fintype.card_pos_iff]; lia
ext i
by_cases hi : i ∈ Finset.range 3
· fin_cases hi
· simp [det_eq_sign_charpoly_coeff, hn]
· simp [trace_eq_neg_charpoly_coeff, hn]
· simpa [leadingCoeff, charpoly_natDegree_eq_dim, hn, coeff_X] using
M.charpoly_monic.leadingCoef... | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.RingTheory.IntegralClosure.Algebra.Basic | {
"line": 108,
"column": 7
} | {
"line": 108,
"column": 40
} | [
{
"pp": "R : Type u_1\nA : Type u_2\ninst✝⁸ : CommRing R\ninst✝⁷ : CommRing A\ninst✝⁶ : Algebra R A\ninst✝⁵ : IsDomain A\nM : Type u_5\ninst✝⁴ : AddCommGroup M\ninst✝³ : Module R M\ninst✝² : Module A M\ninst✝¹ : IsScalarTower R A M\ninst✝ : Module.IsTorsionFree A M\nN : Submodule R M\nhN : N ≠ ⊥\nhN' : N.FG\nx ... | by intro x y; ext; apply mul_smul | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.RingTheory.IntegralClosure.Algebra.Basic | {
"line": 139,
"column": 44
} | {
"line": 139,
"column": 63
} | [
{
"pp": "R : Type u_1\nS : Type u_4\ninst✝¹ : CommRing R\ninst✝ : CommRing S\nf : R →+* S\nx y z : S\nhx : f.IsIntegralElem x\nhy : f.IsIntegralElem y\nhz : z ∈ Subring.closure {x, y}\nthis✝ : Algebra R S := f.toAlgebra\nthis : (Subalgebra.toSubmodule (Algebra.adjoin R ({x} ∪ {y}))).FG\n⊢ f.IsIntegralElem z",
... | Set.singleton_union | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.IntegralClosure.Algebra.Basic | {
"line": 238,
"column": 2
} | {
"line": 240,
"column": 61
} | [
{
"pp": "R : Type u_1\nA : Type u_2\nB : Type u_3\ninst✝⁴ : CommRing R\ninst✝³ : CommRing A\ninst✝² : Ring B\ninst✝¹ : Algebra R A\ninst✝ : Algebra R B\nx : A\ny : B\nh : IsIntegral R y\n⊢ IsIntegral A (x • 1 ⊗ₜ[R] y)",
"usedConstants": [
"MulOne.toOne",
"Algebra.to_smulCommClass",
"NonUni... | exact smul _ (h.map_of_comp_eq (algebraMap R A)
(Algebra.TensorProduct.includeRight (R := R) (A := A) (B := B)).toRingHom
Algebra.TensorProduct.includeLeftRingHom_comp_algebraMap) | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.Algebra.Polynomial.HasseDeriv | {
"line": 144,
"column": 2
} | {
"line": 144,
"column": 67
} | [
{
"pp": "case succ.h.a.e_a.e_a.e_a\nR : Type u_1\ninst✝ : Semiring R\nk✝ k : ℕ\nih : ⇑(k ! • hasseDeriv k) = (⇑derivative)^[k]\nf : R[X]\nn : ℕ\nthis : n + k + 1 = n + (k + 1)\n⊢ (k + 1) * (n + k + 1).choose (k + 1) = (n + k + 1).choose (n + 1) * (n + 1)",
"usedConstants": [
"Eq.mpr",
"Semigroup... | rw [← choose_symm_of_eq_add this, choose_succ_right_eq, mul_comm] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.Algebra.Polynomial.HasseDeriv | {
"line": 179,
"column": 25
} | {
"line": 179,
"column": 42
} | [
{
"pp": "R : Type u_1\ninst✝ : Semiring R\np : R[X]\nn : ℕ\n⊢ max (Finset.fold max 0 (fun x ↦ 0) ({x ∈ p.support | ↑(x.choose n) * p.coeff x = 0}))\n (Finset.fold max 0 (fun x ↦ x - n) ({i ∈ p.support | ¬↑(i.choose n) * p.coeff i = 0})) ≤\n p.natDegree - n",
"usedConstants": [
"Eq.mpr",
... | Finset.fold_const | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Polynomial.HasseDeriv | {
"line": 225,
"column": 8
} | {
"line": 225,
"column": 24
} | [
{
"pp": "R : Type u_1\ninst✝ : Semiring R\nk : ℕ\nD : ℕ → R[X] →+ R[X] := fun k ↦ (hasseDeriv k).toAddMonoidHom\nΦ : R[X] →+ R[X] →+ R[X] := mul\nm : ℕ\nr : R\nn : ℕ\ns : R\nx : ℕ × ℕ\nhx : x ∈ antidiagonal k\n⊢ (monomial (m - x.1 + (n - x.2))) (↑(m.choose x.1) * r * (↑(n.choose x.2) * s)) =\n (monomial (m +... | mem_antidiagonal | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.Ideal.GoingUp | {
"line": 56,
"column": 4
} | {
"line": 56,
"column": 58
} | [
{
"pp": "case refine_2\nR : Type u_1\ninst✝¹ : CommRing R\nS : Type u_2\ninst✝ : CommRing S\nf : R →+* S\nI : Ideal S\nr : S\nr_non_zero_divisor : ∀ {x : S}, x * r = 0 → x = 0\nhr : r ∈ I\np✝ p : R[X]\na : R\ncoeff_eq_zero : p.coeff 0 = 0\na_ne_zero : a ≠ 0\na✝¹ : p ≠ 0 → eval₂ f r p = 0 → ∃ i, p.coeff i ≠ 0 ∧ ... | refine ⟨0, ?_, coeff_zero_mem_comap_of_root_mem hr hp⟩ | Lean.Elab.Tactic.evalRefine | Lean.Parser.Tactic.refine |
Mathlib.Algebra.Polynomial.Splits | {
"line": 599,
"column": 2
} | {
"line": 599,
"column": 30
} | [
{
"pp": "case ha\nR : Type u_1\ninst✝ : Field R\nf : R[X]\nhf : f.Splits\nx : R\nhx : eval x f ≠ 0\nz : R\nhz : z ∈ f.roots\n⊢ x - z ≠ 0",
"usedConstants": [
"Eq.mpr",
"Polynomial.eval",
"False",
"Polynomial.roots",
"NonUnitalCommRing.toNonUnitalNonAssocCommRing",
"CommRi... | aesop (add simp sub_eq_zero) | Aesop.evalAesop | Aesop.Frontend.Parser.aesopTactic |
Mathlib.RingTheory.Localization.Integral | {
"line": 247,
"column": 6
} | {
"line": 247,
"column": 23
} | [
{
"pp": "case neg\nR : Type u_1\ninst✝³ : CommRing R\nM : Submonoid R\nRₘ : Type u_3\ninst✝² : CommRing Rₘ\ninst✝¹ : Algebra R Rₘ\ninst✝ : IsLocalization M Rₘ\np : Rₘ[X]\nhp : p.leadingCoeff ∈ (algebraMap R Rₘ).range\nn : ℕ\nh₁ : n ∈ p.support\nh₂ : ¬n = p.natDegree\nthis : n + 1 ≤ p.natDegree\n⊢ (algebraMap R ... | _root_.mul_assoc, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.Localization.Integral | {
"line": 356,
"column": 15
} | {
"line": 356,
"column": 32
} | [
{
"pp": "R : Type u_1\ninst✝² : CommRing R\nS : Type u_2\ninst✝¹ : CommRing S\ninst✝ : Algebra R S\nt s : S\nhst : s * t = 1\nht : IsIntegral (↥R[s]) t\na✝ : Nontrivial S\nφ : R[X] →ₐ[R] S := ⋯\nq : R[X][X]\nhqm : q.Monic\nhqt : eval₂ φ.toRingHom t q = 0\nN : ℕ := ⋯\nhN : ∀ (i : ℕ), (q.coeff i).natDegree ≤ N\nq... | mul_comm (t ^ _), | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.RingTheory.Flat.FaithfullyFlat.Basic | {
"line": 574,
"column": 2
} | {
"line": 579,
"column": 52
} | [
{
"pp": "R : Type u\nM : Type v\ninst✝⁹ : CommRing R\ninst✝⁸ : AddCommGroup M\ninst✝⁷ : Module R M\nS : Type u_1\nN : Type u_2\ninst✝⁶ : CommRing S\ninst✝⁵ : Algebra R S\ninst✝⁴ : FaithfullyFlat R S\ninst✝³ : AddCommGroup N\ninst✝² : Module R N\ninst✝¹ : Module S N\ninst✝ : IsScalarTower R S N\nf : M →ₗ[R] N\nh... | simpa only [← Submodule.Quotient.subsingleton_iff.not] using not_congr <|
(tensorQuotEquivQuotSMul N (I.map (algebraMap R S))).symm ≪≫ₗ TensorProduct.comm S N _ ≪≫ₗ
hf.tensorEquiv _ ≪≫ₗ AlgebraTensorModule.congr (I.qoutMapEquivTensorQout S) (.refl R M) ≪≫ₗ
AlgebraTensorModule.assoc R R S S _ M ≪≫ₗ (Te... | Lean.Elab.Tactic.Simpa.evalSimpa | Lean.Parser.Tactic.simpa |
Mathlib.RingTheory.Flat.FaithfullyFlat.Basic | {
"line": 574,
"column": 2
} | {
"line": 579,
"column": 52
} | [
{
"pp": "R : Type u\nM : Type v\ninst✝⁹ : CommRing R\ninst✝⁸ : AddCommGroup M\ninst✝⁷ : Module R M\nS : Type u_1\nN : Type u_2\ninst✝⁶ : CommRing S\ninst✝⁵ : Algebra R S\ninst✝⁴ : FaithfullyFlat R S\ninst✝³ : AddCommGroup N\ninst✝² : Module R N\ninst✝¹ : Module S N\ninst✝ : IsScalarTower R S N\nf : M →ₗ[R] N\nh... | simpa only [← Submodule.Quotient.subsingleton_iff.not] using not_congr <|
(tensorQuotEquivQuotSMul N (I.map (algebraMap R S))).symm ≪≫ₗ TensorProduct.comm S N _ ≪≫ₗ
hf.tensorEquiv _ ≪≫ₗ AlgebraTensorModule.congr (I.qoutMapEquivTensorQout S) (.refl R M) ≪≫ₗ
AlgebraTensorModule.assoc R R S S _ M ≪≫ₗ (Te... | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.RingTheory.Flat.FaithfullyFlat.Basic | {
"line": 574,
"column": 2
} | {
"line": 579,
"column": 52
} | [
{
"pp": "R : Type u\nM : Type v\ninst✝⁹ : CommRing R\ninst✝⁸ : AddCommGroup M\ninst✝⁷ : Module R M\nS : Type u_1\nN : Type u_2\ninst✝⁶ : CommRing S\ninst✝⁵ : Algebra R S\ninst✝⁴ : FaithfullyFlat R S\ninst✝³ : AddCommGroup N\ninst✝² : Module R N\ninst✝¹ : Module S N\ninst✝ : IsScalarTower R S N\nf : M →ₗ[R] N\nh... | simpa only [← Submodule.Quotient.subsingleton_iff.not] using not_congr <|
(tensorQuotEquivQuotSMul N (I.map (algebraMap R S))).symm ≪≫ₗ TensorProduct.comm S N _ ≪≫ₗ
hf.tensorEquiv _ ≪≫ₗ AlgebraTensorModule.congr (I.qoutMapEquivTensorQout S) (.refl R M) ≪≫ₗ
AlgebraTensorModule.assoc R R S S _ M ≪≫ₗ (Te... | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.RingTheory.SurjectiveOnStalks | {
"line": 142,
"column": 13
} | {
"line": 142,
"column": 22
} | [
{
"pp": "R : Type u_1\ninst✝⁴ : CommRing R\nS : Type u_2\ninst✝³ : CommRing S\nT : Type u_3\ninst✝² : CommRing T\ninst✝¹ : Algebra R T\ninst✝ : Algebra R S\nhf₂ : (algebraMap R T).SurjectiveOnStalks\nJ : Ideal T\nhJ : J.IsPrime\n⊢ 1 ⊗ₜ[R] (1 • 1) * 0 = 0 ⊗ₜ[R] 1",
"usedConstants": [
"Eq.mpr",
"A... | mul_zero, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.SurjectiveOnStalks | {
"line": 155,
"column": 72
} | {
"line": 155,
"column": 80
} | [
{
"pp": "case add\nR : Type u_1\ninst✝⁴ : CommRing R\nS : Type u_2\ninst✝³ : CommRing S\nT : Type u_3\ninst✝² : CommRing T\ninst✝¹ : Algebra R T\ninst✝ : Algebra R S\nhf₂ : (algebraMap R T).SurjectiveOnStalks\nJ : Ideal T\nhJ : J.IsPrime\nx₁ x₂ : S ⊗[R] T\nt₁ : T\nr₁ : R\na₁ : S\nhr₁ : r₁ • t₁ ∉ J\ne₁ : 1 ⊗ₜ[R]... | mul_add, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Order.Ring.Idempotent | {
"line": 60,
"column": 39
} | {
"line": 60,
"column": 48
} | [
{
"pp": "R : Type u_1\ninst✝ : CommSemiring R\na✝ b✝ a b : { a // a.1 * a.2 = 0 ∧ a.1 + a.2 = 1 }\n⊢ (↑a).1 * ((↑a).2 * (↑b).2) + (↑a).2 * (↑a).2 * 0 = 0",
"usedConstants": [
"Eq.mpr",
"NonAssocSemiring.toAddCommMonoidWithOne",
"HMul.hMul",
"CommSemiring.toNonUnitalCommSemiring",
... | mul_zero, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.Algebra.Order.Ring.Idempotent | {
"line": 63,
"column": 22
} | {
"line": 63,
"column": 30
} | [
{
"pp": "R : Type u_1\ninst✝ : CommSemiring R\na✝ b✝ a b : { a // a.1 * a.2 = 0 ∧ a.1 + a.2 = 1 }\n⊢ (↑a).1 * ((↑a).1 + (↑a).2 * (↑b).1) = (↑a).1",
"usedConstants": [
"Distrib.leftDistribClass",
"Eq.mpr",
"NonAssocSemiring.toAddCommMonoidWithOne",
"HMul.hMul",
"congrArg",
... | mul_add, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.Algebra.Order.Ring.Idempotent | {
"line": 66,
"column": 22
} | {
"line": 66,
"column": 30
} | [
{
"pp": "R : Type u_1\ninst✝ : CommSemiring R\na✝ b✝ a b : { a // a.1 * a.2 = 0 ∧ a.1 + a.2 = 1 }\n⊢ (↑b).1 * ((↑a).1 + (↑a).2 * (↑b).1) = (↑b).1",
"usedConstants": [
"Distrib.leftDistribClass",
"Eq.mpr",
"NonAssocSemiring.toAddCommMonoidWithOne",
"HMul.hMul",
"congrArg",
... | mul_add, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.Algebra.Order.Ring.Idempotent | {
"line": 79,
"column": 77
} | {
"line": 79,
"column": 85
} | [
{
"pp": "R : Type u_1\ninst✝ : CommSemiring R\na✝ b✝ a b c : { a // a.1 * a.2 = 0 ∧ a.1 + a.2 = 1 }\n⊢ (↑a).2 * (↑b).2 + ((↑a).1 * ((↑a).2 * (↑c).2) + (↑a).2 * (↑b).1 * ((↑a).2 * (↑c).2)) =\n (↑a).2 * ((↑b).2 + (↑b).1 * (↑c).2)",
"usedConstants": [
"Distrib.leftDistribClass",
"Eq.mpr",
... | mul_add, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.RingTheory.Algebraic.Integral | {
"line": 70,
"column": 2
} | {
"line": 70,
"column": 21
} | [
{
"pp": "K : Type u\nA : Type v\ninst✝² : Field K\ninst✝¹ : Ring A\ninst✝ : Algebra K A\nx : A\n⊢ IsAlgebraic K x → IsIntegral K x",
"usedConstants": [
"IsAlgebraic",
"EuclideanDomain.toCommRing",
"Field.toEuclideanDomain"
]
}
] | rintro ⟨p, hp, hpx⟩ | _private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalRIntro | Lean.Parser.Tactic.rintro |
Mathlib.Algebra.Order.Ring.Idempotent | {
"line": 130,
"column": 35
} | {
"line": 130,
"column": 43
} | [
{
"pp": "R : Type u_1\ninst✝ : CommRing R\na b c : { x // IsIdempotentElem x }\n⊢ ↑a * (↑b + ↑c) - ↑a * (↑b * ↑c) = ↑a * ↑b + ↑a * ↑c - ↑a * ↑b * (↑a * ↑c)",
"usedConstants": [
"Distrib.leftDistribClass",
"Eq.mpr",
"NonUnitalCommRing.toNonUnitalNonAssocCommRing",
"HMul.hMul",
"... | mul_add, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.RingTheory.Algebraic.Integral | {
"line": 240,
"column": 2
} | {
"line": 246,
"column": 63
} | [
{
"pp": "case pos\nR : Type u_1\nS : Type u_2\nA : Type u_3\ninst✝⁸ : CommRing R\ninst✝⁷ : CommRing S\ninst✝⁶ : Ring A\ninst✝⁵ : Algebra R S\ninst✝⁴ : Algebra R A\ninst✝³ : Algebra S A\ninst✝² : IsScalarTower R S A\ninst✝¹ : NoZeroDivisors S\ninst✝ : Algebra.IsAlgebraic R S\na : A\nh : IsAlgebraic S a\np✝ : S[X... | have : IsAlgebraic (integralClosure R S) a := by
refine ⟨p, ?_, ?_⟩
· simpa only [← Polynomial.map_ne_zero_iff (f := Subring.subtype _) (p := p)
Subtype.val_injective, p, map_toSubring, smul_ne_zero_iff] using And.intro hr hp
rw [← eval_map_algebraMap, Subalgebra.algebraMap_eq, ← map_map, ← Subalgeb... | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tacticHave___1 | Lean.Parser.Tactic.tacticHave__ |
Mathlib.Data.ENat.Lattice | {
"line": 132,
"column": 2
} | {
"line": 136,
"column": 76
} | [
{
"pp": "case inr.inr.coe\nι : Sort u_2\na : ℕ∞\nf : ι → ℕ∞\nhne : a ≠ 0\nhι : Nonempty ι\nd : ℕ\nh : ∀ (i : ι), a * f i ≤ ↑d\n⊢ a * ⨆ i, f i ≤ ↑d",
"usedConstants": [
"Eq.mpr",
"ENat.self_le_mul_left",
"False",
"Preorder.toLT",
"Lattice.toSemilatticeSup",
"instCompleteLi... | have hlt : ⨆ i, f i < ⊤ := by
rw [lt_top_iff_ne_top]
intro htop
obtain ⟨i, hi : d < f i⟩ := (iSup_eq_top ..).1 htop d (by simp)
exact (((h i).trans_lt hi).trans_le (ENat.self_le_mul_left _ hne)).false | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tacticHave___1 | Lean.Parser.Tactic.tacticHave__ |
Mathlib.RingTheory.Ideal.MinimalPrime.Localization | {
"line": 75,
"column": 2
} | {
"line": 75,
"column": 84
} | [
{
"pp": "R : Type u_1\ninst✝ : CommSemiring R\nI p : Ideal R\nhp : p ∈ I.minimalPrimes\nx : R\nhx : x ∈ p\n⊢ ∃ y ∉ I, x * y ∈ I",
"usedConstants": [
"Semiring.toModule",
"HMul.hMul",
"Ideal.minimalPrimes",
"CommSemiring.toSemiring",
"setOf",
"Membership.mem",
"Exist... | obtain ⟨y, hy, n, hx⟩ := Ideal.iUnion_minimalPrimes.subset (Set.mem_biUnion hp hx) | _private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalObtain | Lean.Parser.Tactic.obtain |
Mathlib.RingTheory.Algebraic.Integral | {
"line": 409,
"column": 2
} | {
"line": 409,
"column": 56
} | [
{
"pp": "R : Type u_1\nS : Type u_2\ninst✝³ : CommRing R\ninst✝² : CommRing S\ninst✝¹ : Algebra R S\ninst✝ : NoZeroDivisors R\ny z : S\nhy : y ∈ nonZeroDivisors S\nalg_y : IsAlgebraic R y\nalg_yz : IsAlgebraic R (y * z)\nt : S\nht : t ∈ R[y]\nr : R\nhr : r ≠ 0\neq : y * t = (algebraMap R S) r\nthis : IsAlgebrai... | exact this.of_smul (mem_nonZeroDivisors_of_ne_zero hr) | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.Data.ENat.Lattice | {
"line": 233,
"column": 67
} | {
"line": 233,
"column": 92
} | [
{
"pp": "ι : Type u_4\ninst✝¹ : Preorder ι\ninst✝ : IsDirectedOrder ι\nf g : ι → ℕ∞\nhf : Monotone f\nhg : Monotone g\ni j _k : ι\nx✝ : i ≤ _k ∧ j ≤ _k\nhi : i ≤ _k\nhj : j ≤ _k\n⊢ f i + g j ≤ f _k + g _k",
"usedConstants": [
"instCompleteLinearOrderENat",
"CommSemiring.toSemiring",
"covar... | by gcongr <;> apply_rules | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.Data.ENat.Lattice | {
"line": 264,
"column": 66
} | {
"line": 264,
"column": 95
} | [
{
"pp": "a : ℕ∞\ns : Set ℕ∞\n⊢ sInf s + a = ⨅ b ∈ s, b + a",
"usedConstants": [
"iInf",
"instCompleteLinearOrderENat",
"congrArg",
"CompletelyDistribLattice.toCompleteLattice",
"Membership.mem",
"instAddENat",
"ConditionallyCompleteLinearOrder.toConditionallyComplet... | simp [sInf_eq_iInf, iInf_add] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.Data.ENat.Lattice | {
"line": 264,
"column": 66
} | {
"line": 264,
"column": 95
} | [
{
"pp": "a : ℕ∞\ns : Set ℕ∞\n⊢ sInf s + a = ⨅ b ∈ s, b + a",
"usedConstants": [
"iInf",
"instCompleteLinearOrderENat",
"congrArg",
"CompletelyDistribLattice.toCompleteLattice",
"Membership.mem",
"instAddENat",
"ConditionallyCompleteLinearOrder.toConditionallyComplet... | simp [sInf_eq_iInf, iInf_add] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Data.ENat.Lattice | {
"line": 264,
"column": 66
} | {
"line": 264,
"column": 95
} | [
{
"pp": "a : ℕ∞\ns : Set ℕ∞\n⊢ sInf s + a = ⨅ b ∈ s, b + a",
"usedConstants": [
"iInf",
"instCompleteLinearOrderENat",
"congrArg",
"CompletelyDistribLattice.toCompleteLattice",
"Membership.mem",
"instAddENat",
"ConditionallyCompleteLinearOrder.toConditionallyComplet... | simp [sInf_eq_iInf, iInf_add] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Data.ENat.Lattice | {
"line": 279,
"column": 67
} | {
"line": 279,
"column": 92
} | [
{
"pp": "ι : Type u_4\ninst✝¹ : Preorder ι\ninst✝ : IsCodirectedOrder ι\nf g : ι → ℕ∞\nhf : Monotone f\nhg : Monotone g\ni j _k : ι\nx✝ : _k ≤ i ∧ _k ≤ j\nhi : _k ≤ i\nhj : _k ≤ j\n⊢ f _k + g _k ≤ f i + g j",
"usedConstants": [
"instCompleteLinearOrderENat",
"CommSemiring.toSemiring",
"cov... | by gcongr <;> apply_rules | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.RingTheory.Spectrum.Maximal.Basic | {
"line": 46,
"column": 95
} | {
"line": 47,
"column": 72
} | [
{
"pp": "R : Type u_1\ninst✝ : CommSemiring R\nx✝¹ x✝ : MaximalSpectrum R\nasIdeal✝¹ : Ideal R\nisMaximal✝¹ : asIdeal✝¹.IsMaximal\nasIdeal✝ : Ideal R\nisMaximal✝ : asIdeal✝.IsMaximal\nh :\n { asIdeal := asIdeal✝¹, isMaximal := isMaximal✝¹ }.toPrimeSpectrum =\n { asIdeal := asIdeal✝, isMaximal := isMaximal✝ ... | by
simpa only [MaximalSpectrum.mk.injEq] using PrimeSpectrum.ext_iff.mp h | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.Order.RelSeries | {
"line": 196,
"column": 6
} | {
"line": 196,
"column": 23
} | [
{
"pp": "α : Type u_1\nr : SetRel α α\ns : RelSeries r\nx : α\n⊢ x ∈ s.toList ↔ x ∈ s",
"usedConstants": [
"Eq.mpr",
"congrArg",
"List.ofFn",
"Membership.mem",
"id",
"RelSeries.length",
"RelSeries.toList",
"instOfNatNat",
"RelSeries",
"List",
... | RelSeries.toList, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Topology.Compactness.Bases | {
"line": 62,
"column": 6
} | {
"line": 62,
"column": 49
} | [
{
"pp": "case mpr.left\nX : Type u_1\nι : Type u_2\ninst✝ : TopologicalSpace X\nb : ι → Set X\nhb : IsTopologicalBasis (range b)\nhb' : ∀ (i : ι), IsCompact (b i)\ns : Set ι\nhs : s.Finite\n⊢ IsCompact (⋃ i ∈ s, b i)",
"usedConstants": [
"Membership.mem",
"Set.Finite.isCompact_biUnion",
"S... | exact hs.isCompact_biUnion fun i _ => hb' i | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.Topology.Compactness.Bases | {
"line": 62,
"column": 6
} | {
"line": 62,
"column": 49
} | [
{
"pp": "case mpr.left\nX : Type u_1\nι : Type u_2\ninst✝ : TopologicalSpace X\nb : ι → Set X\nhb : IsTopologicalBasis (range b)\nhb' : ∀ (i : ι), IsCompact (b i)\ns : Set ι\nhs : s.Finite\n⊢ IsCompact (⋃ i ∈ s, b i)",
"usedConstants": [
"Membership.mem",
"Set.Finite.isCompact_biUnion",
"S... | exact hs.isCompact_biUnion fun i _ => hb' i | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Topology.Compactness.Bases | {
"line": 62,
"column": 6
} | {
"line": 62,
"column": 49
} | [
{
"pp": "case mpr.left\nX : Type u_1\nι : Type u_2\ninst✝ : TopologicalSpace X\nb : ι → Set X\nhb : IsTopologicalBasis (range b)\nhb' : ∀ (i : ι), IsCompact (b i)\ns : Set ι\nhs : s.Finite\n⊢ IsCompact (⋃ i ∈ s, b i)",
"usedConstants": [
"Membership.mem",
"Set.Finite.isCompact_biUnion",
"S... | exact hs.isCompact_biUnion fun i _ => hb' i | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Order.KrullDimension | {
"line": 360,
"column": 32
} | {
"line": 360,
"column": 45
} | [
{
"pp": "case coe\nα : Type u_1\ninst✝ : Preorder α\na : α\nn : ℕ\nhne : Nonempty { p // RelSeries.last p = a }\nm : ℕ\nh : n ≤ m\nha : ⨆ p, ⨆ (_ : RelSeries.last p = a), ↑p.length = ↑m\n⊢ ∃ p, RelSeries.last p = a ∧ p.length = n",
"usedConstants": [
"Preorder.toLT",
"instCompleteLinearOrderENat... | iSup_subtype' | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Order.KrullDimension | {
"line": 405,
"column": 82
} | {
"line": 410,
"column": 13
} | [
{
"pp": "α : Type u_1\ninst✝ : Preorder α\nx : α\nn : ℕ\n⊢ height x ≤ ↑n ↔ ∀ y < x, height y < ↑n",
"usedConstants": [
"Eq.mpr",
"ENat.coe_ne_top._simp_1",
"False",
"Preorder.toLT",
"instCompleteLinearOrderENat",
"instCharZeroENat",
"instAddMonoidWithOneENat",
... | by
conv_lhs => rw [height_eq_iSup_lt_height, iSup₂_le_iff]
congr! 2 with y _
cases height y
· simp
· norm_cast | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.Order.KrullDimension | {
"line": 819,
"column": 8
} | {
"line": 819,
"column": 75
} | [
{
"pp": "case h.coe.coe\nα✝ : Type u_1\ninst✝² : Preorder α✝\nα : Type u_1\ninst✝¹ : Preorder α\ninst✝ : Nonempty α\nhnottop : krullDim α < ⊤\na : α\nthis✝ : height a < ⊤\nthis : coheight a < ⊤\nn : ℕ\nhh : height a = ↑n\nm : ℕ\nhch : coheight a = ↑m\np₁ : LTSeries α\nhlast : RelSeries.last p₁ = a\nhlen₁ : p₁.l... | obtain ⟨p₂, hhead, hlen₂⟩ := exists_series_of_coheight_eq_coe a hch | _private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalObtain | Lean.Parser.Tactic.obtain |
Mathlib.Order.KrullDimension | {
"line": 1027,
"column": 23
} | {
"line": 1027,
"column": 88
} | [
{
"pp": "α : Type u_1\ninst✝ : Preorder α\nx : α\np : LTSeries (WithTop α)\nhlast : RelSeries.last p = ↑x\ni : Fin p.length\n⊢ ((p.toFun i.castSucc).untop ⋯, (p.toFun i.succ).untop ⋯) ∈ {(a, b) | a < b}",
"usedConstants": [
"Eq.mpr",
"lt_of_le_of_lt",
"Preorder.toLT",
"SetRel",
... | by simpa [WithTop.untop_lt_iff, WithTop.coe_untop] using p.step i | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.Order.KrullDimension | {
"line": 1046,
"column": 21
} | {
"line": 1046,
"column": 34
} | [
{
"pp": "α : Type u_1\ninst✝¹ : Preorder α\ninst✝ : Nonempty α\n⊢ ⨆ y, ⨆ (_ : y ≠ ⊤), height y + 1 = ⨆ i, height i + 1",
"usedConstants": [
"Eq.mpr",
"instCompleteLinearOrderENat",
"instAddMonoidWithOneENat",
"WithTop.instPreorder",
"congrArg",
"iSup",
"CompletelyDi... | iSup_subtype' | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Order.KrullDimension | {
"line": 1059,
"column": 2
} | {
"line": 1059,
"column": 64
} | [
{
"pp": "⊢ krullDim (WithTop ℕ) = ⊤",
"usedConstants": [
"Order.krullDim_of_noMaxOrder",
"WithBot.some",
"WithBot",
"instAddMonoidWithOneENat",
"instTopENat",
"WithTop.instPreorder",
"congrArg",
"PartialOrder.toPreorder",
"LinearOrderedAddCommMonoidWithT... | simp [← WithBot.coe_top, ← WithBot.coe_one, ← WithBot.coe_add] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.Order.Ideal | {
"line": 347,
"column": 8
} | {
"line": 347,
"column": 43
} | [
{
"pp": "P : Type u_1\ninst✝¹ : SemilatticeSup P\ninst✝ : IsCodirectedOrder P\nx : P\nI✝ J✝ s t I J : Ideal P\n⊢ {x | ∃ i ∈ I, ∃ j ∈ J, x ≤ i ⊔ j}.Nonempty",
"usedConstants": [
"PartialOrder.toPreorder",
"Preorder.toLE",
"Order.Ideal.inter_nonempty",
"SemilatticeSup.toPartialOrder"
... | obtain ⟨w, h⟩ := inter_nonempty I J | _private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalObtain | Lean.Parser.Tactic.obtain |
Mathlib.Topology.QuasiSeparated | {
"line": 165,
"column": 4
} | {
"line": 165,
"column": 76
} | [
{
"pp": "case insert.inr\nα✝ : Type u_1\ninst✝² : TopologicalSpace α✝\nα : Type u_1\ninst✝¹ : TopologicalSpace α\ninst✝ : QuasiSeparatedSpace α\ns✝ : Set (Set α)\na✝ : Set α\ns : Set (Set α)\nha : a✝ ∉ s\nhs : s.Finite\nih : (∀ t ∈ s, IsOpen t ∨ IsClosed t) → (∀ t ∈ s, IsCompact t) → (∀ t ∈ s, IsOpen t) → s.Non... | · grind [IsCompact.inter_of_isOpen, hs.isOpen_sInter, Set.sInter_insert] | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.Topology.Sets.Compacts | {
"line": 627,
"column": 2
} | {
"line": 629,
"column": 53
} | [
{
"pp": "α : Type u_1\nβ : Type u_2\nγ : Type u_3\ninst✝⁴ : TopologicalSpace α\ninst✝³ : TopologicalSpace β\ninst✝² : TopologicalSpace γ\ninst✝¹ : WeaklyLocallyCompactSpace α\ninst✝ : Nonempty α\n⊢ Nonempty (PositiveCompacts α)",
"usedConstants": [
"Filter.instMembership",
"Iff.mpr",
"Inha... | inhabit α
rcases exists_compact_mem_nhds (default : α) with ⟨K, hKc, hK⟩
exact ⟨⟨K, hKc⟩, _, mem_interior_iff_mem_nhds.2 hK⟩ | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.