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/ModelTheory/Basic.lean | FirstOrder.Language.relMap_sum_inl | [] | [
930,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
928,
1
] |
Mathlib/AlgebraicTopology/DoldKan/Normalized.lean | AlgebraicTopology.DoldKan.inclusionOfMooreComplexMap_comp_PInfty | [
{
"state_after": "case h.zero\nA : Type u_2\ninst✝¹ : Category A\ninst✝ : Abelian A\nX✝ X : SimplicialObject A\n⊢ HomologicalComplex.Hom.f (inclusionOfMooreComplexMap X ≫ PInfty) Nat.zero =\n HomologicalComplex.Hom.f (inclusionOfMooreComplexMap X) Nat.zero\n\ncase h.succ\nA : Type u_2\ninst✝¹ : Category A\ni... | [
103,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/Topology/Algebra/Group/Compact.lean | TopologicalSpace.PositiveCompacts.locallyCompactSpace_of_group | [
{
"state_after": "α : Type u\nβ : Type v\nG : Type w\nH : Type x\ninst✝³ : TopologicalSpace G\ninst✝² : Group G\ninst✝¹ : TopologicalGroup G\ninst✝ : T2Space G\nK : PositiveCompacts G\nx : G\n⊢ ∃ s, s ∈ 𝓝 x ∧ IsCompact s",
"state_before": "α : Type u\nβ : Type v\nG : Type w\nH : Type x\ninst✝³ : Topologica... | [
57,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Mathlib/Data/Nat/Order/Basic.lean | Nat.succ_mul_pos | [] | [
281,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
280,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.Equiv.ext | [
{
"state_after": "case refine'_1\nα : Type u\nβ : Type v\nγ : Type w\ns✝ t✝ : WSeq α\nh✝ : ∀ (n : ℕ), get? s✝ n ~ get? t✝ n\ns t : WSeq α\nh : (fun s t => ∀ (n : ℕ), get? s n ~ get? t n) s t\n⊢ Terminates (destruct s) ↔ Terminates (destruct t)\n\ncase refine'_2\nα : Type u\nβ : Type v\nγ : Type w\ns✝ t✝ : WSeq ... | [
1231,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1211,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | HasSum.neg | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.395925\nδ : Type ?u.395928\ninst✝² : AddCommGroup α\ninst✝¹ : TopologicalSpace α\ninst✝ : TopologicalAddGroup α\nf g : β → α\na a₁ a₂ : α\nh : HasSum f a\n⊢ HasSum (fun b => -f b) (-a)",
"tactic": "simpa only using h.m... | [
804,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
803,
1
] |
Mathlib/Data/Int/ModEq.lean | Int.ModEq.mul_right | [] | [
203,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
21
] |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | WithBot.csSup_empty | [] | [
130,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/Topology/Algebra/Monoid.lean | continuousOn_multiset_prod | [
{
"state_after": "case mk\nι : Type u_1\nα : Type ?u.433203\nX : Type u_2\nM : Type u_3\nN : Type ?u.433212\ninst✝³ : TopologicalSpace X\ninst✝² : TopologicalSpace M\ninst✝¹ : CommMonoid M\ninst✝ : ContinuousMul M\nf : ι → X → M\ns : Multiset ι\nt : Set X\nl : List ι\n⊢ (∀ (i : ι), i ∈ Quot.mk Setoid.r l → Cont... | [
758,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
755,
1
] |
Mathlib/Order/Bounds/Basic.lean | isGreatest_top_iff | [] | [
115,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Std/Data/BinomialHeap.lean | Std.BinomialHeapImp.Heap.WellFormed.nil | [] | [
336,
66
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
336,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.conjTranspose_row | [
{
"state_after": "case a.h\nl : Type ?u.1214447\nm : Type u_1\nn : Type ?u.1214453\no : Type ?u.1214456\nm' : o → Type ?u.1214461\nn' : o → Type ?u.1214466\nR : Type ?u.1214469\nS : Type ?u.1214472\nα : Type v\nβ : Type w\nγ : Type ?u.1214479\ninst✝ : Star α\nv : m → α\ni✝ : m\nx✝ : Unit\n⊢ (row v)ᴴ i✝ x✝ = col... | [
2699,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2697,
1
] |
Mathlib/RingTheory/RootsOfUnity/Basic.lean | IsPrimitiveRoot.eq_orderOf | [] | [
464,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
463,
1
] |
Mathlib/GroupTheory/Perm/Basic.lean | Equiv.Perm.zpow_apply_comm | [
{
"state_after": "no goals",
"state_before": "α✝ : Type u\nβ : Type v\nα : Type u_1\nσ : Perm α\nm n : ℤ\nx : α\n⊢ ↑(σ ^ m) (↑(σ ^ n) x) = ↑(σ ^ n) (↑(σ ^ m) x)",
"tactic": "rw [← Equiv.Perm.mul_apply, ← Equiv.Perm.mul_apply, zpow_mul_comm]"
}
] | [
120,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Mathlib/Deprecated/Ring.lean | IsSemiringHom.comp | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝² : Semiring α\ninst✝¹ : Semiring β\nf : α → β\nhf✝ : IsSemiringHom f\nx y : α\nhf : IsSemiringHom f\nγ : Type u_1\ninst✝ : Semiring γ\ng : β → γ\nhg : IsSemiringHom g\n⊢ (g ∘ f) 0 = 0",
"tactic": "simpa [map_zero hf] using map_z... | [
67,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | finrank_eq_zero | [
{
"state_after": "no goals",
"state_before": "K : Type u\nV : Type v\ninst✝³ : DivisionRing K\ninst✝² : AddCommGroup V\ninst✝¹ : Module K V\nS : Submodule K V\ninst✝ : FiniteDimensional K { x // x ∈ S }\n⊢ finrank K { x // x ∈ S } = 0 ↔ S = ⊥",
"tactic": "rw [← rank_eq_zero, ← finrank_eq_rank, ← @Nat.ca... | [
684,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
683,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_ite_of_true | [
{
"state_after": "ι : Type ?u.405265\nβ : Type u\nα : Type v\nγ : Type w\ns s₁ s₂ : Finset α\na : α\nf✝ g✝ : α → β\ninst✝ : CommMonoid β\np : α → Prop\nhp : DecidablePred p\nf g : α → β\nh : ∀ (x : α), x ∈ s → p x\n⊢ (∏ x in s, if ¬p x then g x else f x) = ∏ x in s, f x",
"state_before": "ι : Type ?u.405265... | [
1014,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1010,
1
] |
Mathlib/Topology/Constructions.lean | IsOpen.isOpenMap_subtype_val | [] | [
1028,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1027,
1
] |
Mathlib/Data/Nat/Order/Basic.lean | Nat.le_mul_of_pos_left | [
{
"state_after": "m n k l : ℕ\nh : 0 < n\n⊢ 1 * m ≤ n * m",
"state_before": "m n k l : ℕ\nh : 0 < n\n⊢ m ≤ n * m",
"tactic": "conv =>\n lhs\n rw [← one_mul m]"
},
{
"state_after": "no goals",
"state_before": "m n k l : ℕ\nh : 0 < n\n⊢ 1 * m ≤ n * m",
"tactic": "exact mul_le_mul_of_nonn... | [
310,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
306,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Localization.mk_lt_mk | [] | [
1953,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1952,
1
] |
Mathlib/Data/Set/Prod.lean | Set.offDiag_empty | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ns t : Set α\nx : α × α\na : α\n⊢ offDiag ∅ = ∅",
"tactic": "simp"
}
] | [
574,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
574,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.coe_tsum | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.231026\nγ : Type ?u.231029\na b c d : ℝ≥0∞\nr✝ p q : ℝ≥0\nx y z ε ε₁ ε₂ : ℝ≥0∞\ns : Set ℝ≥0∞\nf✝ g : α → ℝ≥0∞\nf : α → ℝ≥0\nr : ℝ≥0\nhr : HasSum f r\n⊢ ↑(tsum f) = ∑' (a : α), ↑(f a)",
"tactic": "rw [hr.tsum_eq, ENNReal.tsum_coe_eq ... | [
772,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
771,
11
] |
Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean | mul_div_cancel | [] | [
74,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/CategoryTheory/Limits/Constructions/ZeroObjects.lean | CategoryTheory.Limits.pullbackZeroZeroIso_inv_snd | [
{
"state_after": "C : Type u_2\ninst✝³ : Category C\ninst✝² : HasZeroObject C\ninst✝¹ : HasZeroMorphisms C\nX Y : C\ninst✝ : HasBinaryProduct X Y\n⊢ (limit.isoLimitCone\n { cone := PullbackCone.mk prod.fst prod.snd (_ : prod.fst ≫ 0 = prod.snd ≫ 0),\n isLimit :=\n isPullbackOfIs... | [
183,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | MvPolynomial.coe_zero | [] | [
1089,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1088,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.hasFiniteIntegral_const_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.708905\nδ : Type ?u.708908\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝² : MeasurableSpace δ\ninst✝¹ : NormedAddCommGroup β\ninst✝ : NormedAddCommGroup γ\nc : β\n⊢ (HasFiniteIntegral fun x => c) ↔ c = 0 ∨ ↑↑μ univ < ⊤",
... | [
177,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
1
] |
Mathlib/ModelTheory/LanguageMap.lean | FirstOrder.Language.LHom.sumElim_comp_inl | [] | [
185,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.degree_linear_lt | [] | [
1146,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1145,
1
] |
Mathlib/Logic/Basic.lean | peirce | [] | [
427,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
427,
1
] |
Mathlib/Topology/LocalExtr.lean | IsLocalMaxOn.inf | [] | [
492,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
490,
8
] |
Mathlib/Analysis/SpecialFunctions/ExpDeriv.lean | Real.hasDerivAt_exp | [] | [
188,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Analysis/SpecialFunctions/Arsinh.lean | ContDiffAt.arsinh | [] | [
277,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/Data/PNat/Find.lean | PNat.find_min' | [] | [
71,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
11
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.OrderBot.atBot_eq | [] | [
288,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
287,
1
] |
Mathlib/Algebra/Order/LatticeGroup.lean | LatticeOrderedCommGroup.m_Birkhoff_inequalities | [] | [
557,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
555,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Type.lean | Equiv.Perm.VectorsProdEqOne.card | [] | [
431,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
430,
1
] |
Mathlib/Analysis/Complex/UnitDisc/Basic.lean | Complex.UnitDisc.re_coe | [] | [
191,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineMap.lean | AffineMap.lineMap_eq_left_iff | [
{
"state_after": "no goals",
"state_before": "k : Type u_1\nV1 : Type u_2\nP1 : Type u_3\nV2 : Type ?u.472756\nP2 : Type ?u.472759\nV3 : Type ?u.472762\nP3 : Type ?u.472765\nV4 : Type ?u.472768\nP4 : Type ?u.472771\ninst✝¹³ : Ring k\ninst✝¹² : AddCommGroup V1\ninst✝¹¹ : Module k V1\ninst✝¹⁰ : AffineSpace V1... | [
581,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
579,
1
] |
Mathlib/RingTheory/PowerBasis.lean | PowerBasis.lift_gen | [] | [
306,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
304,
1
] |
Mathlib/Algebra/Order/Kleene.lean | kstar_mul_le | [] | [
227,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
226,
1
] |
Mathlib/Topology/Basic.lean | mem_closure_of_mem_closure_union | [
{
"state_after": "α : Type u\nβ : Type v\nι : Sort w\na : α\ns s₁✝ s₂✝ t : Set α\np p₁ p₂ : α → Prop\ninst✝ : TopologicalSpace α\ns₁ s₂ : Set α\nx : α\nh : 𝓝 x ⊓ 𝓟 (s₁ ∪ s₂) ≠ ⊥\nh₁ : s₁ᶜ ∈ 𝓝 x\n⊢ 𝓝 x ⊓ 𝓟 s₂ ≠ ⊥",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\na : α\ns s₁✝ s₂✝ t : Set α\np p₁ p₂ ... | [
1413,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1404,
1
] |
Mathlib/Data/Real/EReal.lean | EReal.top_mul_coe_of_pos | [] | [
915,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
914,
1
] |
Mathlib/Data/List/Lex.lean | List.Lex.append_left | [] | [
142,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/RingTheory/AdjoinRoot.lean | AdjoinRoot.coe_injective | [] | [
417,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
415,
1
] |
Mathlib/Algebra/Star/Order.lean | conjugate_le_conjugate | [
{
"state_after": "R : Type u\ninst✝² : NonUnitalSemiring R\ninst✝¹ : PartialOrder R\ninst✝ : StarOrderedRing R\na b : R\nhab✝ : a ≤ b\nhab : ∃ p, p ∈ AddSubmonoid.closure (Set.range fun s => star s * s) ∧ b = a + p\nc : R\n⊢ ∃ p, p ∈ AddSubmonoid.closure (Set.range fun s => star s * s) ∧ star c * b * c = star c... | [
186,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
181,
1
] |
Mathlib/Probability/ProbabilityMassFunction/Constructions.lean | Pmf.toOuterMeasure_ofFintype_apply | [] | [
227,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
226,
1
] |
Mathlib/Tactic/Ring/Basic.lean | Mathlib.Tactic.Ring.pow_nat | [
{
"state_after": "u : Lean.Level\nR : Type u_1\nα : Q(Type u)\nsα : Q(CommSemiring «$α»)\ninst✝ : CommSemiring R\nc k : ℕ\na : R\n⊢ a ^ (c * k) = (a ^ c) ^ k",
"state_before": "u : Lean.Level\nR : Type u_1\nα : Q(Type u)\nsα : Q(CommSemiring «$α»)\ninst✝ : CommSemiring R\nb c k : ℕ\na d e : R\nx✝² : b = c *... | [
768,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
767,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Kernels.lean | CategoryTheory.Limits.kernel_not_epi_of_nonzero | [] | [
391,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
390,
1
] |
Mathlib/Data/Seq/Seq.lean | Stream'.Seq.dropn_add | [] | [
843,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
841,
1
] |
Mathlib/Computability/Primrec.lean | PrimrecPred.or | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.133356\nγ : Type ?u.133359\nδ : Type ?u.133362\nσ : Type ?u.133365\ninst✝⁶ : Primcodable α\ninst✝⁵ : Primcodable β\ninst✝⁴ : Primcodable γ\ninst✝³ : Primcodable δ\ninst✝² : Primcodable σ\np q : α → Prop\ninst✝¹ : DecidablePred p\ninst✝ ... | [
739,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
737,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.max'_le | [] | [
1359,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1358,
1
] |
Mathlib/CategoryTheory/Adjunction/Mates.lean | CategoryTheory.transferNatTransSelf_symm_comm | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\nD : Type u₂\ninst✝¹ : Category C\ninst✝ : Category D\nL₁ L₂ L₃ : C ⥤ D\nR₁ R₂ R₃ : D ⥤ C\nadj₁ : L₁ ⊣ R₁\nadj₂ : L₂ ⊣ R₂\nadj₃ : L₃ ⊣ R₃\nf : R₁ ⟶ R₂\ng : R₂ ⟶ R₁\ngf : g ≫ f = 𝟙 R₂\n⊢ ↑(transferNatTransSelf adj₁ adj₂).symm f ≫ ↑(transferNatTransSe... | [
234,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
232,
1
] |
Mathlib/Algebra/Hom/Equiv/Basic.lean | MulEquiv.toMonoidHom_injective | [] | [
595,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
593,
1
] |
Mathlib/Order/Filter/Lift.lean | Filter.lift'_mono' | [] | [
287,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
286,
1
] |
Mathlib/Algebra/Algebra/Basic.lean | Algebra.id.map_eq_self | [] | [
454,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
453,
1
] |
Mathlib/Data/Nat/Multiplicity.lean | Nat.Prime.multiplicity_factorial_mul | [
{
"state_after": "case zero\np : ℕ\nhp : Prime p\n⊢ multiplicity p (p * zero)! = multiplicity p zero ! + ↑zero\n\ncase succ\np : ℕ\nhp : Prime p\nn : ℕ\nih : multiplicity p (p * n)! = multiplicity p n ! + ↑n\n⊢ multiplicity p (p * succ n)! = multiplicity p (succ n)! + ↑(succ n)",
"state_before": "n p : ℕ\nh... | [
159,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/NumberTheory/Padics/RingHoms.lean | PadicInt.denseRange_nat_cast | [
{
"state_after": "p : ℕ\nhp_prime : Fact (Nat.Prime p)\nr : ℚ\nx✝ x : ℤ_[p]\n⊢ x ∈ closure (Set.range Nat.cast)",
"state_before": "p : ℕ\nhp_prime : Fact (Nat.Prime p)\nr : ℚ\nx : ℤ_[p]\n⊢ DenseRange Nat.cast",
"tactic": "intro x"
},
{
"state_after": "p : ℕ\nhp_prime : Fact (Nat.Prime p)\nr : ℚ\... | [
462,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
453,
1
] |
Std/Data/Array/Lemmas.lean | Array.size_ofFn | [
{
"state_after": "no goals",
"state_before": "n : Nat\nα : Type u_1\nf : Fin n → α\n⊢ size (ofFn f) = n",
"tactic": "simp [ofFn]"
}
] | [
280,
80
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
280,
9
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | LinearIsometryEquiv.toHomeomorph_symm | [] | [
773,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
772,
1
] |
Mathlib/GroupTheory/Subgroup/ZPowers.lean | Subgroup.exists_mem_zpowers | [] | [
77,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/Analysis/Calculus/Deriv/Slope.lean | HasDerivWithinAt.limsup_norm_slope_le | [
{
"state_after": "E : Type u\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℝ E\nf : ℝ → E\nf' : E\ns : Set ℝ\nx r : ℝ\nhf : HasDerivWithinAt f f' s x\nhr : ‖f'‖ < r\nhr₀ : 0 < r\n⊢ ∀ᶠ (z : ℝ) in 𝓝[s] x, ‖z - x‖⁻¹ * ‖f z - f x‖ < r",
"state_before": "E : Type u\ninst✝¹ : NormedAddCommGroup E\ninst✝ : ... | [
138,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/CategoryTheory/Subobject/Types.lean | subtype_val_mono | [] | [
36,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
35,
1
] |
Mathlib/Order/Filter/NAry.lean | Filter.map₂_mono | [] | [
87,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.iUnion_eq_if | [] | [
246,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/GroupTheory/Perm/Support.lean | Equiv.Perm.Disjoint.mul_apply_eq_iff | [
{
"state_after": "α : Type u_1\nf g h✝ σ τ : Perm α\nhστ : Disjoint σ τ\na : α\nh : ↑(σ * τ) a = a\n⊢ ↑σ a = a ∧ ↑τ a = a",
"state_before": "α : Type u_1\nf g h σ τ : Perm α\nhστ : Disjoint σ τ\na : α\n⊢ ↑(σ * τ) a = a ↔ ↑σ a = a ∧ ↑τ a = a",
"tactic": "refine' ⟨fun h => _, fun h => by rw [mul_apply, h.... | [
184,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
179,
1
] |
Mathlib/Logic/Function/Basic.lean | Function.Injective.hasLeftInverse | [] | [
471,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
470,
1
] |
Mathlib/Topology/Order/Basic.lean | nhds_basis_Ioo_pos | [
{
"state_after": "case h.e'_5.h\nα : Type u\nβ : Type v\nγ : Type w\ninst✝³ : TopologicalSpace α\ninst✝² : LinearOrderedAddCommGroup α\ninst✝¹ : OrderTopology α\nl : Filter β\nf g : β → α\ninst✝ : NoMaxOrder α\na x✝ : α\n⊢ Ioo (a - x✝) (a + x✝) = {b | abs (b - a) < x✝}",
"state_before": "α : Type u\nβ : Typ... | [
1921,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1918,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean | CategoryTheory.Limits.mapPair_right | [] | [
170,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean | Differentiable.log | [] | [
190,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/LinearAlgebra/Projection.lean | LinearMap.IsProj.codRestrict_apply | [] | [
414,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
413,
1
] |
Mathlib/Data/Int/Bitwise.lean | Int.bit1_ne_bit0 | [] | [
189,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
188,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.top_apply' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.126091\nR : Type ?u.126094\nR' : Type ?u.126097\nms : Set (OuterMeasure α)\nm : OuterMeasure α\ns : Set α\nh : s = ∅\n⊢ ↑⊤ s = ⨅ (_ : s = ∅), 0",
"tactic": "simp [h]"
},
{
"state_after": "no goals",
"state_before": "α : ... | [
631,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
630,
1
] |
Mathlib/Data/Multiset/FinsetOps.lean | Multiset.ndinsert_of_not_mem | [] | [
54,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.sigmaCurry_apply | [
{
"state_after": "ι : Type u\nγ : Type w\nβ : ι → Type v\nβ₁ : ι → Type v₁\nβ₂ : ι → Type v₂\ndec : DecidableEq ι\nκ : Type ?u.598778\nα : ι → Type u_1\nδ : (i : ι) → α i → Type v\ninst✝ : (i : ι) → (j : α i) → Zero (δ i j)\nf : Π₀ (i : (i : ι) × α i), δ i.fst i.snd\ni : ι\nj : α i\nem✝ : (a : Prop) → Decidable... | [
1479,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1460,
1
] |
Mathlib/LinearAlgebra/Dual.lean | LinearMap.dualMap_surjective_of_injective | [
{
"state_after": "K : Type u\ninst✝⁴ : Field K\nV₁ : Type v'\nV₂ : Type v''\ninst✝³ : AddCommGroup V₁\ninst✝² : Module K V₁\ninst✝¹ : AddCommGroup V₂\ninst✝ : Module K V₂\nf : V₁ →ₗ[K] V₂\nhf : Function.Injective ↑f\nφ : Dual K V₁\n⊢ ∃ a, ↑(dualMap f) a = φ",
"state_before": "K : Type u\ninst✝⁴ : Field K\nV... | [
1357,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1348,
1
] |
Mathlib/CategoryTheory/Subobject/Lattice.lean | CategoryTheory.MonoOver.top_left | [] | [
50,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
49,
1
] |
Mathlib/GroupTheory/Submonoid/Inverses.lean | Submonoid.unit_mem_leftInv | [] | [
81,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.updateColumn_submatrix_equiv | [
{
"state_after": "no goals",
"state_before": "l : Type u_4\nm : Type u_3\nn : Type u_2\no : Type u_1\nm' : o → Type ?u.1238605\nn' : o → Type ?u.1238610\nR : Type ?u.1238613\nS : Type ?u.1238616\nα : Type v\nβ : Type w\nγ : Type ?u.1238623\nM : Matrix m n α\ni : m\nj✝ : n\nb : n → α\nc✝ : m → α\ninst✝¹ : De... | [
2891,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2887,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Ioc_erase_right | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.85417\nα : Type u_1\ninst✝² : PartialOrder α\ninst✝¹ : LocallyFiniteOrder α\na✝ b✝ c : α\ninst✝ : DecidableEq α\na b : α\n⊢ erase (Ioc a b) b = Ioo a b",
"tactic": "simp [← coe_inj]"
}
] | [
557,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
557,
1
] |
Mathlib/Order/Bounds/Basic.lean | isGLB_upperBounds | [] | [
1027,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1026,
1
] |
Mathlib/Data/Rat/NNRat.lean | NNRat.coe_lt_coe | [] | [
172,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Algebra/GroupWithZero/Divisibility.lean | dvd_antisymm' | [] | [
126,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/Order/Partition/Finpartition.lean | Finpartition.card_filter_atomise_le_two_pow | [
{
"state_after": "α : Type u_1\ninst✝ : DecidableEq α\ns t : Finset α\nP : Finpartition s\nF : Finset (Finset α)\nht : t ∈ F\nh :\n filter (fun u => u ⊆ t ∧ Finset.Nonempty u) (atomise s F).parts ⊆\n image (fun P => filter (fun i => ∀ (x : Finset α), x ∈ F → (x ∈ insert t P ↔ i ∈ x)) s) (powerset (erase F t... | [
602,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
590,
1
] |
Mathlib/Topology/ContinuousOn.lean | nhdsWithin_eq_nhdsWithin' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.12030\nγ : Type ?u.12033\nδ : Type ?u.12036\ninst✝ : TopologicalSpace α\na : α\ns t u : Set α\nhs : s ∈ 𝓝 a\nh₂ : t ∩ s = u ∩ s\n⊢ 𝓝[t] a = 𝓝[u] a",
"tactic": "rw [nhdsWithin_restrict' t hs, nhdsWithin_restrict' u hs, h₂]"
}
] | [
212,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
211,
1
] |
Std/Data/List/Lemmas.lean | List.range'_append | [
{
"state_after": "no goals",
"state_before": "s m n step : Nat\n⊢ range' s (m + 1) step ++ range' (s + step * (m + 1)) n step = range' s (n + (m + 1)) step",
"tactic": "simpa [range', Nat.mul_succ, Nat.add_assoc, Nat.add_comm]\n using range'_append (s + step) m n step"
}
] | [
1852,
46
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1847,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.minFac_le_div | [
{
"state_after": "n : ℕ\npos : 0 < n\nnp : ¬Prime n\nh0 : n = minFac n * 0\n⊢ ¬0 < 0",
"state_before": "n : ℕ\npos : 0 < n\nnp : ¬Prime n\nh0 : n = minFac n * 0\n⊢ ¬0 < n",
"tactic": "rw [h0, mul_zero]"
},
{
"state_after": "no goals",
"state_before": "n : ℕ\npos : 0 < n\nnp : ¬Prime n\nh0 : ... | [
407,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
394,
1
] |
Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean | PrimeSpectrum.comap_inducing_of_surjective | [
{
"state_after": "R : Type u\nS : Type v\ninst✝² : CommRing R\ninst✝¹ : CommRing S\nS' : Type ?u.259728\ninst✝ : CommRing S'\nf : R →+* S\nhf : Surjective ↑f\n⊢ ∀ (s : Set (PrimeSpectrum S)), (∃ s_1, sᶜ = zeroLocus s_1) ↔ ∃ t, (∃ s, t = zeroLocus s) ∧ ↑(comap f) ⁻¹' t = sᶜ",
"state_before": "R : Type u\nS :... | [
716,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
703,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.not_infinite_zero | [] | [
447,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
447,
1
] |
Mathlib/Data/Matrix/Notation.lean | Matrix.submatrix_cons_row | [
{
"state_after": "case a.h\nα : Type u\no n m : ℕ\nm' : Type uₘ\nn' : Type uₙ\no' : Type uₒ\na b : ℕ\nA : Matrix m' n' α\ni✝ : m'\nrow : Fin m → m'\ncol : o' → n'\ni : Fin (Nat.succ m)\nj : o'\n⊢ submatrix A (vecCons i✝ row) col i j = vecCons (fun j => A i✝ (col j)) (submatrix A row col) i j",
"state_before... | [
386,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
383,
1
] |
Mathlib/Data/List/Rotate.lean | List.IsRotated.mem_iff | [] | [
487,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
486,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | ContinuousLinearEquiv.iteratedFDerivWithin_comp_left | [
{
"state_after": "case zero\n𝕜 : 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... | [
278,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
259,
1
] |
Mathlib/Topology/DiscreteQuotient.lean | DiscreteQuotient.isClopen_preimage | [] | [
142,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | intervalIntegral.integral_hasDerivWithinAt_right | [] | [
915,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
912,
1
] |
Mathlib/LinearAlgebra/BilinearForm.lean | BilinForm.finrank_add_finrank_orthogonal | [
{
"state_after": "R : Type ?u.1617651\nM : Type ?u.1617654\ninst✝¹⁷ : Semiring R\ninst✝¹⁶ : AddCommMonoid M\ninst✝¹⁵ : Module R M\nR₁ : Type ?u.1617690\nM₁ : Type ?u.1617693\ninst✝¹⁴ : Ring R₁\ninst✝¹³ : AddCommGroup M₁\ninst✝¹² : Module R₁ M₁\nR₂ : Type ?u.1618302\nM₂ : Type ?u.1618305\ninst✝¹¹ : CommSemiring ... | [
1431,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1422,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.span_singleton_mul_span_singleton | [
{
"state_after": "R : Type u\nι : Type ?u.223899\ninst✝ : CommSemiring R\nI J K L : Ideal R\nr s : R\n⊢ Submodule.span R {r} * Submodule.span R {s} = Submodule.span R {r * s}",
"state_before": "R : Type u\nι : Type ?u.223899\ninst✝ : CommSemiring R\nI J K L : Ideal R\nr s : R\n⊢ span {r} * span {s} = span {... | [
530,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
527,
1
] |
Mathlib/Order/Lattice.lean | inf_le_inf_right | [] | [
480,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
479,
1
] |
Mathlib/Data/MvPolynomial/Rename.lean | MvPolynomial.rename_injective | [
{
"state_after": "σ : Type u_1\nτ : Type u_2\nα : Type ?u.263211\nR : Type u_3\nS : Type ?u.263217\ninst✝¹ : CommSemiring R\ninst✝ : CommSemiring S\nf : σ → τ\nhf : Injective f\nthis : ↑(rename f) = Finsupp.mapDomain (Finsupp.mapDomain f)\n⊢ Injective ↑(rename f)",
"state_before": "σ : Type u_1\nτ : Type u_... | [
123,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.valMinAbs_zero | [
{
"state_after": "no goals",
"state_before": "⊢ valMinAbs 0 = 0",
"tactic": "simp only [valMinAbs_def_zero]"
},
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ valMinAbs 0 = 0",
"tactic": "simp only [valMinAbs_def_pos, if_true, Int.ofNat_zero, zero_le, val_zero]"
}
] | [
993,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
991,
1
] |
Mathlib/Data/Int/Order/Basic.lean | Int.lt_ediv_iff_mul_lt | [] | [
473,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
471,
11
] |
Mathlib/RingTheory/UniqueFactorizationDomain.lean | Associates.factors_le | [
{
"state_after": "α : Type u_1\ninst✝¹ : CancelCommMonoidWithZero α\ndec_irr : (p : Associates α) → Decidable (Irreducible p)\ninst✝ : UniqueFactorizationMonoid α\ndec : DecidableEq α\ndec' : DecidableEq (Associates α)\na b : Associates α\nh : factors a ≤ factors b\nthis : FactorSet.prod (factors a) ≤ FactorSet... | [
1538,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1533,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.