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.RingTheory.Polynomial.Eisenstein.IsIntegral | {
"line": 371,
"column": 12
} | {
"line": 371,
"column": 23
} | [
{
"pp": "case zero\nR : Type u\nK : Type v\nL : Type z\np : R\ninst✝⁹ : CommRing R\ninst✝⁸ : Field K\ninst✝⁷ : Field L\ninst✝⁶ : Algebra K L\ninst✝⁵ : Algebra R L\ninst✝⁴ : Algebra R K\ninst✝³ : IsScalarTower R K L\ninst✝² : IsDomain R\ninst✝¹ : IsFractionRing R K\ninst✝ : IsIntegrallyClosed R\nB : PowerBasis K... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.DedekindDomain.Different | {
"line": 840,
"column": 6
} | {
"line": 840,
"column": 17
} | [
{
"pp": "case over.refine_1\nA : Type u_1\nB : Type u_3\ninst✝¹¹ : CommRing A\ninst✝¹⁰ : CommRing B\ninst✝⁹ : Algebra A B\ninst✝⁸ : IsDomain A\ninst✝⁷ : IsDedekindDomain A\ninst✝⁶ : IsDedekindDomain B\ninst✝⁵ : IsTorsionFree A B\ninst✝⁴ : Module.Finite A B\ninst✝³ : Algebra.IsSeparable (FractionRing A) (Fractio... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.DedekindDomain.Different | {
"line": 853,
"column": 4
} | {
"line": 853,
"column": 15
} | [
{
"pp": "case pos\nA : Type u_1\nB : Type u_3\ninst✝¹¹ : CommRing A\ninst✝¹⁰ : CommRing B\ninst✝⁹ : Algebra A B\ninst✝⁸ : IsDomain A\ninst✝⁷ : IsDedekindDomain A\ninst✝⁶ : IsDedekindDomain B\ninst✝⁵ : IsTorsionFree A B\ninst✝⁴ : Module.Finite A B\ninst✝³ : Algebra.IsSeparable (FractionRing A) (FractionRing B)\n... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.Fintype | {
"line": 66,
"column": 2
} | {
"line": 66,
"column": 45
} | [
{
"pp": "M₀ : Type u_1\ninst✝² : MonoidWithZero M₀\ninst✝¹ : Nontrivial M₀\ninst✝ : Finite M₀\nthis : Fintype M₀\n⊢ Nat.card M₀ˣ < Nat.card M₀",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.DedekindDomain.Different | {
"line": 859,
"column": 42
} | {
"line": 859,
"column": 59
} | [
{
"pp": "A : Type u_1\nB : Type u_3\ninst✝¹¹ : CommRing A\ninst✝¹⁰ : CommRing B\ninst✝⁹ : Algebra A B\ninst✝⁸ : IsDomain A\ninst✝⁷ : IsDedekindDomain A\ninst✝⁶ : IsDedekindDomain B\ninst✝⁵ : IsTorsionFree A B\ninst✝⁴ : Module.Finite A B\ninst✝³ : Algebra.IsSeparable (FractionRing A) (FractionRing B)\np : Ideal ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Cyclotomic.Basic | {
"line": 474,
"column": 55
} | {
"line": 474,
"column": 66
} | [
{
"pp": "p : ℕ\nK : Type u\ninst✝¹ : Field K\nζ : K\nhp : Fact (Nat.Prime p)\ninst✝ : CharZero K\nhcycl : IsCyclotomicExtension {p} ℚ K\nhζ : IsPrimitiveRoot ζ p\nhodd : p ≠ 2\n⊢ IsCyclotomicExtension {p ^ (0 + 1)} ℚ K",
"usedConstants": [
"Eq.mpr",
"CommRing",
"congrArg",
"CommSemir... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Cyclotomic.Basic | {
"line": 475,
"column": 53
} | {
"line": 475,
"column": 64
} | [
{
"pp": "p : ℕ\nK : Type u\ninst✝¹ : Field K\nζ : K\nhp : Fact (Nat.Prime p)\ninst✝ : CharZero K\nhcycl : IsCyclotomicExtension {p} ℚ K\nhζ : IsPrimitiveRoot ζ p\nhodd : p ≠ 2\nthis : IsCyclotomicExtension {p ^ (0 + 1)} ℚ K\n⊢ IsPrimitiveRoot ζ (p ^ (0 + 1))",
"usedConstants": [
"Eq.mpr",
"congr... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.DedekindDomain.Different | {
"line": 872,
"column": 49
} | {
"line": 872,
"column": 60
} | [
{
"pp": "A : Type u_1\nB : Type u_3\ninst✝¹¹ : CommRing A\ninst✝¹⁰ : CommRing B\ninst✝⁹ : Algebra A B\ninst✝⁸ : IsDomain A\ninst✝⁷ : IsDedekindDomain A\ninst✝⁶ : IsDedekindDomain B\ninst✝⁵ : IsTorsionFree A B\ninst✝⁴ : Module.Finite A B\ninst✝³ : Algebra.IsSeparable (FractionRing A) (FractionRing B)\np : Ideal ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Cyclotomic.Basic | {
"line": 490,
"column": 55
} | {
"line": 490,
"column": 66
} | [
{
"pp": "p : ℕ\nK : Type u\ninst✝¹ : Field K\nζ : K\nhp : Fact (Nat.Prime p)\ninst✝ : CharZero K\nhcycl : IsCyclotomicExtension {p} ℚ K\nhζ : IsPrimitiveRoot ζ p\n⊢ IsCyclotomicExtension {p ^ (0 + 1)} ℚ K",
"usedConstants": [
"Eq.mpr",
"CommRing",
"congrArg",
"CommSemiring.toSemiring... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Cyclotomic.Basic | {
"line": 491,
"column": 53
} | {
"line": 491,
"column": 64
} | [
{
"pp": "p : ℕ\nK : Type u\ninst✝¹ : Field K\nζ : K\nhp : Fact (Nat.Prime p)\ninst✝ : CharZero K\nhcycl : IsCyclotomicExtension {p} ℚ K\nhζ : IsPrimitiveRoot ζ p\nthis : IsCyclotomicExtension {p ^ (0 + 1)} ℚ K\n⊢ IsPrimitiveRoot ζ (p ^ (0 + 1))",
"usedConstants": [
"Eq.mpr",
"congrArg",
"N... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.DedekindDomain.Different | {
"line": 874,
"column": 59
} | {
"line": 874,
"column": 70
} | [
{
"pp": "A : Type u_1\nB : Type u_3\ninst✝¹¹ : CommRing A\ninst✝¹⁰ : CommRing B\ninst✝⁹ : Algebra A B\ninst✝⁸ : IsDomain A\ninst✝⁷ : IsDedekindDomain A\ninst✝⁶ : IsDedekindDomain B\ninst✝⁵ : IsTorsionFree A B\ninst✝⁴ : Module.Finite A B\ninst✝³ : Algebra.IsSeparable (FractionRing A) (FractionRing B)\np : Ideal ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Cyclotomic.Three | {
"line": 85,
"column": 22
} | {
"line": 85,
"column": 33
} | [
{
"pp": "K : Type u_1\ninst✝ : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\n⊢ (algebraMap (𝓞 K) K) ↑η ^ 2 + (algebraMap (𝓞 K) K) ↑η + 1 - 3 * (algebraMap (𝓞 K) K) ↑η =\n 0 - 3 * (algebraMap (𝓞 K) K) ↑η",
"usedConstants": [
"IsPrimitiveRoot.toInteger_isPrimitiveRoot",
"AddGroup.toSubtractionM... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.DedekindDomain.Different | {
"line": 875,
"column": 74
} | {
"line": 875,
"column": 85
} | [
{
"pp": "A : Type u_1\nB : Type u_3\ninst✝¹¹ : CommRing A\ninst✝¹⁰ : CommRing B\ninst✝⁹ : Algebra A B\ninst✝⁸ : IsDomain A\ninst✝⁷ : IsDedekindDomain A\ninst✝⁶ : IsDedekindDomain B\ninst✝⁵ : IsTorsionFree A B\ninst✝⁴ : Module.Finite A B\ninst✝³ : Algebra.IsSeparable (FractionRing A) (FractionRing B)\np : Ideal ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Cyclotomic.Three | {
"line": 91,
"column": 7
} | {
"line": 91,
"column": 18
} | [
{
"pp": "case h\nK : Type u_1\ninst✝ : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\n⊢ ↑(↑⋯.unit ^ 2 + ↑⋯.unit + 1) = ↑0",
"usedConstants": [
"IsPrimitiveRoot.toInteger_isPrimitiveRoot",
"AddGroup.toSubtractionMonoid",
"Units.val",
"Eq.mpr",
"NonAssocSemiring.toAddCommMonoidWithOne... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Cyclotomic.Basic | {
"line": 520,
"column": 55
} | {
"line": 520,
"column": 66
} | [
{
"pp": "p : ℕ\nK : Type u\ninst✝¹ : Field K\nζ : K\nhp : Fact (Nat.Prime p)\ninst✝ : CharZero K\nhcycl : IsCyclotomicExtension {p} ℚ K\nhζ : IsPrimitiveRoot ζ p\n⊢ IsCyclotomicExtension {p ^ (0 + 1)} ℚ K",
"usedConstants": [
"Eq.mpr",
"CommRing",
"congrArg",
"CommSemiring.toSemiring... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Cyclotomic.Basic | {
"line": 521,
"column": 53
} | {
"line": 521,
"column": 64
} | [
{
"pp": "p : ℕ\nK : Type u\ninst✝¹ : Field K\nζ : K\nhp : Fact (Nat.Prime p)\ninst✝ : CharZero K\nhcycl : IsCyclotomicExtension {p} ℚ K\nhζ : IsPrimitiveRoot ζ p\nthis : IsCyclotomicExtension {p ^ (0 + 1)} ℚ K\n⊢ IsPrimitiveRoot ζ (p ^ (0 + 1))",
"usedConstants": [
"Eq.mpr",
"congrArg",
"N... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Units.DirichletTheorem | {
"line": 419,
"column": 73
} | {
"line": 419,
"column": 84
} | [
{
"pp": "K : Type u_1\ninst✝¹ : Field K\ninst✝ : NumberField K\nx✝ : ↥(unitLattice K)\na : logSpace K\nb : Additive (𝓞 K)ˣ\nleft✝ : b ∈ ↑⊤\nha : (logEmbedding K).toIntLinearMap b = a\n⊢ ((logEmbeddingQuot K).codRestrict (unitLattice K) ⋯).toIntLinearMap ⟦b⟧ = ⟨a, ⋯⟩",
"usedConstants": [
"Eq.mpr",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.DedekindDomain.Different | {
"line": 943,
"column": 10
} | {
"line": 943,
"column": 40
} | [
{
"pp": "case inr.mp.right.hgt\nA : Type u_1\nB : Type u_3\ninst✝⁹ : CommRing A\ninst✝⁸ : CommRing B\ninst✝⁷ : Algebra A B\ninst✝⁶ : IsDomain A\ninst✝⁵ : IsDedekindDomain A\ninst✝⁴ : IsDedekindDomain B\ninst✝³ : IsTorsionFree A B\ninst✝² : Module.Finite A B\ninst✝¹ : Algebra.IsSeparable (FractionRing A) (Fracti... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Cyclotomic.Basic | {
"line": 637,
"column": 2
} | {
"line": 637,
"column": 53
} | [
{
"pp": "p k : ℕ\nK : Type u\ninst✝² : Field K\nhp : Fact (Nat.Prime p)\ninst✝¹ : CharZero K\ninst✝ : IsCyclotomicExtension {p ^ (k + 1)} ℚ K\n⊢ NumberField.discr K = (-1) ^ (p ^ k * (p - 1) / 2) * ↑p ^ (p ^ k * ((p - 1) * (k + 1) - 1))",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FactorisationProperties | {
"line": 132,
"column": 2
} | {
"line": 132,
"column": 13
} | [
{
"pp": "p : ℕ\nh : Prime p\ns : Finset ℕ\nhs : s ⊆ {1}\n⊢ ∑ i ∈ s, i ≤ 1",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FactorisationProperties | {
"line": 140,
"column": 4
} | {
"line": 140,
"column": 15
} | [
{
"pp": "case inl\nn : ℕ\nh : Prime n\n⊢ (n ^ 0).Deficient",
"usedConstants": [
"Eq.mpr",
"MulOne.toOne",
"Monoid.toMulOneClass",
"congrArg",
"Nat.instMonoid",
"id",
"instOfNatNat",
"pow_zero",
"Monoid.toPow",
"Nat.Deficient",
"MulOneClass.to... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Cyclotomic.Basic | {
"line": 674,
"column": 6
} | {
"line": 676,
"column": 13
} | [
{
"pp": "case e_a.e_a.prime_pow.succ\np : ℕ\nhp : Nat.Prime p\nK : Type u\ninst✝¹ : Field K\ninst✝ : CharZero K\nthis✝ : NumberField K\nthis : Fact (Nat.Prime p)\nk : ℕ\nhn : NeZero (p ^ (k + 1))\nhK : IsCyclotomicExtension {p ^ (k + 1)} ℚ K\n⊢ ((-1) ^ (φ (p ^ (k + 1)) / 2) * ↑p ^ (p ^ (k + 1 - 1) * ((p - 1) * ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FLT.Three | {
"line": 117,
"column": 4
} | {
"line": 117,
"column": 20
} | [
{
"pp": "case inr.inr\na b c : ℤ\nha : a ≠ 0\nh3a : 3 ∣ a\nHgcd : {a, b, c}.gcd id = 1\nH : ∀ (a b c : ℤ), c ≠ 0 → ¬3 ∣ a → ¬3 ∣ b → 3 ∣ c → IsCoprime a b → a ^ 3 + b ^ 3 ≠ c ^ 3\nHF : a ^ 3 + b ^ 3 + c ^ 3 = 0\nx : ℤ\nh3b : 3 ∣ b\nhx : x = c\n⊢ 3 ∣ id x",
"usedConstants": [
"Eq.mpr",
"Dvd.dvd",... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FLT.Three | {
"line": 177,
"column": 4
} | {
"line": 177,
"column": 15
} | [
{
"pp": "case refine_5\nK : Type u_1\ninst✝² : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\ninst✝¹ : NumberField K\ninst✝ : IsCyclotomicExtension {3} ℚ K\nH : FermatLastTheoremForThreeGen hζ\na b c : ℤ\nhc : c ≠ 0\nha : ¬3 ∣ a\nhb : ¬3 ∣ b\nx✝ : 3 ∣ c\nhcoprime : IsCoprime a b\nh : a ^ 3 + b ^ 3 = c ^ 3\nx : ℤ\nhx... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.NumberField.Cyclotomic.Three | {
"line": 191,
"column": 4
} | {
"line": 191,
"column": 29
} | [
{
"pp": "case h.e'_4\nK : Type u_1\ninst✝² : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\ninst✝¹ : NumberField K\ninst✝ : IsCyclotomicExtension {3} ℚ K\nx : 𝓞 K\nh : λ ∣ x + 1\n⊢ -x - 1 = -(x + 1)",
"usedConstants": [
"NegZeroClass.toNeg",
"NumberField.instCommRingRingOfIntegers",
"AddMonoid... | exact (neg_add' x 1).symm | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic | {
"line": 236,
"column": 6
} | {
"line": 236,
"column": 54
} | [
{
"pp": "case neg\nF : Type u_1\ninst✝² : Field F\ninst✝¹ : Fintype F\ninst✝ : DecidableEq F\nhF : ringChar F ≠ 2\na : F\nh₀ : ¬a = 0\ns : Finset F := {x | x ^ 2 = a}.toFinset\nh : ¬IsSquare a\n⊢ ∀ (x : F), x ∉ s",
"usedConstants": [
"Eq.mpr",
"Finset.mem_filter._simp_1",
"Finset.univ",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.LegendreSymbol.Basic | {
"line": 63,
"column": 25
} | {
"line": 63,
"column": 45
} | [
{
"pp": "p : ℕ\ninst✝ : Fact (Nat.Prime p)\na : ZMod p\nha : a ≠ 0\n⊢ Units.mk0 a ha ^ (p / 2) = 1 ↔ a ^ (p / 2) = 1",
"usedConstants": [
"MulOne.toOne",
"instHDiv",
"Monoid.toMulOneClass",
"congrArg",
"AddGroupWithOne.toAddMonoidWithOne",
"DivisionSemiring.toGroupWithZer... | simp [Units.ext_iff] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.NumberTheory.LegendreSymbol.Basic | {
"line": 63,
"column": 25
} | {
"line": 63,
"column": 45
} | [
{
"pp": "p : ℕ\ninst✝ : Fact (Nat.Prime p)\na : ZMod p\nha : a ≠ 0\n⊢ Units.mk0 a ha ^ (p / 2) = 1 ↔ a ^ (p / 2) = 1",
"usedConstants": [
"MulOne.toOne",
"instHDiv",
"Monoid.toMulOneClass",
"congrArg",
"AddGroupWithOne.toAddMonoidWithOne",
"DivisionSemiring.toGroupWithZer... | simp [Units.ext_iff] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.NumberTheory.LegendreSymbol.Basic | {
"line": 63,
"column": 25
} | {
"line": 63,
"column": 45
} | [
{
"pp": "p : ℕ\ninst✝ : Fact (Nat.Prime p)\na : ZMod p\nha : a ≠ 0\n⊢ Units.mk0 a ha ^ (p / 2) = 1 ↔ a ^ (p / 2) = 1",
"usedConstants": [
"MulOne.toOne",
"instHDiv",
"Monoid.toMulOneClass",
"congrArg",
"AddGroupWithOne.toAddMonoidWithOne",
"DivisionSemiring.toGroupWithZer... | simp [Units.ext_iff] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.NumberTheory.LegendreSymbol.Basic | {
"line": 119,
"column": 6
} | {
"line": 120,
"column": 75
} | [
{
"pp": "case pos\np : ℕ\ninst✝ : Fact (Nat.Prime p)\na : ℤ\nhc : ringChar (ZMod p) = 2\nha : ↑a = 0\n⊢ ↑(legendreSym p a) = ↑a ^ (p / 2)",
"usedConstants": [
"Int.cast",
"Eq.mpr",
"Nat.Prime",
"instHDiv",
"legendreSym._proof_1",
"congrArg",
"ZMod.fintype",
"Z... | rw [legendreSym, ha, quadraticChar_zero,
zero_pow (Nat.div_pos (@Fact.out p.Prime).two_le (succ_pos 1)).ne'] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.NumberTheory.LegendreSymbol.QuadraticReciprocity | {
"line": 129,
"column": 4
} | {
"line": 129,
"column": 67
} | [
{
"pp": "case inr\np q : ℕ\ninst✝¹ : Fact (Nat.Prime p)\ninst✝ : Fact (Nat.Prime q)\nhp : p ≠ 2\nhq : q ≠ 2\nh : p ≠ q\nqr :\n (fun x ↦ x * legendreSym p ↑q) (legendreSym q ↑p * legendreSym p ↑q) =\n (fun x ↦ x * legendreSym p ↑q) ((-1) ^ (p / 2 * (q / 2)))\nthis : ↑↑q ≠ 0\n⊢ legendreSym q ↑p = (-1) ^ (p / ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FLT.Three | {
"line": 288,
"column": 2
} | {
"line": 288,
"column": 38
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\nS' : Solution' hζ\ninst✝¹ : NumberField K\ninst✝ : IsCyclotomicExtension {3} ℚ K\n⊢ 2 ≤ S'.multiplicity",
"usedConstants": [
"id",
"instOfNatNat",
"LE.le",
"instLENat",
"Nat",
"_private.Mathlib.Numb... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FLT.Three | {
"line": 306,
"column": 32
} | {
"line": 306,
"column": 49
} | [
{
"pp": "K : Type u_1\ninst✝ : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\nS' : Solution' hζ\n⊢ S'.a ^ 3 + S'.a ^ 2 * S'.b * (↑η ^ 2 + ↑η + 1) + S'.a * S'.b ^ 2 * (↑η ^ 2 + ↑η + 1) + S'.b ^ 3 = S'.a ^ 3 + S'.b ^ 3",
"usedConstants": [
"IsPrimitiveRoot.toInteger_isPrimitiveRoot",
"Mathlib.Tactic.Ri... | rw [eta_sq]; ring | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.NumberTheory.FLT.Three | {
"line": 306,
"column": 32
} | {
"line": 306,
"column": 49
} | [
{
"pp": "K : Type u_1\ninst✝ : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\nS' : Solution' hζ\n⊢ S'.a ^ 3 + S'.a ^ 2 * S'.b * (↑η ^ 2 + ↑η + 1) + S'.a * S'.b ^ 2 * (↑η ^ 2 + ↑η + 1) + S'.b ^ 3 = S'.a ^ 3 + S'.b ^ 3",
"usedConstants": [
"IsPrimitiveRoot.toInteger_isPrimitiveRoot",
"Mathlib.Tactic.Ri... | rw [eta_sq]; ring | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.GaussSum | {
"line": 85,
"column": 4
} | {
"line": 85,
"column": 87
} | [
{
"pp": "F : Type u_1\ninst✝⁵ : Field F\ninst✝⁴ : Fintype F\ninst✝³ : DecidableEq F\nhF : ringChar F ≠ 2\nF' : Type u_2\ninst✝² : Field F'\ninst✝¹ : Fintype F'\ninst✝ : DecidableEq F'\nhF' : ringChar F' ≠ 2\nh : ringChar F' ≠ ringChar F\nχ : MulChar F F' := (quadraticChar F).ringHomComp (algebraMap ℤ F')\na : F... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.Ideal.NatInt | {
"line": 63,
"column": 4
} | {
"line": 63,
"column": 46
} | [
{
"pp": "case refine_1.inr.inl\n⊢ (maximalIdeal ℕ).IsPrime",
"usedConstants": [
"IsLocalRing.maximalIdeal",
"Ideal.IsMaximal.isPrime",
"instIsLocalRingNat",
"IsLocalRing.maximalIdeal.isMaximal",
"Nat",
"Nat.instCommSemiring"
]
},
{
"pp": "case refine_1.inr.inr... | · exact (maximalIdeal.isMaximal ℕ).isPrime | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.NumberTheory.Fermat | {
"line": 105,
"column": 4
} | {
"line": 105,
"column": 35
} | [
{
"pp": "case inr\nm n : ℕ\nhmn : m ≠ n\nthis : ∀ {m n : ℕ}, m ≠ n → m < n → m.fermatNumber.Coprime n.fermatNumber\nhmn' : ¬m < n\n⊢ m.fermatNumber.Coprime n.fermatNumber",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FLT.Three | {
"line": 385,
"column": 65
} | {
"line": 388,
"column": 22
} | [
{
"pp": "K : Type u_1\ninst✝ : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\nS : Solution hζ\n⊢ λ ∣ S.a + ↑η ^ 2 * S.b",
"usedConstants": [
"IsPrimitiveRoot.toInteger_isPrimitiveRoot",
"Mathlib.Tactic.Ring.Common.mul_pf_left",
"_private.Mathlib.NumberTheory.FLT.Three.0.FermatLastTheoremForThre... | by
rw [show S.a + η ^ 2 * S.b = (S.a + S.b) + λ ^ 2 * S.b + 2 * λ * S.b by rw [coe_eta]; ring]
exact dvd_add (dvd_add (dvd_trans (dvd_pow_self _ (by decide)) S.hab) ⟨λ * S.b, by ring⟩)
⟨2 * S.b, by ring⟩ | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.NumberTheory.FermatPsp | {
"line": 138,
"column": 50
} | {
"line": 138,
"column": 61
} | [
{
"pp": "a b : ℕ\nha : 2 ≤ a\nhb : 2 < b\n⊢ 1 < a ^ 1",
"usedConstants": [
"Eq.mpr",
"Preorder.toLT",
"congrArg",
"Nat.instMonoid",
"id",
"instOfNatNat",
"Monoid.toPow",
"HPow.hPow",
"Nat.instPreorder",
"pow_one",
"Nat",
"LT.lt",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FermatPsp | {
"line": 145,
"column": 20
} | {
"line": 145,
"column": 41
} | [
{
"pp": "a b : ℕ\nha : 2 ≤ a\nhb : 2 < b\n⊢ a ^ 2 * a = a ^ 3",
"usedConstants": [
"instPowNat",
"Eq.mpr",
"HMul.hMul",
"congrArg",
"Nat.instMonoid",
"Nat.pow_succ",
"id",
"instMulNat",
"instOfNatNat",
"Monoid.toPow",
"instNatPowNat",
"... | rw [Nat.pow_succ a 2] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.NumberTheory.FermatPsp | {
"line": 145,
"column": 20
} | {
"line": 145,
"column": 41
} | [
{
"pp": "a b : ℕ\nha : 2 ≤ a\nhb : 2 < b\n⊢ a ^ 2 * a = a ^ 3",
"usedConstants": [
"instPowNat",
"Eq.mpr",
"HMul.hMul",
"congrArg",
"Nat.instMonoid",
"Nat.pow_succ",
"id",
"instMulNat",
"instOfNatNat",
"Monoid.toPow",
"instNatPowNat",
"... | rw [Nat.pow_succ a 2] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.NumberTheory.FermatPsp | {
"line": 145,
"column": 20
} | {
"line": 145,
"column": 41
} | [
{
"pp": "a b : ℕ\nha : 2 ≤ a\nhb : 2 < b\n⊢ a ^ 2 * a = a ^ 3",
"usedConstants": [
"instPowNat",
"Eq.mpr",
"HMul.hMul",
"congrArg",
"Nat.instMonoid",
"Nat.pow_succ",
"id",
"instMulNat",
"instOfNatNat",
"Monoid.toPow",
"instNatPowNat",
"... | rw [Nat.pow_succ a 2] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.NumberTheory.FermatPsp | {
"line": 150,
"column": 36
} | {
"line": 150,
"column": 62
} | [
{
"pp": "b p : ℕ\nx✝ : 2 ≤ b\nhp : Odd p\n⊢ b - 1 ∣ b ^ p - 1",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FermatPsp | {
"line": 151,
"column": 36
} | {
"line": 151,
"column": 62
} | [
{
"pp": "b p : ℕ\nx✝ : 2 ≤ b\nhp : Odd p\nq₁ : b - 1 ∣ b ^ p - 1\n⊢ b + 1 ∣ b ^ p + 1",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Fermat | {
"line": 170,
"column": 2
} | {
"line": 170,
"column": 70
} | [
{
"pp": "a n p : ℕ\nhp : Prime p\nhp2 : p ≠ 2\nhpdvd : p ∣ a ^ 2 ^ n + 1\nthis✝ : Fact (2 < p)\nthis : Fact (Prime p)\nha1 : ↑a ^ 2 ^ n = -1\nha0 : ↑a ≠ 0\nha : orderOf ↑a = 2 ^ (n + 1)\n⊢ ∃ k, p = k * 2 ^ (n + 1) + 1",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FermatPsp | {
"line": 215,
"column": 4
} | {
"line": 215,
"column": 39
} | [
{
"pp": "b : ℕ\nb_ge_two : 2 ≤ b\np : ℕ\np_prime : Prime p\np_gt_two : 2 < p\nnot_dvd : ¬p ∣ b * (b ^ 2 - 1)\nA : ℕ := (b ^ p - 1) / (b - 1)\nB : ℕ := (b ^ p + 1) / (b + 1)\nhA : p < A\nhi_A : 1 < A\nhi_B : 1 < B\nhi_b : 0 < b\nhi_bsquared : 0 < b ^ 2 - 1\nhi_bpowtwop : 1 ≤ b ^ (2 * p)\nhi_bpowpsubone : 1 ≤ b ^... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FermatPsp | {
"line": 248,
"column": 6
} | {
"line": 248,
"column": 32
} | [
{
"pp": "b : ℕ\nb_ge_two : 2 ≤ b\np : ℕ\np_prime : Prime p\np_gt_two : 2 < p\nnot_dvd : ¬p ∣ b * (b ^ 2 - 1)\nA : ℕ := (b ^ p - 1) / (b - 1)\nB : ℕ := (b ^ p + 1) / (b + 1)\nhA : p < A\nhi_A : 1 < A\nhi_B : 1 < B\nhi_b : 0 < b\nhi_bsquared : 0 < b ^ 2 - 1\nhi_bpowtwop : 1 ≤ b ^ (2 * p)\nhi_bpowpsubone : 1 ≤ b ^... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FermatPsp | {
"line": 276,
"column": 4
} | {
"line": 276,
"column": 86
} | [
{
"pp": "case h\nb : ℕ\nb_ge_two : 2 ≤ b\np : ℕ\np_prime : Prime p\np_gt_two : 2 < p\nnot_dvd : ¬p ∣ b * (b ^ 2 - 1)\nA : ℕ := (b ^ p - 1) / (b - 1)\nB : ℕ := (b ^ p + 1) / (b + 1)\nhA : p < A\nhi_A : 1 < A\nhi_B : 1 < B\nhi_b : 0 < b\nhi_bsquared : 0 < b ^ 2 - 1\nhi_bpowtwop : 1 ≤ b ^ (2 * p)\nhi_bpowpsubone :... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FermatPsp | {
"line": 282,
"column": 4
} | {
"line": 282,
"column": 43
} | [
{
"pp": "b : ℕ\nb_ge_two : 2 ≤ b\np : ℕ\np_prime : Prime p\np_gt_two : 2 < p\nnot_dvd : ¬p ∣ b * (b ^ 2 - 1)\nA : ℕ := (b ^ p - 1) / (b - 1)\nB : ℕ := (b ^ p + 1) / (b + 1)\nhA : p < A\nhi_A : 1 < A\nhi_B : 1 < B\nhi_b : 0 < b\nhi_bsquared : 0 < b ^ 2 - 1\nhi_bpowtwop : 1 ≤ b ^ (2 * p)\nhi_bpowpsubone : 1 ≤ b ^... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FrobeniusNumber | {
"line": 142,
"column": 28
} | {
"line": 142,
"column": 63
} | [
{
"pp": "s : Set ℕ\nh0 : ¬setGcd s = 0\nt : Finset ℕ\nhts : ↑t ⊆ s\na : ↥t → ℤ\neq : ∑ i, a i • ↑↑i = ↑(setGcd s)\nx : ℕ\nhxs : x ∈ s\nhx : x ≠ 0\nn : ℕ := x / setGcd s * ∑ i, (-a i).toNat * ↑i\n⊢ ↑(insert x t) ⊆ s",
"usedConstants": [
"Eq.mpr",
"congrArg",
"Finset",
"Membership.mem"... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FLT.Three | {
"line": 488,
"column": 4
} | {
"line": 488,
"column": 86
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\nS : Solution hζ\ninst✝¹ : NumberField K\ninst✝ : IsCyclotomicExtension {3} ℚ K\nh : λ ^ (3 * S.multiplicity - 2) * λ * λ ∣ (S.a + S.b) * (λ * S.y) * (λ * S.z)\nthis : 2 ≤ S.multiplicity\n⊢ λ ^ (3 * S.multiplicity - 2) ∣ S.y * (S.z * (S.a ... | show (S.a + S.b) * (λ * y S) * (λ * z S) = (S.a + S.b) * y S * z S * λ * λ by ring | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.NumberTheory.FrobeniusNumber | {
"line": 188,
"column": 6
} | {
"line": 188,
"column": 17
} | [
{
"pp": "case refine_1\nm n✝¹ : ℕ\ns✝ t✝ : Set ℕ\nn✝ : ℕ\ns : Submodule ℕ ℕ\nt : Finset ℕ\nn : ℕ\nhts : ↑t ⊆ ↑s\nhn : ∀ m ≥ n, setGcd ↑s ∣ m → m ∈ Ideal.span ↑t\n⊢ ↑(t ∪ {m ∈ Finset.range n | m ∈ s}) ⊆ ↑s",
"usedConstants": [
"Eq.mpr",
"Submodule",
"Finset.mem_range._simp_1",
"Semiri... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FrobeniusNumber | {
"line": 191,
"column": 38
} | {
"line": 191,
"column": 49
} | [
{
"pp": "m✝ n✝¹ : ℕ\ns✝ t✝ : Set ℕ\nn✝ : ℕ\ns : Submodule ℕ ℕ\nt : Finset ℕ\nn : ℕ\nhts : ↑t ⊆ ↑s\nhn : ∀ m ≥ n, setGcd ↑s ∣ m → m ∈ Ideal.span ↑t\nm : ℕ\nhm : m ∈ s\ngt : m < n\n⊢ m ∈ ↑(t ∪ {m ∈ Finset.range n | m ∈ s})",
"usedConstants": [
"Eq.mpr",
"Submodule",
"SetLike.mem_coe._simp_1"... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FLT.Three | {
"line": 550,
"column": 2
} | {
"line": 564,
"column": 6
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\nS : Solution hζ\ninst✝¹ : NumberField K\ninst✝ : IsCyclotomicExtension {3} ℚ K\n⊢ S.x * S.y * S.z = ↑S.u * S.w ^ 3",
"usedConstants": [
"IsPrimitiveRoot.toInteger_isPrimitiveRoot",
"Mathlib.Tactic.Ring.Common.mul_pf_left",... | suffices hh : λ ^ (3 * S.multiplicity - 2) * S.x * λ * S.y * λ * S.z =
S.u * λ ^ (3 * S.multiplicity) * S.w ^ 3 by
rw [show λ ^ (3 * multiplicity S - 2) * x S * λ * y S * λ * z S =
λ ^ (3 * multiplicity S - 2) * λ * λ * x S * y S * z S by ring] at hh
have := S.two_le_multiplicity
rw [mul_comm _ ... | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.NumberTheory.FLT.Three | {
"line": 550,
"column": 2
} | {
"line": 564,
"column": 6
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\nS : Solution hζ\ninst✝¹ : NumberField K\ninst✝ : IsCyclotomicExtension {3} ℚ K\n⊢ S.x * S.y * S.z = ↑S.u * S.w ^ 3",
"usedConstants": [
"IsPrimitiveRoot.toInteger_isPrimitiveRoot",
"Mathlib.Tactic.Ring.Common.mul_pf_left",... | suffices hh : λ ^ (3 * S.multiplicity - 2) * S.x * λ * S.y * λ * S.z =
S.u * λ ^ (3 * S.multiplicity) * S.w ^ 3 by
rw [show λ ^ (3 * multiplicity S - 2) * x S * λ * y S * λ * z S =
λ ^ (3 * multiplicity S - 2) * λ * λ * x S * y S * z S by ring] at hh
have := S.two_le_multiplicity
rw [mul_comm _ ... | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.NumberTheory.FLT.Three | {
"line": 622,
"column": 14
} | {
"line": 622,
"column": 31
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\nS : Solution hζ\ninst✝¹ : NumberField K\ninst✝ : IsCyclotomicExtension {3} ℚ K\n⊢ S.a + S.b + ↑η ^ 2 * S.b - S.a + ↑η ^ 2 * S.b + 2 * ↑η * S.b + S.b = 0",
"usedConstants": [
"IsPrimitiveRoot.toInteger_isPrimitiveRoot",
"Ma... | rw [eta_sq]; ring | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.NumberTheory.FLT.Three | {
"line": 622,
"column": 14
} | {
"line": 622,
"column": 31
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\nS : Solution hζ\ninst✝¹ : NumberField K\ninst✝ : IsCyclotomicExtension {3} ℚ K\n⊢ S.a + S.b + ↑η ^ 2 * S.b - S.a + ↑η ^ 2 * S.b + 2 * ↑η * S.b + S.b = 0",
"usedConstants": [
"IsPrimitiveRoot.toInteger_isPrimitiveRoot",
"Ma... | rw [eta_sq]; ring | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.NumberTheory.FLT.Three | {
"line": 708,
"column": 34
} | {
"line": 708,
"column": 78
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\nS : Solution hζ\nS' : Solution' hζ\ninst✝¹ : NumberField K\ninst✝ : IsCyclotomicExtension {3} ℚ K\nh : λ ^ (S.multiplicity - 1) * S.X = 0\n⊢ S.X = 0",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.FLT.Three | {
"line": 713,
"column": 4
} | {
"line": 713,
"column": 19
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\nζ : K\nhζ : IsPrimitiveRoot ζ 3\nS : Solution hζ\nS' : Solution' hζ\ninst✝¹ : NumberField K\ninst✝ : IsCyclotomicExtension {3} ℚ K\nh : S.multiplicity = 1\n⊢ False",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.NumberField | {
"line": 52,
"column": 2
} | {
"line": 53,
"column": 54
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\ninst✝¹ : NumberField K\ninst✝ : DecidableEq (AbsoluteValue K ℝ)\nv : InfinitePlace K\nthis : DecidableEq (InfinitePlace K)\n⊢ Multiset.count (↑v) (multisetInfinitePlace K) = v.mult",
"usedConstants": [
"Multiset.sum",
"Eq.mpr",
"Real.partialOrder",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.NumberField | {
"line": 68,
"column": 53
} | {
"line": 68,
"column": 64
} | [
{
"pp": "K : Type u_1\ninst✝¹ : Field K\ninst✝ : NumberField K\nv : AbsoluteValue K ℝ\nhv : v ∈ {v | IsFinitePlace v}\n⊢ ∃ v_1, place (FinitePlace.embedding v_1) = v",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.NumberField | {
"line": 137,
"column": 2
} | {
"line": 138,
"column": 9
} | [
{
"pp": "K : Type u_1\ninst✝¹ : Field K\ninst✝ : NumberField K\nthis : Inhabited (InfinitePlace K)\n⊢ 0 < totalWeight K",
"usedConstants": [
"Multiset.sum",
"Eq.mpr",
"Real.partialOrder",
"Real",
"Finset.univ",
"Multiset.map",
"congrArg",
"Multiset.card_replic... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.NumberField | {
"line": 209,
"column": 4
} | {
"line": 209,
"column": 23
} | [
{
"pp": "ι : Type u_1\ninst✝¹ : Fintype ι\ninst✝ : Nonempty ι\nx : ι → ℤ\nhx : Finset.univ.gcd x = 1\nhx₀ : Int.cast ∘ x ≠ 0\n⊢ (∏ v, (⨆ i, v ((Int.cast ∘ x) i)) ^ v.mult) * ∏ᶠ (v : FinitePlace ℚ), ⨆ i, v ((Int.cast ∘ x) i) = ⨆ i, ↑|x i|",
"usedConstants": [
"Int.cast",
"NumberField.InfinitePlac... | infinitePlace_apply | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.NumberTheory.Height.NumberField | {
"line": 234,
"column": 4
} | {
"line": 234,
"column": 84
} | [
{
"pp": "q : ℚ\n⊢ Finset.univ.gcd ![q.num, ↑q.den] = 1",
"usedConstants": [
"Int.gcd",
"Eq.mpr",
"Rat.num",
"Finset.univ",
"congrArg",
"Finset",
"instDecidableEqFin",
"AddGroupWithOne.toAddMonoidWithOne",
"MonoidWithZeroHom.funLike",
"CommSemiring.... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Harmonic.ZetaAsymp | {
"line": 207,
"column": 2
} | {
"line": 207,
"column": 19
} | [
{
"pp": "case ha\ns : ℝ\nhs : 1 < s\n⊢ Tendsto\n (fun N ↦\n 1 / (s - 1) * (1 - 1 / (↑N + 1) ^ (s - 1)) - 1 / s * (∑ n ∈ Finset.range N, 1 / (↑n + 1) ^ s - ↑N / (↑N + 1) ^ s))\n atTop (𝓝 (1 / (s - 1) - 1 / s * ∑' (n : ℕ), 1 / (↑n + 1) ^ s))",
"usedConstants": [
"Real.instPow",
"Real",... | apply Tendsto.sub | Lean.Elab.Tactic.evalApply | Lean.Parser.Tactic.apply |
Mathlib.NumberTheory.Height.Basic | {
"line": 354,
"column": 4
} | {
"line": 354,
"column": 15
} | [
{
"pp": "case inr.refine_1\nK : Type u_1\ninst✝² : Field K\ninst✝¹ : AdmissibleAbsValues K\nι : Type u_2\ninst✝ : Finite ι\nx : ι → K\nhx : x ≠ 0\ni : ι\nhi : x i ≠ 0\nhx' : (x i)⁻¹ • x ≠ 0\nv : AbsoluteValue K ℝ\nx✝ : v ∈ archAbsVal\n⊢ 1 = v (((x i)⁻¹ • x) i)",
"usedConstants": [
"Eq.mpr",
"Mul... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.Basic | {
"line": 371,
"column": 4
} | {
"line": 371,
"column": 20
} | [
{
"pp": "case inl\nK : Type u_1\ninst✝³ : Field K\ninst✝² : AdmissibleAbsValues K\nι : Type u_2\nι' : Type u_3\ninst✝¹ : Finite ι\ninst✝ : Finite ι'\nf : ι → ι'\nx : ι' → K\nh₀ : x ∘ f = 0\n⊢ mulHeight (x ∘ f) ≤ mulHeight x",
"usedConstants": [
"Eq.mpr",
"Real.instLE",
"Real",
"congr... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.Projectivization | {
"line": 34,
"column": 4
} | {
"line": 34,
"column": 19
} | [
{
"pp": "K : Type u_1\ninst✝² : Field K\ninst✝¹ : AdmissibleAbsValues K\nι : Type u_2\ninst✝ : Finite ι\na b : { v // v ≠ 0 }\nt : K\nh : t = 0\n⊢ ↑a ≠ t • ↑b",
"usedConstants": [
"Eq.mpr",
"instHSMul",
"instSMulOfMul",
"congrArg",
"Pi.smulWithZero",
"id",
"Function... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.Basic | {
"line": 390,
"column": 2
} | {
"line": 390,
"column": 42
} | [
{
"pp": "K : Type u_1\ninst✝³ : Field K\ninst✝² : AdmissibleAbsValues K\nι : Type u_2\nι' : Type u_3\ninst✝¹ : Finite ι\ninst✝ : Finite ι'\nf : ι → ι'\nx : ι' → K\n⊢ logHeight (x ∘ f) ≤ logHeight x",
"usedConstants": [
"Real.instLE",
"Real",
"Function.comp",
"id",
"LE.le",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.Basic | {
"line": 399,
"column": 67
} | {
"line": 399,
"column": 78
} | [
{
"pp": "K : Type u_1\ninst✝³ : Field K\ninst✝² : AdmissibleAbsValues K\nι : Type u_2\nι' : Type u_3\ninst✝¹ : Finite ι\ninst✝ : Finite ι'\nx : ι → K\nhx : x ≠ 0\ni : ι\nhi : x i ≠ 0 i\nthis : Nonempty ι\n⊢ Sum.elim x 0 (Sum.inl i) ≠ 0 (Sum.inl i)",
"usedConstants": [
"Sum",
"id",
"Pi.inst... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.Basic | {
"line": 406,
"column": 15
} | {
"line": 406,
"column": 26
} | [
{
"pp": "case inr\nK : Type u_1\ninst✝³ : Field K\ninst✝² : AdmissibleAbsValues K\nι : Type u_2\nι' : Type u_3\ninst✝¹ : Finite ι\ninst✝ : Finite ι'\nx : ι → K\nhx : x ≠ 0\ni : ι\nhi : x i ≠ 0 i\nthis : Nonempty ι\nhx' : Sum.elim x 0 ≠ 0\nv : AbsoluteValue K ℝ\nval✝ : ι'\n⊢ v (Sum.elim x 0 (Sum.inr val✝)) ≤ ⨆ i... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Harmonic.ZetaAsymp | {
"line": 298,
"column": 50
} | {
"line": 298,
"column": 61
} | [
{
"pp": "this : Tendsto (fun s ↦ ∑' (n : ℕ), 1 / (↑n + 1) ^ s - 1 / (s - 1)) (𝓝[>] 1) (𝓝 γ)\ns : ℝ\nhs : s ∈ Ioi 1\n⊢ 1 < (↑s).re",
"usedConstants": [
"Real",
"Real.instLT",
"id",
"Complex.ofReal",
"Complex.re",
"Real.instOne",
"LT.lt",
"One.toOfNat1",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.Basic | {
"line": 442,
"column": 2
} | {
"line": 442,
"column": 37
} | [
{
"pp": "case h.e'_2.h.e'_5.h\nK : Type u_1\ninst✝² : Field K\ninst✝¹ : AdmissibleAbsValues K\nι : Type u_5\ninst✝ : Subsingleton ι\nx : ι → K\nhx : x ≠ 0\ni : ι\nhi : x i ≠ 0 i\nthis : Nonempty ι\nj : ι\n⊢ ((x i)⁻¹ • x) j = 1 j",
"usedConstants": [
"Eq.mpr",
"DivInvMonoid.toInv",
"instHSM... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Harmonic.ZetaAsymp | {
"line": 306,
"column": 4
} | {
"line": 306,
"column": 27
} | [
{
"pp": "aux2 : Tendsto (fun s ↦ ∑' (n : ℕ), 1 / (↑n + 1) ^ s - 1 / (s - 1)) (𝓝[>] 1) (𝓝 (1 - term_tsum 1))\nthis : γ = 1 - term_tsum 1\n⊢ Tendsto (fun s ↦ ∑' (n : ℕ), 1 / (↑n + 1) ^ s - 1 / (s - 1)) (𝓝[>] 1) (𝓝 γ)",
"usedConstants": [
"Eq.mpr",
"Real.instPow",
"Real",
"Set.Ioi",... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.Basic | {
"line": 555,
"column": 4
} | {
"line": 555,
"column": 22
} | [
{
"pp": "K : Type u_1\ninst✝¹ : Field K\ninst✝ : AdmissibleAbsValues K\nx✝ : K\nv : AbsoluteValue K ℝ\nx : K\nthis : ∀ (i : Fin 2), v (![x, 1] i) = ![v x, 1] i\n⊢ max (v x) 1 = ⨆ i, v (![x, 1] i)",
"usedConstants": [
"Eq.mpr",
"Real.partialOrder",
"Real",
"congrArg",
"iSup",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.Basic | {
"line": 557,
"column": 2
} | {
"line": 557,
"column": 47
} | [
{
"pp": "K : Type u_1\ninst✝¹ : Field K\ninst✝ : AdmissibleAbsValues K\nx : K\nH : ∀ (v : AbsoluteValue K ℝ) (x : K), max (v x) 1 = ⨆ i, v (![x, 1] i)\nhx : ![x, 1] ≠ 0\n⊢ mulHeight₁ x = mulHeight ![x, 1]",
"usedConstants": [
"Real.partialOrder",
"Real",
"HMul.hMul",
"Multiset.map",
... | simp only [mulHeight₁_eq, mulHeight_eq hx, H] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.NumberTheory.Harmonic.ZetaAsymp | {
"line": 341,
"column": 6
} | {
"line": 341,
"column": 23
} | [
{
"pp": "case refine_2.refine_2\nf : ℂ → ℂ := fun s ↦ riemannZeta s - 1 / (s - 1)\n⊢ Tendsto (fun x ↦ f x * (x - 1) - f 1 * (x - 1)) (𝓝[≠] 1) (𝓝 (1 - 1 - f 1 * (1 - 1)))",
"usedConstants": [
"NormedCommRing.toSeminormedCommRing",
"NonUnitalCommRing.toNonUnitalNonAssocCommRing",
"HMul.hMu... | apply Tendsto.sub | Lean.Elab.Tactic.evalApply | Lean.Parser.Tactic.apply |
Mathlib.NumberTheory.Harmonic.ZetaAsymp | {
"line": 351,
"column": 2
} | {
"line": 351,
"column": 55
} | [
{
"pp": "F : Type u_1\ninst✝² : Norm F\ninst✝¹ : One F\ninst✝ : NormOneClass F\n⊢ (fun s ↦ riemannZeta s - 1 / (s - 1)) =O[𝓝 1] fun x ↦ 1",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.Basic | {
"line": 754,
"column": 4
} | {
"line": 754,
"column": 15
} | [
{
"pp": "case inr.inl\nK : Type u_1\ninst✝² : Field K\ninst✝¹ : AdmissibleAbsValues K\nι : Type u_2\ninst✝ : Finite ι\ny : ι → K\nhι : Nonempty ι\n⊢ mulHeight (0 * y) ≤ mulHeight 0 * mulHeight y",
"usedConstants": [
"Eq.mpr",
"Real.instLE",
"Real",
"HMul.hMul",
"congrArg",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.Basic | {
"line": 756,
"column": 4
} | {
"line": 756,
"column": 15
} | [
{
"pp": "case inr.inr.inl\nK : Type u_1\ninst✝² : Field K\ninst✝¹ : AdmissibleAbsValues K\nι : Type u_2\ninst✝ : Finite ι\nx : ι → K\nhι : Nonempty ι\nhx : x ≠ 0\n⊢ mulHeight (x * 0) ≤ mulHeight x * mulHeight 0",
"usedConstants": [
"Eq.mpr",
"Real.instLE",
"Real",
"HMul.hMul",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.RootsOfUnity.Lemmas | {
"line": 39,
"column": 2
} | {
"line": 40,
"column": 83
} | [
{
"pp": "R : Type u_1\ninst✝¹ : CommRing R\ninst✝ : IsDomain R\nn : ℕ\nμ : R\nhμ : IsPrimitiveRoot μ (n + 1)\nthis : eval 1 (∏ k ∈ range n, (X - C (μ ^ (k + 1) * 1))) = eval 1 (∑ i ∈ range (n + 1), X ^ i)\n⊢ ∏ k ∈ range n, (1 - μ ^ (k + 1)) = ↑n + 1",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.RootsOfUnity.Lemmas | {
"line": 64,
"column": 2
} | {
"line": 71,
"column": 34
} | [
{
"pp": "case refine_1\nR : Type u_1\ninst✝¹ : CommRing R\ninst✝ : IsDomain R\nk n : ℕ\nμ : R\nm : ℕ\nhn : k < m + k + 1\nhμ : IsPrimitiveRoot μ (m + k + 1)\nhdvd : ∀ (k : ℕ), ∃ z ∈ ℤ[μ], μ ^ k - 1 = z * (μ - 1)\nZ : ℕ → R := fun k ↦ Classical.choose ⋯\nZdef : ∀ (k : ℕ), Z k ∈ ℤ[μ] ∧ μ ^ k - 1 = Z k * (μ - 1)\n... | · apply Subalgebra.mul_mem
· apply Subalgebra.mul_mem
· exact Subalgebra.pow_mem _ (Subalgebra.neg_mem _ <| Subalgebra.one_mem _) _
· exact Subalgebra.prod_mem _ fun _ _ ↦ (Zdef _).1
· refine Subalgebra.prod_mem _ fun _ _ ↦ ?_
apply Subalgebra.sub_mem
· exact Subalgebra.pow_mem _ (self_m... | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.NumberTheory.Height.Basic | {
"line": 789,
"column": 61
} | {
"line": 796,
"column": 30
} | [
{
"pp": "K : Type u_1\ninst✝¹ : Field K\ninst✝ : AdmissibleAbsValues K\nι : Type u_2\ns : Finset ι\nx : ι → K\n⊢ mulHeight₁ (∏ i ∈ s, x i) ≤ ∏ i ∈ s, mulHeight₁ (x i)",
"usedConstants": [
"Real.instIsOrderedRing",
"Eq.mpr",
"MulOne.toOne",
"le_refl",
"Real.partialOrder",
... | by
classical
induction s using Finset.induction with
| empty => simp
| insert b s hb ih =>
simp only [Finset.prod_insert hb]
grw [← ih]
exact mulHeight₁_mul_le .. | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.NumberTheory.Height.MvPolynomial | {
"line": 53,
"column": 8
} | {
"line": 53,
"column": 19
} | [
{
"pp": "case insert.refine_2.inl\nα : Type u_2\nβ : Type u_3\nF : Type u_4\ninst✝³ : AddCommMonoid β\ninst✝² : FunLike F β ℝ\ninst✝¹ : NonnegHomClass F β ℝ\ninst✝ : ZeroHomClass F β ℝ\nv : F\nl : α → β\nhv : IsNonarchimedean ⇑v\na : α\ns : Finset α\nha : a ∉ s\nih : v (∑ i ∈ s, l i) ≤ ⨆ i, v (l ↑i)\nhs : IsEmp... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.MvPolynomial | {
"line": 132,
"column": 4
} | {
"line": 132,
"column": 64
} | [
{
"pp": "case inl\nK : Type u_1\ninst✝⁴ : Field K\nι : Type u_2\nι' : Type u_3\ninst✝³ : Fintype ι\ninst✝² : Finite ι'\ninst✝¹ : AdmissibleAbsValues K\ninst✝ : Nonempty ι\nA : ι' × ι → K\nx : ι → K\nH₀ : 1 ≤ ↑(Nat.card ι) ^ totalWeight K * mulHeight A * mulHeight x\nhι' : IsEmpty ι'\n⊢ (mulHeight fun j ↦ ∑ i, A... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.MvPolynomial | {
"line": 134,
"column": 4
} | {
"line": 134,
"column": 40
} | [
{
"pp": "case inr.inl\nK : Type u_1\ninst✝⁴ : Field K\nι : Type u_2\nι' : Type u_3\ninst✝³ : Fintype ι\ninst✝² : Finite ι'\ninst✝¹ : AdmissibleAbsValues K\ninst✝ : Nonempty ι\nA : ι' × ι → K\nx : ι → K\nH₀ : 1 ≤ ↑(Nat.card ι) ^ totalWeight K * mulHeight A * mulHeight x\nhι' : Nonempty ι'\nh : (fun j ↦ ∑ i, A (j... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.MvPolynomial | {
"line": 136,
"column": 4
} | {
"line": 136,
"column": 15
} | [
{
"pp": "case inr.inr.inl\nK : Type u_1\ninst✝⁴ : Field K\nι : Type u_2\nι' : Type u_3\ninst✝³ : Fintype ι\ninst✝² : Finite ι'\ninst✝¹ : AdmissibleAbsValues K\ninst✝ : Nonempty ι\nx : ι → K\nhι' : Nonempty ι'\nH₀ : 1 ≤ ↑(Nat.card ι) ^ totalWeight K * mulHeight 0 * mulHeight x\nh : (fun j ↦ ∑ i, 0 (j, i) * x i) ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.MvPolynomial | {
"line": 138,
"column": 4
} | {
"line": 138,
"column": 15
} | [
{
"pp": "case inr.inr.inr.inl\nK : Type u_1\ninst✝⁴ : Field K\nι : Type u_2\nι' : Type u_3\ninst✝³ : Fintype ι\ninst✝² : Finite ι'\ninst✝¹ : AdmissibleAbsValues K\ninst✝ : Nonempty ι\nA : ι' × ι → K\nhι' : Nonempty ι'\nhA : A ≠ 0\nH₀ : 1 ≤ ↑(Nat.card ι) ^ totalWeight K * mulHeight A * mulHeight 0\nh : (fun j ↦ ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.JacobiSum.Basic | {
"line": 111,
"column": 4
} | {
"line": 111,
"column": 94
} | [
{
"pp": "case hc\nF : Type u_1\nR : Type u_2\ninst✝² : Field F\ninst✝¹ : Fintype F\ninst✝ : CommRing R\nx : F\nhx : x ≠ 0 ∧ x ≠ 1\n⊢ IsUnit (x * (1 - x))",
"usedConstants": [
"AddGroup.toSubtractionMonoid",
"Eq.mpr",
"GroupWithZero.toMonoidWithZero",
"IsDomain.to_noZeroDivisors",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.JacobiSum.Basic | {
"line": 297,
"column": 18
} | {
"line": 297,
"column": 35
} | [
{
"pp": "case pos\nF : Type u_1\nR : Type u_2\ninst✝³ : Field F\ninst✝² : CommRing R\ninst✝¹ : IsDomain R\ninst✝ : Fintype F\nn : ℕ\nhn : 2 < n\nχ ψ : MulChar F R\nμ : R\nhχ : χ ^ n = 1\nhψ : ψ ^ n = 1\nhμ : IsPrimitiveRoot μ n\nq : ℕ\nhq : Fintype.card F = n * q + 1\nz₁ : R\nhz₁ : z₁ ∈ ℤ[μ]\nHz₁ : ↑n = z₁ * (μ... | jacobiSum_one_one | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.NumberTheory.Height.MvPolynomial | {
"line": 251,
"column": 6
} | {
"line": 251,
"column": 17
} | [
{
"pp": "case pos\nK : Type u_4\ninst✝¹ : Field K\nι : Type u_5\nι' : Type u_6\ninst✝ : AdmissibleAbsValues K\nh✝¹ : IsEmpty ι'\nh✝ : archAbsVal.card = 0\n⊢ max (1 * ∏ᶠ (v : ↑nonarchAbsVal), ⨆ j, 1) 1 = 1",
"usedConstants": [
"Eq.mpr",
"MulOne.toOne",
"Real.partialOrder",
"Real",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.MvPolynomial | {
"line": 305,
"column": 6
} | {
"line": 305,
"column": 17
} | [
{
"pp": "case inl.inr\nK : Type u_4\ninst✝³ : Field K\nι : Type u_5\nι' : Type u_6\ninst✝² : AdmissibleAbsValues K\ninst✝¹ : Finite ι'\ninst✝ : Finite ι\nN : ℕ\np : ι' → MvPolynomial ι K\nhp : ∀ (i : ι'), (p i).IsHomogeneous N\nh : (fun j ↦ constantCoeff (p j)) ≠ 0\n⊢ (mulHeight fun j ↦ (eval 0) (p j)) ≤ max (m... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.MvPolynomial | {
"line": 308,
"column": 4
} | {
"line": 308,
"column": 36
} | [
{
"pp": "case inr.inl\nK : Type u_4\ninst✝³ : Field K\nι : Type u_5\nι' : Type u_6\ninst✝² : AdmissibleAbsValues K\ninst✝¹ : Finite ι'\ninst✝ : Finite ι\nN : ℕ\np : ι' → MvPolynomial ι K\nhp : ∀ (i : ι'), (p i).IsHomogeneous N\nx : ι → K\nhx : x ≠ 0\nh₀ : (fun j ↦ (eval x) (p j)) = 0\n⊢ (mulHeight fun j ↦ (eval... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.LSeries.ZMod | {
"line": 177,
"column": 6
} | {
"line": 177,
"column": 41
} | [
{
"pp": "case pos\nN : ℕ\ninst✝ : NeZero N\nj : ZMod N\ns : ℂ\nhjs : j ≠ 0 ∨ s ≠ 1\nU : Set ℂ := if j = 0 then {z | z ≠ 1} else Set.univ\nV : Set ℂ := {z | 1 < z.re}\nh : j = 0\n⊢ IsOpen U",
"usedConstants": [
"Eq.mpr",
"NormedCommRing.toSeminormedCommRing",
"ZMod.commRing",
"congrAr... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.LSeries.ZMod | {
"line": 177,
"column": 4
} | {
"line": 177,
"column": 64
} | [
{
"pp": "case pos\nN : ℕ\ninst✝ : NeZero N\nj : ZMod N\ns : ℂ\nhjs : j ≠ 0 ∨ s ≠ 1\nU : Set ℂ := if j = 0 then {z | z ≠ 1} else Set.univ\nV : Set ℂ := {z | 1 < z.re}\nh : j = 0\n⊢ IsOpen U",
"usedConstants": [
"Eq.mpr",
"NormedCommRing.toSeminormedCommRing",
"T6Space.toT5Space",
"ZMo... | · simpa only [h, ↓reduceIte, U] using isOpen_compl_singleton | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.NumberTheory.LSeries.ZMod | {
"line": 194,
"column": 6
} | {
"line": 194,
"column": 41
} | [
{
"pp": "case pos\nN : ℕ\ninst✝ : NeZero N\nj : ZMod N\ns : ℂ\nhjs : j ≠ 0 ∨ s ≠ 1\nU : Set ℂ := if j = 0 then {z | z ≠ 1} else Set.univ\nV : Set ℂ := {z | 1 < z.re}\nhUo : IsOpen U\nf : ℂ → ℂ := LFunction fun k ↦ 𝕖 (j * k)\ng : ℂ → ℂ := expZeta (toAddCircle j)\nhU : ∀ {u : ℂ}, u ∈ U ↔ u ≠ 1 ∨ j ≠ 0\nhf : Anal... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.LSeries.ZMod | {
"line": 196,
"column": 6
} | {
"line": 196,
"column": 41
} | [
{
"pp": "case neg\nN : ℕ\ninst✝ : NeZero N\nj : ZMod N\ns : ℂ\nhjs : j ≠ 0 ∨ s ≠ 1\nU : Set ℂ := if j = 0 then {z | z ≠ 1} else Set.univ\nV : Set ℂ := {z | 1 < z.re}\nhUo : IsOpen U\nf : ℂ → ℂ := LFunction fun k ↦ 𝕖 (j * k)\ng : ℂ → ℂ := expZeta (toAddCircle j)\nhU : ∀ {u : ℂ}, u ∈ U ↔ u ≠ 1 ∨ j ≠ 0\nhf : Anal... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.IsAdjoinRoot | {
"line": 117,
"column": 56
} | {
"line": 117,
"column": 67
} | [
{
"pp": "R : Type u\nS : Type v\ninst✝² : CommRing R\ninst✝¹ : Ring S\nf : R[X]\ninst✝ : Algebra R S\nh : IsAdjoinRoot S f\np : R[X]\n⊢ h.map p = 0 ↔ f ∣ p",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.NumberTheory.Height.MvPolynomial | {
"line": 453,
"column": 4
} | {
"line": 453,
"column": 22
} | [
{
"pp": "K : Type u_6\ninst✝³ : Field K\nι : Type u_7\nι' : Type u_8\ninst✝² : Fintype ι'\ninst✝¹ : AdmissibleAbsValues K\ninst✝ : Finite ι\nM N : ℕ\nq : ι × ι' → MvPolynomial ι K\nhq : ∀ (a : ι × ι'), (q a).IsHomogeneous M\np : ι' → MvPolynomial ι K\nx : ι → K\nh : ∀ (k : ι), ∑ j, (eval x) (q (k, j)) * (eval x... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.IsAdjoinRoot | {
"line": 176,
"column": 74
} | {
"line": 177,
"column": 92
} | [
{
"pp": "R : Type u\nS : Type v\ninst✝² : CommRing R\ninst✝¹ : Ring S\nf : R[X]\ninst✝ : Algebra R S\nh : IsAdjoinRoot S f\na : AdjoinRoot f\n⊢ h.adjoinRootAlgEquiv a = h.map ⋯.choose",
"usedConstants": [
"Eq.mpr",
"Exists.choose_spec",
"AdjoinRoot.mk_surjective",
"AdjoinRoot",
... | by
rw (occs := [1]) [← (AdjoinRoot.mk_surjective a).choose_spec, adjoinRootAlgEquiv_apply_mk] | [anonymous] | Lean.Parser.Term.byTactic |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.