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/MeasureTheory/Function/StronglyMeasurable/Basic.lean | MeasureTheory.AEFinStronglyMeasurable.measurableSet | [] | [
1942,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1940,
11
] |
Mathlib/Data/Set/Image.lean | Set.preimage_subtype_coe_eq_compl | [
{
"state_after": "case h.mk\nα✝ : Type ?u.12591\nβ : Type ?u.12594\nγ : Type ?u.12597\nι : Sort ?u.12600\nι' : Sort ?u.12603\nf : α✝ → β\ng : β → γ\nα : Type u_1\ns u v : Set α\nhsuv : s ⊆ u ∪ v\nH : s ∩ (u ∩ v) = ∅\nx : α\nx_in_s : x ∈ s\n⊢ { val := x, property := x_in_s } ∈ Subtype.val ⁻¹' u ↔ { val := x, pro... | [
188,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
181,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.tsum_toReal_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.333384\nγ : Type ?u.333387\nf : α → ℝ≥0∞\nhf : ∀ (a : α), f a ≠ ⊤\n⊢ ENNReal.toReal (∑' (a : α), f a) = ∑' (a : α), ENNReal.toReal (f a)",
"tactic": "simp only [ENNReal.toReal, tsum_toNNReal_eq hf, NNReal.coe_tsum]"
}
] | [
1249,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1247,
1
] |
Mathlib/Order/Closure.lean | LowerAdjoint.le_closure | [] | [
350,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
349,
1
] |
Mathlib/GroupTheory/Subsemigroup/Membership.lean | Subsemigroup.mem_iSup_of_mem | [
{
"state_after": "ι : Sort u_2\nM : Type u_1\nA : Type ?u.8697\nB : Type ?u.8700\ninst✝ : Mul M\nS : ι → Subsemigroup M\ni : ι\nthis : S i ≤ iSup S\n⊢ ∀ {x : M}, x ∈ S i → x ∈ iSup S",
"state_before": "ι : Sort u_2\nM : Type u_1\nA : Type ?u.8697\nB : Type ?u.8700\ninst✝ : Mul M\nS : ι → Subsemigroup M\ni :... | [
105,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | fderiv_const_apply | [] | [
1087,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1086,
1
] |
Mathlib/Data/Int/Order/Units.lean | Int.neg_one_pow_ne_zero | [
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ 0 < abs (-1)",
"tactic": "simp"
}
] | [
53,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
52,
1
] |
Mathlib/Algebra/Order/Floor.lean | round_nat_add | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.258505\nα : Type u_1\nβ : Type ?u.258511\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nx : α\ny : ℕ\n⊢ round (↑y + x) = ↑y + round x",
"tactic": "rw [add_comm, round_add_nat, add_comm]"
}
] | [
1397,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1396,
1
] |
Mathlib/Data/Polynomial/EraseLead.lean | Polynomial.eraseLead_zero | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nf : R[X]\n⊢ eraseLead 0 = 0",
"tactic": "simp only [eraseLead, erase_zero]"
}
] | [
62,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/Computability/Halting.lean | Nat.Partrec'.head | [] | [
318,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
317,
1
] |
Std/Data/Option/Lemmas.lean | Option.choice_eq | [
{
"state_after": "α : Type u_1\ninst✝ : Subsingleton α\na : α\n⊢ (if h : Nonempty α then some (Classical.choice h) else none) = some a",
"state_before": "α : Type u_1\ninst✝ : Subsingleton α\na : α\n⊢ choice α = some a",
"tactic": "simp [choice]"
},
{
"state_after": "α : Type u_1\ninst✝ : Subsin... | [
211,
32
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
208,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean | DifferentiableOn.rpow_const | [] | [
479,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
478,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | MultilinearMap.curryFinFinset_symm_apply_piecewise_const_aux | [
{
"state_after": "R : Type u\nι : Type u'\nn✝ : ℕ\nM : Fin (Nat.succ n✝) → Type v\nM₁ : ι → Type v₁\nM₂ : Type v₂\nM₃ : Type v₃\nM' : Type v'\ninst✝⁶ : CommSemiring R\ninst✝⁵ : (i : Fin (Nat.succ n✝)) → AddCommMonoid (M i)\ninst✝⁴ : AddCommMonoid M'\ninst✝³ : AddCommMonoid M₂\ninst✝² : (i : Fin (Nat.succ n✝)) →... | [
1583,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1574,
1
] |
Mathlib/CategoryTheory/Sites/Sieves.lean | CategoryTheory.Sieve.le_pullback_bind | [
{
"state_after": "C : 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\nS : Presieve X\nR : ⦃Y : C⦄ → ⦃f : Y ⟶ X⦄ → S f → Sieve Y\nf : Y ⟶ X\nh : S f\n⊢ pushforward f (R h) ≤ bind S R",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nD : Typ... | [
545,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
542,
1
] |
Mathlib/Data/Set/Image.lean | Set.subset_preimage_image | [] | [
485,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
484,
1
] |
Mathlib/LinearAlgebra/Contraction.lean | dualTensorHom_prodMap_zero | [
{
"state_after": "no goals",
"state_before": "ι : Type w\nR : Type u\nM : Type v₁\nN : Type v₂\nP : Type v₃\nQ : Type v₄\ninst✝¹⁰ : CommSemiring R\ninst✝⁹ : AddCommMonoid M\ninst✝⁸ : AddCommMonoid N\ninst✝⁷ : AddCommMonoid P\ninst✝⁶ : AddCommMonoid Q\ninst✝⁵ : Module R M\ninst✝⁴ : Module R N\ninst✝³ : Modul... | [
105,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.coe_insert | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.105476\nγ : Type ?u.105479\ninst✝ : DecidableEq α\ns✝ t u v : Finset α\na✝ b a : α\ns : Finset α\nx : α\n⊢ x ∈ ↑(insert a s) ↔ x ∈ insert a ↑s",
"tactic": "simp only [mem_coe, mem_insert, Set.mem_insert_iff]"
}
] | [
1087,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1086,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.spanExt_app_left | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nX Y Z X' Y' Z' : C\niX : X ≅ X'\niY : Y ≅ Y'\niZ : Z ≅ Z'\nf : X ⟶ Y\ng : X ⟶ Z\nf' : X' ⟶ Y'\ng' : X' ⟶ Z'\nwf : iX.hom ≫ f' = f ≫ iY.hom\nwg : iX.hom ≫ g' = g ≫ iZ.hom\n⊢ (spanExt iX iY iZ wf wg... | [
461,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
460,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Prod.lean | DifferentiableAt.snd | [] | [
284,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
11
] |
Mathlib/Analysis/NormedSpace/Pointwise.lean | closedBall_add_closedBall | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.1476288\nE : Type u_1\ninst✝⁴ : NormedField 𝕜\ninst✝³ : SeminormedAddCommGroup E\ninst✝² : NormedSpace 𝕜 E\ninst✝¹ : NormedSpace ℝ E\nx y z : E\nδ ε : ℝ\ninst✝ : ProperSpace E\nhε : 0 ≤ ε\nhδ : 0 ≤ δ\na b : E\n⊢ Metric.closedBall a ε + Metric.clos... | [
381,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean | Collinear.coplanar_insert | [
{
"state_after": "k : Type u_2\nV : Type u_3\nP : Type u_1\ninst✝³ : DivisionRing k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\ns : Set P\nh : Collinear k s\np : P\nthis : FiniteDimensional k { x // x ∈ vectorSpan k s }\n⊢ Coplanar k (insert p s)",
"state_before": "k : Type u_2\n... | [
732,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
728,
1
] |
Mathlib/LinearAlgebra/Matrix/Transvection.lean | Matrix.transvection_mul_transvection_same | [
{
"state_after": "no goals",
"state_before": "n : Type u_1\np : Type ?u.9953\nR : Type u₂\n𝕜 : Type ?u.9958\ninst✝⁴ : Field 𝕜\ninst✝³ : DecidableEq n\ninst✝² : DecidableEq p\ninst✝¹ : CommRing R\ni j : n\ninst✝ : Fintype n\nh : i ≠ j\nc d : R\n⊢ transvection i j c ⬝ transvection i j d = transvection i j (... | [
120,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/Topology/SubsetProperties.lean | exists_subset_nhds_of_compactSpace | [] | [
873,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
870,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | ContDiffOn.continuousOn_fderivWithin | [] | [
1200,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1198,
1
] |
Mathlib/NumberTheory/Zsqrtd/Basic.lean | Zsqrtd.nonneg_iff_zero_le | [
{
"state_after": "no goals",
"state_before": "d : ℕ\na : ℤ√↑d\n⊢ Nonneg a ↔ Nonneg (a - 0)",
"tactic": "simp"
}
] | [
735,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
734,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.all_balanceR | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nP : α → Prop\nl : Ordnode α\nx : α\nr : Ordnode α\nhl : Balanced l\nhr : Balanced r\nsl : Sized l\nsr : Sized r\nH : (∃ l', Raised (size l) l' ∧ BalancedSz l' (size r)) ∨ ∃ r', Raised r' (size r) ∧ BalancedSz (size l) r'\n⊢ All P (balanceR l x r) ↔... | [
885,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
880,
1
] |
Mathlib/Analysis/Convex/Basic.lean | Convex.neg | [] | [
508,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
507,
1
] |
Mathlib/Data/Polynomial/HasseDeriv.lean | Polynomial.factorial_smul_hasseDeriv | [
{
"state_after": "case zero\nR : Type u_1\ninst✝ : Semiring R\nk : ℕ\nf : R[X]\n⊢ ↑(Nat.zero ! • hasseDeriv Nat.zero) = ↑derivative^[Nat.zero]\n\ncase succ\nR : Type u_1\ninst✝ : Semiring R\nk✝ : ℕ\nf : R[X]\nk : ℕ\nih : ↑(k ! • hasseDeriv k) = ↑derivative^[k]\n⊢ ↑((succ k)! • hasseDeriv (succ k)) = ↑derivative... | [
166,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | Real.hasStrictDerivAt_cosh | [] | [
656,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
655,
1
] |
Mathlib/Order/Filter/Pointwise.lean | Filter.map₂_smul | [] | [
959,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
958,
1
] |
Mathlib/Algebra/GroupWithZero/Defs.lean | mul_ne_zero_comm | [] | [
273,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
1
] |
Mathlib/Algebra/Order/Ring/Defs.lean | mul_le_of_one_le_left | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type ?u.41158\ninst✝ : OrderedRing α\na b c d : α\nhb : b ≤ 0\nh : 1 ≤ a\n⊢ a * b ≤ b",
"tactic": "simpa only [one_mul] using mul_le_mul_of_nonpos_right h hb"
}
] | [
400,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
399,
1
] |
Mathlib/Combinatorics/Additive/Behrend.lean | Behrend.le_sqrt_log | [
{
"state_after": "case refine'_1\nα : Type ?u.651487\nβ : Type ?u.651490\nn d k N : ℕ\nx : Fin n → ℕ\nhN : 4096 ≤ N\nthis : ↑12 * log 2 ≤ log ↑N\n⊢ 0 < 2 / (1 - 2 / exp 1)\n\ncase refine'_2\nα : Type ?u.651487\nβ : Type ?u.651490\nn d k N : ℕ\nx : Fin n → ℕ\nhN : 4096 ≤ N\nthis : ↑12 * log 2 ≤ log ↑N\n⊢ log 8 *... | [
332,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
310,
1
] |
Mathlib/Order/Basic.lean | LE.le.ge | [] | [
252,
4
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
251,
11
] |
Mathlib/CategoryTheory/StructuredArrow.lean | CategoryTheory.StructuredArrow.eq_mk | [
{
"state_after": "case mk\nC : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nS S' S'' : D\nY Y' : C\nT : C ⥤ D\nleft✝ : Discrete PUnit\nright✝ : C\nhom✝ : (Functor.fromPUnit S).obj left✝ ⟶ T.obj right✝\n⊢ { left := left✝, right := right✝, hom := hom✝ } = mk { left := left✝, right := right✝, hom... | [
177,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
175,
1
] |
Mathlib/Topology/Constructions.lean | continuous_snd | [] | [
364,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
363,
1
] |
Mathlib/Analysis/Seminorm.lean | Seminorm.add_comp | [] | [
349,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
347,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.floor_intCast | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.126743\nα : Type u_1\nβ : Type ?u.126749\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz✝ : ℤ\na✝ : α\nz a : ℤ\n⊢ a ≤ ⌊↑z⌋ ↔ a ≤ z",
"tactic": "rw [le_floor, Int.cast_le]"
}
] | [
697,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
696,
1
] |
Mathlib/Analysis/Complex/Conformal.lean | IsConformalMap.is_complex_or_conj_linear | [
{
"state_after": "case intro.intro.intro\nf : ℂ → ℂ\nz : ℂ\nc : ℝ\nli : ℂ →ₗᵢ[ℝ] ℂ\n⊢ (∃ map, restrictScalars ℝ map = c • LinearIsometry.toContinuousLinearMap li) ∨\n ∃ map, restrictScalars ℝ map = ContinuousLinearMap.comp (c • LinearIsometry.toContinuousLinearMap li) ↑conjCle",
"state_before": "f : ℂ → ... | [
103,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
83,
1
] |
Mathlib/Algebra/Algebra/Operations.lean | Submodule.mul_mem_mul | [] | [
166,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
165,
1
] |
Mathlib/Data/List/AList.lean | AList.mem_replace | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : α → Type v\ninst✝ : DecidableEq α\na a' : α\nb : β a\ns : AList β\n⊢ a' ∈ replace a b s ↔ a' ∈ s",
"tactic": "rw [mem_keys, keys_replace, ← mem_keys]"
}
] | [
202,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/Topology/ShrinkingLemma.lean | ShrinkingLemma.PartialRefinement.subset | [] | [
85,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
11
] |
Mathlib/Topology/MetricSpace/Isometry.lean | IsometryEquiv.bijective | [] | [
338,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
337,
11
] |
Mathlib/Data/List/AList.lean | AList.keys_insert | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : α → Type v\ninst✝ : DecidableEq α\na : α\nb : β a\ns : AList β\n⊢ keys (insert a b s) = a :: List.erase (keys s) a",
"tactic": "simp [insert, keys, keys_kerase]"
}
] | [
295,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
294,
1
] |
Mathlib/Logic/Equiv/Set.lean | Equiv.set_forall_iff | [] | [
654,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
652,
11
] |
Mathlib/Algebra/Hom/Group.lean | MonoidHom.inv_apply | [] | [
1655,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1654,
1
] |
Mathlib/GroupTheory/Perm/Support.lean | Equiv.Perm.card_support_swap | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf g : Perm α\nx y : α\nhxy : x ≠ y\n⊢ Multiset.Nodup (x ::ₘ y ::ₘ 0)",
"tactic": "simp [hxy]"
},
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : ... | [
617,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
615,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.mem_generate_iff | [
{
"state_after": "case mp\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.51737\nι : Sort x\nf g : Filter α\ns✝ t : Set α\ns : Set (Set α)\nU : Set α\nh : U ∈ generate s\n⊢ ∃ t x, Set.Finite t ∧ ⋂₀ t ⊆ U\n\ncase mpr\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.51737\nι : Sort x\nf g : Filter α\ns✝ t : Set ... | [
377,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | LinearMap.toMatrixAlgEquiv_comp | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝⁹ : CommSemiring R\nl : Type ?u.2626461\nm : Type ?u.2626464\nn : Type u_3\ninst✝⁸ : Fintype n\ninst✝⁷ : Fintype m\ninst✝⁶ : DecidableEq n\nM₁ : Type u_2\nM₂ : Type ?u.2626488\ninst✝⁵ : AddCommMonoid M₁\ninst✝⁴ : AddCommMonoid M₂\ninst✝³ : Mod... | [
799,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
796,
1
] |
Mathlib/Data/Num/Lemmas.lean | ZNum.cast_bit0 | [
{
"state_after": "α : Type u_1\ninst✝ : AddGroupWithOne α\np : PosNum\n⊢ ↑(PosNum.bit0 p) = _root_.bit0 ↑p",
"state_before": "α : Type u_1\ninst✝ : AddGroupWithOne α\np : PosNum\n⊢ ↑(ZNum.bit0 (pos p)) = _root_.bit0 ↑(pos p)",
"tactic": "rw [ZNum.bit0, cast_pos, cast_pos]"
},
{
"state_after": "n... | [
1133,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1129,
1
] |
Mathlib/GroupTheory/Sylow.lean | Sylow.normalizer_sup_eq_top' | [
{
"state_after": "no goals",
"state_before": "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 G\nhP : ↑P ≤ N\n⊢ normalizer ↑P ⊔ N = ⊤",
"tactic": "rw [← Sylow.normalizer_sup_eq_top (P.subt... | [
484,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
481,
1
] |
Mathlib/FieldTheory/IsAlgClosed/Classification.lean | IsAlgClosed.ringEquivOfCardinalEqOfCharP | [
{
"state_after": "case a\nK L : Type\ninst✝⁶ : Field K\ninst✝⁵ : Field L\ninst✝⁴ : IsAlgClosed K\ninst✝³ : IsAlgClosed L\np : ℕ\ninst✝² : Fact (Nat.Prime p)\ninst✝¹ : CharP K p\ninst✝ : CharP L p\nhK : ℵ₀ < (#K)\nhKL : (#K) = (#L)\n⊢ Nonempty (K ≃+* L)",
"state_before": "K L : Type\ninst✝⁶ : Field K\ninst✝⁵... | [
210,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
9
] |
Mathlib/Data/Finset/Image.lean | Finset.map_cons | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.42059\nβ : Type ?u.42062\nγ : Type ?u.42065\nf✝ : α ↪ β\ns✝ : Finset α\nf : α ↪ β\na : α\ns : Finset α\nha : ¬a ∈ s\n⊢ ¬↑f a ∈ map f s",
"tactic": "simpa using ha"
}
] | [
236,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
234,
1
] |
Mathlib/Data/Dfinsupp/NeLocus.lean | Dfinsupp.neLocus_zero_right | [
{
"state_after": "case a\nα : Type u_1\nN : α → Type u_2\ninst✝² : DecidableEq α\ninst✝¹ : (a : α) → DecidableEq (N a)\ninst✝ : (a : α) → Zero (N a)\nf g : Π₀ (a : α), N a\na✝ : α\n⊢ a✝ ∈ neLocus f 0 ↔ a✝ ∈ support f",
"state_before": "α : Type u_1\nN : α → Type u_2\ninst✝² : DecidableEq α\ninst✝¹ : (a : α)... | [
77,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.length_dropUntil_le | [
{
"state_after": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\ninst✝ : DecidableEq V\nu v w : V\np : Walk G v w\nh : u ∈ support p\nthis : length (append (takeUntil p u h) (dropUntil p u h)) = length p\n⊢ length (dropUntil p u h) ≤ length p",
"state_b... | [
1178,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1174,
1
] |
Mathlib/Data/Nat/ModEq.lean | Nat.odd_mul_odd_div_two | [
{
"state_after": "no goals",
"state_before": "m✝ n✝ a b c d m n : ℕ\nhm1 : m % 2 = 1\nhn1 : n % 2 = 1\nh : m = 0\n⊢ False",
"tactic": "simp_all"
},
{
"state_after": "no goals",
"state_before": "m✝ n✝ a b c d m n : ℕ\nhm1 : m % 2 = 1\nhn1 : n % 2 = 1\nhm0 : 0 < m\nh : n = 0\n⊢ False",
"ta... | [
509,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
500,
1
] |
Mathlib/Data/List/Pairwise.lean | List.Pairwise.set_pairwise | [] | [
152,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Mathlib/Analysis/NormedSpace/Pointwise.lean | smul_closedUnitBall | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_2\nE : Type u_1\ninst✝² : NormedField 𝕜\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace 𝕜 E\nc : 𝕜\n⊢ c • closedBall 0 1 = closedBall 0 ‖c‖",
"tactic": "rw [smul_closedBall _ _ zero_le_one, smul_zero, mul_one]"
}
] | [
403,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
402,
1
] |
Mathlib/Topology/SubsetProperties.lean | IsCompact.inter_left | [] | [
123,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/Algebra/Group/Basic.lean | inv_unique | [] | [
171,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Std/Data/String/Lemmas.lean | Substring.ValidFor.prev | [
{
"state_after": "l m₁ : List Char\nc : Char\nm₂ r : List Char\n⊢ (if { byteIdx := utf8Len l } + { byteIdx := utf8Len m₁ + csize c } = { byteIdx := utf8Len l } then\n { byteIdx := utf8Len m₁ + csize c }\n else\n {\n byteIdx :=\n (String.prev { data := l ++ (m₁ ++ c :: (m₂ ++ r)) }\n... | [
850,
35
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
843,
1
] |
Mathlib/Algebra/Order/ToIntervalMod.lean | toIocDiv_eq_of_sub_zsmul_mem_Ioc | [] | [
72,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.mapRange_add | [
{
"state_after": "case h\nι : Type u\nγ : Type w\nβ : ι → Type v\nβ₁ : ι → Type v₁\nβ₂ : ι → Type v₂\ndec : DecidableEq ι\ninst✝² : (i : ι) → AddZeroClass (β i)\ninst✝¹ : (i : ι) → AddZeroClass (β₁ i)\ninst✝ : (i : ι) → AddZeroClass (β₂ i)\nf : (i : ι) → β₁ i → β₂ i\nhf : ∀ (i : ι), f i 0 = 0\nhf' : ∀ (i : ι) (... | [
2153,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2149,
1
] |
Mathlib/Algebra/Hom/Group.lean | MonoidWithZeroHom.cancel_right | [] | [
1184,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1181,
1
] |
Mathlib/Order/UpperLower/Basic.lean | LowerSet.Iic_inf | [] | [
1228,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1227,
1
] |
Mathlib/Order/OmegaCompletePartialOrder.lean | OmegaCompletePartialOrder.ContinuousHom.const_apply | [] | [
748,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
747,
1
] |
Mathlib/Order/ZornAtoms.lean | IsAtomic.of_isChain_bounded | [] | [
49,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | aEMeasurable_coe_nnreal_real_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.2694217\nγ : Type ?u.2694220\nγ₂ : Type ?u.2694223\nδ : Type ?u.2694226\nι : Sort y\ns t u : Set α\ninst✝ : MeasurableSpace α\nf : α → ℝ≥0\nμ : MeasureTheory.Measure α\nh : AEMeasurable fun x => ↑(f x)\n⊢ AEMeasurable f",
"tactic": ... | [
1811,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1809,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.sInf_add | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.853270\nβ : Type ?u.853273\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nι : Sort ?u.853290\nf g : ι → ℝ≥0∞\ns : Set ℝ≥0∞\n⊢ sInf s + a = ⨅ (b : ℝ≥0∞) (_ : b ∈ s), b + a",
"tactic": "simp [sInf_eq_iInf, iInf_add]"
}
] | [
2414,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2414,
1
] |
Mathlib/Data/Bool/Basic.lean | Bool.and_comm | [
{
"state_after": "no goals",
"state_before": "⊢ ∀ (a b : Bool), (a && b) = (b && a)",
"tactic": "decide"
}
] | [
165,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
165,
1
] |
Mathlib/Tactic/LinearCombination.lean | Mathlib.Tactic.LinearCombination.pf_mul_c | [] | [
44,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean | EuclideanGeometry.collinear_of_angle_eq_pi | [] | [
453,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
451,
1
] |
Mathlib/Topology/Instances/Matrix.lean | Continuous.matrix_reindex | [] | [
176,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
1
] |
Mathlib/Topology/Algebra/StarSubalgebra.lean | StarSubalgebra.topologicalClosure_coe | [] | [
83,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
81,
1
] |
Mathlib/Order/CompleteLattice.lean | iSup_range' | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nβ₂ : Type ?u.63820\nγ : Type ?u.63823\nι : Sort u_3\nι' : Sort ?u.63829\nκ : ι → Sort ?u.63834\nκ' : ι' → Sort ?u.63839\ninst✝ : SupSet α\nf✝ g✝ : ι → α\ng : β → α\nf : ι → β\n⊢ sSup (range (g ∘ f)) = sSup (range fun i => g (f i))",
"state_before": "α : Type u_1... | [
677,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
675,
1
] |
Mathlib/Algebra/ModEq.lean | AddCommGroup.modEq_neg | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : AddCommGroup α\np a a₁ a₂ b b₁ b₂ c : α\nn : ℕ\nz : ℤ\n⊢ b ≡ a [PMOD -p] ↔ a ≡ b [PMOD p]",
"tactic": "simp [ModEq, ← neg_eq_iff_eq_neg]"
}
] | [
92,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | derivWithin_cosh | [] | [
872,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
870,
1
] |
Mathlib/InformationTheory/Hamming.lean | Hamming.toHamming_smul | [] | [
395,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
393,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Split.lean | BoxIntegral.Prepartition.coe_eq_of_mem_split_of_lt_mem | [
{
"state_after": "ι : Type u_1\nM : Type ?u.38063\nn : ℕ\nI J : Box ι\ni : ι\nx : ℝ\ny : ι → ℝ\nh₁ : J ∈ split I i x\nh₂ : y ∈ J\nh₃ : x < y i\nH : ↑J = ↑I ∩ {y | y i ≤ x}\n⊢ False",
"state_before": "ι : Type u_1\nM : Type ?u.38063\nn : ℕ\nI J : Box ι\ni : ι\nx : ℝ\ny : ι → ℝ\nh₁ : J ∈ split I i x\nh₂ : y ∈... | [
225,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
221,
1
] |
Mathlib/LinearAlgebra/LinearPMap.lean | LinearPMap.le_graph_of_le | [
{
"state_after": "R : Type u_1\ninst✝⁹ : Ring R\nE : Type u_2\ninst✝⁸ : AddCommGroup E\ninst✝⁷ : Module R E\nF : Type u_3\ninst✝⁶ : AddCommGroup F\ninst✝⁵ : Module R F\nG : Type ?u.601958\ninst✝⁴ : AddCommGroup G\ninst✝³ : Module R G\nM : Type ?u.602474\ninst✝² : Monoid M\ninst✝¹ : DistribMulAction M F\ninst✝ :... | [
904,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
896,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.map_map | [
{
"state_after": "case a.h\nl : Type ?u.6588\nm : Type u_1\nn : Type u_2\no : Type ?u.6597\nm' : o → Type ?u.6602\nn' : o → Type ?u.6607\nR : Type ?u.6610\nS : Type ?u.6613\nα : Type v\nβ✝ : Type w\nγ✝ : Type ?u.6620\nM : Matrix m n α\nβ : Type u_3\nγ : Type u_4\nf : α → β\ng : β → γ\ni✝ : m\nx✝ : n\n⊢ map (map... | [
164,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean | UniformOnFun.uniformContinuous_restrict | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.63791\nι : Type ?u.63794\ns s' : Set α\nx : α\np : Filter ι\ng : ι → α\ninst✝ : UniformSpace β\n𝔖 : Set (Set α)\nh : s ∈ 𝔖\n⊢ map\n (fun x =>\n ((↑UniformFun.ofFun ∘ restrict s ∘ ↑(toFun 𝔖)) x.fst, (↑UniformFun.ofFun ∘ restrict s ∘ ↑(toFun... | [
703,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
699,
11
] |
Mathlib/Data/Nat/Factors.lean | Nat.dvd_of_mem_factors | [
{
"state_after": "case inl\np : ℕ\nh : p ∈ factors 0\n⊢ p ∣ 0\n\ncase inr\nn p : ℕ\nh : p ∈ factors n\nhn : n > 0\n⊢ p ∣ n",
"state_before": "n p : ℕ\nh : p ∈ factors n\n⊢ p ∣ n",
"tactic": "rcases n.eq_zero_or_pos with (rfl | hn)"
},
{
"state_after": "no goals",
"state_before": "case inl\np... | [
154,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Mathlib/Combinatorics/Quiver/Symmetric.lean | Quiver.Push.of_reverse | [] | [
246,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
244,
1
] |
Mathlib/Analysis/LocallyConvex/BalancedCoreHull.lean | balancedCoreAux_empty | [
{
"state_after": "𝕜 : Type u_2\nE : Type u_1\nι : Type ?u.37359\ninst✝² : NormedField 𝕜\ninst✝¹ : AddCommGroup E\ninst✝ : Module 𝕜 E\ns t : Set E\n⊢ ∀ (a : E), ∃ i h, ¬a ∈ ∅",
"state_before": "𝕜 : Type u_2\nE : Type u_1\nι : Type ?u.37359\ninst✝² : NormedField 𝕜\ninst✝¹ : AddCommGroup E\ninst✝ : Module... | [
168,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
166,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | uniformContinuous_sInf_dom₂ | [
{
"state_after": "α✝ : Type ua\nβ✝ : Type ub\nγ✝ : Type uc\nδ : Type ud\nι : Sort ?u.161591\ninst✝² : UniformSpace α✝\ninst✝¹ : UniformSpace β✝\ninst✝ : UniformSpace γ✝\nα : Type ?u.161619\nβ : Type ?u.161623\nγ : Type ?u.161632\nf : α → β → γ\nuas : Set (UniformSpace α)\nubs : Set (UniformSpace β)\nua : Unifor... | [
1688,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1678,
1
] |
Mathlib/RingTheory/Subsemiring/Basic.lean | Subsemiring.coe_sInf | [] | [
672,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
671,
1
] |
Mathlib/Algebra/Star/Basic.lean | star_mul' | [] | [
175,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
1
] |
Mathlib/MeasureTheory/Measure/VectorMeasure.lean | MeasureTheory.VectorMeasure.map_not_measurable | [] | [
583,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
582,
1
] |
Mathlib/Analysis/Complex/RemovableSingularity.lean | Complex.differentiableOn_compl_singleton_and_continuousAt_iff | [
{
"state_after": "E : Type u\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℂ E\ninst✝ : CompleteSpace E\nf : ℂ → E\ns : Set ℂ\nc : ℂ\nhs : s ∈ 𝓝 c\n⊢ DifferentiableOn ℂ f (s \\ {c}) ∧ ContinuousAt f c → DifferentiableOn ℂ f s",
"state_before": "E : Type u\ninst✝² : NormedAddCommGroup E\ninst✝¹ : Nor... | [
62,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
51,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Diagonal.lean | CategoryTheory.Limits.pullback.diagonal_comp | [
{
"state_after": "no goals",
"state_before": "C : Type u_2\ninst✝⁸ : Category C\nX Y Z : C\ninst✝⁷ : HasPullbacks C\nS T : C\nf✝ : X ⟶ T\ng✝ : Y ⟶ T\ni : T ⟶ S\ninst✝⁶ : HasPullback i i\ninst✝⁵ : HasPullback f✝ g✝\ninst✝⁴ : HasPullback (f✝ ≫ i) (g✝ ≫ i)\ninst✝³ :\n HasPullback (diagonal i)\n (map (f✝ ≫ ... | [
280,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Mathlib/GroupTheory/Complement.lean | Subgroup.IsComplement'.isCompl | [
{
"state_after": "G : Type u_1\ninst✝ : Group G\nH K : Subgroup G\nS T : Set G\nh : IsComplement' H K\ng : G\nx✝ : g ∈ ⊤\n⊢ g ∈ H ⊔ K",
"state_before": "G : Type u_1\ninst✝ : Group G\nH K : Subgroup G\nS T : Set G\nh : IsComplement' H K\n⊢ IsCompl H K",
"tactic": "refine'\n ⟨disjoint_iff_inf_le.mpr fun... | [
503,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
494,
1
] |
Mathlib/Analysis/NormedSpace/Multilinear.lean | continuousMultilinearCurryFin0_symm_apply | [] | [
1713,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1711,
1
] |
Mathlib/Data/Analysis/Topology.lean | Ctop.Realizer.nhds_F | [] | [
232,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
232,
1
] |
Mathlib/Data/Num/Lemmas.lean | Num.cast_to_int | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : AddGroupWithOne α\nn : Num\n⊢ ↑↑n = ↑n",
"tactic": "rw [← to_nat_to_int, Int.cast_ofNat, cast_to_nat]"
}
] | [
487,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
486,
1
] |
Mathlib/Algebra/Order/Ring/Lemmas.lean | mul_le_of_le_of_le_one_of_nonneg | [] | [
709,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
707,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Combination.lean | Finset.sum_smul_vsub_eq_weightedVSub_sub | [] | [
317,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
315,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.memℒp_const | [
{
"state_after": "α : Type u_1\nE : Type u_2\nF : Type ?u.1268931\nG : Type ?u.1268934\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedAddCommGroup F\ninst✝¹ : NormedAddCommGroup G\nc : E\ninst✝ : IsFiniteMeasure μ\n⊢ snorm (fun x => c) p μ < ⊤",
"s... | [
331,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
322,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Submodule.equivSubtypeMap_apply | [] | [
2442,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2440,
1
] |
Mathlib/Topology/Separation.lean | exists_open_singleton_of_finite | [] | [
321,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
318,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.