module stringlengths 16 90 | startPos dict | endPos dict | goals listlengths 0 96 | ppTac stringlengths 1 14.5k | elaborator stringclasses 366
values | kind stringclasses 370
values |
|---|---|---|---|---|---|---|
Mathlib.MeasureTheory.Measure.SeparableMeasure | {
"line": 278,
"column": 6
} | {
"line": 278,
"column": 17
} | [
{
"pp": "X : Type u_1\nm : MeasurableSpace X\nμ : Measure X\n𝒜 : Set (Set X)\nh𝒜 : IsSetAlgebra 𝒜\nS : μ.FiniteSpanningSetsIn 𝒜\nhgen : m = MeasurableSpace.generateFrom 𝒜\ns : Set X\nms : MeasurableSet s\nhμs : μ s ≠ ∞\nε : ℝ\nε_pos : 0 < ε\nT : ℕ → Set X := accumulate S.set\nT_mem : ∀ (n : ℕ), T n ∈ 𝒜\nn... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.Measure.Typeclasses.ZeroOne | {
"line": 140,
"column": 8
} | {
"line": 140,
"column": 26
} | [
{
"pp": "case pos\nα : Type u_1\nmα : MeasurableSpace α\nμ : Measure α\ninst✝² : IsZeroOneMeasure μ\ninst✝¹ : StandardBorelSpace α\ninst✝ : NeZero μ\nthis : IsProbabilityMeasure μ\nA : ℕ → Set α\nhAm : ∀ (n : ℕ), MeasurableSet (A n)\nhAsep : ∀ x ∈ univ, ∀ y ∈ univ, (∀ (n : ℕ), x ∈ A n ↔ y ∈ A n) → x = y\nB : ℕ ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.Measure.SeparableMeasure | {
"line": 369,
"column": 6
} | {
"line": 376,
"column": 74
} | [
{
"pp": "case refine_2\nX : Type u_1\nm : MeasurableSpace X\nμ : Measure X\ninst✝¹ : CountablyGenerated X\ninst✝ : SigmaFinite μ\nh : (countableGeneratingSet X).Countable\nhgen : MeasurableSpace.generateFrom (countableGeneratingSet X) = m\n𝒜 : Set (Set X) := countableGeneratingSet X ∪ {x | ∃ n, μ.toFiniteSpann... | induction hs with
| base t t_mem =>
rcases t_mem with t_mem | ⟨n, rfl⟩
· exact hgen ▸ measurableSet_generateFrom t_mem
· exact μ.toFiniteSpanningSetsIn.set_mem n
| empty => exact MeasurableSet.empty
| compl t _ t_mem => exact MeasurableSet.compl t_mem
| union t u _ _ t_me... | _private.Lean.Elab.Tactic.Induction.0.Lean.Elab.Tactic.evalInduction | Lean.Parser.Tactic.induction |
Mathlib.MeasureTheory.Measure.SeparableMeasure | {
"line": 369,
"column": 6
} | {
"line": 376,
"column": 74
} | [
{
"pp": "case refine_2\nX : Type u_1\nm : MeasurableSpace X\nμ : Measure X\ninst✝¹ : CountablyGenerated X\ninst✝ : SigmaFinite μ\nh : (countableGeneratingSet X).Countable\nhgen : MeasurableSpace.generateFrom (countableGeneratingSet X) = m\n𝒜 : Set (Set X) := countableGeneratingSet X ∪ {x | ∃ n, μ.toFiniteSpann... | induction hs with
| base t t_mem =>
rcases t_mem with t_mem | ⟨n, rfl⟩
· exact hgen ▸ measurableSet_generateFrom t_mem
· exact μ.toFiniteSpanningSetsIn.set_mem n
| empty => exact MeasurableSet.empty
| compl t _ t_mem => exact MeasurableSet.compl t_mem
| union t u _ _ t_me... | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.MeasureTheory.Measure.SeparableMeasure | {
"line": 369,
"column": 6
} | {
"line": 376,
"column": 74
} | [
{
"pp": "case refine_2\nX : Type u_1\nm : MeasurableSpace X\nμ : Measure X\ninst✝¹ : CountablyGenerated X\ninst✝ : SigmaFinite μ\nh : (countableGeneratingSet X).Countable\nhgen : MeasurableSpace.generateFrom (countableGeneratingSet X) = m\n𝒜 : Set (Set X) := countableGeneratingSet X ∪ {x | ∃ n, μ.toFiniteSpann... | induction hs with
| base t t_mem =>
rcases t_mem with t_mem | ⟨n, rfl⟩
· exact hgen ▸ measurableSet_generateFrom t_mem
· exact μ.toFiniteSpanningSetsIn.set_mem n
| empty => exact MeasurableSet.empty
| compl t _ t_mem => exact MeasurableSet.compl t_mem
| union t u _ _ t_me... | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.MeasureTheory.VectorMeasure.AddContent | {
"line": 39,
"column": 15
} | {
"line": 39,
"column": 26
} | [
{
"pp": "α : Type u_1\nhα : MeasurableSpace α\nE : Type u_2\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\nμ : Measure α\nm : Set α → E\nhm : ∀ (s : Set α), ‖m s‖ₑ ≤ μ s\ninst✝ : IsFiniteMeasure μ\nh'm : ∀ (s t : Set α), MeasurableSet s → MeasurableSet t → Disjoint s t → m (s ∪ t) = m s + m t\nh''m :... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.AddContent | {
"line": 43,
"column": 6
} | {
"line": 43,
"column": 32
} | [
{
"pp": "α : Type u_1\nhα : MeasurableSpace α\nE : Type u_2\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\nμ : Measure α\nm : Set α → E\nhm : ∀ (s : Set α), ‖m s‖ₑ ≤ μ s\ninst✝ : IsFiniteMeasure μ\nh'm : ∀ (s t : Set α), MeasurableSet s → MeasurableSet t → Disjoint s t → m (s ∪ t) = m s + m t\nh''m :... | simp only [← toReal_enorm] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.MeasureTheory.VectorMeasure.AddContent | {
"line": 55,
"column": 16
} | {
"line": 55,
"column": 27
} | [
{
"pp": "case zero\nα : Type u_1\nhα : MeasurableSpace α\nE : Type u_2\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\nμ : Measure α\nm : Set α → E\nhm : ∀ (s : Set α), ‖m s‖ₑ ≤ μ s\ninst✝ : IsFiniteMeasure μ\nh'm : ∀ (s t : Set α), MeasurableSet s → MeasurableSet t → Disjoint s t → m (s ∪ t) = m s + ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.Measure.HasOuterApproxClosedProd | {
"line": 221,
"column": 2
} | {
"line": 221,
"column": 17
} | [
{
"pp": "ι : Type u_1\nT : Type u_4\nX : ι → Type u_5\nmX : (i : ι) → MeasurableSpace (X i)\ninst✝⁸ : (i : ι) → TopologicalSpace (X i)\ninst✝⁷ : ∀ (i : ι), BorelSpace (X i)\ninst✝⁶ : ∀ (i : ι), HasOuterApproxClosed (X i)\nmT : MeasurableSpace T\ninst✝⁵ : TopologicalSpace T\ninst✝⁴ : BorelSpace T\ninst✝³ : HasOu... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.Measure.HasOuterApproxClosedProd | {
"line": 240,
"column": 2
} | {
"line": 240,
"column": 27
} | [
{
"pp": "κ : Type u_2\nZ : Type u_3\nY : κ → Type u_6\nmY : (j : κ) → MeasurableSpace (Y j)\ninst✝⁸ : (j : κ) → TopologicalSpace (Y j)\ninst✝⁷ : ∀ (j : κ), BorelSpace (Y j)\ninst✝⁶ : ∀ (j : κ), HasOuterApproxClosed (Y j)\nmZ : MeasurableSpace Z\ninst✝⁵ : TopologicalSpace Z\ninst✝⁴ : BorelSpace Z\ninst✝³ : HasOu... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.Measure.HasOuterApproxClosedProd | {
"line": 262,
"column": 2
} | {
"line": 262,
"column": 17
} | [
{
"pp": "Z : Type u_3\nT : Type u_4\nmZ : MeasurableSpace Z\ninst✝⁷ : TopologicalSpace Z\ninst✝⁶ : BorelSpace Z\ninst✝⁵ : HasOuterApproxClosed Z\nmT : MeasurableSpace T\ninst✝⁴ : TopologicalSpace T\ninst✝³ : BorelSpace T\ninst✝² : HasOuterApproxClosed T\nμ ν : Measure (Z × T)\ninst✝¹ : IsFiniteMeasure μ\ninst✝ ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.AddContent | {
"line": 149,
"column": 4
} | {
"line": 149,
"column": 67
} | [
{
"pp": "α : Type u_1\nhα : MeasurableSpace α\nE : Type u_2\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\nμ : Measure α\ninst✝ : IsFiniteMeasure μ\nC : Set (Set α)\nm : AddContent E C\nhC : IsSetRing C\nhCmeas : ∀ s ∈ C, MeasurableSet s\nhm : ∀ s ∈ C, ‖m s‖ₑ ≤ μ s\nh'C : ∀ (t : Set α) (ε : ℝ≥0∞), Me... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.BoundedVariation | {
"line": 145,
"column": 6
} | {
"line": 145,
"column": 44
} | [
{
"pp": "case pos\nα : Type u_1\ninst✝⁸ : LinearOrder α\ninst✝⁷ : DenselyOrdered α\ninst✝⁶ : TopologicalSpace α\ninst✝⁵ : OrderTopology α\ninst✝⁴ : SecondCountableTopology α\ninst✝³ : CompactIccSpace α\nhα : MeasurableSpace α\ninst✝² : BorelSpace α\nE : Type u_2\ninst✝¹ : NormedAddCommGroup E\ninst✝ : CompleteS... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.BoundedVariation | {
"line": 147,
"column": 36
} | {
"line": 147,
"column": 80
} | [
{
"pp": "α : Type u_1\ninst✝⁸ : LinearOrder α\ninst✝⁷ : DenselyOrdered α\ninst✝⁶ : TopologicalSpace α\ninst✝⁵ : OrderTopology α\ninst✝⁴ : SecondCountableTopology α\ninst✝³ : CompactIccSpace α\nhα : MeasurableSpace α\ninst✝² : BorelSpace α\nE : Type u_2\ninst✝¹ : NormedAddCommGroup E\ninst✝ : CompleteSpace E\nf ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.BoundedVariation | {
"line": 154,
"column": 50
} | {
"line": 154,
"column": 61
} | [
{
"pp": "α : Type u_1\ninst✝⁸ : LinearOrder α\ninst✝⁷ : DenselyOrdered α\ninst✝⁶ : TopologicalSpace α\ninst✝⁵ : OrderTopology α\ninst✝⁴ : SecondCountableTopology α\ninst✝³ : CompactIccSpace α\nhα : MeasurableSpace α\ninst✝² : BorelSpace α\nE : Type u_2\ninst✝¹ : NormedAddCommGroup E\ninst✝ : CompleteSpace E\nf ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.Variation.Defs | {
"line": 48,
"column": 2
} | {
"line": 48,
"column": 57
} | [
{
"pp": "X : Type u_1\ninst✝³ : MeasurableSpace X\nV : Type u_2\ninst✝² : TopologicalSpace V\ninst✝¹ : ENormedAddCommMonoid V\ninst✝ : T2Space V\nμ : VectorMeasure X V\ns : ℕ → { t // MeasurableSet t }\nhs : Pairwise (Function.onFun Disjoint (Subtype.val ∘ s))\nhmeas : ∀ (i : ℕ), MeasurableSet ↑(s i)\n⊢ (fun x ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.Variation.Basic | {
"line": 111,
"column": 6
} | {
"line": 111,
"column": 49
} | [
{
"pp": "X : Type u_1\nV : Type u_2\nmX : MeasurableSpace X\ninst✝² : TopologicalSpace V\ninst✝¹ : ENormedAddCommMonoid V\ninst✝ : T2Space V\nμ : VectorMeasure X V\nm : Measure X\nh : ∀ (E : Set X), MeasurableSet E → ‖↑μ E‖ₑ ≤ m E\ns : Set X\nhs : MeasurableSet s\nx✝ : s.Nonempty\ni : Finpartition ⟨s, ⋯⟩\na : S... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.Variation.Basic | {
"line": 129,
"column": 4
} | {
"line": 129,
"column": 39
} | [
{
"pp": "case insert\nX : Type u_1\nV : Type u_2\nmX : MeasurableSpace X\ninst✝³ : TopologicalSpace V\ninst✝² : ENormedAddCommMonoid V\ninst✝¹ : T2Space V\ninst✝ : ContinuousAdd V\nι : Type u_3\nμ : ι → VectorMeasure X V\ni : ι\ns : Finset ι\nhis : i ∉ s\nih : (∑ i ∈ s, μ i).variation ≤ ∑ i ∈ s, (μ i).variation... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.BoundedVariation | {
"line": 207,
"column": 6
} | {
"line": 207,
"column": 22
} | [
{
"pp": "α : Type u_1\ninst✝⁸ : LinearOrder α\ninst✝⁷ : DenselyOrdered α\ninst✝⁶ : TopologicalSpace α\ninst✝⁵ : OrderTopology α\ninst✝⁴ : SecondCountableTopology α\ninst✝³ : CompactIccSpace α\nhα : MeasurableSpace α\ninst✝² : BorelSpace α\nE : Type u_2\ninst✝¹ : NormedAddCommGroup E\ninst✝ : CompleteSpace E\nf ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.BoundedVariation | {
"line": 242,
"column": 6
} | {
"line": 242,
"column": 22
} | [
{
"pp": "α : Type u_1\ninst✝⁸ : LinearOrder α\ninst✝⁷ : DenselyOrdered α\ninst✝⁶ : TopologicalSpace α\ninst✝⁵ : OrderTopology α\ninst✝⁴ : SecondCountableTopology α\ninst✝³ : CompactIccSpace α\nhα : MeasurableSpace α\ninst✝² : BorelSpace α\nE : Type u_2\ninst✝¹ : NormedAddCommGroup E\ninst✝ : CompleteSpace E\nf ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.AddContent | {
"line": 231,
"column": 8
} | {
"line": 231,
"column": 28
} | [
{
"pp": "case pos\nα : Type u_1\nhα : MeasurableSpace α\nE : Type u_2\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\nμ : Measure α\ninst✝ : IsFiniteMeasure μ\nC : Set (Set α)\nm : AddContent E C\nhC : IsSetRing C\nhCmeas : ∀ s ∈ C, MeasurableSet s\nhm : ∀ s ∈ C, ‖m s‖ₑ ≤ μ s\nh'C : ∀ (t : Set α) (ε :... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Defs | {
"line": 160,
"column": 4
} | {
"line": 160,
"column": 15
} | [
{
"pp": "case insert\nM : Type u_1\ninst✝ : AddCommMonoid M\nS : Set (Set M)\na✝¹ : Set M\ns✝ : Set (Set M)\na✝ : a✝¹ ∉ s✝\nhs✝ : s✝.Finite\nih : (∀ s ∈ s✝, IsSemilinearSet s) → IsSemilinearSet (⋃₀ s✝)\nhS' : IsSemilinearSet a✝¹ ∧ ∀ a ∈ s✝, IsSemilinearSet a\n⊢ IsSemilinearSet (⋃₀ insert a✝¹ s✝)",
"usedCons... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Definability | {
"line": 136,
"column": 4
} | {
"line": 136,
"column": 31
} | [
{
"pp": "case h.e'_3.h.e'_2.h.h.h.e'_8.h\nα : Type u_1\nA : Set ℕ\ninst✝ : Finite α\nn✝ : ℕ\nthis : Fintype α\nn : ℕ\nφ : presburger[[↑A]].BoundedFormula α (n + 1)\ne : (α ⊕ Fin n) ⊕ Fin 1 ≃ α ⊕ Fin (n + 1) :=\n (Equiv.sumAssoc α (Fin n) (Fin 1)).trans ((_root_.Equiv.refl α).sumCongr finSumFinEquiv)\nih : IsSe... | cases i using Fin.lastCases | _private.Lean.Elab.Tactic.Induction.0.Lean.Elab.Tactic.evalCases | Lean.Parser.Tactic.cases |
Mathlib.ModelTheory.Arithmetic.Presburger.Definability | {
"line": 168,
"column": 4
} | {
"line": 168,
"column": 52
} | [
{
"pp": "case h.e'_6.h\nA : Set ℕ\nhmul : A.Definable presburger {v | v 0 = v 1 * v 2}\nx✝ : Fin 1 → ℕ\n⊢ x✝ ∈ {x | x 0 ∈ {x | ∃ x_1, x_1 * x_1 = x}} ↔\n x✝ ∈ (fun g ↦ g ∘ ![0]) '' (fun g ↦ g ∘ ![0, 1, 1]) ⁻¹' {v | v 0 = v 1 * v 2}",
"usedConstants": [
"Eq.mpr",
"Set.Definable₁._proof_1",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Defs | {
"line": 265,
"column": 4
} | {
"line": 265,
"column": 40
} | [
{
"pp": "case insert\nM : Type u_1\ninst✝ : AddCommMonoid M\nS : Set (Set M)\na✝¹ : Set M\ns✝ : Set (Set M)\na✝ : a✝¹ ∉ s✝\nhs✝ : s✝.Finite\nih : (∀ t ∈ s✝, IsLinearSet t) → IsSemilinearSet ↑(closure (⋃₀ s✝))\nhS' : IsLinearSet a✝¹ ∧ ∀ a ∈ s✝, IsLinearSet a\n⊢ IsSemilinearSet ↑(closure (⋃₀ insert a✝¹ s✝))",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Defs | {
"line": 264,
"column": 4
} | {
"line": 265,
"column": 69
} | [
{
"pp": "case insert\nM : Type u_1\ninst✝ : AddCommMonoid M\nS : Set (Set M)\na✝¹ : Set M\ns✝ : Set (Set M)\na✝ : a✝¹ ∉ s✝\nhs✝ : s✝.Finite\nih : (∀ t ∈ s✝, IsLinearSet t) → IsSemilinearSet ↑(closure (⋃₀ s✝))\nhS' : ∀ t ∈ insert a✝¹ s✝, IsLinearSet t\n⊢ IsSemilinearSet ↑(closure (⋃₀ insert a✝¹ s✝))",
"usedC... | simp_rw [mem_insert_iff, forall_eq_or_imp] at hS'
simpa [closure_union, coe_sup] using hS'.1.closure.add (ih hS'.2) | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Defs | {
"line": 264,
"column": 4
} | {
"line": 265,
"column": 69
} | [
{
"pp": "case insert\nM : Type u_1\ninst✝ : AddCommMonoid M\nS : Set (Set M)\na✝¹ : Set M\ns✝ : Set (Set M)\na✝ : a✝¹ ∉ s✝\nhs✝ : s✝.Finite\nih : (∀ t ∈ s✝, IsLinearSet t) → IsSemilinearSet ↑(closure (⋃₀ s✝))\nhS' : ∀ t ∈ insert a✝¹ s✝, IsLinearSet t\n⊢ IsSemilinearSet ↑(closure (⋃₀ insert a✝¹ s✝))",
"usedC... | simp_rw [mem_insert_iff, forall_eq_or_imp] at hS'
simpa [closure_union, coe_sup] using hS'.1.closure.add (ih hS'.2) | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Defs | {
"line": 324,
"column": 4
} | {
"line": 324,
"column": 15
} | [
{
"pp": "case insert\nM : Type u_1\ninst✝ : AddCommMonoid M\nS : Set (Set M)\na✝¹ : Set M\ns✝ : Set (Set M)\na✝ : a✝¹ ∉ s✝\nhs✝ : s✝.Finite\nih : (∀ s ∈ s✝, IsProperSemilinearSet s) → IsProperSemilinearSet (⋃₀ s✝)\nhS' : IsProperSemilinearSet a✝¹ ∧ ∀ a ∈ s✝, IsProperSemilinearSet a\n⊢ IsProperSemilinearSet (⋃₀ ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Defs | {
"line": 368,
"column": 24
} | {
"line": 368,
"column": 56
} | [
{
"pp": "case h.e'_5.h.e'_5.a\nM : Type u_1\ninst✝¹ : AddCommMonoid M\ninst✝ : IsCancelAdd M\na : M\nt : Finset M\nih : ∀ m < t.card, ∀ (a : M) (t : Finset M), t.card = m → IsProperSemilinearSet (a +ᵥ ↑(closure ↑t))\nt' : Finset M\nht' : t' ⊆ t\nf : M → ℕ\ni : M\nhi : i ∈ t'\nhfi : 0 < f i\nheq : ∑ x ∈ t', f x ... | tsub_add_cancel_of_le (hfg j hj) | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Defs | {
"line": 407,
"column": 36
} | {
"line": 407,
"column": 72
} | [
{
"pp": "S : Finset (Set ℕ)\nhS : ∀ t ∈ S, IsProperLinearSet t\na : ℕ\nt : Finset ℕ\nht : LinearIndepOn ℕ id ↑t\n⊢ t.card ≤ 1",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Defs | {
"line": 412,
"column": 30
} | {
"line": 412,
"column": 51
} | [
{
"pp": "S : Finset (Set ℕ)\nhS : ∀ t ∈ S, IsProperLinearSet t\na b : ℕ\nht : LinearIndepOn ℕ id ↑{b}\n⊢ b ≠ 0",
"usedConstants": [
"id",
"Ne",
"instOfNatNat",
"Nat",
"OfNat.ofNat"
]
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.DirectLimit | {
"line": 67,
"column": 4
} | {
"line": 68,
"column": 31
} | [
{
"pp": "case h.succ\nL : Language\nG' : ℕ → Type w\ninst✝ : (i : ℕ) → L.Structure (G' i)\nf' : (n : ℕ) → G' n ↪[L] G' (n + 1)\nm : ℕ\nx : G' m\nk : ℕ\nih : ∀ (h : m ≤ m + k), (natLERec f' m (m + k) h) x = Nat.leRecOn h (fun k ↦ ⇑(f' k)) x\nh : m ≤ m + (k + 1)\n⊢ (natLERec f' m (m + (k + 1)) h) x = Nat.leRecOn ... | rw [Nat.leRecOn_succ le_self_add, natLERec, Nat.leRecOn_succ le_self_add, ← natLERec,
Embedding.comp_apply, ih] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.ModelTheory.DirectLimit | {
"line": 67,
"column": 4
} | {
"line": 68,
"column": 31
} | [
{
"pp": "case h.succ\nL : Language\nG' : ℕ → Type w\ninst✝ : (i : ℕ) → L.Structure (G' i)\nf' : (n : ℕ) → G' n ↪[L] G' (n + 1)\nm : ℕ\nx : G' m\nk : ℕ\nih : ∀ (h : m ≤ m + k), (natLERec f' m (m + k) h) x = Nat.leRecOn h (fun k ↦ ⇑(f' k)) x\nh : m ≤ m + (k + 1)\n⊢ (natLERec f' m (m + (k + 1)) h) x = Nat.leRecOn ... | rw [Nat.leRecOn_succ le_self_add, natLERec, Nat.leRecOn_succ le_self_add, ← natLERec,
Embedding.comp_apply, ih] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.ModelTheory.DirectLimit | {
"line": 67,
"column": 4
} | {
"line": 68,
"column": 31
} | [
{
"pp": "case h.succ\nL : Language\nG' : ℕ → Type w\ninst✝ : (i : ℕ) → L.Structure (G' i)\nf' : (n : ℕ) → G' n ↪[L] G' (n + 1)\nm : ℕ\nx : G' m\nk : ℕ\nih : ∀ (h : m ≤ m + k), (natLERec f' m (m + k) h) x = Nat.leRecOn h (fun k ↦ ⇑(f' k)) x\nh : m ≤ m + (k + 1)\n⊢ (natLERec f' m (m + (k + 1)) h) x = Nat.leRecOn ... | rw [Nat.leRecOn_succ le_self_add, natLERec, Nat.leRecOn_succ le_self_add, ← natLERec,
Embedding.comp_apply, ih] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Basic | {
"line": 246,
"column": 2
} | {
"line": 246,
"column": 13
} | [
{
"pp": "case e_a.e_a.e_s.h\nM : Type u_1\ninst✝ : AddCommMonoid M\na : M\nt : Set M\nht : t.Finite\nx : M\n⊢ x ∈ t ↔ x ∈ ⇑(closure (insert a t)).subtype '' ⇑(closure (insert a t)).subtype ⁻¹' t",
"usedConstants": [
"AddSubmonoid.subtype",
"Eq.mpr",
"Iff.of_eq",
"congrArg",
"Ad... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Basic | {
"line": 311,
"column": 4
} | {
"line": 311,
"column": 15
} | [
{
"pp": "case insert\nM : Type u_1\ninst✝¹ : AddCommMonoid M\ninst✝ : AddMonoid.FG M\nS : Set (Set M)\na✝¹ : Set M\ns✝ : Set (Set M)\na✝ : a✝¹ ∉ s✝\nhs✝ : s✝.Finite\nih : (∀ s ∈ s✝, IsSemilinearSet s) → IsSemilinearSet (⋂₀ s✝)\nhS' : IsSemilinearSet a✝¹ ∧ ∀ a ∈ s✝, IsSemilinearSet a\n⊢ IsSemilinearSet (⋂₀ inser... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Basic | {
"line": 354,
"column": 2
} | {
"line": 354,
"column": 24
} | [
{
"pp": "case h\nι : Type u_3\nx y : ι → ℕ\nh : toRatVec x = toRatVec y\ni : ι\n⊢ x i = y i",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Basic | {
"line": 378,
"column": 4
} | {
"line": 378,
"column": 15
} | [
{
"pp": "ι : Type u_3\ns : Set (ι → ℕ)\nt : Finset (ι → ℕ)\nf : (ι → ℕ) → ℤ\nht : ↑t ⊆ s\nhf : ∀ i ∉ t, f i = 0\nheq : ∑ i ∈ t, f i • toRatVec i = 0\ni : ι → ℕ\nhi : i ∈ t\nhs : (Int.toNat ∘ f) i = (Int.toNat ∘ (fun x ↦ -x) ∘ f) i\n⊢ (f i).toNat = (-f i).toNat",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Basic | {
"line": 498,
"column": 4
} | {
"line": 498,
"column": 57
} | [
{
"pp": "case mem\nι : Type u_3\ns : Set (ι → ℕ)\nhs : IsProperLinearSet s\ninst✝ : Finite ι\nx y✝ : ι → ℕ\ni : ↑hs.basisSet\nt : Set (ι → ℕ)\nht : t ⊆ hs.basisSet\nhi : ↑i ∉ t\ny : ι → ℕ\nhy : y ∈ t\n⊢ (hs.basis.repr (hs.basis ⟨y, ⋯⟩)) i = 0",
"usedConstants": [
"Rat.addCommMonoid",
"Finsupp.in... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.Integral | {
"line": 109,
"column": 2
} | {
"line": 109,
"column": 13
} | [
{
"pp": "X : Type u_2\nE : Type u_3\nF : Type u_4\nG : Type u_5\nmX : MeasurableSpace X\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace ℝ E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace ℝ F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace ℝ G\nμ : VectorMeasure X F\nB : E →L[ℝ] F →L[ℝ] G\ns : Set... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Basic | {
"line": 646,
"column": 8
} | {
"line": 646,
"column": 37
} | [
{
"pp": "case h.e'_3.h.mp.refine_2\nι : Type u_3\ns : Set (ι → ℕ)\nhs : IsProperLinearSet s\ninst✝ : Finite ι\nx : ι → ℕ\nhx : hs.fract x = hs.base\ni : ↑hs.basisSet\nhi : hs.floor x i < 0\nj : ↑hs.basisSet\nhj : j ∈ Finset.univ.erase i\n⊢ ↑j ∈ hs.basisSet \\ {↑i}",
"usedConstants": [
"Eq.mpr",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Basic | {
"line": 648,
"column": 8
} | {
"line": 648,
"column": 37
} | [
{
"pp": "case h.e'_3.h.mp.refine_3\nι : Type u_3\ns : Set (ι → ℕ)\nhs : IsProperLinearSet s\ninst✝ : Finite ι\nx : ι → ℕ\nhx : hs.fract x = hs.base\ni : ↑hs.basisSet\nhi : hs.floor x i < 0\nj : ↑hs.basisSet\nhj : j ∈ Finset.univ.erase i\n⊢ ↑j ∈ hs.basisSet \\ {↑i}",
"usedConstants": [
"Eq.mpr",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Basic | {
"line": 672,
"column": 8
} | {
"line": 672,
"column": 25
} | [
{
"pp": "case h.e'_3.h.mpr.refine_2\nι : Type u_3\ns : Set (ι → ℕ)\nhs : IsProperLinearSet s\ninst✝ : Finite ι\nx : ι → ℕ\ni : ↑hs.basisSet\nz : ι → ℕ\nhz : z ∈ closure (hs.basisSet \\ {↑i})\nz' : ι → ℕ\nhz' : z' ∈ closure (hs.basisSet \\ {↑i})\nn : ℕ\nheq : hs.floor x i = -↑(n + 1)\n⊢ hs.floor x i < 0",
"u... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Basic | {
"line": 709,
"column": 8
} | {
"line": 709,
"column": 37
} | [
{
"pp": "case h.e'_3.h.mp.refine_2\nι : Type u_3\ns : Set (ι → ℕ)\nhs : IsProperLinearSet s\ninst✝ : Finite ι\nx : ι → ℕ\nhx : hs.fract x = hs.base\ni : ↑hs.basisSet\nhi : ↑i ∉ hs.periods\nhi' : 0 < hs.floor x i\nj : ↑hs.basisSet\nhj : j ∈ Finset.univ.erase i\n⊢ ↑j ∈ hs.basisSet \\ {↑i}",
"usedConstants": [... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Arithmetic.Presburger.Semilinear.Basic | {
"line": 711,
"column": 8
} | {
"line": 711,
"column": 37
} | [
{
"pp": "case h.e'_3.h.mp.refine_3\nι : Type u_3\ns : Set (ι → ℕ)\nhs : IsProperLinearSet s\ninst✝ : Finite ι\nx : ι → ℕ\nhx : hs.fract x = hs.base\ni : ↑hs.basisSet\nhi : ↑i ∉ hs.periods\nhi' : 0 < hs.floor x i\nj : ↑hs.basisSet\nhj : j ∈ Finset.univ.erase i\n⊢ ↑j ∈ hs.basisSet \\ {↑i}",
"usedConstants": [... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.Integral | {
"line": 309,
"column": 6
} | {
"line": 309,
"column": 17
} | [
{
"pp": "case pos.refine_1\nX : Type u_2\nE : Type u_3\nF : Type u_4\nG : Type u_5\nmX : MeasurableSpace X\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace ℝ E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace ℝ F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace ℝ G\nf : X → E\nμ ν : VectorMeasure X F... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.Order.CountableDenseLinearOrder | {
"line": 255,
"column": 6
} | {
"line": 255,
"column": 40
} | [
{
"pp": "α : Type u_1\nβ : Type u_2\ninst✝¹¹ : LinearOrder α\ninst✝¹⁰ : LinearOrder β\ninst✝⁹ : Countable α\ninst✝⁸ : DenselyOrdered α\ninst✝⁷ : NoMinOrder α\ninst✝⁶ : NoMaxOrder α\ninst✝⁵ : Nonempty α\ninst✝⁴ : Countable β\ninst✝³ : DenselyOrdered β\ninst✝² : NoMinOrder β\ninst✝¹ : NoMaxOrder β\ninst✝ : Nonemp... | rcases (F a).prop with ⟨f, hf, ha⟩ | _private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalRCases | Lean.Parser.Tactic.rcases |
Mathlib.MeasureTheory.VectorMeasure.Integral | {
"line": 322,
"column": 8
} | {
"line": 322,
"column": 19
} | [
{
"pp": "case pos.refine_1\nι : Type u_1\nX : Type u_2\nE : Type u_3\nF : Type u_4\nG : Type u_5\nmX : MeasurableSpace X\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace ℝ E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace ℝ F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace ℝ G\nf : X → E\nB : E →L[... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.Integral | {
"line": 343,
"column": 6
} | {
"line": 343,
"column": 17
} | [
{
"pp": "case pos.refine_1\nX : Type u_2\nE : Type u_3\nF : Type u_4\nG : Type u_5\nmX : MeasurableSpace X\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace ℝ E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace ℝ F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace ℝ G\nf : X → E\nμ ν : VectorMeasure X F... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.Integral | {
"line": 364,
"column": 6
} | {
"line": 364,
"column": 17
} | [
{
"pp": "case pos.refine_1\nX : Type u_2\nE : Type u_3\nF : Type u_4\nG : Type u_5\nmX : MeasurableSpace X\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace ℝ E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace ℝ F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace ℝ G\nf : X → E\nμ : VectorMeasure X F\n... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.Integral | {
"line": 377,
"column": 8
} | {
"line": 377,
"column": 19
} | [
{
"pp": "case pos.refine_1\nι : Type u_1\nX : Type u_2\nE : Type u_3\nF : Type u_4\nG : Type u_5\nmX : MeasurableSpace X\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace ℝ E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace ℝ F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace ℝ G\nf : X → E\nμ : Vecto... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.MeasureTheory.VectorMeasure.Integral | {
"line": 397,
"column": 6
} | {
"line": 397,
"column": 17
} | [
{
"pp": "case pos.refine_1\nX : Type u_2\nE : Type u_3\nF : Type u_4\nG : Type u_5\nmX : MeasurableSpace X\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace ℝ E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace ℝ F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace ℝ G\nf : X → E\nμ : VectorMeasure X F\n... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.ADEInequality | {
"line": 209,
"column": 59
} | {
"line": 209,
"column": 70
} | [
{
"pp": "p q r : ℕ+\nhs : [p, q, r].SortedLE\nx✝ : [p, q, r].length = 3\nH : 1 < sumInv ↑[p, q, r]\n⊢ (p ≤ q ∧ p ≤ r) ∧ q ≤ r",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt | {
"line": 120,
"column": 9
} | {
"line": 120,
"column": 49
} | [
{
"pp": "case h\nn : ℕ\n⊢ (Λ * ↑ζ) n = log n",
"usedConstants": [
"ArithmeticFunction.vonMangoldt",
"Eq.mpr",
"NonAssocSemiring.toAddCommMonoidWithOne",
"Real",
"HMul.hMul",
"ArithmeticFunction.instFunLikeNat",
"ArithmeticFunction.instMul",
"Real.instZero",
... | rw [coe_mul_zeta_apply, vonMangoldt_sum] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt | {
"line": 145,
"column": 19
} | {
"line": 145,
"column": 30
} | [
{
"pp": "n : ℕ\nhn : ¬n = 0\nmn : 0 ∣ n\n⊢ n = 0",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.ArithmeticFunction.Carmichael | {
"line": 128,
"column": 2
} | {
"line": 128,
"column": 87
} | [
{
"pp": "n : ℕ\nhn : n ≤ 2\n⊢ exponent (ZMod (2 ^ n))ˣ = Nat.card (ZMod (2 ^ n))ˣ",
"usedConstants": [
"Iff.mpr",
"ZMod.commRing",
"CommSemiring.toSemiring",
"Nat.instMonoid",
"DivInvMonoid.toZPow",
"Units",
"Nat.card",
"DivInvMonoid.toMonoid",
"Units.in... | exact IsCyclic.iff_exponent_eq_card.mp <| ZMod.isCyclic_units_two_pow_iff n |>.mpr hn | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.NumberTheory.ArithmeticFunction.Carmichael | {
"line": 133,
"column": 40
} | {
"line": 135,
"column": 29
} | [
{
"pp": "n : ℕ\nhn : n ≤ 2\n⊢ λ (2 ^ n) = 2 ^ (n - 1)",
"usedConstants": [
"Eq.mpr",
"Nat.zero_le",
"Nat.instMulZeroClass",
"ArithmeticFunction.instFunLikeNat",
"of_decide_eq_true",
"Nat.rawCast",
"congrArg",
"Nat.instMonoid",
"HSub.hSub",
"id",
... | by
rw [carmichael_two_pow_of_le_two_eq_totient hn]
interval_cases n <;> decide | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.RingTheory.ZMod.UnitsCyclic | {
"line": 194,
"column": 4
} | {
"line": 194,
"column": 15
} | [
{
"pp": "p : ℕ\nhp : Nat.Prime p\nhp2 : p ≠ 2\nn : ℕ\nH : ↑p ∣ 1\n⊢ p = 1",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.PowerSeries.Derivative | {
"line": 96,
"column": 36
} | {
"line": 96,
"column": 54
} | [
{
"pp": "R : Type u_1\ninst✝ : CommSemiring R\nr : R\nf : R⟦X⟧\n⊢ (C r * f).derivativeFun = C r * f.derivativeFun",
"usedConstants": [
"Eq.mpr",
"instHSMul",
"instSMulOfMul",
"HMul.hMul",
"congrArg",
"CommSemiring.toSemiring",
"RingHom",
"MvPowerSeries.instMul... | derivativeFun_mul, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.PowerSeries.Exp | {
"line": 159,
"column": 4
} | {
"line": 160,
"column": 34
} | [
{
"pp": "case succ\nA : Type u_4\ninst✝¹ : CommRing A\ninst✝ : Algebra ℚ A\nk : ℕ\nh : exp A ^ k = (rescale ↑k) (exp A)\n⊢ exp A ^ (k + 1) = (rescale ↑(k + 1)) (exp A)",
"usedConstants": [
"Eq.mpr",
"HMul.hMul",
"AddMonoid.toAddSemigroup",
"congrArg",
"CommSemiring.toSemiring",... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.ZMod.UnitsCyclic | {
"line": 267,
"column": 27
} | {
"line": 267,
"column": 38
} | [
{
"pp": "n : ℕ\nhn0 : 2 * n ≠ 0\nhn1 : 2 * n ≠ 1\n⊢ n ≠ 0",
"usedConstants": [
"Nat.instMulZeroClass",
"id",
"Ne",
"Nat",
"Zero.toOfNat0",
"OfNat.ofNat",
"MulZeroClass.toZero"
]
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.ZMod.UnitsCyclic | {
"line": 275,
"column": 25
} | {
"line": 275,
"column": 60
} | [
{
"pp": "n : ℕ\nhn0 : n ≠ 0\nhn1 : n ≠ 1\nh2n : ¬2 ∣ n\nthis✝ : Nat.Coprime 4 n\nh : (Nat.card (ZMod 4)ˣ).Coprime (Nat.card (ZMod n)ˣ)\nthis : NeZero n\n⊢ Odd (φ n)",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.ZMod.UnitsCyclic | {
"line": 315,
"column": 6
} | {
"line": 315,
"column": 61
} | [
{
"pp": "case neg.refine_1.refine_1\nn : ℕ\nhn : Odd n\nhn0 : n ≠ 0\nh1 : n ≠ 1\np : ℕ\nhp : Nat.Prime p\ndvd : p ∣ n\nodd : Odd p\nhnp : ¬n = p ^ n.factorization p\nthis : p ^ n.factorization p ∣ n\n⊢ p ^ n.factorization p ≠ 1",
"usedConstants": [
"Finsupp.instFunLike",
"Eq.mpr",
"Nat.Pri... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.ZMod.UnitsCyclic | {
"line": 363,
"column": 2
} | {
"line": 364,
"column": 7
} | [
{
"pp": "case neg.inr.inr.ha\nn : ℕ\nh0 : ¬2 * (2 * n) = 0\nh1 : ¬2 * (2 * n) = 1\nh2 : ¬2 * (2 * n) = 2\nh4 : ¬2 * (2 * n) = 4\nhn✝ : Even (2 * (2 * n))\nhn : Even (2 * n)\n⊢ ¬IsCyclic (ZMod (2 * (2 * n)))ˣ",
"usedConstants": [
"Eq.mpr",
"NonAssocSemiring.toAddCommMonoidWithOne",
"Semigro... | · rw [← mul_assoc, show 2 * 2 = 4 from rfl, isCyclic_units_four_mul_iff]
lia | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.NumberTheory.AbelSummation | {
"line": 153,
"column": 2
} | {
"line": 157,
"column": 71
} | [
{
"pp": "case inr\n𝕜 : Type u_1\ninst✝ : RCLike 𝕜\nc : ℕ → 𝕜\nf : ℝ → 𝕜\na b : ℝ\nha : 0 ≤ a\nhab : a ≤ b\nhf_diff : ∀ t ∈ Set.Icc a b, DifferentiableAt ℝ f t\nhf_int : IntegrableOn (deriv f) (Set.Icc a b) volume\naux1 : ↑⌊a⌋₊ ≤ a\naux2 : b ≤ ↑⌊b⌋₊ + 1\nhb : ⌊a⌋₊ < ⌊b⌋₊\naux3 : a ≤ ↑⌊a⌋₊ + 1\naux4 : ↑⌊a⌋₊ +... | rw [this, sum_integral_adjacent_intervals_Ico hb, Nat.cast_add, Nat.cast_one,
← integral_interval_sub_left (a := a) (c := ⌊a⌋₊ + 1),
← integral_add_adjacent_intervals (b := ⌊b⌋₊) (c := b),
integralmulsum c hf_diff hf_int _ _ _ aux3 aux1 le_rfl le_rfl aux4,
integralmulsum c hf_diff hf_int _ _ _ aux5 le_r... | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.NumberTheory.BernoulliPolynomials | {
"line": 91,
"column": 2
} | {
"line": 91,
"column": 20
} | [
{
"pp": "n : ℕ\n⊢ (if n = 1 then 1 else 0) + _root_.bernoulli n = bernoulli' n",
"usedConstants": [
"Rat.instOfNat",
"AddMonoid.toAddZeroClass",
"bernoulli",
"Rat",
"AddZeroClass.toAddZero",
"instOfNatNat",
"dite",
"NonUnitalNonAssocSemiring.toAddCommMonoid",
... | by_cases h : n = 1 | «_aux_Init_ByCases___macroRules_tacticBy_cases_:__2» | «tacticBy_cases_:_» |
Mathlib.NumberTheory.AbelSummation | {
"line": 278,
"column": 4
} | {
"line": 279,
"column": 28
} | [
{
"pp": "case neg\n𝕜 : Type u_1\ninst✝ : RCLike 𝕜\nc : ℕ → 𝕜\na : ℝ\nm : ℕ\nha : 0 ≤ a\ng : ℝ → 𝕜\nhg : LocallyIntegrableOn g (Set.Ici a) volume\nK : Set ℝ\nhK₁ : K ⊆ Set.Ici a\nhK₂ : IsCompact K\nhK₃ : ¬K.Nonempty\n⊢ IntegrableOn (fun t ↦ g t * ∑ k ∈ Icc m ⌊t⌋₊, c k) K volume",
"usedConstants": [
... | rw [Set.not_nonempty_iff_eq_empty.mp hK₃]
exact integrableOn_empty | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.NumberTheory.AbelSummation | {
"line": 278,
"column": 4
} | {
"line": 279,
"column": 28
} | [
{
"pp": "case neg\n𝕜 : Type u_1\ninst✝ : RCLike 𝕜\nc : ℕ → 𝕜\na : ℝ\nm : ℕ\nha : 0 ≤ a\ng : ℝ → 𝕜\nhg : LocallyIntegrableOn g (Set.Ici a) volume\nK : Set ℝ\nhK₁ : K ⊆ Set.Ici a\nhK₂ : IsCompact K\nhK₃ : ¬K.Nonempty\n⊢ IntegrableOn (fun t ↦ g t * ∑ k ∈ Icc m ⌊t⌋₊, c k) K volume",
"usedConstants": [
... | rw [Set.not_nonempty_iff_eq_empty.mp hK₃]
exact integrableOn_empty | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.NumberTheory.AbelSummation | {
"line": 291,
"column": 37
} | {
"line": 291,
"column": 78
} | [
{
"pp": "𝕜 : Type u_1\ninst✝ : RCLike 𝕜\nc : ℕ → 𝕜\nf : ℝ → 𝕜\nhf_diff : ∀ t ∈ Set.Ici 0, DifferentiableAt ℝ f t\nhf_int : LocallyIntegrableOn (deriv f) (Set.Ici 0) volume\nl : 𝕜\nh_lim : Tendsto (fun n ↦ f ↑n * ∑ k ∈ Icc 0 n, c k) atTop (𝓝 l)\ng : ℝ → 𝕜\nhg_dom : (fun t ↦ deriv f t * ∑ k ∈ Icc 0 ⌊t⌋₊, c... | rw [← integral_of_le (Nat.cast_nonneg _)] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.NumberTheory.AbelSummation | {
"line": 291,
"column": 37
} | {
"line": 291,
"column": 78
} | [
{
"pp": "𝕜 : Type u_1\ninst✝ : RCLike 𝕜\nc : ℕ → 𝕜\nf : ℝ → 𝕜\nhf_diff : ∀ t ∈ Set.Ici 0, DifferentiableAt ℝ f t\nhf_int : LocallyIntegrableOn (deriv f) (Set.Ici 0) volume\nl : 𝕜\nh_lim : Tendsto (fun n ↦ f ↑n * ∑ k ∈ Icc 0 n, c k) atTop (𝓝 l)\ng : ℝ → 𝕜\nhg_dom : (fun t ↦ deriv f t * ∑ k ∈ Icc 0 ⌊t⌋₊, c... | rw [← integral_of_le (Nat.cast_nonneg _)] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.NumberTheory.AbelSummation | {
"line": 291,
"column": 37
} | {
"line": 291,
"column": 78
} | [
{
"pp": "𝕜 : Type u_1\ninst✝ : RCLike 𝕜\nc : ℕ → 𝕜\nf : ℝ → 𝕜\nhf_diff : ∀ t ∈ Set.Ici 0, DifferentiableAt ℝ f t\nhf_int : LocallyIntegrableOn (deriv f) (Set.Ici 0) volume\nl : 𝕜\nh_lim : Tendsto (fun n ↦ f ↑n * ∑ k ∈ Icc 0 n, c k) atTop (𝓝 l)\ng : ℝ → 𝕜\nhg_dom : (fun t ↦ deriv f t * ∑ k ∈ Icc 0 ⌊t⌋₊, c... | rw [← integral_of_le (Nat.cast_nonneg _)] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.NumberTheory.BernoulliPolynomials | {
"line": 214,
"column": 2
} | {
"line": 214,
"column": 13
} | [
{
"pp": "n : ℕ\nx : ℚ\nthis : (bernoulli n).comp (1 + X) = bernoulli n + n • X ^ (n - 1)\n⊢ eval (1 + x) (bernoulli n) = eval x (bernoulli n) + ↑n * x ^ (n - 1)",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.BernoulliPolynomials | {
"line": 237,
"column": 2
} | {
"line": 237,
"column": 23
} | [
{
"pp": "n : ℕ\nx : ℚ\n⊢ eval (-x) (bernoulli n) = (-1) ^ n * (eval x (bernoulli n) + ↑n * x ^ (n - 1))",
"usedConstants": [
"Rat.instOfNat",
"Distrib.leftDistribClass",
"Eq.mpr",
"Polynomial.eval",
"Rat.instMul",
"HMul.hMul",
"congrArg",
"Polynomial.bernoulli... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.BernoulliPolynomials | {
"line": 240,
"column": 59
} | {
"line": 247,
"column": 8
} | [
{
"pp": "n : ℕ\n⊢ (bernoulli n).comp (1 - X) = (-1) ^ n * bernoulli n",
"usedConstants": [
"Mathlib.Tactic.Ring.Common.mul_pf_left",
"NormedCommRing.toNormedRing",
"AddGroup.toSubtractionMonoid",
"Int.cast_neg",
"Int.cast",
"Mathlib.Tactic.Ring.Common.neg_zero",
"Eq... | by
cases n with
| zero => simp
| succ n =>
trans ((bernoulli (n + 1)).comp (1 + X)).comp (-X)
· simp [comp_assoc, sub_eq_add_neg]
simp [bernoulli_comp_one_add_X, bernoulli_comp_neg_X, neg_pow (X : Polynomial ℚ)]
ring | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.NumberTheory.BernoulliPolynomials | {
"line": 251,
"column": 2
} | {
"line": 251,
"column": 13
} | [
{
"pp": "n : ℕ\nx : ℚ\n⊢ eval (1 - x) (bernoulli n) = (-1) ^ n * eval x (bernoulli n)",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.AbelSummation | {
"line": 358,
"column": 8
} | {
"line": 364,
"column": 17
} | [
{
"pp": "case succ.calc_4\n𝕜 : Type u_1\ninst✝ : RCLike 𝕜\nc : ℕ → 𝕜\nf : ℝ → 𝕜\nm : ℕ\nh_bdd : (fun n ↦ ‖f ↑n‖ * ∑ k ∈ Icc 0 n, ‖c k‖) =O[atTop] fun x ↦ 1\nhf_int : LocallyIntegrableOn (deriv fun t ↦ ‖f t‖) (Set.Ici ↑m) volume\nhf :\n ∀ (n : ℕ),\n ∑ k ∈ Icc 0 n, ‖f ↑k‖ * ‖c k‖ =\n ‖f ↑n‖ * ∑ k ∈ I... | unfold C₂
grw [setIntegral_mono_set ?_ (.of_forall fun _ ↦ norm_nonneg _)
Set.Ioc_subset_Ioi_self.eventuallyLE]
rw [← integrableOn_Ici_iff_integrableOn_Ioi, IntegrableOn,
integrable_norm_iff (by fun_prop)]
exact (locallyIntegrableOn_mul_sum_Icc _ m.cast_nonneg hf_int).integra... | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.NumberTheory.AbelSummation | {
"line": 358,
"column": 8
} | {
"line": 364,
"column": 17
} | [
{
"pp": "case succ.calc_4\n𝕜 : Type u_1\ninst✝ : RCLike 𝕜\nc : ℕ → 𝕜\nf : ℝ → 𝕜\nm : ℕ\nh_bdd : (fun n ↦ ‖f ↑n‖ * ∑ k ∈ Icc 0 n, ‖c k‖) =O[atTop] fun x ↦ 1\nhf_int : LocallyIntegrableOn (deriv fun t ↦ ‖f t‖) (Set.Ici ↑m) volume\nhf :\n ∀ (n : ℕ),\n ∑ k ∈ Icc 0 n, ‖f ↑k‖ * ‖c k‖ =\n ‖f ↑n‖ * ∑ k ∈ I... | unfold C₂
grw [setIntegral_mono_set ?_ (.of_forall fun _ ↦ norm_nonneg _)
Set.Ioc_subset_Ioi_self.eventuallyLE]
rw [← integrableOn_Ici_iff_integrableOn_Ioi, IntegrableOn,
integrable_norm_iff (by fun_prop)]
exact (locallyIntegrableOn_mul_sum_Icc _ m.cast_nonneg hf_int).integra... | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.NumberTheory.Bernoulli | {
"line": 169,
"column": 4
} | {
"line": 169,
"column": 40
} | [
{
"pp": "A : Type u_1\ninst✝¹ : CommRing A\ninst✝ : Algebra ℚ A\nn : ℕ\nthis : ∑ p ∈ antidiagonal n, bernoulli' p.1 / ↑p.1! * ((↑p.2 + 1) * ↑p.2!)⁻¹ = (↑n !)⁻¹\n⊢ (coeff (n + 1, 0).1) (PowerSeries.mk fun n ↦ (algebraMap ℚ A) (bernoulli' n / ↑n !)) *\n (coeff (n + 1, 0).2) (exp A - 1) +\n ∑ p ∈ antid... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Bernoulli | {
"line": 187,
"column": 6
} | {
"line": 187,
"column": 20
} | [
{
"pp": "case inl.h\nn : ℕ\nh_odd : Odd n\nhlt : 1 < n\nB : ℚ⟦X⟧ := PowerSeries.mk fun n ↦ bernoulli' n / ↑n !\nthis : (B - evalNegHom B) * (exp ℚ - 1) = X * (exp ℚ - 1)\nh : (coeff n) (B - (rescale (-1)) B) = if n = 1 then 1 else 0\n⊢ -bernoulli' n = bernoulli' n",
"usedConstants": [
"NegZeroClass.to... | split_ifs at h | Mathlib.Tactic._aux_Mathlib_Tactic_SplitIfs___elabRules_Mathlib_Tactic_splitIfs_1 | Mathlib.Tactic.splitIfs |
Mathlib.NumberTheory.Bernoulli | {
"line": 188,
"column": 6
} | {
"line": 188,
"column": 41
} | [
{
"pp": "case inr\nn : ℕ\nh_odd : Odd n\nhlt : 1 < n\nB : ℚ⟦X⟧ := PowerSeries.mk fun n ↦ bernoulli' n / ↑n !\nthis : (B - evalNegHom B) * (exp ℚ - 1) = X * (exp ℚ - 1)\nh : ∀ (n : ℕ), (coeff n) (exp ℚ - 1) = (coeff n) 0\n⊢ bernoulli' n = 0",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Bernoulli | {
"line": 190,
"column": 4
} | {
"line": 190,
"column": 39
} | [
{
"pp": "n : ℕ\nh_odd : Odd n\nhlt : 1 < n\nB : ℚ⟦X⟧ := PowerSeries.mk fun n ↦ bernoulli' n / ↑n !\n⊢ B * (exp ℚ - 1) = X * exp ℚ",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Bernoulli | {
"line": 260,
"column": 2
} | {
"line": 260,
"column": 53
} | [
{
"pp": "case succ\nn : ℕ\nh₁ : (1, n) ∈ antidiagonal n.succ\nh₃ : (1 + n).choose n = n + 1\nH : ∑ k ∈ antidiagonal n.succ, ↑((k.1 + k.2).choose k.2) / (↑k.2 + 1) * bernoulli' k.1 = 1\n⊢ ∑ k ∈ antidiagonal (n + 1), ↑((k.1 + k.2).choose k.2) / (↑k.2 + 1) * bernoulli k.1 = 0",
"usedConstants": [
"Rat.ad... | rw [sum_eq_add_sum_diff_singleton_of_mem h₁] at H ⊢ | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.NumberTheory.ClassNumber.AdmissibleAbsoluteValue | {
"line": 99,
"column": 12
} | {
"line": 99,
"column": 58
} | [
{
"pp": "R : Type u_1\ninst✝ : EuclideanDomain R\nabv : AbsoluteValue R ℤ\nh : abv.IsAdmissible\nthis : DecidableEq R\nn : ℕ\nih :\n ∀ {ε : ℝ},\n 0 < ε →\n ∀ {b : R},\n b ≠ 0 →\n ∀ (A : Fin (h.card ε ^ n).succ → Fin n → R),\n ∃ i₀ i₁, i₀ ≠ i₁ ∧ ∀ (k : Fin n), ↑(abv (A i₁ k % ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Bertrand | {
"line": 151,
"column": 41
} | {
"line": 151,
"column": 80
} | [
{
"pp": "n : ℕ\nn_large : 2 < n\nno_prime : ∀ (p : ℕ), Nat.Prime p → n < p → 2 * n < p\nx : ℕ\nhx : x ≤ 2 * n\nh2x : 2 * n < 3 * x\n⊢ ¬Nat.Prime x ∨ x ≤ n",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.ClassNumber.AdmissibleAbsoluteValue | {
"line": 104,
"column": 6
} | {
"line": 104,
"column": 72
} | [
{
"pp": "case refine_1\nR : Type u_1\ninst✝ : EuclideanDomain R\nabv : AbsoluteValue R ℤ\nh✝ : abv.IsAdmissible\nthis✝ : DecidableEq R\nn : ℕ\nih :\n ∀ {ε : ℝ},\n 0 < ε →\n ∀ {b : R},\n b ≠ 0 →\n ∀ (A : Fin (h✝.card ε ^ n).succ → Fin n → R),\n ∃ i₀ i₁, i₀ ≠ i₁ ∧ ∀ (k : Fin n)... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Bernoulli | {
"line": 314,
"column": 29
} | {
"line": 314,
"column": 40
} | [
{
"pp": "n p : ℕ\nhne : ∀ (m : ℕ), ↑m ! ≠ 0\nq : ℕ\nf : ℕ → ℕ → ℚ := fun a b ↦ bernoulli a / ↑a ! * (coeff (b + 1)) (exp ℚ ^ n)\nm : ℕ\nh : m ∈ range q.succ\n⊢ m < q + 1",
"usedConstants": [
"Eq.mpr",
"Nat.instOne",
"PartialOrder.toPreorder",
"Preorder.toLE",
"SemilatticeInf.to... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Bernoulli | {
"line": 319,
"column": 83
} | {
"line": 319,
"column": 93
} | [
{
"pp": "case h\nn p : ℕ\nhne : ∀ (m : ℕ), ↑m ! ≠ 0\nq : ℕ\nf : ℕ → ℕ → ℚ := fun a b ↦ bernoulli a / ↑a ! * (coeff (b + 1)) (exp ℚ ^ n)\nm : ℕ\nh✝ : m ∈ range q.succ\nh : m < q + 1\n⊢ bernoulli m * ↑((q + 1)! / (m ! * (q + 1 - m)!)) * ↑n ^ (q + 1 - m) =\n bernoulli m * ↑q.succ ! / ↑m ! * (↑(q - m + 1)!)⁻¹ * ... | ← one_div, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.NumberTheory.ClassNumber.AdmissibleCardPowDegree | {
"line": 45,
"column": 4
} | {
"line": 45,
"column": 15
} | [
{
"pp": "Fq : Type u_1\ninst✝¹ : Fintype Fq\ninst✝ : Semiring Fq\nd m : ℕ\nhm : Fintype.card Fq ^ d ≤ m\nb : Fq[X]\nhb : b.natDegree ≤ d\nA : Fin m.succ → Fq[X]\nhA : ∀ (i : Fin m.succ), (A i).degree < b.degree\nf : Fin m.succ → Fin d → Fq := fun i j ↦ (A i).coeff ↑j\n⊢ Fintype.card (Fin d → Fq) < Fintype.card ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.ClassNumber.AdmissibleCardPowDegree | {
"line": 75,
"column": 4
} | {
"line": 75,
"column": 15
} | [
{
"pp": "Fq : Type u_1\ninst✝¹ : Fintype Fq\ninst✝ : Ring Fq\nd m : ℕ\nhm : Fintype.card Fq ^ d ≤ m\nb : Fq[X]\nA : Fin m.succ → Fq[X]\nhA : ∀ (i : Fin m.succ), (A i).degree < b.degree\nhb : b ≠ 0\nf : Fin m.succ → Fin d → Fq := fun i j ↦ (A i).coeff (b.natDegree - ↑j.succ)\n⊢ Fintype.card (Fin d → Fq) < Fintyp... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Bernoulli | {
"line": 335,
"column": 6
} | {
"line": 335,
"column": 17
} | [
{
"pp": "n p : ℕ\nhne : ∀ (m : ℕ), ↑m ! ≠ 0\nh_cauchy :\n ((PowerSeries.mk fun p ↦ bernoulli p / ↑p !) * PowerSeries.mk fun q ↦ (coeff (q + 1)) (exp ℚ ^ n)) =\n PowerSeries.mk fun p ↦ ∑ i ∈ range (p + 1), bernoulli i * ↑((p + 1).choose i) * ↑n ^ (p + 1 - i) / ↑(p + 1)!\nthis :\n ∀ (n_1 : ℕ),\n (coeff n_... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Chebyshev | {
"line": 90,
"column": 4
} | {
"line": 90,
"column": 15
} | [
{
"pp": "case refine_2\nx : ℝ\nhy : 2 ≤ x\nthis : 0 ≤ x\n⊢ 2 ∈ {p ∈ Ioc 0 ⌊x⌋₊ | Nat.Prime p}",
"usedConstants": [
"Real.instIsOrderedRing",
"Eq.mpr",
"Nat.instMulZeroClass",
"Real.partialOrder",
"Real",
"Finset.mem_filter._simp_1",
"Nat.Prime",
"Preorder.toLT... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Chebyshev | {
"line": 296,
"column": 4
} | {
"line": 296,
"column": 68
} | [
{
"pp": "case h\nn k : ℕ\nhk : k ∈ range (n + 1)\n⊢ n.choose k ≤ n.lcmUpto",
"usedConstants": [
"Nat.choose",
"Nat.lcmUpto_pos",
"Nat.lcmUpto",
"_private.Mathlib.NumberTheory.Chebyshev.0.Chebyshev.two_pow_le_mul_lcmUpto._proof_1_1",
"Chebyshev.choose_dvd_lcmUpto",
"Nat.le... | exact le_of_dvd (lcmUpto_pos n) (choose_dvd_lcmUpto <| by grind) | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.NumberTheory.ClassNumber.AdmissibleCardPowDegree | {
"line": 192,
"column": 6
} | {
"line": 192,
"column": 17
} | [
{
"pp": "case succ.refine_1.refine_1\nFq : Type u_1\ninst✝¹ : Fintype Fq\ninst✝ : Field Fq\nε : ℝ\nhε : 0 < ε\nb : Fq[X]\nhb : b ≠ 0\nhbε : 0 < cardPowDegree b • ε\nn : ℕ\nih :\n ∀ (A : Fin n → Fq[X]),\n ∃ t, ∀ (i₀ i₁ : Fin n), t i₀ = t i₁ ↔ ↑(cardPowDegree (A i₁ % b - A i₀ % b)) < cardPowDegree b • ε\nA : ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Chebyshev | {
"line": 361,
"column": 2
} | {
"line": 361,
"column": 21
} | [
{
"pp": "x : ℝ\n⊢ θ x ≤ ψ x",
"usedConstants": [
"Real.instLE",
"Real",
"Nat.instAtLeastTwoHAddOfNat",
"Real.decidableLT",
"Real.instLT",
"instOfNatNat",
"LE.le",
"dite",
"Chebyshev.psi",
"Chebyshev.theta",
"Nat.instNeZeroSucc",
"Nat",
... | by_cases! h : x < 2 | Mathlib.Tactic.ByCases._aux_Mathlib_Tactic_ByCases___macroRules_Mathlib_Tactic_ByCases_byCases!_1 | Mathlib.Tactic.ByCases.byCases! |
Mathlib.NumberTheory.ClassNumber.Finite | {
"line": 172,
"column": 4
} | {
"line": 175,
"column": 14
} | [
{
"pp": "case mp\nR : Type u_1\nS : Type u_2\ninst✝⁷ : EuclideanDomain R\ninst✝⁶ : CommRing S\ninst✝⁵ : IsDomain S\ninst✝⁴ : Algebra R S\nabv : AbsoluteValue R ℤ\nι : Type u_5\ninst✝³ : DecidableEq ι\ninst✝² : Fintype ι\nbS : Basis ι R S\nadm : abv.IsAdmissible\ninst✝¹ : Infinite R\ninst✝ : DecidableEq R\nx : R... | rintro ⟨hx, ⟨i, j⟩, _, rfl⟩
refine ⟨i, j, ?_, rfl⟩
rintro rfl
simp at hx | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.NumberTheory.ClassNumber.Finite | {
"line": 172,
"column": 4
} | {
"line": 175,
"column": 14
} | [
{
"pp": "case mp\nR : Type u_1\nS : Type u_2\ninst✝⁷ : EuclideanDomain R\ninst✝⁶ : CommRing S\ninst✝⁵ : IsDomain S\ninst✝⁴ : Algebra R S\nabv : AbsoluteValue R ℤ\nι : Type u_5\ninst✝³ : DecidableEq ι\ninst✝² : Fintype ι\nbS : Basis ι R S\nadm : abv.IsAdmissible\ninst✝¹ : Infinite R\ninst✝ : DecidableEq R\nx : R... | rintro ⟨hx, ⟨i, j⟩, _, rfl⟩
refine ⟨i, j, ?_, rfl⟩
rintro rfl
simp at hx | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.NumberTheory.Chebyshev | {
"line": 539,
"column": 46
} | {
"line": 539,
"column": 89
} | [
{
"pp": "x : ℝ\nhx : 2 ≤ x\na : ℕ → ℝ := (setOf Nat.Prime).indicator fun n ↦ 1\nf : ℝ → ℝ\nu : ℝ\nx✝ : u ∈ Set.uIcc 2 x\n⊢ deriv (fun x ↦ log x) u * f u = f u / u",
"usedConstants": [
"NonUnitalNonAssocCommRing.toNonUnitalNonAssocCommSemiring",
"Eq.mpr",
"Real",
"DivInvMonoid.toInv",... | by rw [deriv_log, mul_comm, div_eq_mul_inv] | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.NumberTheory.ClassNumber.Finite | {
"line": 220,
"column": 65
} | {
"line": 220,
"column": 88
} | [
{
"pp": "R : Type u_1\nS : Type u_2\ninst✝⁷ : EuclideanDomain R\ninst✝⁶ : CommRing S\ninst✝⁵ : IsDomain S\ninst✝⁴ : Algebra R S\nabv : AbsoluteValue R ℤ\nι : Type u_5\ninst✝³ : DecidableEq ι\ninst✝² : Fintype ι\nbS : Basis ι R S\nadm : abv.IsAdmissible\ninst✝¹ : Infinite R\ninst✝ : DecidableEq R\na : S\nb : R\n... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Bernoulli | {
"line": 639,
"column": 22
} | {
"line": 639,
"column": 33
} | [
{
"pp": "case h.e_a\nk p : ℕ\nhk : k > 0\ninst✝ : Fact (Nat.Prime p)\nhcast : ↑(∑ v ∈ Ico 1 p, ↑v ^ (2 * k) + if p - 1 ∣ 2 * k then 1 else 0) = 0\nT : ℤ\nhT_int : (∑ v ∈ Ico 1 p, ↑v ^ (2 * k) + if p - 1 ∣ 2 * k then 1 else 0) = ↑p * T\nhT : ∑ v ∈ Ico 1 p, ↑v ^ (2 * k) + vonStaudtIndicator (2 * k) p = ↑p * ↑T\nh... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Chebyshev | {
"line": 653,
"column": 7
} | {
"line": 653,
"column": 41
} | [
{
"pp": "case h\nε : ℝ\nεpos : 0 < ε\nthis✝ : ∀ᶠ (x : ℝ) in atTop, ‖∫ (t : ℝ) in 2..x, θ t / (t * log t ^ 2)‖ ≤ ε * ‖x / log x‖\nx : ℝ\nhx : 2 ≤ x\nhx2 : ‖∫ (t : ℝ) in 2..x, θ t / (t * log t ^ 2)‖ ≤ ε * x / log x\nthis : 0 ≤ log x\n⊢ θ x / log x + ∫ (t : ℝ) in 2..x, θ t / (t * log t ^ 2) ≤ log 4 * x / log x + ε... | theta_le_log4_mul_x (by linarith), | Mathlib.Tactic.evalGRewriteSeq | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.