module
stringlengths
17
90
startPos
dict
endPos
dict
nextStartPos
dict
goals
listlengths
0
96
goalsAfter
listlengths
0
96
ppTac
stringlengths
1
12.3k
elaborator
stringclasses
379 values
kind
stringclasses
383 values
Mathlib.Algebra.Group.Pi.Lemmas
{ "line": 376, "column": 2 }
{ "line": 376, "column": 46 }
{ "line": 378, "column": 0 }
[ { "pp": "α : Type u_5\nβ : α → Type u_6\nγ : (a : α) → β a → Type u_7\ninst✝² : DecidableEq α\ninst✝¹ : (a : α) → DecidableEq (β a)\ninst✝ : (a : α) → (b : β a) → One (γ a b)\na : α\nb : β a\nx : γ a b\n⊢ uncurry (Pi.mulSingle a (Pi.mulSingle b x)) = Pi.mulSingle ⟨a, b⟩ x", "ppTerm": "?m.24", "assigned"...
[]
rw [← curry_mulSingle ⟨a, b⟩, uncurry_curry]
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Algebra.Group.Pi.Lemmas
{ "line": 376, "column": 2 }
{ "line": 376, "column": 46 }
{ "line": 378, "column": 0 }
[ { "pp": "α : Type u_5\nβ : α → Type u_6\nγ : (a : α) → β a → Type u_7\ninst✝² : DecidableEq α\ninst✝¹ : (a : α) → DecidableEq (β a)\ninst✝ : (a : α) → (b : β a) → One (γ a b)\na : α\nb : β a\nx : γ a b\n⊢ uncurry (Pi.mulSingle a (Pi.mulSingle b x)) = Pi.mulSingle ⟨a, b⟩ x", "ppTerm": "?m.24", "assigned"...
[]
rw [← curry_mulSingle ⟨a, b⟩, uncurry_curry]
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Algebra.Module.LinearMap.Defs
{ "line": 634, "column": 13 }
{ "line": 636, "column": 13 }
{ "line": 638, "column": 0 }
[ { "pp": "R : Type u_1\nS : Type u_5\nM : Type u_8\nM₂ : Type u_10\ninst✝⁵ : AddCommMonoid M\ninst✝⁴ : AddCommMonoid M₂\ninst✝³ : Semiring R\ninst✝² : Module R M\ninst✝¹ : Semiring S\ninst✝ : Module S M₂\nσ : R →+* S\nf g : M →ₑ+[↑σ] M₂\nh : ↑f = ↑g\n⊢ f = g", "ppTerm": "?m.51", "assigned": true, "us...
[]
by ext m congrm $h m
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.GroupTheory.GroupAction.Hom
{ "line": 189, "column": 52 }
{ "line": 189, "column": 63 }
{ "line": 189, "column": 64 }
[ { "pp": "M' : Type u_1\nX : Type u_5\ninst✝⁶ : SMul M' X\nY : Type u_6\ninst✝⁵ : SMul M' Y\nF : Type u_8\ninst✝⁴ : FunLike F X Y\ninst✝³ : MulOneClass X\ninst✝² : SMul X Y\ninst✝¹ : IsScalarTower M' X Y\ninst✝ : MulActionHomClass F X X Y\nf : F\nm : M'\nx : X\n⊢ (m • x) • f 1 = id m • f x", "ppTerm": "?m.47...
[ "M' : Type u_1\nX : Type u_5\ninst✝⁶ : SMul M' X\nY : Type u_6\ninst✝⁵ : SMul M' Y\nF : Type u_8\ninst✝⁴ : FunLike F X Y\ninst✝³ : MulOneClass X\ninst✝² : SMul X Y\ninst✝¹ : IsScalarTower M' X Y\ninst✝ : MulActionHomClass F X X Y\nf : F\nm : M'\nx : X\n⊢ m • x • f 1 = id m • f x" ]
smul_assoc,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Group.Unbundled.Basic
{ "line": 158, "column": 51 }
{ "line": 159, "column": 62 }
{ "line": 161, "column": 0 }
[ { "pp": "α : Type u\ninst✝² : Group α\ninst✝¹ : LE α\ninst✝ : MulRightMono α\na b : α\n⊢ 1 ≤ a * b⁻¹ ↔ b ≤ a", "ppTerm": "?m.15", "assigned": true, "usedConstants": [ "Eq.mpr", "MulOne.toOne", "DivInvMonoid.toInv", "InvOneClass.toOne", "HMul.hMul", "DivInvOneMonoi...
[]
by rw [← mul_le_mul_iff_right b, one_mul, inv_mul_cancel_right]
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 62, "column": 30 }
{ "line": 62, "column": 38 }
{ "line": 62, "column": 39 }
[ { "pp": "R : Type u\ninst✝⁴ : Semiring R\ninst✝³ : Preorder R\na b : R\ninst✝² : ZeroLEOneClass R\ninst✝¹ : MulPosMono R\ninst✝ : AddLeftMono R\na2 : 2 ≤ a\nb0 : 0 ≤ b\n⊢ a + (a + a * b) ≤ a * (2 + b)", "ppTerm": "?m.78", "assigned": true, "usedConstants": [ "Distrib.leftDistribClass", "...
[ "R : Type u\ninst✝⁴ : Semiring R\ninst✝³ : Preorder R\na b : R\ninst✝² : ZeroLEOneClass R\ninst✝¹ : MulPosMono R\ninst✝ : AddLeftMono R\na2 : 2 ≤ a\nb0 : 0 ≤ b\n⊢ a + (a + a * b) ≤ a * 2 + a * b" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 80, "column": 57 }
{ "line": 80, "column": 66 }
{ "line": 80, "column": 67 }
[ { "pp": "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : Preorder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosMono R\ninst✝¹ : AddRightMono R\ninst✝ : AddRightReflectLE R\nh : b ≤ a\nhc : c ≤ 0\nd : R\nhcd : 0 = c + d\n⊢ b * d + a * 0 = b * d", "ppTerm": "?m.101", "assigned": true, "usedConstan...
[ "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : Preorder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosMono R\ninst✝¹ : AddRightMono R\ninst✝ : AddRightReflectLE R\nh : b ≤ a\nhc : c ≤ 0\nd : R\nhcd : 0 = c + d\n⊢ b * d + 0 = b * d" ]
mul_zero,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 82, "column": 51 }
{ "line": 82, "column": 60 }
{ "line": 82, "column": 61 }
[ { "pp": "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : Preorder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosMono R\ninst✝¹ : AddRightMono R\ninst✝ : AddRightReflectLE R\nh : b ≤ a\nhc : c ≤ 0\nd : R\nhcd : 0 = c + d\n⊢ a * d = b * 0 + a * d", "ppTerm": "?m.145", "assigned": true, "usedConstan...
[ "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : Preorder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosMono R\ninst✝¹ : AddRightMono R\ninst✝ : AddRightReflectLE R\nh : b ≤ a\nhc : c ≤ 0\nd : R\nhcd : 0 = c + d\n⊢ a * d = 0 + a * d" ]
mul_zero,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 228, "column": 57 }
{ "line": 228, "column": 66 }
{ "line": 228, "column": 67 }
[ { "pp": "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosStrictMono R\ninst✝¹ : AddRightStrictMono R\ninst✝ : AddRightReflectLT R\nh : b < a\nhc : c < 0\nd : R\nhcd : 0 = c + d\n⊢ b * d + a * 0 = b * d", "ppTerm": "?m.126", "assigned": true, ...
[ "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosStrictMono R\ninst✝¹ : AddRightStrictMono R\ninst✝ : AddRightReflectLT R\nh : b < a\nhc : c < 0\nd : R\nhcd : 0 = c + d\n⊢ b * d + 0 = b * d" ]
mul_zero,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 230, "column": 51 }
{ "line": 230, "column": 60 }
{ "line": 230, "column": 61 }
[ { "pp": "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosStrictMono R\ninst✝¹ : AddRightStrictMono R\ninst✝ : AddRightReflectLT R\nh : b < a\nhc : c < 0\nd : R\nhcd : 0 = c + d\n⊢ a * d = b * 0 + a * d", "ppTerm": "?m.149", "assigned": true, ...
[ "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosStrictMono R\ninst✝¹ : AddRightStrictMono R\ninst✝ : AddRightReflectLT R\nh : b < a\nhc : c < 0\nd : R\nhcd : 0 = c + d\n⊢ a * d = 0 + a * d" ]
mul_zero,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 302, "column": 6 }
{ "line": 302, "column": 14 }
{ "line": 302, "column": 15 }
[ { "pp": "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosMono R\ninst✝¹ : AddLeftMono R\ninst✝ : AddLeftReflectLE R\nhab : a ≤ b\nd : R\nhd : 0 ≤ d\nhcd : c ≤ c + d\n⊢ a * (c + d) + b * c ≤ a * c + b * (c + d)", "ppTerm": "?m.72", "assigned":...
[ "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosMono R\ninst✝¹ : AddLeftMono R\ninst✝ : AddLeftReflectLE R\nhab : a ≤ b\nd : R\nhd : 0 ≤ d\nhcd : c ≤ c + d\n⊢ a * c + a * d + b * c ≤ a * c + b * (c + d)" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 302, "column": 31 }
{ "line": 302, "column": 39 }
{ "line": 302, "column": 40 }
[ { "pp": "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosMono R\ninst✝¹ : AddLeftMono R\ninst✝ : AddLeftReflectLE R\nhab : a ≤ b\nd : R\nhd : 0 ≤ d\nhcd : c ≤ c + d\n⊢ a * c + b * c + a * d ≤ a * c + b * (c + d)", "ppTerm": "?m.87", "assigned...
[ "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : ExistsAddOfLE R\ninst✝² : MulPosMono R\ninst✝¹ : AddLeftMono R\ninst✝ : AddLeftReflectLE R\nhab : a ≤ b\nd : R\nhd : 0 ≤ d\nhcd : c ≤ c + d\n⊢ a * c + b * c + a * d ≤ a * c + (b * c + b * d)" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 318, "column": 6 }
{ "line": 318, "column": 14 }
{ "line": 318, "column": 15 }
[ { "pp": "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : AddLeftReflectLT R\ninst✝² : ExistsAddOfLE R\ninst✝¹ : MulPosStrictMono R\ninst✝ : AddLeftStrictMono R\nhab : a < b\nd : R\nhd : 0 < d\nhcd : c < c + d\n⊢ a * (c + d) + b * c < a * c + b * (c + d)", "ppTerm": "?m.72", ...
[ "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : AddLeftReflectLT R\ninst✝² : ExistsAddOfLE R\ninst✝¹ : MulPosStrictMono R\ninst✝ : AddLeftStrictMono R\nhab : a < b\nd : R\nhd : 0 < d\nhcd : c < c + d\n⊢ a * c + a * d + b * c < a * c + b * (c + d)" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 318, "column": 31 }
{ "line": 318, "column": 39 }
{ "line": 318, "column": 40 }
[ { "pp": "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : AddLeftReflectLT R\ninst✝² : ExistsAddOfLE R\ninst✝¹ : MulPosStrictMono R\ninst✝ : AddLeftStrictMono R\nhab : a < b\nd : R\nhd : 0 < d\nhcd : c < c + d\n⊢ a * c + b * c + a * d < a * c + b * (c + d)", "ppTerm": "?m.87", ...
[ "R : Type u\ninst✝⁵ : Semiring R\ninst✝⁴ : PartialOrder R\na b c : R\ninst✝³ : AddLeftReflectLT R\ninst✝² : ExistsAddOfLE R\ninst✝¹ : MulPosStrictMono R\ninst✝ : AddLeftStrictMono R\nhab : a < b\nd : R\nhd : 0 < d\nhcd : c < c + d\n⊢ a * c + b * c + a * d < a * c + (b * c + b * d)" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 616, "column": 45 }
{ "line": 616, "column": 54 }
{ "line": 616, "column": 55 }
[ { "pp": "R : Type u\ninst✝⁴ : Semiring R\ninst✝³ : LinearOrder R\ninst✝² : ExistsAddOfLE R\ninst✝¹ : PosMulMono R\ninst✝ : AddLeftMono R\na : R\nha : a < 0\nb : R\nhab : 0 = a + b\nhb : 0 < b\n⊢ b ^ 2 = b ^ 2 + a * 0", "ppTerm": "?m.184", "assigned": true, "usedConstants": [ "Eq.mpr", "H...
[ "R : Type u\ninst✝⁴ : Semiring R\ninst✝³ : LinearOrder R\ninst✝² : ExistsAddOfLE R\ninst✝¹ : PosMulMono R\ninst✝ : AddLeftMono R\na : R\nha : a < 0\nb : R\nhab : 0 = a + b\nhb : 0 < b\n⊢ b ^ 2 = b ^ 2 + 0" ]
mul_zero,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 617, "column": 47 }
{ "line": 617, "column": 55 }
{ "line": 617, "column": 56 }
[ { "pp": "R : Type u\ninst✝⁴ : Semiring R\ninst✝³ : LinearOrder R\ninst✝² : ExistsAddOfLE R\ninst✝¹ : PosMulMono R\ninst✝ : AddLeftMono R\na : R\nha : a < 0\nb : R\nhab : 0 = a + b\nhb : 0 < b\n⊢ b ^ 2 + a * (a + b) = a ^ 2 + (a * b + b * b)", "ppTerm": "?m.200", "assigned": true, "usedConstants": [ ...
[ "R : Type u\ninst✝⁴ : Semiring R\ninst✝³ : LinearOrder R\ninst✝² : ExistsAddOfLE R\ninst✝¹ : PosMulMono R\ninst✝ : AddLeftMono R\na : R\nha : a < 0\nb : R\nhab : 0 = a + b\nhb : 0 < b\n⊢ b ^ 2 + (a * a + a * b) = a ^ 2 + (a * b + b * b)" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Order.RelIso.Basic
{ "line": 186, "column": 4 }
{ "line": 186, "column": 32 }
{ "line": 187, "column": 2 }
[ { "pp": "case inl\nα : Type u_1\nβ : Type u_2\nr : α → α → Prop\ns : β → β → Prop\ninst✝¹ : Std.Trichotomous r\ninst✝ : Std.Irrefl s\nf : α → β\nhf : ∀ {x y : α}, r x y → s (f x) (f y)\nx y : α\nhxy : f x = f y\nh : r x y\nthis : s (f y) (f y)\n⊢ False", "ppTerm": "?inl", "assigned": true, "usedCons...
[]
exact irrefl_of s (f y) this
Lean.Elab.Tactic.evalExact
Lean.Parser.Tactic.exact
Mathlib.Order.RelIso.Basic
{ "line": 191, "column": 4 }
{ "line": 191, "column": 32 }
{ "line": 193, "column": 0 }
[ { "pp": "case inr.inr\nα : Type u_1\nβ : Type u_2\nr : α → α → Prop\ns : β → β → Prop\ninst✝¹ : Std.Trichotomous r\ninst✝ : Std.Irrefl s\nf : α → β\nhf : ∀ {x y : α}, r x y → s (f x) (f y)\nx y : α\nhxy : f x = f y\nh : r y x\nthis : s (f y) (f y)\n⊢ False", "ppTerm": "?inr.inr", "assigned": true, "...
[]
exact irrefl_of s (f y) this
Lean.Elab.Tactic.evalExact
Lean.Parser.Tactic.exact
Mathlib.Order.RelIso.Basic
{ "line": 787, "column": 16 }
{ "line": 787, "column": 32 }
{ "line": 788, "column": 2 }
[ { "pp": "α : Type u_1\nβ : Type u_2\nγ : Type u_3\nδ : Type u_4\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nu : δ → δ → Prop\ne : r ≃r s\nf : α → β\ng : β → α\nhf : f = ⇑e\nhg : g = ⇑e.symm\nx✝ : α\n⊢ g (f x✝) = x✝", "ppTerm": "?m.24", "assigned": true, "usedConstants": [ "congrArg"...
[]
by simp [hf, hg]
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Order.RelIso.Basic
{ "line": 788, "column": 17 }
{ "line": 788, "column": 33 }
{ "line": 789, "column": 2 }
[ { "pp": "α : Type u_1\nβ : Type u_2\nγ : Type u_3\nδ : Type u_4\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nu : δ → δ → Prop\ne : r ≃r s\nf : α → β\ng : β → α\nhf : f = ⇑e\nhg : g = ⇑e.symm\nx✝ : β\n⊢ f (g x✝) = x✝", "ppTerm": "?m.25", "assigned": true, "usedConstants": [ "congrArg"...
[]
by simp [hf, hg]
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Algebra.Order.Ring.Unbundled.Basic
{ "line": 745, "column": 20 }
{ "line": 745, "column": 30 }
{ "line": 745, "column": 31 }
[ { "pp": "R : Type u\ninst✝⁴ : Ring R\ninst✝³ : LinearOrder R\na b : R\ninst✝² : PosMulStrictMono R\ninst✝¹ : MulPosStrictMono R\ninst✝ : AddLeftMono R\n⊢ 0 ≤ -(a * b) ↔ (0 < a → b ≤ 0) ∧ (b < 0 → 0 ≤ a)", "ppTerm": "?m.39", "assigned": true, "usedConstants": [ "AddGroup.toSubtractionMonoid", ...
[ "R : Type u\ninst✝⁴ : Ring R\ninst✝³ : LinearOrder R\na b : R\ninst✝² : PosMulStrictMono R\ninst✝¹ : MulPosStrictMono R\ninst✝ : AddLeftMono R\n⊢ 0 ≤ a * -b ↔ (0 < a → b ≤ 0) ∧ (b < 0 → 0 ≤ a)" ]
← mul_neg,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Order.Hom.Basic
{ "line": 1434, "column": 4 }
{ "line": 1434, "column": 47 }
{ "line": 1435, "column": 4 }
[ { "pp": "α : Type u_2\nβ : Type u_3\ninst✝⁴ : Lattice α\ninst✝³ : Lattice β\ninst✝² : BoundedOrder α\ninst✝¹ : BoundedOrder β\ninst✝ : ComplementedLattice α\nf : α ≃o β\nx : β\n⊢ ∃ b, IsCompl x b", "ppTerm": "?m.15", "assigned": true, "usedConstants": [ "PartialOrder.toPreorder", "Preord...
[ "α : Type u_2\nβ : Type u_3\ninst✝⁴ : Lattice α\ninst✝³ : Lattice β\ninst✝² : BoundedOrder α\ninst✝¹ : BoundedOrder β\ninst✝ : ComplementedLattice α\nf : α ≃o β\nx : β\ny : α\nhy : IsCompl (f.symm x) y\n⊢ ∃ b, IsCompl x b" ]
obtain ⟨y, hy⟩ := exists_isCompl (f.symm x)
_private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalObtain
Lean.Parser.Tactic.obtain
Mathlib.Algebra.Ring.Invertible
{ "line": 87, "column": 6 }
{ "line": 87, "column": 14 }
{ "line": 87, "column": 15 }
[ { "pp": "R : Type u_1\ninst✝² : Semiring R\na b : R\ninst✝¹ : Invertible a\ninst✝ : Invertible b\n⊢ ⅟a + ⅟b = ⅟a * (a + b) * ⅟b", "ppTerm": "?m.40", "assigned": true, "usedConstants": [ "Distrib.leftDistribClass", "Eq.mpr", "NonAssocSemiring.toAddCommMonoidWithOne", "HMul.hMu...
[ "R : Type u_1\ninst✝² : Semiring R\na b : R\ninst✝¹ : Invertible a\ninst✝ : Invertible b\n⊢ ⅟a + ⅟b = (⅟a * a + ⅟a * b) * ⅟b" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.GroupWithZero.WithZero
{ "line": 440, "column": 80 }
{ "line": 442, "column": 12 }
{ "line": 444, "column": 0 }
[ { "pp": "M : Type u_5\ninst✝ : AddMonoid M\nx : WithZero (Multiplicative M)\nhx : x ≠ 0\n⊢ Multiplicative.toAdd (unzero hx) = x.log", "ppTerm": "?m.11", "assigned": true, "usedConstants": [ "Equiv.instEquivLike", "WithZero.log", "Exists", "Equiv", "WithZero.unzero", ...
[]
by lift x to Multiplicative M using hx simp [log]
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Algebra.Field.Basic
{ "line": 258, "column": 46 }
{ "line": 258, "column": 54 }
{ "line": 258, "column": 55 }
[ { "pp": "K : Type u_1\nL : Type u_2\ninst✝¹⁸ : Zero K\ninst✝¹⁷ : Add K\ninst✝¹⁶ : Neg K\ninst✝¹⁵ : Sub K\ninst✝¹⁴ : One K\ninst✝¹³ : Mul K\ninst✝¹² : Inv K\ninst✝¹¹ : Div K\ninst✝¹⁰ : SMul ℕ K\ninst✝⁹ : SMul ℤ K\ninst✝⁸ : SMul ℚ≥0 K\ninst✝⁷ : SMul ℚ K\ninst✝⁶ : Pow K ℕ\ninst✝⁵ : Pow K ℤ\ninst✝⁴ : NatCast K\nins...
[ "K : Type u_1\nL : Type u_2\ninst✝¹⁸ : Zero K\ninst✝¹⁷ : Add K\ninst✝¹⁶ : Neg K\ninst✝¹⁵ : Sub K\ninst✝¹⁴ : One K\ninst✝¹³ : Mul K\ninst✝¹² : Inv K\ninst✝¹¹ : Div K\ninst✝¹⁰ : SMul ℕ K\ninst✝⁹ : SMul ℤ K\ninst✝⁸ : SMul ℚ≥0 K\ninst✝⁷ : SMul ℚ K\ninst✝⁶ : Pow K ℕ\ninst✝⁵ : Pow K ℤ\ninst✝⁴ : NatCast K\ninst✝³ : IntCas...
intCast,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Monoid.Units
{ "line": 56, "column": 2 }
{ "line": 57, "column": 5 }
{ "line": 59, "column": 0 }
[ { "pp": "α : Type u_1\ninst✝¹ : Monoid α\ninst✝ : LinearOrder α\na b : αˣ\n⊢ ↑(a ⊓ b) = min ↑a ↑b", "ppTerm": "?m.14", "assigned": true, "usedConstants": [ "Units.val_le_val._simp_2", "Units.val", "Eq.mpr", "Units.instMinOfLinearOrder", "congrArg", "PartialOrder.t...
[]
simp_rw [min_def, val_le_val, ← apply_ite] rfl
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Algebra.Order.Monoid.Units
{ "line": 56, "column": 2 }
{ "line": 57, "column": 5 }
{ "line": 59, "column": 0 }
[ { "pp": "α : Type u_1\ninst✝¹ : Monoid α\ninst✝ : LinearOrder α\na b : αˣ\n⊢ ↑(a ⊓ b) = min ↑a ↑b", "ppTerm": "?m.14", "assigned": true, "usedConstants": [ "Units.val_le_val._simp_2", "Units.val", "Eq.mpr", "Units.instMinOfLinearOrder", "congrArg", "PartialOrder.t...
[]
simp_rw [min_def, val_le_val, ← apply_ite] rfl
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Algebra.Order.AddGroupWithTop
{ "line": 265, "column": 2 }
{ "line": 265, "column": 42 }
{ "line": 267, "column": 0 }
[ { "pp": "G : Type u_1\ninst✝ : AddCommGroup G\nx y : WithTop G\n⊢ x - y = ⊤ ↔ x = ⊤ ∨ y = ⊤", "ppTerm": "?m.14", "assigned": true, "usedConstants": [ "False", "congrArg", "WithTop.coe_ne_top._simp_1", "WithTop.LinearOrderedAddCommGroup.sub_top", "HSub.hSub", "AddC...
[]
cases x <;> cases y <;> simp [← coe_sub]
Lean.Parser.Tactic.«_aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tactic_<;>__1»
Lean.Parser.Tactic.«tactic_<;>_»
Mathlib.Algebra.Order.AddGroupWithTop
{ "line": 265, "column": 2 }
{ "line": 265, "column": 42 }
{ "line": 267, "column": 0 }
[ { "pp": "G : Type u_1\ninst✝ : AddCommGroup G\nx y : WithTop G\n⊢ x - y = ⊤ ↔ x = ⊤ ∨ y = ⊤", "ppTerm": "?m.14", "assigned": true, "usedConstants": [ "False", "congrArg", "WithTop.coe_ne_top._simp_1", "WithTop.LinearOrderedAddCommGroup.sub_top", "HSub.hSub", "AddC...
[]
cases x <;> cases y <;> simp [← coe_sub]
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Algebra.Order.AddGroupWithTop
{ "line": 265, "column": 2 }
{ "line": 265, "column": 42 }
{ "line": 267, "column": 0 }
[ { "pp": "G : Type u_1\ninst✝ : AddCommGroup G\nx y : WithTop G\n⊢ x - y = ⊤ ↔ x = ⊤ ∨ y = ⊤", "ppTerm": "?m.14", "assigned": true, "usedConstants": [ "False", "congrArg", "WithTop.coe_ne_top._simp_1", "WithTop.LinearOrderedAddCommGroup.sub_top", "HSub.hSub", "AddC...
[]
cases x <;> cases y <;> simp [← coe_sub]
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Algebra.Order.Sub.Unbundled.Basic
{ "line": 105, "column": 11 }
{ "line": 105, "column": 57 }
{ "line": 106, "column": 2 }
[ { "pp": "α : Type u_1\ninst✝⁵ : AddCommSemigroup α\ninst✝⁴ : PartialOrder α\ninst✝³ : ExistsAddOfLE α\ninst✝² : AddLeftMono α\ninst✝¹ : Sub α\ninst✝ : OrderedSub α\na b c : α\nhb : AddLECancellable b\nhba : b ≤ a\nh : a < b + c\n⊢ a - b < c", "ppTerm": "?m.37", "assigned": true, "usedConstants": [ ...
[ "α : Type u_1\ninst✝⁵ : AddCommSemigroup α\ninst✝⁴ : PartialOrder α\ninst✝³ : ExistsAddOfLE α\ninst✝² : AddLeftMono α\ninst✝¹ : Sub α\ninst✝ : OrderedSub α\na b c : α\nhb : AddLECancellable b\nhba : b ≤ a\nh : a < b + c\n⊢ a - b ≠ c" ]
refine (tsub_le_iff_left.mpr h.le).lt_of_ne ?_
Lean.Elab.Tactic.evalRefine
Lean.Parser.Tactic.refine
Mathlib.Algebra.Order.Ring.Canonical
{ "line": 97, "column": 35 }
{ "line": 97, "column": 44 }
{ "line": 97, "column": 45 }
[ { "pp": "case inl\nR : Type u\ninst✝⁵ : NonUnitalNonAssocSemiring R\ninst✝⁴ : PartialOrder R\ninst✝³ : CanonicallyOrderedAdd R\ninst✝² : Sub R\ninst✝¹ : OrderedSub R\ninst✝ : Std.Total fun x1 x2 ↦ x1 ≤ x2\na b c : R\nh : AddLECancellable (a * c)\nhbc : b ≤ c\n⊢ a * 0 = a * b - a * c", "ppTerm": "?inl", ...
[ "case inl\nR : Type u\ninst✝⁵ : NonUnitalNonAssocSemiring R\ninst✝⁴ : PartialOrder R\ninst✝³ : CanonicallyOrderedAdd R\ninst✝² : Sub R\ninst✝¹ : OrderedSub R\ninst✝ : Std.Total fun x1 x2 ↦ x1 ≤ x2\na b c : R\nh : AddLECancellable (a * c)\nhbc : b ≤ c\n⊢ 0 = a * b - a * c" ]
mul_zero,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Order.Antisymmetrization
{ "line": 490, "column": 17 }
{ "line": 490, "column": 32 }
{ "line": 491, "column": 2 }
[ { "pp": "α : Type u_1\nβ : Type u_2\na b c d : α\ninst✝¹ : Preorder α\ninst✝ : Preorder β\n⊢ LeftInverse (uncurry (Quotient.lift₂ (fun a b ↦ ⟦(a, b)⟧) ⋯)) (Quotient.lift (fun ab ↦ (⟦ab.1⟧, ⟦ab.2⟧)) ⋯)", "ppTerm": "?m.112", "assigned": true, "usedConstants": [ "AntisymmRel.setoid", "Prod....
[]
rintro ⟨_⟩; rfl
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Order.Antisymmetrization
{ "line": 490, "column": 17 }
{ "line": 490, "column": 32 }
{ "line": 491, "column": 2 }
[ { "pp": "α : Type u_1\nβ : Type u_2\na b c d : α\ninst✝¹ : Preorder α\ninst✝ : Preorder β\n⊢ LeftInverse (uncurry (Quotient.lift₂ (fun a b ↦ ⟦(a, b)⟧) ⋯)) (Quotient.lift (fun ab ↦ (⟦ab.1⟧, ⟦ab.2⟧)) ⋯)", "ppTerm": "?m.112", "assigned": true, "usedConstants": [ "AntisymmRel.setoid", "Prod....
[]
rintro ⟨_⟩; rfl
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Data.Set.NAry
{ "line": 308, "column": 6 }
{ "line": 308, "column": 28 }
{ "line": 308, "column": 29 }
[ { "pp": "α : Type u_1\nβ : Type u_3\nf : α → β → β\na : α\nh : ∀ (b : β), f a b = b\nt : Set β\n⊢ image2 f {a} t = t", "ppTerm": "?m.10", "assigned": true, "usedConstants": [ "Eq.mpr", "congrArg", "Set.instSingletonSet", "id", "Set.image2_singleton_left", "Set.ima...
[ "α : Type u_1\nβ : Type u_3\nf : α → β → β\na : α\nh : ∀ (b : β), f a b = b\nt : Set β\n⊢ f a '' t = t" ]
image2_singleton_left,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Order.Bounds.Image
{ "line": 360, "column": 4 }
{ "line": 360, "column": 63 }
{ "line": 361, "column": 2 }
[ { "pp": "case refine_1\nα : Type u_1\nβ : Type u_2\ninst✝¹ : Preorder α\ninst✝ : Preorder β\ns : Set (α × β)\np : α × β\nH : IsLUB s p\na : α\nha : a ∈ upperBounds (Prod.fst '' s)\n⊢ (a, p.2) ∈ upperBounds s", "ppTerm": "?refine_1", "assigned": true, "usedConstants": [ "Prod.instLE_mathlib", ...
[]
exact fun q hq => ⟨ha <| mem_image_of_mem _ hq, (H.1 hq).2⟩
Lean.Elab.Tactic.evalExact
Lean.Parser.Tactic.exact
Mathlib.Order.WellFounded
{ "line": 276, "column": 87 }
{ "line": 280, "column": 24 }
{ "line": 282, "column": 0 }
[ { "pp": "β : Type u_2\ninst✝¹ : LinearOrder β\ninst✝ : WellFoundedLT β\nf : β → β\nhf : StrictMono f\n⊢ id ≤ f", "ppTerm": "?m.9", "assigned": true, "usedConstants": [ "Mathlib.Tactic.Push.not_forall_eq", "Eq.mpr", "False", "Preorder.toLT", "congrArg", "Set.ofPred...
[]
by rw [Pi.le_def] by_contra! H obtain ⟨m, hm, hm'⟩ := wellFounded_lt.has_min {i | f i < i} H exact hm' _ (hf hm) hm
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Order.Bounds.Basic
{ "line": 420, "column": 6 }
{ "line": 420, "column": 19 }
{ "line": 420, "column": 20 }
[ { "pp": "γ : Type u_3\ninst✝ : SemilatticeSup γ\ns : Set γ\nx₀ : γ\n⊢ BddAbove s ↔ ∃ x, x₀ ≤ x ∧ ∀ y ∈ s, y ≤ x", "ppTerm": "?m.13", "assigned": true, "usedConstants": [ "Eq.mpr", "congrArg", "PartialOrder.toPreorder", "Preorder.toLE", "Membership.mem", "Exists", ...
[ "γ : Type u_3\ninst✝ : SemilatticeSup γ\ns : Set γ\nx₀ : γ\n⊢ (∃ x, ∀ y ∈ s, y ≤ x) ↔ ∃ x, x₀ ≤ x ∧ ∀ y ∈ s, y ≤ x" ]
bddAbove_def,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Order.Bounds.Basic
{ "line": 782, "column": 27 }
{ "line": 782, "column": 44 }
{ "line": 784, "column": 0 }
[ { "pp": "α : Type u_1\ninst✝ : Preorder α\nd : α\ns : Set α\nh : ¬∃ x, IsLUB s x\n⊢ (if h : ∃ x, IsLUB s x then h.choose else if h : ∃ x, IsLUB ∅ x then h.choose else d) =\n if h : ∃ x, IsLUB ∅ x then h.choose else if h : ∃ x, IsLUB ∅ x then h.choose else d", "ppTerm": "?m.15", "assigned": true, ...
[]
split_ifs <;> rfl
Lean.Parser.Tactic.«_aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tactic_<;>__1»
Lean.Parser.Tactic.«tactic_<;>_»
Mathlib.Data.Set.Lattice.Indexed
{ "line": 259, "column": 2 }
{ "line": 259, "column": 29 }
{ "line": 261, "column": 0 }
[ { "pp": "α : Type u_1\nι : Sort u_4\nκ : ι → Sort u_7\np : α → Prop\nf : (i : ι) → κ i → Set α\n⊢ (∀ x ∈ ⋃ i, ⋃ j, f i j, p x) ↔ ∀ (i : ι) (j : κ i), ∀ x ∈ f i j, p x", "ppTerm": "?m.18", "assigned": true, "usedConstants": [ "congrArg", "_private.Mathlib.Data.Set.Lattice.Indexed.0.Set.fo...
[]
simp_rw [forall_mem_iUnion]
Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1
Mathlib.Tactic.tacticSimp_rw___
Mathlib.Data.Set.Lattice.Indexed
{ "line": 259, "column": 2 }
{ "line": 259, "column": 29 }
{ "line": 261, "column": 0 }
[ { "pp": "α : Type u_1\nι : Sort u_4\nκ : ι → Sort u_7\np : α → Prop\nf : (i : ι) → κ i → Set α\n⊢ (∀ x ∈ ⋃ i, ⋃ j, f i j, p x) ↔ ∀ (i : ι) (j : κ i), ∀ x ∈ f i j, p x", "ppTerm": "?m.18", "assigned": true, "usedConstants": [ "congrArg", "_private.Mathlib.Data.Set.Lattice.Indexed.0.Set.fo...
[]
simp_rw [forall_mem_iUnion]
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Data.Set.Lattice.Indexed
{ "line": 259, "column": 2 }
{ "line": 259, "column": 29 }
{ "line": 261, "column": 0 }
[ { "pp": "α : Type u_1\nι : Sort u_4\nκ : ι → Sort u_7\np : α → Prop\nf : (i : ι) → κ i → Set α\n⊢ (∀ x ∈ ⋃ i, ⋃ j, f i j, p x) ↔ ∀ (i : ι) (j : κ i), ∀ x ∈ f i j, p x", "ppTerm": "?m.18", "assigned": true, "usedConstants": [ "congrArg", "_private.Mathlib.Data.Set.Lattice.Indexed.0.Set.fo...
[]
simp_rw [forall_mem_iUnion]
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Order.ConditionallyCompleteLattice.Basic
{ "line": 320, "column": 6 }
{ "line": 320, "column": 38 }
{ "line": 321, "column": 6 }
[ { "pp": "α : Type u_1\ninst✝ : ConditionallyCompleteLinearOrder α\ns t : Set α\nhs : ∀ x ∈ s, ∃ y ∈ t, x ≤ y\nht : ∀ y ∈ t, ∃ x ∈ s, y ≤ x\ns_ne : s.Nonempty\nt_ne : t.Nonempty\nB : BddAbove s ∨ BddAbove t\nBs : BddAbove s\nBt : BddAbove t\nx : α\nhx : x ∈ s\n⊢ x ≤ sSup t", "ppTerm": "?m.238", "assigned...
[ "α : Type u_1\ninst✝ : ConditionallyCompleteLinearOrder α\ns t : Set α\nhs : ∀ x ∈ s, ∃ y ∈ t, x ≤ y\nht : ∀ y ∈ t, ∃ x ∈ s, y ≤ x\ns_ne : s.Nonempty\nt_ne : t.Nonempty\nB : BddAbove s ∨ BddAbove t\nBs : BddAbove s\nBt : BddAbove t\nx : α\nhx : x ∈ s\ny : α\nyt : y ∈ t\nhxy : x ≤ y\n⊢ x ≤ sSup t" ]
rcases hs x hx with ⟨y, yt, hxy⟩
_private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalRCases
Lean.Parser.Tactic.rcases
Mathlib.Order.CompleteBooleanAlgebra
{ "line": 413, "column": 2 }
{ "line": 413, "column": 26 }
{ "line": 415, "column": 0 }
[ { "pp": "case neg\nα : Type u\ninst✝ : Frame α\nι : Type u_1\nf : ι → α\nh : Pairwise (Disjoint on f)\ns t : Set ι\nx✝¹ : ι × ι\ni j : ι\nx✝ : (i, j) ∈ s ×ˢ t\nhis : (i, j).1 ∈ s\nhjs : (i, j).2 ∈ t\nhij : ¬i = j\n⊢ f (i, j).1 ⊓ f (i, j).2 ≤ ⨆ i ∈ s ∩ t, f i", "ppTerm": "?neg✝", "assigned": true, "u...
[]
· simp [h hij |>.eq_bot]
Lean.Elab.Tactic.evalTacticCDot
Lean.cdot
Mathlib.Order.Preorder.Chain
{ "line": 275, "column": 2 }
{ "line": 275, "column": 55 }
{ "line": 277, "column": 0 }
[ { "pp": "α : Type u_1\nr : α → α → Prop\ns : Set α\nh' : s = ∅\nx : α\nh : ∀ ⦃t : Set α⦄, IsChain r t → ∅ = t\n⊢ False", "ppTerm": "?m.21", "assigned": true, "usedConstants": [ "IsChain.singleton", "Set.instSingletonSet", "Set.instEmptyCollection", "EmptyCollection.emptyColle...
[]
exact singleton_ne_empty x (h IsChain.singleton).symm
Lean.Elab.Tactic.evalExact
Lean.Parser.Tactic.exact
Mathlib.Order.Interval.Set.LinearOrder
{ "line": 105, "column": 2 }
{ "line": 109, "column": 40 }
{ "line": 111, "column": 0 }
[ { "pp": "α : Type u_1\ninst✝ : LinearOrder α\nx : α\n⊢ Ici x = {x} ↔ IsTop x", "ppTerm": "?m.11", "assigned": true, "usedConstants": [ "Set.ext", "Preorder.toLT", "lt_irrefl", "Set.Ici", "congrArg", "PartialOrder.toPreorder", "Preorder.toLE", "Membersh...
[]
refine ⟨fun h y ↦ ?_, fun h ↦ by ext y; simp [(h y).ge_iff_eq]⟩ by_contra! H have : y ∈ Ici x := H.le rw [h, mem_singleton_iff] at this exact lt_irrefl y (this.le.trans_lt H)
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Order.Interval.Set.LinearOrder
{ "line": 105, "column": 2 }
{ "line": 109, "column": 40 }
{ "line": 111, "column": 0 }
[ { "pp": "α : Type u_1\ninst✝ : LinearOrder α\nx : α\n⊢ Ici x = {x} ↔ IsTop x", "ppTerm": "?m.11", "assigned": true, "usedConstants": [ "Set.ext", "Preorder.toLT", "lt_irrefl", "Set.Ici", "congrArg", "PartialOrder.toPreorder", "Preorder.toLE", "Membersh...
[]
refine ⟨fun h y ↦ ?_, fun h ↦ by ext y; simp [(h y).ge_iff_eq]⟩ by_contra! H have : y ∈ Ici x := H.le rw [h, mem_singleton_iff] at this exact lt_irrefl y (this.le.trans_lt H)
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Algebra.Order.Group.Unbundled.Abs
{ "line": 164, "column": 12 }
{ "line": 164, "column": 35 }
{ "line": 164, "column": 35 }
[ { "pp": "α : Type u_1\ninst✝² : Lattice α\ninst✝¹ : CommGroup α\ninst✝ : MulLeftMono α\na b c : α\nthis : DistribLattice α := CommGroup.toDistribLattice α\n⊢ |(a ⊔ c) / (b ⊔ c)|ₘ * |(a ⊓ c) / (b ⊓ c)|ₘ = (b ⊔ c ⊔ (a ⊔ c)) / ((b ⊔ c) ⊓ (a ⊔ c)) * |(a ⊓ c) / (b ⊓ c)|ₘ", "ppTerm": "?m.101", "assigned": tru...
[ "α : Type u_1\ninst✝² : Lattice α\ninst✝¹ : CommGroup α\ninst✝ : MulLeftMono α\na b c : α\nthis : DistribLattice α := CommGroup.toDistribLattice α\n⊢ |(a ⊔ c) / (b ⊔ c)|ₘ * |(a ⊓ c) / (b ⊓ c)|ₘ = |(a ⊔ c) / (b ⊔ c)|ₘ * |(a ⊓ c) / (b ⊓ c)|ₘ" ]
sup_div_inf_eq_mabs_div
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Group.Unbundled.Abs
{ "line": 175, "column": 27 }
{ "line": 175, "column": 50 }
{ "line": 175, "column": 50 }
[ { "pp": "α : Type u_1\ninst✝² : Lattice α\ninst✝¹ : CommGroup α\ninst✝ : MulLeftMono α\na b c : α\nthis : DistribLattice α := CommGroup.toDistribLattice α\n⊢ (b ⊔ a) / (b ⊓ a) = |a / b|ₘ", "ppTerm": "?m.253", "assigned": true, "usedConstants": [ "sup_div_inf_eq_mabs_div", "Eq.mpr", ...
[ "α : Type u_1\ninst✝² : Lattice α\ninst✝¹ : CommGroup α\ninst✝ : MulLeftMono α\na b c : α\nthis : DistribLattice α := CommGroup.toDistribLattice α\n⊢ |a / b|ₘ = |a / b|ₘ" ]
sup_div_inf_eq_mabs_div
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Data.Rat.Defs
{ "line": 130, "column": 2 }
{ "line": 130, "column": 58 }
{ "line": 132, "column": 0 }
[ { "pp": "q r : ℚ\n⊢ q / r = q.num * ↑r.den /. (↑q.den * r.num)", "ppTerm": "?m.14", "assigned": true, "usedConstants": [ "Eq.mpr", "Rat.num", "instHDiv", "HMul.hMul", "congrArg", "Rat.num_divInt_den", "Rat", "Rat.divInt", "Rat.den", "Rat.di...
[]
rw [← divInt_div_divInt, num_divInt_den, num_divInt_den]
Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1
Lean.Parser.Tactic.rwSeq
Mathlib.Data.Rat.Defs
{ "line": 130, "column": 2 }
{ "line": 130, "column": 58 }
{ "line": 132, "column": 0 }
[ { "pp": "q r : ℚ\n⊢ q / r = q.num * ↑r.den /. (↑q.den * r.num)", "ppTerm": "?m.14", "assigned": true, "usedConstants": [ "Eq.mpr", "Rat.num", "instHDiv", "HMul.hMul", "congrArg", "Rat.num_divInt_den", "Rat", "Rat.divInt", "Rat.den", "Rat.di...
[]
rw [← divInt_div_divInt, num_divInt_den, num_divInt_den]
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Data.Rat.Defs
{ "line": 130, "column": 2 }
{ "line": 130, "column": 58 }
{ "line": 132, "column": 0 }
[ { "pp": "q r : ℚ\n⊢ q / r = q.num * ↑r.den /. (↑q.den * r.num)", "ppTerm": "?m.14", "assigned": true, "usedConstants": [ "Eq.mpr", "Rat.num", "instHDiv", "HMul.hMul", "congrArg", "Rat.num_divInt_den", "Rat", "Rat.divInt", "Rat.den", "Rat.di...
[]
rw [← divInt_div_divInt, num_divInt_den, num_divInt_den]
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Data.Rat.Lemmas
{ "line": 129, "column": 2 }
{ "line": 130, "column": 70 }
{ "line": 132, "column": 0 }
[ { "pp": "q₁ q₂ : ℚ\n⊢ q₁.den * q₂.den = (q₁ * q₂).den * (q₁.num * q₂.num).natAbs.gcd (q₁.den * q₂.den)", "ppTerm": "?m.22", "assigned": true, "usedConstants": [ "Nat.gcd", "Eq.mpr", "Rat.instMul", "Rat.num", "Dvd.dvd", "instHDiv", "Nat.dvd_iff_div_mul_eq", ...
[]
rw [mul_den] exact ((Nat.dvd_iff_div_mul_eq _ _).mp (Nat.gcd_dvd_right _ _)).symm
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Data.Rat.Lemmas
{ "line": 129, "column": 2 }
{ "line": 130, "column": 70 }
{ "line": 132, "column": 0 }
[ { "pp": "q₁ q₂ : ℚ\n⊢ q₁.den * q₂.den = (q₁ * q₂).den * (q₁.num * q₂.num).natAbs.gcd (q₁.den * q₂.den)", "ppTerm": "?m.22", "assigned": true, "usedConstants": [ "Nat.gcd", "Eq.mpr", "Rat.instMul", "Rat.num", "Dvd.dvd", "instHDiv", "Nat.dvd_iff_div_mul_eq", ...
[]
rw [mul_den] exact ((Nat.dvd_iff_div_mul_eq _ _).mp (Nat.gcd_dvd_right _ _)).symm
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Data.Rat.Lemmas
{ "line": 234, "column": 2 }
{ "line": 234, "column": 25 }
{ "line": 235, "column": 2 }
[ { "pp": "q : ℚ\n⊢ (-q)⁻¹ = -q⁻¹", "ppTerm": "?m.10", "assigned": true, "usedConstants": [ "Eq.mpr", "Rat.num", "congrArg", "Rat.num_divInt_den", "Rat", "Rat.divInt", "Rat.den", "id", "Int", "Nat.cast", "Inv.inv", "Rat.instInv", ...
[ "q : ℚ\n⊢ (-(q.num /. ↑q.den))⁻¹ = -(q.num /. ↑q.den)⁻¹" ]
rw [← num_divInt_den q]
Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1
Lean.Parser.Tactic.rwSeq
Mathlib.Algebra.Order.Ring.Basic
{ "line": 53, "column": 21 }
{ "line": 53, "column": 29 }
{ "line": 53, "column": 30 }
[ { "pp": "R : Type u_3\ninst✝² : Semiring R\ninst✝¹ : PartialOrder R\ninst✝ : IsOrderedRing R\nx y : R\nhx : 0 ≤ x\nhy : 0 ≤ y\nk : ℕ\nih : k + 1 ≠ 0 → x ^ (k + 1) + y ^ (k + 1) ≤ (x + y) ^ (k + 1)\nhn : k + 1 + 1 ≠ 0\nn : ℕ := k.succ\nh1 : 0 ≤ x * y ^ n + y * x ^ n\nh2 : 0 ≤ x + y\n⊢ x * x ^ n + y * y ^ n + (x ...
[ "R : Type u_3\ninst✝² : Semiring R\ninst✝¹ : PartialOrder R\ninst✝ : IsOrderedRing R\nx y : R\nhx : 0 ≤ x\nhy : 0 ≤ y\nk : ℕ\nih : k + 1 ≠ 0 → x ^ (k + 1) + y ^ (k + 1) ≤ (x + y) ^ (k + 1)\nhn : k + 1 + 1 ≠ 0\nn : ℕ := k.succ\nh1 : 0 ≤ x * y ^ n + y * x ^ n\nh2 : 0 ≤ x + y\n⊢ x * x ^ n + y * y ^ n + (x * y ^ n + y ...
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Basic
{ "line": 53, "column": 30 }
{ "line": 53, "column": 38 }
{ "line": 53, "column": 39 }
[ { "pp": "R : Type u_3\ninst✝² : Semiring R\ninst✝¹ : PartialOrder R\ninst✝ : IsOrderedRing R\nx y : R\nhx : 0 ≤ x\nhy : 0 ≤ y\nk : ℕ\nih : k + 1 ≠ 0 → x ^ (k + 1) + y ^ (k + 1) ≤ (x + y) ^ (k + 1)\nhn : k + 1 + 1 ≠ 0\nn : ℕ := k.succ\nh1 : 0 ≤ x * y ^ n + y * x ^ n\nh2 : 0 ≤ x + y\n⊢ x * x ^ n + y * y ^ n + (x ...
[ "R : Type u_3\ninst✝² : Semiring R\ninst✝¹ : PartialOrder R\ninst✝ : IsOrderedRing R\nx y : R\nhx : 0 ≤ x\nhy : 0 ≤ y\nk : ℕ\nih : k + 1 ≠ 0 → x ^ (k + 1) + y ^ (k + 1) ≤ (x + y) ^ (k + 1)\nhn : k + 1 + 1 ≠ 0\nn : ℕ := k.succ\nh1 : 0 ≤ x * y ^ n + y * x ^ n\nh2 : 0 ≤ x + y\n⊢ x * x ^ n + y * y ^ n + (x * y ^ n + y ...
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Basic
{ "line": 124, "column": 56 }
{ "line": 124, "column": 64 }
{ "line": 124, "column": 65 }
[ { "pp": "R : Type u_3\ninst✝³ : Semiring R\ninst✝² : LinearOrder R\ninst✝¹ : IsStrictOrderedRing R\na b : R\ninst✝ : ExistsAddOfLE R\n⊢ a * (a + b) + b * (a + b) = a * a + b * b + (a * b + b * a)", "ppTerm": "?m.169", "assigned": true, "usedConstants": [ "Distrib.leftDistribClass", "Eq.m...
[ "R : Type u_3\ninst✝³ : Semiring R\ninst✝² : LinearOrder R\ninst✝¹ : IsStrictOrderedRing R\na b : R\ninst✝ : ExistsAddOfLE R\n⊢ a * a + a * b + (b * a + b * b) = a * a + b * b + (a * b + b * a)" ]
mul_add,
Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1
null
Mathlib.Algebra.Order.Ring.Basic
{ "line": 141, "column": 25 }
{ "line": 141, "column": 33 }
{ "line": 141, "column": 34 }
[ { "pp": "R : Type u_3\ninst✝³ : Semiring R\ninst✝² : LinearOrder R\ninst✝¹ : IsStrictOrderedRing R\na b : R\ninst✝ : ExistsAddOfLE R\nha : 0 ≤ a\nhb : 0 ≤ b\nn : ℕ\n⊢ 2 ^ n * ((a ^ (n + 1) + b ^ (n + 1)) * (a + b)) =\n 2 ^ n * (a ^ (n + 2) + b ^ (n + 2) + (a ^ (n + 1) * b + b ^ (n + 1) * a))", "ppTerm": ...
[ "R : Type u_3\ninst✝³ : Semiring R\ninst✝² : LinearOrder R\ninst✝¹ : IsStrictOrderedRing R\na b : R\ninst✝ : ExistsAddOfLE R\nha : 0 ≤ a\nhb : 0 ≤ b\nn : ℕ\n⊢ 2 ^ n * ((a ^ (n + 1) + b ^ (n + 1)) * a + (a ^ (n + 1) + b ^ (n + 1)) * b) =\n 2 ^ n * (a ^ (n + 2) + b ^ (n + 2) + (a ^ (n + 1) * b + b ^ (n + 1) * a))"...
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Basic
{ "line": 157, "column": 39 }
{ "line": 158, "column": 74 }
{ "line": 159, "column": 4 }
[ { "pp": "R : Type u_3\ninst✝³ : Semiring R\ninst✝² : LinearOrder R\ninst✝¹ : IsStrictOrderedRing R\na b : R\ninst✝ : ExistsAddOfLE R\nn : ℕ\n⊢ (2 * (a ^ 2 + b ^ 2)) ^ n = 2 ^ n * (a ^ 2 + b ^ 2) ^ n", "ppTerm": "?m.157", "assigned": true, "usedConstants": [ "Eq.mpr", "NonAssocSemiring.to...
[]
by -- TODO: Should be `Nat.cast_commute` rw [Commute.mul_pow]; simp [Commute, SemiconjBy, two_mul, mul_two]
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Algebra.Order.Ring.Int
{ "line": 93, "column": 36 }
{ "line": 93, "column": 50 }
{ "line": 93, "column": 51 }
[ { "pp": "n p q : ℕ\ndvd : ∃ x y, ↑n = ↑(p + 1) * x + ↑(q + 1) * y\nle : p * q ≤ n\na_n b_n : ℤ\neq : ↑n = ↑(p + 1) * a_n + ↑(q + 1) * b_n\na : ℤ := a_n % ↑q.succ\nb : ℤ := b_n + a_n / ↑q.succ * ↑p.succ\nthis : a * ↑p.succ + b * ↑q.succ = ↑n\nhb : b ≤ -1\nha : a_n % ↑q.succ < ↑(↑q.succ).natAbs\n⊢ ↑q * ↑p.succ + ...
[ "n p q : ℕ\ndvd : ∃ x y, ↑n = ↑(p + 1) * x + ↑(q + 1) * y\nle : p * q ≤ n\na_n b_n : ℤ\neq : ↑n = ↑(p + 1) * a_n + ↑(q + 1) * b_n\na : ℤ := a_n % ↑q.succ\nb : ℤ := b_n + a_n / ↑q.succ * ↑p.succ\nthis : a * ↑p.succ + b * ↑q.succ = ↑n\nhb : b ≤ -1\nha : a_n % ↑q.succ < ↑(↑q.succ).natAbs\n⊢ ↑q * (↑p + 1) + -1 * (↑q + ...
Nat.cast_succ,
Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1
null
Mathlib.Algebra.Order.Ring.Int
{ "line": 93, "column": 51 }
{ "line": 93, "column": 59 }
{ "line": 93, "column": 60 }
[ { "pp": "n p q : ℕ\ndvd : ∃ x y, ↑n = ↑(p + 1) * x + ↑(q + 1) * y\nle : p * q ≤ n\na_n b_n : ℤ\neq : ↑n = ↑(p + 1) * a_n + ↑(q + 1) * b_n\na : ℤ := a_n % ↑q.succ\nb : ℤ := b_n + a_n / ↑q.succ * ↑p.succ\nthis : a * ↑p.succ + b * ↑q.succ = ↑n\nhb : b ≤ -1\nha : a_n % ↑q.succ < ↑(↑q.succ).natAbs\n⊢ ↑q * (↑p + 1) +...
[ "n p q : ℕ\ndvd : ∃ x y, ↑n = ↑(p + 1) * x + ↑(q + 1) * y\nle : p * q ≤ n\na_n b_n : ℤ\neq : ↑n = ↑(p + 1) * a_n + ↑(q + 1) * b_n\na : ℤ := a_n % ↑q.succ\nb : ℤ := b_n + a_n / ↑q.succ * ↑p.succ\nthis : a * ↑p.succ + b * ↑q.succ = ↑n\nhb : b ≤ -1\nha : a_n % ↑q.succ < ↑(↑q.succ).natAbs\n⊢ ↑q * ↑p + ↑q * 1 + (-1 * ↑q...
mul_add,
Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1
null
Mathlib.Data.Nat.Factorial.Basic
{ "line": 475, "column": 22 }
{ "line": 477, "column": 96 }
{ "line": 479, "column": 0 }
[ { "pp": "n : ℕ\nhn : n ≠ 0\nk : ℕ\nx✝ : 2 ≤ k + 2\n⊢ n.descFactorial (k + 2) < n ^ (k + 2)", "ppTerm": "?m.29", "assigned": true, "usedConstants": [ "Nat.pow_succ'", "instPowNat", "Eq.mpr", "HMul.hMul", "congrArg", "HSub.hSub", "id", "Nat.mul_lt_mul_of...
[]
by rw [descFactorial_succ, pow_succ', Nat.mul_comm, Nat.mul_comm n] exact Nat.mul_lt_mul_of_le_of_lt (descFactorial_le_pow _ _) (by lia) (Nat.pow_pos <| by lia)
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Data.Int.GCD
{ "line": 255, "column": 4 }
{ "line": 255, "column": 52 }
{ "line": 257, "column": 0 }
[ { "pp": "case right\na b : ℤ\nha : a ≠ 0\n⊢ ∀ ⦃a_1 : ℕ⦄, 0 < a_1 → a.gcd b ∣ a_1 → a.gcd b ≤ a_1", "ppTerm": "?right", "assigned": true, "usedConstants": [ "Int.gcd", "Dvd.dvd", "instOfNatNat", "Nat.instDvd", "Nat", "LT.lt", "instLTNat", "OfNat.ofNat",...
[]
exact fun n hn_pos hn => Nat.le_of_dvd hn_pos hn
Lean.Elab.Tactic.evalExact
Lean.Parser.Tactic.exact
Mathlib.Data.Rat.Cast.Lemmas
{ "line": 88, "column": 2 }
{ "line": 88, "column": 87 }
{ "line": 89, "column": 2 }
[ { "pp": "K : Type u_1\ninst✝ : DivisionRing K\nq : ℚ\nh : 0 ≤ q\n⊢ ↑⟨q, h⟩ = ↑q", "ppTerm": "?m.11", "assigned": true, "usedConstants": [ "Rat.instOfNat", "Int.cast", "Eq.mpr", "NonAssocSemiring.toAddCommMonoidWithOne", "Rat.num", "instHDiv", "GroupWithZero....
[ "K : Type u_1\ninst✝ : DivisionRing K\nq : ℚ\nh : 0 ≤ q\n⊢ ↑|q.num| / ↑q.den = ↑q.num / ↑q.den" ]
simp only [NNRat.cast_def, NNRat.num_mk, Nat.cast_natAbs, NNRat.den_mk, Rat.cast_def]
Lean.Elab.Tactic.evalSimp
Lean.Parser.Tactic.simp
Mathlib.Algebra.Order.Ring.Abs
{ "line": 179, "column": 24 }
{ "line": 179, "column": 38 }
{ "line": 179, "column": 39 }
[ { "pp": "case succ\nα : Type u_1\ninst✝² : CommRing α\ninst✝¹ : LinearOrder α\na b : α\nn✝ : ℕ\ninst✝ : IsOrderedRing α\nn : ℕ\nih : |geomSum a b n| ≤ (↑n + 1) * max |a| |b| ^ n\n⊢ |a| * |geomSum a b n| + |b| ^ (n + 1) ≤ (↑(n + 1) + 1) * max |a| |b| ^ (n + 1)", "ppTerm": "?succ", "assigned": true, "...
[ "case succ\nα : Type u_1\ninst✝² : CommRing α\ninst✝¹ : LinearOrder α\na b : α\nn✝ : ℕ\ninst✝ : IsOrderedRing α\nn : ℕ\nih : |geomSum a b n| ≤ (↑n + 1) * max |a| |b| ^ n\n⊢ |a| * |geomSum a b n| + |b| ^ (n + 1) ≤ (↑n + 1 + 1) * max |a| |b| ^ (n + 1)" ]
Nat.cast_succ,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Ring.Abs
{ "line": 189, "column": 15 }
{ "line": 189, "column": 23 }
{ "line": 189, "column": 24 }
[ { "pp": "case succ\nα : Type u_1\ninst✝ : CommRing α\na b : α\nn✝ n : ℕ\nih : a ^ (n + 1) - b ^ (n + 1) = (a - b) * geomSum a b n\n⊢ a ^ (n + 1 + 1) - b ^ (n + 1 + 1) = (a - b) * (a * geomSum a b n + b ^ (n + 1))", "ppTerm": "?succ", "assigned": true, "usedConstants": [ "Distrib.leftDistribCla...
[ "case succ\nα : Type u_1\ninst✝ : CommRing α\na b : α\nn✝ n : ℕ\nih : a ^ (n + 1) - b ^ (n + 1) = (a - b) * geomSum a b n\n⊢ a ^ (n + 1 + 1) - b ^ (n + 1 + 1) = (a - b) * (a * geomSum a b n) + (a - b) * b ^ (n + 1)" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Field.Basic
{ "line": 123, "column": 48 }
{ "line": 124, "column": 65 }
{ "line": 126, "column": 0 }
[ { "pp": "α : Type u_1\ninst✝³ : Semifield α\ninst✝² : PartialOrder α\ninst✝¹ : PosMulReflectLT α\na : α\ninst✝ : IsStrictOrderedRing α\n⊢ a / 2 < a ↔ 0 < a", "ppTerm": "?m.18", "assigned": true, "usedConstants": [ "IsRightCancelAdd.addRightStrictMono_of_addRightMono", "Eq.mpr", "Gr...
[]
by rw [div_lt_iff₀ (zero_lt_two' α), mul_two, lt_add_iff_pos_left]
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Algebra.Order.Field.Basic
{ "line": 705, "column": 33 }
{ "line": 705, "column": 41 }
{ "line": 705, "column": 42 }
[ { "pp": "α : Type u_1\ninst✝² : Field α\ninst✝¹ : LinearOrder α\ninst✝ : IsStrictOrderedRing α\na b ε : α\nhε : 0 < ε\nh : 2 * (ε * a) * b ≤ (ε * a) ^ 2 + b ^ 2\n⊢ ε⁻¹ * (ε ^ 2 * a ^ 2 + b ^ 2) = ε * a ^ 2 + ε⁻¹ * b ^ 2", "ppTerm": "?m.309", "assigned": true, "usedConstants": [ "NonUnitalNonAs...
[ "α : Type u_1\ninst✝² : Field α\ninst✝¹ : LinearOrder α\ninst✝ : IsStrictOrderedRing α\na b ε : α\nhε : 0 < ε\nh : 2 * (ε * a) * b ≤ (ε * a) ^ 2 + b ^ 2\n⊢ ε⁻¹ * (ε ^ 2 * a ^ 2) + ε⁻¹ * b ^ 2 = ε * a ^ 2 + ε⁻¹ * b ^ 2" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.BigOperators.Group.List.Defs
{ "line": 58, "column": 4 }
{ "line": 60, "column": 38 }
{ "line": 62, "column": 0 }
[ { "pp": "case cons\nM : Type u_2\ninst✝¹ : Mul M\ninst✝ : One M\nl✝ : List M\np : M → Prop\nhom : ∀ (a b : M), p a → p b → p (a * b)\nunit : p 1\na : M\nl : List M\nih : (∀ (x : M), x ∈ l → p x) → p l.prod\nbase : ∀ (x : M), x ∈ a :: l → p x\n⊢ p (a :: l).prod", "ppTerm": "?cons", "assigned": true, ...
[]
rw [List.prod_cons] simp only [mem_cons, forall_eq_or_imp] at base exact hom _ _ (base.1) (ih base.2)
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Algebra.BigOperators.Group.List.Defs
{ "line": 58, "column": 4 }
{ "line": 60, "column": 38 }
{ "line": 62, "column": 0 }
[ { "pp": "case cons\nM : Type u_2\ninst✝¹ : Mul M\ninst✝ : One M\nl✝ : List M\np : M → Prop\nhom : ∀ (a b : M), p a → p b → p (a * b)\nunit : p 1\na : M\nl : List M\nih : (∀ (x : M), x ∈ l → p x) → p l.prod\nbase : ∀ (x : M), x ∈ a :: l → p x\n⊢ p (a :: l).prod", "ppTerm": "?cons", "assigned": true, ...
[]
rw [List.prod_cons] simp only [mem_cons, forall_eq_or_imp] at base exact hom _ _ (base.1) (ih base.2)
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Tactic.FieldSimp.Lemmas
{ "line": 82, "column": 66 }
{ "line": 86, "column": 9 }
{ "line": 88, "column": 0 }
[ { "pp": "α : Type u_1\ninst✝ : GroupWithZero α\na : α\nn : ℤ\n⊢ zpow' a (-n) = (zpow' a n)⁻¹", "ppTerm": "?m.10", "assigned": true, "usedConstants": [ "Int.instAddCommGroup", "Eq.mpr", "inv_eq_zero._simp_1", "GroupWithZero.toMonoidWithZero", "MulOne.toOne", "False...
[]
by simp +contextual [zpow', apply_ite] split_ifs with h · tauto · tauto
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Algebra.BigOperators.Group.List.Basic
{ "line": 270, "column": 2 }
{ "line": 270, "column": 64 }
{ "line": 271, "column": 2 }
[ { "pp": "M : Type u_4\ninst✝ : CommMonoid M\nl l' : List M\nh : l.length = l'.length\n⊢ l.prod * l'.prod = (zipWith (fun x1 x2 ↦ x1 * x2) l l').prod", "ppTerm": "?m.30", "assigned": true, "usedConstants": [ "MulOne.toOne", "List.zipWith", "HMul.hMul", "Monoid.toMulOneClass", ...
[ "M : Type u_4\ninst✝ : CommMonoid M\nl l' : List M\nh : l.length = l'.length\n⊢ (zipWith (fun x1 x2 ↦ x1 * x2) l l').prod * (drop l'.length l).prod * (drop l.length l').prod =\n (zipWith (fun x1 x2 ↦ x1 * x2) l l').prod" ]
apply (prod_mul_prod_eq_prod_zipWith_mul_prod_drop l l').trans
Lean.Elab.Tactic.evalApply
Lean.Parser.Tactic.apply
Mathlib.Data.List.Basic
{ "line": 864, "column": 2 }
{ "line": 864, "column": 33 }
{ "line": 865, "column": 2 }
[ { "pp": "α : Type u\nl : List (α → α)\nf : α → α\nhl : ∀ (f : α → α), f ∈ l → Injective f\nhf : Injective f\n⊢ Injective (foldl comp f l)", "ppTerm": "?m.14", "assigned": true, "usedConstants": [ "List.mem_cons_of_mem", "Function.comp", "Membership.mem", "List.rec", "Li...
[]
induction l generalizing f with
_private.Lean.Elab.Tactic.Induction.0.Lean.Elab.Tactic.evalInduction
null
Mathlib.Tactic.CancelDenoms.Core
{ "line": 66, "column": 78 }
{ "line": 67, "column": 37 }
{ "line": 69, "column": 0 }
[ { "pp": "α : Type u_1\ninst✝ : CommRing α\nn e1 t1 k l : α\ne2 : ℕ\nh1 : n * e1 = t1\nh2 : l * n ^ e2 = k\n⊢ k * e1 ^ e2 = l * t1 ^ e2", "ppTerm": "?m.33", "assigned": true, "usedConstants": [ "Eq.mpr", "Semigroup.toMul", "HMul.hMul", "CommRing.toNonUnitalCommRing", "Mo...
[]
by rw [← h2, ← h1, mul_pow, mul_assoc]
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Algebra.Order.Round
{ "line": 73, "column": 85 }
{ "line": 73, "column": 93 }
{ "line": 74, "column": 4 }
[ { "pp": "α : Type u_2\ninst✝³ : Ring α\ninst✝² : LinearOrder α\ninst✝¹ : FloorRing α\ninst✝ : IsStrictOrderedRing α\nx : α\n⊢ (if 2 * fract x < 1 then ⌊x⌋ + ⌊fract x⌋ else ⌈↑⌊x⌋ + fract x⌉) = (⌊2 * (↑⌊x⌋ + fract x)⌋ + 1) / 2", "ppTerm": "?m.66", "assigned": true, "usedConstants": [ "Distrib.le...
[ "α : Type u_2\ninst✝³ : Ring α\ninst✝² : LinearOrder α\ninst✝¹ : FloorRing α\ninst✝ : IsStrictOrderedRing α\nx : α\n⊢ (if 2 * fract x < 1 then ⌊x⌋ + ⌊fract x⌋ else ⌈↑⌊x⌋ + fract x⌉) = (⌊2 * ↑⌊x⌋ + 2 * fract x⌋ + 1) / 2" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Data.PNat.Basic
{ "line": 39, "column": 2 }
{ "line": 39, "column": 71 }
{ "line": 41, "column": 0 }
[ { "pp": "n : ℕ+\n⊢ 1 + n.natPred = ↑n", "ppTerm": "?m.8", "assigned": true, "usedConstants": [ "PNat.val", "Iff.mpr", "Eq.mpr", "Nat.instCanonicallyOrderedAdd", "Nat.instOrderedSub", "PNat.natPred.eq_1", "add_tsub_cancel_iff_le", "congrArg", "Par...
[]
rw [natPred, add_tsub_cancel_iff_le.mpr <| show 1 ≤ (n : ℕ) from n.2]
Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1
Lean.Parser.Tactic.rwSeq
Mathlib.Data.PNat.Basic
{ "line": 39, "column": 2 }
{ "line": 39, "column": 71 }
{ "line": 41, "column": 0 }
[ { "pp": "n : ℕ+\n⊢ 1 + n.natPred = ↑n", "ppTerm": "?m.8", "assigned": true, "usedConstants": [ "PNat.val", "Iff.mpr", "Eq.mpr", "Nat.instCanonicallyOrderedAdd", "Nat.instOrderedSub", "PNat.natPred.eq_1", "add_tsub_cancel_iff_le", "congrArg", "Par...
[]
rw [natPred, add_tsub_cancel_iff_le.mpr <| show 1 ≤ (n : ℕ) from n.2]
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Data.PNat.Basic
{ "line": 39, "column": 2 }
{ "line": 39, "column": 71 }
{ "line": 41, "column": 0 }
[ { "pp": "n : ℕ+\n⊢ 1 + n.natPred = ↑n", "ppTerm": "?m.8", "assigned": true, "usedConstants": [ "PNat.val", "Iff.mpr", "Eq.mpr", "Nat.instCanonicallyOrderedAdd", "Nat.instOrderedSub", "PNat.natPred.eq_1", "add_tsub_cancel_iff_le", "congrArg", "Par...
[]
rw [natPred, add_tsub_cancel_iff_le.mpr <| show 1 ≤ (n : ℕ) from n.2]
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Data.PNat.Basic
{ "line": 294, "column": 16 }
{ "line": 294, "column": 25 }
{ "line": 294, "column": 26 }
[ { "pp": "m k : ℕ+\nh₀ : 0 + ↑k * 0 = ↑m\nhr : ↑m % ↑k = 0\nhq : ↑m / ↑k = 0\n⊢ False", "ppTerm": "?m.53", "assigned": true, "usedConstants": [ "PNat.val", "Nat.instMulZeroClass", "instHDiv", "HMul.hMul", "MulZeroClass.toMul", "congrArg", "Eq.mp", "HDiv...
[ "m k : ℕ+\nh₀ : 0 + 0 = ↑m\nhr : ↑m % ↑k = 0\nhq : ↑m / ↑k = 0\n⊢ False" ]
mul_zero,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Floor.Ring
{ "line": 373, "column": 22 }
{ "line": 373, "column": 30 }
{ "line": 373, "column": 31 }
[ { "pp": "case succ\nR : Type u_2\ninst✝² : Ring R\ninst✝¹ : LinearOrder R\ninst✝ : FloorRing R\na : R\nc : ℕ\nz : ℤ\nhz : fract a * ↑c - fract (a * ↑c) = ↑z\n⊢ ∃ z, fract a * (↑c + ↑1) - fract (a * (↑c + ↑1)) = ↑z", "ppTerm": "?succ", "assigned": true, "usedConstants": [ "Distrib.leftDistribCl...
[ "case succ\nR : Type u_2\ninst✝² : Ring R\ninst✝¹ : LinearOrder R\ninst✝ : FloorRing R\na : R\nc : ℕ\nz : ℤ\nhz : fract a * ↑c - fract (a * ↑c) = ↑z\n⊢ ∃ z, fract a * ↑c + fract a * ↑1 - fract (a * (↑c + ↑1)) = ↑z" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Floor.Ring
{ "line": 373, "column": 31 }
{ "line": 373, "column": 39 }
{ "line": 373, "column": 40 }
[ { "pp": "case succ\nR : Type u_2\ninst✝² : Ring R\ninst✝¹ : LinearOrder R\ninst✝ : FloorRing R\na : R\nc : ℕ\nz : ℤ\nhz : fract a * ↑c - fract (a * ↑c) = ↑z\n⊢ ∃ z, fract a * ↑c + fract a * ↑1 - fract (a * (↑c + ↑1)) = ↑z", "ppTerm": "?succ", "assigned": true, "usedConstants": [ "Distrib.leftD...
[ "case succ\nR : Type u_2\ninst✝² : Ring R\ninst✝¹ : LinearOrder R\ninst✝ : FloorRing R\na : R\nc : ℕ\nz : ℤ\nhz : fract a * ↑c - fract (a * ↑c) = ↑z\n⊢ ∃ z, fract a * ↑c + fract a * ↑1 - fract (a * ↑c + a * ↑1) = ↑z" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Floor.Ring
{ "line": 608, "column": 81 }
{ "line": 608, "column": 89 }
{ "line": 609, "column": 6 }
[ { "pp": "case inr.refine_3\nk : Type u_4\ninst✝³ : Field k\ninst✝² : LinearOrder k\ninst✝¹ : IsOrderedRing k\ninst✝ : FloorRing k\nm n : ℕ\nhn : n > 0\nhn' : 0 < ↑n\n⊢ ↑m = ↑n * (↑(m % n) / ↑n + ↑(↑m / ↑n))", "ppTerm": "?inr.refine_3", "assigned": true, "usedConstants": [ "Distrib.leftDistribC...
[ "case inr.refine_3\nk : Type u_4\ninst✝³ : Field k\ninst✝² : LinearOrder k\ninst✝¹ : IsOrderedRing k\ninst✝ : FloorRing k\nm n : ℕ\nhn : n > 0\nhn' : 0 < ↑n\n⊢ ↑m = ↑n * (↑(m % n) / ↑n) + ↑n * ↑(↑m / ↑n)" ]
mul_add,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Order.Floor.Ring
{ "line": 723, "column": 2 }
{ "line": 723, "column": 52 }
{ "line": 725, "column": 0 }
[ { "pp": "R : Type u_2\ninst✝² : Ring R\ninst✝¹ : LinearOrder R\ninst✝ : FloorRing R\na : R\nha : a ∉ range Int.cast\n⊢ fract a = a + 1 - ↑⌈a⌉", "ppTerm": "?m.49", "assigned": true, "usedConstants": [ "Iff.mpr", "Int.cast", "AddMonoid.toAddSemigroup", "Int.floor", "AddGr...
[]
simp [(ceil_eq_floor_add_one_iff_notMem a).mpr ha]
Lean.Elab.Tactic.evalSimp
Lean.Parser.Tactic.simp
Mathlib.Algebra.Order.Floor.Ring
{ "line": 742, "column": 64 }
{ "line": 743, "column": 81 }
{ "line": 745, "column": 0 }
[ { "pp": "R : Type u_2\ninst✝³ : Ring R\ninst✝² : LinearOrder R\ninst✝¹ : FloorRing R\ninst✝ : IsOrderedAddMonoid R\na : R\nz : ℤ\n⊢ ⌈a + ↑z⌉ = ⌈a⌉ + z", "ppTerm": "?m.22", "assigned": true, "usedConstants": [ "Int.instAddCommGroup", "Int.cast", "Eq.mpr", "NegZeroClass.toNeg",...
[]
by rw [← neg_inj, neg_add', ← floor_neg, ← floor_neg, neg_add', floor_sub_intCast]
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Algebra.Order.Floor.Ring
{ "line": 819, "column": 6 }
{ "line": 820, "column": 28 }
{ "line": 822, "column": 0 }
[ { "pp": "k : Type u_4\ninst✝³ : Field k\ninst✝² : LinearOrder k\ninst✝¹ : IsOrderedRing k\ninst✝ : FloorRing k\na b : k\nhb₀ : 0 < b\nhb : b < 1\nhba : ↑⌈b / (1 - b)⌉ ≤ a\n⊢ b * (↑⌊a⌋ + 1) ≤ ↑⌊a⌋", "ppTerm": "?m.71", "assigned": true, "usedConstants": [ "Distrib.leftDistribClass", "Int.c...
[]
rwa [_root_.mul_add_one, ← le_sub_iff_add_le', ← one_sub_mul, ← div_le_iff₀' (by linarith), ← ceil_le, le_floor]
Lean.Elab.Tactic.evalRwa
Lean.Parser.Tactic.rwa
Mathlib.Algebra.Order.Floor.Ring
{ "line": 819, "column": 6 }
{ "line": 820, "column": 28 }
{ "line": 822, "column": 0 }
[ { "pp": "k : Type u_4\ninst✝³ : Field k\ninst✝² : LinearOrder k\ninst✝¹ : IsOrderedRing k\ninst✝ : FloorRing k\na b : k\nhb₀ : 0 < b\nhb : b < 1\nhba : ↑⌈b / (1 - b)⌉ ≤ a\n⊢ b * (↑⌊a⌋ + 1) ≤ ↑⌊a⌋", "ppTerm": "?m.71", "assigned": true, "usedConstants": [ "Distrib.leftDistribClass", "Int.c...
[]
rwa [_root_.mul_add_one, ← le_sub_iff_add_le', ← one_sub_mul, ← div_le_iff₀' (by linarith), ← ceil_le, le_floor]
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Algebra.Order.Floor.Ring
{ "line": 819, "column": 6 }
{ "line": 820, "column": 28 }
{ "line": 822, "column": 0 }
[ { "pp": "k : Type u_4\ninst✝³ : Field k\ninst✝² : LinearOrder k\ninst✝¹ : IsOrderedRing k\ninst✝ : FloorRing k\na b : k\nhb₀ : 0 < b\nhb : b < 1\nhba : ↑⌈b / (1 - b)⌉ ≤ a\n⊢ b * (↑⌊a⌋ + 1) ≤ ↑⌊a⌋", "ppTerm": "?m.71", "assigned": true, "usedConstants": [ "Distrib.leftDistribClass", "Int.c...
[]
rwa [_root_.mul_add_one, ← le_sub_iff_add_le', ← one_sub_mul, ← div_le_iff₀' (by linarith), ← ceil_le, le_floor]
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Algebra.Order.Archimedean.Basic
{ "line": 400, "column": 45 }
{ "line": 400, "column": 59 }
{ "line": 400, "column": 60 }
[ { "pp": "K : Type u_4\ninst✝³ : Field K\ninst✝² : LinearOrder K\ninst✝¹ : IsStrictOrderedRing K\ninst✝ : Archimedean K\nn : ℕ\nhn : n ≠ 0\nx y : K\nh : x < y\nhy : 0 < y\nδ : K\nδ_pos : δ > 0\ncont : ∀ (q r : K), |r| ≤ max 1 y → |q - r| ≤ δ → |q ^ n - r ^ n| < y - max x 0\nex : ∃ m, y ≤ (↑m * δ) ^ n\nm : ℕ := N...
[ "K : Type u_4\ninst✝³ : Field K\ninst✝² : LinearOrder K\ninst✝¹ : IsStrictOrderedRing K\ninst✝ : Archimedean K\nn : ℕ\nhn : n ≠ 0\nx y : K\nh : x < y\nhy : 0 < y\nδ : K\nδ_pos : δ > 0\ncont : ∀ (q r : K), |r| ≤ max 1 y → |q - r| ≤ δ → |q ^ n - r ^ n| < y - max x 0\nex : ∃ m, y ≤ (↑m * δ) ^ n\nm : ℕ := Nat.find ex\n...
Nat.cast_succ,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Data.Multiset.AddSub
{ "line": 186, "column": 2 }
{ "line": 186, "column": 39 }
{ "line": 187, "column": 2 }
[ { "pp": "α : Type u_1\ninst✝ : DecidableEq α\ns t : Multiset α\na : α\n⊢ s + {a} = t ↔ a ∈ t ∧ s = t.erase a", "ppTerm": "?m.17", "assigned": true, "usedConstants": [ "Eq.mpr", "Multiset.singleton_add", "congrArg", "Multiset.add_comm", "Membership.mem", "Multiset"...
[ "α : Type u_1\ninst✝ : DecidableEq α\ns t : Multiset α\na : α\n⊢ a ::ₘ s = t ↔ a ∈ t ∧ s = t.erase a" ]
rw [Multiset.add_comm, singleton_add]
Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1
Lean.Parser.Tactic.rwSeq
Mathlib.Data.List.Nodup
{ "line": 118, "column": 4 }
{ "line": 118, "column": 47 }
{ "line": 119, "column": 4 }
[ { "pp": "case pos\nα : Type u\nx hd : α\ntl : List α\nhl : tl ≠ [x] ↔ tl = [] ∨ ∃ y, y ∈ tl ∧ y ≠ x\nh : (hd :: tl).Nodup\nhx : tl = [x]\n⊢ hd :: tl ≠ [x] ↔ hd :: tl = [] ∨ ∃ y, y ∈ hd :: tl ∧ y ≠ x", "ppTerm": "?pos✝", "assigned": true, "usedConstants": [ "_private.Mathlib.Data.List.Nodup.0.L...
[ "case neg\nα : Type u\nx hd : α\ntl : List α\nhl : tl ≠ [x] ↔ tl = [] ∨ ∃ y, y ∈ tl ∧ y ≠ x\nh : (hd :: tl).Nodup\nhx : ¬tl = [x]\n⊢ hd :: tl ≠ [x] ↔ hd :: tl = [] ∨ ∃ y, y ∈ hd :: tl ∧ y ≠ x" ]
· simpa [hx, and_comm, and_or_left] using h
Lean.Elab.Tactic.evalTacticCDot
Lean.cdot
Mathlib.Data.List.Nodup
{ "line": 264, "column": 8 }
{ "line": 265, "column": 39 }
{ "line": 266, "column": 8 }
[ { "pp": "case neg\nα : Type u\na : α\nl : List α\nih : l[0]? = l.getLast? → (l.dropLast.Nodup ↔ l.tail.Nodup)\nhl : ¬l = []\nh : a = l[l.length - 1]\n⊢ (l[l.length - 1] :: l.dropLast).Nodup ↔ l.Nodup", "ppTerm": "?neg✝", "assigned": true, "usedConstants": [ "List.getLast", "Nat.succ_lt_s...
[ "case neg\nα : Type u\na : α\nl : List α\nih : l[0]? = l.getLast? → (l.dropLast.Nodup ↔ l.tail.Nodup)\nhl : ¬l = []\nh : a = l[l.length - 1]\n⊢ (l[l.length - 1] :: l.dropLast).Nodup ↔ (l.dropLast ++ [l.getLast hl]).Nodup" ]
show l.Nodup = (l.dropLast ++ [l.getLast hl]).Nodup by simp [List.dropLast_eq_take],
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Algebra.Group.Pointwise.Set.Basic
{ "line": 881, "column": 61 }
{ "line": 882, "column": 75 }
{ "line": 884, "column": 0 }
[ { "pp": "α : Type u_2\ninst✝ : Group α\ns t : Set α\n⊢ 1 ∈ s / t ↔ ¬Disjoint s t", "ppTerm": "?m.13", "assigned": true, "usedConstants": [ "instHDiv", "InvOneClass.toOne", "DivInvOneMonoid.toInvOneClass", "_private.Mathlib.Algebra.Group.Pointwise.Set.Basic.0.Set.one_mem_div_i...
[]
by simp [not_disjoint_iff_nonempty_inter, mem_div, div_eq_one, Set.Nonempty]
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Algebra.Group.Pointwise.Set.Basic
{ "line": 1039, "column": 2 }
{ "line": 1042, "column": 27 }
{ "line": 1044, "column": 0 }
[ { "pp": "F : Type u_1\nα : Type u_2\nβ : Type u_3\ninst✝³ : Group α\ninst✝² : DivisionMonoid β\ninst✝¹ : FunLike F α β\ninst✝ : MonoidHomClass F α β\nm : F\ns t : Set β\nhs : s ⊆ range ⇑m\nht : t ⊆ range ⇑m\n⊢ s / t ⊆ range ⇑m", "ppTerm": "?m.23", "assigned": true, "usedConstants": [ "instHDiv...
[]
rintro _ ⟨a, ha, b, hb, rfl⟩ obtain ⟨a, rfl⟩ := hs ha obtain ⟨b, rfl⟩ := ht hb exact ⟨a / b, map_div ..⟩
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Algebra.Group.Pointwise.Set.Basic
{ "line": 1039, "column": 2 }
{ "line": 1042, "column": 27 }
{ "line": 1044, "column": 0 }
[ { "pp": "F : Type u_1\nα : Type u_2\nβ : Type u_3\ninst✝³ : Group α\ninst✝² : DivisionMonoid β\ninst✝¹ : FunLike F α β\ninst✝ : MonoidHomClass F α β\nm : F\ns t : Set β\nhs : s ⊆ range ⇑m\nht : t ⊆ range ⇑m\n⊢ s / t ⊆ range ⇑m", "ppTerm": "?m.23", "assigned": true, "usedConstants": [ "instHDiv...
[]
rintro _ ⟨a, ha, b, hb, rfl⟩ obtain ⟨a, rfl⟩ := hs ha obtain ⟨b, rfl⟩ := ht hb exact ⟨a / b, map_div ..⟩
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq
Mathlib.Data.List.Dedup
{ "line": 134, "column": 2 }
{ "line": 134, "column": 29 }
{ "line": 135, "column": 2 }
[ { "pp": "case cons\nα : Type u_1\ninst✝ : DecidableEq α\nl₂ : List α\na : α\nl₁ : List α\nIH : (l₁ ++ l₂).dedup = l₁ ∪ l₂.dedup\n⊢ (a :: l₁ ++ l₂).dedup = a :: l₁ ∪ l₂.dedup", "ppTerm": "?cons", "assigned": true, "usedConstants": [ "Eq.mpr", "congrArg", "List.cons_union", "Li...
[ "case cons\nα : Type u_1\ninst✝ : DecidableEq α\nl₂ : List α\na : α\nl₁ : List α\nIH : (l₁ ++ l₂).dedup = l₁ ∪ l₂.dedup\n⊢ (a :: l₁ ++ l₂).dedup = List.insert a (l₁ ∪ l₂.dedup)" ]
simp only [cons_union] at *
Lean.Elab.Tactic.evalSimp
Lean.Parser.Tactic.simp
Mathlib.Data.List.Dedup
{ "line": 137, "column": 8 }
{ "line": 137, "column": 29 }
{ "line": 137, "column": 30 }
[ { "pp": "case pos\nα : Type u_1\ninst✝ : DecidableEq α\nl₂ : List α\na : α\nl₁ : List α\nIH : (l₁ ++ l₂).dedup = l₁ ∪ l₂.dedup\nh : a ∈ (l₁ ++ l₂).dedup\n⊢ (a :: (l₁ ++ l₂)).dedup = List.insert a (l₁ ++ l₂).dedup", "ppTerm": "?pos✝", "assigned": true, "usedConstants": [ "Eq.mpr", "List.d...
[ "case pos\nα : Type u_1\ninst✝ : DecidableEq α\nl₂ : List α\na : α\nl₁ : List α\nIH : (l₁ ++ l₂).dedup = l₁ ∪ l₂.dedup\nh : a ∈ (l₁ ++ l₂).dedup\n⊢ (l₁ ++ l₂).dedup = List.insert a (l₁ ++ l₂).dedup" ]
dedup_cons_of_mem' h,
Lean.Elab.Tactic.evalRewriteSeq
null
Mathlib.Data.List.Lattice
{ "line": 272, "column": 44 }
{ "line": 272, "column": 68 }
{ "line": 272, "column": 68 }
[ { "pp": "α : Type u_1\ninst✝ : DecidableEq α\nhead✝ : α\ntail✝ : List α\nih : ∀ {l₂ : List α}, tail✝.bagInter l₂ <+ tail✝ ∩ l₂\nl₂ : List α\nh✝ : head✝ ∈ l₂\n⊢ l₂.erase head✝ <+ l₂", "ppTerm": "?m.59", "assigned": true, "usedConstants": [ "_private.Mathlib.Data.List.Lattice.0.List.Sublist.bagI...
[]
by grind [erase_sublist]
[anonymous]
Lean.Parser.Term.byTactic
Mathlib.Data.Finset.Lattice.Lemmas
{ "line": 114, "column": 4 }
{ "line": 115, "column": 56 }
{ "line": 117, "column": 0 }
[ { "pp": "α : Type u_1\ninst✝ : DecidableEq α\ns₁ s₂ : Finset α\na : α\nh : a ∈ s₂\nx : α\n⊢ x ∈ insert a s₁ ∩ s₂ ↔ x ∈ insert a (s₁ ∩ s₂)", "ppTerm": "?m.19", "assigned": true, "usedConstants": [ "congrArg", "Finset", "Membership.mem", "Insert.insert", "_private.Mathlib...
[]
have : x = a ∨ x ∈ s₂ ↔ x ∈ s₂ := or_iff_right_of_imp <| by rintro rfl; exact h simp only [mem_inter, mem_insert, or_and_left, this]
Lean.Elab.Tactic.evalTacticSeq1Indented
Lean.Parser.Tactic.tacticSeq1Indented
Mathlib.Data.Finset.Lattice.Lemmas
{ "line": 114, "column": 4 }
{ "line": 115, "column": 56 }
{ "line": 117, "column": 0 }
[ { "pp": "α : Type u_1\ninst✝ : DecidableEq α\ns₁ s₂ : Finset α\na : α\nh : a ∈ s₂\nx : α\n⊢ x ∈ insert a s₁ ∩ s₂ ↔ x ∈ insert a (s₁ ∩ s₂)", "ppTerm": "?m.19", "assigned": true, "usedConstants": [ "congrArg", "Finset", "Membership.mem", "Insert.insert", "_private.Mathlib...
[]
have : x = a ∨ x ∈ s₂ ↔ x ∈ s₂ := or_iff_right_of_imp <| by rintro rfl; exact h simp only [mem_inter, mem_insert, or_and_left, this]
Lean.Elab.Tactic.evalTacticSeq
Lean.Parser.Tactic.tacticSeq