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/Computability/PartrecCode.lean | Nat.Partrec.Code.fixed_point₂ | [
{
"state_after": "no goals",
"state_before": "f : Code → ℕ →. ℕ\nhf : Partrec₂ f\ncf : Code\nef : eval cf = fun n => Part.bind ↑(decode n) fun a => Part.map encode ((fun p => f p.fst p.snd) a)\nc : Code\ne : eval (curry cf (encode c)) = eval c\nn : ℕ\n⊢ eval c n = f c n",
"tactic": "simp [e.symm, ef, Pa... | [
1192,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1189,
1
] |
Mathlib/Order/Height.lean | Set.chainHeight_insert_of_forall_gt | [
{
"state_after": "α : Type u_1\nβ : Type ?u.34460\ns t : Set α\ninst✝ : Preorder α\na : α\nhx : ∀ (b : α), b ∈ s → a < b\n⊢ chainHeight (insert a s) + 0 = chainHeight s + 1",
"state_before": "α : Type u_1\nβ : Type ?u.34460\ns t : Set α\ninst✝ : Preorder α\na : α\nhx : ∀ (b : α), b ∈ s → a < b\n⊢ chainHeigh... | [
309,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
1
] |
Mathlib/Data/List/Nodup.lean | List.Nodup.pairwise_coe | [
{
"state_after": "case nil\nα : Type u\nβ : Type v\nl l₁ l₂ : List α\nr : α → α → Prop\na b : α\ninst✝ : IsSymm α r\nhl✝ : Nodup l\nhl : Nodup []\n⊢ Set.Pairwise {a | a ∈ []} r ↔ Pairwise r []\n\ncase cons\nα : Type u\nβ : Type v\nl✝ l₁ l₂ : List α\nr : α → α → Prop\na✝ b : α\ninst✝ : IsSymm α r\nhl✝ : Nodup l✝... | [
449,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
441,
1
] |
Mathlib/Logic/Function/Conjugate.lean | Function.Semiconj.inverses_right | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.1160\nf fab : α → β\nfbc : β → γ\nga ga' : α → α\ngb gb' : β → β\ngc gc' : γ → γ\nh : Semiconj f ga gb\nha : RightInverse ga' ga\nhb : LeftInverse gb' gb\nx : α\n⊢ f (ga' x) = gb' (f x)",
"tactic": "rw [← hb (f (ga' x)... | [
71,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/Data/Set/Lattice.lean | iSup_iUnion | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.304567\nι : Sort u_3\nι' : Sort ?u.304573\nι₂ : Sort ?u.304576\nκ : ι → Sort ?u.304581\nκ₁ : ι → Sort ?u.304586\nκ₂ : ι → Sort ?u.304591\nκ' : ι' → Sort ?u.304596\ninst✝ : CompleteLattice β\ns : ι → Set α\nf : α → β\n⊢ (⨆ (a : α) (_ : a ∈ ⋃ (i : ι), s i)... | [
2239,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2237,
1
] |
Mathlib/Data/Multiset/Nodup.lean | Multiset.nodup_singleton | [] | [
54,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Star.lean | HasFDerivAtFilter.star | [] | [
46,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Mathlib/Algebra/MonoidAlgebra/Basic.lean | AddMonoidAlgebra.mul_single_apply_of_not_exists_add | [] | [
1637,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1635,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean | AffineEquiv.coeFn_inj | [] | [
149,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/NumberTheory/LegendreSymbol/MulCharacter.lean | MulChar.map_nonunit | [] | [
165,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/Data/Fintype/Card.lean | Finite.of_injective | [
{
"state_after": "case intro\nα✝ : Type ?u.13191\nβ✝ : Type ?u.13194\nγ : Type ?u.13197\nα : Sort u_1\nβ : Sort u_2\ninst✝ : Finite β\nf : α → β\nH : Injective f\nval✝ : Fintype (PLift β)\n⊢ Finite α",
"state_before": "α✝ : Type ?u.13191\nβ✝ : Type ?u.13194\nγ : Type ?u.13197\nα : Sort u_1\nβ : Sort u_2\nin... | [
440,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
436,
1
] |
Mathlib/Algebra/BigOperators/Fin.lean | Fin.prod_Ioi_zero | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.63689\nβ : Type ?u.63692\nM : Type u_1\ninst✝ : CommMonoid M\nn : ℕ\nv : Fin (Nat.succ n) → M\n⊢ ∏ i in Ioi 0, v i = ∏ j : Fin n, v (succ j)",
"tactic": "rw [Ioi_zero_eq_map, Finset.prod_map, RelEmbedding.coe_toEmbedding, val_succEmbedding]"
}
... | [
177,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
175,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.cycleFactorsFinset_noncommProd | [] | [
1404,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1400,
1
] |
Mathlib/Order/SupIndep.lean | Finset.SupIndep.subset | [] | [
74,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | HasSum.tendsto_sum_nat | [] | [
289,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
287,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.sUnion_diff_singleton_empty | [] | [
1150,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1149,
1
] |
Mathlib/CategoryTheory/Preadditive/AdditiveFunctor.lean | CategoryTheory.AdditiveFunctor.ofExact_map | [] | [
325,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/Order/CompleteLattice.lean | Monotone.iSup_nat_add | [] | [
1638,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1637,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.ofLists_moveLeft' | [] | [
195,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/Computability/TuringMachine.lean | Turing.TM2.stmts_supportsStmt | [
{
"state_after": "K : Type u_1\ninst✝¹ : DecidableEq K\nΓ : K → Type u_2\nΛ : Type u_3\nσ : Type u_4\ninst✝ : Inhabited Λ\nM : Λ → Stmt₂\nS : Finset Λ\nq : Stmt₂\nss : Supports M S\n⊢ ∀ (x : Λ), x ∈ S → q ∈ stmts₁ (M x) → SupportsStmt S q",
"state_before": "K : Type u_1\ninst✝¹ : DecidableEq K\nΓ : K → Type... | [
2249,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2245,
1
] |
Mathlib/Data/Polynomial/FieldDivision.lean | Polynomial.degree_pos_of_ne_zero_of_nonunit | [
{
"state_after": "R : Type u\nS : Type v\nk : Type y\nA : Type z\na b : R\nn : ℕ\ninst✝ : DivisionRing R\np q : R[X]\nhp0 : ↑C (coeff p 0) ≠ 0\nhp : ¬IsUnit (↑C (coeff p 0))\nh : 0 ≥ degree p\n⊢ False",
"state_before": "R : Type u\nS : Type v\nk : Type y\nA : Type z\na b : R\nn : ℕ\ninst✝ : DivisionRing R\n... | [
124,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/Topology/Category/CompHaus/Basic.lean | CompHaus.isClosedMap | [] | [
116,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/SetTheory/Lists.lean | Lists'.subset_nil | [
{
"state_after": "α : Type u_1\nl : Lists' α true\n⊢ ofList (toList l) ⊆ nil → ofList (toList l) = nil",
"state_before": "α : Type u_1\nl : Lists' α true\n⊢ l ⊆ nil → l = nil",
"tactic": "rw [← of_toList l]"
},
{
"state_after": "case nil\nα : Type u_1\nl : Lists' α true\nh : ofList [] ⊆ nil\n⊢ o... | [
193,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/AlgebraicTopology/SplitSimplicialObject.lean | SimplicialObject.Splitting.IndexSet.eqId_iff_eq | [
{
"state_after": "case mp\nC : Type ?u.4324\ninst✝ : Category C\nΔ : SimplexCategoryᵒᵖ\nA : IndexSet Δ\n⊢ EqId A → A.fst = Δ\n\ncase mpr\nC : Type ?u.4324\ninst✝ : Category C\nΔ : SimplexCategoryᵒᵖ\nA : IndexSet Δ\n⊢ A.fst = Δ → EqId A",
"state_before": "C : Type ?u.4324\ninst✝ : Category C\nΔ : SimplexCate... | [
144,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Mathlib/CategoryTheory/Limits/Constructions/EpiMono.lean | CategoryTheory.reflects_epi_of_reflectsColimit | [
{
"state_after": "C : Type u₁\nD : Type u₂\ninst✝³ : Category C\ninst✝² : Category D\nF : C ⥤ D\nX Y : C\nf : X ⟶ Y\ninst✝¹ : ReflectsColimit (span f f) F\ninst✝ : Epi (F.map f)\nthis : IsColimit (PushoutCocone.mk (𝟙 (F.obj Y)) (𝟙 (F.obj Y)) (_ : F.map f ≫ 𝟙 (F.obj Y) = F.map f ≫ 𝟙 (F.obj Y)))\n⊢ Epi f",
... | [
81,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.DominatedFinMeasAdditive.smul | [
{
"state_after": "α : Type u_3\nE : Type ?u.107083\nF : Type ?u.107086\nF' : Type ?u.107089\nG : Type ?u.107092\n𝕜 : Type u_1\np : ℝ≥0∞\ninst✝⁹ : NormedAddCommGroup E\ninst✝⁸ : NormedSpace ℝ E\ninst✝⁷ : NormedAddCommGroup F\ninst✝⁶ : NormedSpace ℝ F\ninst✝⁵ : NormedAddCommGroup F'\ninst✝⁴ : NormedSpace ℝ F'\ni... | [
232,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
227,
1
] |
Mathlib/Computability/Encoding.lean | Computability.Encoding.encode_injective | [
{
"state_after": "α : Type u\ne : Encoding α\nx✝¹ x✝ : α\nh : encode e x✝¹ = encode e x✝\n⊢ some x✝¹ = some x✝",
"state_before": "α : Type u\ne : Encoding α\n⊢ Function.Injective e.encode",
"tactic": "refine' fun _ _ h => Option.some_injective _ _"
},
{
"state_after": "no goals",
"state_befo... | [
47,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
45,
1
] |
Mathlib/MeasureTheory/Measure/AEDisjoint.lean | MeasureTheory.AEDisjoint.eq | [] | [
54,
4
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
11
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Metric.infDist_empty | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.57575\nα : Type u\nβ : Type v\ninst✝¹ : PseudoMetricSpace α\ninst✝ : PseudoMetricSpace β\ns t u : Set α\nx y : α\nΦ : α → β\n⊢ infDist x ∅ = 0",
"tactic": "simp [infDist]"
}
] | [
485,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
485,
1
] |
Mathlib/Topology/Order/Basic.lean | Ico_mem_nhdsWithin_Iic | [] | [
574,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
573,
1
] |
Mathlib/RingTheory/UniqueFactorizationDomain.lean | Associates.dvd_of_mem_factors' | [
{
"state_after": "α : Type u_1\ninst✝¹ : CancelCommMonoidWithZero α\ndec_irr : (p : Associates α) → Decidable (Irreducible p)\ninst✝ : UniqueFactorizationMonoid α\ndec : DecidableEq α\ndec' : DecidableEq (Associates α)\na : α\np : Associates α\nhp : Irreducible p\nhz : a ≠ 0\nh_mem : { val := p, property := hp ... | [
1601,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1596,
1
] |
Mathlib/Algebra/Regular/Basic.lean | MulLECancellable.isLeftRegular | [] | [
81,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
11
] |
Mathlib/Probability/Kernel/Basic.lean | ProbabilityTheory.kernel.restrict_apply' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nι : Type ?u.1443714\nmα : MeasurableSpace α\nmβ : MeasurableSpace β\nκ✝ : { x // x ∈ kernel α β }\ns t : Set β\nκ : { x // x ∈ kernel α β }\nhs : MeasurableSet s\na : α\nht : MeasurableSet t\n⊢ ↑↑(↑(kernel.restrict κ hs) a) t = ↑↑(↑κ ... | [
500,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
498,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | InnerProductSpace.Core.inner_mul_symm_re_eq_norm | [
{
"state_after": "𝕜 : Type u_1\nE : Type ?u.606441\nF : Type u_2\ninst✝² : IsROrC 𝕜\ninst✝¹ : AddCommGroup F\ninst✝ : Module 𝕜 F\nc : Core 𝕜 F\nx y : F\n⊢ ↑re (inner y x * ↑(starRingEnd 𝕜) (inner y x)) = ‖inner y x * ↑(starRingEnd 𝕜) (inner y x)‖",
"state_before": "𝕜 : Type u_1\nE : Type ?u.606441\nF... | [
302,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
300,
1
] |
Mathlib/Topology/FiberBundle/Trivialization.lean | Trivialization.map_proj_nhds | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.29960\nB : Type u_2\nF : Type u_3\nE : B → Type ?u.29971\nZ : Type u_1\ninst✝³ : TopologicalSpace B\ninst✝² : TopologicalSpace F\nproj : Z → B\ninst✝¹ : TopologicalSpace Z\ninst✝ : TopologicalSpace (TotalSpace E)\ne : Trivialization F proj\nx : Z\nex... | [
441,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
439,
1
] |
Mathlib/Topology/Algebra/Module/FiniteDimension.lean | LinearEquiv.coe_toContinuousLinearEquiv_symm' | [] | [
387,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
385,
1
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineIsometryEquiv.antilipschitz | [] | [
664,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
663,
11
] |
Mathlib/LinearAlgebra/Matrix/ZPow.lean | Matrix.conjTranspose_zpow | [
{
"state_after": "no goals",
"state_before": "n' : Type u_2\ninst✝³ : DecidableEq n'\ninst✝² : Fintype n'\nR : Type u_1\ninst✝¹ : CommRing R\ninst✝ : StarRing R\nA : M\nn : ℕ\n⊢ (A ^ ↑n)ᴴ = Aᴴ ^ ↑n",
"tactic": "rw [zpow_ofNat, zpow_ofNat, conjTranspose_pow]"
},
{
"state_after": "no goals",
"... | [
346,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
344,
1
] |
Mathlib/Analysis/NormedSpace/ContinuousLinearMap.lean | ContinuousLinearEquiv.coe_toSpanNonzeroSingleton_symm | [] | [
309,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
307,
1
] |
Mathlib/CategoryTheory/Monoidal/End.lean | CategoryTheory.μ_naturalityₗ | [
{
"state_after": "C : Type u\ninst✝² : Category C\nM : Type u_2\ninst✝¹ : Category M\ninst✝ : MonoidalCategory M\nF : MonoidalFunctor M (C ⥤ C)\nm n m' : M\nf : m ⟶ m'\nX : C\n⊢ (F.obj n).map ((F.map f).app X) ≫ (LaxMonoidalFunctor.μ F.toLaxMonoidalFunctor m' n).app X =\n (F.map (𝟙 n)).app ((F.obj m).obj X)... | [
158,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Data/Nat/Order/Lemmas.lean | Nat.dvd_left_injective | [] | [
253,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
252,
1
] |
Mathlib/Data/Set/Sups.lean | Set.infs_right_comm | [] | [
362,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/Data/Sum/Interval.lean | Sum.Ico_inr_inl | [] | [
184,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/Analysis/Convex/Topology.lean | Convex.combo_self_interior_mem_interior | [] | [
179,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
1
] |
Mathlib/RingTheory/Coprime/Basic.lean | IsCoprime.mul_add_right_left | [
{
"state_after": "R : Type u\ninst✝ : CommRing R\nx y : R\nh : IsCoprime x y\nz : R\n⊢ IsCoprime (x + z * y) y",
"state_before": "R : Type u\ninst✝ : CommRing R\nx y : R\nh : IsCoprime x y\nz : R\n⊢ IsCoprime (z * y + x) y",
"tactic": "rw [add_comm]"
},
{
"state_after": "no goals",
"state_be... | [
310,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
308,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | volume_image_subtype_coe | [] | [
4266,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
4264,
1
] |
Mathlib/Analysis/Normed/Field/InfiniteSum.lean | summable_mul_of_summable_norm | [] | [
50,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
47,
1
] |
Mathlib/Topology/VectorBundle/Basic.lean | VectorBundleCore.inCoordinates_eq | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.536498\nB : Type u_4\nF : Type u_5\nE : B → Type ?u.536509\ninst✝²² : NontriviallyNormedField R\ninst✝²¹ : (x : B) → AddCommMonoid (E x)\ninst✝²⁰ : (x : B) → Module R (E x)\ninst✝¹⁹ : NormedAddCommGroup F\ninst✝¹⁸ : NormedSpace R F\ninst✝¹⁷ : Topolog... | [
1059,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1052,
11
] |
Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.eapprox_comp | [] | [
929,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
927,
1
] |
Mathlib/Data/Sign.lean | SignType.not_lt_neg_one | [] | [
216,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.union_le_union_right | [] | [
1711,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1710,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.IsTrail.of_cons | [
{
"state_after": "no goals",
"state_before": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nu v w : V\nh : Adj G u v\np : Walk G v w\n⊢ IsTrail (cons h p) → IsTrail p",
"tactic": "simp [isTrail_def]"
}
] | [
923,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
922,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/ZeroMorphisms.lean | CategoryTheory.Limits.IsZero.of_mono | [
{
"state_after": "C : Type u\ninst✝³ : Category C\nD : Type u'\ninst✝² : Category D\ninst✝¹ : HasZeroMorphisms C\nX Y : C\nf : X ⟶ Y\ninst✝ : Mono f\ni : IsZero Y\nhf : f = 0\n⊢ IsZero X",
"state_before": "C : Type u\ninst✝³ : Category C\nD : Type u'\ninst✝² : Category D\ninst✝¹ : HasZeroMorphisms C\nX Y : ... | [
238,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/RingTheory/Polynomial/Chebyshev.lean | Polynomial.Chebyshev.add_one_mul_T_eq_poly_in_U | [
{
"state_after": "R : Type u_1\nS : Type ?u.79032\ninst✝¹ : CommRing R\ninst✝ : CommRing S\nn : ℕ\nh :\n ↑derivative (T R (n + 2)) =\n U R (n + 1) - X * U R n + X * ↑derivative (T R (n + 1)) + 2 * X * U R n - (1 - X ^ 2) * ↑derivative (U R n)\n⊢ (↑n + 1) * T R (n + 1) = X * U R n - (1 - X ^ 2) * ↑derivative... | [
236,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Order/RelIso/Basic.lean | RelIso.cast_symm | [] | [
758,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
756,
11
] |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | csInf_univ | [] | [
1029,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1028,
1
] |
Mathlib/RingTheory/Polynomial/Pochhammer.lean | pochhammer_map | [
{
"state_after": "case zero\nS : Type u\ninst✝¹ : Semiring S\nT : Type v\ninst✝ : Semiring T\nf : S →+* T\n⊢ map f (pochhammer S Nat.zero) = pochhammer T Nat.zero\n\ncase succ\nS : Type u\ninst✝¹ : Semiring S\nT : Type v\ninst✝ : Semiring T\nf : S →+* T\nn : ℕ\nih : map f (pochhammer S n) = pochhammer T n\n⊢ ma... | [
73,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/NumberTheory/Multiplicity.lean | Int.sq_mod_four_eq_one_of_odd | [
{
"state_after": "R : Type ?u.849581\nn : ℕ\nx : ℤ\nhx : Odd x\n⊢ x ^ 2 % 4 = 1",
"state_before": "R : Type ?u.849581\nn : ℕ\nx : ℤ\n⊢ Odd x → x ^ 2 % 4 = 1",
"tactic": "intro hx"
},
{
"state_after": "R : Type ?u.849581\nn : ℕ\nx : ℤ\nhx : ∃ k, x = 2 * k + 1\n⊢ x ^ 2 % 4 = 1",
"state_before"... | [
275,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
269,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.le_toReal_sub | [
{
"state_after": "case intro\nα : Type ?u.791480\nβ : Type ?u.791483\na✝ b✝ c d : ℝ≥0∞\nr p q : ℝ≥0\na : ℝ≥0∞\nb : ℝ≥0\n⊢ ENNReal.toReal a - ENNReal.toReal ↑b ≤ ENNReal.toReal (a - ↑b)",
"state_before": "α : Type ?u.791480\nβ : Type ?u.791483\na✝ b✝ c d : ℝ≥0∞\nr p q : ℝ≥0\na b : ℝ≥0∞\nhb : b ≠ ⊤\n⊢ ENNReal... | [
1963,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1958,
1
] |
Mathlib/Data/Set/Prod.lean | Set.prod_mk_mem_set_prod_eq | [] | [
65,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/LinearAlgebra/LinearPMap.lean | LinearPMap.mem_domain_iff | [
{
"state_after": "case mp\nR : 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.569553\ninst✝⁴ : AddCommGroup G\ninst✝³ : Module R G\nM : Type ?u.570069\ninst✝² : Monoid M\ninst✝¹ : DistribMulAction M F... | [
840,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
831,
1
] |
Mathlib/RingTheory/Subring/Basic.lean | Subring.mem_closure_iff | [
{
"state_after": "R : Type u\nS : Type v\nT : Type w\ninst✝² : Ring R\ninst✝¹ : Ring S\ninst✝ : Ring T\ns : Set R\nx✝ : R\nh : x✝ ∈ closure s\nx y : R\nhx : x ∈ AddSubgroup.closure ↑(Submonoid.closure s)\nhy : y ∈ AddSubgroup.closure ↑(Submonoid.closure s)\nq : R\nhq : q ∈ ↑(Submonoid.closure s)\n⊢ 0 ∈ AddSubgr... | [
982,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
955,
1
] |
Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.measurable | [] | [
216,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
11
] |
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean | NNReal.rpow_lt_rpow_of_exponent_gt | [] | [
180,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
178,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.L1.setToL1_eq_setToL1SCLM | [] | [
1033,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1030,
1
] |
Mathlib/Data/Finmap.lean | Finmap.mem_erase | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : α → Type v\ninst✝ : DecidableEq α\na a' : α\ns✝ : Finmap β\ns : AList β\n⊢ a' ∈ erase a ⟦s⟧ ↔ a' ≠ a ∧ a' ∈ ⟦s⟧",
"tactic": "simp"
}
] | [
439,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
438,
1
] |
Mathlib/MeasureTheory/Integral/Bochner.lean | MeasureTheory.ae_le_trim_of_stronglyMeasurable | [
{
"state_after": "α : Type ?u.1731454\nE : Type ?u.1731457\nF : Type ?u.1731460\n𝕜 : Type ?u.1731463\ninst✝¹³ : NormedAddCommGroup E\ninst✝¹² : NormedSpace ℝ E\ninst✝¹¹ : CompleteSpace E\ninst✝¹⁰ : NontriviallyNormedField 𝕜\ninst✝⁹ : NormedSpace 𝕜 E\ninst✝⁸ : SMulCommClass ℝ 𝕜 E\ninst✝⁷ : NormedAddCommGroup... | [
1815,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1810,
1
] |
Mathlib/Algebra/Module/LocalizedModule.lean | LocalizedModule.divBy_mul_by | [
{
"state_after": "R : Type u\ninst✝² : CommSemiring R\nS : Submonoid R\nM : Type v\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\ns : { x // x ∈ S }\np : LocalizedModule S M\nm : M\nt : { x // x ∈ S }\n⊢ ↑(divBy s) (↑(↑(algebraMap R (Module.End R (LocalizedModule S M))) ↑s) (Quotient.mk (r.setoid S M) (m, t))) ... | [
519,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
510,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.Lf.not_ge | [] | [
418,
5
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
417,
1
] |
Mathlib/Algebra/Lie/Submodule.lean | LieIdeal.comap_map_eq | [
{
"state_after": "no goals",
"state_before": "R : Type u\nL : Type v\nL' : Type w₂\nM : Type w\nM' : Type w₁\ninst✝¹² : CommRing R\ninst✝¹¹ : LieRing L\ninst✝¹⁰ : LieAlgebra R L\ninst✝⁹ : LieRing L'\ninst✝⁸ : LieAlgebra R L'\ninst✝⁷ : AddCommGroup M\ninst✝⁶ : Module R M\ninst✝⁵ : LieRingModule L M\ninst✝⁴ :... | [
1098,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1096,
1
] |
Mathlib/Topology/Algebra/Module/FiniteDimension.lean | Basis.coe_constrL | [] | [
450,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
449,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Base.lean | Real.logb_lt_logb_iff | [
{
"state_after": "b x y : ℝ\nhb : 1 < b\nhx : 0 < x\nhy : 0 < y\n⊢ log x < log y ↔ x < y",
"state_before": "b x y : ℝ\nhb : 1 < b\nhx : 0 < x\nhy : 0 < y\n⊢ logb b x < logb b y ↔ x < y",
"tactic": "rw [logb, logb, div_lt_div_right (log_pos hb)]"
},
{
"state_after": "no goals",
"state_before"... | [
160,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean | MeasureTheory.Measure.add_haar_ball_center | [
{
"state_after": "no goals",
"state_before": "E✝ : Type ?u.1965249\ninst✝¹² : NormedAddCommGroup E✝\ninst✝¹¹ : NormedSpace ℝ E✝\ninst✝¹⁰ : MeasurableSpace E✝\ninst✝⁹ : BorelSpace E✝\ninst✝⁸ : FiniteDimensional ℝ E✝\nμ✝ : Measure E✝\ninst✝⁷ : IsAddHaarMeasure μ✝\nF : Type ?u.1965918\ninst✝⁶ : NormedAddCommGr... | [
406,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
403,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.ball_subset_interior_closedBall | [] | [
1894,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1893,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | min_div_div_right | [] | [
605,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
604,
1
] |
Mathlib/GroupTheory/Nilpotent.lean | comap_upperCentralSeries_quotient_center | [
{
"state_after": "case zero\nG : Type u_1\ninst✝¹ : Group G\nH : Subgroup G\ninst✝ : Normal H\n⊢ comap (mk' (center G)) (upperCentralSeries (G ⧸ center G) Nat.zero) = upperCentralSeries G (Nat.succ Nat.zero)\n\ncase succ\nG : Type u_1\ninst✝¹ : Group G\nH : Subgroup G\ninst✝ : Normal H\nn : ℕ\nih : comap (mk' (... | [
610,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
595,
1
] |
Mathlib/Topology/Support.lean | hasCompactMulSupport_comp_left | [
{
"state_after": "no goals",
"state_before": "X : Type ?u.14903\nα : Type u_3\nα' : Type ?u.14909\nβ : Type u_2\nγ : Type u_1\nδ : Type ?u.14918\nM : Type ?u.14921\nE : Type ?u.14924\nR : Type ?u.14927\ninst✝⁴ : TopologicalSpace α\ninst✝³ : TopologicalSpace α'\ninst✝² : One β\ninst✝¹ : One γ\ninst✝ : One δ\... | [
212,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
210,
1
] |
Mathlib/Data/Set/BoolIndicator.lean | Set.mem_iff_boolIndicator | [
{
"state_after": "α : Type u_1\ns : Set α\nx : α\n⊢ x ∈ s ↔ (if x ∈ s then true else false) = true",
"state_before": "α : Type u_1\ns : Set α\nx : α\n⊢ x ∈ s ↔ boolIndicator s x = true",
"tactic": "unfold boolIndicator"
},
{
"state_after": "no goals",
"state_before": "α : Type u_1\ns : Set α... | [
32,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
30,
1
] |
Mathlib/Data/Int/GCD.lean | Nat.xgcdAux_zero | [] | [
52,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
52,
1
] |
Mathlib/CategoryTheory/StructuredArrow.lean | CategoryTheory.StructuredArrow.mk_right | [] | [
75,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/Analysis/InnerProductSpace/Orientation.lean | OrthonormalBasis.orientation_adjustToOrientation | [
{
"state_after": "E : Type u_1\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace ℝ E\nι : Type u_2\ninst✝¹ : Fintype ι\ninst✝ : DecidableEq ι\nne : Nonempty ι\ne f : OrthonormalBasis ι ℝ E\nx : Orientation ℝ E ι\n⊢ Basis.orientation (Basis.adjustToOrientation (OrthonormalBasis.toBasis e) x) = x",
"... | [
127,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/NumberTheory/BernoulliPolynomials.lean | Polynomial.bernoulli_generating_function | [
{
"state_after": "case h\nA : Type u_1\ninst✝¹ : CommRing A\ninst✝ : Algebra ℚ A\nt : A\nn : ℕ\n⊢ ↑(PowerSeries.coeff A n) ((PowerSeries.mk fun n => ↑(aeval t) ((1 / ↑n !) • bernoulli n)) * (exp A - 1)) =\n ↑(PowerSeries.coeff A n) (PowerSeries.X * ↑(rescale t) (exp A))",
"state_before": "A : Type u_1\ni... | [
260,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
222,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.coe_castPred | [
{
"state_after": "case mk\nn✝ m n a : ℕ\nha : a < n + 2\nhx : { val := a, isLt := ha } < last (n + 1)\n⊢ ↑(castPred { val := a, isLt := ha }) = ↑{ val := a, isLt := ha }",
"state_before": "n✝ m n : ℕ\na : Fin (n + 2)\nhx : a < last (n + 1)\n⊢ ↑(castPred a) = ↑a",
"tactic": "rcases a with ⟨a, ha⟩"
},
... | [
2338,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2334,
1
] |
Mathlib/Data/PFunctor/Univariate/M.lean | PFunctor.M.iselect_eq_default | [
{
"state_after": "case nil\nF : PFunctor\nX : Type ?u.22988\nf : X → Obj F X\ninst✝¹ : DecidableEq F.A\ninst✝ : Inhabited (M F)\nps : Path F\nx✝ : M F\nh✝ : ¬IsPath ps x✝\nx : M F\nh : ¬IsPath [] x\n⊢ iselect [] x = head default\n\ncase cons\nF : PFunctor\nX : Type ?u.22988\nf : X → Obj F X\ninst✝¹ : DecidableE... | [
532,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
515,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | SemiconjBy.cast_int_mul_cast_int_mul | [] | [
1076,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1074,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | HasFTaylorSeriesUpToOn.restrictScalars | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_2\ninst✝¹⁶ : NontriviallyNormedField 𝕜\nD : Type uD\ninst✝¹⁵ : NormedAddCommGroup D\ninst✝¹⁴ : NormedSpace 𝕜 D\nE : Type uE\ninst✝¹³ : NormedAddCommGroup E\ninst✝¹² : NormedSpace 𝕜 E\nF : Type uF\ninst✝¹¹ : NormedAddCommGroup F\ninst✝¹⁰ : NormedSp... | [
2214,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2207,
1
] |
Mathlib/Topology/Sheaves/Limits.lean | TopCat.limit_isSheaf | [] | [
58,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
56,
1
] |
Mathlib/Algebra/Order/ToIntervalMod.lean | self_sub_toIocDiv_zsmul | [] | [
121,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
120,
1
] |
Mathlib/LinearAlgebra/Lagrange.lean | Lagrange.interpolate_empty | [
{
"state_after": "no goals",
"state_before": "F : Type u_1\ninst✝¹ : Field F\nι : Type u_2\ninst✝ : DecidableEq ι\ns t : Finset ι\ni j : ι\nv r r' : ι → F\n⊢ ↑(interpolate ∅ v) r = 0",
"tactic": "rw [interpolate_apply, sum_empty]"
}
] | [
309,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
309,
1
] |
Mathlib/Order/Lattice.lean | SemilatticeInf.dual_dual | [] | [
582,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
580,
1
] |
Mathlib/Algebra/Group/Pi.lean | Function.update_div | [] | [
638,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
636,
1
] |
Std/Data/List/Lemmas.lean | List.get?_set | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\na : α\nm n : Nat\nl : List α\n⊢ get? (set l m a) n = if m = n then (fun x => a) <$> get? l n else get? l n",
"tactic": "by_cases m = n <;> simp [*, get?_set_eq, get?_set_ne]"
}
] | [
807,
56
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
805,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean | AffineEquiv.injective_pointReflection_left_of_injective_bit0 | [] | [
596,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
594,
1
] |
Mathlib/Topology/LocalExtr.lean | IsLocalMinOn.inf | [] | [
487,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
485,
8
] |
Mathlib/Data/Stream/Init.lean | Stream'.eq_or_mem_of_mem_cons | [
{
"state_after": "case zero\nα : Type u\nβ : Type v\nδ : Type w\na b : α\ns : Stream' α\nx✝ : a ∈ b :: s\nh : a = nth (b :: s) zero\n⊢ a = b ∨ a ∈ s\n\ncase succ\nα : Type u\nβ : Type v\nδ : Type w\na b : α\ns : Stream' α\nx✝ : a ∈ b :: s\nn' : ℕ\nh : a = nth (b :: s) (succ n')\n⊢ a = b ∨ a ∈ s",
"state_bef... | [
136,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/Topology/GDelta.lean | Set.Finite.isGδ_compl | [] | [
150,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
1
] |
Mathlib/Algebra/GCDMonoid/Finset.lean | Finset.normalize_lcm | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.5029\ninst✝¹ : CancelCommMonoidWithZero α\ninst✝ : NormalizedGCDMonoid α\ns s₁ s₂ : Finset β\nf : β → α\n⊢ ↑normalize (lcm s f) = lcm s f",
"tactic": "simp [lcm_def]"
}
] | [
95,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/Data/Set/Intervals/ProjIcc.lean | Set.projIcc_of_le_left | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.573\ninst✝ : LinearOrder α\na b : α\nh : a ≤ b\nx : α\nhx : x ≤ a\n⊢ projIcc a b h x = { val := a, property := (_ : a ∈ Icc a b) }",
"tactic": "simp [projIcc, hx, hx.trans h]"
}
] | [
42,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
41,
1
] |
Mathlib/Algebra/Regular/SMul.lean | isRightRegular_iff | [] | [
59,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/Analysis/SpecialFunctions/Integrals.lean | intervalIntegral.intervalIntegrable_cpow | [
{
"state_after": "case pos\na b : ℝ\nn : ℕ\nf : ℝ → ℝ\nμ ν : MeasureTheory.Measure ℝ\ninst✝ : IsLocallyFiniteMeasure μ\nc d : ℝ\nr : ℂ\nh : 0 ≤ r.re ∨ ¬0 ∈ [[a, b]]\nh2 : ¬0 ∈ [[a, b]]\n⊢ IntervalIntegrable (fun x => ↑x ^ r) μ a b\n\ncase neg\na b : ℝ\nn : ℕ\nf : ℝ → ℝ\nμ ν : MeasureTheory.Measure ℝ\ninst✝ : Is... | [
147,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.