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.Decomposition.RadonNikodym | {
"line": 650,
"column": 7
} | {
"line": 650,
"column": 18
} | [
{
"pp": "G : Type u_3\ninst✝⁶ : Group G\nmG : MeasurableSpace G\ninst✝⁵ : MeasurableMul₂ G\ninst✝⁴ : MeasurableInv G\nμ : Measure G\ninst✝³ : μ.IsMulLeftInvariant\ninst✝² : SFinite μ\nν₁ ν₂ : Measure G\ninst✝¹ : ν₁.HaveLebesgueDecomposition μ\ninst✝ : ν₂.HaveLebesgueDecomposition μ\nhν₁ : ν₁ ≪ μ\nhν₂ : ν₂ ≪ μ\n... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.Dynamics.TopologicalEntropy.CoverEntropy | {
"line": 177,
"column": 75
} | {
"line": 177,
"column": 86
} | [
{
"pp": "X : Type u_1\nT : X → X\nU : SetRel X X\nF : Set X\nm : ℕ\nF_inv : MapsTo T F F\ninst✝ : U.IsSymm\nn : ℕ\ns : Finset X\nh : IsDynCoverOf T F U m ↑s\nx✝¹ : Nonempty X\ns_nemp : s.Nonempty\nx : X\nx_F : x ∈ F\nm_pos : m > 0\ndyncover : (Fin n → ↥s) → X\nh_dyncover :\n ∀ (t : Fin n → ↥s),\n ⋂ k, T^[m ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.Dynamics.TopologicalEntropy.CoverEntropy | {
"line": 197,
"column": 64
} | {
"line": 197,
"column": 75
} | [
{
"pp": "X : Type u_1\nT : X → X\nU : SetRel X X\nF : Set X\ninst✝ : UniformSpace X\nF_comp : IsCompact F\nF_inv : MapsTo T F F\nU_uni : U ∈ 𝓤 X\nn : ℕ\nV : SetRel X X\nV_uni : V ∈ 𝓤 X\nV_symm : V.IsSymm\nV_U : V ○ V ⊆ U\ns : Finset X\nleft✝ : ∀ x ∈ s, x ∈ F\ns_cover : F ⊆ ⋃ x ∈ s, ball x V\n⊢ F ⊆ ⋃ y ∈ ↑s, b... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.Dynamics.TopologicalEntropy.CoverEntropy | {
"line": 252,
"column": 45
} | {
"line": 254,
"column": 40
} | [
{
"pp": "X : Type u_1\nT : X → X\nF : Set X\nU : SetRel X X\nn : ℕ\n⊢ 1 ≤ coverMincard T F U n ↔ F.Nonempty",
"usedConstants": [
"not_iff_not",
"Eq.mpr",
"Dynamics.coverMincard_eq_zero_iff",
"instAddMonoidWithOneENat",
"congrArg",
"CommSemiring.toSemiring",
"id",
... | by
rw [ENat.one_le_iff_ne_zero, nonempty_iff_ne_empty, not_iff_not]
exact coverMincard_eq_zero_iff T F U n | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.RingTheory.Algebraic.Cardinality | {
"line": 66,
"column": 2
} | {
"line": 66,
"column": 28
} | [
{
"pp": "R : Type u\ninst✝⁶ : CommRing R\ninst✝⁵ : IsDomain R\nL : Type u\ninst✝⁴ : CommRing L\ninst✝³ : IsDomain L\ninst✝² : Algebra R L\ninst✝¹ : IsTorsionFree R L\ninst✝ : Algebra.IsAlgebraic R L\n⊢ #L ≤ #((p : R[X]) × { x // x ∈ p.aroots L })",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.Algebraic.Cardinality | {
"line": 72,
"column": 2
} | {
"line": 72,
"column": 28
} | [
{
"pp": "R : Type u\ninst✝⁶ : CommRing R\ninst✝⁵ : IsDomain R\nL : Type u\ninst✝⁴ : CommRing L\ninst✝³ : IsDomain L\ninst✝² : Algebra R L\ninst✝¹ : IsTorsionFree R L\ninst✝ : Algebra.IsAlgebraic R L\n⊢ #L ≤ max #R ℵ₀",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.IsAlgClosed.Classification | {
"line": 99,
"column": 6
} | {
"line": 99,
"column": 17
} | [
{
"pp": "R : Type u\nK : Type v\ninst✝³ : CommRing R\ninst✝² : Field K\ninst✝¹ : Algebra R K\ninst✝ : IsAlgClosed K\nι : Type w\nv : ι → K\nhv : IsTranscendenceBasis R v\nthis : IsAlgClosure (↥(Algebra.adjoin R (Set.range v))) K := isAlgClosure_of_transcendence_basis v hv\n⊢ Cardinal.lift.{max u w, v} #K ≤ Card... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.IsAlgClosed.Classification | {
"line": 115,
"column": 2
} | {
"line": 115,
"column": 13
} | [
{
"pp": "R : Type u\ninst✝³ : CommRing R\nK' : Type u\ninst✝² : Field K'\ninst✝¹ : Algebra R K'\ninst✝ : IsAlgClosed K'\nι' : Type u\nv' : ι' → K'\nhv : IsTranscendenceBasis R v'\n⊢ #K' ≤ max (max #R #ι') ℵ₀",
"usedConstants": [
"Eq.mpr",
"Lattice.toSemilatticeSup",
"Cardinal",
"cong... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.IsAlgClosed.Classification | {
"line": 130,
"column": 45
} | {
"line": 130,
"column": 56
} | [
{
"pp": "R : Type u\nK : Type v\ninst✝⁴ : CommRing R\ninst✝³ : Field K\ninst✝² : Algebra R K\ninst✝¹ : IsAlgClosed K\nι : Type w\nv : ι → K\ninst✝ : Nontrivial R\nhv : IsTranscendenceBasis R v\nhR : #R ≤ ℵ₀\nhK : ℵ₀ < #K\nh : Cardinal.lift.{max u v, w} #ι < ℵ₀\n⊢ Cardinal.lift.{max u v, w} #ι ≤ ℵ₀",
"usedCo... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.IsAlgClosed.Classification | {
"line": 140,
"column": 29
} | {
"line": 140,
"column": 40
} | [
{
"pp": "R : Type u\nK : Type v\ninst✝⁴ : CommRing R\ninst✝³ : Field K\ninst✝² : Algebra R K\ninst✝¹ : IsAlgClosed K\nι : Type w\nv : ι → K\ninst✝ : Nontrivial R\nhv : IsTranscendenceBasis R v\nhR : #R ≤ ℵ₀\nhK : ℵ₀ < #K\nthis : ℵ₀ ≤ Cardinal.lift.{max u v, w} #ι\n⊢ Cardinal.lift.{max v w, u} #R ≤ ℵ₀",
"use... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.IsAlgClosed.Classification | {
"line": 151,
"column": 2
} | {
"line": 151,
"column": 13
} | [
{
"pp": "R : Type u\ninst✝⁴ : CommRing R\nK' : Type u\ninst✝³ : Field K'\ninst✝² : Algebra R K'\ninst✝¹ : IsAlgClosed K'\nι' : Type u\nv' : ι' → K'\ninst✝ : Nontrivial R\nhv : IsTranscendenceBasis R v'\nhR : #R ≤ ℵ₀\nhK : ℵ₀ < #K'\n⊢ #K' = #ι'",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.LanguageMap | {
"line": 423,
"column": 21
} | {
"line": 423,
"column": 39
} | [
{
"pp": "L : Language\nL' : Language\nM : Type w\ninst✝ : L.Structure M\nα : Type w'\nie : IsEmpty α\n⊢ ((LHom.id L).sumElim (LHom.ofIsEmpty (constantsOn α) L)).comp (L.lhomWithConstants α) = LHom.id L",
"usedConstants": [
"Eq.mpr",
"FirstOrder.Language.isRelational_constantsOn",
"FirstOrd... | lhomWithConstants, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.ModelTheory.Algebra.Ring.Basic | {
"line": 251,
"column": 8
} | {
"line": 251,
"column": 19
} | [
{
"pp": "α : Type u_1\nR : Type u_2\nS : Type u_3\ninst✝³ : NonAssocRing R\ninst✝² : NonAssocRing S\ninst✝¹ : CompatibleRing R\ninst✝ : CompatibleRing S\nf : R ≃[ring] S\nx y : R\n⊢ f.toFun (x * y) = f.toFun x * f.toFun y",
"usedConstants": [
"NegZeroClass.toNeg",
"FirstOrder.Language.ring",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Algebra.Ring.Basic | {
"line": 248,
"column": 8
} | {
"line": 248,
"column": 19
} | [
{
"pp": "α : Type u_1\nR : Type u_2\nS : Type u_3\ninst✝³ : NonAssocRing R\ninst✝² : NonAssocRing S\ninst✝¹ : CompatibleRing R\ninst✝ : CompatibleRing S\nf : R ≃[ring] S\nx y : R\n⊢ f.toFun (x + y) = f.toFun x + f.toFun y",
"usedConstants": [
"NegZeroClass.toNeg",
"FirstOrder.Language.ring",
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Syntax | {
"line": 438,
"column": 4
} | {
"line": 438,
"column": 57
} | [
{
"pp": "case rel\nL : Language\nα : Type u'\nk n✝¹ l✝ : ℕ\nR✝ : L.Relations l✝\nts✝ : Fin l✝ → L.Term (α ⊕ Fin n✝¹)\nm✝ n✝ : ℕ\nkm✝ : n✝¹ ≤ m✝\nmn✝ : m✝ ≤ n✝\n⊢ rel R✝ (Term.relabel (Sum.map id (Fin.castLE mn✝)) ∘ Term.relabel (Sum.map id (Fin.castLE km✝)) ∘ ts✝) =\n rel R✝ (Term.relabel (Sum.map id (Fin.ca... | rw [← Function.comp_assoc, Term.relabel_comp_relabel] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.ModelTheory.Syntax | {
"line": 901,
"column": 6
} | {
"line": 901,
"column": 34
} | [
{
"pp": "case h.refine_3\nL : Language\nα : Type u'\ns : Set α\ni j : α\n⊢ (∃ i_1, (∃ (x : i ∈ s), ⟨i, ⋯⟩ ∈ i_1) ∧ ∃ (x : j ∈ s), ⟨j, ⋯⟩ ∈ i_1) → i ∈ s ∧ j ∈ s",
"usedConstants": [
"Iff.mpr",
"Iff.of_eq",
"Finset",
"Membership.mem",
"Exists",
"Set.Elem",
"Subtype",
... | rintro ⟨t, ⟨is, _⟩, ⟨js, _⟩⟩ | _private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalRIntro | Lean.Parser.Tactic.rintro |
Mathlib.ModelTheory.Semantics | {
"line": 448,
"column": 39
} | {
"line": 448,
"column": 49
} | [
{
"pp": "L : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ : ℕ\nt₁✝ t₂✝ : L.Term (α ⊕ Fin n✝)\nf : ↥(equal t₁✝ t₂✝).freeVarFinset → β\nxs : Fin n✝ → M\nhv' : ∀ (a : ↥(equal t₁✝ t₂✝).freeVarFinset), v (f a) = v' ↑a\n⊢ ∀ (a : ↥t₁✝.v... | simp [hv'] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.ModelTheory.Semantics | {
"line": 448,
"column": 39
} | {
"line": 448,
"column": 49
} | [
{
"pp": "L : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ : ℕ\nt₁✝ t₂✝ : L.Term (α ⊕ Fin n✝)\nf : ↥(equal t₁✝ t₂✝).freeVarFinset → β\nxs : Fin n✝ → M\nhv' : ∀ (a : ↥(equal t₁✝ t₂✝).freeVarFinset), v (f a) = v' ↑a\n⊢ ∀ (a : ↥t₁✝.v... | simp [hv'] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.ModelTheory.Semantics | {
"line": 448,
"column": 39
} | {
"line": 448,
"column": 49
} | [
{
"pp": "L : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ : ℕ\nt₁✝ t₂✝ : L.Term (α ⊕ Fin n✝)\nf : ↥(equal t₁✝ t₂✝).freeVarFinset → β\nxs : Fin n✝ → M\nhv' : ∀ (a : ↥(equal t₁✝ t₂✝).freeVarFinset), v (f a) = v' ↑a\n⊢ ∀ (a : ↥t₁✝.v... | simp [hv'] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.ModelTheory.Semantics | {
"line": 448,
"column": 83
} | {
"line": 448,
"column": 93
} | [
{
"pp": "L : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ : ℕ\nt₁✝ t₂✝ : L.Term (α ⊕ Fin n✝)\nf : ↥(equal t₁✝ t₂✝).freeVarFinset → β\nxs : Fin n✝ → M\nhv' : ∀ (a : ↥(equal t₁✝ t₂✝).freeVarFinset), v (f a) = v' ↑a\n⊢ ∀ (a : ↥t₂✝.v... | simp [hv'] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.ModelTheory.Semantics | {
"line": 448,
"column": 83
} | {
"line": 448,
"column": 93
} | [
{
"pp": "L : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ : ℕ\nt₁✝ t₂✝ : L.Term (α ⊕ Fin n✝)\nf : ↥(equal t₁✝ t₂✝).freeVarFinset → β\nxs : Fin n✝ → M\nhv' : ∀ (a : ↥(equal t₁✝ t₂✝).freeVarFinset), v (f a) = v' ↑a\n⊢ ∀ (a : ↥t₂✝.v... | simp [hv'] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.ModelTheory.Semantics | {
"line": 448,
"column": 83
} | {
"line": 448,
"column": 93
} | [
{
"pp": "L : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ : ℕ\nt₁✝ t₂✝ : L.Term (α ⊕ Fin n✝)\nf : ↥(equal t₁✝ t₂✝).freeVarFinset → β\nxs : Fin n✝ → M\nhv' : ∀ (a : ↥(equal t₁✝ t₂✝).freeVarFinset), v (f a) = v' ↑a\n⊢ ∀ (a : ↥t₂✝.v... | simp [hv'] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.ModelTheory.Semantics | {
"line": 453,
"column": 39
} | {
"line": 453,
"column": 49
} | [
{
"pp": "L : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ l✝ : ℕ\nR✝ : L.Relations l✝\nts✝ : Fin l✝ → L.Term (α ⊕ Fin n✝)\nf : ↥(rel R✝ ts✝).freeVarFinset → β\nxs : Fin n✝ → M\nhv' : ∀ (a : ↥(rel R✝ ts✝).freeVarFinset), v (f a) =... | simp [hv'] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.ModelTheory.Semantics | {
"line": 453,
"column": 39
} | {
"line": 453,
"column": 49
} | [
{
"pp": "L : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ l✝ : ℕ\nR✝ : L.Relations l✝\nts✝ : Fin l✝ → L.Term (α ⊕ Fin n✝)\nf : ↥(rel R✝ ts✝).freeVarFinset → β\nxs : Fin n✝ → M\nhv' : ∀ (a : ↥(rel R✝ ts✝).freeVarFinset), v (f a) =... | simp [hv'] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.ModelTheory.Semantics | {
"line": 453,
"column": 39
} | {
"line": 453,
"column": 49
} | [
{
"pp": "L : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ l✝ : ℕ\nR✝ : L.Relations l✝\nts✝ : Fin l✝ → L.Term (α ⊕ Fin n✝)\nf : ↥(rel R✝ ts✝).freeVarFinset → β\nxs : Fin n✝ → M\nhv' : ∀ (a : ↥(rel R✝ ts✝).freeVarFinset), v (f a) =... | simp [hv'] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.ModelTheory.Semantics | {
"line": 457,
"column": 22
} | {
"line": 457,
"column": 32
} | [
{
"pp": "case imp\nL : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ : ℕ\nf₁✝ f₂✝ : L.BoundedFormula α n✝\nih1 :\n ∀ {f : ↥f₁✝.freeVarFinset → β} {xs : Fin n✝ → M},\n (∀ (a : ↥f₁✝.freeVarFinset), v (f a) = v' ↑a) → ((f₁✝.restr... | simp [hv'] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.ModelTheory.Semantics | {
"line": 457,
"column": 22
} | {
"line": 457,
"column": 32
} | [
{
"pp": "case imp\nL : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ : ℕ\nf₁✝ f₂✝ : L.BoundedFormula α n✝\nih1 :\n ∀ {f : ↥f₁✝.freeVarFinset → β} {xs : Fin n✝ → M},\n (∀ (a : ↥f₁✝.freeVarFinset), v (f a) = v' ↑a) → ((f₁✝.restr... | simp [hv'] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.ModelTheory.Semantics | {
"line": 461,
"column": 14
} | {
"line": 461,
"column": 24
} | [
{
"pp": "case all\nL : Language\nM : Type w\ninst✝¹ : L.Structure M\nα : Type u'\nβ : Type v'\ninst✝ : DecidableEq α\nn : ℕ\nv : β → M\nv' : α → M\nn✝ : ℕ\nf✝ : L.BoundedFormula α (n✝ + 1)\nih3 :\n ∀ {f : ↥f✝.freeVarFinset → β} {xs : Fin (n✝ + 1) → M},\n (∀ (a : ↥f✝.freeVarFinset), v (f a) = v' ↑a) → ((f✝.r... | simp [hv'] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.ModelTheory.Semantics | {
"line": 580,
"column": 6
} | {
"line": 580,
"column": 14
} | [
{
"pp": "L : Language\nM : Type w\ninst✝ : L.Structure M\nα : Type u'\nβ : Type v'\nφ : L.Formula α\ng : α → β\nv : β → M\n⊢ (relabel g φ).Realize v ↔ φ.Realize (v ∘ g)",
"usedConstants": [
"Eq.mpr",
"Inhabited.default",
"congrArg",
"Pi.uniqueOfIsEmpty",
"Function.comp",
... | Realize, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.ModelTheory.Semantics | {
"line": 580,
"column": 15
} | {
"line": 580,
"column": 23
} | [
{
"pp": "L : Language\nM : Type w\ninst✝ : L.Structure M\nα : Type u'\nβ : Type v'\nφ : L.Formula α\ng : α → β\nv : β → M\n⊢ BoundedFormula.Realize (relabel g φ) v default ↔ φ.Realize (v ∘ g)",
"usedConstants": [
"Eq.mpr",
"Inhabited.default",
"congrArg",
"Pi.uniqueOfIsEmpty",
... | Realize, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.ModelTheory.Encoding | {
"line": 246,
"column": 8
} | {
"line": 246,
"column": 54
} | [
{
"pp": "case h\nL : Language\nα : Type u'\nl✝ : List ((n : ℕ) × L.BoundedFormula α n)\nn φ_n φ_l : ℕ\nφ_R : L.Relations φ_l\nts : Fin φ_l → L.Term (α ⊕ Fin φ_n)\nl : List ((k : ℕ) × L.Term (α ⊕ Fin k) ⊕ (n : ℕ) × L.Relations n ⊕ ℕ)\ni : Fin φ_l\n⊢ ↑i < (List.map (Sum.getLeft? ∘ fun i ↦ Sum.inl ⟨φ_n, ts i⟩) (fi... | simp only [length_map, length_finRange, is_lt] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.ModelTheory.Encoding | {
"line": 246,
"column": 8
} | {
"line": 246,
"column": 54
} | [
{
"pp": "case h\nL : Language\nα : Type u'\nl✝ : List ((n : ℕ) × L.BoundedFormula α n)\nn φ_n φ_l : ℕ\nφ_R : L.Relations φ_l\nts : Fin φ_l → L.Term (α ⊕ Fin φ_n)\nl : List ((k : ℕ) × L.Term (α ⊕ Fin k) ⊕ (n : ℕ) × L.Relations n ⊕ ℕ)\ni : Fin φ_l\n⊢ ↑i < (List.map (Sum.getLeft? ∘ fun i ↦ Sum.inl ⟨φ_n, ts i⟩) (fi... | simp only [length_map, length_finRange, is_lt] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.ModelTheory.Encoding | {
"line": 246,
"column": 8
} | {
"line": 246,
"column": 54
} | [
{
"pp": "case h\nL : Language\nα : Type u'\nl✝ : List ((n : ℕ) × L.BoundedFormula α n)\nn φ_n φ_l : ℕ\nφ_R : L.Relations φ_l\nts : Fin φ_l → L.Term (α ⊕ Fin φ_n)\nl : List ((k : ℕ) × L.Term (α ⊕ Fin k) ⊕ (n : ℕ) × L.Relations n ⊕ ℕ)\ni : Fin φ_l\n⊢ ↑i < (List.map (Sum.getLeft? ∘ fun i ↦ Sum.inl ⟨φ_n, ts i⟩) (fi... | simp only [length_map, length_finRange, is_lt] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.ModelTheory.ElementaryMaps | {
"line": 199,
"column": 2
} | {
"line": 199,
"column": 16
} | [
{
"pp": "L : Language\nM : Type u_1\nN : Type u_2\nP : Type u_3\nQ : Type u_4\ninst✝³ : L.Structure M\ninst✝² : L.Structure N\ninst✝¹ : L.Structure P\ninst✝ : L.Structure Q\nf : M ↪ₑ[L] N\nA : Set M\n⊢ M ↪ₑ[L[[↑A]]] f.toEmbedding.withConstants A",
"usedConstants": [
"FirstOrder.Language.withConstantsS... | refine ⟨f, ?_⟩ | Lean.Elab.Tactic.evalRefine | Lean.Parser.Tactic.refine |
Mathlib.ModelTheory.ElementaryMaps | {
"line": 206,
"column": 2
} | {
"line": 206,
"column": 84
} | [
{
"pp": "L : Language\nM : Type u_1\nN : Type u_2\nP : Type u_3\nQ : Type u_4\ninst✝³ : L.Structure M\ninst✝² : L.Structure N\ninst✝¹ : L.Structure P\ninst✝ : L.Structure Q\nf : M ↪ₑ[L] N\nA : Set M\nn : ℕ\nφ : L[[↑A]].Formula (Fin n)\nx : Fin n → M\nh : Sum.elim (fun a ↦ ↑(L.con a)) (⇑f ∘ x) = ⇑f ∘ Sum.elim (f... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Encoding | {
"line": 296,
"column": 6
} | {
"line": 296,
"column": 17
} | [
{
"pp": "L : Language\nα : Type u'\n⊢ lift.{max (max u' v) u, max (max u' v) u} #(List BoundedFormula.encoding.Γ) ≤\n lift.{max (max u u') v, max (max u u') v} (max ℵ₀ (lift.{max u v, u'} #α + lift.{u', max u v} L.card))",
"usedConstants": [
"Eq.mpr",
"Lattice.toSemilatticeSup",
"FirstO... | encoding_Γ, | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.ModelTheory.Encoding | {
"line": 298,
"column": 2
} | {
"line": 298,
"column": 30
} | [
{
"pp": "L : Language\nα : Type u'\n⊢ lift.{max (max u u') v, max (max u u') v} #((k : ℕ) × L.Term (α ⊕ Fin k) ⊕ (n : ℕ) × L.Relations n ⊕ ℕ) ≤\n max ℵ₀ (lift.{max (max u u') v, max (max u u') v} (lift.{max u v, u'} #α + lift.{u', max u v} L.card)) ∧\n ℵ₀ ≤ max ℵ₀ (lift.{max (max u u') v, max (max u u')... | refine ⟨?_, le_max_left _ _⟩ | Lean.Elab.Tactic.evalRefine | Lean.Parser.Tactic.refine |
Mathlib.ModelTheory.Substructures | {
"line": 193,
"column": 14
} | {
"line": 193,
"column": 29
} | [
{
"pp": "case pos\nL : Language\nM : Type w\nN : Type u_1\nP : Type u_2\ninst✝² : L.Structure M\ninst✝¹ : L.Structure N\ninst✝ : L.Structure P\nS : L.Substructure M\ns : Set (L.Substructure M)\nn : ℕ\nf : L.Functions n\nt : L.Substructure M\nh : t ∈ s\n⊢ ClosedUnder f ((fun t ↦ ⋂ (_ : t ∈ s), ↑t) t)",
"used... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Substructures | {
"line": 344,
"column": 2
} | {
"line": 344,
"column": 18
} | [
{
"pp": "L : Language\nM : Type w\ninst✝ : L.Structure M\np : M → Prop\nx : M\ns : Set M\nhs : (closure L).toFun s = ⊤\nHs : ∀ x ∈ s, p x\nHfun : ∀ {n : ℕ} (f : L.Functions n), ClosedUnder f (setOf p)\nthis : ∀ x ∈ (closure L).toFun s, p x\n⊢ p x",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Substructures | {
"line": 393,
"column": 4
} | {
"line": 393,
"column": 55
} | [
{
"pp": "L : Language\nM : Type w\ninst✝ : L.Structure M\nι : Type u_3\nhι : Nonempty ι\nS : ι → L.Substructure M\nhS : Directed (fun x1 x2 ↦ x1 ≤ x2) S\nx : M\nthis : x ∈ (closure L).toFun (⋃ i, ↑(S i)) → ∃ i, x ∈ S i\n⊢ x ∈ ⨆ i, S i → ∃ i, x ∈ S i",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Semantics | {
"line": 929,
"column": 6
} | {
"line": 929,
"column": 38
} | [
{
"pp": "case all.mpr\nL : Language\nM : Type w\nN : Type u_1\ninst✝³ : L.Structure M\ninst✝² : L.Structure N\nα : Type u'\nn : ℕ\nF : Type u_4\ninst✝¹ : EquivLike F M N\ninst✝ : L.StrongHomClass F M N\ng : F\nv : α → M\nn✝ : ℕ\nf✝ : L.BoundedFormula α (n✝ + 1)\nih3 : ∀ {xs : Fin (n✝ + 1) → M}, f✝.Realize (⇑g ∘... | have h' := h (EquivLike.inv g a) | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tacticHave___1 | Lean.Parser.Tactic.tacticHave__ |
Mathlib.ModelTheory.Semantics | {
"line": 1005,
"column": 22
} | {
"line": 1005,
"column": 33
} | [
{
"pp": "L : Language\nM : Type w\ninst✝ : L.Structure M\nn : ℕ\nxs : Fin n → M\nh :\n ∀ (φ : L.BoundedFormula Empty n) (x x_1 : Fin n),\n (decide ¬x = x_1) = true → ∼(var (Sum.inr x) =' var (Sum.inr x_1)) = φ → φ.Realize default xs\ni j : Fin n\nij : i ≠ j\n⊢ (decide ¬i = j) = true",
"usedConstants": [... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Semantics | {
"line": 1007,
"column": 4
} | {
"line": 1007,
"column": 15
} | [
{
"pp": "case refine_2\nL : Language\nM : Type w\ninst✝ : L.Structure M\nn : ℕ\nxs : Nonempty (Fin n ↪ M)\ni j : Fin n\nij : (decide ¬i = j) = true\n⊢ (∼(var (Sum.inr i) =' var (Sum.inr j))).Realize default ⇑xs.some",
"usedConstants": [
"Function.instEmbeddingLikeEmbedding",
"Eq.mpr",
"Inh... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.ElementarySubstructures | {
"line": 190,
"column": 11
} | {
"line": 190,
"column": 38
} | [
{
"pp": "case h.a.h.e'_8.h\nL : Language\nM : Type u_1\ninst✝ : L.Structure M\nA : Set M\nhA : MeetsDefinable A\nn : ℕ\nφ : L.BoundedFormula Empty (n + 1)\nx : Fin n → ↥((closure L).toFun A)\na : M\nhφ : φ.Realize default (Fin.snoc (Subtype.val ∘ x) a)\nD : Set M := {y | φ.Realize default (Fin.snoc (Subtype.val... | cases i using Fin.lastCases | _private.Lean.Elab.Tactic.Induction.0.Lean.Elab.Tactic.evalCases | Lean.Parser.Tactic.cases |
Mathlib.ModelTheory.ElementarySubstructures | {
"line": 215,
"column": 4
} | {
"line": 216,
"column": 58
} | [
{
"pp": "L : Language\nM : Type u_1\ninst✝ : L.Structure M\nS : L.ElementarySubstructure M\nD : Set M\nx : M\nhx : x ∈ D\nφ : L[[↑↑S]].Formula (Fin 1)\nhφ : {x | x 0 ∈ D} = setOf φ.Realize\nhφx : φ.Realize ![x]\nψ : L[[↑↑S]].Sentence := iExs (Fin 1) (relabel Sum.inr φ)\n⊢ M ⊨ ψ",
"usedConstants": [
"F... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Definability | {
"line": 522,
"column": 4
} | {
"line": 522,
"column": 28
} | [
{
"pp": "M : Type u_1\nL : Language\ninst✝¹ : L.Structure M\nA : Set M\nα : Type u_4\nβ : Type u_5\ninst✝ : Finite β\nF : (α → M) → β → M\nhF : DefinableMap L A F\nS : Set (β → M)\nhS : A.Definable L S\ni : β\n⊢ A.Definable L {x | F (x ∘ Sum.inl) i = x (Sum.inr i)}",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Definability | {
"line": 543,
"column": 6
} | {
"line": 543,
"column": 30
} | [
{
"pp": "case some\nM : Type u_1\nL : Language\ninst✝¹ : L.Structure M\nα : Type u_2\nβ : Type u_3\nA : Set M\nf : (α → M) → M\ninst✝ : Finite α\ng : (β → M) → α → M\nhg : DefinableMap L A g\nhf : DefinableFun L A f\nG : (Option β → M) → Option α → M :=\n fun w j ↦\n match j with\n | none => w none\n ... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Definability | {
"line": 545,
"column": 2
} | {
"line": 545,
"column": 43
} | [
{
"pp": "M : Type u_1\nL : Language\ninst✝¹ : L.Structure M\nα : Type u_2\nβ : Type u_3\nA : Set M\nf : (α → M) → M\ninst✝ : Finite α\ng : (β → M) → α → M\nhg : DefinableMap L A g\nhf : DefinableFun L A f\nG : (Option β → M) → Option α → M :=\n fun w j ↦\n match j with\n | none => w none\n | some i =>... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.ElementarySubstructures | {
"line": 233,
"column": 2
} | {
"line": 233,
"column": 18
} | [
{
"pp": "L : Language\nM : Type u_1\ninst✝ : L.Structure M\nS : L.ElementarySubstructure M\nD : Set M\nx : M\nhx : x ∈ D\nφ : L[[↑↑S]].Formula (Fin 1)\nhφ : {x | x 0 ∈ D} = setOf φ.Realize\nhφx : φ.Realize ![x]\nψ : L[[↑↑S]].Sentence := iExs (Fin 1) (relabel Sum.inr φ)\nhψM : M ⊨ ψ\nv' : Fin 1 → ↥S\nhv' : φ.Rea... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Skolem | {
"line": 153,
"column": 6
} | {
"line": 153,
"column": 47
} | [
{
"pp": "case refine_2\nL : Language\nM : Type w\ninst✝ : L.Structure M\ns : Set M\nκ : Cardinal.{w'}\nh3 : lift.{w', max u v} L.card ≤ lift.{max u v, w'} κ\nh4 : lift.{w, w'} κ ≤ lift.{w', w} #M\ns' : Set (ULift.{w', w} M)\nh2 : lift.{w', w} #↑s ≤ #↑s'\nh1 : ℵ₀ ≤ #↑s'\nhs' : #↑s' = lift.{w, w'} κ\nthis : Nonem... | refine _root_.trans (lift_le.{w}.2 h3) ?_ | Lean.Elab.Tactic.evalRefine | Lean.Parser.Tactic.refine |
Mathlib.ModelTheory.Satisfiability | {
"line": 159,
"column": 6
} | {
"line": 160,
"column": 57
} | [
{
"pp": "case a\nL : Language\nα : Type w\nT : L.Theory\ns : Set α\nM : Type w'\ninst✝² : L.Structure M\ninst✝¹ : M ⊨ T\ninst✝ : Infinite M\n⊢ Monotone fun i ↦ (fun a ↦ ↑a) '' ↑i",
"usedConstants": [
"Iff.mpr",
"ChainCompletePartialOrder.instOfCompleteLattice",
"Finset",
"PartialOrde... | exact Monotone.comp (g := Set.image ((↑) : s → α)) (f := ((↑) : Finset s → Set s))
Set.monotone_image fun _ _ => Finset.coe_subset.2 | Lean.Elab.Tactic.evalExact | Lean.Parser.Tactic.exact |
Mathlib.RingTheory.MvPolynomial.FreeCommRing | {
"line": 68,
"column": 6
} | {
"line": 68,
"column": 64
} | [
{
"pp": "case a.h.a\nι : Type u_1\nκ : Type u_2\nR : Type u_3\ninst✝² : DecidableEq κ\ninst✝¹ : CommRing R\ninst✝ : DecidableEq R\nmonoms : ι → Finset (κ →₀ ℕ)\np : { p // ∀ (i : ι), (p i).support ⊆ monoms i }\ni : ι\nm : κ →₀ ℕ\nhm : m ∉ monoms i\nthis : m ∉ (↑p i).support\n⊢ 0 = (↑p i) m",
"usedConstants"... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Satisfiability | {
"line": 379,
"column": 4
} | {
"line": 379,
"column": 15
} | [
{
"pp": "case mp\nL : Language\nT : L.Theory\nφ : L.Sentence\nthis : DecidableEq L.Sentence := Classical.decEq L.Sentence\nh : ∀ (T0 : Finset L.Sentence), ↑T0 ⊆ T ∪ {Formula.not φ} → IsSatisfiable ↑T0\nT0 : Finset L.Sentence\nhT0 : ↑T0 ⊆ T\n⊢ (↑T0 ∪ {Formula.not φ}).IsSatisfiable",
"usedConstants": [
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Satisfiability | {
"line": 381,
"column": 8
} | {
"line": 382,
"column": 60
} | [
{
"pp": "L : Language\nT : L.Theory\nφ : L.Sentence\nthis : DecidableEq L.Sentence := Classical.decEq L.Sentence\nh : ∀ (T0 : Finset L.Sentence), ↑T0 ⊆ T ∪ {Formula.not φ} → IsSatisfiable ↑T0\nT0 : Finset L.Sentence\nhT0 : ↑T0 ⊆ T\n⊢ ↑(T0 ∪ {Formula.not φ}) ⊆ T ∪ {Formula.not φ}",
"usedConstants": [
"... | simp only [Finset.coe_union, Finset.coe_singleton]
exact Set.union_subset_union hT0 (Set.Subset.refl _) | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.ModelTheory.Satisfiability | {
"line": 381,
"column": 8
} | {
"line": 382,
"column": 60
} | [
{
"pp": "L : Language\nT : L.Theory\nφ : L.Sentence\nthis : DecidableEq L.Sentence := Classical.decEq L.Sentence\nh : ∀ (T0 : Finset L.Sentence), ↑T0 ⊆ T ∪ {Formula.not φ} → IsSatisfiable ↑T0\nT0 : Finset L.Sentence\nhT0 : ↑T0 ⊆ T\n⊢ ↑(T0 ∪ {Formula.not φ}) ⊆ T ∪ {Formula.not φ}",
"usedConstants": [
"... | simp only [Finset.coe_union, Finset.coe_singleton]
exact Set.union_subset_union hT0 (Set.Subset.refl _) | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.ModelTheory.Satisfiability | {
"line": 385,
"column": 10
} | {
"line": 385,
"column": 21
} | [
{
"pp": "L : Language\nT : L.Theory\nφ : L.Sentence\nthis : DecidableEq L.Sentence := Classical.decEq L.Sentence\nh : ∀ (T0 : Finset L.Sentence), ↑T0 ⊆ T → (↑T0 ∪ {Formula.not φ}).IsSatisfiable\nT0 : Finset L.Sentence\nhT0 : ↑T0 ⊆ T ∪ {Formula.not φ}\n⊢ ↑(T0.erase (Formula.not φ)) ⊆ T",
"usedConstants": [
... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Algebra.Field.IsAlgClosed | {
"line": 197,
"column": 29
} | {
"line": 197,
"column": 67
} | [
{
"pp": "φ : Language.ring.Sentence\nT0 : Finset Language.ring.Sentence\nhT0 : ↑T0 ⊆ Theory.ACF 0\nh : ↑T0 ⊨ᵇ φ\np : ℕ\nhp : p ∈ {q | Nat.Prime q}\nq : ℕ\nproperty✝ : Nat.Prime q\nhq : ⟨q, property✝⟩ ∉ {⟨p, hp⟩}\nK : Type\nstruc✝ : Language.ring.Structure K\nis_model✝ : K ⊨ Theory.ACF ↑⟨q, property✝⟩\nnonempty'... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.ModelTheory.Algebra.Field.IsAlgClosed | {
"line": 225,
"column": 2
} | {
"line": 226,
"column": 79
} | [
{
"pp": "φ : Language.ring.Sentence\n⊢ ¬Theory.ACF 0 ⊨ᵇ φ → ¬{p | Theory.ACF ↑p ⊨ᵇ φ}.Infinite",
"usedConstants": [
"Eq.mpr",
"FirstOrder.Language.ring",
"Nat.Prime",
"setOf",
"FirstOrder.Language.Theory.ACF",
"FirstOrder.Language.Theory.ModelsBoundedFormula",
"Set.... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.AxGrothendieck | {
"line": 87,
"column": 2
} | {
"line": 87,
"column": 43
} | [
{
"pp": "case intro\nι : Type u_1\nK : Type u_2\nR : Type u_3\ninst✝⁴ : Field K\ninst✝³ : Finite K\ninst✝² : CommRing R\ninst✝¹ : Finite ι\ninst✝ : Algebra K R\nalg : Algebra.IsAlgebraic K R\nps : ι → MvPolynomial ι R\nS : Set (ι → R)\nhm : Set.MapsTo (fun v i ↦ (eval v) (ps i)) S S\nhinj : Set.InjOn (fun v i ↦... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.AxGrothendieck | {
"line": 164,
"column": 2
} | {
"line": 164,
"column": 49
} | [
{
"pp": "ι : Type u_1\nα : Type u_2\ninst✝³ : Finite α\nK : Type u_3\ninst✝² : Field K\ninst✝¹ : CompatibleRing K\ninst✝ : Finite ι\nφ : ring.Formula (α ⊕ ι)\nmons : ι → Finset (ι →₀ ℕ)\ninjOnAlt : ∀ {S : Set (ι → K)} (f : (ι → K) → ι → K), Set.InjOn f S ↔ ∀ (x y : ι → K), x ∈ S → y ∈ S → f x = f y → x = y\n⊢ (... | simp +singlePass only [← Sum.elim_comp_inl_inr] | Lean.Elab.Tactic.evalSimp | Lean.Parser.Tactic.simp |
Mathlib.FieldTheory.AxGrothendieck | {
"line": 247,
"column": 2
} | {
"line": 247,
"column": 13
} | [
{
"pp": "K : Type u_1\nι : Type u_2\ninst✝² : Field K\ninst✝¹ : IsAlgClosed K\ninst✝ : Finite ι\np : ι → MvPolynomial ι K\n⊢ (Function.Injective fun v i ↦ (eval v) (p i)) → Function.Surjective fun v i ↦ (eval v) (p i)",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.Localization.Cardinality | {
"line": 49,
"column": 2
} | {
"line": 49,
"column": 13
} | [
{
"pp": "R : Type u\ninst✝³ : CommSemiring R\nL : Type u\ninst✝² : CommSemiring L\ninst✝¹ : Algebra R L\nS : Submonoid R\ninst✝ : IsLocalization S L\n⊢ #L ≤ #R",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.Localization.Cardinality | {
"line": 79,
"column": 2
} | {
"line": 79,
"column": 13
} | [
{
"pp": "R : Type u\ninst✝³ : CommRing R\nL : Type u\ninst✝² : CommRing L\ninst✝¹ : Algebra R L\nS : Submonoid R\ninst✝ : IsLocalization S L\nhS : S ≤ R⁰\n⊢ #L = #R",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.Localization.Cardinality | {
"line": 79,
"column": 2
} | {
"line": 79,
"column": 36
} | [
{
"pp": "R : Type u\ninst✝³ : CommRing R\nL : Type u\ninst✝² : CommRing L\ninst✝¹ : Algebra R L\nS : Submonoid R\ninst✝ : IsLocalization S L\nhS : S ≤ R⁰\n⊢ #L = #R",
"usedConstants": [
"IsLocalization.lift_cardinalMk",
"Cardinal",
"congrArg",
"Cardinal.lift",
"Cardinal.mk",
... | simpa using lift_cardinalMk L S hS | Lean.Elab.Tactic.Simpa.evalSimpa | Lean.Parser.Tactic.simpa |
Mathlib.RingTheory.Localization.Cardinality | {
"line": 79,
"column": 2
} | {
"line": 79,
"column": 36
} | [
{
"pp": "R : Type u\ninst✝³ : CommRing R\nL : Type u\ninst✝² : CommRing L\ninst✝¹ : Algebra R L\nS : Submonoid R\ninst✝ : IsLocalization S L\nhS : S ≤ R⁰\n⊢ #L = #R",
"usedConstants": [
"IsLocalization.lift_cardinalMk",
"Cardinal",
"congrArg",
"Cardinal.lift",
"Cardinal.mk",
... | simpa using lift_cardinalMk L S hS | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.RingTheory.Localization.Cardinality | {
"line": 79,
"column": 2
} | {
"line": 79,
"column": 36
} | [
{
"pp": "R : Type u\ninst✝³ : CommRing R\nL : Type u\ninst✝² : CommRing L\ninst✝¹ : Algebra R L\nS : Submonoid R\ninst✝ : IsLocalization S L\nhS : S ≤ R⁰\n⊢ #L = #R",
"usedConstants": [
"IsLocalization.lift_cardinalMk",
"Cardinal",
"congrArg",
"Cardinal.lift",
"Cardinal.mk",
... | simpa using lift_cardinalMk L S hS | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.FieldTheory.Cardinality | {
"line": 68,
"column": 4
} | {
"line": 69,
"column": 56
} | [
{
"pp": "case inl\nα : Type u\nh : Fintype α\n⊢ Nonempty (Field α) ↔ ℵ₀ ≤ #α ∨ ∃ n, #α = ↑n ∧ IsPrimePow n",
"usedConstants": [
"Eq.mpr",
"NonAssocSemiring.toAddCommMonoidWithOne",
"False",
"eq_false",
"Cardinal",
"congrArg",
"CommSemiring.toSemiring",
"Cardin... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.Cardinality | {
"line": 70,
"column": 4
} | {
"line": 70,
"column": 68
} | [
{
"pp": "case inr\nα : Type u\nh : Infinite α\n⊢ Nonempty (Field α) ↔ ℵ₀ ≤ #α ∨ ∃ n, #α = ↑n ∧ IsPrimePow n",
"usedConstants": [
"Eq.mpr",
"_private.Mathlib.FieldTheory.Cardinality.0.Field.nonempty_iff._simp_1_3",
"Cardinal",
"congrArg",
"true_or",
"IsPrimePow",
"if... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.SetTheory.Cardinal.Divisibility | {
"line": 91,
"column": 2
} | {
"line": 91,
"column": 96
} | [
{
"pp": "a : Cardinal.{u}\nha : ℵ₀ ≤ a\nh : ∀ ⦃a_1 b : Cardinal.{u}⦄, a = a_1 * b → IsUnit a_1 ∨ IsUnit b\n⊢ False",
"usedConstants": []
}
] | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.GroupTheory.OreLocalization.Cardinality | {
"line": 92,
"column": 2
} | {
"line": 107,
"column": 7
} | [
{
"pp": "R : Type u\ninst✝² : Monoid R\nS : Submonoid R\ninst✝¹ : OreSet S\nX : Type v\ninst✝ : MulAction R X\nhc : ∀ (s s' : ↥S), Commute s s'\n⊢ #(OreLocalization S X) ≤ lift.{u, v} #X",
"usedConstants": [
"Eq.mpr",
"OreLocalization.oreDiv_eq_iff",
"OreLocalization.oreDiv_one_surjective_... | rcases finite_or_infinite X with _ | _
· have := lift_mk_le_lift_mk_of_surjective (oreDiv_one_surjective_of_finite_right S X)
rwa [lift_umax.{v, u}, lift_id'] at this
have key (x : X) (s s' : S) (h : s • x = s' • x) (hc : Commute s s') : x /ₒ s = x /ₒ s' := by
rw [oreDiv_eq_iff]
refine ⟨s, s'.1, h, ?_⟩
... | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.GroupTheory.OreLocalization.Cardinality | {
"line": 92,
"column": 2
} | {
"line": 107,
"column": 7
} | [
{
"pp": "R : Type u\ninst✝² : Monoid R\nS : Submonoid R\ninst✝¹ : OreSet S\nX : Type v\ninst✝ : MulAction R X\nhc : ∀ (s s' : ↥S), Commute s s'\n⊢ #(OreLocalization S X) ≤ lift.{u, v} #X",
"usedConstants": [
"Eq.mpr",
"OreLocalization.oreDiv_eq_iff",
"OreLocalization.oreDiv_one_surjective_... | rcases finite_or_infinite X with _ | _
· have := lift_mk_le_lift_mk_of_surjective (oreDiv_one_surjective_of_finite_right S X)
rwa [lift_umax.{v, u}, lift_id'] at this
have key (x : X) (s s' : S) (h : s • x = s' • x) (hc : Commute s s') : x /ₒ s = x /ₒ s' := by
rw [oreDiv_eq_iff]
refine ⟨s, s'.1, h, ?_⟩
... | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.FieldTheory.Differential.Liouville | {
"line": 92,
"column": 4
} | {
"line": 92,
"column": 57
} | [
{
"pp": "F : Type u_1\nK : Type u_2\ninst✝⁸ : Field F\ninst✝⁷ : Field K\ninst✝⁶ : Differential F\ninst✝⁵ : Differential K\ninst✝⁴ : Algebra F K\ninst✝³ : DifferentialAlgebra F K\ninst✝² : CharZero F\nB : IntermediateField F K\ninst✝¹ : FiniteDimensional F ↥B\ninst : IsLiouville F K\na : F\nι : Type\ninst✝ : Fin... | apply inst.isLiouville a ι c hc (B.val ∘ u) (B.val v) | Lean.Elab.Tactic.evalApply | Lean.Parser.Tactic.apply |
Mathlib.FieldTheory.Differential.Liouville | {
"line": 117,
"column": 4
} | {
"line": 117,
"column": 89
} | [
{
"pp": "F : Type u_1\nK : Type u_2\ninst✝¹² : Field F\ninst✝¹¹ : Field K\ninst✝¹⁰ : Differential F\ninst✝⁹ : Differential K\ninst✝⁸ : Algebra F K\ninst✝⁷ : DifferentialAlgebra F K\ninst✝⁶ : CharZero F\nK' : Type u_3\ninst✝⁵ : Field K'\ninst✝⁴ : Differential K'\ninst✝³ : Algebra F K'\ninst✝² : DifferentialAlgeb... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.Finite.Extension | {
"line": 150,
"column": 2
} | {
"line": 150,
"column": 13
} | [
{
"pp": "k : Type u_1\ninst✝⁶ : Field k\ninst✝⁵ : Finite k\np : ℕ\ninst✝⁴ : Fact (Nat.Prime p)\ninst✝³ : CharP k p\nl : Type u_2\ninst✝² : Field l\ninst✝¹ : Algebra k l\ninst✝ : Finite l\ng : Gal(l/k)\nn : ℕ := Module.finrank k l\nthis : NeZero n\ni : ℕ\nleft✝ : i < n\nhi : Extension.frob k p n ^ i = (algEquivE... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.Finite.Extension | {
"line": 175,
"column": 4
} | {
"line": 175,
"column": 33
} | [
{
"pp": "case inr.inl.refine_1\nK : Type u_2\ninst✝ : Field K\nn : ℕ\nf : K[X]\nhi : Irreducible f\nh : f ∣ X ^ Nat.card K ^ n - X\nhn : n ≠ 0\nh✝ : Finite K\np : ℕ\nhp : CharP K p\nthis✝ : Fact (Nat.Prime p)\nthis : NeZero n\n⊢ (Polynomial.map (algebraMap K (Extension K p n)) (X ^ Nat.card K ^ n - X)).Splits",... | apply IsSplittingField.splits | Lean.Elab.Tactic.evalApply | Lean.Parser.Tactic.apply |
Mathlib.FieldTheory.Finite.Extension | {
"line": 175,
"column": 4
} | {
"line": 175,
"column": 33
} | [
{
"pp": "case inr.inl.refine_1\nK : Type u_2\ninst✝ : Field K\nn : ℕ\nf : K[X]\nhi : Irreducible f\nh : f ∣ X ^ Nat.card K ^ n - X\nhn : n ≠ 0\nh✝ : Finite K\np : ℕ\nhp : CharP K p\nthis✝ : Fact (Nat.Prime p)\nthis : NeZero n\n⊢ (Polynomial.map (algebraMap K (Extension K p n)) (X ^ Nat.card K ^ n - X)).Splits",... | apply IsSplittingField.splits | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.FieldTheory.Finite.Extension | {
"line": 175,
"column": 4
} | {
"line": 175,
"column": 33
} | [
{
"pp": "case inr.inl.refine_1\nK : Type u_2\ninst✝ : Field K\nn : ℕ\nf : K[X]\nhi : Irreducible f\nh : f ∣ X ^ Nat.card K ^ n - X\nhn : n ≠ 0\nh✝ : Finite K\np : ℕ\nhp : CharP K p\nthis✝ : Fact (Nat.Prime p)\nthis : NeZero n\n⊢ (Polynomial.map (algebraMap K (Extension K p n)) (X ^ Nat.card K ^ n - X)).Splits",... | apply IsSplittingField.splits | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.FieldTheory.Differential.Liouville | {
"line": 187,
"column": 6
} | {
"line": 193,
"column": 30
} | [
{
"pp": "F : Type u_1\nK : Type u_2\ninst✝⁹ : Field F\ninst✝⁸ : Field K\ninst✝⁷ : Differential F\ninst✝⁶ : Differential K\ninst✝⁵ : Algebra F K\ninst✝⁴ : DifferentialAlgebra F K\ninst✝³ : CharZero F\ninst✝² : FiniteDimensional F K\ninst✝¹ : IsGalois F K\na : F\nι : Type\ninst✝ : Fintype ι\nc : ι → F\nhc : ∀ (x ... | · rcongr e
apply_fun e at h
simp only [AlgEquiv.commutes, map_add, map_sum, map_mul] at h
convert! h using 2
· rcongr x
simp [logDeriv, algEquiv_deriv']
· rw [algEquiv_deriv'] | Lean.Elab.Tactic.evalTacticCDot | Lean.cdot |
Mathlib.FieldTheory.Finite.Polynomial | {
"line": 137,
"column": 6
} | {
"line": 137,
"column": 91
} | [
{
"pp": "case intro.refine_2.h\nK : Type u_1\nσ : Type u_2\ninst✝² : Field K\ninst✝¹ : Fintype K\ninst✝ : Finite σ\nval✝ : Fintype σ\ne : (σ → K) → K\nx✝ : e ∈ ⊤\nn : σ → K\n⊢ e n * (eval n) (indicator n) = e n",
"usedConstants": [
"MvPolynomial.eval_indicator_apply_eq_one",
"Finsupp.instAddZero... | aesop (add simp [eval_indicator_apply_eq_zero, eval_indicator_apply_eq_one, eq_comm]) | Aesop.evalAesop | Aesop.Frontend.Parser.aesopTactic |
Mathlib.FieldTheory.Finite.Polynomial | {
"line": 137,
"column": 6
} | {
"line": 137,
"column": 91
} | [
{
"pp": "case intro.refine_2.h.h₀\nK : Type u_1\nσ : Type u_2\ninst✝² : Field K\ninst✝¹ : Fintype K\ninst✝ : Finite σ\nval✝ : Fintype σ\ne : (σ → K) → K\nx✝ : e ∈ ⊤\nn : σ → K\n⊢ ∀ b ∈ Finset.univ, b ≠ n → e b * (eval n) (indicator b) = 0",
"usedConstants": [
"Finsupp.instAddZeroClass",
"False",... | aesop (add simp [eval_indicator_apply_eq_zero, eval_indicator_apply_eq_one, eq_comm]) | Aesop.evalAesop | Aesop.Frontend.Parser.aesopTactic |
Mathlib.FieldTheory.Finite.Polynomial | {
"line": 137,
"column": 6
} | {
"line": 137,
"column": 91
} | [
{
"pp": "case intro.refine_2.h.h₁\nK : Type u_1\nσ : Type u_2\ninst✝² : Field K\ninst✝¹ : Fintype K\ninst✝ : Finite σ\nval✝ : Fintype σ\ne : (σ → K) → K\nx✝ : e ∈ ⊤\nn : σ → K\n⊢ n ∉ Finset.univ → e n * (eval n) (indicator n) = 0",
"usedConstants": [
"Finsupp.instAddZeroClass",
"False",
"N... | aesop (add simp [eval_indicator_apply_eq_zero, eval_indicator_apply_eq_one, eq_comm]) | Aesop.evalAesop | Aesop.Frontend.Parser.aesopTactic |
Mathlib.FieldTheory.Finite.Polynomial | {
"line": 203,
"column": 2
} | {
"line": 203,
"column": 27
} | [
{
"pp": "case intro\nσ K : Type u\ninst✝² : Fintype K\ninst✝¹ : Field K\ninst✝ : Finite σ\nval✝ : Fintype σ\n⊢ Module.rank K (R σ K) < ℵ₀",
"usedConstants": [
"Eq.mpr",
"Preorder.toLT",
"Cardinal",
"congrArg",
"AddCommGroup.toAddCommMonoid",
"MvPolynomial.rank_R",
"... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.Discriminant | {
"line": 235,
"column": 4
} | {
"line": 235,
"column": 51
} | [
{
"pp": "case a.e_a.refine_1\nK : Type u\nL : Type v\ninst✝⁴ : Field K\ninst✝³ : Field L\ninst✝² : Algebra K L\ninst✝¹ : Module.Finite K L\npb : PowerBasis K L\ninst✝ : Algebra.IsSeparable K L\nE : Type v := AlgebraicClosure L\nthis : (a b : E) → Decidable (a = b) := fun a b ↦ Classical.propDecidable (a = b)\ne... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.Discriminant | {
"line": 261,
"column": 4
} | {
"line": 261,
"column": 29
} | [
{
"pp": "K : Type u\nL : Type v\ninst✝¹⁰ : Field K\ninst✝⁹ : Field L\ninst✝⁸ : Algebra K L\ninst✝⁷ : Module.Finite K L\nR : Type z\ninst✝⁶ : CommRing R\ninst✝⁵ : Algebra R K\ninst✝⁴ : Algebra R L\ninst✝³ : IsScalarTower R K L\ninst✝² : Algebra.IsSeparable K L\ninst✝¹ : IsIntegrallyClosed R\ninst✝ : IsFractionRi... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.CardinalEmb | {
"line": 137,
"column": 8
} | {
"line": 138,
"column": 83
} | [
{
"pp": "case inl\nF : Type u\nE : Type v\ninst✝³ : Field F\ninst✝² : Field E\ninst✝¹ : Algebra F E\nrank_inf : Fact (ℵ₀ ≤ Module.rank F E)\ninst✝ : Algebra.IsAlgebraic F E\ni : (Module.rank F E).ord.ToType\nih : (y : (Module.rank F E).ord.ToType) → y < i → (Module.rank F E).ord.ToType\ns : Set E := failed to p... | have : FiniteDimensional F (adjoin F s) :=
finiteDimensional_adjoin fun x _ ↦ (IsAlgebraic.isAlgebraic x).isIntegral | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_tacticHave___1 | Lean.Parser.Tactic.tacticHave__ |
Mathlib.FieldTheory.CardinalEmb | {
"line": 149,
"column": 70
} | {
"line": 151,
"column": 71
} | [
{
"pp": "F : Type u\nE : Type v\ninst✝³ : Field F\ninst✝² : Field E\ninst✝¹ : Algebra F E\nrank_inf : Fact (ℵ₀ ≤ Module.rank F E)\ninst✝ : Algebra.IsAlgebraic F E\ni : (Module.rank F E).ord.ToType\n⊢ IsLeast {k | b k ∉ adjoin F (⇑b ∘ φ '' Iio i)} (φ i)",
"usedConstants": [
"Eq.mpr",
"WellFounded... | by
rw [image_eq_range, leastExt, wellFounded_lt.fix_eq]
exact ⟨wellFounded_lt.min_mem _ _, fun _ ↦ (wellFounded_lt.min_le ·)⟩ | [anonymous] | Lean.Parser.Term.byTactic |
Mathlib.RingTheory.Invariant.Basic | {
"line": 73,
"column": 4
} | {
"line": 73,
"column": 17
} | [
{
"pp": "A : Type u_1\nK : Type u_2\nL : Type u_3\nB : Type u_4\ninst✝¹⁵ : CommRing A\ninst✝¹⁴ : CommRing B\ninst✝¹³ : Field K\ninst✝¹² : Field L\ninst✝¹¹ : Algebra A K\ninst✝¹⁰ : Algebra B L\ninst✝⁹ : IsFractionRing A K\ninst✝⁸ : IsFractionRing B L\ninst✝⁷ : Algebra A B\ninst✝⁶ : Algebra K L\ninst✝⁵ : Algebra ... | rintro ⟨g, -⟩ | _private.Lean.Elab.Tactic.RCases.0.Lean.Elab.Tactic.RCases.evalRIntro | Lean.Parser.Tactic.rintro |
Mathlib.RingTheory.Invariant.Basic | {
"line": 100,
"column": 4
} | {
"line": 100,
"column": 26
} | [
{
"pp": "A : Type u_1\nB : Type u_2\ninst✝⁶ : CommRing A\ninst✝⁵ : CommRing B\ninst✝⁴ : Algebra A B\nG : Type u_3\ninst✝³ : Group G\ninst✝² : MulSemiringAction G B\ninst✝¹ : SMulCommClass G A B\nH : Subgroup G\ninst✝ : H.Normal\ng : G\nx : ↥(FixedPoints.subring B ↥H)\nh : ↥H\n⊢ h • g • ↑x = g • ↑x",
"usedCo... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.RingTheory.Invariant.Basic | {
"line": 103,
"column": 4
} | {
"line": 103,
"column": 26
} | [
{
"pp": "case h.a\nA : Type u_1\nB : Type u_2\ninst✝⁶ : CommRing A\ninst✝⁵ : CommRing B\ninst✝⁴ : Algebra A B\nG : Type u_3\ninst✝³ : Group G\ninst✝² : MulSemiringAction G B\ninst✝¹ : SMulCommClass G A B\nH : Subgroup G\ninst✝ : H.Normal\na b : G\nhb : { unop' := b } ∈ H.op\nc : ↥(FixedPoints.subring B ↥H)\n⊢ ↑... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.Galois.NormalBasis | {
"line": 54,
"column": 35
} | {
"line": 54,
"column": 64
} | [
{
"pp": "case h.e'_4.h.h\nK : Type u_1\nL : Type u_2\ninst✝³ : Field K\ninst✝² : Field L\ninst✝¹ : Algebra K L\ninst✝ : Finite L\nthis✝ : Finite K\nthis : Fintype K\nx : L\nhx :\n Ideal.span {X ^ finrank K L - 1} =\n (toSpanSingleton K[X] (AEval' (frobeniusAlgHom K L).toLinearMap)\n ((AEval'.of (frob... | LinearMap.coe_restrictScalars | Mathlib.Tactic._aux_Mathlib_Tactic_SimpRw___elabRules_Mathlib_Tactic_tacticSimp_rw____1 | null |
Mathlib.FieldTheory.Galois.NormalBasis | {
"line": 83,
"column": 4
} | {
"line": 84,
"column": 11
} | [
{
"pp": "case a\nK : Type u_1\nL : Type u_2\ninst✝⁴ : Field K\ninst✝³ : Field L\ninst✝² : Algebra K L\ninst✝¹ : FiniteDimensional K L\ninst✝ : Infinite K\ne : Module.Basis (Module.Free.ChooseBasisIndex K L) K L\nM : Matrix Gal(L/K) Gal(L/K) (MvPolynomial (Module.Free.ChooseBasisIndex K L) L) :=\n Matrix.of fun... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.Galois.NormalBasis | {
"line": 87,
"column": 4
} | {
"line": 87,
"column": 20
} | [
{
"pp": "K : Type u_1\nL : Type u_2\ninst✝⁴ : Field K\ninst✝³ : Field L\ninst✝² : Algebra K L\ninst✝¹ : FiniteDimensional K L\ninst✝ : Infinite K\ne : Module.Basis (Module.Free.ChooseBasisIndex K L) K L\nM : Matrix Gal(L/K) Gal(L/K) (MvPolynomial (Module.Free.ChooseBasisIndex K L) L) :=\n Matrix.of fun i j ↦ ∑... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.Galois.NormalBasis | {
"line": 95,
"column": 4
} | {
"line": 95,
"column": 15
} | [
{
"pp": "K : Type u_1\nL : Type u_2\ninst✝⁴ : Field K\ninst✝³ : Field L\ninst✝² : Algebra K L\ninst✝¹ : FiniteDimensional K L\ninst✝ : Infinite K\ne : Module.Basis (Module.Free.ChooseBasisIndex K L) K L\nM : Matrix Gal(L/K) Gal(L/K) (MvPolynomial (Module.Free.ChooseBasisIndex K L) L) :=\n Matrix.of fun i j ↦ ∑... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.Topology.Separation.Connected | {
"line": 27,
"column": 6
} | {
"line": 27,
"column": 72
} | [
{
"pp": "X : Type u_1\ninst✝ : TopologicalSpace X\nh : TotallyDisconnectedSpace X\nx : X\n⊢ IsClosed[inst✝] {x}",
"usedConstants": [
"Eq.mpr",
"totallyDisconnectedSpace_iff_connectedComponent_singleton",
"congrArg",
"Set.instSingletonSet",
"id",
"connectedComponent",
... | ← totallyDisconnectedSpace_iff_connectedComponent_singleton.mp h x | Lean.Elab.Tactic.evalRewriteSeq | null |
Mathlib.RingTheory.Invariant.Basic | {
"line": 331,
"column": 6
} | {
"line": 331,
"column": 39
} | [
{
"pp": "case neg\nA : Type u_1\nB : Type u_2\ninst✝¹⁸ : CommRing A\ninst✝¹⁷ : CommRing B\ninst✝¹⁶ : Algebra A B\nG : Type u_3\ninst✝¹⁵ : Group G\ninst✝¹⁴ : Finite G\ninst✝¹³ : MulSemiringAction G B\ninst✝¹² : SMulCommClass G A B\nP : Ideal A\nQ : Ideal B\ninst✝¹¹ : Q.IsPrime\ninst✝¹⁰ : Q.LiesOver P\nK : Type u... | rw [map_zero, map_zero, sub_zero] | Lean.Parser.Tactic._aux_Init_Tactics___macroRules_Lean_Parser_Tactic_rwSeq_1 | Lean.Parser.Tactic.rwSeq |
Mathlib.RingTheory.Invariant.Basic | {
"line": 331,
"column": 6
} | {
"line": 331,
"column": 39
} | [
{
"pp": "case neg\nA : Type u_1\nB : Type u_2\ninst✝¹⁸ : CommRing A\ninst✝¹⁷ : CommRing B\ninst✝¹⁶ : Algebra A B\nG : Type u_3\ninst✝¹⁵ : Group G\ninst✝¹⁴ : Finite G\ninst✝¹³ : MulSemiringAction G B\ninst✝¹² : SMulCommClass G A B\nP : Ideal A\nQ : Ideal B\ninst✝¹¹ : Q.IsPrime\ninst✝¹⁰ : Q.LiesOver P\nK : Type u... | rw [map_zero, map_zero, sub_zero] | Lean.Elab.Tactic.evalTacticSeq1Indented | Lean.Parser.Tactic.tacticSeq1Indented |
Mathlib.RingTheory.Invariant.Basic | {
"line": 331,
"column": 6
} | {
"line": 331,
"column": 39
} | [
{
"pp": "case neg\nA : Type u_1\nB : Type u_2\ninst✝¹⁸ : CommRing A\ninst✝¹⁷ : CommRing B\ninst✝¹⁶ : Algebra A B\nG : Type u_3\ninst✝¹⁵ : Group G\ninst✝¹⁴ : Finite G\ninst✝¹³ : MulSemiringAction G B\ninst✝¹² : SMulCommClass G A B\nP : Ideal A\nQ : Ideal B\ninst✝¹¹ : Q.IsPrime\ninst✝¹⁰ : Q.LiesOver P\nK : Type u... | rw [map_zero, map_zero, sub_zero] | Lean.Elab.Tactic.evalTacticSeq | Lean.Parser.Tactic.tacticSeq |
Mathlib.FieldTheory.Galois.IsGaloisGroup | {
"line": 63,
"column": 30
} | {
"line": 63,
"column": 46
} | [
{
"pp": "G : Type u_1\nA : Type u_2\nB : Type u_4\ninst✝⁶ : Group G\ninst✝⁵ : CommSemiring A\ninst✝⁴ : Semiring B\ninst✝³ : Algebra A B\ninst✝² : MulSemiringAction G B\nhG : IsGaloisGroup G A B\nH : Type u_5\ninst✝¹ : Group H\ninst✝ : MulSemiringAction H B\ne : H ≃* G\nhe : ∀ (h : H) (x : B), e h • x = h • x\nx... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.Galois.IsGaloisGroup | {
"line": 66,
"column": 45
} | {
"line": 66,
"column": 62
} | [
{
"pp": "G : Type u_1\nA : Type u_2\nB : Type u_4\ninst✝⁶ : Group G\ninst✝⁵ : CommSemiring A\ninst✝⁴ : Semiring B\ninst✝³ : Algebra A B\ninst✝² : MulSemiringAction G B\nhG : IsGaloisGroup G A B\nH : Type u_5\ninst✝¹ : Group H\ninst✝ : MulSemiringAction H B\ne : H ≃* G\nhe : ∀ (h : H) (x : B), e h • x = h • x\nb... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Mathlib.FieldTheory.Galois.IsGaloisGroup | {
"line": 99,
"column": 20
} | {
"line": 99,
"column": 49
} | [
{
"pp": "G : Type u_1\nA : Type u_2\nA' : Type u_3\nB : Type u_4\ninst✝⁵ : Group G\ninst✝⁴ : CommSemiring A\ninst✝³ : Semiring B\ninst✝² : Algebra A B\ninst✝¹ : MulSemiringAction G B\ninst✝ : FaithfulSMul A B\nhA : IsGaloisGroup G A B\nx : ↥(FixedPoints.subsemiring B G)\n⊢ (fun x ↦ ⟨(algebraMap A B) x, ⋯⟩) ((fu... | simpa using | Lean.Elab.Tactic.Simpa.evalSimpa | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.