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/RingTheory/Subring/Basic.lean
Subring.subset_closure
[]
[ 903, 98 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 903, 1 ]
Mathlib/LinearAlgebra/FreeModule/Rank.lean
rank_finsupp'
[ { "state_after": "no goals", "state_before": "R : Type u\nM : Type v\nN : Type w\ninst✝⁷ : Ring R\ninst✝⁶ : StrongRankCondition R\ninst✝⁵ : AddCommGroup M\ninst✝⁴ : Module R M\ninst✝³ : Module.Free R M\ninst✝² : AddCommGroup N\ninst✝¹ : Module R N\ninst✝ : Module.Free R N\nι : Type v\n⊢ Module.rank R (ι →₀ ...
[ 49, 22 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 48, 1 ]
Mathlib/GroupTheory/QuotientGroup.lean
QuotientGroup.ker_mk'
[]
[ 130, 26 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 129, 1 ]
Mathlib/Data/Ordmap/Ordset.lean
Ordnode.Valid'.map_aux
[ { "state_after": "case nil\nα : Type u_2\ninst✝¹ : Preorder α\nβ : Type u_1\ninst✝ : Preorder β\nf : α → β\nf_strict_mono : StrictMono f\na₁ : WithBot α\na₂ : WithTop α\nh : Valid' a₁ nil a₂\n⊢ Valid' (Option.map f a₁) nil (Option.map f a₂)", "state_before": "case nil\nα : Type u_2\ninst✝¹ : Preorder α\nβ :...
[ 1592, 30 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 1564, 1 ]
Mathlib/Analysis/Calculus/BumpFunctionInner.lean
ContDiffBump.eventuallyEq_one_of_mem_ball
[]
[ 427, 81 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 426, 1 ]
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean
Real.strictMonoOn_sin
[]
[ 602, 50 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 601, 1 ]
Mathlib/Data/Set/Lattice.lean
Set.biInter_range
[]
[ 1688, 13 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 1687, 1 ]
Std/Data/List/Lemmas.lean
List.Sublist.append
[]
[ 399, 66 ]
e68aa8f5fe47aad78987df45f99094afbcb5e936
https://github.com/leanprover/std4
[ 398, 1 ]
Mathlib/MeasureTheory/Measure/MeasureSpace.lean
MeasureTheory.Measure.count_empty
[ { "state_after": "no goals", "state_before": "α : Type u_1\nβ : Type ?u.369064\nγ : Type ?u.369067\nδ : Type ?u.369070\nι : Type ?u.369073\nR : Type ?u.369076\nR' : Type ?u.369079\nm0 : MeasurableSpace α\ninst✝² : MeasurableSpace β\ninst✝¹ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set...
[ 2200, 99 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 2200, 1 ]
Mathlib/Control/Traversable/Equiv.lean
Equiv.traverse_eq_map_id
[ { "state_after": "t t' : Type u → Type u\neqv : (α : Type u) → t α ≃ t' α\ninst✝⁵ : Traversable t\ninst✝⁴ : IsLawfulTraversable t\nF G : Type u → Type u\ninst✝³ : Applicative F\ninst✝² : Applicative G\ninst✝¹ : LawfulApplicative F\ninst✝ : LawfulApplicative G\nη : ApplicativeTransformation F G\nα β γ : Type u\n...
[ 144, 63 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 142, 11 ]
Mathlib/Computability/EpsilonNFA.lean
NFA.toεNFA_evalFrom_match
[ { "state_after": "α : Type u\nσ σ' : Type v\nM✝ : εNFA α σ\nS : Set σ\nx : List α\ns : σ\na : α\nM : NFA α σ\nstart : Set σ\n⊢ List.foldl (εNFA.stepSet (toεNFA M)) start = List.foldl (stepSet M) start", "state_before": "α : Type u\nσ σ' : Type v\nM✝ : εNFA α σ\nS : Set σ\nx : List α\ns : σ\na : α\nM : NFA α...
[ 206, 6 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 196, 1 ]
Mathlib/Topology/Algebra/Order/MonotoneConvergence.lean
isGLB_of_tendsto_atTop
[]
[ 301, 62 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 298, 1 ]
Mathlib/Topology/MetricSpace/Basic.lean
Metric.Bounded.subset_ball
[]
[ 2345, 34 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 2344, 1 ]
Mathlib/GroupTheory/Subgroup/Basic.lean
SubgroupClass.subtype_comp_inclusion
[ { "state_after": "case h\nG : Type u_2\nG' : Type ?u.68703\ninst✝⁶ : Group G\ninst✝⁵ : Group G'\nA : Type ?u.68712\ninst✝⁴ : AddGroup A\nM : Type ?u.68718\nS : Type u_1\ninst✝³ : DivInvMonoid M\ninst✝² : SetLike S M\nhSM : SubgroupClass S M\nH✝ K✝ : S\ninst✝¹ : SetLike S G\ninst✝ : SubgroupClass S G\nH K : S\nh...
[ 355, 62 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 352, 1 ]
Mathlib/Topology/Connected.lean
IsPreconnected.union
[ { "state_after": "no goals", "state_before": "α : Type u\nβ : Type v\nι : Type ?u.3583\nπ : ι → Type ?u.3588\ninst✝ : TopologicalSpace α\ns✝ t✝ u v : Set α\nx : α\ns t : Set α\nH1 : x ∈ s\nH2 : x ∈ t\nH3 : IsPreconnected s\nH4 : IsPreconnected t\n⊢ ∀ (s_1 : Set α), s_1 ∈ {s, t} → x ∈ s_1", "tactic": "ri...
[ 145, 49 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 142, 1 ]
Mathlib/Control/Functor.lean
Functor.map_id
[ { "state_after": "no goals", "state_before": "F : Type u → Type v\nα β γ : Type u\ninst✝¹ : Functor F\ninst✝ : LawfulFunctor F\n⊢ (fun x x_1 => x <$> x_1) id = id", "tactic": "apply funext <;> apply id_map" } ]
[ 46, 93 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 46, 1 ]
Mathlib/MeasureTheory/Function/L1Space.lean
MeasureTheory.withDensitySMulLI_apply
[]
[ 980, 6 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 976, 1 ]
Mathlib/Order/UpperLower/Basic.lean
lowerClosure_empty
[]
[ 1397, 33 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 1396, 1 ]
Mathlib/Topology/Algebra/Order/LeftRightLim.lean
Monotone.leftLim_le_rightLim
[]
[ 148, 50 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 147, 1 ]
Mathlib/Algebra/GeomSum.lean
geom_sum_mul_add
[ { "state_after": "α : Type u\ninst✝ : Semiring α\nx : α\nn : ℕ\nthis : (∑ i in range n, (x + 1) ^ i * 1 ^ (n - 1 - i)) * x + 1 ^ n = (x + 1) ^ n\n⊢ (∑ i in range n, (x + 1) ^ i) * x + 1 = (x + 1) ^ n", "state_before": "α : Type u\ninst✝ : Semiring α\nx : α\nn : ℕ\n⊢ (∑ i in range n, (x + 1) ^ i) * x + 1 = (...
[ 169, 13 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 165, 1 ]
Mathlib/Topology/Algebra/Group/Basic.lean
TopologicalGroup.continuous_conj_prod
[]
[ 461, 58 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 459, 1 ]
Mathlib/Data/Bool/Basic.lean
Bool.eq_false_of_not_eq_true'
[ { "state_after": "no goals", "state_before": "a : Bool\n⊢ (!decide (a = true)) = true → a = false", "tactic": "cases a <;> decide" } ]
[ 244, 21 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 243, 1 ]
Mathlib/CategoryTheory/Sites/Sieves.lean
CategoryTheory.Sieve.sieveOfSubfunctor_functorInclusion
[ { "state_after": "case h\nC : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nF : C ⥤ D\nX Y Z : C\nf : Y ⟶ X\nS R : Sieve X\nY✝ : C\nf✝ : Y✝ ⟶ X\n⊢ (sieveOfSubfunctor (functorInclusion S)).arrows f✝ ↔ S.arrows f✝", "state_before": "C : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Categ...
[ 808, 25 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 801, 1 ]
Mathlib/Algebra/IndicatorFunction.lean
Set.indicator_const_smul_apply
[]
[ 506, 42 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 504, 1 ]
Mathlib/MeasureTheory/Measure/MeasureSpace.lean
MeasureTheory.isLocallyFiniteMeasure_of_isFiniteMeasureOnCompacts
[ { "state_after": "α : Type u_1\nβ : Type ?u.836440\nγ : Type ?u.836443\nδ : Type ?u.836446\nι : Type ?u.836449\nR : Type ?u.836452\nR' : Type ?u.836455\nm0 : MeasurableSpace α\ninst✝⁴ : MeasurableSpace β\ninst✝³ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set α\ninst✝² : TopologicalSpace α\...
[ 3991, 48 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 3986, 1 ]
src/lean/Init/SimpLemmas.lean
Bool.or_true
[ { "state_after": "no goals", "state_before": "b : Bool\n⊢ (b || true) = true", "tactic": "cases b <;> rfl" } ]
[ 103, 83 ]
d5348dfac847a56a4595fb6230fd0708dcb4e7e9
https://github.com/leanprover/lean4
[ 103, 9 ]
Mathlib/Order/Filter/Bases.lean
FilterBasis.mem_filter_iff
[]
[ 178, 10 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 177, 1 ]
Mathlib/Order/Hom/Bounded.lean
BoundedOrderHom.id_comp
[]
[ 687, 35 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 686, 1 ]
src/lean/Init/Data/Nat/SOM.lean
Nat.SOM.Mon.mul_denote
[ { "state_after": "no goals", "state_before": "ctx : Context\nm₁✝ m₂✝ : Mon\nfuel : Nat\nm₁ m₂ : Mon\n⊢ denote ctx (mul.go fuel m₁ m₂) = denote ctx m₁ * denote ctx m₂", "tactic": "induction fuel generalizing m₁ m₂ with\n| zero => simp! [append_denote]\n| succ _ ih =>\n simp!\n split <;> simp!\n next v...
[ 120, 105 ]
d5348dfac847a56a4595fb6230fd0708dcb4e7e9
https://github.com/leanprover/lean4
[ 109, 1 ]
Mathlib/FieldTheory/Adjoin.lean
IntermediateField.fG_of_fG_toSubalgebra
[ { "state_after": "case intro\nF : Type u_1\ninst✝² : Field F\nE : Type u_2\ninst✝¹ : Field E\ninst✝ : Algebra F E\nS : IntermediateField F E\nt : Finset E\nht : Algebra.adjoin F ↑t = S.toSubalgebra\n⊢ FG S", "state_before": "F : Type u_1\ninst✝² : Field F\nE : Type u_2\ninst✝¹ : Field E\ninst✝ : Algebra F E...
[ 938, 65 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 936, 1 ]
Mathlib/Order/Filter/Basic.lean
Filter.comap_map
[ { "state_after": "no goals", "state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.260169\nι : Sort x\nf✝ f₁ f₂ : Filter α\ng g₁ g₂ : Filter β\nm✝ : α → β\nm' : β → γ\ns✝ : Set α\nt : Set β\nf : Filter α\nm : α → β\nh : Injective m\ns : Set α\nhs : s ∈ f\n⊢ m ⁻¹' (m '' s) ⊆ s", "tactic": "sim...
[ 2302, 17 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 2297, 1 ]
Mathlib/Data/Set/Lattice.lean
Set.InjOn.image_biInter_eq
[ { "state_after": "α : Type u_1\nβ : Type u_3\nγ : Type ?u.188767\nι : Sort u_2\nι' : Sort ?u.188773\nι₂ : Sort ?u.188776\nκ : ι → Sort ?u.188781\nκ₁ : ι → Sort ?u.188786\nκ₂ : ι → Sort ?u.188791\nκ' : ι' → Sort ?u.188796\np : ι → Prop\ns : (i : ι) → p i → Set α\nhp : ∃ i, p i\nf : α → β\nh : InjOn f (⋃ (i : ι) ...
[ 1553, 45 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 1547, 1 ]
Mathlib/Analysis/Calculus/FDeriv/Mul.lean
HasFDerivWithinAt.mul'
[]
[ 300, 19 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 297, 1 ]
Mathlib/Order/Hom/Lattice.lean
LatticeHom.copy_eq
[]
[ 1074, 17 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 1073, 1 ]
Mathlib/Order/Filter/Pi.lean
Filter.coprodᵢ_eq_bot_iff
[ { "state_after": "no goals", "state_before": "ι : Type u_2\nα : ι → Type u_1\nf f₁ f₂ : (i : ι) → Filter (α i)\ns : (i : ι) → Set (α i)\ninst✝ : ∀ (i : ι), Nonempty (α i)\n⊢ Filter.coprodᵢ f = ⊥ ↔ f = ⊥", "tactic": "simpa [funext_iff] using coprodᵢ_neBot_iff.not" } ]
[ 230, 49 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 229, 1 ]
Mathlib/CategoryTheory/Abelian/Pseudoelements.lean
CategoryTheory.Abelian.Pseudoelement.eq_zero_iff
[ { "state_after": "no goals", "state_before": "C : Type u\ninst✝¹ : Category C\ninst✝ : Abelian C\nP Q : C\nf : P ⟶ Q\nh : f = 0\na : Pseudoelement P\n⊢ pseudoApply f a = 0", "tactic": "simp [h]" } ]
[ 300, 48 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 299, 1 ]
Mathlib/RingTheory/Subsemiring/Pointwise.lean
Subsemiring.smul_mem_pointwise_smul_iff₀
[]
[ 148, 42 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 146, 1 ]
Mathlib/RingTheory/Valuation/Basic.lean
AddValuation.map_zero
[]
[ 663, 23 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 662, 1 ]
Mathlib/Data/PFunctor/Multivariate/M.lean
MvPFunctor.M.dest_corec'
[]
[ 249, 6 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 246, 1 ]
Mathlib/Analysis/Analytic/Basic.lean
FormalMultilinearSeries.radius_eq_top_of_summable_norm
[]
[ 313, 82 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 311, 1 ]
Mathlib/Analysis/Convex/Quasiconvex.lean
MonotoneOn.quasiconvexOn
[]
[ 185, 18 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 184, 1 ]
Std/Data/List/Basic.lean
List.intercalate_eq_intercalateTR
[ { "state_after": "case h.h.h\nα : Type u_1\nsep : List α\nl : List (List α)\n⊢ intercalate sep l = intercalateTR sep l", "state_before": "⊢ @intercalate = @intercalateTR", "tactic": "funext α sep l" }, { "state_after": "case h.h.h\nα : Type u_1\nsep : List α\nl : List (List α)\n⊢ join (intersper...
[ 253, 27 ]
e68aa8f5fe47aad78987df45f99094afbcb5e936
https://github.com/leanprover/std4
[ 243, 10 ]
Mathlib/Order/SymmDiff.lean
Codisjoint.bihimp_eq_inf
[ { "state_after": "no goals", "state_before": "ι : Type ?u.44592\nα : Type u_1\nβ : Type ?u.44598\nπ : ι → Type ?u.44603\ninst✝ : GeneralizedHeytingAlgebra α\na✝ b✝ c d a b : α\nh : Codisjoint a b\n⊢ a ⇔ b = a ⊓ b", "tactic": "rw [bihimp, h.himp_eq_left, h.himp_eq_right]" } ]
[ 287, 47 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 286, 1 ]
Mathlib/GroupTheory/Submonoid/Operations.lean
Submonoid.map_iSup_comap_of_surjective
[]
[ 489, 29 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 488, 1 ]
Mathlib/Analysis/Normed/Group/Basic.lean
MonoidHomClass.isometry_iff_norm
[ { "state_after": "𝓕 : Type u_1\n𝕜 : Type ?u.280047\nα : Type ?u.280050\nι : Type ?u.280053\nκ : Type ?u.280056\nE : Type u_2\nF : Type u_3\nG : Type ?u.280065\ninst✝³ : SeminormedGroup E\ninst✝² : SeminormedGroup F\ninst✝¹ : SeminormedGroup G\ns : Set E\na a₁ a₂ b b₁ b₂ : E\nr r₁ r₂ : ℝ\ninst✝ : MonoidHomClas...
[ 868, 20 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 864, 1 ]
Mathlib/Algebra/Star/Subalgebra.lean
StarAlgHom.ext_adjoin
[ { "state_after": "case refine'_1\nF : Type u_2\nR : Type u_3\nA : Type u_1\nB : Type u_4\ninst✝⁹ : CommSemiring R\ninst✝⁸ : StarRing R\ninst✝⁷ : Semiring A\ninst✝⁶ : Algebra R A\ninst✝⁵ : StarRing A\ninst✝⁴ : StarModule R A\ninst✝³ : Semiring B\ninst✝² : Algebra R B\ninst✝¹ : StarRing B\nhF : StarAlgHomClass F ...
[ 767, 29 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 758, 1 ]
Mathlib/SetTheory/Ordinal/FixedPoint.lean
Ordinal.nfpFamily_eq_self
[ { "state_after": "no goals", "state_before": "ι : Type u\nf✝ : ι → Ordinal → Ordinal\nf : ι → Ordinal → Ordinal\na : Ordinal\nh : ∀ (i : ι), f i a = a\nl : List ι\n⊢ List.foldr f a l ≤ a", "tactic": "rw [List.foldr_fixed' h l]" } ]
[ 142, 82 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 140, 1 ]
Mathlib/Algebra/Ring/Units.lean
Units.add_divp
[ { "state_after": "no goals", "state_before": "α : Type u\nβ : Type v\nγ : Type w\nR : Type x\ninst✝ : Ring α\na✝ b✝ a b : α\nu : αˣ\n⊢ a + b /ₚ u = (a * ↑u + b) /ₚ u", "tactic": "simp only [divp, add_mul, Units.mul_inv_cancel_right]" } ]
[ 75, 56 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 74, 1 ]
Std/Data/String/Lemmas.lean
String.Iterator.ValidFor.setCurr
[]
[ 585, 53 ]
e68aa8f5fe47aad78987df45f99094afbcb5e936
https://github.com/leanprover/std4
[ 584, 1 ]
Mathlib/RingTheory/Ideal/Basic.lean
Ideal.mem_span_singleton_sup
[ { "state_after": "α : Type u\nβ : Type v\ninst✝¹ : Semiring α\nI✝ : Ideal α\na b : α\nS : Type u_1\ninst✝ : CommSemiring S\nx y : S\nI : Ideal S\n⊢ (∃ y_1, y_1 ∈ span {y} ∧ ∃ z, z ∈ I ∧ y_1 + z = x) ↔ ∃ a b, b ∈ I ∧ a * y + b = x", "state_before": "α : Type u\nβ : Type v\ninst✝¹ : Semiring α\nI✝ : Ideal α\n...
[ 227, 70 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 219, 1 ]
Mathlib/Data/Set/Intervals/Instances.lean
Set.Ico.coe_zero
[]
[ 193, 6 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 192, 1 ]
Mathlib/Analysis/BoxIntegral/Basic.lean
BoxIntegral.Integrable.dist_integralSum_sum_integral_le_of_memBaseSet
[]
[ 628, 74 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 625, 1 ]
Mathlib/Data/TypeVec.lean
TypeVec.appendFun_aux
[]
[ 298, 29 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 296, 1 ]
Mathlib/Data/Fintype/Card.lean
Infinite.of_surjective_from_set
[]
[ 997, 48 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 995, 1 ]
Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean
Asymptotics.superpolynomialDecay_iff_norm_tendsto_zero
[]
[ 323, 48 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 320, 1 ]
Mathlib/LinearAlgebra/Matrix/Basis.lean
basis_toMatrix_basisFun_mul
[ { "state_after": "no goals", "state_before": "ι : Type u_1\nι' : Type ?u.555917\nκ : Type ?u.555920\nκ' : Type ?u.555923\nR : Type u_2\nM : Type ?u.555929\ninst✝¹¹ : CommSemiring R\ninst✝¹⁰ : AddCommMonoid M\ninst✝⁹ : Module R M\nR₂ : Type ?u.556116\nM₂ : Type ?u.556119\ninst✝⁸ : CommRing R₂\ninst✝⁷ : AddCo...
[ 222, 53 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 216, 1 ]
Mathlib/Data/Seq/Computation.lean
Computation.get_think
[]
[ 479, 15 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 476, 1 ]
Mathlib/Order/LiminfLimsup.lean
Filter.isBoundedUnder_const
[]
[ 118, 64 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 117, 1 ]
Mathlib/Order/Heyting/Hom.lean
BiheytingHom.coe_copy
[]
[ 537, 6 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 536, 1 ]
Mathlib/Analysis/InnerProductSpace/PiL2.lean
EuclideanSpace.nnnorm_single
[]
[ 292, 51 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 290, 1 ]
Mathlib/Analysis/LocallyConvex/AbsConvex.lean
AbsConvexOpenSets.coe_isOpen
[]
[ 111, 10 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 110, 1 ]
Mathlib/Order/Disjoint.lean
disjoint_bot_left
[]
[ 61, 64 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 61, 1 ]
Mathlib/MeasureTheory/Function/SpecialFunctions/Basic.lean
Measurable.sqrt
[]
[ 173, 37 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 172, 1 ]
Mathlib/Data/Real/EReal.lean
EReal.mul_comm
[ { "state_after": "case h_real.h_real\nx y : ℝ\n⊢ ↑x * ↑y = ↑y * ↑x", "state_before": "x y : EReal\n⊢ x * y = y * x", "tactic": "induction' x using EReal.rec with x <;> induction' y using EReal.rec with y <;>\n try { rfl }" }, { "state_after": "no goals", "state_before": "case h_real.h_real\...
[ 224, 38 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 221, 11 ]
Mathlib/Combinatorics/SimpleGraph/Clique.lean
SimpleGraph.mem_cliqueSet_iff
[]
[ 249, 10 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 248, 1 ]
Mathlib/Algebra/DirectLimit.lean
Module.DirectLimit.toModule_totalize_of_le
[ { "state_after": "R : Type u\ninst✝⁶ : Ring R\nι : Type v\ndec_ι : DecidableEq ι\ninst✝⁵ : Preorder ι\nG : ι → Type w\ninst✝⁴ : (i : ι) → AddCommGroup (G i)\ninst✝³ : (i : ι) → Module R (G i)\nf : (i j : ι) → i ≤ j → G i →ₗ[R] G j\nP : Type u₁\ninst✝² : AddCommGroup P\ninst✝¹ : Module R P\ng : (i : ι) → G i →ₗ[...
[ 212, 95 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 203, 1 ]
Mathlib/LinearAlgebra/Matrix/Transvection.lean
Matrix.Pivot.listTransvecCol_mul_mul_listTransvecRow_last_col
[ { "state_after": "n : Type ?u.204767\np : Type ?u.204770\nR : Type u₂\n𝕜 : Type u_1\ninst✝³ : Field 𝕜\ninst✝² : DecidableEq n\ninst✝¹ : DecidableEq p\ninst✝ : CommRing R\nr : ℕ\nM : Matrix (Fin r ⊕ Unit) (Fin r ⊕ Unit) 𝕜\nhM : M (inr ()) (inr ()) ≠ 0\ni : Fin r\nthis : listTransvecRow M = listTransvecRow (Li...
[ 507, 48 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 500, 1 ]
Mathlib/Data/Set/Basic.lean
Set.ssubset_univ_iff
[]
[ 723, 20 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 722, 1 ]
Mathlib/RingTheory/PrincipalIdealDomain.lean
Submodule.IsPrincipal.mem_iff_eq_smul_generator
[ { "state_after": "no goals", "state_before": "R : Type u\nM : Type v\ninst✝³ : AddCommGroup M\ninst✝² : Ring R\ninst✝¹ : Module R M\nS : Submodule R M\ninst✝ : IsPrincipal S\nx : M\n⊢ x ∈ S ↔ ∃ s, x = s • generator S", "tactic": "simp_rw [@eq_comm _ x, ← mem_span_singleton, span_singleton_generator]" ...
[ 122, 73 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 120, 1 ]
Mathlib/ModelTheory/ElementaryMaps.lean
FirstOrder.Language.ElementarySubstructure.isElementary
[]
[ 415, 18 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 414, 1 ]
Mathlib/Data/IsROrC/Basic.lean
IsROrC.continuous_re
[]
[ 900, 19 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 899, 1 ]
src/lean/Init/Core.lean
Subtype.eta
[ { "state_after": "case mk\na b c d : Prop\nα : Type u\np : α → Prop\nval✝ : α\nproperty✝ : p val✝\nh : p { val := val✝, property := property✝ }.val\n⊢ { val := { val := val✝, property := property✝ }.val, property := h } = { val := val✝, property := property✝ }", "state_before": "a✝ b c d : Prop\nα : Type u\...
[ 965, 12 ]
d5348dfac847a56a4595fb6230fd0708dcb4e7e9
https://github.com/leanprover/lean4
[ 963, 1 ]
Mathlib/Data/Part.lean
Part.le_total_of_le_of_le
[ { "state_after": "case inl\nα : Type u_1\nβ : Type ?u.12580\nγ : Type ?u.12583\nx y z : Part α\nhx : x ≤ z\nhy : y ≤ z\nh : x = none\n⊢ x ≤ y ∨ y ≤ x\n\ncase inr.intro\nα : Type u_1\nβ : Type ?u.12580\nγ : Type ?u.12583\nx y z : Part α\nhx : x ≤ z\nhy : y ≤ z\nb : α\nh₀ : x = some b\n⊢ x ≤ y ∨ y ≤ x", "stat...
[ 419, 11 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 409, 1 ]
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean
AffineSubspace.affineSpan_eq_top_iff_vectorSpan_eq_top_of_nonempty
[ { "state_after": "k : Type u_2\nV : Type u_3\nP : Type u_1\ninst✝² : Ring k\ninst✝¹ : AddCommGroup V\ninst✝ : Module k V\nS : AffineSpace V P\np₁ p₂ : P\ns : Set P\nhs : Set.Nonempty s\n⊢ vectorSpan k s = ⊤ → affineSpan k s = ⊤", "state_before": "k : Type u_2\nV : Type u_3\nP : Type u_1\ninst✝² : Ring k\nin...
[ 801, 35 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 793, 1 ]
Mathlib/Algebra/Group/Defs.lean
inv_eq_of_mul
[]
[ 1091, 43 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 1090, 9 ]
Mathlib/Algebra/Star/Pointwise.lean
Set.nonempty_star
[]
[ 54, 47 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 53, 1 ]
Mathlib/Algebra/Lie/DirectSum.lean
DirectSum.lie_module_bracket_apply
[]
[ 65, 25 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 64, 1 ]
Mathlib/Order/WithBot.lean
WithTop.toDual_symm_apply
[]
[ 663, 6 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 662, 1 ]
Mathlib/Data/Set/Enumerate.lean
Set.enumerate_eq_none_of_sel
[ { "state_after": "no goals", "state_before": "α : Type u_1\nsel : Set α → Option α\ns : Set α\nh : sel s = none\n⊢ enumerate sel s 0 = none", "tactic": "simp [h, enumerate]" }, { "state_after": "α : Type u_1\nsel : Set α → Option α\ns : Set α\nh : sel s = none\nn : ℕ\n⊢ (do\n let a ← none\n...
[ 45, 41 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 43, 1 ]
Mathlib/Data/Matrix/Basic.lean
AlgHom.mapMatrix_comp
[]
[ 1607, 6 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 1605, 1 ]
Mathlib/MeasureTheory/Function/AEEqFun.lean
MeasureTheory.AEEqFun.coeFn_inf
[]
[ 501, 22 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 500, 1 ]
Mathlib/Order/Heyting/Basic.lean
hnot_hnot_hnot
[]
[ 1092, 50 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 1091, 1 ]
Mathlib/Data/MvPolynomial/Rename.lean
MvPolynomial.rename_rename
[ { "state_after": "σ : Type u_1\nτ : Type u_4\nα : Type u_3\nR : Type u_2\nS : Type ?u.149749\ninst✝¹ : CommSemiring R\ninst✝ : CommSemiring S\nf : σ → τ\ng : τ → α\np : MvPolynomial σ R\n⊢ ↑(eval₂Hom (algebraMap R (MvPolynomial α R)) (X ∘ g)) (eval₂ C (X ∘ f) p) =\n ↑(eval₂Hom (algebraMap R (MvPolynomial α R...
[ 93, 63 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 84, 1 ]
Std/Data/Nat/Lemmas.lean
Nat.pos_iff_ne_zero
[]
[ 39, 94 ]
e68aa8f5fe47aad78987df45f99094afbcb5e936
https://github.com/leanprover/std4
[ 39, 11 ]
Mathlib/Order/SuccPred/Limit.lean
Order.isSuccLimit_iff
[]
[ 226, 41 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 225, 1 ]
Mathlib/MeasureTheory/Measure/MeasureSpace.lean
MeasureTheory.mem_spanningSets_of_index_le
[]
[ 3522, 57 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 3520, 1 ]
Mathlib/Data/Int/Lemmas.lean
Int.strictMonoOn_natAbs
[]
[ 89, 42 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 88, 1 ]
Mathlib/Analysis/Calculus/FDeriv/Basic.lean
Asymptotics.IsBigO.hasFDerivWithinAt
[ { "state_after": "no goals", "state_before": "𝕜 : Type u_3\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_1\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type u_2\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type ?u.366356\ninst✝³ : NormedAddCommGroup G\ninst✝² : Normed...
[ 681, 79 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 676, 1 ]
Mathlib/Order/Bounded.lean
Set.unbounded_lt_univ
[]
[ 156, 49 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 155, 1 ]
src/lean/Init/Data/AC.lean
Lean.Data.AC.Context.evalList_insert
[ { "state_after": "no goals", "state_before": "α : Sort u_1\nctx : Context α\nh : IsCommutative ctx.op\nx : Nat\nxs : List Nat\n⊢ evalList α ctx (insert x xs) = evalList α ctx (x :: xs)", "tactic": "induction xs using List.two_step_induction with\n| empty => rfl\n| single =>\n simp [insert]\n split\n ...
[ 189, 107 ]
d5348dfac847a56a4595fb6230fd0708dcb4e7e9
https://github.com/leanprover/lean4
[ 170, 1 ]
Mathlib/Algebra/Ring/Prod.lean
RingHom.prodMap_def
[]
[ 258, 6 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 257, 1 ]
Mathlib/Data/Seq/WSeq.lean
Stream'.WSeq.liftRel_dropn_destruct
[ { "state_after": "α : Type u\nβ : Type v\nγ : Type w\nR : α → β → Prop\ns : WSeq α\nt : WSeq β\nH : LiftRel R s t\nn : ℕ\n⊢ Computation.LiftRel\n (fun x x_1 =>\n match x, x_1 with\n | none, none => True\n | some (a, s), some (b, t) => R a b ∧ LiftRel R s t\n | x, x_2 => False)\n (do\n ...
[ 1051, 91 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 1039, 1 ]
Mathlib/SetTheory/Game/PGame.lean
PGame.moveRight_mk
[]
[ 157, 6 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 156, 1 ]
Mathlib/ModelTheory/Substructures.lean
FirstOrder.Language.Substructure.map_injective_of_injective
[]
[ 576, 31 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 575, 1 ]
Mathlib/Topology/List.lean
Vector.continuous_insertNth'
[ { "state_after": "α : Type u_1\nβ : Type ?u.66987\ninst✝¹ : TopologicalSpace α\ninst✝ : TopologicalSpace β\nn : ℕ\ni : Fin (n + 1)\nx✝ : α × Vector α n\na : α\nl : Vector α n\n⊢ Tendsto (fun p => insertNth p.fst i p.snd) (𝓝 a ×ˢ 𝓝 l) (𝓝 (insertNth (a, l).fst i (a, l).snd))", "state_before": "α : Type u_1...
[ 210, 61 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 207, 1 ]
Mathlib/Data/Polynomial/IntegralNormalization.lean
Polynomial.integralNormalization_coeff_degree
[ { "state_after": "no goals", "state_before": "R : Type u\nS : Type v\na b : R\nm n : ℕ\nι : Type y\ninst✝ : Semiring R\nf : R[X]\ni : ℕ\nhi : degree f = ↑i\n⊢ coeff (integralNormalization f) i = 1", "tactic": "rw [integralNormalization_coeff, if_pos hi]" } ]
[ 66, 92 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 65, 1 ]
Mathlib/Data/Nat/Prime.lean
Nat.succ_dvd_or_succ_dvd_of_succ_sum_dvd_mul
[ { "state_after": "p : ℕ\np_prime : Prime p\nm n k l : ℕ\nhpm : p ^ k ∣ m\nhpn : p ^ l ∣ n\nhpmn : p ^ (k + l + 1) ∣ m * n\nhpd : p ^ (k + l) * p ∣ m * n\n⊢ p ^ (k + 1) ∣ m ∨ p ^ (l + 1) ∣ n", "state_before": "p : ℕ\np_prime : Prime p\nm n k l : ℕ\nhpm : p ^ k ∣ m\nhpn : p ^ l ∣ n\nhpmn : p ^ (k + l + 1) ∣ m...
[ 743, 64 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 730, 1 ]
Mathlib/Order/Bounds/Basic.lean
IsGreatest.bddAbove
[]
[ 340, 11 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 339, 1 ]
Mathlib/Algebra/Module/Basic.lean
smulAddHom_apply
[]
[ 201, 6 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 200, 1 ]
Mathlib/Topology/UniformSpace/CompactConvergence.lean
ContinuousMap.hasBasis_nhds_compactConvergence
[]
[ 190, 80 ]
5a919533f110b7d76410134a237ee374f24eaaad
https://github.com/leanprover-community/mathlib4
[ 186, 1 ]