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/Analysis/Calculus/ContDiff.lean | contDiff_const | [
{
"state_after": "𝕜 : Type u_1\ninst✝¹⁰ : NontriviallyNormedField 𝕜\nD : Type uD\ninst✝⁹ : NormedAddCommGroup D\ninst✝⁸ : NormedSpace 𝕜 D\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : Normed... | [
94,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Algebra/CharZero/Lemmas.lean | half_sub | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝¹ : DivisionRing R\ninst✝ : CharZero R\na : R\n⊢ a / 2 - a = -(a / 2)",
"tactic": "rw [← neg_sub, sub_half]"
}
] | [
173,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/LinearAlgebra/Matrix/Determinant.lean | Matrix.det_neg | [
{
"state_after": "no goals",
"state_before": "m : Type ?u.1375840\nn : Type u_1\ninst✝⁴ : DecidableEq n\ninst✝³ : Fintype n\ninst✝² : DecidableEq m\ninst✝¹ : Fintype m\nR : Type v\ninst✝ : CommRing R\nA : Matrix n n R\n⊢ det (-A) = (-1) ^ Fintype.card n * det A",
"tactic": "rw [← det_smul, neg_one_smul]... | [
293,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
292,
1
] |
Mathlib/Algebra/Regular/SMul.lean | IsSMulRegular.not_zero_iff | [
{
"state_after": "R : Type u_1\nS : Type ?u.26076\nM : Type u_2\na b : R\ns : S\ninst✝⁶ : MonoidWithZero R\ninst✝⁵ : MonoidWithZero S\ninst✝⁴ : Zero M\ninst✝³ : MulActionWithZero R M\ninst✝² : MulActionWithZero R S\ninst✝¹ : MulActionWithZero S M\ninst✝ : IsScalarTower R S M\n⊢ (¬∃ x y, x ≠ y) ↔ ∀ (x y : M), x ... | [
204,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Metric.cthickening_max_zero | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.102452\nα : Type u\nβ : Type v\ninst✝ : PseudoEMetricSpace α\nδ✝ ε : ℝ\ns t : Set α\nx : α\nδ : ℝ\nE : Set α\n⊢ cthickening (max 0 δ) E = cthickening δ E",
"tactic": "cases le_total δ 0 <;> simp [cthickening_of_nonpos, *]"
}
] | [
1072,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1071,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.vecMulVec_eq | [
{
"state_after": "case a.h\nl : Type ?u.832218\nm : Type u_1\nn : Type u_2\no : Type ?u.832227\nm' : o → Type ?u.832232\nn' : o → Type ?u.832237\nR : Type ?u.832240\nS : Type ?u.832243\nα : Type v\nβ : Type w\nγ : Type ?u.832250\ninst✝¹ : Mul α\ninst✝ : AddCommMonoid α\nw : m → α\nv : n → α\ni✝ : m\nx✝ : n\n⊢ v... | [
1668,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1664,
1
] |
Mathlib/Data/Matrix/Kronecker.lean | Matrix.kroneckerMapBilinear_mul_mul | [
{
"state_after": "case a.mk.h.mk\nR : Type u_1\nα : Type u_4\nα' : Type ?u.35756\nβ : Type u_5\nβ' : Type ?u.35762\nγ : Type u_6\nγ' : Type ?u.35768\nl : Type u_7\nm : Type u_2\nn : Type u_8\np : Type ?u.35780\nq : Type ?u.35783\nr : Type ?u.35786\nl' : Type u_9\nm' : Type u_3\nn' : Type u_10\np' : Type ?u.3579... | [
222,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Order/Antichain.lean | IsAntichain.image_embedding | [] | [
155,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/Topology/MetricSpace/EMetricSpace.lean | EMetric.diam_triple | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.296899\ninst✝ : PseudoEMetricSpace α\nx y z : α\nε ε₁ ε₂ : ℝ≥0∞\ns t : Set α\n⊢ diam {x, y, z} = max (max (edist x y) (edist x z)) (edist y z)",
"tactic": "simp only [diam_insert, iSup_insert, iSup_singleton, diam_singleto... | [
935,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
933,
1
] |
Mathlib/Algebra/Order/ToIntervalMod.lean | toIocMod_zsmul_add | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedAddCommGroup α\nhα : Archimedean α\np : α\nhp : 0 < p\na✝ b✝ c : α\nn : ℤ\na b : α\nm : ℤ\n⊢ toIocMod hp a (m • p + b) = toIocMod hp a b",
"tactic": "rw [add_comm, toIocMod_add_zsmul]"
}
] | [
441,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
440,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.inf_le | [] | [
407,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
406,
1
] |
Mathlib/Analysis/NormedSpace/lpSpace.lean | lp.coeFn_star | [] | [
746,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
745,
1
] |
Mathlib/Data/Polynomial/EraseLead.lean | Polynomial.eraseLead_monomial | [
{
"state_after": "case pos\nR : Type u_1\ninst✝ : Semiring R\nf : R[X]\ni : ℕ\nr : R\nhr : r = 0\n⊢ eraseLead (↑(monomial i) r) = 0\n\ncase neg\nR : Type u_1\ninst✝ : Semiring R\nf : R[X]\ni : ℕ\nr : R\nhr : ¬r = 0\n⊢ eraseLead (↑(monomial i) r) = 0",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nf : R... | [
134,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | Real.sin_int_mul_pi | [] | [
274,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
1
] |
Mathlib/Dynamics/OmegaLimit.lean | omegaLimit_inter | [] | [
170,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.Lf.not_equiv' | [] | [
791,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
791,
1
] |
Mathlib/RingTheory/PolynomialAlgebra.lean | PolyEquivTensor.toFunLinear_mul_tmul_mul_aux_1 | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nA : Type u_2\ninst✝² : CommSemiring R\ninst✝¹ : Semiring A\ninst✝ : Algebra R A\np : R[X]\nk : ℕ\nh : Decidable ¬coeff p k = 0\na : A\n⊢ (if ¬coeff p k = 0 then a * ↑(algebraMap R A) (coeff p k) else 0) = a * ↑(algebraMap R A) (coeff p k)",
"ta... | [
87,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.span_singleton_mul_le_span_singleton_mul | [
{
"state_after": "no goals",
"state_before": "R : Type u\nι : Type ?u.234437\ninst✝ : CommSemiring R\nI✝ J✝ K L : Ideal R\nx y : R\nI J : Ideal R\n⊢ span {x} * I ≤ span {y} * J ↔ ∀ (zI : R), zI ∈ I → ∃ zJ, zJ ∈ J ∧ x * zI = y * zJ",
"tactic": "simp only [span_singleton_mul_le_iff, mem_span_singleton_mul... | [
565,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
563,
1
] |
Mathlib/Order/SuccPred/Basic.lean | Order.lt_succ_iff_of_not_isMax | [] | [
254,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
253,
1
] |
Mathlib/Control/Functor/Multivariate.lean | MvFunctor.LiftP_PredLast_iff | [
{
"state_after": "n : ℕ\nF : TypeVec (n + 1) → Type u_1\ninst✝¹ : MvFunctor F\ninst✝ : LawfulMvFunctor F\nα : TypeVec n\nβ✝ : Type u\npp : β✝ → Prop\nβ : Type u\nP : β → Prop\nx : F (α ::: β)\n⊢ (∃ u, (fun i => Subtype.val) <$$> u = x) ↔ ∃ u, (fun i => Subtype.val) <$$> u = x",
"state_before": "n : ℕ\nF : T... | [
202,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean | NNReal.one_le_rpow_of_pos_of_le_one_of_nonpos | [] | [
231,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
1
] |
Mathlib/Topology/NoetherianSpace.lean | TopologicalSpace.NoetherianSpace.iUnion | [
{
"state_after": "α : Type u_2\nβ : Type ?u.6819\ninst✝² : TopologicalSpace α\ninst✝¹ : TopologicalSpace β\nι : Type u_1\nf : ι → Set α\ninst✝ : Finite ι\nhf : ∀ (i : ι) (t : Set α), t ⊆ f i → IsCompact t\n⊢ ∀ (t : Set α), (t ⊆ ⋃ (i : ι), f i) → IsCompact t",
"state_before": "α : Type u_2\nβ : Type ?u.6819\... | [
158,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.lift_iSup_le_iff | [
{
"state_after": "α β : Type u\nι : Type v\nf : ι → Cardinal\nhf : BddAbove (range f)\nt : Cardinal\n⊢ (⨆ (i : ι), lift (f i)) ≤ t ↔ ∀ (i : ι), lift (f i) ≤ t",
"state_before": "α β : Type u\nι : Type v\nf : ι → Cardinal\nhf : BddAbove (range f)\nt : Cardinal\n⊢ lift (iSup f) ≤ t ↔ ∀ (i : ι), lift (f i) ≤ t... | [
1204,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1201,
1
] |
Mathlib/Order/Filter/Germ.lean | Filter.Germ.coe_div | [] | [
470,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
469,
1
] |
Mathlib/Data/Set/Image.lean | Set.range_subset_singleton | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.89762\nγ : Type ?u.89765\nι : Sort u_2\nι' : Sort ?u.89771\nf✝ : ι → α\ns t : Set α\nf : ι → α\nx : α\n⊢ range f ⊆ {x} ↔ f = const ι x",
"tactic": "simp [range_subset_iff, funext_iff, mem_singleton]"
}
] | [
1037,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1036,
1
] |
Mathlib/Data/Finset/Sups.lean | Finset.disjSups_union_right | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝³ : DecidableEq α\ninst✝² : SemilatticeSup α\ninst✝¹ : OrderBot α\ninst✝ : DecidableRel Disjoint\ns s₁ s₂ t t₁ t₂ u : Finset α\na b c : α\n⊢ s ○ (t₁ ∪ t₂) = s ○ t₁ ∪ s ○ t₂",
"tactic": "simp [disjSups, filter_union, image_union]"
}
] | [
506,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
505,
1
] |
Mathlib/Topology/Separation.lean | Filter.limUnder_eq_iff | [] | [
1062,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1060,
1
] |
Mathlib/LinearAlgebra/Lagrange.lean | Lagrange.nodal_eq | [] | [
492,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
491,
1
] |
Mathlib/Analysis/NormedSpace/lpSpace.lean | lp.coeFn_sum | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nE : α → Type u_3\np q : ℝ≥0∞\ninst✝ : (i : α) → NormedAddCommGroup (E i)\nι : Type u_1\nf : ι → { x // x ∈ lp E p }\ns : Finset ι\n⊢ ↑(∑ i in s, f i) = ∑ i in s, ↑(f i)",
"tactic": "simp"
}
] | [
380,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/Algebra/Algebra/Equiv.lean | AlgEquiv.commutes | [] | [
225,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.null_of_locally_null | [
{
"state_after": "α : Type u_1\nβ : Type ?u.9450\nR : Type ?u.9453\nR' : Type ?u.9456\nms : Set (OuterMeasure α)\nm✝ : OuterMeasure α\ninst✝¹ : TopologicalSpace α\ninst✝ : SecondCountableTopology α\nm : OuterMeasure α\ns : Set α\nu : α → Set α\nhxu : ∀ (x : α), x ∈ s → u x ∈ 𝓝[s] x\nhu₀ : ∀ (x : α), x ∈ s → ↑m... | [
165,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
159,
1
] |
Mathlib/Analysis/NormedSpace/ConformalLinearMap.lean | LinearIsometry.isConformalMap | [] | [
77,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
11
] |
Mathlib/CategoryTheory/Limits/Opposites.lean | CategoryTheory.Limits.pullbackIsoUnopPushout_hom_inl | [
{
"state_after": "case a\nC : Type u₁\ninst✝³ : Category C\nJ : Type u₂\ninst✝² : Category J\nX✝ : Type v₂\nX Y Z : C\nf : X ⟶ Z\ng : Y ⟶ Z\ninst✝¹ : HasPullback f g\ninst✝ : HasPushout f.op g.op\n⊢ (pushout.inl ≫ (pullbackIsoUnopPushout f g).hom.op).unop = pullback.fst.op.unop",
"state_before": "C : Type u... | [
653,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
648,
1
] |
Mathlib/Data/List/Pairwise.lean | List.pairwise_of_reflexive_on_dupl_of_forall_ne | [
{
"state_after": "case nil\nα : Type u_1\nβ : Type ?u.40515\nR S T : α → α → Prop\na : α\nl✝ : List α\ninst✝ : DecidableEq α\nl : List α\nr : α → α → Prop\nhr✝ : ∀ (a : α), 1 < count a l → r a a\nh✝ : ∀ (a : α), a ∈ l → ∀ (b : α), b ∈ l → a ≠ b → r a b\nhr : ∀ (a : α), 1 < count a [] → r a a\nh : ∀ (a : α), a ∈... | [
295,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
275,
1
] |
Mathlib/Data/Finset/Slice.lean | Set.Sized.empty_mem_iff | [] | [
90,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.mem_filter | [] | [
2660,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2659,
1
] |
Std/Data/Int/DivMod.lean | Int.lt_ediv_add_one_mul_self | [
{
"state_after": "a b : Int\nH : 0 < b\n⊢ a < b * (a / b) + b",
"state_before": "a b : Int\nH : 0 < b\n⊢ a < (a / b + 1) * b",
"tactic": "rw [Int.add_mul, Int.one_mul, Int.mul_comm]"
},
{
"state_after": "no goals",
"state_before": "a b : Int\nH : 0 < b\n⊢ a < b * (a / b) + b",
"tactic": ... | [
553,
74
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
551,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.ssubset_of_subset_of_ssubset | [] | [
438,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
436,
1
] |
Mathlib/Data/Nat/GCD/Basic.lean | Nat.coprime.lcm_eq_mul | [
{
"state_after": "no goals",
"state_before": "m n : ℕ\nh : coprime m n\n⊢ lcm m n = m * n",
"tactic": "rw [← one_mul (lcm m n), ← h.gcd_eq_one, gcd_mul_lcm]"
}
] | [
118,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/Analysis/Convex/Join.lean | convexJoin_segments | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.137089\n𝕜 : Type u_2\nE : Type u_1\ninst✝² : LinearOrderedField 𝕜\ninst✝¹ : AddCommGroup E\ninst✝ : Module 𝕜 E\ns t u : Set E\nx y a b c d : E\n⊢ convexJoin 𝕜 (segment 𝕜 a b) (segment 𝕜 c d) = ↑(convexHull 𝕜).toOrderHom {a, b, c, d}",
"tac... | [
216,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Real.lean | Real.norm_rpow_of_nonneg | [
{
"state_after": "x y : ℝ\nhx_nonneg : 0 ≤ x\n⊢ abs (x ^ y) = abs x ^ y",
"state_before": "x y : ℝ\nhx_nonneg : 0 ≤ x\n⊢ ‖x ^ y‖ = ‖x‖ ^ y",
"tactic": "simp_rw [Real.norm_eq_abs]"
},
{
"state_after": "no goals",
"state_before": "x y : ℝ\nhx_nonneg : 0 ≤ x\n⊢ abs (x ^ y) = abs x ^ y",
"ta... | [
171,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
1
] |
Mathlib/Order/CompactlyGenerated.lean | Directed.inf_iSup_eq | [
{
"state_after": "no goals",
"state_before": "ι : Sort u_2\nα : Type u_1\ninst✝² : CompleteLattice α\nf : ι → α\ninst✝¹ : CompleteLattice α\ninst✝ : IsCompactlyGenerated α\na b : α\ns : Set α\nh : Directed (fun x x_1 => x ≤ x_1) f\n⊢ (a ⊓ ⨆ (i : ι), f i) = ⨆ (i : ι), a ⊓ f i",
"tactic": "rw [iSup, h.dir... | [
385,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
384,
11
] |
Mathlib/Data/Nat/Basic.lean | Nat.leRecOn_self | [
{
"state_after": "case zero\nm n k : ℕ\nC : ℕ → Sort u\nnext : {k : ℕ} → C k → C (k + 1)\nh : zero ≤ zero\nx : C zero\n⊢ (_ : zero = 0) ▸ x = x\n\ncase succ\nm n k : ℕ\nC : ℕ → Sort u\nnext : {k : ℕ} → C k → C (k + 1)\nn✝ : ℕ\nh : succ n✝ ≤ succ n✝\nx : C (succ n✝)\n⊢ (Or.by_cases (_ : succ n✝ ≤ n✝ ∨ succ n✝ = ... | [
404,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
399,
1
] |
Mathlib/Order/Heyting/Basic.lean | Disjoint.disjoint_sdiff_right | [] | [
522,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
521,
1
] |
Mathlib/Data/Matrix/Block.lean | Matrix.toBlock_mul_eq_mul | [
{
"state_after": "case a.h\nl : Type ?u.266837\nm✝ : Type ?u.266840\nn✝ : Type ?u.266843\no : Type ?u.266846\np✝ : Type ?u.266849\nq✝ : Type ?u.266852\nm' : o → Type ?u.266857\nn' : o → Type ?u.266862\np' : o → Type ?u.266867\nR : Type u_4\nS : Type ?u.266873\nα : Type ?u.266876\nβ : Type ?u.266879\ninst✝¹ : Co... | [
927,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
921,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | contDiff_top | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\... | [
1430,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1429,
1
] |
Mathlib/Order/Lattice.lean | Antitone.inf | [] | [
1171,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1169,
11
] |
Mathlib/Analysis/Calculus/Deriv/Basic.lean | HasDerivWithinAt.continuousWithinAt | [] | [
720,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
718,
1
] |
Mathlib/Computability/TuringMachine.lean | Turing.Tape.write_mk' | [
{
"state_after": "no goals",
"state_before": "Γ : Type u_1\ninst✝ : Inhabited Γ\na b : Γ\nL R : ListBlank Γ\n⊢ write b (mk' L (ListBlank.cons a R)) = mk' L (ListBlank.cons b R)",
"tactic": "simp only [Tape.write, Tape.mk', ListBlank.head_cons, ListBlank.tail_cons, eq_self_iff_true,\n and_self_iff]"
}... | [
681,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
678,
1
] |
Mathlib/Topology/Order/Basic.lean | nhdsWithin_Iio_neBot' | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝³ : TopologicalSpace α\ninst✝² : LinearOrder α\ninst✝¹ : OrderTopology α\ninst✝ : DenselyOrdered α\na b✝ : α\ns : Set α\nb c : α\nH₁ : Set.Nonempty (Iio c)\nH₂ : b ≤ c\n⊢ b ∈ closure (Iio c)",
"tactic": "rwa [closure_... | [
2408,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2406,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.Eventually.lt_top_of_ne | [] | [
1704,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1702,
1
] |
Mathlib/Data/Set/Function.lean | Set.piecewise_same | [
{
"state_after": "case h\nα : Type u_1\nβ : Type ?u.94382\nγ : Type ?u.94385\nι : Sort ?u.94388\nπ : α → Type ?u.94393\nδ : α → Sort u_2\ns : Set α\nf g : (i : α) → δ i\ninst✝ : (j : α) → Decidable (j ∈ s)\nx : α\n⊢ piecewise s f f x = f x",
"state_before": "α : Type u_1\nβ : Type ?u.94382\nγ : Type ?u.9438... | [
1498,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1496,
1
] |
Mathlib/RingTheory/Polynomial/Cyclotomic/Basic.lean | Polynomial.cyclotomic_two | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : Ring R\n⊢ cyclotomic 2 R = X + 1",
"tactic": "simp [cyclotomic_prime]"
}
] | [
414,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
414,
1
] |
Mathlib/Algebra/ContinuedFractions/Translations.lean | GeneralizedContinuedFraction.part_denom_eq_s_b | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ng : GeneralizedContinuedFraction α\nn : ℕ\ngp : Pair α\ns_nth_eq : Stream'.Seq.get? g.s n = some gp\n⊢ Stream'.Seq.get? (partialDenominators g) n = some gp.b",
"tactic": "simp [partialDenominators, s_nth_eq]"
}
] | [
64,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Data/List/Permutation.lean | List.map_permutations | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nf : α → β\nts : List α\n⊢ map (map f) (permutations ts) = permutations (map f ts)",
"tactic": "rw [permutations, permutations, map, map_permutationsAux, map]"
}
] | [
244,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
242,
1
] |
Mathlib/Analysis/Normed/Group/Quotient.lean | AddSubgroup.ker_normedMk | [] | [
300,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
299,
1
] |
Mathlib/Order/Heyting/Basic.lean | hnot_sdiff_comm | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.172594\nα : Type u_1\nβ : Type ?u.172600\ninst✝ : CoheytingAlgebra α\na✝ b✝ c a b : α\n⊢ ￢a \\ b = ￢b \\ a",
"tactic": "simp_rw [← top_sdiff', sdiff_right_comm]"
}
] | [
1015,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1015,
1
] |
Mathlib/Algebra/Lie/Submodule.lean | LieSubmodule.coe_copy | [] | [
162,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | Real.continuous_sinh | [] | [
111,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/Order/UpperLower/Basic.lean | UpperSet.prod_top | [] | [
1562,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1561,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | Measurable.nndist | [] | [
1577,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1575,
1
] |
Mathlib/Data/Fintype/Basic.lean | Set.mem_toFinset | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.78159\nγ : Type ?u.78162\ns✝ t s : Set α\ninst✝ : Fintype ↑s\na : α\n⊢ a ∈ toFinset s ↔ a ∈ s",
"tactic": "simp [toFinset]"
}
] | [
618,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
617,
1
] |
Mathlib/Topology/UniformSpace/Separation.lean | eq_of_uniformity_basis | [] | [
155,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/ModelTheory/Ultraproducts.lean | FirstOrder.Language.Ultraproduct.realize_formula_cast | [
{
"state_after": "α : Type u_2\nM : α → Type u_3\nu : Ultrafilter α\nL : Language\ninst✝¹ : (a : α) → Structure L (M a)\ninst✝ : ∀ (a : α), Nonempty (M a)\nβ : Type u_1\nφ : Formula L β\nx : β → (a : α) → M a\n⊢ BoundedFormula.Realize φ (fun i => Quotient.mk' (x i)) default =\n BoundedFormula.Realize φ (fun ... | [
157,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.prod_map_atTop_eq | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.279380\nι' : Type ?u.279383\nα : Type ?u.279386\nβ : Type ?u.279389\nγ : Type ?u.279392\nα₁ : Type u_1\nα₂ : Type u_2\nβ₁ : Type u_3\nβ₂ : Type u_4\ninst✝¹ : Preorder β₁\ninst✝ : Preorder β₂\nu₁ : β₁ → α₁\nu₂ : β₂ → α₂\n⊢ map u₁ atTop ×ˢ map u₂ atTop... | [
1415,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1413,
1
] |
Mathlib/CategoryTheory/Sites/Plus.lean | CategoryTheory.GrothendieckTopology.plusLift_unique | [
{
"state_after": "C : Type u\ninst✝³ : Category C\nJ : GrothendieckTopology C\nD : Type w\ninst✝² : Category D\ninst✝¹ : ∀ (P : Cᵒᵖ ⥤ D) (X : C) (S : Cover J X), HasMultiequalizer (Cover.index S P)\nP✝ : Cᵒᵖ ⥤ D\ninst✝ : ∀ (X : C), HasColimitsOfShape (Cover J X)ᵒᵖ D\nP Q : Cᵒᵖ ⥤ D\nη : P ⟶ Q\nhQ : Presheaf.IsSh... | [
329,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
325,
1
] |
Mathlib/Data/Real/Basic.lean | Real.sInf_of_not_bddBelow | [] | [
845,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
844,
1
] |
Mathlib/Control/Traversable/Instances.lean | List.traverse_nil | [] | [
118,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/Computability/PartrecCode.lean | Nat.Partrec.Code.encodeCode_eq | [] | [
198,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/Data/Rat/Defs.lean | Rat.divInt_neg_one_one | [
{
"state_after": "a b c : ℚ\n⊢ (match -1, 1 with\n | n, Int.ofNat d => inline (mkRat n d)\n | n, Int.negSucc d => normalize (-n) (Nat.succ d)) =\n -1",
"state_before": "a b c : ℚ\n⊢ -1 /. 1 = -1",
"tactic": "rw [divInt]"
},
{
"state_after": "a b c : ℚ\n⊢ mkRat (-1) 1 = -1",
"state_b... | [
249,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/Algebra/Quandle.lean | Rack.self_act_act_eq | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : Rack R\nx y : R\n⊢ (x ◃ x) ◃ y = x ◃ y",
"tactic": "rw [← right_inv x y, ← self_distrib]"
}
] | [
287,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
287,
1
] |
Mathlib/AlgebraicTopology/SimplexCategory.lean | SimplexCategory.len_mk | [] | [
82,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
81,
1
] |
Mathlib/Analysis/InnerProductSpace/EuclideanDist.lean | Euclidean.exists_pos_lt_subset_ball | [
{
"state_after": "E : Type u_1\ninst✝⁶ : AddCommGroup E\ninst✝⁵ : TopologicalSpace E\ninst✝⁴ : TopologicalAddGroup E\ninst✝³ : T2Space E\ninst✝² : Module ℝ E\ninst✝¹ : ContinuousSMul ℝ E\ninst✝ : FiniteDimensional ℝ E\nR : ℝ\ns : Set E\nx : E\nhR : 0 < R\nhs : IsClosed s\nh : ↑toEuclidean '' s ⊆ Metric.ball (↑t... | [
108,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
8
] |
Std/Logic.lean | decide_eq_decide | [
{
"state_after": "no goals",
"state_before": "p q : Prop\ninst✝¹ : Decidable p\ninst✝ : Decidable q\nh : decide p = decide q\n⊢ p ↔ q",
"tactic": "rw [← decide_eq_true_iff p, h, decide_eq_true_iff]"
},
{
"state_after": "no goals",
"state_before": "p q : Prop\ninst✝¹ : Decidable p\ninst✝ : De... | [
529,
89
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
527,
9
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.mul_one | [] | [
179,
15
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
178,
19
] |
Mathlib/Analysis/Complex/RemovableSingularity.lean | Complex.differentiableOn_update_limUnder_of_bddAbove | [] | [
115,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
1
] |
Mathlib/Analysis/NormedSpace/Basic.lean | range_norm | [] | [
362,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.leadingCoeff_add_of_degree_lt | [
{
"state_after": "R : Type u\nS : Type v\na b c d : R\nn m : ℕ\ninst✝ : Semiring R\np q : R[X]\nι : Type ?u.651623\nh : degree p < degree q\nthis : coeff p (natDegree q) = 0\n⊢ leadingCoeff (p + q) = leadingCoeff q",
"state_before": "R : Type u\nS : Type v\na b c d : R\nn m : ℕ\ninst✝ : Semiring R\np q : R[... | [
878,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
874,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.fin_curry₁ | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.370940\nγ : Type ?u.370943\nσ : Type u_2\ninst✝³ : Primcodable α\ninst✝² : Primcodable β\ninst✝¹ : Primcodable γ\ninst✝ : Primcodable σ\nn : ℕ\nf : Fin n → α → σ\nh : ∀ (i : Fin n), Primrec (f i)\na : Fin n × α\n⊢ Vector.get (Vector.ofF... | [
1342,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1340,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.coe_restrictScalars | [] | [
1537,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1535,
1
] |
Mathlib/Data/Matrix/Notation.lean | Matrix.empty_mul_empty | [] | [
236,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | Submodule.isOpenMap_mkQ | [] | [
2613,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2612,
1
] |
Mathlib/Topology/Algebra/Order/LiminfLimsup.lean | Antitone.map_limsSup_of_continuousAt | [
{
"state_after": "case a\nα : Type u\nβ : Type v\nι : Type ?u.48095\nR : Type u_1\nS : Type u_2\nF✝ : Filter ι\ninst✝⁷ : NeBot F✝\ninst✝⁶ : CompleteLinearOrder R\ninst✝⁵ : TopologicalSpace R\ninst✝⁴ : OrderTopology R\ninst✝³ : CompleteLinearOrder S\ninst✝² : TopologicalSpace S\ninst✝¹ : OrderTopology S\nF : Fil... | [
355,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
315,
1
] |
Mathlib/Algebra/BigOperators/Finprod.lean | prod_finprod_comm | [] | [
1187,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1185,
1
] |
Mathlib/Analysis/Convex/Function.lean | StrictConvexOn.sup | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.412389\nα : Type ?u.412392\nβ : Type u_3\nι : Type ?u.412398\ninst✝⁶ : OrderedSemiring 𝕜\ninst✝⁵ : AddCommMonoid E\ninst✝⁴ : AddCommMonoid F\ninst✝³ : LinearOrderedAddCommMonoid β\ninst✝² : SMul 𝕜 E\ninst✝¹ : Module 𝕜 ... | [
624,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
615,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.Memℒp.smul_of_top_left | [
{
"state_after": "α : Type u_2\nE : Type u_1\nF : Type ?u.5946213\nG : Type ?u.5946216\nm m0 : MeasurableSpace α\np✝ : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedAddCommGroup F\ninst✝⁵ : NormedAddCommGroup G\n𝕜 : Type u_3\ninst✝⁴ : NormedRing 𝕜\ninst✝³ : MulActionWithZero 𝕜 E... | [
1537,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1534,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | ContDiffAt.sub | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝¹⁰ : NontriviallyNormedField 𝕜\nD : Type uD\ninst✝⁹ : NormedAddCommGroup D\ninst✝⁸ : NormedSpace 𝕜 D\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜... | [
1327,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1326,
1
] |
Mathlib/CategoryTheory/MorphismProperty.lean | CategoryTheory.MorphismProperty.IsInvertedBy.unop | [
{
"state_after": "C : Type u\ninst✝¹ : Category C\nD : Type u_2\ninst✝ : Category D\nW : MorphismProperty C\nL : Cᵒᵖ ⥤ Dᵒᵖ\nh : IsInvertedBy (MorphismProperty.op W) L\nX Y : C\nf : X ⟶ Y\nhf : W f\nthis : IsIso (L.map f.op)\n⊢ IsIso ((Functor.unop L).map f)",
"state_before": "C : Type u\ninst✝¹ : Category C... | [
335,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
331,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Kernels.lean | CategoryTheory.Limits.kernel.lift_map | [
{
"state_after": "case h\nC : Type u\ninst✝⁴ : Category C\ninst✝³ : HasZeroMorphisms C\nX✝ Y✝ : C\nf✝ : X✝ ⟶ Y✝\ninst✝² : HasKernel f✝\nX Y Z X' Y' Z' : C\nf : X ⟶ Y\ng : Y ⟶ Z\ninst✝¹ : HasKernel g\nw : f ≫ g = 0\nf' : X' ⟶ Y'\ng' : Y' ⟶ Z'\ninst✝ : HasKernel g'\nw' : f' ≫ g' = 0\np : X ⟶ X'\nq : Y ⟶ Y'\nr : Z... | [
302,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
298,
1
] |
Mathlib/Dynamics/PeriodicPts.lean | Function.iUnion_pNat_ptsOfPeriod | [] | [
253,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
252,
1
] |
src/lean/Init/SimpLemmas.lean | Bool.not_beq_true | [
{
"state_after": "no goals",
"state_before": "b : Bool\n⊢ (!b == true) = (b == false)",
"tactic": "cases b <;> rfl"
}
] | [
126,
99
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
126,
9
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.sum_const' | [
{
"state_after": "no goals",
"state_before": "α β ι : Type u\na : Cardinal\n⊢ (sum fun x => a) = (#ι) * a",
"tactic": "simp"
}
] | [
881,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
881,
1
] |
Mathlib/Topology/Basic.lean | IsClosed.closure_eq | [] | [
442,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
441,
1
] |
Mathlib/Tactic/Abel.lean | Mathlib.Tactic.Abel.term_smul | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : AddCommMonoid α\nc n : ℕ\nx a : α\nn' : ℕ\na' : α\nh₁ : c * n = n'\nh₂ : smul c a = a'\n⊢ smul c (term n x a) = term n' x a'",
"tactic": "simp [h₂.symm, h₁.symm, term, smul, nsmul_add, mul_nsmul']"
}
] | [
217,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Geometry/Manifold/LocalInvariantProperties.lean | StructureGroupoid.LocalInvariantProp.liftPropAt_congr_of_eventuallyEq | [] | [
436,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
434,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.smul_finset_univ₀ | [
{
"state_after": "F : Type ?u.901234\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.901243\ninst✝³ : DecidableEq β\ninst✝² : GroupWithZero α\ninst✝¹ : MulAction α β\ns t : Finset β\na : α\nb : β\ninst✝ : Fintype β\nha : a ≠ 0\n⊢ a • Set.univ = Set.univ",
"state_before": "F : Type ?u.901234\nα : Type u_2\nβ : Type... | [
2082,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2079,
1
] |
Mathlib/Algebra/BigOperators/Multiset/Basic.lean | MonoidHom.map_multiset_prod | [] | [
555,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
553,
11
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | measurable_biInf | [
{
"state_after": "α : Type u_3\nβ : Type ?u.1580479\nγ : Type ?u.1580482\nγ₂ : Type ?u.1580485\nδ : Type u_2\nι✝ : Sort y\ns✝ t u : Set α\ninst✝¹² : TopologicalSpace α\ninst✝¹¹ : MeasurableSpace α\ninst✝¹⁰ : BorelSpace α\ninst✝⁹ : TopologicalSpace β\ninst✝⁸ : MeasurableSpace β\ninst✝⁷ : BorelSpace β\ninst✝⁶ : T... | [
1298,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1294,
1
] |
Mathlib/Computability/Primrec.lean | Nat.Primrec'.const | [] | [
1403,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1401,
1
] |
Mathlib/Data/Set/Function.lean | Set.injective_codRestrict | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.5932\nγ : Type ?u.5935\nι : Sort u_2\nπ : α → Type ?u.5943\nf : ι → α\ns : Set α\nh : ∀ (x : ι), f x ∈ s\n⊢ Injective (codRestrict f s h) ↔ Injective f",
"tactic": "simp only [Injective, Subtype.ext_iff, val_codRestrict_apply]"
}
... | [
169,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.