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/Topology/UniformSpace/Completion.lean | UniformSpace.Completion.uniformContinuous_map | [] | [
588,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
587,
1
] |
Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean | SimpleGraph.toGraph_adjMatrix_eq | [
{
"state_after": "case Adj.h.h.a\nV : Type u_2\nα : Type u_1\nβ : Type ?u.29980\nG : SimpleGraph V\ninst✝² : DecidableRel G.Adj\ninst✝¹ : MulZeroOneClass α\ninst✝ : Nontrivial α\nx✝¹ x✝ : V\n⊢ Adj (IsAdjMatrix.toGraph (_ : IsAdjMatrix (adjMatrix α G))) x✝¹ x✝ ↔ Adj G x✝¹ x✝",
"state_before": "V : Type u_2\n... | [
196,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/Data/Real/CauSeq.lean | CauSeq.const_add | [] | [
283,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/Algebra/Group/Prod.lean | MonoidHom.coprod_comp_inl | [
{
"state_after": "no goals",
"state_before": "A : Type ?u.64869\nB : Type ?u.64872\nG : Type ?u.64875\nH : Type ?u.64878\nM : Type u_1\nN : Type u_3\nP : Type u_2\ninst✝² : MulOneClass M\ninst✝¹ : MulOneClass N\ninst✝ : CommMonoid P\nf : M →* P\ng : N →* P\nx : M\n⊢ ↑(comp (coprod f g) (inl M N)) x = ↑f x",... | [
644,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
643,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.prodCongrLeft_trans_prodComm | [
{
"state_after": "case H.mk\nα₁ : Type u_3\nβ₁ : Type u_2\nβ₂ : Type u_1\ne : α₁ → β₁ ≃ β₂\na : β₁\nb : α₁\n⊢ ↑((prodCongrLeft e).trans (prodComm β₂ α₁)) (a, b) = ↑((prodComm β₁ α₁).trans (prodCongrRight e)) (a, b)",
"state_before": "α₁ : Type u_3\nβ₁ : Type u_2\nβ₂ : Type u_1\ne : α₁ → β₁ ≃ β₂\n⊢ (prodCong... | [
746,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
743,
1
] |
Mathlib/Data/Set/Basic.lean | Set.Nontrivial.exists_lt | [] | [
2514,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2511,
1
] |
Mathlib/Data/Set/Intervals/Pi.lean | Set.image_update_Icc_right | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nα : ι → Type u_2\ninst✝¹ : DecidableEq ι\ninst✝ : (i : ι) → PartialOrder (α i)\nf : (i : ι) → α i\ni : ι\nb : α i\n⊢ update f i '' Icc (f i) b = Icc f (update f i b)",
"tactic": "simpa using image_update_Icc f i (f i) b"
}
] | [
180,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
179,
1
] |
Mathlib/Algebra/Star/Pointwise.lean | Set.iInter_star | [] | [
88,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | intervalIntegral.integral_eq_sub_of_hasDerivAt_of_le | [] | [
1202,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1198,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.tendsto_iInf' | [] | [
3012,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3010,
1
] |
Mathlib/Topology/FiberBundle/Trivialization.lean | Trivialization.preimageHomeomorph_symm_apply | [] | [
474,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
472,
1
] |
Mathlib/Order/Interval.lean | NonemptyInterval.dual_top | [] | [
231,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/Analysis/InnerProductSpace/PiL2.lean | OrthonormalBasis.coe_mk | [
{
"state_after": "no goals",
"state_before": "ι : Type u_3\nι' : Type ?u.1163327\n𝕜 : Type u_1\ninst✝⁹ : IsROrC 𝕜\nE : Type u_2\ninst✝⁸ : NormedAddCommGroup E\ninst✝⁷ : InnerProductSpace 𝕜 E\nE' : Type ?u.1163356\ninst✝⁶ : NormedAddCommGroup E'\ninst✝⁵ : InnerProductSpace 𝕜 E'\nF : Type ?u.1163374\ninst... | [
537,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
535,
11
] |
Mathlib/RingTheory/Multiplicity.lean | multiplicity.finite_nat_iff | [
{
"state_after": "α : Type ?u.1244493\ninst✝¹ : Monoid α\ninst✝ : DecidableRel fun x x_1 => x ∣ x_1\na b : ℕ\n⊢ (∀ (n : ℕ), a ^ n ∣ b) ↔ a = 1 ∨ b = 0",
"state_before": "α : Type ?u.1244493\ninst✝¹ : Monoid α\ninst✝ : DecidableRel fun x x_1 => x ∣ x_1\na b : ℕ\n⊢ Finite a b ↔ a ≠ 1 ∧ 0 < b",
"tactic": "... | [
298,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
283,
1
] |
Mathlib/Analysis/Convex/Hull.lean | convexHull_convexHull_union_left | [] | [
144,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Mathlib/Data/Finset/Functor.lean | Finset.id_traverse | [
{
"state_after": "α β γ : Type u\nF G : Type u → Type u\ninst✝⁴ : Applicative F\ninst✝³ : Applicative G\ninst✝² : CommApplicative F\ninst✝¹ : CommApplicative G\ninst✝ : DecidableEq α\ns : Finset α\n⊢ Multiset.toFinset <$> s.val = s",
"state_before": "α β γ : Type u\nF G : Type u → Type u\ninst✝⁴ : Applicati... | [
205,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/Analysis/NormedSpace/BoundedLinearMaps.lean | IsBoundedBilinearMap.continuous_left | [] | [
417,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
415,
1
] |
Mathlib/Probability/Kernel/Basic.lean | ProbabilityTheory.kernel.IsMarkovKernel.comapRight | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nι : Type ?u.1453265\nmα : MeasurableSpace α\nmβ : MeasurableSpace β\nκ✝ : { x // x ∈ kernel α β }\nγ : Type u_3\nmγ : MeasurableSpace γ\nf : γ → β\nκ : { x // x ∈ kernel α β }\nhf : MeasurableEmbedding f\nhκ : ∀ (a : α), ↑↑(↑κ a) (Set.range f) = 1\na : α\n⊢ ↑↑(↑(ker... | [
577,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
572,
1
] |
Mathlib/GroupTheory/GroupAction/Basic.lean | MulAction.disjoint_image_image_iff | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ninst✝¹ : Group α\ninst✝ : MulAction α β\nU V : Set β\nthis : Setoid β := orbitRel α β\n⊢ Disjoint (Quotient.mk' '' U) (Quotient.mk' '' V) ↔ ∀ (x : β), x ∈ U → ∀ (a : α), ¬a • x ∈ V",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝¹ : Group α\n... | [
325,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
312,
1
] |
Mathlib/Topology/Basic.lean | ClusterPt.neBot | [] | [
1084,
4
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1083,
1
] |
Mathlib/Data/Complex/Basic.lean | Complex.abs_re_div_abs_le_one | [
{
"state_after": "no goals",
"state_before": "z : ℂ\nhz : z = 0\n⊢ Abs.abs (z.re / ↑abs z) ≤ 1",
"tactic": "simp [hz, zero_le_one]"
},
{
"state_after": "no goals",
"state_before": "z : ℂ\nhz : ¬z = 0\n⊢ Abs.abs (z.re / ↑abs z) ≤ 1",
"tactic": "simp_rw [_root_.abs_div, abs_abs,\ndiv_le_if... | [
1097,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1094,
1
] |
Mathlib/RingTheory/MvPolynomial/Homogeneous.lean | MvPolynomial.IsHomogeneous.inj_right | [
{
"state_after": "case intro\nσ : Type u_1\nτ : Type ?u.155795\nR : Type u_2\nS : Type ?u.155801\ninst✝ : CommSemiring R\nφ ψ : MvPolynomial σ R\nm n : ℕ\nhm : IsHomogeneous φ m\nhn : IsHomogeneous φ n\nhφ : φ ≠ 0\nd : σ →₀ ℕ\nhd : coeff d φ ≠ 0\n⊢ m = n",
"state_before": "σ : Type u_1\nτ : Type ?u.155795\n... | [
178,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
1
] |
Mathlib/Data/Matrix/Hadamard.lean | Matrix.smul_hadamard | [] | [
90,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Analysis/Seminorm.lean | absorbent_ball_zero | [
{
"state_after": "R : Type ?u.1453031\nR' : Type ?u.1453034\n𝕜 : Type u_1\n𝕜₂ : Type ?u.1453040\n𝕜₃ : Type ?u.1453043\n𝕝 : Type ?u.1453046\nE : Type u_2\nE₂ : Type ?u.1453052\nE₃ : Type ?u.1453055\nF : Type ?u.1453058\nG : Type ?u.1453061\nι : Type ?u.1453064\ninst✝² : NormedField 𝕜\ninst✝¹ : SeminormedAdd... | [
1215,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1213,
1
] |
Mathlib/Combinatorics/Additive/Behrend.lean | Behrend.exists_large_sphere | [
{
"state_after": "case intro.intro\nα : Type ?u.568071\nβ : Type ?u.568074\nn✝ d✝ k✝ N : ℕ\nx : Fin n✝ → ℕ\nn d k : ℕ\nhk : ↑(d ^ n) / (↑(n * (d - 1) ^ 2) + 1) ≤ ↑(card (sphere n d k))\n⊢ ∃ k, ↑d ^ ↑n / ↑(n * d ^ 2) ≤ ↑(card (sphere n d k))",
"state_before": "α : Type ?u.568071\nβ : Type ?u.568074\nn✝ d✝ k ... | [
271,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Mathlib/Data/Real/ENatENNReal.lean | ENat.map_coe_nnreal | [] | [
37,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
36,
1
] |
Mathlib/Data/Set/Basic.lean | Set.disjoint_left | [] | [
1530,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1529,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.IsPrime.multiset_prod_map_le | [
{
"state_after": "R : Type u\nι : Type u_1\ninst✝ : CommSemiring R\nI J K L : Ideal R\ns : Multiset ι\nf : ι → Ideal R\nP : Ideal R\nhp : IsPrime P\nhne : s ≠ 0\n⊢ (∃ I, I ∈ Multiset.map f s ∧ I ≤ P) ↔ ∃ i, i ∈ s ∧ f i ≤ P",
"state_before": "R : Type u\nι : Type u_1\ninst✝ : CommSemiring R\nI J K L : Ideal ... | [
1061,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1058,
1
] |
Mathlib/Data/Nat/Choose/Basic.lean | Nat.factorial_dvd_ascFactorial | [] | [
248,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
247,
1
] |
Mathlib/LinearAlgebra/Matrix/NonsingularInverse.lean | Matrix.isUnit_det_of_left_inverse | [] | [
223,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
222,
1
] |
Mathlib/Data/Finsupp/Multiset.lean | Finsupp.toMultiset_map | [
{
"state_after": "case refine'_1\nα : Type u_1\nβ : Type u_2\nι : Type ?u.27283\nf : α →₀ ℕ\ng : α → β\n⊢ Multiset.map g (↑toMultiset 0) = ↑toMultiset (mapDomain g 0)\n\ncase refine'_2\nα : Type u_1\nβ : Type u_2\nι : Type ?u.27283\nf : α →₀ ℕ\ng : α → β\n⊢ ∀ (a : α) (b : ℕ) (f : α →₀ ℕ),\n ¬a ∈ f.support →\... | [
96,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
1
] |
Mathlib/Computability/Ackermann.lean | ack_add_one_sq_lt_ack_add_three | [
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ (ack 0 n + 1) ^ 2 ≤ ack (0 + 3) n",
"tactic": "simpa using sq_le_two_pow_add_one_minus_three (n + 2)"
},
{
"state_after": "m : ℕ\n⊢ (ack m 1 + 1) ^ 2 ≤ ack (m + 3) 1",
"state_before": "m : ℕ\n⊢ (ack (m + 1) 0 + 1) ^ 2 ≤ ack (m + 1 + 3) 0... | [
287,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
Mathlib/CategoryTheory/Limits/HasLimits.lean | CategoryTheory.Limits.HasColimit.isoOfEquivalence_hom_π | [
{
"state_after": "no goals",
"state_before": "J : Type u₁\ninst✝⁴ : Category J\nK : Type u₂\ninst✝³ : Category K\nC : Type u\ninst✝² : Category C\nF✝ F : J ⥤ C\ninst✝¹ : HasColimit F\nG : K ⥤ C\ninst✝ : HasColimit G\ne : J ≌ K\nw : e.functor ⋙ G ≅ F\nj : J\n⊢ colimit.ι F j ≫ (isoOfEquivalence e w).hom =\n ... | [
952,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
948,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Submodule.comap_strictMono_of_surjective | [] | [
934,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
933,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.neg_smul | [
{
"state_after": "F : Type ?u.951428\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.951437\ninst✝⁴ : Ring α\ninst✝³ : AddCommGroup β\ninst✝² : Module α β\ninst✝¹ : DecidableEq β\ns : Finset α\nt : Finset β\na : α\ninst✝ : DecidableEq α\n⊢ image (fun x => -x) s • t = image (fun x => -x) (s • t)",
"state_before": "... | [
2169,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2167,
11
] |
Mathlib/Order/Compare.lean | Ordering.Compares.ne_lt | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.6902\ninst✝ : Preorder α\na b : α\nh✝ : Compares eq a b\nx✝ : b ≤ a\nh : eq = lt\n⊢ False",
"tactic": "injection h"
},
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.6902\ninst✝ : Preorder α\na b... | [
94,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.ncard_eq_toFinset_card | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.2365\ns✝ t : Set α\na b x y : α\nf : α → β\ns : Set α\nhs : autoParam (Set.Finite s) _auto✝\n⊢ ncard s = Finset.card (Finite.toFinset hs)",
"tactic": "rw [ncard_def, @Nat.card_eq_fintype_card _ hs.fintype, @Finite.card_toFinset _ _ ... | [
71,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/Algebra/AddTorsor.lean | vsub_vadd_comm | [
{
"state_after": "G : Type u_2\nP : Type u_1\ninst✝¹ : AddCommGroup G\ninst✝ : AddTorsor G P\np1 p2 p3 : P\n⊢ p1 -ᵥ p2 + (p3 -ᵥ p1 - (p3 -ᵥ p2)) = 0",
"state_before": "G : Type u_2\nP : Type u_1\ninst✝¹ : AddCommGroup G\ninst✝ : AddTorsor G P\np1 p2 p3 : P\n⊢ p1 -ᵥ p2 +ᵥ p3 = p3 -ᵥ p2 +ᵥ p1",
"tactic": ... | [
268,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
266,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | div_le_div_of_nonpos_of_le | [
{
"state_after": "ι : Type ?u.152300\nα : Type u_1\nβ : Type ?u.152306\ninst✝ : LinearOrderedField α\na b c d : α\nn : ℤ\nhc : c ≤ 0\nh : b ≤ a\n⊢ a * (1 / c) ≤ b * (1 / c)",
"state_before": "ι : Type ?u.152300\nα : Type u_1\nβ : Type ?u.152306\ninst✝ : LinearOrderedField α\na b c d : α\nn : ℤ\nhc : c ≤ 0\n... | [
788,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
786,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.finsupp_support_eq_support | [] | [
527,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
526,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.foldl_swap | [] | [
1427,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1425,
1
] |
Mathlib/Analysis/InnerProductSpace/Projection.lean | norm_eq_iInf_iff_real_inner_eq_zero | [
{
"state_after": "𝕜 : Type ?u.254322\nE : Type ?u.254325\nF : Type u_1\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedAddCommGroup F\ninst✝¹ : InnerProductSpace 𝕜 E\ninst✝ : InnerProductSpace ℝ F\nK✝ : Submodule 𝕜 E\nK : Submodule ℝ F\nu v : F\nhv : v ∈ K\nh : ‖u - v‖ = ⨅ (w : ↑↑K), ‖u - ... | [
346,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
311,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | div_neg_of_pos_of_neg | [] | [
709,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
708,
1
] |
Mathlib/Data/Polynomial/Coeff.lean | Polynomial.support_binomial | [
{
"state_after": "R : Type u\nS : Type v\na b : R\nn m✝ : ℕ\ninst✝ : Semiring R\np q r : R[X]\nk m : ℕ\nhkm : k ≠ m\nx y : R\nhx : x ≠ 0\nhy : y ≠ 0\n⊢ {k, m} ⊆ support (↑C x * X ^ k + ↑C y * X ^ m)",
"state_before": "R : Type u\nS : Type v\na b : R\nn m✝ : ℕ\ninst✝ : Semiring R\np q r : R[X]\nk m : ℕ\nhkm ... | [
202,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.dual_balanceL | [
{
"state_after": "α : Type u_1\nl : Ordnode α\nx : α\nr : Ordnode α\n⊢ dual\n (Ordnode.casesOn (motive := fun t => id r = t → Ordnode α) (id r)\n (fun h =>\n (_ : nil = id r) ▸\n Ordnode.casesOn (motive := fun t => id l = t → Ordnode α) (id l)\n (fun h => (_ : nil = ... | [
366,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
353,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.tsum_le_tsum_comp_of_surjective | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.275475\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nx y z ε ε₁ ε₂ : ℝ≥0∞\ns : Set ℝ≥0∞\nf✝ g✝ : α → ℝ≥0∞\nf : α → β\nhf : Surjective f\ng : β → ℝ≥0∞\n⊢ (∑' (y : β), g y) = ∑' (y : β), g (f (surjInv hf y))",
"tactic": "simp only [surj... | [
992,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
989,
1
] |
Mathlib/SetTheory/Ordinal/Exponential.lean | Ordinal.opow_le_opow_left | [
{
"state_after": "case pos\na b c : Ordinal\nab : a ≤ b\na0 : a = 0\n⊢ a ^ c ≤ b ^ c\n\ncase neg\na b c : Ordinal\nab : a ≤ b\na0 : ¬a = 0\n⊢ a ^ c ≤ b ^ c",
"state_before": "a b c : Ordinal\nab : a ≤ b\n⊢ a ^ c ≤ b ^ c",
"tactic": "by_cases a0 : a = 0"
},
{
"state_after": "case pos\nb c : Ordin... | [
162,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.hasBasis_iInf_of_directed | [
{
"state_after": "α : Type u_3\nβ : Type ?u.35963\nγ : Type ?u.35966\nι✝ : Sort ?u.35969\nι'✝ : Sort ?u.35972\nl✝ l' : Filter α\np✝ : ι✝ → Prop\ns✝ : ι✝ → Set α\nt✝ : Set α\ni : ι✝\np' : ι'✝ → Prop\ns' : ι'✝ → Set α\ni' : ι'✝\nι : Type u_1\nι' : Type u_2\ninst✝ : Nonempty ι\nl : ι → Filter α\ns : ι → ι' → Set α... | [
544,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
538,
1
] |
Mathlib/Data/Set/Pointwise/Interval.lean | Set.image_neg_Ico | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : OrderedAddCommGroup α\na b c : α\n⊢ Neg.neg '' Ico a b = Ioc (-b) (-a)",
"tactic": "simp"
}
] | [
306,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
306,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Ordered.lean | lineMap_le_right_iff_le | [
{
"state_after": "no goals",
"state_before": "k : Type u_1\nE : Type u_2\nPE : Type ?u.106644\ninst✝³ : LinearOrderedField k\ninst✝² : OrderedAddCommGroup E\ninst✝¹ : Module k E\ninst✝ : OrderedSMul k E\na b : E\nr r' : k\nh : r < 1\n⊢ ↑(lineMap a b) r ≤ b ↔ ↑(lineMap a b) r ≤ ↑(lineMap a b) 1",
"tactic... | [
155,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/AlgebraicTopology/SimplicialObject.lean | CategoryTheory.CosimplicialObject.δ_naturality | [] | [
583,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
581,
1
] |
Mathlib/Topology/Separation.lean | eq_of_tendsto_nhds | [] | [
741,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
736,
1
] |
Mathlib/CategoryTheory/Functor/Flat.lean | CategoryTheory.PreservesFiniteLimitsOfFlat.fac | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝⁴ : Category C\nD : Type u₂\ninst✝³ : Category D\nJ : Type v₁\ninst✝² : SmallCategory J\ninst✝¹ : FinCategory J\nK : J ⥤ C\nF : C ⥤ D\ninst✝ : RepresentablyFlat F\nc : Cone K\nhc : IsLimit c\ns : Cone (K ⋙ F)\nx : J\n⊢ lift F hc s ≫ (F.mapCone ... | [
226,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.Infinite.st_eq | [] | [
297,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/Data/Set/Image.lean | Set.preimage_eq_empty_iff | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.121829\nf : α → β\ns✝ t : Set α\ns : Set β\nh : ∀ (x : α), ¬f x ∈ s\n⊢ ∀ (x : β), x ∈ s → ∀ (x_1 : α), ¬f x_1 = x",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.121829\nf : α → β\ns✝ t : Set α\ns : Set β\nh : f ⁻¹' s = ∅\n⊢ Disjoint s (ra... | [
1628,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1621,
1
] |
Mathlib/Order/ModularLattice.lean | Disjoint.disjoint_sup_right_of_disjoint_sup_left | [
{
"state_after": "α : Type u_1\ninst✝² : Lattice α\ninst✝¹ : OrderBot α\ninst✝ : IsModularLattice α\na b c : α\nh : Disjoint a b\nhsup : Disjoint (a ⊔ b) c\n⊢ a ⊓ (c ⊔ b) ≤ a ⊓ b",
"state_before": "α : Type u_1\ninst✝² : Lattice α\ninst✝¹ : OrderBot α\ninst✝ : IsModularLattice α\na b c : α\nh : Disjoint a b... | [
400,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
394,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Filter.lean | BoxIntegral.IntegrationParams.toFilterDistortion_mono | [] | [
450,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
446,
1
] |
Mathlib/Data/Finsupp/NeLocus.lean | Finsupp.neLocus_zero_right | [
{
"state_after": "case a\nα : Type u_1\nM : Type ?u.6134\nN : Type u_2\nP : Type ?u.6140\ninst✝² : DecidableEq α\ninst✝¹ : DecidableEq N\ninst✝ : Zero N\nf g : α →₀ N\na✝ : α\n⊢ a✝ ∈ neLocus f 0 ↔ a✝ ∈ f.support",
"state_before": "α : Type u_1\nM : Type ?u.6134\nN : Type u_2\nP : Type ?u.6140\ninst✝² : Deci... | [
79,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | norm_fderivWithin_iteratedFDerivWithin | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\... | [
816,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
812,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snorm_const | [
{
"state_after": "case pos\nα : Type u_1\nE : Type ?u.1109806\nF : Type u_2\nG : Type ?u.1109812\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\nc : F\nh0 : p ≠ 0\nhμ : μ ≠ 0\nh_top : p = ⊤\n⊢ snorm (fun x =... | [
295,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
291,
1
] |
Mathlib/Order/JordanHolder.lean | CompositionSeries.ext_fun | [
{
"state_after": "case mk\nX : Type u\ninst✝¹ : Lattice X\ninst✝ : JordanHolderLattice X\ns₂ : CompositionSeries X\nlength✝ : ℕ\nseries✝ : Fin (length✝ + 1) → X\nstep'✝ : ∀ (i : Fin length✝), IsMaximal (series✝ (↑Fin.castSucc i)) (series✝ (Fin.succ i))\nhl : { length := length✝, series := series✝, step' := step... | [
215,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.comapDomain_add_of_injective | [] | [
770,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
767,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.exists_nonempty_inter_of_measure_univ_lt_tsum_measure | [
{
"state_after": "α : Type u_1\nβ : Type ?u.41179\nγ : Type ?u.41182\nδ : Type ?u.41185\nι : Type u_2\nR : Type ?u.41191\nR' : Type ?u.41194\nm✝ : MeasurableSpace α\nμ✝ μ₁ μ₂ : Measure α\ns✝ s₁ s₂ t : Set α\nm : MeasurableSpace α\nμ : Measure α\ns : ι → Set α\nhs : ∀ (i : ι), MeasurableSet (s i)\nH : ∀ (i j : ι... | [
410,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
403,
1
] |
Mathlib/Data/Option/Basic.lean | Option.pbind_eq_bind | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.4731\nδ : Type ?u.4734\np : α → Prop\nf✝ : (a : α) → p a → β\nx✝ : Option α\nf : α → Option β\nx : Option α\n⊢ (pbind x fun a x => f a) = Option.bind x f",
"tactic": "cases x <;> simp only [pbind, none_bind', some_bind... | [
145,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/Topology/Algebra/Order/LiminfLimsup.lean | isCobounded_ge_nhds | [] | [
59,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
58,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.moveRight_neg_symm | [
{
"state_after": "no goals",
"state_before": "x : PGame\ni : LeftMoves (-x)\n⊢ moveRight x (↑toLeftMovesNeg.symm i) = -moveLeft (-x) i",
"tactic": "simp"
}
] | [
1297,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1296,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Diagonal.lean | CategoryTheory.Limits.pullback_map_eq_pullbackFstFstIso_inv | [
{
"state_after": "no goals",
"state_before": "C : Type u_2\ninst✝² : Category C\nX✝ Y✝ Z : C\ninst✝¹ : HasPullbacks C\nX Y S X' Y' S' : C\nf : X ⟶ S\ng : Y ⟶ S\nf' : X' ⟶ S'\ng' : Y' ⟶ S'\ni₁ : X ⟶ X'\ni₂ : Y ⟶ Y'\ni₃ : S ⟶ S'\ne₁ : f ≫ i₃ = i₁ ≫ f'\ne₂ : g ≫ i₃ = i₂ ≫ g'\ninst✝ : Mono i₃\n⊢ map f g f' g' i... | [
433,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
428,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.map_nil | [] | [
1400,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1399,
1
] |
Mathlib/Analysis/SpecialFunctions/Sqrt.lean | Real.hasStrictDerivAt_sqrt | [] | [
64,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Algebra/QuaternionBasis.lean | QuaternionAlgebra.Basis.k_mul_k | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nA : Type u_1\nB : Type ?u.34759\ninst✝⁴ : CommRing R\ninst✝³ : Ring A\ninst✝² : Ring B\ninst✝¹ : Algebra R A\ninst✝ : Algebra R B\nc₁ c₂ : R\nq : Basis A c₁ c₂\n⊢ q.k * q.k = -((c₁ * c₂) • 1)",
"tactic": "rw [← i_mul_j, mul_assoc, ← mul_assoc q... | [
110,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.lintegral_mono' | [
{
"state_after": "α : Type u_1\nβ : Type ?u.70000\nγ : Type ?u.70003\nδ : Type ?u.70006\nm✝ : MeasurableSpace α\nμ✝ ν✝ : Measure α\nm : MeasurableSpace α\nμ ν : Measure α\nhμν : μ ≤ ν\nf g : α → ℝ≥0∞\nhfg : f ≤ g\n⊢ (⨆ (g : α →ₛ ℝ≥0∞) (_ : ↑g ≤ fun a => f a), SimpleFunc.lintegral g μ) ≤\n ⨆ (g_1 : α →ₛ ℝ≥0∞)... | [
131,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/Algebra/Lie/Submodule.lean | LieSubmodule.span_univ | [] | [
666,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
665,
1
] |
Mathlib/Logic/Basic.lean | fact_iff | [] | [
129,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/RingTheory/AlgebraicIndependent.lean | algebraicIndependent_empty_iff | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.509206\nι' : Type ?u.509209\nR : Type u_2\nK : Type ?u.509215\nA : Type u_1\nA' : Type ?u.509221\nA'' : Type ?u.509224\nV : Type u\nV' : Type ?u.509229\nx : ι → A\ninst✝⁶ : CommRing R\ninst✝⁵ : CommRing A\ninst✝⁴ : CommRing A'\ninst✝³ : CommRing A''\... | [
268,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
267,
1
] |
Mathlib/Algebra/Group/Basic.lean | eq_mul_of_inv_mul_eq | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.51956\nβ : Type ?u.51959\nG : Type u_1\ninst✝ : Group G\na b c d : G\nh : b⁻¹ * a = c\n⊢ a = b * c",
"tactic": "simp [h.symm, mul_inv_cancel_left]"
}
] | [
653,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
653,
1
] |
Mathlib/Analysis/Calculus/Deriv/Basic.lean | derivWithin_zero_of_not_differentiableWithinAt | [
{
"state_after": "𝕜 : Type u\ninst✝⁴ : NontriviallyNormedField 𝕜\nF : Type v\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nE : Type w\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace 𝕜 E\nf f₀ f₁ g : 𝕜 → F\nf' f₀' f₁' g' : F\nx : 𝕜\ns t : Set 𝕜\nL L₁ L₂ : Filter 𝕜\nh : ¬DifferentiableWith... | [
233,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
1
] |
Mathlib/Order/Directed.lean | isTop_iff_isMax | [] | [
295,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
294,
1
] |
Mathlib/CategoryTheory/StructuredArrow.lean | CategoryTheory.CostructuredArrow.ext | [] | [
368,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
367,
1
] |
Mathlib/Analysis/Calculus/DiffContOnCl.lean | DiffContOnCl.differentiableAt | [] | [
82,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
11
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean | Real.Angle.sign_two_zsmul_eq_sign_iff | [
{
"state_after": "no goals",
"state_before": "θ : Angle\n⊢ sign (2 • θ) = sign θ ↔ θ = ↑π ∨ abs (toReal θ) < π / 2",
"tactic": "rw [two_zsmul, ← two_nsmul, sign_two_nsmul_eq_sign_iff]"
}
] | [
1035,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1033,
1
] |
Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean | Real.volume_Icc | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.119068\ninst✝ : Fintype ι\na b : ℝ\n⊢ ↑↑volume (Icc a b) = ofReal (b - a)",
"tactic": "simp [volume_val]"
}
] | [
87,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Data/Nat/Interval.lean | Nat.Ico_insert_succ_left | [
{
"state_after": "no goals",
"state_before": "a b c : ℕ\nh : a < b\n⊢ insert a (Ico (succ a) b) = Ico a b",
"tactic": "rw [Ico_succ_left, ← Ioo_insert_left h]"
}
] | [
205,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Std/Data/Rat/Lemmas.lean | Rat.ofInt_ofNat | [] | [
160,
75
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
160,
9
] |
Mathlib/Analysis/Convex/Quasiconvex.lean | quasilinearOn_iff_mem_uIcc | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.12946\nβ : Type u_3\ninst✝⁴ : OrderedSemiring 𝕜\ninst✝³ : AddCommMonoid E\ninst✝² : AddCommMonoid F\ninst✝¹ : LinearOrderedAddCommMonoid β\ninst✝ : SMul 𝕜 E\ns : Set E\nf g : E → β\n⊢ (Convex 𝕜 s ∧\n (∀ ⦃x : E⦄,\n x ∈ s → ∀ ⦃y : E⦄, y ∈... | [
144,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.mul_sSup | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.155493\nβ : Type ?u.155496\nγ : Type ?u.155499\na✝ b c d : ℝ≥0∞\nr p q : ℝ≥0\nx y z ε ε₁ ε₂ : ℝ≥0∞\ns✝ s : Set ℝ≥0∞\na : ℝ≥0∞\n⊢ a * sSup s = ⨆ (i : ℝ≥0∞) (_ : i ∈ s), a * i",
"tactic": "simp only [sSup_eq_iSup, mul_iSup]"
}
] | [
652,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
651,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.one_le_iff_pos | [
{
"state_after": "no goals",
"state_before": "α β : Type u\nc : Cardinal\n⊢ 1 ≤ c ↔ 0 < c",
"tactic": "rw [← succ_zero, succ_le_iff]"
}
] | [
1399,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1398,
1
] |
Mathlib/Algebra/Lie/TensorProduct.lean | TensorProduct.LieModule.liftLie_apply | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝¹⁸ : CommRing R\nL : Type v\nM : Type w\nN : Type w₁\nP : Type w₂\nQ : Type w₃\ninst✝¹⁷ : LieRing L\ninst✝¹⁶ : LieAlgebra R L\ninst✝¹⁵ : AddCommGroup M\ninst✝¹⁴ : Module R M\ninst✝¹³ : LieRingModule L M\ninst✝¹² : LieModule R L M\ninst✝¹¹ : AddC... | [
133,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean | EuclideanGeometry.dist_eq_add_dist_of_angle_eq_pi | [
{
"state_after": "V : Type u_1\nP : Type u_2\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerProductSpace ℝ V\ninst✝¹ : MetricSpace P\ninst✝ : NormedAddTorsor V P\np1 p2 p3 : P\nh : ∠ p1 p2 p3 = π\n⊢ ‖p1 -ᵥ ?p3 - (p3 -ᵥ ?p3)‖ = ‖p1 -ᵥ p2‖ + ‖p3 -ᵥ p2‖\n\ncase p3\nV : Type u_1\nP : Type u_2\ninst✝³ : NormedAddComm... | [
224,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
221,
1
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | LinearIsometryEquiv.ofEq_symm | [] | [
1184,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1183,
1
] |
Mathlib/Analysis/NormedSpace/Banach.lean | ContinuousLinearEquiv.ofBijective_apply_symm_apply | [] | [
395,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
393,
1
] |
Mathlib/Data/List/Duplicate.lean | List.Mem.duplicate_cons_self | [] | [
43,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
42,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.degree_C_mul_X | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\na b c d : R\nn m : ℕ\ninst✝ : Semiring R\np q r : R[X]\nha : a ≠ 0\n⊢ degree (↑C a * X) = 1",
"tactic": "simpa only [pow_one] using degree_C_mul_X_pow 1 ha"
}
] | [
299,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
298,
1
] |
Mathlib/RingTheory/PowerBasis.lean | PowerBasis.leftMulMatrix | [
{
"state_after": "case inl\nR : Type ?u.145334\nS : Type u_2\nT : Type ?u.145340\ninst✝⁸ : CommRing R\ninst✝⁷ : Ring S\ninst✝⁶ : Algebra R S\nA : Type u_1\nB : Type ?u.145646\ninst✝⁵ : CommRing A\ninst✝⁴ : CommRing B\ninst✝³ : IsDomain B\ninst✝² : Algebra A B\nK : Type ?u.146068\ninst✝¹ : Field K\ninst✝ : Algeb... | [
242,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
11
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | Real.hasStrictDerivAt_sinh | [] | [
632,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
631,
1
] |
Mathlib/CategoryTheory/Pi/Basic.lean | CategoryTheory.Pi.isoApp_refl | [] | [
203,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
Std/Data/Int/DivMod.lean | Int.ediv_mul_cancel_of_emod_eq_zero | [
{
"state_after": "no goals",
"state_before": "a b : Int\nH : a % b = 0\n⊢ a / b * b = a",
"tactic": "rw [Int.mul_comm, mul_ediv_cancel_of_emod_eq_zero H]"
}
] | [
589,
55
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
588,
1
] |
src/lean/Init/Control/Lawful.lean | StateT.run_set | [] | [
259,
104
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
259,
9
] |
Mathlib/MeasureTheory/Integral/SetIntegral.lean | MeasureTheory.MeasurePreserving.set_integral_preimage_emb | [] | [
506,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
503,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.flatten_think | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nc : Computation (WSeq α)\n⊢ Seq.destruct (flatten (Computation.think c)) = some (none, flatten c)",
"tactic": "simp [flatten, think]"
}
] | [
682,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
681,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.floorRing_ceil_eq | [] | [
641,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
640,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.