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.Topology.Sheaves.SheafCondition.Sites | {
"line": 150,
"column": 2
} | {
"line": 155,
"column": 16
} | [
{
"pp": "X Y : TopCat\nf : X ⟶ Y\nhf : IsOpenEmbedding ⇑(ConcreteCategory.hom f)\n⊢ CompatiblePreserving (Opens.grothendieckTopology ↑Y) hf.functor",
"usedConstants": [
"Iff.mpr",
"Topology.IsOpenEmbedding.toIsEmbedding",
"CategoryTheory.Mono",
"CategoryTheory.CategoryStruct.toQuiver... | haveI : Mono f := (TopCat.mono_iff_injective f).mpr hf.injective
apply compatiblePreservingOfDownwardsClosed
intro U V i
refine ⟨(Opens.map f).obj V, eqToIso <| Opens.ext <| Set.image_preimage_eq_of_subset fun x h ↦ ?_⟩
obtain ⟨_, _, rfl⟩ := i.le h
exact ⟨_, rfl⟩ | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Topology.Sheaves.SheafCondition.Sites | {
"line": 150,
"column": 2
} | {
"line": 155,
"column": 16
} | [
{
"pp": "X Y : TopCat\nf : X ⟶ Y\nhf : IsOpenEmbedding ⇑(ConcreteCategory.hom f)\n⊢ CompatiblePreserving (Opens.grothendieckTopology ↑Y) hf.functor",
"usedConstants": [
"Iff.mpr",
"Topology.IsOpenEmbedding.toIsEmbedding",
"CategoryTheory.Mono",
"CategoryTheory.CategoryStruct.toQuiver... | haveI : Mono f := (TopCat.mono_iff_injective f).mpr hf.injective
apply compatiblePreservingOfDownwardsClosed
intro U V i
refine ⟨(Opens.map f).obj V, eqToIso <| Opens.ext <| Set.image_preimage_eq_of_subset fun x h ↦ ?_⟩
obtain ⟨_, _, rfl⟩ := i.le h
exact ⟨_, rfl⟩ | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Topology.Sheaves.Presheaf | {
"line": 306,
"column": 8
} | {
"line": 309,
"column": 70
} | [
{
"pp": "case g\nC✝ : Type u\ninst✝⁴ : Category.{v, u} C✝\nX✝ : TopCat\nC : Type u\ninst✝³ : Category.{v, u} C\nFC : C → C → Type u_1\nCC : C → Type u_2\ninst✝² : (X Y : C) → FunLike (FC X Y) (CC X) (CC Y)\ninst✝¹ : ConcreteCategory C FC\ninst✝ : HasColimits C\nX Y : TopCat\nf : X ⟶ Y\nℱ : Presheaf C Y\nU : Ope... | · change op (unop _) ⟶ op (⟨_, H⟩ : Opens _)
refine (homOfLE ?_).op
apply (Set.image_mono s.pt.hom.unop.le).trans
exact Set.image_preimage.l_u_le (SetLike.coe s.pt.left.unop) | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.Topology.Sheaves.SheafCondition.UniqueGluing | {
"line": 134,
"column": 6
} | {
"line": 134,
"column": 52
} | [
{
"pp": "case h.e'_2.h.h.h.h.e'_3.h.e.h.pair\nX : TopCat\nF : Presheaf (Type u_4) X\nι : Type x\nU : ι → Opens ↑X\ns : (j : (CategoryTheory.Pairwise ι)ᵒᵖ) → ((Pairwise.diagram U).op ⋙ F).obj j\nhs : s ∈ ((Pairwise.diagram U).op ⋙ F).sections\nh :\n ∃! s_1,\n ∀ (i : (CategoryTheory.Pairwise ι)ᵒᵖ),\n (Fu... | exact (hs <| op <| Pairwise.Hom.left i j).symm | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.Topology.Sheaves.SheafCondition.UniqueGluing | {
"line": 134,
"column": 6
} | {
"line": 134,
"column": 52
} | [
{
"pp": "case h.e'_2.h.h.h.h.e'_3.h.e.h.pair\nX : TopCat\nF : Presheaf (Type u_4) X\nι : Type x\nU : ι → Opens ↑X\ns : (j : (CategoryTheory.Pairwise ι)ᵒᵖ) → ((Pairwise.diagram U).op ⋙ F).obj j\nhs : s ∈ ((Pairwise.diagram U).op ⋙ F).sections\nh :\n ∃! s_1,\n ∀ (i : (CategoryTheory.Pairwise ι)ᵒᵖ),\n (Fu... | exact (hs <| op <| Pairwise.Hom.left i j).symm | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Topology.Sheaves.SheafCondition.UniqueGluing | {
"line": 134,
"column": 6
} | {
"line": 134,
"column": 52
} | [
{
"pp": "case h.e'_2.h.h.h.h.e'_3.h.e.h.pair\nX : TopCat\nF : Presheaf (Type u_4) X\nι : Type x\nU : ι → Opens ↑X\ns : (j : (CategoryTheory.Pairwise ι)ᵒᵖ) → ((Pairwise.diagram U).op ⋙ F).obj j\nhs : s ∈ ((Pairwise.diagram U).op ⋙ F).sections\nh :\n ∃! s_1,\n ∀ (i : (CategoryTheory.Pairwise ι)ᵒᵖ),\n (Fu... | exact (hs <| op <| Pairwise.Hom.left i j).symm | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections | {
"line": 365,
"column": 2
} | {
"line": 368,
"column": 26
} | [
{
"pp": "case refine_2\nC : Type u_1\ninst✝ : Category.{v_1, u_1} C\nX : TopCat\nF : Sheaf C X\nU V : Opens ↑X\ns : PullbackCone (F.obj.map (homOfLE ⋯).op) (F.obj.map (homOfLE ⋯).op)\nι : ULift.{w, 0} WalkingPair → Opens ↑X := fun j ↦ WalkingPair.casesOn j.down U V\nhι : U ⊔ V = iSup ι\ni j : CategoryTheory.Pai... | rcases i with (⟨⟨_ | _⟩⟩ | ⟨⟨_ | _⟩, ⟨_⟩⟩) <;>
rcases j with (⟨⟨_ | _⟩⟩ | ⟨⟨_ | _⟩, ⟨_⟩⟩) <;>
rcases g with ⟨⟩ <;>
dsimp [Pairwise.diagram] | Lean.Parser.Tactic.«_aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tactic_<;>__1» | Lean.Parser.Tactic.«tactic_<;>_» |
Mathlib.CategoryTheory.Presentable.Basic | {
"line": 160,
"column": 2
} | {
"line": 161,
"column": 16
} | [
{
"pp": "C : Type u₁\ninst✝² : Category.{v₁, u₁} C\nD : Type u₂\ninst✝¹ : Category.{v₂, u₂} D\nX✝ Y : C\ne : X✝ ≅ Y\nκ : Cardinal.{w}\ninst✝ : Fact κ.IsRegular\nX : (isCardinalPresentable C κ).FullSubcategory\n⊢ IsCardinalPresentable ((isCardinalPresentable C κ).ι.obj X) κ",
"usedConstants": [
"Catego... | dsimp
infer_instance | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.CategoryTheory.Presentable.Basic | {
"line": 160,
"column": 2
} | {
"line": 161,
"column": 16
} | [
{
"pp": "C : Type u₁\ninst✝² : Category.{v₁, u₁} C\nD : Type u₂\ninst✝¹ : Category.{v₂, u₂} D\nX✝ Y : C\ne : X✝ ≅ Y\nκ : Cardinal.{w}\ninst✝ : Fact κ.IsRegular\nX : (isCardinalPresentable C κ).FullSubcategory\n⊢ IsCardinalPresentable ((isCardinalPresentable C κ).ι.obj X) κ",
"usedConstants": [
"Catego... | dsimp
infer_instance | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.CategoryTheory.Presentable.IsCardinalFiltered | {
"line": 138,
"column": 17
} | {
"line": 138,
"column": 55
} | [
{
"pp": "J : Type u\ninst✝¹ : Category.{v, u} J\nκ : Cardinal.{w}\nhκ : Fact κ.IsRegular\ninst✝ : IsCardinalFiltered J κ\nι : Type v'\nj : J\nk : ι → J\nf : (i : ι) → j ⟶ k i\nhι : HasCardinalLT ι κ\nφ : ι → (j ⟶ max k hι) := fun i ↦ f i ≫ toMax k hι i\n⊢ ∀ (i : ι), f i ≫ (fun i ↦ toMax k hι i ≫ coeqHom φ hι) i... | by simpa [φ] using coeq_condition φ hι | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.CategoryTheory.Presentable.Finite | {
"line": 42,
"column": 2
} | {
"line": 43,
"column": 50
} | [
{
"pp": "C : Type u\ninst✝¹ : Category.{v, u} C\nD : Type u'\ninst✝ : Category.{v', u'} D\nF : C ⥤ D\n⊢ F.IsFinitelyAccessible ↔ PreservesFilteredColimitsOfSize.{w, w, v, v', u, u'} F",
"usedConstants": [
"CategoryTheory.Functor.IsFinitelyAccessible",
"CategoryTheory.IsCardinalFiltered",
"... | refine ⟨fun ⟨H⟩ ↦ ⟨?_⟩, fun ⟨H⟩ ↦ ⟨?_⟩⟩ <;>
simp only [isCardinalFiltered_aleph0_iff] at * | Lean.Parser.Tactic.«_aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tactic_<;>__1» | Lean.Parser.Tactic.«tactic_<;>_» |
Mathlib.CategoryTheory.Presentable.Finite | {
"line": 109,
"column": 2
} | {
"line": 110,
"column": 50
} | [
{
"pp": "C : Type u\ninst✝ : Category.{v, u} C\n⊢ HasCardinalFilteredColimits C ℵ₀ ↔ HasFilteredColimitsOfSize.{w, w, v, u} C",
"usedConstants": [
"CategoryTheory.IsCardinalFiltered",
"CategoryTheory.Limits.HasColimitsOfShape",
"CategoryTheory.SmallCategory",
"Cardinal.aleph0",
... | refine ⟨fun ⟨H⟩ ↦ ⟨?_⟩, fun ⟨H⟩ ↦ ⟨?_⟩⟩ <;>
simp only [isCardinalFiltered_aleph0_iff] at * | Lean.Parser.Tactic.«_aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tactic_<;>__1» | Lean.Parser.Tactic.«tactic_<;>_» |
Mathlib.Algebra.CharP.CharAndCard | {
"line": 42,
"column": 27
} | {
"line": 42,
"column": 36
} | [
{
"pp": "case mp\nR : Type u_1\ninst✝¹ : CommRing R\np : ℕ\ninst✝ : Fact (Nat.Prime p)\nhR : ringChar R ≠ 0\nhch : ↑(ringChar R) = 0\nhp : Nat.Prime p\nh₁ : IsUnit ↑p\nq : ℕ\na : R\nha : a * ↑p = 1\nh₃ : ¬ringChar R ∣ q\nh₄ : ¬↑(ringChar R) ∣ ↑q → ¬↑↑q = 0\nhq : a * 0 = a * (↑p * ↑q)\n⊢ False",
"usedConstan... | mul_zero, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.CharP.CharAndCard | {
"line": 49,
"column": 13
} | {
"line": 49,
"column": 22
} | [
{
"pp": "case mpr\nR : Type u_1\ninst✝¹ : CommRing R\np : ℕ\ninst✝ : Fact (Nat.Prime p)\nhR : ringChar R ≠ 0\nhch : ↑(ringChar R) = 0\nhp : Nat.Prime p\nh : ¬p ∣ ringChar R\na b : ℤ\nhab : ↑a * ↑p + ↑b * 0 = 1\n⊢ IsUnit ↑p",
"usedConstants": [
"Int.cast",
"NonUnitalCommRing.toNonUnitalNonAssocCo... | mul_zero, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.CharP.CharAndCard | {
"line": 29,
"column": 2
} | {
"line": 50,
"column": 30
} | [
{
"pp": "R : Type u_1\ninst✝¹ : CommRing R\np : ℕ\ninst✝ : Fact (Nat.Prime p)\nhR : ringChar R ≠ 0\n⊢ IsUnit ↑p ↔ ¬p ∣ ringChar R",
"usedConstants": [
"CharP.cast_eq_zero",
"Iff.mpr",
"AddGroup.toSubtractionMonoid",
"NonUnitalNonAssocCommRing.toNonUnitalNonAssocCommSemiring",
"... | have hch := CharP.cast_eq_zero R (ringChar R)
have hp : p.Prime := Fact.out
constructor
· rintro h₁ ⟨q, hq⟩
rcases IsUnit.exists_left_inv h₁ with ⟨a, ha⟩
have h₃ : ¬ringChar R ∣ q := by
rintro ⟨r, hr⟩
rw [hr, ← mul_assoc, mul_comm p, mul_assoc] at hq
nth_rw 1 [← mul_one (ringChar R)] at ... | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Algebra.CharP.CharAndCard | {
"line": 29,
"column": 2
} | {
"line": 50,
"column": 30
} | [
{
"pp": "R : Type u_1\ninst✝¹ : CommRing R\np : ℕ\ninst✝ : Fact (Nat.Prime p)\nhR : ringChar R ≠ 0\n⊢ IsUnit ↑p ↔ ¬p ∣ ringChar R",
"usedConstants": [
"CharP.cast_eq_zero",
"Iff.mpr",
"AddGroup.toSubtractionMonoid",
"NonUnitalNonAssocCommRing.toNonUnitalNonAssocCommSemiring",
"... | have hch := CharP.cast_eq_zero R (ringChar R)
have hp : p.Prime := Fact.out
constructor
· rintro h₁ ⟨q, hq⟩
rcases IsUnit.exists_left_inv h₁ with ⟨a, ha⟩
have h₃ : ¬ringChar R ∣ q := by
rintro ⟨r, hr⟩
rw [hr, ← mul_assoc, mul_comm p, mul_assoc] at hq
nth_rw 1 [← mul_one (ringChar R)] at ... | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Algebra.CharP.CharAndCard | {
"line": 75,
"column": 6
} | {
"line": 75,
"column": 15
} | [
{
"pp": "R : Type u_1\ninst✝² : CommRing R\ninst✝¹ : Fintype R\np : ℕ\ninst✝ : Fact (Nat.Prime p)\nh : p ∣ Fintype.card R\nh₀ : ¬p ∣ ringChar R\nr : R\nhr : addOrderOf r = p\nu : R\nhu : u * ↑p = 1\nhr₁ : u * (↑p * r) = u * 0\n⊢ False",
"usedConstants": [
"NonAssocSemiring.toAddCommMonoidWithOne",
... | mul_zero, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Data.Stream.Init | {
"line": 431,
"column": 4
} | {
"line": 431,
"column": 50
} | [
{
"pp": "α : Type u\nn : ℕ\ns : Stream' α\n⊢ s.even.get n.succ = s.get (2 * n).succ.succ",
"usedConstants": [
"Eq.mpr",
"Stream'.get_succ",
"HMul.hMul",
"congrArg",
"Stream'.even",
"id",
"instMulNat",
"instOfNatNat",
"Stream'",
"instHAdd",
"S... | rw [get_succ, get_succ, tail_even, get_even n] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.Algebra.Colimit.Ring | {
"line": 172,
"column": 14
} | {
"line": 172,
"column": 65
} | [
{
"pp": "case ih\nι : Type u_1\ninst✝⁴ : Preorder ι\nG : ι → Type u_2\ninst✝³ : (i : ι) → CommRing (G i)\nf : (i j : ι) → i ≤ j → G i → G j\nP : Type u_3\ninst✝² : CommRing P\ng✝ : (i : ι) → G i →+* P\nHg : ∀ (i j : ι) (hij : i ≤ j) (x : G i), (g✝ j) (f i j hij x) = (g✝ i) x\ninst✝¹ : Nonempty ι\ninst✝ : IsDire... | rw [lift_of] at hz; rw [injective _ g hz, map_zero] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Algebra.Colimit.Ring | {
"line": 172,
"column": 14
} | {
"line": 172,
"column": 65
} | [
{
"pp": "case ih\nι : Type u_1\ninst✝⁴ : Preorder ι\nG : ι → Type u_2\ninst✝³ : (i : ι) → CommRing (G i)\nf : (i j : ι) → i ≤ j → G i → G j\nP : Type u_3\ninst✝² : CommRing P\ng✝ : (i : ι) → G i →+* P\nHg : ∀ (i j : ι) (hij : i ≤ j) (x : G i), (g✝ j) (f i j hij x) = (g✝ i) x\ninst✝¹ : Nonempty ι\ninst✝ : IsDire... | rw [lift_of] at hz; rw [injective _ g hz, map_zero] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Data.Seq.Defs | {
"line": 118,
"column": 4
} | {
"line": 118,
"column": 20
} | [
{
"pp": "α : Type u\nβ : Type v\nγ : Type w\na : α\ns : Seq α\n⊢ (some a :: ↑s).IsSeq",
"usedConstants": [
"Nat"
]
}
] | rintro (n | _) h | _private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalRIntro | Lean.Parser.Tactic.rintro |
Mathlib.Data.Seq.Basic | {
"line": 454,
"column": 6
} | {
"line": 456,
"column": 31
} | [
{
"pp": "α : Type u\na : α\ns✝ : Seq α\nS : Seq (Seq1 α)\ns1 s2 : Seq α\nh : s1 = s2 ∨ ∃ a s S, s1 = (cons (a, s) S).join ∧ s2 = cons a (s.append S.join)\ns : Seq α\n⊢ BisimO (fun s1 s2 ↦ s1 = s2 ∨ ∃ a s S, s1 = (cons (a, s) S).join ∧ s2 = cons a (s.append S.join)) s.destruct\n s.destruct",
"usedConstant... | cases s; · trivial
· rw [destruct_cons]
exact ⟨rfl, Or.inl rfl⟩ | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Data.Seq.Basic | {
"line": 454,
"column": 6
} | {
"line": 456,
"column": 31
} | [
{
"pp": "α : Type u\na : α\ns✝ : Seq α\nS : Seq (Seq1 α)\ns1 s2 : Seq α\nh : s1 = s2 ∨ ∃ a s S, s1 = (cons (a, s) S).join ∧ s2 = cons a (s.append S.join)\ns : Seq α\n⊢ BisimO (fun s1 s2 ↦ s1 = s2 ∨ ∃ a s S, s1 = (cons (a, s) S).join ∧ s2 = cons a (s.append S.join)) s.destruct\n s.destruct",
"usedConstant... | cases s; · trivial
· rw [destruct_cons]
exact ⟨rfl, Or.inl rfl⟩ | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Data.Seq.Basic | {
"line": 526,
"column": 17
} | {
"line": 526,
"column": 40
} | [
{
"pp": "case succ\nα : Type u\nm : ℕ\nih : nil.drop m = nil\n⊢ nil.drop (m + 1) = nil",
"usedConstants": [
"Stream'.Seq",
"Stream'.Seq.drop",
"congrArg",
"_private.Mathlib.Data.Seq.Basic.0.Stream'.Seq.drop_nil._simp_1_4",
"instOfNatNat",
"Stream'.Seq.nil",
"instHAd... | simp [← dropn_tail, ih] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.Data.Seq.Basic | {
"line": 526,
"column": 17
} | {
"line": 526,
"column": 40
} | [
{
"pp": "case succ\nα : Type u\nm : ℕ\nih : nil.drop m = nil\n⊢ nil.drop (m + 1) = nil",
"usedConstants": [
"Stream'.Seq",
"Stream'.Seq.drop",
"congrArg",
"_private.Mathlib.Data.Seq.Basic.0.Stream'.Seq.drop_nil._simp_1_4",
"instOfNatNat",
"Stream'.Seq.nil",
"instHAd... | simp [← dropn_tail, ih] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Data.Seq.Basic | {
"line": 526,
"column": 17
} | {
"line": 526,
"column": 40
} | [
{
"pp": "case succ\nα : Type u\nm : ℕ\nih : nil.drop m = nil\n⊢ nil.drop (m + 1) = nil",
"usedConstants": [
"Stream'.Seq",
"Stream'.Seq.drop",
"congrArg",
"_private.Mathlib.Data.Seq.Basic.0.Stream'.Seq.drop_nil._simp_1_4",
"instOfNatNat",
"Stream'.Seq.nil",
"instHAd... | simp [← dropn_tail, ih] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Data.Seq.Basic | {
"line": 725,
"column": 2
} | {
"line": 725,
"column": 51
} | [
{
"pp": "case h\nα : Type u\nx : α\ns : Seq α\nm n : ℕ\nh : m < n\ni : ℕ\n⊢ ((s.set m x).drop n).get? i = (s.drop n).get? i",
"usedConstants": [
"Stream'.Seq",
"Stream'.Seq.drop",
"congrArg",
"_private.Mathlib.Data.Seq.Basic.0.Stream'.Seq.drop_set_of_lt._proof_1_1",
"Ne",
... | simp [get?_set_of_ne _ _ (show n + i ≠ m by lia)] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.Algebra.ContinuedFractions.Computation.Translations | {
"line": 327,
"column": 29
} | {
"line": 327,
"column": 84
} | [
{
"pp": "K : Type u_1\ninst✝³ : DivisionRing K\ninst✝² : LinearOrder K\ninst✝¹ : FloorRing K\nv : K\nn : ℕ\ninst✝ : IsStrictOrderedRing K\nh : fract v ≠ 0\n⊢ { a := 1, b := ↑⌊(fract v)⁻¹⌋ }.b + convs'Aux (of v).s.tail n = (of (fract v)⁻¹).convs' n",
"usedConstants": [
"GenContFract.s",
"Int.cast... | by rw [convs', of_h_eq_floor, add_right_inj, of_s_tail] | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.Algebra.ContinuedFractions.Computation.CorrectnessTerminating | {
"line": 110,
"column": 6
} | {
"line": 111,
"column": 63
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\ninst✝¹ : LinearOrder K\nv : K\nn : ℕ\ninst✝ : FloorRing K\ng : GenContFract K := of v\nifp_zero : IntFractPair K\nstream_zero_eq : IntFractPair.stream v 0 = some ifp_zero\n⊢ IntFractPair.of v = ifp_zero",
"usedConstants": [
"GenContFract.IntFractPair.stream",
... | have : IntFractPair.stream v 0 = some (IntFractPair.of v) := rfl
simpa only [this, Option.some.injEq] using stream_zero_eq | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Algebra.ContinuedFractions.Computation.CorrectnessTerminating | {
"line": 110,
"column": 6
} | {
"line": 111,
"column": 63
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\ninst✝¹ : LinearOrder K\nv : K\nn : ℕ\ninst✝ : FloorRing K\ng : GenContFract K := of v\nifp_zero : IntFractPair K\nstream_zero_eq : IntFractPair.stream v 0 = some ifp_zero\n⊢ IntFractPair.of v = ifp_zero",
"usedConstants": [
"GenContFract.IntFractPair.stream",
... | have : IntFractPair.stream v 0 = some (IntFractPair.of v) := rfl
simpa only [this, Option.some.injEq] using stream_zero_eq | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Algebra.ContinuedFractions.ConvergentsEquiv | {
"line": 143,
"column": 6
} | {
"line": 146,
"column": 27
} | [
{
"pp": "case some.h.inr\nK : Type u_1\nn : ℕ\ns : Stream'.Seq (Pair K)\ninst✝ : DivisionRing K\ngp_succ_succ_n : Pair K\ns_succ_succ_nth_eq : s.get? (n + 2) = some gp_succ_succ_n\ngp_succ_n : Pair K\ns_succ_nth_eq : s.get? (n + 1) = some gp_succ_n\nm : ℕ\nm_ne_n : ¬m = n\n⊢ (squashSeq s (n + 1)).tail.get? m = ... | cases s_succ_mth_eq : s.get? (m + 1)
· simp only [*, squashSeq, Stream'.Seq.get?_tail, Stream'.Seq.get?_zipWith,
Option.map₂_none_right]
· simp [*, squashSeq] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Algebra.ContinuedFractions.ConvergentsEquiv | {
"line": 143,
"column": 6
} | {
"line": 146,
"column": 27
} | [
{
"pp": "case some.h.inr\nK : Type u_1\nn : ℕ\ns : Stream'.Seq (Pair K)\ninst✝ : DivisionRing K\ngp_succ_succ_n : Pair K\ns_succ_succ_nth_eq : s.get? (n + 2) = some gp_succ_succ_n\ngp_succ_n : Pair K\ns_succ_nth_eq : s.get? (n + 1) = some gp_succ_n\nm : ℕ\nm_ne_n : ¬m = n\n⊢ (squashSeq s (n + 1)).tail.get? m = ... | cases s_succ_mth_eq : s.get? (m + 1)
· simp only [*, squashSeq, Stream'.Seq.get?_tail, Stream'.Seq.get?_zipWith,
Option.map₂_none_right]
· simp [*, squashSeq] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Algebra.ContinuedFractions.Computation.TerminatesIffRat | {
"line": 219,
"column": 2
} | {
"line": 223,
"column": 11
} | [
{
"pp": "K : Type u_1\ninst✝³ : Field K\ninst✝² : LinearOrder K\ninst✝¹ : IsStrictOrderedRing K\ninst✝ : FloorRing K\nv : K\nq : ℚ\nv_eq_q : v = ↑q\n⊢ (of v).Terminates ↔ (of q).Terminates",
"usedConstants": [
"GenContFract.s",
"Eq.mpr",
"Option.decidableNoneEq",
"of_decide_eq_true",... | constructor <;> intro h <;> obtain ⟨n, h⟩ := h <;> use n <;>
simp only [Stream'.Seq.TerminatedAt, (coe_of_s_get?_rat_eq v_eq_q n).symm] at h ⊢ <;>
cases h' : (of q).s.get? n <;>
simp only [h'] at h <;>
trivial | Lean.Parser.Tactic.«_aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tactic_<;>__1» | Lean.Parser.Tactic.«tactic_<;>_» |
Mathlib.Algebra.ContinuedFractions.Computation.TerminatesIffRat | {
"line": 219,
"column": 2
} | {
"line": 223,
"column": 11
} | [
{
"pp": "K : Type u_1\ninst✝³ : Field K\ninst✝² : LinearOrder K\ninst✝¹ : IsStrictOrderedRing K\ninst✝ : FloorRing K\nv : K\nq : ℚ\nv_eq_q : v = ↑q\n⊢ (of v).Terminates ↔ (of q).Terminates",
"usedConstants": [
"GenContFract.s",
"Eq.mpr",
"Option.decidableNoneEq",
"of_decide_eq_true",... | constructor <;> intro h <;> obtain ⟨n, h⟩ := h <;> use n <;>
simp only [Stream'.Seq.TerminatedAt, (coe_of_s_get?_rat_eq v_eq_q n).symm] at h ⊢ <;>
cases h' : (of q).s.get? n <;>
simp only [h'] at h <;>
trivial | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Algebra.ContinuedFractions.Computation.TerminatesIffRat | {
"line": 219,
"column": 2
} | {
"line": 223,
"column": 11
} | [
{
"pp": "K : Type u_1\ninst✝³ : Field K\ninst✝² : LinearOrder K\ninst✝¹ : IsStrictOrderedRing K\ninst✝ : FloorRing K\nv : K\nq : ℚ\nv_eq_q : v = ↑q\n⊢ (of v).Terminates ↔ (of q).Terminates",
"usedConstants": [
"GenContFract.s",
"Eq.mpr",
"Option.decidableNoneEq",
"of_decide_eq_true",... | constructor <;> intro h <;> obtain ⟨n, h⟩ := h <;> use n <;>
simp only [Stream'.Seq.TerminatedAt, (coe_of_s_get?_rat_eq v_eq_q n).symm] at h ⊢ <;>
cases h' : (of q).s.get? n <;>
simp only [h'] at h <;>
trivial | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Algebra.CubicDiscriminant | {
"line": 302,
"column": 32
} | {
"line": 302,
"column": 43
} | [
{
"pp": "R : Type u_1\nP : Cubic R\ninst✝ : Semiring R\nha : P.a = 0\nhb : P.b = 0\nhc : P.c = 0\nhd : P.d = 0\n⊢ degree 0 = ⊥",
"usedConstants": [
"Eq.mpr",
"WithBot",
"congrArg",
"id",
"Bot.bot",
"Polynomial.degree",
"Polynomial.degree_zero",
"Polynomial",
... | degree_zero | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.Finiteness.Prod | {
"line": 46,
"column": 3
} | {
"line": 48,
"column": 24
} | [
{
"pp": "R : Type u_1\nM : Type u_2\nN : Type u_3\ninst✝⁴ : Semiring R\ninst✝³ : AddCommMonoid M\ninst✝² : Module R M\ninst✝¹ : AddCommMonoid N\ninst✝ : Module R N\nhM : Module.Finite R M\nhN : Module.Finite R N\n⊢ ⊤.FG",
"usedConstants": [
"Eq.mpr",
"Submodule",
"Module.Finite.fg_top",
... | by
rw [← Submodule.prod_top]
exact hM.1.prod hN.1 | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.RingTheory.Idempotents | {
"line": 114,
"column": 4
} | {
"line": 115,
"column": 59
} | [
{
"pp": "case none.some\nR : Type u_1\ninst✝¹ : Semiring R\nI : Type u_3\ne : I → R\nhe : OrthogonalIdempotents e\ninst✝ : Fintype I\nx : R\nhx : IsIdempotentElem x\nhx₁ : x * ∑ i, e i = 0\nhx₂ : (∑ i, e i) * x = 0\nj : I\nne : none ≠ some j\n⊢ none.elim x e * (some j).elim x e = 0",
"usedConstants": [
... | · simpa only [mul_assoc, Finset.sum_mul, he.mul_eq, Finset.sum_ite_eq', Finset.mem_univ,
↓reduceIte, zero_mul] using congr_arg (· * e j) hx₁ | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.RingTheory.Idempotents | {
"line": 231,
"column": 34
} | {
"line": 231,
"column": 43
} | [
{
"pp": "case inr.refine_2.succ\nR : Type u_1\nS : Type u_2\ninst✝¹ : Ring R\ninst✝ : Ring S\nf : R →+* S\nh : ∀ x ∈ RingHom.ker f, IsNilpotent x\ne₂ : R\nhe₂ : IsIdempotentElem e₂\ne₁ : R\nhe₁ : IsIdempotentElem (f e₁)\nhe₁e₂ : f e₁ * f e₂ = 0\nh✝ : Nontrivial R\na : R := e₁ - e₁ * e₂\nha : f a = f e₁\nha' : a... | mul_zero, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.Idempotents | {
"line": 308,
"column": 4
} | {
"line": 309,
"column": 44
} | [
{
"pp": "case inl\nR : Type u_1\nS : Type u_2\ninst✝¹ : Ring R\ninst✝ : Ring S\nf : R →+* S\nh : ∀ x ∈ RingHom.ker f, IsNilpotent x\nn : ℕ\ne : Fin n → S\nhe : CompleteOrthogonalIdempotents e\nhe' : ∀ (i : Fin n), e i ∈ f.range\nh✝ : Subsingleton R\n⊢ ∃ e', CompleteOrthogonalIdempotents e' ∧ ⇑f ∘ e' = e",
"... | choose e' he' using he'
exact ⟨e', .of_subsingleton, funext he'⟩ | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.RingTheory.Idempotents | {
"line": 308,
"column": 4
} | {
"line": 309,
"column": 44
} | [
{
"pp": "case inl\nR : Type u_1\nS : Type u_2\ninst✝¹ : Ring R\ninst✝ : Ring S\nf : R →+* S\nh : ∀ x ∈ RingHom.ker f, IsNilpotent x\nn : ℕ\ne : Fin n → S\nhe : CompleteOrthogonalIdempotents e\nhe' : ∀ (i : Fin n), e i ∈ f.range\nh✝ : Subsingleton R\n⊢ ∃ e', CompleteOrthogonalIdempotents e' ∧ ⇑f ∘ e' = e",
"... | choose e' he' using he'
exact ⟨e', .of_subsingleton, funext he'⟩ | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.LinearAlgebra.GeneralLinearGroup.AlgEquiv | {
"line": 41,
"column": 2
} | {
"line": 43,
"column": 64
} | [
{
"pp": "case neg\nK : Type u_1\nV : Type u_2\nW : Type u_3\ninst✝⁶ : Semifield K\ninst✝⁵ : AddCommMonoid V\ninst✝⁴ : Module K V\ninst✝³ : Projective K V\ninst✝² : AddCommMonoid W\ninst✝¹ : Module K W\ninst✝ : Projective K W\nf : End K V ≃ₐ[K] End K W\nhV : Nontrivial V\nu : V\nhu : u ≠ 0\nv : Dual K V\nhuv : v... | obtain ⟨z, hz⟩ : ∃ z : W, ¬ f (smulRight v u) z = (0 : End K W) z := by
rw [← not_forall, ← LinearMap.ext_iff, EmbeddingLike.map_eq_zero_iff, LinearMap.ext_iff]
exact not_forall.mpr ⟨u, huv.isUnit.smul_eq_zero.not.mpr hu⟩ | _private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalObtain | Lean.Parser.Tactic.obtain |
Mathlib.RingTheory.Idempotents | {
"line": 529,
"column": 73
} | {
"line": 529,
"column": 81
} | [
{
"pp": "R : Type u_1\ne : R\ninst✝ : NonUnitalSemiring R\na b : R\n⊢ e * (a + b) * e = e * a * e + e * b * e",
"usedConstants": [
"Distrib.leftDistribClass",
"Eq.mpr",
"Semigroup.toMul",
"HMul.hMul",
"congrArg",
"AddMonoid.toAddZeroClass",
"SemigroupWithZero.toSemi... | mul_add, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.RingTheory.Idempotents | {
"line": 530,
"column": 31
} | {
"line": 530,
"column": 40
} | [
{
"pp": "R : Type u_1\ne : R\ninst✝ : NonUnitalSemiring R\n⊢ e * 0 * e = 0",
"usedConstants": [
"Eq.mpr",
"Semigroup.toMul",
"HMul.hMul",
"congrArg",
"AddMonoid.toAddZeroClass",
"NonUnitalNonAssocSemiring.toMulZeroClass",
"SemigroupWithZero.toSemigroup",
"AddZ... | mul_zero, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.Algebra.DirectSum.LinearMap | {
"line": 74,
"column": 68
} | {
"line": 74,
"column": 96
} | [
{
"pp": "ι : Type u_1\nR : Type u_2\nM : Type u_3\ninst✝⁶ : CommRing R\ninst✝⁵ : AddCommGroup M\ninst✝⁴ : Module R M\nN : ι → Submodule R M\ninst✝³ : DecidableEq ι\ninst✝² : ∀ (i : ι), Module.Finite R ↥(N i)\ninst✝¹ : ∀ (i : ι), Free R ↥(N i)\nh : IsInternal N\ninst✝ : Fintype ι\nf : M →ₗ[R] M\nhf : ∀ (i : ι), ... | Matrix.trace_blockDiagonal', | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.GroupTheory.FreeGroup.Reduce | {
"line": 271,
"column": 2
} | {
"line": 271,
"column": 23
} | [
{
"pp": "α : Type u_1\ninst✝ : DecidableEq α\nx y : FreeGroup α\n⊢ (x * y).toWord <+ x.toWord ++ y.toWord",
"usedConstants": [
"HMul.hMul",
"FreeGroup.toWord",
"FreeGroup.Red.sublist",
"instHAppendOfAppend",
"List",
"Bool",
"List.instAppend",
"Prod",
"Fr... | refine Red.sublist ?_ | Lean.Elab.Tactic.evalRefine | Lean.Parser.Tactic.refine |
Mathlib.Algebra.GCDMonoid.FinsetLemmas | {
"line": 37,
"column": 2
} | {
"line": 37,
"column": 83
} | [
{
"pp": "ι : Type u_1\ns : Finset ι\nf : ι → ℕ\nh : (↑s).Pairwise (Function.onFun IsRelPrime f)\n⊢ s.lcm f = s.prod f",
"usedConstants": [
"CommMonoidWithZero.toCommMonoid",
"instNormalizedGCDMonoidNat",
"Nat.unique_units",
"Nat.instIsCancelMulZero",
"Associated.eq_of_normalize... | exact associated_lcm_prod h |>.eq_of_normalized (normalize_eq _) (normalize_eq _) | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.RingTheory.Polynomial.Eisenstein.Criterion | {
"line": 132,
"column": 4
} | {
"line": 132,
"column": 43
} | [
{
"pp": "R : Type u_1\ninst✝³ : CommRing R\ninst✝² : IsDomain R\nK : Type u_2\ninst✝¹ : Field K\ninst✝ : Algebra R K\nq f : R[X]\np : ℕ\nhq_irr : Irreducible (map (algebraMap R K) q)\nhq_monic : q.Monic\nhf_prim : f.IsPrimitive\nhfd0 : 0 < f.natDegree\nhfP : (algebraMap R K) f.leadingCoeff ≠ 0\nhfmodP : map (al... | simp_all [natDegree_pos_iff_degree_pos] | Lean.Elab.Tactic.evalSimpAll | Lean.Parser.Tactic.simpAll |
Mathlib.RingTheory.Polynomial.Eisenstein.Criterion | {
"line": 132,
"column": 4
} | {
"line": 132,
"column": 43
} | [
{
"pp": "R : Type u_1\ninst✝³ : CommRing R\ninst✝² : IsDomain R\nK : Type u_2\ninst✝¹ : Field K\ninst✝ : Algebra R K\nq f : R[X]\np : ℕ\nhq_irr : Irreducible (map (algebraMap R K) q)\nhq_monic : q.Monic\nhf_prim : f.IsPrimitive\nhfd0 : 0 < f.natDegree\nhfP : (algebraMap R K) f.leadingCoeff ≠ 0\nhfmodP : map (al... | simp_all [natDegree_pos_iff_degree_pos] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.RingTheory.Polynomial.Eisenstein.Criterion | {
"line": 132,
"column": 4
} | {
"line": 132,
"column": 43
} | [
{
"pp": "R : Type u_1\ninst✝³ : CommRing R\ninst✝² : IsDomain R\nK : Type u_2\ninst✝¹ : Field K\ninst✝ : Algebra R K\nq f : R[X]\np : ℕ\nhq_irr : Irreducible (map (algebraMap R K) q)\nhq_monic : q.Monic\nhf_prim : f.IsPrimitive\nhfd0 : 0 < f.natDegree\nhfP : (algebraMap R K) f.leadingCoeff ≠ 0\nhfmodP : map (al... | simp_all [natDegree_pos_iff_degree_pos] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.RingTheory.Polynomial.Eisenstein.Criterion | {
"line": 154,
"column": 6
} | {
"line": 158,
"column": 51
} | [
{
"pp": "case a\nR : Type u_1\ninst✝³ : CommRing R\ninst✝² : IsDomain R\nK : Type u_2\ninst✝¹ : Field K\ninst✝ : Algebra R K\nq f : R[X]\np : ℕ\nhq_irr : Irreducible (map (algebraMap R K) q)\nhq_monic : q.Monic\nhf_prim : f.IsPrimitive\nhfd0 : 0 < f.natDegree\nhfP : (algebraMap R K) f.leadingCoeff ≠ 0\nhfmodP :... | have h (x : ℕ × ℕ) : (Ideal.Quotient.mk (P ^ 2)) (r.coeff x.1 * s.coeff x.2) = 0 := by
rw [eq_zero_iff_mem, pow_two]
apply mul_mem_mul
· rw [mem_ker, ← coeff_map, hr, coeff_zero]
· rw [mem_ker, ← coeff_map, hs, coeff_zero] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tacticHave___1 | Lean.Parser.Tactic.tacticHave__ |
Mathlib.RingTheory.Polynomial.Eisenstein.Basic | {
"line": 159,
"column": 36
} | {
"line": 159,
"column": 48
} | [
{
"pp": "R : Type u\ninst✝² : CommRing R\n𝓟 : Ideal R\nf : R[X]\nS : Type v\ninst✝¹ : CommRing S\ninst✝ : Algebra R S\nhf : f.IsWeaklyEisensteinAt 𝓟\nx : S\nhx : eval x (Polynomial.map (algebraMap R S) f) = 0\nhmo : f.Monic\n⊢ x ^ (Polynomial.map (algebraMap R S) f).natDegree ∈ Ideal.map (algebraMap R S) 𝓟",... | ← IsRoot.def | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Group.Action.Option | {
"line": 65,
"column": 4
} | {
"line": 65,
"column": 54
} | [
{
"pp": "case none\nM : Type u_1\nN : Type u_2\nα : Type u_3\ninst✝³ : SMul M α\ninst✝² : SMul N α\na✝ : M\nb : α\nx : Option α\ninst✝¹ : SMul Mᵐᵒᵖ α\ninst✝ : IsCentralScalar M α\na : M\n⊢ MulOpposite.op a • none = a • none",
"usedConstants": [
"instHSMul",
"MulOpposite",
"Option.none",
... | exacts [rfl, congr_arg some (op_smul_eq_smul _ _)] | Batteries.Tactic._aux_Batteries_Tactic_Init___elabRules_Batteries_Tactic_exacts_1 | Batteries.Tactic.exacts |
Mathlib.Algebra.Quaternion | {
"line": 1097,
"column": 46
} | {
"line": 1097,
"column": 54
} | [
{
"pp": "R : Type u_3\ninst✝ : CommRing R\na b : ℍ[R]\n⊢ (a * (star a + star b) + b * (star a + star b)).re =\n (a * star a).re + (a * star b).re + ((b * star a).re + (b * star b).re)",
"usedConstants": [
"Distrib.leftDistribClass",
"Eq.mpr",
"NegZeroClass.toNeg",
"NonUnitalCommRi... | mul_add, | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.Algebra.Quaternion | {
"line": 1150,
"column": 25
} | {
"line": 1150,
"column": 35
} | [
{
"pp": "case inr\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : LinearOrder R\ninst✝ : IsStrictOrderedRing R\na : ℍ[R]\nhq0 : a ≠ 0\n⊢ a ^ 2 = -(star a * a) ↔ star a = -a",
"usedConstants": [
"Eq.mpr",
"NegZeroClass.toNeg",
"NonUnitalCommRing.toNonUnitalNonAssocCommRing",
"HMul.hMul",... | ← mul_neg, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Group.NatPowAssoc | {
"line": 79,
"column": 27
} | {
"line": 79,
"column": 36
} | [
{
"pp": "case zero\nM : Type u_1\ninst✝² : MulOneClass M\ninst✝¹ : Pow M ℕ\ninst✝ : NatPowAssoc M\nx : M\nm : ℕ\n⊢ x ^ (m * 0) = 1",
"usedConstants": [
"Eq.mpr",
"MulOne.toOne",
"Nat.instMulZeroClass",
"HMul.hMul",
"MulZeroClass.toMul",
"congrArg",
"id",
"inst... | mul_zero, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Group.NatPowAssoc | {
"line": 80,
"column": 21
} | {
"line": 80,
"column": 29
} | [
{
"pp": "case succ\nM : Type u_1\ninst✝² : MulOneClass M\ninst✝¹ : Pow M ℕ\ninst✝ : NatPowAssoc M\nx : M\nm n : ℕ\nih : x ^ (m * n) = (x ^ m) ^ n\n⊢ x ^ (m * (n + 1)) = (x ^ m) ^ (n + 1)",
"usedConstants": [
"Distrib.leftDistribClass",
"Eq.mpr",
"HMul.hMul",
"congrArg",
"id",
... | mul_add, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Group.PNatPowAssoc | {
"line": 74,
"column": 41
} | {
"line": 74,
"column": 49
} | [
{
"pp": "case succ\nM : Type u_1\ninst✝² : Mul M\ninst✝¹ : Pow M ℕ+\ninst✝ : PNatPowAssoc M\nx : M\nm k : ℕ+\nhk : x ^ (m * k) = (x ^ m) ^ k\n⊢ x ^ (m * (k + 1)) = (x ^ m) ^ k * x ^ m",
"usedConstants": [
"Distrib.leftDistribClass",
"Eq.mpr",
"HMul.hMul",
"congrArg",
"id",
... | mul_add, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.GroupWithZero.Action.Center | {
"line": 27,
"column": 14
} | {
"line": 27,
"column": 23
} | [
{
"pp": "case inl\nG₀ : Type u_1\ninst✝ : GroupWithZero G₀\nu : ↥(center G₀ˣ)\n⊢ 0 * ↑↑u = ↑↑u * 0",
"usedConstants": [
"Units.val",
"Eq.mpr",
"GroupWithZero.toMonoidWithZero",
"HMul.hMul",
"MulZeroClass.toMul",
"Monoid.toMulOneClass",
"congrArg",
"Membership.... | mul_zero, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Group.Irreducible.Indecomposable | {
"line": 110,
"column": 2
} | {
"line": 110,
"column": 59
} | [
{
"pp": "ι : Type u_1\nM : Type u_2\nS : Type u_4\ninst✝⁴ : Monoid M\ninst✝³ : LinearOrder S\ninst✝² : Finite ι\ninst✝¹ : CommMonoid S\ninst✝ : IsOrderedCancelMonoid S\nv : ι → M\nf : M →* S\nt : Set ι := {i | IsMulIndecomposable v {j | 1 < f (v j)} i}\ns : Set ι := {j | 1 < f (v j) ∧ v j ∉ closure (v '' t)}\nh... | have hk' : v k ∈ closure (v '' t) := hi₂ k hk <| by aesop | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tacticHave___1 | Lean.Parser.Tactic.tacticHave__ |
Mathlib.AlgebraicTopology.MooreComplex | {
"line": 103,
"column": 8
} | {
"line": 103,
"column": 41
} | [
{
"pp": "case zero\nC : Type u_1\ninst✝¹ : Category.{v_1, u_1} C\ninst✝ : Abelian C\nX : SimplicialObject C\n⊢ (Finset.univ.inf fun k ↦ kernelSubobject (X.δ k.succ)).factorThru\n ((Finset.univ.inf fun k ↦ kernelSubobject (X.δ k.succ)).arrow ≫ X.δ 0) ⋯ ≫\n (Finset.univ.inf fun k ↦ kernelSubobject (X.... | Subobject.factorThru_arrow_assoc, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.CategoryTheory.Idempotents.Karoubi | {
"line": 160,
"column": 17
} | {
"line": 160,
"column": 49
} | [
{
"pp": "C : Type u_1\ninst✝¹ : Category.{v_1, u_1} C\ninst✝ : Preadditive C\nP Q : Karoubi C\n⊢ P.p ≫ 0 ≫ Q.p = 0",
"usedConstants": [
"CategoryTheory.CategoryStruct.toQuiver",
"Quiver.Hom",
"congrArg",
"CategoryTheory.Limits.comp_zero",
"CategoryTheory.Idempotents.Karoubi.p",... | simp only [comp_zero, zero_comp] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.CategoryTheory.Idempotents.Karoubi | {
"line": 160,
"column": 17
} | {
"line": 160,
"column": 49
} | [
{
"pp": "C : Type u_1\ninst✝¹ : Category.{v_1, u_1} C\ninst✝ : Preadditive C\nP Q : Karoubi C\n⊢ P.p ≫ 0 ≫ Q.p = 0",
"usedConstants": [
"CategoryTheory.CategoryStruct.toQuiver",
"Quiver.Hom",
"congrArg",
"CategoryTheory.Limits.comp_zero",
"CategoryTheory.Idempotents.Karoubi.p",... | simp only [comp_zero, zero_comp] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.CategoryTheory.Idempotents.Karoubi | {
"line": 160,
"column": 17
} | {
"line": 160,
"column": 49
} | [
{
"pp": "C : Type u_1\ninst✝¹ : Category.{v_1, u_1} C\ninst✝ : Preadditive C\nP Q : Karoubi C\n⊢ P.p ≫ 0 ≫ Q.p = 0",
"usedConstants": [
"CategoryTheory.CategoryStruct.toQuiver",
"Quiver.Hom",
"congrArg",
"CategoryTheory.Limits.comp_zero",
"CategoryTheory.Idempotents.Karoubi.p",... | simp only [comp_zero, zero_comp] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.CategoryTheory.Idempotents.FunctorCategories | {
"line": 85,
"column": 4
} | {
"line": 85,
"column": 18
} | [
{
"pp": "case h.right.w.h\nJ : Type u_1\nC : Type u_2\ninst✝² : Category.{v_1, u_1} J\ninst✝¹ : Category.{v_2, u_2} C\nP Q : Karoubi (J ⥤ C)\nf : P ⟶ Q\nX : J\ninst✝ : IsIdempotentComplete C\nF : J ⥤ C\np : F ⟶ F\nhp : p ≫ p = p\nhC : ∀ (X : C) (p : X ⟶ X), p ≫ p = p → HasEqualizer (𝟙 X) p\nthis : ∀ (j : J), H... | simp [Y, i, e] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.AlgebraicTopology.SimplexCategory.Basic | {
"line": 345,
"column": 6
} | {
"line": 347,
"column": 96
} | [
{
"pp": "case a.h.h.inl.inl\nn : ℕ\ni : Fin (n + 2)\nj : Fin (n + 1)\nH : j.castSucc < i\nk : Fin (⦋n + 1⦌.len + 1)\nhik : k ≤ i\nhjk : k ≤ j.castSucc\n⊢ j.castSucc.predAbove k.castSucc = i.succAbove (j.predAbove k)",
"usedConstants": [
"Iff.mpr",
"Fin.succAbove",
"Eq.mpr",
"Fin.ext_... | rw [Fin.predAbove_of_le_castSucc _ _
(Fin.castSucc_le_castSucc_iff.mpr hjk), Fin.castPred_castSucc,
Fin.predAbove_of_le_castSucc _ _ hjk, Fin.succAbove_of_castSucc_lt, Fin.castSucc_castPred] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.AlgebraicTopology.SimplicialSet.Subcomplex | {
"line": 32,
"column": 32
} | {
"line": 40,
"column": 20
} | [
{
"pp": "X✝ Y✝ : SSet\nf : X✝ ⟶ Y✝\nx✝¹ : Mono f\nx✝ : Epi f\n⊢ IsIso f",
"usedConstants": [
"CategoryTheory.Limits.Types.hasColimitsOfSize",
"CategoryTheory.Limits.hasFiniteLimits_of_hasLimits",
"Eq.mpr",
"CategoryTheory.Functor",
"CategoryTheory.IsIso",
"Opposite",
... | by
rw [NatTrans.isIso_iff_isIso_app]
intro
rw [isIso_iff_bijective]
constructor
· rw [← mono_iff_injective]
infer_instance
· rw [← epi_iff_surjective]
infer_instance | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.AlgebraicTopology.SimplicialSet.Degenerate | {
"line": 156,
"column": 59
} | {
"line": 159,
"column": 52
} | [
{
"pp": "X : SSet\nn : ℕ\nx : X _⦋n⦌\nm₁ m₂ : ℕ\nf₁ : ⦋n⦌ ⟶ ⦋m₁⦌\nhf₁ : SplitEpi f₁\ny₁ : ↑(X.nonDegenerate m₁)\nhy₁ : x = X.map f₁.op ↑y₁\nf₂ : ⦋n⦌ ⟶ ⦋m₂⦌\ny₂ : X _⦋m₂⦌\nhy₂ : x = X.map f₂.op y₂\n⊢ X.map (g hf₁ f₂).op y₂ = ↑y₁",
"usedConstants": [
"Eq.mpr",
"CategoryTheory.op_comp",
"Cate... | by
dsimp [g]
rw [FunctorToTypes.map_comp_apply, ← hy₂, hy₁, ← FunctorToTypes.map_comp_apply, ← op_comp,
SplitEpi.id, op_id, FunctorToTypes.map_id_apply] | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.AlgebraicTopology.SimplicialSet.Simplices | {
"line": 148,
"column": 4
} | {
"line": 148,
"column": 41
} | [
{
"pp": "X : SSet\nn : SimplexCategory\nx : X.obj (Opposite.op n)\n⊢ X.S",
"usedConstants": [
"SSet.S",
"SimplexCategory.rec",
"Opposite",
"Opposite.op",
"Nat",
"CategoryTheory.types",
"SimplexCategory",
"CategoryTheory.Category.opposite",
"SimplexCatego... | induction n using SimplexCategory.rec | _private.Lean.Elab.Tactic.Induction.0.Lean.Elab.Tactic.evalInduction | Lean.Parser.Tactic.induction |
Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices | {
"line": 85,
"column": 29
} | {
"line": 85,
"column": 43
} | [
{
"pp": "X : SSet\nd : ℕ\nx : X _⦋d⦌\nhx : x ∈ X.nonDegenerate d\ny : X _⦋d⦌\nhy : y ∈ X.nonDegenerate d\nh : mk ↑⟨x, hx⟩ ⋯ < mk ↑⟨y, hy⟩ ⋯\nw✝ : Mono (𝟙 ⦋(mk ↑⟨x, hx⟩ ⋯).dim⦌)\nhf : X.map (𝟙 ⦋(mk ↑⟨x, hx⟩ ⋯).dim⦌).op (mk ↑⟨y, hy⟩ ⋯).simplex = (mk ↑⟨x, hx⟩ ⋯).simplex\n⊢ y = x",
"usedConstants": [
"S... | simpa using hf | Lean.Elab.Tactic.Simpa.evalSimpa | Lean.Parser.Tactic.simpa |
Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices | {
"line": 85,
"column": 29
} | {
"line": 85,
"column": 43
} | [
{
"pp": "X : SSet\nd : ℕ\nx : X _⦋d⦌\nhx : x ∈ X.nonDegenerate d\ny : X _⦋d⦌\nhy : y ∈ X.nonDegenerate d\nh : mk ↑⟨x, hx⟩ ⋯ < mk ↑⟨y, hy⟩ ⋯\nw✝ : Mono (𝟙 ⦋(mk ↑⟨x, hx⟩ ⋯).dim⦌)\nhf : X.map (𝟙 ⦋(mk ↑⟨x, hx⟩ ⋯).dim⦌).op (mk ↑⟨y, hy⟩ ⋯).simplex = (mk ↑⟨x, hx⟩ ⋯).simplex\n⊢ y = x",
"usedConstants": [
"S... | simpa using hf | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices | {
"line": 85,
"column": 29
} | {
"line": 85,
"column": 43
} | [
{
"pp": "X : SSet\nd : ℕ\nx : X _⦋d⦌\nhx : x ∈ X.nonDegenerate d\ny : X _⦋d⦌\nhy : y ∈ X.nonDegenerate d\nh : mk ↑⟨x, hx⟩ ⋯ < mk ↑⟨y, hy⟩ ⋯\nw✝ : Mono (𝟙 ⦋(mk ↑⟨x, hx⟩ ⋯).dim⦌)\nhf : X.map (𝟙 ⦋(mk ↑⟨x, hx⟩ ⋯).dim⦌).op (mk ↑⟨y, hy⟩ ⋯).simplex = (mk ↑⟨x, hx⟩ ⋯).simplex\n⊢ y = x",
"usedConstants": [
"S... | simpa using hf | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices | {
"line": 95,
"column": 4
} | {
"line": 95,
"column": 26
} | [
{
"pp": "X : SSet\nn₁ : ℕ\nx₁ : X _⦋n₁⦌\nhx₁ : x₁ ∈ X.nonDegenerate n₁\nx₂ : X _⦋n₁⦌\nhx₂ : x₂ ∈ X.nonDegenerate n₁\nh : ∃ f, ∃ (_ : Mono f), X.map f.op (mk ↑⟨x₂, hx₂⟩ ⋯).simplex = (mk ↑⟨x₁, hx₁⟩ ⋯).simplex\nh' : mk ↑⟨x₂, hx₂⟩ ⋯ ≤ mk ↑⟨x₁, hx₁⟩ ⋯\n⊢ mk ↑⟨x₁, hx₁⟩ ⋯ = mk ↑⟨x₂, hx₂⟩ ⋯",
"usedConstants": []
... | obtain ⟨f, hf, h⟩ := h | _private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalObtain | Lean.Parser.Tactic.obtain |
Mathlib.AlgebraicTopology.SimplicialObject.Basic | {
"line": 507,
"column": 8
} | {
"line": 507,
"column": 94
} | [
{
"pp": "C : Type u\ninst✝ : Category.{v, u} C\nX✝ X : SimplicialObject C\nX₀ : C\nf : X _⦋0⦌ ⟶ X₀\nw : ∀ (i : SimplexCategory) (g₁ g₂ : ⦋0⦌ ⟶ i), X.map g₁.op ≫ f = X.map g₂.op ≫ f\ni j : SimplexCategoryᵒᵖ\ng : i ⟶ j\n⊢ X.map g.unop.op ≫ X.map (⦋0⦌.const (unop j) 0).op ≫ f = (X.map (⦋0⦌.const (unop i) 0).op ≫ f... | simpa only [← X.map_comp, ← Category.assoc, Category.comp_id, ← op_comp] using w _ _ _ | Lean.Elab.Tactic.Simpa.evalSimpa | Lean.Parser.Tactic.simpa |
Mathlib.AlgebraicTopology.SimplexCategory.Basic | {
"line": 759,
"column": 10
} | {
"line": 759,
"column": 13
} | [
{
"pp": "case pos\nn : ℕ\nΔ' : SimplexCategory\nθ : ⦋n + 1⦌ ⟶ Δ'\ni : Fin (n + 1)\nhi : (Hom.toOrderHom θ) i.castSucc = (Hom.toOrderHom θ) i.succ\nx : Fin (⦋n + 1⦌.len + 1)\nh'✝ : i.castSucc < x\ny : Fin ⦋n + 1⦌.len := x.pred ⋯\nh' : i.castSucc < y.succ\nhy : x = y.succ\nh'' : y = i\n⊢ (Hom.toOrderHom θ) y.succ... | h'' | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.AlgebraicTopology.SimplicialSet.Finite | {
"line": 105,
"column": 4
} | {
"line": 105,
"column": 39
} | [
{
"pp": "X Y : SSet\ninst✝ : X.Finite\nf : X ⟶ Y\nhf : Epi f\nd : ℕ\nh✝ : X.HasDimensionLT d\nthis : Y.HasDimensionLT d\ni : ℕ\nhi : i < d\n⊢ Finite (Y _⦋i⦌)",
"usedConstants": [
"CategoryTheory.Limits.Types.hasColimitsOfSize",
"CategoryTheory.Functor",
"CategoryTheory.NatTrans.epi_iff_epi... | rw [NatTrans.epi_iff_epi_app] at hf | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.AlgebraicTopology.ExtraDegeneracy | {
"line": 203,
"column": 4
} | {
"line": 203,
"column": 10
} | [
{
"pp": "Δ : SimplexCategory\nn : ℕ\n⊢ (fun f ↦ objEquiv.symm (shift (objEquiv f))) ≫ (stdSimplex.obj Δ).left.δ 0 = 𝟙 ((stdSimplex.obj Δ).left _⦋n⦌)",
"usedConstants": [
"instNeZeroNatHAdd_1",
"Opposite",
"Equiv.instEquivLike",
"CategoryTheory.CategoryStruct.toQuiver",
"Quiver... | ext1 φ | Lean.Elab.Tactic.Ext._aux_Init_Ext___macroRules_Lean_Elab_Tactic_Ext_tacticExt1____1 | Lean.Elab.Tactic.Ext.tacticExt1___ |
Mathlib.AlgebraicTopology.ExtraDegeneracy | {
"line": 210,
"column": 4
} | {
"line": 210,
"column": 10
} | [
{
"pp": "Δ : SimplexCategory\nn : ℕ\ni : Fin (n + 2)\n⊢ (fun f ↦ objEquiv.symm (shift (objEquiv f))) ≫ (stdSimplex.obj Δ).left.δ i.succ =\n (stdSimplex.obj Δ).left.δ i ≫ fun f ↦ objEquiv.symm (shift (objEquiv f))",
"usedConstants": [
"Opposite",
"Equiv.instEquivLike",
"CategoryTheory.Ca... | ext1 φ | Lean.Elab.Tactic.Ext._aux_Init_Ext___macroRules_Lean_Elab_Tactic_Ext_tacticExt1____1 | Lean.Elab.Tactic.Ext.tacticExt1___ |
Mathlib.AlgebraicTopology.ExtraDegeneracy | {
"line": 218,
"column": 4
} | {
"line": 218,
"column": 10
} | [
{
"pp": "Δ : SimplexCategory\nn : ℕ\ni : Fin (n + 1)\n⊢ (fun f ↦ objEquiv.symm (shift (objEquiv f))) ≫ (stdSimplex.obj Δ).left.σ i.succ =\n (stdSimplex.obj Δ).left.σ i ≫ fun f ↦ objEquiv.symm (shift (objEquiv f))",
"usedConstants": [
"Opposite",
"Equiv.instEquivLike",
"CategoryTheory.Ca... | ext1 φ | Lean.Elab.Tactic.Ext._aux_Init_Ext___macroRules_Lean_Elab_Tactic_Ext_tacticExt1____1 | Lean.Elab.Tactic.Ext.tacticExt1___ |
Mathlib.AlgebraicTopology.ExtraDegeneracy | {
"line": 217,
"column": 18
} | {
"line": 224,
"column": 36
} | [
{
"pp": "Δ : SimplexCategory\nn : ℕ\ni : Fin (n + 1)\n⊢ (fun f ↦ objEquiv.symm (shift (objEquiv f))) ≫ (stdSimplex.obj Δ).left.σ i.succ =\n (stdSimplex.obj Δ).left.σ i ≫ fun f ↦ objEquiv.symm (shift (objEquiv f))",
"usedConstants": [
"instNeZeroNatHAdd_1",
"Opposite",
"Equiv.instEquivLi... | by
ext1 φ
apply objEquiv.injective
apply SimplexCategory.Hom.ext
ext j : 2
dsimp [SimplicialObject.σ, SimplexCategory.σ, SSet.stdSimplex, objEquiv, Equiv.ulift,
uliftFunctor, Function.comp_def]
cases j using Fin.cases <;> simp | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.AlgebraicTopology.ExtraDegeneracy | {
"line": 334,
"column": 51
} | {
"line": 334,
"column": 65
} | [
{
"pp": "C : Type u_1\ninst✝² : Category.{v_1, u_1} C\ninst✝¹ : Preadditive C\ninst✝ : HasZeroObject C\nX : Augmented C\ned : X.ExtraDegeneracy\n⊢ point.obj X ⟶ (AlternatingFaceMapComplex.obj (drop.obj X)).X 0",
"usedConstants": [
"CategoryTheory.SimplicialObject.Augmented.ExtraDegeneracy.s'"
]
... | by exact ed.s' | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.Algebra.Homology.ComplexShapeSigns | {
"line": 186,
"column": 4
} | {
"line": 186,
"column": 27
} | [
{
"pp": "I₁ : Type u_1\nI₂ : Type u_2\nI₃ : Type u_3\nI₁₂ : Type u_4\nI₂₃ : Type u_5\nJ : Type u_6\nc₁ : ComplexShape I₁\nc₂ : ComplexShape I₂\nc₃ : ComplexShape I₃\nc₁₂ : ComplexShape I₁₂\nc₂₃ : ComplexShape I₂₃\nc✝ : ComplexShape J\ninst✝² : TotalComplexShape c₁ c₂ c₁₂\nI : Type u_7\ninst✝¹ : AddMonoid I\nc :... | rw [Int.negOnePow_succ] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.Algebra.Homology.ComplexShapeSigns | {
"line": 355,
"column": 38
} | {
"line": 355,
"column": 46
} | [
{
"pp": "I₁ : Type u_1\nI₂ : Type u_2\nI₃ : Type u_3\nI₁₂ : Type u_4\nI₂₃ : Type u_5\nJ : Type u_6\nc₁ : ComplexShape I₁\nc₂ : ComplexShape I₂\nc₃ : ComplexShape I₃\nc₁₂ : ComplexShape I₁₂\nc₂₃ : ComplexShape I₂₃\nc : ComplexShape J\ninst✝² : TotalComplexShape c₁ c₂ c₁₂\ninst✝¹ : TotalComplexShape c₂ c₁ c₁₂\nin... | mul_add, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Homology.TotalComplex | {
"line": 377,
"column": 2
} | {
"line": 377,
"column": 34
} | [
{
"pp": "case pos\nC : Type u_1\ninst✝⁵ : Category.{v_1, u_1} C\ninst✝⁴ : Preadditive C\nI₁ : Type u_2\nI₂ : Type u_3\nI₁₂ : Type u_4\nc₁ : ComplexShape I₁\nc₂ : ComplexShape I₂\nK L : HomologicalComplex₂ C c₁ c₂\nφ : K ⟶ L\nc₁₂ : ComplexShape I₁₂\ninst✝³ : TotalComplexShape c₁ c₂ c₁₂\ninst✝² : DecidableEq I₁₂\... | · simp [totalAux.d₁_eq' _ c₁₂ h] | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.Algebra.Homology.TotalComplex | {
"line": 411,
"column": 4
} | {
"line": 411,
"column": 63
} | [
{
"pp": "C : Type u_1\ninst✝⁵ : Category.{v_1, u_1} C\ninst✝⁴ : Preadditive C\nI₁ : Type u_2\nI₂ : Type u_3\nI₁₂ : Type u_4\nc₁ : ComplexShape I₁\nc₂ : ComplexShape I₂\nK L M : HomologicalComplex₂ C c₁ c₂\nφ : K ⟶ L\ne : K ≅ L\nψ : L ⟶ M\nc₁₂ : ComplexShape I₁₂\ninst✝³ : TotalComplexShape c₁ c₂ c₁₂\ninst✝² : De... | rw [comp_add, add_comp, mapAux.mapMap_D₁, mapAux.mapMap_D₂] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.Algebra.Homology.TotalComplexSymmetry | {
"line": 100,
"column": 6
} | {
"line": 101,
"column": 46
} | [
{
"pp": "case pos\nC : Type u_1\nI₁ : Type u_2\nI₂ : Type u_3\nJ : Type u_4\ninst✝⁶ : Category.{v_1, u_1} C\ninst✝⁵ : Preadditive C\nc₁ : ComplexShape I₁\nc₂ : ComplexShape I₂\nK : HomologicalComplex₂ C c₁ c₂\nc : ComplexShape J\ninst✝⁴ : TotalComplexShape c₁ c₂ c\ninst✝³ : TotalComplexShape c₂ c₁ c\ninst✝² : T... | have h₄ : ComplexShape.π c₁ c₂ c (i₁, ComplexShape.next c₂ i₂) = j' := by
rw [← h₃, ComplexShape.π_symm c₁ c₂ c] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tacticHave___1 | Lean.Parser.Tactic.tacticHave__ |
Mathlib.CategoryTheory.GradedObject.Trifunctor | {
"line": 292,
"column": 19
} | {
"line": 292,
"column": 28
} | [
{
"pp": "C₁ : Type u_1\nC₂ : Type u_2\nC₃ : Type u_3\nC₄ : Type u_4\nC₁₂ : Type u_5\nC₂₃ : Type u_6\ninst✝⁷ : Category.{v_1, u_1} C₁\ninst✝⁶ : Category.{v_2, u_2} C₂\ninst✝⁵ : Category.{v_3, u_3} C₃\ninst✝⁴ : Category.{v_4, u_4} C₄\ninst✝³ : Category.{v_5, u_5} C₁₂\ninst✝² : Category.{v_6, u_6} C₂₃\nF₁₂ : C₁ ⥤ ... | ← ρ₁₂.hpq | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.CategoryTheory.GradedObject.Trifunctor | {
"line": 300,
"column": 28
} | {
"line": 300,
"column": 37
} | [
{
"pp": "C₁ : Type u_1\nC₂ : Type u_2\nC₃ : Type u_3\nC₄ : Type u_4\nC₁₂ : Type u_5\nC₂₃ : Type u_6\ninst✝⁷ : Category.{v_1, u_1} C₁\ninst✝⁶ : Category.{v_2, u_2} C₂\ninst✝⁵ : Category.{v_3, u_3} C₃\ninst✝⁴ : Category.{v_4, u_4} C₄\ninst✝³ : Category.{v_5, u_5} C₁₂\ninst✝² : Category.{v_6, u_6} C₂₃\nF₁₂ : C₁ ⥤ ... | ← ρ₁₂.hpq | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Homology.TotalComplexSymmetry | {
"line": 157,
"column": 33
} | {
"line": 157,
"column": 52
} | [
{
"pp": "case w.h.h\nC : Type u_1\nI₁ : Type u_2\nI₂ : Type u_3\nJ : Type u_4\ninst✝⁸ : Category.{v_1, u_1} C\ninst✝⁷ : Preadditive C\nc₁ : ComplexShape I₁\nc₂ : ComplexShape I₂\nK : HomologicalComplex₂ C c₁ c₂\nc : ComplexShape J\ninst✝⁶ : TotalComplexShape c₁ c₂ c\ninst✝⁵ : TotalComplexShape c₂ c₁ c\ninst✝⁴ :... | ComplexShape.σ_symm | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.CategoryTheory.Shift.CommShiftTwo | {
"line": 67,
"column": 4
} | {
"line": 69,
"column": 7
} | [
{
"pp": "C₁ : Type u_1\nC₁' : Type u_2\nC₂ : Type u_3\nC₂' : Type u_4\nD : Type u_5\ninst✝⁷ : Category.{v_1, u_1} C₁\ninst✝⁶ : Category.{v_2, u_2} C₁'\ninst✝⁵ : Category.{v_3, u_3} C₂\ninst✝⁴ : Category.{v_4, u_4} C₂'\ninst✝³ : Category.{v_5, u_5} D\ninst✝² : Preadditive D\ninst✝¹ : HasShift D ℤ\ninst✝ : ∀ (n :... | dsimp
rw [← zpow_add, ← zpow_add]
lia | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.CategoryTheory.Shift.CommShiftTwo | {
"line": 67,
"column": 4
} | {
"line": 69,
"column": 7
} | [
{
"pp": "C₁ : Type u_1\nC₁' : Type u_2\nC₂ : Type u_3\nC₂' : Type u_4\nD : Type u_5\ninst✝⁷ : Category.{v_1, u_1} C₁\ninst✝⁶ : Category.{v_2, u_2} C₁'\ninst✝⁵ : Category.{v_3, u_3} C₂\ninst✝⁴ : Category.{v_4, u_4} C₂'\ninst✝³ : Category.{v_5, u_5} D\ninst✝² : Preadditive D\ninst✝¹ : HasShift D ℤ\ninst✝ : ∀ (n :... | dsimp
rw [← zpow_add, ← zpow_add]
lia | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Algebra.Homology.TotalComplexShift | {
"line": 117,
"column": 2
} | {
"line": 118,
"column": 16
} | [
{
"pp": "C : Type u_1\ninst✝² : Category.{v_1, u_1} C\ninst✝¹ : Preadditive C\nK L : HomologicalComplex₂ C (up ℤ) (up ℤ)\nf : K ⟶ L\nx y : ℤ\ninst✝ : K.HasTotal (up ℤ)\n⊢ ((shiftFunctor₂ C y ⋙ shiftFunctor₁ C x).obj K).HasTotal (up ℤ)",
"usedConstants": [
"Int.instAddCommMonoid",
"Int.instIsStri... | dsimp
infer_instance | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Algebra.Homology.TotalComplexShift | {
"line": 117,
"column": 2
} | {
"line": 118,
"column": 16
} | [
{
"pp": "C : Type u_1\ninst✝² : Category.{v_1, u_1} C\ninst✝¹ : Preadditive C\nK L : HomologicalComplex₂ C (up ℤ) (up ℤ)\nf : K ⟶ L\nx y : ℤ\ninst✝ : K.HasTotal (up ℤ)\n⊢ ((shiftFunctor₂ C y ⋙ shiftFunctor₁ C x).obj K).HasTotal (up ℤ)",
"usedConstants": [
"Int.instAddCommMonoid",
"Int.instIsStri... | dsimp
infer_instance | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Algebra.Homology.TotalComplexShift | {
"line": 121,
"column": 2
} | {
"line": 122,
"column": 16
} | [
{
"pp": "C : Type u_1\ninst✝² : Category.{v_1, u_1} C\ninst✝¹ : Preadditive C\nK L : HomologicalComplex₂ C (up ℤ) (up ℤ)\nf : K ⟶ L\nx y : ℤ\ninst✝ : K.HasTotal (up ℤ)\n⊢ ((shiftFunctor₁ C x ⋙ shiftFunctor₂ C y).obj K).HasTotal (up ℤ)",
"usedConstants": [
"Int.instAddCommMonoid",
"Int.instIsStri... | dsimp
infer_instance | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.Algebra.Homology.TotalComplexShift | {
"line": 121,
"column": 2
} | {
"line": 122,
"column": 16
} | [
{
"pp": "C : Type u_1\ninst✝² : Category.{v_1, u_1} C\ninst✝¹ : Preadditive C\nK L : HomologicalComplex₂ C (up ℤ) (up ℤ)\nf : K ⟶ L\nx y : ℤ\ninst✝ : K.HasTotal (up ℤ)\n⊢ ((shiftFunctor₁ C x ⋙ shiftFunctor₂ C y).obj K).HasTotal (up ℤ)",
"usedConstants": [
"Int.instAddCommMonoid",
"Int.instIsStri... | dsimp
infer_instance | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.Algebra.Homology.TotalComplexShift | {
"line": 153,
"column": 8
} | {
"line": 153,
"column": 19
} | [
{
"pp": "case pos.h\nC : Type u_1\ninst✝² : Category.{v_1, u_1} C\ninst✝¹ : Preadditive C\nK : HomologicalComplex₂ C (up ℤ) (up ℤ)\nx : ℤ\ninst✝ : K.HasTotal (up ℤ)\nn₀ n₁ n₀' n₁' : ℤ\nh₀ : n₀ + x = n₀'\nh₁ : n₁ + x = n₁'\nh : n₀ + 1 = n₁\np q : ℤ\nhpq : p + q = n₀\n⊢ (((shiftFunctor₁ C x).obj K).ιTotal (up ℤ) ... | ι_D₁_assoc, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Homology.TotalComplexShift | {
"line": 178,
"column": 4
} | {
"line": 178,
"column": 70
} | [
{
"pp": "case neg\nC : Type u_1\ninst✝² : Category.{v_1, u_1} C\ninst✝¹ : Preadditive C\nK : HomologicalComplex₂ C (up ℤ) (up ℤ)\nx : ℤ\ninst✝ : K.HasTotal (up ℤ)\nn₀ n₁ n₀' n₁' : ℤ\nh₀ : n₀ + x = n₀'\nh₁ : n₁ + x = n₁'\nh : ¬(up ℤ).Rel n₀ n₁\n⊢ ((shiftFunctor₁ C x).obj K).D₂ (up ℤ) n₀ n₁ ≫ (K.totalShift₁XIso x... | rw [D₂_shape _ _ _ _ h, zero_comp, D₂_shape, comp_zero, smul_zero] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.Algebra.Homology.TotalComplexShift | {
"line": 263,
"column": 8
} | {
"line": 263,
"column": 19
} | [
{
"pp": "case pos.h\nC : Type u_1\ninst✝² : Category.{v_1, u_1} C\ninst✝¹ : Preadditive C\nK : HomologicalComplex₂ C (up ℤ) (up ℤ)\ny : ℤ\ninst✝ : K.HasTotal (up ℤ)\nn₀ n₁ n₀' n₁' : ℤ\nh₀ : n₀ + y = n₀'\nh₁ : n₁ + y = n₁'\nh : n₀ + 1 = n₁\np q : ℤ\nhpq : p + q = n₀\n⊢ (((shiftFunctor₂ C y).obj K).ιTotal (up ℤ) ... | ι_D₁_assoc, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.Algebra.Homology.TotalComplexShift | {
"line": 294,
"column": 4
} | {
"line": 294,
"column": 70
} | [
{
"pp": "case neg\nC : Type u_1\ninst✝² : Category.{v_1, u_1} C\ninst✝¹ : Preadditive C\nK : HomologicalComplex₂ C (up ℤ) (up ℤ)\ny : ℤ\ninst✝ : K.HasTotal (up ℤ)\nn₀ n₁ n₀' n₁' : ℤ\nh₀ : n₀ + y = n₀'\nh₁ : n₁ + y = n₁'\nh : ¬(up ℤ).Rel n₀ n₁\n⊢ ((shiftFunctor₂ C y).obj K).D₂ (up ℤ) n₀ n₁ ≫ (K.totalShift₂XIso y... | rw [D₂_shape _ _ _ _ h, zero_comp, D₂_shape, comp_zero, smul_zero] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.Algebra.Homology.BifunctorAssociator | {
"line": 675,
"column": 62
} | {
"line": 675,
"column": 95
} | [
{
"pp": "C₁ : Type u_1\nC₂ : Type u_2\nC₂₃ : Type u_4\nC₃ : Type u_5\nC₄ : Type u_6\ninst✝²³ : Category.{v_1, u_1} C₁\ninst✝²² : Category.{v_2, u_2} C₂\ninst✝²¹ : Category.{v_3, u_5} C₃\ninst✝²⁰ : Category.{v_4, u_6} C₄\ninst✝¹⁹ : Category.{v_6, u_4} C₂₃\ninst✝¹⁸ : HasZeroMorphisms C₁\ninst✝¹⁷ : HasZeroMorphism... | ComplexShape.next_π₂ c₂ c₂₃ i₂ h₃ | Lean.Elab.Tactic.evalRewriteSeq | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.