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/Order/CompleteLattice.lean | iInf_sum | [] | [
1572,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1571,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | Polynomial.coe_monomial | [
{
"state_after": "case h\nσ : Type ?u.4303706\nR : Type u_1\ninst✝ : CommSemiring R\nφ ψ : R[X]\nn : ℕ\na : R\nn✝ : ℕ\n⊢ ↑(PowerSeries.coeff R n✝) ↑(↑(monomial n) a) = ↑(PowerSeries.coeff R n✝) (↑(PowerSeries.monomial R n) a)",
"state_before": "σ : Type ?u.4303706\nR : Type u_1\ninst✝ : CommSemiring R\nφ ψ ... | [
2552,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2549,
1
] |
Mathlib/GroupTheory/Submonoid/Basic.lean | Submonoid.coe_copy | [] | [
217,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
216,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.restrict_restrict_of_subset | [
{
"state_after": "case h\nα : Type u_1\nβ : Type ?u.290160\nγ : Type ?u.290163\nδ : Type ?u.290166\nι : Type ?u.290169\nR : Type ?u.290172\nR' : Type ?u.290175\nm0 : MeasurableSpace α\ninst✝¹ : MeasurableSpace β\ninst✝ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set α\nh : s ⊆ t\nu : Set α\... | [
1645,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1642,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean | AffineEquiv.symm_trans_self | [] | [
376,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
375,
1
] |
Mathlib/Algebra/Group/Prod.lean | Prod.mk_eq_one | [] | [
116,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Data/IsROrC/Basic.lean | IsROrC.conj_inv | [] | [
576,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
575,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.Memℒp.of_bound | [] | [
567,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
565,
1
] |
Mathlib/RingTheory/DedekindDomain/Ideal.lean | idealFactorsEquivOfQuotEquiv_is_dvd_iso | [
{
"state_after": "R : Type u_1\nA : Type u_2\nK : Type ?u.1117270\ninst✝⁹ : CommRing R\ninst✝⁸ : CommRing A\ninst✝⁷ : Field K\ninst✝⁶ : IsDomain A\ninst✝⁵ : IsDedekindDomain A\nI : Ideal R\nJ : Ideal A\nB : Type ?u.1117807\ninst✝⁴ : CommRing B\ninst✝³ : IsDomain B\ninst✝² : IsDedekindDomain B\nL✝ : Ideal B\nins... | [
1128,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1121,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Independent.lean | AffineIndependent.range | [
{
"state_after": "k : Type u_1\nV : Type u_2\nP : Type u_3\ninst✝³ : Ring k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\nι : Type u_4\np : ι → P\nha : AffineIndependent k p\nf : ↑(Set.range p) → ι := fun x => Exists.choose (_ : ↑x ∈ Set.range p)\n⊢ AffineIndependent k fun x => ↑x",
... | [
328,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
321,
11
] |
Mathlib/Data/Finset/Card.lean | Finset.card_le_card_of_inj_on | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\ns t✝ : Finset α\nf✝ : α → β\nn : ℕ\nt : Finset β\nf : α → β\nhf : ∀ (a : α), a ∈ s → f a ∈ t\nf_inj : ∀ (a₁ : α), a₁ ∈ s → ∀ (a₂ : α), a₂ ∈ s → f a₁ = f a₂ → a₁ = a₂\n⊢ card s ≤ card t",
"tactic": "classical calc\n s.card = (s.... | [
334,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
330,
1
] |
Mathlib/RingTheory/FinitePresentation.lean | Algebra.FinitePresentation.of_finiteType | [
{
"state_after": "R : Type w₁\nA : Type w₂\nB : Type w₃\ninst✝⁵ : CommRing R\ninst✝⁴ : CommRing A\ninst✝³ : Algebra R A\ninst✝² : CommRing B\ninst✝¹ : Algebra R B\ninst✝ : IsNoetherianRing R\nh : FiniteType R A\n⊢ FinitePresentation R A",
"state_before": "R : Type w₁\nA : Type w₂\nB : Type w₃\ninst✝⁵ : Comm... | [
80,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/Topology/LocalExtr.lean | IsLocalMin.add | [] | [
369,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
367,
8
] |
Mathlib/Topology/Compactification/OnePoint.lean | OnePoint.range_coe_union_infty | [] | [
122,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/Geometry/Euclidean/Inversion.lean | EuclideanGeometry.dist_inversion_center | [
{
"state_after": "case inl\nV : Type u_2\nP : Type u_1\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerProductSpace ℝ V\ninst✝¹ : MetricSpace P\ninst✝ : NormedAddTorsor V P\na b c d x✝ y z : P\nR✝ : ℝ\nx : P\nR : ℝ\n⊢ dist (inversion x R x) x = R ^ 2 / dist x x\n\ncase inr\nV : Type u_2\nP : Type u_1\ninst✝³ : No... | [
72,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Mathlib/GroupTheory/Congruence.lean | Con.div | [
{
"state_after": "no goals",
"state_before": "M : Type u_1\nN : Type ?u.98980\nP : Type ?u.98983\ninst✝² : Group M\ninst✝¹ : Group N\ninst✝ : Group P\nc : Con M\nw x y z : M\nh1 : ↑c w x\nh2 : ↑c y z\n⊢ ↑c (w / y) (x / z)",
"tactic": "simpa only [div_eq_mul_inv] using c.mul h1 (c.inv h2)"
}
] | [
1232,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1231,
11
] |
Mathlib/Data/Matrix/Block.lean | Matrix.blockDiagonal'_conjTranspose | [
{
"state_after": "l : Type ?u.201579\nm : Type ?u.201582\nn : Type ?u.201585\no : Type u_4\np : Type ?u.201591\nq : Type ?u.201594\nm' : o → Type u_2\nn' : o → Type u_3\np' : o → Type ?u.201609\nR : Type ?u.201612\nS : Type ?u.201615\nα✝ : Type ?u.201618\nβ : Type ?u.201621\ninst✝⁴ : DecidableEq o\ninst✝³ : Zer... | [
691,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
688,
1
] |
Mathlib/Algebra/Lie/Subalgebra.lean | LieSubalgebra.bot_coe | [] | [
437,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
436,
1
] |
Mathlib/LinearAlgebra/TensorProduct.lean | TensorProduct.map_add_right | [
{
"state_after": "case H.h.h\nR : Type u_1\ninst✝¹⁸ : CommSemiring R\nR' : Type ?u.989827\ninst✝¹⁷ : Monoid R'\nR'' : Type ?u.989833\ninst✝¹⁶ : Semiring R''\nM : Type u_2\nN : Type u_4\nP : Type u_3\nQ : Type u_5\nS : Type ?u.989851\ninst✝¹⁵ : AddCommMonoid M\ninst✝¹⁴ : AddCommMonoid N\ninst✝¹³ : AddCommMonoid ... | [
800,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
797,
1
] |
Mathlib/LinearAlgebra/Basis.lean | Basis.reindexRange_repr' | [
{
"state_after": "ι : Type u_2\nι' : Type ?u.390992\nR : Type u_3\nR₂ : Type ?u.390998\nK : Type ?u.391001\nM : Type u_1\nM' : Type ?u.391007\nM'' : Type ?u.391010\nV : Type u\nV' : Type ?u.391015\ninst✝⁴ : Semiring R\ninst✝³ : AddCommMonoid M\ninst✝² : Module R M\ninst✝¹ : AddCommMonoid M'\ninst✝ : Module R M'... | [
507,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
492,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.mapDomain_add | [] | [
499,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
498,
1
] |
Mathlib/Algebra/Lie/Normalizer.lean | LieSubalgebra.normalizer_eq_self_iff | [
{
"state_after": "R : Type u_2\nL : Type u_1\nM : Type ?u.62528\nM' : Type ?u.62531\ninst✝¹⁰ : CommRing R\ninst✝⁹ : LieRing L\ninst✝⁸ : LieAlgebra R L\ninst✝⁷ : AddCommGroup M\ninst✝⁶ : Module R M\ninst✝⁵ : LieRingModule L M\ninst✝⁴ : LieModule R L M\ninst✝³ : AddCommGroup M'\ninst✝² : Module R M'\ninst✝¹ : Lie... | [
189,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Topology/Connected.lean | isPreconnected_univ_pi | [
{
"state_after": "case intro.intro.intro.intro\nα : Type u\nβ : Type v\nι : Type u_2\nπ : ι → Type u_1\ninst✝¹ : TopologicalSpace α\ns✝ t u✝ v✝ : Set α\ninst✝ : (i : ι) → TopologicalSpace (π i)\ns : (i : ι) → Set (π i)\nhs : ∀ (i : ι), IsPreconnected (s i)\nu v : Set ((i : ι) → π i)\nuo : IsOpen u\nvo : IsOpen ... | [
503,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
483,
1
] |
Mathlib/Data/Complex/Exponential.lean | Complex.cos_two_mul' | [
{
"state_after": "no goals",
"state_before": "x y : ℂ\n⊢ cos (2 * x) = cos x ^ 2 - sin x ^ 2",
"tactic": "rw [two_mul, cos_add, ← sq, ← sq]"
}
] | [
1029,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1029,
1
] |
Mathlib/Computability/EpsilonNFA.lean | εNFA.evalFrom_append_singleton | [
{
"state_after": "no goals",
"state_before": "α : Type u\nσ σ' : Type v\nM : εNFA α σ\nS✝ : Set σ\nx✝ : List α\ns : σ\na✝ : α\nS : Set σ\nx : List α\na : α\n⊢ evalFrom M S (x ++ [a]) = stepSet M (evalFrom M S x) a",
"tactic": "rw [evalFrom, List.foldl_append, List.foldl_cons, List.foldl_nil]"
}
] | [
110,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/Topology/VectorBundle/Basic.lean | VectorPrebundle.to_vectorBundle | [
{
"state_after": "case mk.intro.intro\nR : Type u_1\nB : Type u_2\nF : Type u_3\nE : B → Type u_4\ninst✝⁶ : NontriviallyNormedField R\ninst✝⁵ : (x : B) → AddCommMonoid (E x)\ninst✝⁴ : (x : B) → Module R (E x)\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace R F\ninst✝¹ : TopologicalSpace B\ninst✝ : (x : B) ... | [
992,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
976,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.ae_restrict_uIoc_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.565282\nγ : Type ?u.565285\nδ : Type ?u.565288\nι : Type ?u.565291\nR : Type ?u.565294\nR' : Type ?u.565297\nm0 : MeasurableSpace α\ninst✝² : MeasurableSpace β\ninst✝¹ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set... | [
2787,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2785,
1
] |
Mathlib/LinearAlgebra/Alternating.lean | AlternatingMap.coe_alternatization | [
{
"state_after": "case a\nR : Type u_2\ninst✝¹² : Semiring R\nM : Type u_3\ninst✝¹¹ : AddCommMonoid M\ninst✝¹⁰ : Module R M\nN : Type ?u.719894\ninst✝⁹ : AddCommMonoid N\ninst✝⁸ : Module R N\nP : Type ?u.719924\ninst✝⁷ : AddCommMonoid P\ninst✝⁶ : Module R P\nM' : Type ?u.719954\ninst✝⁵ : AddCommGroup M'\ninst✝⁴... | [
906,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
900,
1
] |
Mathlib/Data/Bool/Count.lean | List.count_true_add_count_false | [] | [
47,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
46,
1
] |
Mathlib/Topology/Algebra/Order/Compact.lean | IsCompact.isGreatest_sSup | [] | [
184,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.isBigOWith_self_const_mul' | [
{
"state_after": "α : Type u_2\nβ : Type ?u.325839\nE : Type ?u.325842\nF : Type ?u.325845\nG : Type ?u.325848\nE' : Type ?u.325851\nF' : Type ?u.325854\nG' : Type ?u.325857\nE'' : Type ?u.325860\nF'' : Type ?u.325863\nG'' : Type ?u.325866\nR : Type u_1\nR' : Type ?u.325872\n𝕜 : Type ?u.325875\n𝕜' : Type ?u.3... | [
1462,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1459,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.Frequently.exists | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.160311\nι : Sort x\np : α → Prop\nf : Filter α\nhp : ∃ᶠ (x : α) in f, p x\nH : ¬∃ x, p x\n⊢ False",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.160311\nι : Sort x\np : α → Prop\nf : Filter α\nhp : ∃ᶠ (x : α) in f, p x\n⊢ ... | [
1295,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1292,
1
] |
Mathlib/Topology/FiberBundle/Trivialization.lean | Pretrivialization.coe_fst | [] | [
118,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/Topology/LocallyConstant/Basic.lean | LocallyConstant.toFun_eq_coe | [] | [
265,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
264,
1
] |
Mathlib/CategoryTheory/Monoidal/FunctorCategory.lean | CategoryTheory.Monoidal.tensorObj_obj | [] | [
93,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Data/Nat/Cast/Defs.lean | one_add_one_eq_two | [
{
"state_after": "α : Type u_1\ninst✝ : AddMonoidWithOne α\n⊢ ↑(1 + 1) = 2",
"state_before": "α : Type u_1\ninst✝ : AddMonoidWithOne α\n⊢ 1 + 1 = 2",
"tactic": "rw [←Nat.cast_one, ←Nat.cast_add]"
},
{
"state_after": "case h\nα : Type u_1\ninst✝ : AddMonoidWithOne α\n⊢ 1 + 1 = 2",
"state_befo... | [
230,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
227,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/StrictInitial.lean | CategoryTheory.Limits.initialMul_inv | [] | [
157,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Icc_subset_Ioo_iff | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.25908\nα : Type u_1\ninst✝¹ : Preorder α\ninst✝ : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\nh₁ : a₁ ≤ b₁\n⊢ Icc a₁ b₁ ⊆ Ioo a₂ b₂ ↔ a₂ < a₁ ∧ b₁ < b₂",
"tactic": "rw [← coe_subset, coe_Icc, coe_Ioo, Set.Icc_subset_Ioo_iff h₁]"
}
] | [
254,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
253,
1
] |
Mathlib/Order/GameAdd.lean | Sym2.GameAdd.fst | [] | [
183,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Complex.lean | Complex.cpow_add | [
{
"state_after": "x y z : ℂ\nhx : x ≠ 0\n⊢ (if x = 0 then if y + z = 0 then 1 else 0 else exp (log x * (y + z))) =\n if x = 0 then\n if z = 0 then if x = 0 then if y = 0 then 1 * 1 else 0 * 1 else exp (log x * y) * 1\n else if x = 0 then if y = 0 then 1 * 0 else 0 * 0 else exp (log x * y) * 0\n ... | [
96,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/Algebra/Order/Interval.lean | Interval.bot_ne_one | [] | [
103,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/MeasureTheory/Function/Floor.lean | MeasurableSet.image_fract | [
{
"state_after": "α : Type ?u.4493\nR : Type u_1\ninst✝⁶ : MeasurableSpace α\ninst✝⁵ : LinearOrderedRing R\ninst✝⁴ : FloorRing R\ninst✝³ : TopologicalSpace R\ninst✝² : OrderTopology R\ninst✝¹ : MeasurableSpace R\ninst✝ : BorelSpace R\ns : Set R\nhs : MeasurableSet s\n⊢ MeasurableSet (⋃ (m : ℤ), (fun x => x + ↑m... | [
65,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/Order/Heyting/Basic.lean | compl_sup | [] | [
795,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
794,
1
] |
Mathlib/Logic/Function/Conjugate.lean | Function.Semiconj.eq | [] | [
48,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
47,
11
] |
Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean | MeasureTheory.FinStronglyMeasurable.add | [] | [
1076,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1070,
11
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.singleton_disjoint | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.482994\nγ : Type ?u.482997\nl : Multiset α\na : α\n⊢ Disjoint {a} l ↔ ¬a ∈ l",
"tactic": "simp [Disjoint]"
}
] | [
2939,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2938,
1
] |
Mathlib/Algebra/Order/Ring/Defs.lean | min_mul_of_nonneg | [] | [
981,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
980,
1
] |
Mathlib/GroupTheory/Subgroup/Finite.lean | Subgroup.prod_mem | [] | [
80,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
78,
11
] |
Mathlib/Analysis/Complex/OperatorNorm.lean | Complex.imClm_nnnorm | [] | [
63,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/Data/Fintype/Basic.lean | Fintype.finsetEquivSet_apply | [] | [
1049,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1048,
1
] |
Mathlib/Analysis/Calculus/LHopital.lean | deriv.lhopital_zero_nhds' | [
{
"state_after": "a b : ℝ\nhab : a < b\nl : Filter ℝ\nf f' g g' : ℝ → ℝ\nhdf : (∀ᶠ (x : ℝ) in 𝓝[Iio a] a, DifferentiableAt ℝ f x) ∧ ∀ᶠ (x : ℝ) in 𝓝[Ioi a] a, DifferentiableAt ℝ f x\nhg' : (∀ᶠ (x : ℝ) in 𝓝[Iio a] a, deriv g x ≠ 0) ∧ ∀ᶠ (x : ℝ) in 𝓝[Ioi a] a, deriv g x ≠ 0\nhfa : Tendsto f (𝓝[Iio a] a) (𝓝 0... | [
423,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
416,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.monic_monomial_eq | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type u_1\na a' a₁ a₂ : R\ne : ℕ\nn m✝ : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\ninst✝ : CommSemiring S₁\np q : MvPolynomial σ R\nm : σ →₀ ℕ\n⊢ ↑(monomial m) 1 = Finsupp.prod m fun n e => X n ^ e",
"tacti... | [
645,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
644,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsBigO.eq_zero_of_norm_pow | [
{
"state_after": "α : Type ?u.656218\nβ : Type ?u.656221\nE : Type ?u.656224\nF : Type ?u.656227\nG : Type ?u.656230\nE' : Type ?u.656233\nF' : Type ?u.656236\nG' : Type ?u.656239\nE'' : Type u_1\nF'' : Type u_2\nG'' : Type ?u.656248\nR : Type ?u.656251\nR' : Type ?u.656254\n𝕜 : Type ?u.656257\n𝕜' : Type ?u.6... | [
2054,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2051,
1
] |
Mathlib/RingTheory/Polynomial/Quotient.lean | Ideal.eq_zero_of_polynomial_mem_map_range | [
{
"state_after": "R : Type u_1\ninst✝ : CommRing R\nI : Ideal R[X]\nx : { x // x ∈ RingHom.range (RingHom.comp (Quotient.mk I) C) }\nhx : ↑C x ∈ map (mapRingHom (RingHom.rangeRestrict (RingHom.comp (Quotient.mk I) C))) I\ni : R →+* { x // x ∈ RingHom.range (RingHom.comp (Quotient.mk I) C) } :=\n RingHom.rangeR... | [
186,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Types.lean | CategoryTheory.Limits.Types.equalizerIso_hom_comp_subtype | [
{
"state_after": "no goals",
"state_before": "X Y Z : Type u\nf : X ⟶ Y\ng h : Y ⟶ Z\nw : f ≫ g = f ≫ h\n⊢ (equalizerIso g h).hom ≫ Subtype.val = equalizer.ι g h",
"tactic": "rfl"
}
] | [
441,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
440,
1
] |
Mathlib/GroupTheory/Sylow.lean | Sylow.normalizer_sup_eq_top | [
{
"state_after": "p✝ : ℕ\nG : Type u_1\ninst✝³ : Group G\np : ℕ\ninst✝² : Fact (Nat.Prime p)\nN : Subgroup G\ninst✝¹ : Normal N\ninst✝ : Finite (Sylow p { x // x ∈ N })\nP : Sylow p { x // x ∈ N }\ng : G\nx✝ : g ∈ ⊤\n⊢ g ∈ normalizer (map (Subgroup.subtype N) ↑P) ⊔ N",
"state_before": "p✝ : ℕ\nG : Type u_1\... | [
476,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
461,
1
] |
Mathlib/Algebra/Hom/Group.lean | MonoidHom.toOneHom_injective | [] | [
1225,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1223,
1
] |
Mathlib/Order/Heyting/Basic.lean | compl_inf_eq_bot | [] | [
886,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
885,
1
] |
Mathlib/Topology/Order/Basic.lean | nhdsWithin_Ici_eq'' | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² : TopologicalSpace α\ninst✝¹ : Preorder α\ninst✝ : OrderTopology α\na : α\n⊢ ((⨅ (b : α) (_ : b ∈ Iio a), 𝓟 (Ioi b)) ⊓ ⨅ (b : α) (_ : b ∈ Ioi a), 𝓟 (Iio b)) ⊓ 𝓟 (Ici a) =\n (⨅ (u : α) (_ : a < u), 𝓟 (Iio u)) ⊓ 𝓟 (Ici a)",
"state_before": "... | [
1087,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1083,
1
] |
Mathlib/ModelTheory/Basic.lean | FirstOrder.Language.Hom.map_constants | [] | [
541,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
540,
1
] |
Mathlib/Data/Multiset/Powerset.lean | Multiset.powersetLen_empty | [] | [
287,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
285,
1
] |
Mathlib/Data/Rat/Cast.lean | Rat.cast_lt_zero | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.61787\nι : Type ?u.61790\nα : Type ?u.61793\nβ : Type ?u.61796\nK : Type u_1\ninst✝ : LinearOrderedField K\nn : ℚ\n⊢ ↑n < 0 ↔ n < 0",
"tactic": "norm_cast"
}
] | [
348,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
347,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.span_mono | [] | [
73,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Algebra/Order/Group/Defs.lean | inv_mul_lt_iff_lt_mul | [
{
"state_after": "no goals",
"state_before": "α : Type u\ninst✝² : Group α\ninst✝¹ : LT α\ninst✝ : CovariantClass α α (fun x x_1 => x * x_1) fun x x_1 => x < x_1\na b c : α\n⊢ b⁻¹ * a < c ↔ a < b * c",
"tactic": "rw [← mul_lt_mul_iff_left b, mul_inv_cancel_left]"
}
] | [
182,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
181,
1
] |
Mathlib/GroupTheory/NielsenSchreier.lean | IsFreeGroupoid.SpanningTree.treeHom_root | [] | [
189,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
186,
1
] |
Mathlib/Algebra/Group/Defs.lean | mul_right_inj | [] | [
197,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
1
] |
Mathlib/Analysis/Asymptotics/Theta.lean | Asymptotics.isTheta_const_const_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.49940\nE : Type ?u.49943\nF : Type ?u.49946\nG : Type ?u.49949\nE' : Type ?u.49952\nF' : Type ?u.49955\nG' : Type ?u.49958\nE'' : Type u_2\nF'' : Type u_3\nG'' : Type ?u.49967\nR : Type ?u.49970\nR' : Type ?u.49973\n𝕜 : Type ?u.49976\n... | [
268,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
266,
1
] |
Mathlib/RepresentationTheory/Maschke.lean | LinearMap.conjugate_i | [
{
"state_after": "no goals",
"state_before": "k : Type u\ninst✝⁹ : CommRing k\nG : Type u\ninst✝⁸ : Group G\nV : Type v\ninst✝⁷ : AddCommGroup V\ninst✝⁶ : Module k V\ninst✝⁵ : Module (MonoidAlgebra k G) V\ninst✝⁴ : IsScalarTower k (MonoidAlgebra k G) V\nW : Type w\ninst✝³ : AddCommGroup W\ninst✝² : Module k... | [
87,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.Tendsto.piecewise | [] | [
3107,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3104,
11
] |
Mathlib/Algebra/Order/Group/Defs.lean | Left.self_lt_inv | [] | [
474,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
473,
1
] |
Mathlib/CategoryTheory/Sites/Sieves.lean | CategoryTheory.Sieve.generate_of_singleton_isSplitEpi | [] | [
445,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
443,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.forall_ennreal | [] | [
253,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
252,
1
] |
Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean | Asymptotics.SuperpolynomialDecay.trans_eventually_abs_le | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nl : Filter α\nk f g g' : α → β\ninst✝² : TopologicalSpace β\ninst✝¹ : LinearOrderedCommRing β\ninst✝ : OrderTopology β\nhf : ∀ (n : ℕ), Tendsto (fun a => abs (k a ^ n * f a)) l (𝓝 0)\nhfg : abs ∘ g ≤ᶠ[l] abs ∘ f\n⊢ ∀ (n : ℕ), Tendsto (fun a => abs (k a ^ n * g a)) ... | [
189,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/AlgebraicTopology/DoldKan/PInfty.lean | AlgebraicTopology.DoldKan.PInfty_comp_QInfty | [
{
"state_after": "case h\nC : Type u_2\ninst✝¹ : Category C\ninst✝ : Preadditive C\nX : SimplicialObject C\nn : ℕ\n⊢ HomologicalComplex.Hom.f (PInfty ≫ QInfty) n = HomologicalComplex.Hom.f 0 n",
"state_before": "C : Type u_2\ninst✝¹ : Category C\ninst✝ : Preadditive C\nX : SimplicialObject C\n⊢ PInfty ≫ QIn... | [
142,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/Data/Subtype.lean | exists_subtype_mk_eq_iff | [
{
"state_after": "no goals",
"state_before": "α : Sort u_1\nβ : Sort ?u.5647\nγ : Sort ?u.5650\np q : α → Prop\na : Subtype p\nb : α\n⊢ (∃ h, { val := b, property := h } = a) ↔ b = ↑a",
"tactic": "simp only [@eq_comm _ b, exists_eq_subtype_mk_iff, @eq_comm _ _ a]"
}
] | [
150,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.extend_comp_eq | [] | [
395,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
393,
1
] |
Mathlib/Analysis/Analytic/Linear.lean | ContinuousLinearMap.analyticAt | [] | [
66,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
11
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | LinearIsometry.ediam_range | [] | [
329,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
328,
1
] |
Mathlib/Tactic/Abel.lean | Mathlib.Tactic.Abel.term_neg | [
{
"state_after": "α : Type u_1\ninst✝ : AddCommGroup α\nn : ℤ\nx a : α\nn' : ℤ\na' : α\nh₁ : -n = n'\nh₂ : -a = a'\n⊢ -a + -(n • x) = -(n • x) + -a",
"state_before": "α : Type u_1\ninst✝ : AddCommGroup α\nn : ℤ\nx a : α\nn' : ℤ\na' : α\nh₁ : -n = n'\nh₂ : -a = a'\n⊢ -termg n x a = termg n' x a'",
"tacti... | [
188,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
186,
1
] |
Mathlib/Data/Setoid/Partition.lean | Setoid.eq_of_mem_eqv_class | [] | [
52,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
50,
1
] |
Mathlib/Topology/ContinuousFunction/Compact.lean | ContinuousMap.linearIsometryBoundedOfCompact_apply_apply | [] | [
325,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/GroupTheory/GroupAction/Defs.lean | Commute.smul_left | [] | [
444,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
442,
1
] |
Mathlib/Topology/Algebra/Module/LocallyConvex.lean | locallyConvexSpace_induced | [
{
"state_after": "ι : Sort ?u.45774\n𝕜 : Type u_2\nE : Type u_3\nF : Type u_1\ninst✝⁵ : OrderedSemiring 𝕜\ninst✝⁴ : AddCommMonoid E\ninst✝³ : Module 𝕜 E\ninst✝² : AddCommMonoid F\ninst✝¹ : Module 𝕜 F\nt : TopologicalSpace F\ninst✝ : LocallyConvexSpace 𝕜 F\nf : E →ₗ[𝕜] F\nthis : TopologicalSpace E := induc... | [
188,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
181,
1
] |
Mathlib/Analysis/Convex/Jensen.lean | ConcaveOn.le_map_sum | [] | [
76,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Std/Data/List/Lemmas.lean | List.leftpad_length | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nn : Nat\na : α\nl : List α\n⊢ length (leftpad n a l) = max n (length l)",
"tactic": "simp only [leftpad, length_append, length_replicate, Nat.sub_add_eq_max]"
}
] | [
1461,
75
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1459,
1
] |
Mathlib/LinearAlgebra/Matrix/Symmetric.lean | Matrix.IsSymm.neg | [] | [
103,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/Topology/Category/CompHaus/EffectiveEpi.lean | CompHaus.effectiveEpiFamily_of_jointly_surjective | [] | [
189,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/GroupTheory/Schreier.lean | Subgroup.rank_le_index_mul_rank | [
{
"state_after": "G : Type u_1\ninst✝¹ : Group G\nH : Subgroup G\nR S : Set G\nhG : Group.FG G\ninst✝ : FiniteIndex H\nthis : Group.FG { x // x ∈ H }\n⊢ Group.rank { x // x ∈ H } ≤ index H * Group.rank G",
"state_before": "G : Type u_1\ninst✝¹ : Group G\nH : Subgroup G\nR S : Set G\nhG : Group.FG G\ninst✝ :... | [
146,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.one_lt_ncard_iff | [
{
"state_after": "α : Type u_1\nβ : Type ?u.156869\ns t : Set α\na b x y : α\nf : α → β\nhs : autoParam (Set.Finite s) _auto✝\n⊢ (∃ a, a ∈ s ∧ ∃ b, b ∈ s ∧ a ≠ b) ↔ ∃ a b, a ∈ s ∧ b ∈ s ∧ a ≠ b",
"state_before": "α : Type u_1\nβ : Type ?u.156869\ns t : Set α\na b x y : α\nf : α → β\nhs : autoParam (Set.Fini... | [
705,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
702,
1
] |
Std/Data/Array/Init/Lemmas.lean | Array.foldlM_eq_foldlM_data | [
{
"state_after": "no goals",
"state_before": "m : Type u_1 → Type u_2\nβ : Type u_1\nα : Type u_3\ninst✝ : Monad m\nf : β → α → m β\ninit : β\narr : Array α\n⊢ foldlM f init arr 0 (size arr) = List.foldlM f init arr.data",
"tactic": "simp [foldlM, foldlM_eq_foldlM_data.aux]"
}
] | [
45,
43
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
42,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.max_def | [] | [
517,
80
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
517,
11
] |
Mathlib/LinearAlgebra/QuadraticForm/Basic.lean | BilinForm.toQuadraticForm_eq_zero | [] | [
713,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
712,
1
] |
Mathlib/Data/Finset/Fold.lean | Finset.fold_disjiUnion | [] | [
112,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/FieldTheory/RatFunc.lean | RatFunc.ofFractionRing_neg | [
{
"state_after": "no goals",
"state_before": "K : Type u\ninst✝ : CommRing K\np : FractionRing K[X]\n⊢ { toFractionRing := -p } = -{ toFractionRing := p }",
"tactic": "simp only [Neg.neg, RatFunc.neg]"
}
] | [
356,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
355,
1
] |
Mathlib/MeasureTheory/Measure/AEMeasurable.lean | Subsingleton.aemeasurable | [] | [
33,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
32,
1
] |
Std/Data/String/Lemmas.lean | Substring.ValidFor.get | [
{
"state_after": "no goals",
"state_before": "l m₁ : List Char\nc : Char\nm₂ r : List Char\n⊢ Substring.get\n { str := { data := l ++ (m₁ ++ c :: m₂) ++ r }, startPos := { byteIdx := utf8Len l },\n stopPos := { byteIdx := utf8Len l + utf8Len (m₁ ++ c :: m₂) } }\n { byteIdx := utf8Len m₁ } =... | [
827,
66
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
826,
1
] |
Mathlib/Data/Set/Finite.lean | Set.finite_singleton | [] | [
838,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
837,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.iUnion_div_left_image | [] | [
744,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
743,
1
] |
Mathlib/Init/Data/List/Lemmas.lean | List.length_mapAccumr | [] | [
48,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
45,
1
] |
Mathlib/Data/Nat/Choose/Cast.lean | Nat.cast_add_choose | [
{
"state_after": "no goals",
"state_before": "K : Type u_1\ninst✝¹ : DivisionRing K\ninst✝ : CharZero K\na b : ℕ\n⊢ ↑(choose (a + b) a) = ↑(a + b)! / (↑a ! * ↑b !)",
"tactic": "rw [cast_choose K (_root_.le_add_right le_rfl), add_tsub_cancel_left]"
}
] | [
35,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
34,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.