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/FDeriv/Linear.lean | ContinuousLinearMap.differentiable | [] | [
103,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
11
] |
Std/Data/Int/Lemmas.lean | Int.mul_add | [
{
"state_after": "no goals",
"state_before": "m n k : Nat\n⊢ ↑m * (↑n + ↑k) = ↑m * ↑n + ↑m * ↑k",
"tactic": "simp [Nat.left_distrib]"
},
{
"state_after": "m n k : Nat\n⊢ subNatNat (m * n) (m * succ k) = ↑(m * n) + subNatNat 0 (m * succ k)",
"state_before": "m n k : Nat\n⊢ ↑m * (↑n + -[k+1]) ... | [
456,
81
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
445,
11
] |
Mathlib/Data/Sum/Order.lean | Sum.Lex.inl_bot | [] | [
446,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
445,
1
] |
Mathlib/Data/Finset/Powerset.lean | Finset.powerset_injective | [] | [
71,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/Topology/Inseparable.lean | Specializes.antisymm | [] | [
283,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/Order/Heyting/Regular.lean | Heyting.Regular.coe_le_coe | [] | [
184,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/GroupTheory/OrderOfElement.lean | orderOf_pow' | [
{
"state_after": "G : Type u\nA : Type v\nx y : G\na b : A\nn m : ℕ\ninst✝¹ : Monoid G\ninst✝ : AddMonoid A\nh : n ≠ 0\n⊢ minimalPeriod (fun x_1 => x ^ n * x_1) 1 =\n minimalPeriod (fun x_1 => x * x_1) 1 / gcd (minimalPeriod (fun x_1 => x * x_1) 1) n",
"state_before": "G : Type u\nA : Type v\nx y : G\na ... | [
356,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
354,
1
] |
Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean | MeasureTheory.Lp.simpleFunc.aemeasurable | [] | [
613,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
611,
11
] |
Mathlib/Topology/DiscreteQuotient.lean | LocallyConstant.lift_comp_proj | [] | [
420,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
420,
1
] |
Mathlib/CategoryTheory/Limits/Cones.lean | CategoryTheory.Limits.Cones.cone_iso_of_hom_iso | [
{
"state_after": "no goals",
"state_before": "J : Type u₁\ninst✝³ : Category J\nK✝ : Type u₂\ninst✝² : Category K✝\nC : Type u₃\ninst✝¹ : Category C\nD : Type u₄\ninst✝ : Category D\nF K : J ⥤ C\nc d : Cone K\nf : c ⟶ d\ni : IsIso f.Hom\n⊢ f ≫ ConeMorphism.mk (inv f.Hom) = 𝟙 c ∧ ConeMorphism.mk (inv f.Hom)... | [
334,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
332,
1
] |
Mathlib/Algebra/BigOperators/Finprod.lean | finprod_mem_inv_distrib | [] | [
727,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
725,
1
] |
Mathlib/Data/Finset/Sigma.lean | Finset.sigmaLift_nonempty | [
{
"state_after": "ι : Type u_1\nα : ι → Type u_3\nβ : ι → Type u_4\nγ : ι → Type u_2\ninst✝ : DecidableEq ι\nf g : ⦃i : ι⦄ → α i → β i → Finset (γ i)\na : (i : ι) × α i\nb : (i : ι) × β i\n⊢ (if h : a.fst = b.fst then map (Embedding.sigmaMk b.fst) (f (h ▸ a.snd) b.snd) else ∅) ≠ ∅ ↔\n ∃ h, f ((_ : a.fst = b.... | [
172,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.union_subset_iff | [] | [
1785,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1784,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.spanCompIso_inv_app_right | [] | [
372,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
372,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.subset_closure | [] | [
1107,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1107,
1
] |
Mathlib/Topology/Sober.lean | isGenericPoint_iff_forall_closed | [
{
"state_after": "α : Type u_1\nβ : Type ?u.3096\ninst✝¹ : TopologicalSpace α\ninst✝ : TopologicalSpace β\nx y : α\nS U Z : Set α\nhS : IsClosed S\nhxS : x ∈ S\nthis : closure {x} ⊆ S\n⊢ IsGenericPoint x S ↔ ∀ (Z : Set α), IsClosed Z → x ∈ Z → S ⊆ Z",
"state_before": "α : Type u_1\nβ : Type ?u.3096\ninst✝¹ ... | [
114,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/Topology/Algebra/ContinuousAffineMap.lean | ContinuousAffineMap.coe_zero | [] | [
187,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.Embedding.coe_comp | [] | [
1862,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1861,
1
] |
Mathlib/MeasureTheory/Decomposition/Jordan.lean | MeasureTheory.SignedMeasure.toSignedMeasure_toJordanDecomposition | [
{
"state_after": "case intro.intro.intro.intro.intro\nα : Type u_1\nβ : Type ?u.39165\ninst✝² : MeasurableSpace α\ns✝ : SignedMeasure α\nμ ν : Measure α\ninst✝¹ : IsFiniteMeasure μ\ninst✝ : IsFiniteMeasure ν\ns : SignedMeasure α\ni : Set α\nhi₁ : MeasurableSet i\nhi₂ : VectorMeasure.restrict 0 i ≤ VectorMeasure... | [
275,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
263,
1
] |
Mathlib/Order/SuccPred/Basic.lean | Order.Icc_pred_left | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : PartialOrder α\ninst✝ : PredOrder α\na b : α\nh : pred a ≤ b\n⊢ Icc (pred a) b = insert (pred a) (Icc a b)",
"tactic": "simp_rw [← Ici_inter_Iic, Ici_pred, insert_inter_of_mem (mem_Iic.2 h)]"
}
] | [
814,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
813,
1
] |
Mathlib/Algebra/Group/Conj.lean | isConj_iff | [] | [
96,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/Analysis/Calculus/FDerivMeasurable.lean | aemeasurable_derivWithin_Ioi | [] | [
825,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
823,
1
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineIsometry.antilipschitz | [] | [
181,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
11
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.uniformEmbedding_bot_of_pairwise_le_dist | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ✝ : Type v\nX : Type ?u.559730\nι : Type ?u.559733\ninst✝¹ : PseudoMetricSpace α\nγ : Type w\ninst✝ : MetricSpace γ\nx : γ\ns : Set γ\nβ : Type ?u.559749\nε : ℝ\nhε : 0 < ε\nf : β → α\nhf : Pairwise fun x y => ε ≤ dist (f x) (f y)\n⊢ UniformSpace α"... | [
2960,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2957,
1
] |
Mathlib/Algebra/Parity.lean | range_two_mul_add_one | [
{
"state_after": "case h\nF : Type ?u.76433\nα✝ : Type ?u.76436\nβ : Type ?u.76439\nR : Type ?u.76442\ninst✝² : Semiring α✝\ninst✝¹ : Semiring β\nm n : α✝\nα : Type u_1\ninst✝ : Semiring α\nx : α\n⊢ (x ∈ Set.range fun x => 2 * x + 1) ↔ x ∈ {a | Odd a}",
"state_before": "F : Type ?u.76433\nα✝ : Type ?u.76436... | [
327,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
324,
1
] |
Mathlib/Init/Algebra/Order.lean | lt_of_le_of_lt | [] | [
129,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/Data/List/Cycle.lean | Cycle.Subsingleton.nodup | [
{
"state_after": "case h\nα : Type u_1\ns : Cycle α\nh✝ : Subsingleton s\nl : List α\nh : Subsingleton (Quot.mk Setoid.r l)\n⊢ Nodup (Quot.mk Setoid.r l)",
"state_before": "α : Type u_1\ns : Cycle α\nh : Subsingleton s\n⊢ Nodup s",
"tactic": "induction' s using Quot.inductionOn with l"
},
{
"sta... | [
676,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
671,
1
] |
Mathlib/Algebra/BigOperators/Finprod.lean | finprod_of_isEmpty | [
{
"state_after": "G : Type ?u.32897\nM : Type u_2\nN : Type ?u.32903\nα : Sort u_1\nβ : Sort ?u.32909\nι : Sort ?u.32912\ninst✝² : CommMonoid M\ninst✝¹ : CommMonoid N\ninst✝ : IsEmpty α\nf : α → M\n⊢ (∏ᶠ (i : α), f i) = ∏ᶠ (x : ?m.33452), 1\n\nG : Type ?u.32897\nM : Type u_2\nN : Type ?u.32903\nα : Sort u_1\nβ ... | [
207,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Icc_erase_right | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.76986\nα : Type u_1\ninst✝² : PartialOrder α\ninst✝¹ : LocallyFiniteOrder α\na✝ b✝ c : α\ninst✝ : DecidableEq α\na b : α\n⊢ erase (Icc a b) b = Ico a b",
"tactic": "simp [← coe_inj]"
}
] | [
549,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
549,
1
] |
Mathlib/Topology/Order/Basic.lean | Antitone.map_csInf_of_continuousAt | [] | [
2844,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2841,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Disjoint.exists_thickenings | [
{
"state_after": "case intro.intro\nι : Sort ?u.131908\nα : Type u\nβ : Type v\ninst✝ : PseudoEMetricSpace α\nδ ε : ℝ\ns t : Set α\nx : α\nhst : Disjoint s t\nhs : IsCompact s\nht : IsClosed t\nr : ℝ≥0\nhr : 0 < r\nh : ∀ (x : α), x ∈ s → ∀ (y : α), y ∈ t → ↑r < edist x y\n⊢ ∃ δ, 0 < δ ∧ Disjoint (thickening δ s... | [
1261,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1246,
1
] |
Mathlib/Algebra/DirectSum/Decomposition.lean | DirectSum.decompose_symm_add | [] | [
163,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Data/Set/Basic.lean | Set.Subset.rfl | [] | [
359,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
358,
1
] |
Mathlib/LinearAlgebra/Matrix/Adjugate.lean | Matrix.adjugate_fin_two | [
{
"state_after": "case a.h\nm : Type u\nn : Type v\nα : Type w\ninst✝⁴ : DecidableEq n\ninst✝³ : Fintype n\ninst✝² : DecidableEq m\ninst✝¹ : Fintype m\ninst✝ : CommRing α\nA : Matrix (Fin 2) (Fin 2) α\ni j : Fin 2\n⊢ adjugate A i j = ↑of ![![A 1 1, -A 0 1], ![-A 1 0, A 0 0]] i j",
"state_before": "m : Type ... | [
417,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
406,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.L1.SimpleFunc.setToL1S_smul_left' | [] | [
753,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
750,
1
] |
Mathlib/Analysis/Calculus/Inverse.lean | HasStrictFDerivAt.mem_toLocalHomeomorph_source | [] | [
602,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
600,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.mk_le_aleph0_iff | [
{
"state_after": "no goals",
"state_before": "α β : Type u\n⊢ (#α) ≤ ℵ₀ ↔ Countable α",
"tactic": "rw [countable_iff_nonempty_embedding, aleph0, ← lift_uzero (#α), lift_mk_le']"
}
] | [
1495,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1494,
1
] |
Mathlib/Algebra/Associated.lean | Prime.ne_zero | [] | [
36,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
35,
1
] |
Mathlib/Data/Finset/NAry.lean | Finset.image₂_inter_right | [
{
"state_after": "α : Type u_2\nα' : Type ?u.41366\nβ : Type u_1\nβ' : Type ?u.41372\nγ : Type u_3\nγ' : Type ?u.41378\nδ : Type ?u.41381\nδ' : Type ?u.41384\nε : Type ?u.41387\nε' : Type ?u.41390\nζ : Type ?u.41393\nζ' : Type ?u.41396\nν : Type ?u.41399\ninst✝⁸ : DecidableEq α'\ninst✝⁷ : DecidableEq β'\ninst✝⁶... | [
209,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
205,
1
] |
Mathlib/Topology/Sets/Closeds.lean | TopologicalSpace.Closeds.compl_compl | [] | [
210,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
8
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.rightMoves_ofLists | [] | [
173,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.support_erase | [
{
"state_after": "case a\nι : Type u\nγ : Type w\nβ : ι → Type v\nβ₁ : ι → Type v₁\nβ₂ : ι → Type v₂\ndec : DecidableEq ι\ninst✝¹ : (i : ι) → Zero (β i)\ninst✝ : (i : ι) → (x : β i) → Decidable (x ≠ 0)\ni : ι\nf : Π₀ (i : ι), β i\nj : ι\n⊢ j ∈ support (erase i f) ↔ j ∈ Finset.erase (support f) i",
"state_be... | [
1226,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1222,
1
] |
Mathlib/Order/Atoms.lean | covby_top_iff | [] | [
172,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Algebra/Module/Basic.lean | map_inv_int_cast_smul | [
{
"state_after": "case intro.inl\nα : Type ?u.198898\nR✝ : Type ?u.198901\nk : Type ?u.198904\nS✝ : Type ?u.198907\nM : Type u_1\nM₂ : Type u_2\nM₃ : Type ?u.198916\nι : Type ?u.198919\ninst✝⁶ : AddCommGroup M\ninst✝⁵ : AddCommGroup M₂\nF : Type u_3\ninst✝⁴ : AddMonoidHomClass F M M₂\nf : F\nR : Type u_4\nS : T... | [
490,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
484,
1
] |
Mathlib/Tactic/NormNum/Basic.lean | Mathlib.Meta.NormNum.isInt_add | [] | [
163,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Order/LiminfLimsup.lean | Filter.liminf_eq_iSup_iInf_of_nat | [] | [
759,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
758,
1
] |
Mathlib/Data/Set/Function.lean | MonotoneOn.mono | [] | [
300,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
299,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.Sized.node3R | [] | [
381,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
379,
1
] |
Mathlib/Data/MvPolynomial/Supported.lean | MvPolynomial.supported_eq_adjoin_X | [] | [
100,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Data/Set/Lattice.lean | Monotone.iUnion_nat_add | [] | [
2207,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2205,
1
] |
Mathlib/Logic/Basic.lean | dite_eq_or_eq | [] | [
1215,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1214,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.span_span_coe_preimage | [
{
"state_after": "case refine'_1\nR : Type u_2\nR₂ : Type ?u.30116\nK : Type ?u.30119\nM : Type u_1\nM₂ : Type ?u.30125\nV : Type ?u.30128\nS : Type ?u.30131\ninst✝⁵ : Semiring R\ninst✝⁴ : AddCommMonoid M\ninst✝³ : Module R M\nx✝² : M\np p' : Submodule R M\ninst✝² : Semiring R₂\nσ₁₂ : R →+* R₂\ninst✝¹ : AddComm... | [
180,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
1
] |
Mathlib/Data/Fintype/Card.lean | Fintype.card_lt_of_surjective_not_injective | [] | [
826,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
822,
1
] |
Mathlib/MeasureTheory/Measure/Haar/Basic.lean | MeasureTheory.Measure.haarMeasure_unique | [
{
"state_after": "no goals",
"state_before": "G : Type u_1\ninst✝⁸ : Group G\ninst✝⁷ : TopologicalSpace G\ninst✝⁶ : T2Space G\ninst✝⁵ : TopologicalGroup G\ninst✝⁴ : MeasurableSpace G\ninst✝³ : BorelSpace G\ninst✝² : SecondCountableTopology G\nμ : Measure G\ninst✝¹ : SigmaFinite μ\ninst✝ : IsMulLeftInvariant... | [
701,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
696,
1
] |
Mathlib/MeasureTheory/Constructions/Prod/Basic.lean | AEMeasurable.fst | [] | [
701,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
699,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean | ENNReal.one_lt_rpow | [
{
"state_after": "case none\nz : ℝ\nhz : 0 < z\nhx : 1 < none\n⊢ 1 < none ^ z\n\ncase some\nz : ℝ\nhz : 0 < z\nval✝ : ℝ≥0\nhx : 1 < Option.some val✝\n⊢ 1 < Option.some val✝ ^ z",
"state_before": "x : ℝ≥0∞\nz : ℝ\nhx : 1 < x\nhz : 0 < z\n⊢ 1 < x ^ z",
"tactic": "cases x"
},
{
"state_after": "no g... | [
697,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
693,
1
] |
Mathlib/Data/Polynomial/Laurent.lean | Polynomial.toLaurent_C_mul_eq | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nr : R\nf : R[X]\n⊢ ↑toLaurent (↑Polynomial.C r * f) = ↑C r * ↑toLaurent f",
"tactic": "simp only [_root_.map_mul, Polynomial.toLaurent_C]"
}
] | [
241,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
239,
1
] |
Mathlib/LinearAlgebra/BilinearForm.lean | BilinForm.ext | [
{
"state_after": "case h.h\nR : Type u_1\nM : Type u_2\ninst✝¹⁴ : Semiring R\ninst✝¹³ : AddCommMonoid M\ninst✝¹² : Module R M\nR₁ : Type ?u.72414\nM₁ : Type ?u.72417\ninst✝¹¹ : Ring R₁\ninst✝¹⁰ : AddCommGroup M₁\ninst✝⁹ : Module R₁ M₁\nR₂ : Type ?u.73026\nM₂ : Type ?u.73029\ninst✝⁸ : CommSemiring R₂\ninst✝⁷ : A... | [
157,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Data/Real/Irrational.lean | Irrational.of_add_rat | [] | [
221,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
220,
1
] |
Mathlib/Analysis/Calculus/TangentCone.lean | uniqueDiffOn_Ico | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.181211\ninst✝⁶ : NontriviallyNormedField 𝕜\nE : Type ?u.181217\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\nF : Type ?u.181312\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nG : Type ?u.181402\ninst✝¹ : NormedAddCommGroup ... | [
438,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
435,
1
] |
Mathlib/RingTheory/IntegralClosure.lean | Algebra.finite_iff_isIntegral_and_finiteType | [] | [
456,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
454,
1
] |
Mathlib/Data/Finset/NoncommProd.lean | Multiset.noncommFoldr_coe | [
{
"state_after": "F : Type ?u.664\nι : Type ?u.667\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.676\nf : α → β → β\nop : α → α → α\nl : List α\ncomm : Set.Pairwise {x | x ∈ ↑l} fun x y => ∀ (b : β), f x (f y b) = f y (f x b)\nb : β\n⊢ List.foldr (fun x => f ↑x) b (List.pmap Subtype.mk l (_ : ∀ (x : α), x ∈ l → x ∈ ... | [
59,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
1
] |
Mathlib/NumberTheory/Liouville/LiouvilleWith.lean | liouvilleWith_one | [
{
"state_after": "x : ℝ\n⊢ ∃ᶠ (n : ℕ) in atTop, ∃ m, x ≠ ↑m / ↑n ∧ abs (x - ↑m / ↑n) < 2 / ↑n ^ 1",
"state_before": "x : ℝ\n⊢ LiouvilleWith 1 x",
"tactic": "use 2"
},
{
"state_after": "x : ℝ\nn : ℕ\nhn : 0 < n\n⊢ ∃ m, x ≠ ↑m / ↑n ∧ abs (x - ↑m / ↑n) < 2 / ↑n ^ 1",
"state_before": "x : ℝ\n⊢ ∃... | [
68,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_add_prod_eq | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.810222\nβ : Type u\nα : Type v\nγ : Type w\ns✝ s₁ s₂ : Finset α\na : α\nf✝ g✝ : α → β\ninst✝ : CommSemiring β\ns : Finset α\ni : α\nf g h : α → β\nhi : i ∈ s\nh1 : g i + h i = f i\nh2 : ∀ (j : α), j ∈ s → j ≠ i → g j = f j\nh3 : ∀ (j : α), j ∈ s → j ... | [
1750,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1745,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearMap.default_def | [] | [
623,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
622,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.IsNormal.nfp_le_apply | [] | [
479,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
478,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | fderivWithin_const_smul | [] | [
107,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/CategoryTheory/Sites/Grothendieck.lean | CategoryTheory.GrothendieckTopology.Cover.Relation.base_fst | [] | [
579,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
577,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.smul_mem_smul_finset | [] | [
1609,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1608,
1
] |
Mathlib/NumberTheory/Padics/PadicIntegers.lean | PadicInt.mem_span_pow_iff_le_valuation | [
{
"state_after": "p : ℕ\nhp : Fact (Nat.Prime p)\nx : ℤ_[p]\nhx : x ≠ 0\nn : ℕ\n⊢ ↑p ^ n ∣ x ↔ ↑n ≤ valuation x",
"state_before": "p : ℕ\nhp : Fact (Nat.Prime p)\nx : ℤ_[p]\nhx : x ≠ 0\nn : ℕ\n⊢ x ∈ Ideal.span {↑p ^ n} ↔ ↑n ≤ valuation x",
"tactic": "rw [Ideal.mem_span_singleton]"
},
{
"state_af... | [
549,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
534,
1
] |
Std/Data/List/Lemmas.lean | List.exists_mem_of_length_pos | [] | [
42,
29
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
41,
1
] |
Mathlib/Combinatorics/SimpleGraph/Trails.lean | SimpleGraph.Walk.IsEulerian.mem_edges_iff | [
{
"state_after": "no goals",
"state_before": "V : Type u_1\nG : SimpleGraph V\ninst✝ : DecidableEq V\nu v : V\np : Walk G u v\nh : IsEulerian p\ne : Sym2 V\nhe : e ∈ edgeSet G\n⊢ e ∈ edges p",
"tactic": "simpa using (h e he).ge"
}
] | [
107,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
105,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | Complex.cos_nat_mul_two_pi_add_pi | [
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ cos (↑n * (2 * ↑π) + ↑π) = -1",
"tactic": "simpa only [cos_zero] using (cos_periodic.nat_mul n).add_antiperiod_eq cos_antiperiodic"
}
] | [
1264,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1263,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.pred_le_pred_iff | [
{
"state_after": "no goals",
"state_before": "n✝ m n : ℕ\na b : Fin (Nat.succ n)\nha : a ≠ 0\nhb : b ≠ 0\n⊢ pred a ha ≤ pred b hb ↔ a ≤ b",
"tactic": "rw [← succ_le_succ_iff, succ_pred, succ_pred]"
}
] | [
1543,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1542,
1
] |
Mathlib/GroupTheory/Subgroup/ZPowers.lean | Subgroup.coe_zpowers | [] | [
40,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
39,
1
] |
Mathlib/Order/BoundedOrder.lean | le_bot_iff | [] | [
365,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
364,
1
] |
Mathlib/Order/Hom/Bounded.lean | BotHom.coe_sup | [] | [
549,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
548,
1
] |
Mathlib/Algebra/Order/Monoid/WithTop.lean | WithTop.coe_eq_one | [] | [
47,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
46,
1
] |
Mathlib/Logic/Basic.lean | or_congr_right' | [] | [
393,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
393,
1
] |
Mathlib/Data/TwoPointing.lean | TwoPointing.swap_swap | [] | [
69,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/CategoryTheory/Limits/ExactFunctor.lean | CategoryTheory.ExactFunctor.forget_obj_of | [] | [
258,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
256,
1
] |
Mathlib/Algebra/Module/LinearMap.lean | LinearMap.ext_ring | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nR₁ : Type ?u.219990\nR₂ : Type ?u.219993\nR₃ : Type ?u.219996\nk : Type ?u.219999\nS : Type u_2\nS₃ : Type ?u.220005\nT : Type ?u.220008\nM : Type ?u.220011\nM₁ : Type ?u.220014\nM₂ : Type ?u.220017\nM₃ : Type u_3\nN₁ : Type ?u.220023\nN₂ : Type ?u... | [
489,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
488,
1
] |
Mathlib/CategoryTheory/Monad/Algebra.lean | CategoryTheory.Monad.ofRightAdjoint_forget | [] | [
248,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
247,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snorm_mono_nnnorm_ae | [
{
"state_after": "α : Type u_1\nE : Type ?u.1428197\nF : Type u_2\nG : Type u_3\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\nf : α → F\ng : α → G\nh : ∀ᵐ (x : α) ∂μ, ‖f x‖₊ ≤ ‖g x‖₊\n⊢ (if p = 0 then 0 el... | [
394,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
388,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean | CategoryTheory.Limits.biproduct.fromSubtype_eq_lift | [
{
"state_after": "no goals",
"state_before": "J : Type w\nC : Type u\ninst✝⁴ : Category C\ninst✝³ : HasZeroMorphisms C\nf : J → C\ninst✝² : HasBiproduct f\np : J → Prop\ninst✝¹ : HasBiproduct (Subtype.restrict p f)\ninst✝ : DecidablePred p\n⊢ ∀ (j : J),\n fromSubtype f p ≫ π f j =\n (lift fun j => i... | [
598,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
595,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | MvPowerSeries.mul_assoc | [
{
"state_after": "case h\nσ : Type u_1\nR : Type u_2\ninst✝ : Semiring R\nm n✝ : σ →₀ ℕ\nφ ψ φ₁ φ₂ φ₃ : MvPowerSeries σ R\nn : σ →₀ ℕ\n⊢ ↑(coeff R n) (φ₁ * φ₂ * φ₃) = ↑(coeff R n) (φ₁ * (φ₂ * φ₃))",
"state_before": "σ : Type u_1\nR : Type u_2\ninst✝ : Semiring R\nm n : σ →₀ ℕ\nφ ψ φ₁ φ₂ φ₃ : MvPowerSeries σ... | [
308,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
285,
11
] |
Mathlib/Data/Int/Cast/Lemmas.lean | ext_int' | [] | [
306,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
298,
1
] |
Std/Data/Array/Init/Lemmas.lean | Array.appendList_eq_append | [] | [
199,
70
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
198,
9
] |
Mathlib/Topology/PathConnected.lean | Path.mul_apply | [] | [
617,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
615,
11
] |
Mathlib/Analysis/Calculus/Deriv/Basic.lean | HasDerivWithinAt.congr_of_mem | [] | [
585,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
583,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Split.lean | BoxIntegral.Prepartition.exists_splitMany_inf_eq_filter_of_finite | [] | [
341,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
337,
1
] |
Mathlib/Analysis/NormedSpace/Multilinear.lean | ContinuousMultilinearMap.op_norm_smul_le | [
{
"state_after": "𝕜 : Type u\nι : Type v\nι' : Type v'\nn : ℕ\nE : ι → Type wE\nE₁ : ι → Type wE₁\nE' : ι' → Type wE'\nEi : Fin (Nat.succ n) → Type wEi\nG : Type wG\nG' : Type wG'\ninst✝¹⁷ : Fintype ι\ninst✝¹⁶ : Fintype ι'\ninst✝¹⁵ : NontriviallyNormedField 𝕜\ninst✝¹⁴ : (i : ι) → NormedAddCommGroup (E i)\nins... | [
408,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
403,
1
] |
Mathlib/Data/Polynomial/Laurent.lean | LaurentPolynomial.single_eq_C_mul_T | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nr : R\nn : ℤ\n⊢ Finsupp.single n r = ↑C r * T n",
"tactic": "simp [C, T, single_mul_single]"
}
] | [
205,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
Mathlib/Algebra/FreeMonoid/Basic.lean | FreeMonoid.lift_restrict | [] | [
267,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
267,
1
] |
Mathlib/LinearAlgebra/BilinearForm.lean | BilinForm.comp_congr | [] | [
711,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
708,
1
] |
Mathlib/Data/IsROrC/Basic.lean | IsROrC.ofNat_mul_im | [
{
"state_after": "no goals",
"state_before": "K : Type u_1\nE : Type ?u.6397915\ninst✝¹ : IsROrC K\nn : ℕ\ninst✝ : Nat.AtLeastTwo n\nz : K\n⊢ ↑im (OfNat.ofNat n * z) = OfNat.ofNat n * ↑im z",
"tactic": "rw [← ofReal_ofNat, ofReal_mul_im]"
}
] | [
661,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
659,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Metric.hausdorffDist_closure | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.87243\nα : Type u\nβ : Type v\ninst✝¹ : PseudoMetricSpace α\ninst✝ : PseudoMetricSpace β\ns t u : Set α\nx y : α\nΦ : α → β\n⊢ hausdorffDist (closure s) (closure t) = hausdorffDist s t",
"tactic": "simp [hausdorffDist]"
}
] | [
875,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
874,
1
] |
Mathlib/Data/Seq/Computation.lean | Computation.ret_bind | [
{
"state_after": "case bisim\nα : Type u\nβ : Type v\nγ : Type w\na : α\nf : α → Computation β\n⊢ IsBisimulation fun c₁ c₂ => c₁ = bind (pure a) f ∧ c₂ = f a ∨ c₁ = corec (Bind.f f) (Sum.inr c₂)\n\ncase r\nα : Type u\nβ : Type v\nγ : Type w\na : α\nf : α → Computation β\n⊢ bind (pure a) f = bind (pure a) f ∧ f ... | [
739,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
727,
1
] |
Mathlib/MeasureTheory/Function/LpOrder.lean | MeasureTheory.Lp.coeFn_abs | [] | [
105,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.comapDomain_single | [
{
"state_after": "case inl\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.304875\nι : Type ?u.304878\nM : Type u_3\nM' : Type ?u.304884\nN : Type ?u.304887\nP : Type ?u.304890\nG : Type ?u.304893\nH : Type ?u.304896\nR : Type ?u.304899\nS : Type ?u.304902\ninst✝ : Zero M\nf : α → β\na : α\nhif : Set.InjOn f (f ⁻¹' ↑(... | [
750,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
742,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.