file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/LinearAlgebra/Alternating.lean | AlternatingMap.curryLeft_smul | [] | [
1272,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1270,
1
] |
Mathlib/Data/Finsupp/Defs.lean | Finsupp.single_eq_update | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.41852\nγ : Type ?u.41855\nι : Type ?u.41858\nM : Type u_2\nM' : Type ?u.41864\nN : Type ?u.41867\nP : Type ?u.41870\nG : Type ?u.41873\nH : Type ?u.41876\nR : Type ?u.41879\nS : Type ?u.41882\ninst✝¹ : Zero M\na✝ a' : α\nb✝ : M\ninst✝ :... | [
338,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
336,
1
] |
Mathlib/Topology/LocalHomeomorph.lean | LocalHomeomorph.trans_symm_eq_symm_trans_symm | [] | [
816,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
816,
1
] |
Mathlib/Logic/Embedding/Set.lean | Function.Embedding.codRestrict_apply | [] | [
72,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/ModelTheory/Satisfiability.lean | FirstOrder.Language.Theory.SemanticallyEquivalent.symm | [
{
"state_after": "L : Language\nT : Theory L\nα : Type w\nn : ℕ\nφ ψ : BoundedFormula L α n\nh : SemanticallyEquivalent T φ ψ\nM : ModelType T\nv : α → ↑M\nxs : Fin n → ↑M\n⊢ BoundedFormula.Realize (φ ⇔ ψ) v xs",
"state_before": "L : Language\nT : Theory L\nα : Type w\nn : ℕ\nφ ψ : BoundedFormula L α n\nh :... | [
433,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
430,
1
] |
Mathlib/Order/CompleteLattice.lean | sSup_image' | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nβ₂ : Type ?u.64182\nγ : Type ?u.64185\nι : Sort ?u.64188\nι' : Sort ?u.64191\nκ : ι → Sort ?u.64196\nκ' : ι' → Sort ?u.64201\ninst✝ : SupSet α\nf✝ g : ι → α\ns : Set β\nf : β → α\n⊢ sSup (f '' s) = ⨆ (a : ↑s), f ↑a",
"tactic": "rw... | [
681,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
680,
1
] |
Mathlib/Dynamics/PeriodicPts.lean | Function.periodicOrbit_chain' | [
{
"state_after": "α : Type u_1\nβ : Type ?u.36142\nf✝ fa : α → α\nfb : β → β\nx✝ y : α\nm n : ℕ\nr : α → α → Prop\nf : α → α\nx : α\nhx : x ∈ periodicPts f\n⊢ (∀ (n : ℕ), n < minimalPeriod f x → r ((f^[n]) x) ((f^[n + 1]) x)) ↔ ∀ (n : ℕ), r ((f^[n]) x) ((f^[n + 1]) x)",
"state_before": "α : Type u_1\nβ : Ty... | [
586,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
580,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.erase_singleton | [] | [
1025,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1024,
1
] |
Mathlib/Topology/Algebra/Order/Compact.lean | IsCompact.isGLB_sInf | [] | [
169,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/Analysis/InnerProductSpace/Adjoint.lean | ContinuousLinearMap.star_eq_adjoint | [] | [
221,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
220,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.prodSumDistrib_apply_left | [] | [
943,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
941,
1
] |
Std/Data/RBMap/WF.lean | Std.RBNode.Balanced.ins | [
{
"state_after": "no goals",
"state_before": "case nil\nα : Type u_1\nc : RBColor\nn : Nat\ncmp : α → α → Ordering\nv : α\nt : RBNode α\n⊢ RedRed (isRed nil = red) (ins cmp v nil) 0",
"tactic": "exact .balanced (.red .nil .nil)"
},
{
"state_after": "case red\nα : Type u_1\nc : RBColor\nn✝ : Nat\... | [
215,
37
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
194,
11
] |
Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean | MeasureTheory.ProbabilityMeasure.toFiniteMeasure_embedding | [] | [
264,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
260,
1
] |
Mathlib/Algebra/Hom/GroupAction.lean | DistribMulActionHom.map_add | [] | [
309,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
308,
11
] |
Mathlib/Topology/NhdsSet.lean | nhdsSet_diagonal | [
{
"state_after": "α✝ : Type ?u.6536\nβ : Type ?u.6539\ninst✝² : TopologicalSpace α✝\ninst✝¹ : TopologicalSpace β\ns t s₁ s₂ t₁ t₂ : Set α✝\nx : α✝\nα : Type u_1\ninst✝ : TopologicalSpace (α × α)\n⊢ sSup (range (𝓝 ∘ fun x => (x, x))) = ⨆ (x : α), 𝓝 (x, x)",
"state_before": "α✝ : Type ?u.6536\nβ : Type ?u.6... | [
47,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Mathlib/CategoryTheory/Limits/Constructions/Over/Products.lean | CategoryTheory.Over.ConstructProducts.over_finiteProducts_of_finiteWidePullbacks | [] | [
163,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | dist_eq_norm_div | [] | [
378,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
377,
1
] |
Mathlib/MeasureTheory/Group/FundamentalDomain.lean | MeasureTheory.fundamentalFrontier_smul | [
{
"state_after": "no goals",
"state_before": "G : Type u_3\nH : Type u_1\nα : Type u_2\nβ : Type ?u.495604\nE : Type ?u.495607\ninst✝⁴ : Group G\ninst✝³ : MulAction G α\ns : Set α\nx : α\ninst✝² : Group H\ninst✝¹ : MulAction H α\ninst✝ : SMulCommClass H G α\ng : H\n⊢ fundamentalFrontier G (g • s) = g • fund... | [
618,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
616,
1
] |
Mathlib/Algebra/Order/Group/Abs.lean | abs_le | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedAddCommGroup α\na b c d : α\n⊢ abs a ≤ b ↔ -b ≤ a ∧ a ≤ b",
"tactic": "rw [abs_le', and_comm, @neg_le α]"
}
] | [
237,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Order/LocallyFinite.lean | Finset.mem_Iic | [] | [
420,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
419,
1
] |
Mathlib/Logic/Equiv/Option.lean | Equiv.optionCongr_symm | [] | [
53,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
52,
1
] |
Mathlib/Algebra/GroupPower/Ring.lean | coe_powMonoidWithZeroHom | [] | [
127,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/Analysis/Normed/Group/Hom.lean | NormedAddGroupHom.zero_comp | [
{
"state_after": "case H\nV : Type ?u.478704\nV₁ : Type u_1\nV₂ : Type u_2\nV₃ : Type u_3\ninst✝³ : SeminormedAddCommGroup V\ninst✝² : SeminormedAddCommGroup V₁\ninst✝¹ : SeminormedAddCommGroup V₂\ninst✝ : SeminormedAddCommGroup V₃\nf✝ g f : NormedAddGroupHom V₁ V₂\nx✝ : V₁\n⊢ ↑(NormedAddGroupHom.comp 0 f) x✝ =... | [
698,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
696,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearEquiv.symm_apply_eq | [] | [
2109,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2108,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.hasBasis_nhds_of_ne_top' | [
{
"state_after": "case inl\nα : Type ?u.61484\nβ : Type ?u.61487\nγ : Type ?u.61490\na b c d : ℝ≥0∞\nr p q : ℝ≥0\ny z ε ε₁ ε₂ : ℝ≥0∞\ns : Set ℝ≥0∞\nxt : 0 ≠ ⊤\n⊢ HasBasis (𝓝 0) (fun x => x ≠ 0) fun ε => Icc (0 - ε) (0 + ε)\n\ncase inr\nα : Type ?u.61484\nβ : Type ?u.61487\nγ : Type ?u.61490\na b c d : ℝ≥0∞\nr ... | [
250,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Algebra/Group/Prod.lean | MulHom.coe_snd | [] | [
330,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
329,
1
] |
Mathlib/Analysis/Convex/Cone/Basic.lean | ConvexCone.pointed_positive | [] | [
598,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
597,
1
] |
Mathlib/Data/Finset/NoncommProd.lean | Multiset.noncommProd_empty | [] | [
140,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/ModelTheory/Syntax.lean | FirstOrder.Language.BoundedFormula.relabel_falsum | [] | [
607,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
605,
1
] |
Mathlib/Algebra/Hom/Equiv/Basic.lean | MulHom.toMulEquiv_symm_apply | [] | [
753,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
750,
1
] |
Mathlib/LinearAlgebra/PiTensorProduct.lean | PiTensorProduct.tmul_apply | [
{
"state_after": "ι : Type u_1\nι₂ : Type u_2\nι₃ : Type ?u.627942\nR : Type u_3\ninst✝⁷ : CommSemiring R\nR₁ : Type ?u.627951\nR₂ : Type ?u.627954\ns : ι → Type ?u.627959\ninst✝⁶ : (i : ι) → AddCommMonoid (s i)\ninst✝⁵ : (i : ι) → Module R (s i)\nM : Type u_4\ninst✝⁴ : AddCommMonoid M\ninst✝³ : Module R M\nE :... | [
610,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
607,
9
] |
Mathlib/Data/List/AList.lean | AList.insert_entries | [] | [
270,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.piecewise_empty | [
{
"state_after": "case h\nα : Type u_1\nβ : Type ?u.294612\nγ : Type ?u.294615\nδ : α → Sort u_2\ns : Finset α\nf g : (i : α) → δ i\ninst✝ : (i : α) → Decidable (i ∈ ∅)\ni : α\n⊢ piecewise ∅ f g i = g i",
"state_before": "α : Type u_1\nβ : Type ?u.294612\nγ : Type ?u.294615\nδ : α → Sort u_2\ns : Finset α\n... | [
2451,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2449,
1
] |
Mathlib/Analysis/InnerProductSpace/Positive.lean | ContinuousLinearMap.IsPositive.conj_adjoint | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\nF : Type u_3\ninst✝⁶ : IsROrC 𝕜\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedAddCommGroup F\ninst✝³ : InnerProductSpace 𝕜 E\ninst✝² : InnerProductSpace 𝕜 F\ninst✝¹ : CompleteSpace E\ninst✝ : CompleteSpace F\nT : E →L[𝕜] E\nhT : IsPositive T\nS : E →L[𝕜] F\nx... | [
98,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/Topology/Separation.lean | isClosed_eq | [] | [
1179,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1177,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | pi_le_borel_pi | [
{
"state_after": "α : Type ?u.1048612\nβ : Type ?u.1048615\nγ : Type ?u.1048618\nγ₂ : Type ?u.1048621\nδ : Type ?u.1048624\nι✝ : Sort y\ns t u : Set α\ninst✝¹² : TopologicalSpace α\ninst✝¹¹ : MeasurableSpace α\ninst✝¹⁰ : BorelSpace α\ninst✝⁹ : TopologicalSpace β\ninst✝⁸ : MeasurableSpace β\ninst✝⁷ : BorelSpace ... | [
999,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
993,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.cons_subset | [] | [
889,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
888,
1
] |
Mathlib/Algebra/Associated.lean | Associates.mkMonoidHom_apply | [] | [
848,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
847,
1
] |
Mathlib/Geometry/Euclidean/Sphere/Basic.lean | EuclideanGeometry.inner_pos_of_dist_lt_radius | [
{
"state_after": "case pos\nV : Type u_2\nP : Type u_1\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerProductSpace ℝ V\ninst✝¹ : MetricSpace P\ninst✝ : NormedAddTorsor V P\ns : Sphere P\np₁ p₂ : P\nhp₁ : p₁ ∈ s\nhp₂ : dist p₂ s.center < s.radius\nh : p₁ = p₂\n⊢ 0 < inner (p₁ -ᵥ p₂) (p₁ -ᵥ s.center)\n\ncase neg\n... | [
376,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
371,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | MeasureTheory.Measure.ext_of_Ioc' | [
{
"state_after": "case refine'_1\nα✝ : Type ?u.689331\nβ : Type ?u.689334\nγ : Type ?u.689337\nγ₂ : Type ?u.689340\nδ : Type ?u.689343\nι : Sort y\ns t u : Set α✝\ninst✝²² : TopologicalSpace α✝\ninst✝²¹ : MeasurableSpace α✝\ninst✝²⁰ : OpensMeasurableSpace α✝\ninst✝¹⁹ : TopologicalSpace β\ninst✝¹⁸ : MeasurableSp... | [
723,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
718,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.IsRadical.radical_le_iff | [] | [
896,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
895,
1
] |
Mathlib/Algebra/Divisibility/Units.lean | Units.mul_left_dvd | [
{
"state_after": "α : Type u_1\ninst✝ : CommMonoid α\na b : α\nu : αˣ\n⊢ a * ↑u ∣ b ↔ a ∣ b",
"state_before": "α : Type u_1\ninst✝ : CommMonoid α\na b : α\nu : αˣ\n⊢ ↑u * a ∣ b ↔ a ∣ b",
"tactic": "rw [mul_comm]"
},
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : CommMono... | [
64,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/LinearAlgebra/BilinearForm.lean | BilinForm.linMulLin_apply | [] | [
731,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
730,
1
] |
Mathlib/Analysis/NormedSpace/Basic.lean | nnnorm_algebraMap_nNReal | [] | [
531,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
530,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.memℒp_top_const | [
{
"state_after": "α : Type u_2\nE : Type u_1\nF : Type ?u.1271944\nG : Type ?u.1271947\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\nc : E\n⊢ snorm (fun x => c) ⊤ μ < ⊤",
"state_before": "α : Type u_2\... | [
339,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
334,
1
] |
Mathlib/Data/Set/Function.lean | Set.MapsTo.restrict_eq_codRestrict | [] | [
366,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
364,
1
] |
Mathlib/Data/Finmap.lean | Finmap.keys_replace | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : α → Type v\ninst✝ : DecidableEq α\na : α\nb : β a\ns✝ : Finmap β\ns : AList β\n⊢ keys (replace a b ⟦s⟧) = keys ⟦s⟧",
"tactic": "simp"
}
] | [
380,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
379,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.map_zero | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.178625\nδ : Type ?u.178628\nι : Type ?u.178631\nR : Type ?u.178634\nR' : Type ?u.178637\nm0 : MeasurableSpace α\ninst✝¹ : MeasurableSpace β\ninst✝ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set α\nf :... | [
1177,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1176,
1
] |
Mathlib/Algebra/ContinuedFractions/ContinuantsRecurrence.lean | GeneralizedContinuedFraction.continuants_recurrenceAux | [
{
"state_after": "no goals",
"state_before": "K : Type u_1\ng : GeneralizedContinuedFraction K\nn : ℕ\ninst✝ : DivisionRing K\ngp ppred pred : Pair K\nnth_s_eq : Stream'.Seq.get? g.s n = some gp\nnth_conts_aux_eq : continuantsAux g n = ppred\nsucc_nth_conts_aux_eq : continuantsAux g (n + 1) = pred\n⊢ contin... | [
41,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
36,
1
] |
Mathlib/CategoryTheory/Limits/Constructions/ZeroObjects.lean | CategoryTheory.Limits.inr_coprodZeroIso_hom | [
{
"state_after": "C : Type u_2\ninst✝² : Category C\ninst✝¹ : HasZeroObject C\ninst✝ : HasZeroMorphisms C\nX : C\n⊢ coprod.inl ≫\n (colimit.isoColimitCocone\n { cocone := BinaryCofan.mk (𝟙 X) 0, isColimit := binaryCofanZeroRightIsColimit X }).hom =\n 𝟙 X",
"state_before": "C : Type u_2\ni... | [
151,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
1
] |
Mathlib/RingTheory/Polynomial/Basic.lean | Polynomial.natDegree_restriction | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type ?u.74744\ninst✝ : Ring R\np : R[X]\n⊢ natDegree (restriction p) = natDegree p",
"tactic": "simp [natDegree]"
}
] | [
311,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
310,
1
] |
Mathlib/Analysis/Convex/Independent.lean | ConvexIndependent.mem_convexHull_iff | [] | [
130,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
11
] |
Mathlib/Algebra/Algebra/Equiv.lean | AlgEquiv.one_apply | [] | [
671,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
670,
1
] |
Mathlib/Algebra/Module/LocalizedModule.lean | IsLocalizedModule.mk'_sub_mk' | [
{
"state_after": "no goals",
"state_before": "R : Type u_3\ninst✝¹² : CommRing R\nS : Submonoid R\nM✝ : Type ?u.872148\nM'✝ : Type ?u.872151\nM'' : Type ?u.872154\ninst✝¹¹ : AddCommMonoid M✝\ninst✝¹⁰ : AddCommMonoid M'✝\ninst✝⁹ : AddCommMonoid M''\ninst✝⁸ : Module R M✝\ninst✝⁷ : Module R M'✝\ninst✝⁶ : Modul... | [
998,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
995,
1
] |
Mathlib/Topology/UniformSpace/Cauchy.lean | cauchy_nhds | [] | [
86,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Topology/Basic.lean | Dense.open_subset_closure_inter | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\na : α\ns✝ s₁ s₂ t✝ : Set α\np p₁ p₂ : α → Prop\ninst✝ : TopologicalSpace α\ns t : Set α\nhs : Dense s\nht : IsOpen t\n⊢ t = t ∩ closure s",
"tactic": "rw [hs.closure_eq, inter_univ]"
}
] | [
1401,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1397,
1
] |
Mathlib/CategoryTheory/Subobject/Limits.lean | CategoryTheory.Limits.kernelSubobject_factors_iff | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝² : Category C\nX Y Z : C\ninst✝¹ : HasZeroMorphisms C\nf : X ⟶ Y\ninst✝ : HasKernel f\nW : C\nh : W ⟶ X\nw : Factors (kernelSubobject f) h\n⊢ h ≫ f = 0",
"tactic": "rw [← Subobject.factorThru_arrow _ _ w, Category.assoc, kernelSubobject_arr... | [
128,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/NumberTheory/LegendreSymbol/MulCharacter.lean | MulChar.map_zero | [
{
"state_after": "no goals",
"state_before": "R✝ : Type u\ninst✝³ : CommMonoid R✝\nR' : Type v\ninst✝² : CommMonoidWithZero R'\nR : Type u\ninst✝¹ : CommMonoidWithZero R\ninst✝ : Nontrivial R\nχ : MulChar R R'\n⊢ ↑χ 0 = 0",
"tactic": "rw [map_nonunit χ not_isUnit_zero]"
}
] | [
275,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
274,
11
] |
Mathlib/Order/Filter/Basic.lean | Filter.mem_iInf | [
{
"state_after": "case mp\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.69710\nι✝ : Sort x\nf g : Filter α\ns✝ t : Set α\nι : Type u_1\ns : ι → Filter α\nU : Set α\n⊢ (U ∈ ⨅ (i : ι), s i) → ∃ I, Set.Finite I ∧ ∃ V, (∀ (i : ↑I), V i ∈ s ↑i) ∧ U = ⋂ (i : ↑I), V i\n\ncase mpr\nα : Type u\nβ : Type v\nγ : Type w... | [
613,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
596,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.valid_singleton | [] | [
1127,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1126,
1
] |
Mathlib/Algebra/EuclideanDomain/Basic.lean | EuclideanDomain.xgcdAux_P | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝¹ : EuclideanDomain R\ninst✝ : DecidableEq R\na b r r' s t s' t' : R\np : EuclideanDomain.P a b (r, s, t)\np' : EuclideanDomain.P a b (r', s', t')\n⊢ EuclideanDomain.P a b (xgcdAux r s t r' s' t')",
"tactic": "induction r, r' using GCD.induc... | [
223,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/Data/Set/Basic.lean | Set.compl_ne_univ | [] | [
1688,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1687,
1
] |
Mathlib/GroupTheory/OrderOfElement.lean | orderOf_dvd_of_mem_zpowers | [
{
"state_after": "case intro\nG : Type u\nA : Type v\nx : G\na b : A\nn m : ℕ\ninst✝¹ : Group G\ninst✝ : AddGroup A\ni k : ℤ\nh : x ^ k ∈ Subgroup.zpowers x\n⊢ orderOf (x ^ k) ∣ orderOf x",
"state_before": "G : Type u\nA : Type v\nx y : G\na b : A\nn m : ℕ\ninst✝¹ : Group G\ninst✝ : AddGroup A\ni : ℤ\nh : y... | [
609,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
606,
1
] |
Mathlib/Algebra/MonoidAlgebra/Basic.lean | MonoidAlgebra.induction_on | [
{
"state_after": "case refine'_1\nk : Type u₁\nG : Type u₂\nR : Type ?u.1051513\ninst✝¹ : Semiring k\ninst✝ : Monoid G\np : MonoidAlgebra k G → Prop\nf : MonoidAlgebra k G\nhM : ∀ (g : G), p (↑(of k G) g)\nhadd : ∀ (f g : MonoidAlgebra k G), p f → p g → p (f + g)\nhsmul : ∀ (r : k) (f : MonoidAlgebra k G), p f ... | [
844,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
837,
1
] |
Mathlib/Topology/Algebra/Group/Basic.lean | TopologicalGroup.t3Space | [] | [
1447,
5
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1446,
1
] |
Mathlib/Topology/SubsetProperties.lean | isIrreducible_iff_sInter | [
{
"state_after": "case refine_1\nα : Type u\nβ : Type v\nι : Type ?u.192116\nπ : ι → Type ?u.192121\ninst✝¹ : TopologicalSpace α\ninst✝ : TopologicalSpace β\ns✝ t s : Set α\nh : IsIrreducible s\nU : Finset (Set α)\nhu : ∀ (u : Set α), u ∈ U → IsOpen u\nhU : ∀ (u : Set α), u ∈ U → Set.Nonempty (s ∩ u)\n⊢ Set.Non... | [
1920,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1907,
1
] |
Mathlib/RingTheory/IntegralClosure.lean | isIntegral_map_of_comp_eq_of_isIntegral | [
{
"state_after": "R✝ : Type ?u.130170\nA : Type ?u.130173\nB : Type ?u.130176\nS✝ : Type ?u.130179\ninst✝¹¹ : CommRing R✝\ninst✝¹⁰ : CommRing A\ninst✝⁹ : CommRing B\ninst✝⁸ : CommRing S✝\ninst✝⁷ : Algebra R✝ A\ninst✝⁶ : Algebra R✝ B\nf : R✝ →+* S✝\nR : Type u_1\nS : Type u_2\nT : Type u_3\nU : Type u_4\ninst✝⁵ ... | [
144,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
136,
1
] |
Mathlib/Data/ENat/Basic.lean | ENat.coe_toNat_le_self | [] | [
164,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
1
] |
Mathlib/Topology/Semicontinuous.lean | lowerSemicontinuousAt_biSup | [] | [
592,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
589,
1
] |
Mathlib/NumberTheory/Multiplicity.lean | multiplicity.pow_prime_pow_sub_pow_prime_pow | [
{
"state_after": "case zero\nR : Type u_1\nn : ℕ\ninst✝² : CommRing R\na b x y : R\np : ℕ\ninst✝¹ : IsDomain R\ninst✝ : DecidableRel fun x x_1 => x ∣ x_1\nhp : Prime ↑p\nhp1 : Odd p\nhxy : ↑p ∣ x - y\nhx : ¬↑p ∣ x\n⊢ multiplicity (↑p) (x ^ p ^ Nat.zero - y ^ p ^ Nat.zero) = multiplicity (↑p) (x - y) + ↑Nat.zero... | [
195,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Analysis/BoxIntegral/Integrability.lean | BoxIntegral.HasIntegral.of_aeEq_zero | [
{
"state_after": "ι : Type u\nE : Type v\ninst✝³ : Fintype ι\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℝ E\nl : IntegrationParams\nI : Box ι\nf : (ι → ℝ) → E\nμ : MeasureTheory.Measure (ι → ℝ)\ninst✝ : IsLocallyFiniteMeasure μ\nhf : f =ᵐ[Measure.restrict μ ↑I] 0\nhl : l.bRiemann = false\nε : ℝ\nε0 : ... | [
154,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
106,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.mul_le_mul | [] | [
447,
62
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
446,
11
] |
Mathlib/Topology/SubsetProperties.lean | IsClosed.locallyCompactSpace | [] | [
1197,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1195,
11
] |
Mathlib/ModelTheory/Definability.lean | Set.Definable.image_comp_equiv | [
{
"state_after": "M : Type w\nA : Set M\nL : Language\ninst✝ : Structure L M\nα : Type u₁\nβ : Type u_1\nB : Set M\ns✝ : Set (α → M)\ns : Set (β → M)\nh : Definable A L s\nf : α ≃ β\n⊢ (fun g => g ∘ ↑f.symm) ⁻¹' s = (fun g => g ∘ ↑f) '' s",
"state_before": "M : Type w\nA : Set M\nL : Language\ninst✝ : Struc... | [
171,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/Computability/Primrec.lean | Nat.Primrec.sub | [
{
"state_after": "p : ℕ\n⊢ Nat.rec (unpair p).fst (fun y IH => Nat.pred IH) (unpair p).snd = (unpair p).fst - (unpair p).snd",
"state_before": "p : ℕ\n⊢ unpaired (fun z n => Nat.rec (id z) (fun y IH => Nat.pred (unpair (unpair (Nat.pair z (Nat.pair y IH))).snd).snd) n)\n p =\n unpaired (fun x x_1 =>... | [
140,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/Order/RelIso/Basic.lean | RelHomClass.isIrrefl | [] | [
83,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
11
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | LocalEquiv.IsImage.of_image_eq | [] | [
429,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
428,
1
] |
Mathlib/Combinatorics/Additive/Etransform.lean | Finset.mulDysonEtransform.smul_finset_snd_subset_fst | [
{
"state_after": "α : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : CommGroup α\ne : α\nx : Finset α × Finset α\n⊢ e • (x.snd ∩ e⁻¹ • x.fst) ⊆ x.fst ∪ e • x.snd",
"state_before": "α : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : CommGroup α\ne : α\nx : Finset α × Finset α\n⊢ e • (mulDysonEtransform e x).snd ⊆ (mul... | [
95,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/Analysis/Normed/Field/InfiniteSum.lean | tsum_mul_tsum_of_summable_norm | [] | [
59,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
1
] |
Mathlib/Data/Nat/PartENat.lean | PartENat.withTopEquiv_symm_lt | [
{
"state_after": "x y : ℕ∞\n⊢ ↑withTopEquiv (↑withTopEquiv.symm x) < ↑withTopEquiv (↑withTopEquiv.symm y) ↔ x < y",
"state_before": "x y : ℕ∞\n⊢ ↑withTopEquiv.symm x < ↑withTopEquiv.symm y ↔ x < y",
"tactic": "rw [← withTopEquiv_lt]"
},
{
"state_after": "no goals",
"state_before": "x y : ℕ∞\... | [
743,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
741,
1
] |
Mathlib/Algebra/Homology/ShortExact/Preadditive.lean | CategoryTheory.Splitting.inl_comp_iso_eq | [
{
"state_after": "no goals",
"state_before": "𝒜 : Type u_2\ninst✝² : Category 𝒜\nA B C A' B' C' : 𝒜\nf : A ⟶ B\ng : B ⟶ C\nf' : A' ⟶ B'\ng' : B' ⟶ C'\ninst✝¹ : HasZeroMorphisms 𝒜\ninst✝ : HasBinaryBiproducts 𝒜\nh : Splitting f g\n⊢ biprod.inl ≫ h.iso.inv = f",
"tactic": "rw [Iso.comp_inv_eq, h.comp... | [
195,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.integrable_const_mul_iff | [] | [
1099,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1097,
1
] |
Mathlib/Data/Polynomial/CancelLeads.lean | Polynomial.neg_cancelLeads | [] | [
51,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
50,
1
] |
Mathlib/Order/Heyting/Basic.lean | sdiff_bot | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.94184\nα : Type u_1\nβ : Type ?u.94190\ninst✝ : GeneralizedCoheytingAlgebra α\na b✝ c d b : α\n⊢ a \\ ⊥ ≤ b ↔ a ≤ b",
"tactic": "rw [sdiff_le_iff, bot_sup_eq]"
}
] | [
601,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
600,
1
] |
Mathlib/Data/Finset/Image.lean | Finset.apply_coe_mem_map | [] | [
100,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
99,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.Tendsto.prod_map_prod_atBot | [
{
"state_after": "ι : Type ?u.283686\nι' : Type ?u.283689\nα : Type u_2\nβ : Type u_3\nγ : Type u_1\ninst✝ : SemilatticeInf γ\nF : Filter α\nG : Filter β\nf : α → γ\ng : β → γ\nhf : Tendsto f F atBot\nhg : Tendsto g G atBot\n⊢ Tendsto (Prod.map f g) (F ×ˢ G) (atBot ×ˢ atBot)",
"state_before": "ι : Type ?u.2... | [
1444,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1440,
1
] |
Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean | Asymptotics.isEquivalent_iff_exists_eq_mul | [
{
"state_after": "α : Type u_1\nβ : Type u_2\ninst✝ : NormedField β\nt u v w : α → β\nl : Filter α\n⊢ (∃ φ _hφ, u - v =ᶠ[l] φ * v) ↔ ∃ φ x, u =ᶠ[l] φ * v",
"state_before": "α : Type u_1\nβ : Type u_2\ninst✝ : NormedField β\nt u v w : α → β\nl : Filter α\n⊢ u ~[l] v ↔ ∃ φ x, u =ᶠ[l] φ * v",
"tactic": "rw... | [
206,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.nonempty_Icc | [] | [
271,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Mathlib/Topology/Separation.lean | TopologicalSpace.IsTopologicalBasis.exists_closure_subset | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝¹ : TopologicalSpace α\ninst✝ : RegularSpace α\na✝ : α\ns✝ : Set α\nB : Set (Set α)\nhB : IsTopologicalBasis B\na : α\ns : Set α\nh : s ∈ 𝓝 a\n⊢ ∃ t, t ∈ B ∧ a ∈ t ∧ closure t ⊆ s",
"tactic": "simpa only [exists_prop, and_assoc]... | [
1567,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1564,
1
] |
Mathlib/Algebra/Module/Equiv.lean | AddEquiv.toNatLinearEquiv_symm | [] | [
823,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
822,
1
] |
Mathlib/Data/Set/Sups.lean | Set.sups_subset_left | [] | [
90,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Data/MvPolynomial/Variables.lean | MvPolynomial.degreeOf_eq_sup | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nσ : Type u_1\nτ : Type ?u.279512\nr : R\ne : ℕ\nn✝ m : σ\ns : σ →₀ ℕ\ninst✝ : CommSemiring R\np q : MvPolynomial σ R\nn : σ\nf : MvPolynomial σ R\n⊢ degreeOf n f = Finset.sup (support f) fun m => ↑m n",
"tactic": "classical\nrw [degre... | [
502,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
496,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.map_le_iff_le_comap | [
{
"state_after": "case intro.intro.intro.intro\nι : Sort ?u.241583\n𝕜 : Type ?u.241586\nV : Type u\nW : Type v\nX : Type w\nG✝ : SimpleGraph V\nG'✝ : SimpleGraph W\na b c u✝ v✝ w : V\ne : Sym2 V\nf : V ↪ W\nG : SimpleGraph V\nG' : SimpleGraph W\nh : G ≤ SimpleGraph.comap (↑f) G'\nu v : V\nha : Adj G u v\n⊢ Adj... | [
1292,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1288,
1
] |
Mathlib/Topology/Order/Basic.lean | exists_seq_strictAnti_tendsto' | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝⁷ : TopologicalSpace α\ninst✝⁶ : TopologicalSpace β\ninst✝⁵ : LinearOrder α\ninst✝⁴ : LinearOrder β\ninst✝³ : OrderTopology α\ninst✝² : OrderTopology β\ninst✝¹ : DenselyOrdered α\ninst✝ : FirstCountableTopology α\nx y : α... | [
2174,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2171,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.zero_or_succ_or_limit | [] | [
304,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
300,
1
] |
Mathlib/Data/Fin/Tuple/Basic.lean | Fin.range_cons | [
{
"state_after": "no goals",
"state_before": "m n✝ : ℕ\nα✝ : Fin (n✝ + 1) → Type u\nx✝ : α✝ 0\nq : (i : Fin (n✝ + 1)) → α✝ i\np : (i : Fin n✝) → α✝ (succ i)\ni : Fin n✝\ny : α✝ (succ i)\nz : α✝ 0\nα : Type u_1\nn : ℕ\nx : α\nb : Fin n → α\n⊢ Set.range (cons x b) = insert x (Set.range b)",
"tactic": "rw ... | [
284,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/Topology/LocalHomeomorph.lean | LocalHomeomorph.eventually_nhds | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.33371\nδ : Type ?u.33374\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\ne✝ : LocalHomeomorph α β\ne' : LocalHomeomorph β γ\ne : LocalHomeomorph α β\nx : ... | [
398,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
396,
1
] |
Mathlib/Algebra/Order/Floor.lean | Nat.floor_div_eq_div | [
{
"state_after": "case h.e'_3.h.e'_5\nF : Type ?u.97534\nα : Type u_1\nβ : Type ?u.97540\ninst✝¹ : LinearOrderedSemifield α\ninst✝ : FloorSemiring α\nm n : ℕ\n⊢ m = ⌊↑m⌋₊",
"state_before": "F : Type ?u.97534\nα : Type u_1\nβ : Type ?u.97540\ninst✝¹ : LinearOrderedSemifield α\ninst✝ : FloorSemiring α\nm n : ... | [
526,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
524,
1
] |
Mathlib/ModelTheory/Basic.lean | FirstOrder.Language.Embedding.map_fun | [] | [
622,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
620,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.cons_union_distrib | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.187851\nγ : Type ?u.187854\ninst✝ : DecidableEq α\ns✝ t✝ u : Multiset α\na✝ b a : α\ns t : Multiset α\n⊢ a ::ₘ (s ∪ t) = a ::ₘ s ∪ a ::ₘ t",
"tactic": "simpa using add_union_distrib (a ::ₘ 0) s t"
}
] | [
1856,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1855,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.