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/RepresentationTheory/Action.lean | CategoryTheory.MonoidalFunctor.mapAction_ε_inv_hom | [
{
"state_after": "no goals",
"state_before": "V : Type (u + 1)\ninst✝³ : LargeCategory V\nW : Type (u + 1)\ninst✝² : LargeCategory W\ninst✝¹ : MonoidalCategory V\ninst✝ : MonoidalCategory W\nF : MonoidalFunctor V W\nG : MonCat\n⊢ (inv (mapAction F G).toLaxMonoidalFunctor.ε).hom = inv F.ε",
"tactic": "rw... | [
1016,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1014,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev.lean | Polynomial.Chebyshev.algebraMap_eval_T | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nA : Type u_1\ninst✝² : CommRing R\ninst✝¹ : CommRing A\ninst✝ : Algebra R A\nx : R\nn : ℕ\n⊢ ↑(algebraMap R A) (eval x (T R n)) = eval (↑(algebraMap R A) x) (T A n)",
"tactic": "rw [← aeval_algebraMap_apply_eq_algebraMap_eval, aeval_T]"
}
] | [
44,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
42,
1
] |
Mathlib/RingTheory/RootsOfUnity/Basic.lean | IsPrimitiveRoot.pow | [
{
"state_after": "M : Type u_1\nN : Type ?u.2327355\nG : Type ?u.2327358\nR : Type ?u.2327361\nS : Type ?u.2327364\nF : Type ?u.2327367\ninst✝² : CommMonoid M\ninst✝¹ : CommMonoid N\ninst✝ : DivisionCommMonoid G\nk l : ℕ\nζ : M\nf : F\nh✝ : IsPrimitiveRoot ζ k\na b : ℕ\nhn : 0 < a * b\nh : IsPrimitiveRoot ζ (a ... | [
501,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
493,
1
] |
Mathlib/Topology/Order/Basic.lean | nhdsWithin_Ici_self_neBot | [] | [
255,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Mathlib/Order/Monotone/Monovary.lean | monovary_id_iff | [] | [
295,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
294,
1
] |
Mathlib/Topology/VectorBundle/Basic.lean | Trivialization.coordChangeL_apply | [] | [
331,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
328,
1
] |
Mathlib/Analysis/Complex/Basic.lean | Complex.norm_int_of_nonneg | [
{
"state_after": "no goals",
"state_before": "E : Type ?u.189234\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℂ E\nn : ℤ\nhn : 0 ≤ n\n⊢ ‖↑n‖ = ↑n",
"tactic": "rw [norm_int, ← Int.cast_abs, _root_.abs_of_nonneg hn]"
}
] | [
171,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/Data/Sign.lean | sign_nonpos_iff | [
{
"state_after": "case inl\nα : Type u_1\ninst✝¹ : Zero α\ninst✝ : LinearOrder α\na : α\nh : 0 < a\n⊢ ↑sign a ≤ 0 ↔ a ≤ 0\n\ncase inr.inl\nα : Type u_1\ninst✝¹ : Zero α\ninst✝ : LinearOrder α\na : α\nh : 0 = a\n⊢ ↑sign a ≤ 0 ↔ a ≤ 0\n\ncase inr.inr\nα : Type u_1\ninst✝¹ : Zero α\ninst✝ : LinearOrder α\na : α\nh... | [
377,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
373,
1
] |
Mathlib/Data/Real/Irrational.lean | Irrational.of_int_sub | [
{
"state_after": "no goals",
"state_before": "q : ℚ\nx y : ℝ\nm : ℤ\nh : Irrational (↑m - x)\n⊢ Irrational (↑↑m - x)",
"tactic": "rwa [Rat.cast_coe_int]"
}
] | [
308,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
307,
1
] |
Mathlib/Topology/Basic.lean | frontier_compl | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\na : α\ns✝ s₁ s₂ t : Set α\np p₁ p₂ : α → Prop\ninst✝ : TopologicalSpace α\ns : Set α\n⊢ frontier (sᶜ) = frontier s",
"tactic": "simp only [frontier_eq_closure_inter_closure, compl_compl, inter_comm]"
}
] | [
733,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
732,
1
] |
Mathlib/Data/Int/GCD.lean | Int.gcd_mul_lcm | [
{
"state_after": "no goals",
"state_before": "i j : ℤ\n⊢ gcd i j * lcm i j = natAbs (i * j)",
"tactic": "rw [Int.gcd, Int.lcm, Nat.gcd_mul_lcm, natAbs_mul]"
}
] | [
260,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
259,
1
] |
Mathlib/Topology/Bases.lean | TopologicalSpace.exists_countable_dense | [] | [
313,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
312,
1
] |
Mathlib/Analysis/Convex/Star.lean | StarConvex.mem | [
{
"state_after": "case intro\n𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.10190\ninst✝⁴ : OrderedSemiring 𝕜\ninst✝³ : AddCommMonoid E\ninst✝² : AddCommMonoid F\ninst✝¹ : Module 𝕜 E\ninst✝ : Module 𝕜 F\nx y✝ z : E\ns : Set E\nhs : StarConvex 𝕜 x s\ny : E\nhy : y ∈ s\n⊢ x ∈ s",
"state_before": "𝕜 : Type u_1... | [
163,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
160,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.PushoutCocone.IsColimit.hom_ext | [] | [
880,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
878,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.le_minFac | [
{
"state_after": "m p : ℕ\npp : Prime p\nh : 1 = 1 ∨ m ≤ minFac 1\nd : p ∣ 1\n⊢ m ≤ p",
"state_before": "m n : ℕ\nh : n = 1 ∨ m ≤ minFac n\np : ℕ\npp : Prime p\nd : p ∣ n\n⊢ n = 1 → m ≤ p",
"tactic": "rintro rfl"
},
{
"state_after": "no goals",
"state_before": "m p : ℕ\npp : Prime p\nh : 1 =... | [
355,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
351,
1
] |
Mathlib/LinearAlgebra/FreeAlgebra.lean | FreeAlgebra.rank_eq | [] | [
42,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Mathlib/Dynamics/OmegaLimit.lean | omegaLimit_subset_closure_fw_image | [
{
"state_after": "τ : Type u_1\nα : Type u_3\nβ : Type u_2\nι : Type ?u.37203\ninst✝ : TopologicalSpace β\nf : Filter τ\nϕ : τ → α → β\ns s₁ s₂ : Set α\nu : Set τ\nhu : u ∈ f\n⊢ (⋂ (u : ↑f.sets), closure (image2 ϕ (↑u) s)) ⊆ closure (image2 ϕ u s)",
"state_before": "τ : Type u_1\nα : Type u_3\nβ : Type u_2\... | [
225,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
220,
1
] |
Mathlib/Data/Bool/Count.lean | List.Chain'.count_not_le_count_add_one | [
{
"state_after": "case nil\nb : Bool\nhl : Chain' (fun x x_1 => x ≠ x_1) []\n⊢ count (!b) [] ≤ count b [] + 1\n\ncase cons\nb x : Bool\nl : List Bool\nhl : Chain' (fun x x_1 => x ≠ x_1) (x :: l)\n⊢ count (!b) (x :: l) ≤ count b (x :: l) + 1",
"state_before": "l : List Bool\nhl : Chain' (fun x x_1 => x ≠ x_1... | [
90,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/Algebra/Module/Basic.lean | neg_one_smul | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.111911\nR : Type u_2\nk : Type ?u.111917\nS : Type ?u.111920\nM : Type u_1\nM₂ : Type ?u.111926\nM₃ : Type ?u.111929\nι : Type ?u.111932\ninst✝² : Ring R\ninst✝¹ : AddCommGroup M\ninst✝ : Module R M\nr s : R\nx✝ y x : M\n⊢ -1 • x = -x",
"tactic":... | [
317,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
317,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.coe_nat_cast | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\ninst✝² : CommRing R\nS : Submonoid R\nP : Type u_1\ninst✝¹ : CommRing P\ninst✝ : Algebra R P\nloc : IsLocalization S P\nn : ℕ\n⊢ ↑(Nat.unaryCast n) = ↑n",
"tactic": "induction n <;> simp [*, Nat.unaryCast]"
}
] | [
610,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
608,
1
] |
Mathlib/Order/BoundedOrder.lean | isTop_top | [] | [
104,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/Algebra/Module/Equiv.lean | LinearEquiv.restrictScalars_injective | [] | [
630,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
628,
1
] |
Mathlib/Data/PNat/Xgcd.lean | PNat.XgcdType.start_v | [
{
"state_after": "u : XgcdType\na b : ℕ+\n⊢ (succ 0 * succ (↑a - 1) + 0 * succ (↑b - 1), 0 * succ (↑a - 1) + succ 0 * succ (↑b - 1)) = (↑a, ↑b)",
"state_before": "u : XgcdType\na b : ℕ+\n⊢ v (start a b) = (↑a, ↑b)",
"tactic": "dsimp [start, v, XgcdType.a, XgcdType.b, w, z]"
},
{
"state_after": "... | [
270,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
265,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.infinite_pigeonhole_card | [
{
"state_after": "case intro\nα✝ : Type ?u.110625\nr : α✝ → α✝ → Prop\nβ α : Type u\nf : β → α\ns : Set β\nhθ : (#↑s) ≤ (#β)\nh₁ : ℵ₀ ≤ (#↑s)\nh₂ : (#α) < cof (ord (#↑s))\n⊢ ∃ a, (#↑s) ≤ (#↑(f ⁻¹' {a}))",
"state_before": "α✝ : Type ?u.110625\nr : α✝ → α✝ → Prop\nβ α : Type u\nf : β → α\nθ : Cardinal\nhθ : θ... | [
825,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
820,
1
] |
Mathlib/Data/Set/Basic.lean | Set.inter_empty | [] | [
917,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
916,
1
] |
Mathlib/CategoryTheory/Preadditive/Biproducts.lean | CategoryTheory.Biprod.inl_ofComponents | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝² : Category C\ninst✝¹ : Preadditive C\ninst✝ : HasBinaryBiproducts C\nX₁ X₂ Y₁ Y₂ : C\nf₁₁ : X₁ ⟶ Y₁\nf₁₂ : X₁ ⟶ Y₂\nf₂₁ : X₂ ⟶ Y₁\nf₂₂ : X₂ ⟶ Y₂\n⊢ biprod.inl ≫ ofComponents f₁₁ f₁₂ f₂₁ f₂₂ = f₁₁ ≫ biprod.inl + f₁₂ ≫ biprod.inr",
"tactic":... | [
682,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
680,
1
] |
Mathlib/Order/UpperLower/Basic.lean | isLowerSet_empty | [] | [
76,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.exists_coeff_ne_zero_iff_ne_zero | [
{
"state_after": "R : Type u_1\ninst✝ : Semiring R\nφ : PowerSeries R\n⊢ (¬∃ n, ↑(coeff R n) φ ≠ 0) ↔ ¬φ ≠ 0",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nφ : PowerSeries R\n⊢ (∃ n, ↑(coeff R n) φ ≠ 0) ↔ φ ≠ 0",
"tactic": "refine' not_iff_not.mp _"
},
{
"state_after": "R : Type u_1\ninst✝... | [
2226,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2223,
1
] |
Mathlib/ModelTheory/Substructures.lean | FirstOrder.Language.Substructure.comap_le_comap_iff_of_surjective | [] | [
651,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
650,
1
] |
Mathlib/Data/Set/Finite.lean | Set.card_image_of_injective | [] | [
1226,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1224,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | measurable_coe_real_ereal | [] | [
1967,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1966,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.bsup_id_succ | [] | [
1926,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1925,
1
] |
Mathlib/LinearAlgebra/Finsupp.lean | Finsupp.apply_total | [
{
"state_after": "no goals",
"state_before": "α : Type u_4\nM : Type u_2\nN : Type ?u.300771\nP : Type ?u.300774\nR : Type u_1\nS : Type ?u.300780\ninst✝¹² : Semiring R\ninst✝¹¹ : Semiring S\ninst✝¹⁰ : AddCommMonoid M\ninst✝⁹ : Module R M\ninst✝⁸ : AddCommMonoid N\ninst✝⁷ : Module R N\ninst✝⁶ : AddCommMonoi... | [
577,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
575,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Equiv.lean | ContinuousLinearEquiv.hasFDerivAt | [] | [
71,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
11
] |
Mathlib/GroupTheory/GroupAction/Defs.lean | one_smul | [] | [
482,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
481,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Submodule.map_bot | [] | [
837,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
836,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.cycleFactorsFinset_pairwise_disjoint | [] | [
1392,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1390,
1
] |
Mathlib/LinearAlgebra/LinearIndependent.lean | LinearIndependent.image | [
{
"state_after": "no goals",
"state_before": "ι✝ : Type u'\nι' : Type ?u.254205\nR : Type u_2\nK : Type ?u.254211\nM : Type u_3\nM' : Type ?u.254217\nM'' : Type ?u.254220\nV : Type u\nV' : Type ?u.254225\nv : ι✝ → M\ninst✝⁶ : Ring R\ninst✝⁵ : AddCommGroup M\ninst✝⁴ : AddCommGroup M'\ninst✝³ : AddCommGroup M... | [
518,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
516,
1
] |
src/lean/Init/Prelude.lean | Char.ne_of_val_ne | [] | [
2089,
39
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
2088,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.ConnectedComponent.iso_image_comp_eq_map_iff_eq_comp | [
{
"state_after": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nφ : G ≃g G'\nv : V\nv' : V'\nC : ConnectedComponent G\nu : V\n⊢ connectedComponentMk G' (↑φ v) = map (RelEmbedding.toRelHom (RelIso.toRelEmbedding φ)) (connectedComponentMk G u) ↔\n connect... | [
2080,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2076,
1
] |
Mathlib/Data/Fintype/Basic.lean | Set.subset_toFinset | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.84381\nγ : Type ?u.84384\ns✝ t : Set α\ns : Finset α\ninst✝ : Fintype ↑t\n⊢ s ⊆ toFinset t ↔ ↑s ⊆ t",
"tactic": "rw [← Finset.coe_subset, coe_toFinset]"
}
] | [
663,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
662,
1
] |
Mathlib/GroupTheory/Perm/Support.lean | Equiv.Perm.support_congr | [
{
"state_after": "case H\nα : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf g : Perm α\nh : support f ⊆ support g\nh' : ∀ (x : α), x ∈ support g → ↑f x = ↑g x\nx : α\n⊢ ↑f x = ↑g x",
"state_before": "α : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf g : Perm α\nh : support f ⊆ support g\nh... | [
325,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
320,
1
] |
Mathlib/Data/Real/NNReal.lean | NNReal.coe_mul | [] | [
190,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
11
] |
Mathlib/Data/Num/Lemmas.lean | PosNum.bit1_of_bit1 | [
{
"state_after": "α : Type ?u.81357\nn : PosNum\n⊢ succ (bit0 n) = bit1 n",
"state_before": "α : Type ?u.81357\nn : PosNum\n⊢ _root_.bit0 n + 1 = bit1 n",
"tactic": "rw [add_one, bit0_of_bit0]"
},
{
"state_after": "no goals",
"state_before": "α : Type ?u.81357\nn : PosNum\n⊢ succ (bit0 n) = ... | [
122,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | SemilinearIsometryClass.diam_range | [] | [
126,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | NNReal.pi_ne_zero | [] | [
202,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Split.lean | BoxIntegral.Prepartition.inf_split | [] | [
239,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Data/Finset/Prod.lean | Finset.offDiag_insert | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.129768\nγ : Type ?u.129771\ninst✝ : DecidableEq α\ns t : Finset α\nx : α × α\na : α\nhas : ¬a ∈ s\n⊢ offDiag (insert a s) = offDiag s ∪ {a} ×ˢ s ∪ s ×ˢ {a}",
"tactic": "rw [insert_eq, union_comm, offDiag_union (disjoint_singleton_ri... | [
422,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
420,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | Algebra.adjoin_eq_range | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type ?u.5139389\na a' a₁ a₂ : R\ne : ℕ\nn m : σ\ns✝ : σ →₀ ℕ\ninst✝³ : CommSemiring R\ninst✝² : CommSemiring S₁\np q : MvPolynomial σ R\ninst✝¹ : Algebra R S₁\ninst✝ : CommSemiring S₂\nf : σ → S₁\ns : Set S₁... | [
1574,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1572,
1
] |
Mathlib/Order/SuccPred/Basic.lean | Order.Icc_pred_right_of_not_isMin | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : Preorder α\ninst✝ : PredOrder α\na b : α\nha : ¬IsMin b\n⊢ Icc a (pred b) = Ico a b",
"tactic": "rw [← Ici_inter_Iic, Iic_pred_of_not_isMin ha, Ici_inter_Iio]"
}
] | [
684,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
683,
1
] |
Mathlib/Order/Filter/ZeroAndBoundedAtFilter.lean | Filter.BoundedAtFilter.mul | [
{
"state_after": "α : Type u_2\nβ : Type u_1\ninst✝ : NormedField β\nl : Filter α\nf g : α → β\nhf : BoundedAtFilter l f\nhg : BoundedAtFilter l g\n⊢ (fun x => OfNat.ofNat 1 x * OfNat.ofNat 1 x) =O[l] 1",
"state_before": "α : Type u_2\nβ : Type u_1\ninst✝ : NormedField β\nl : Filter α\nf g : α → β\nhf : Bou... | [
113,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
8
] |
Mathlib/Topology/MetricSpace/Antilipschitz.lean | antilipschitzWith_iff_le_mul_dist | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.1858\ninst✝¹ : PseudoMetricSpace α\ninst✝ : PseudoMetricSpace β\nK : ℝ≥0\nf : α → β\n⊢ (∀ (x y : α), nndist x y ≤ K * nndist (f x) (f y)) ↔ ∀ (x y : α), ↑(nndist x y) ≤ ↑K * ↑(nndist (f x) (f y))",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Typ... | [
68,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/LinearAlgebra/Contraction.lean | lTensorHomEquivHomLTensor_apply | [
{
"state_after": "no goals",
"state_before": "ι : Type w\nR : Type u\nM : Type v₁\nN : Type v₂\nP : Type v₃\nQ : Type v₄\ninst✝¹³ : CommRing R\ninst✝¹² : AddCommGroup M\ninst✝¹¹ : AddCommGroup N\ninst✝¹⁰ : AddCommGroup P\ninst✝⁹ : AddCommGroup Q\ninst✝⁸ : Module R M\ninst✝⁷ : Module R N\ninst✝⁶ : Module R P... | [
293,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
291,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.iUnion_of_singleton | [
{
"state_after": "no goals",
"state_before": "α✝ : Type ?u.165055\nβ : Type ?u.165058\nγ : Type ?u.165061\nι : Sort ?u.165064\nι' : Sort ?u.165067\nι₂ : Sort ?u.165070\nκ : ι → Sort ?u.165075\nκ₁ : ι → Sort ?u.165080\nκ₂ : ι → Sort ?u.165085\nκ' : ι' → Sort ?u.165090\nα : Type u_1\n⊢ (⋃ (x : α), {x}) = univ... | [
1307,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1307,
1
] |
Mathlib/Data/Subtype.lean | Subtype.exists | [] | [
58,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
11
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.support_ofFinsupp | [
{
"state_after": "no goals",
"state_before": "R : Type u\na b : R\nm n : ℕ\ninst✝ : Semiring R\np✝ q : R[X]\np : AddMonoidAlgebra R ℕ\n⊢ support { toFinsupp := p } = p.support",
"tactic": "rw [support]"
}
] | [
395,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
395,
1
] |
Mathlib/GroupTheory/Submonoid/Basic.lean | Submonoid.mem_bot | [] | [
265,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
264,
1
] |
Mathlib/Order/Circular.lean | btw_cyclic_right | [] | [
174,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/Data/Nat/Order/Lemmas.lean | Nat.dvd_one | [] | [
98,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
97,
11
] |
Mathlib/Order/Hom/Basic.lean | OrderIso.symm_refl | [] | [
867,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
866,
1
] |
Mathlib/Analysis/Convex/Integral.lean | ConcaveOn.le_map_integral | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nE : Type u_2\nF : Type ?u.1701878\nm0 : MeasurableSpace α\ninst✝⁶ : NormedAddCommGroup E\ninst✝⁵ : NormedSpace ℝ E\ninst✝⁴ : CompleteSpace E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace ℝ F\ninst✝¹ : CompleteSpace F\nμ : MeasureTheory.Measu... | [
227,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Mathlib/Data/Nat/Cast/Field.lean | Nat.one_div_lt_one_div | [
{
"state_after": "case refine'_1\nα : Type u_1\ninst✝ : LinearOrderedSemifield α\nn m : ℕ\nh : n < m\n⊢ 0 < ↑n + 1\n\ncase refine'_2\nα : Type u_1\ninst✝ : LinearOrderedSemifield α\nn m : ℕ\nh : n < m\n⊢ ↑n + 1 < ↑m + 1",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedSemifield α\nn m : ℕ\nh : n < m\n⊢... | [
81,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
78,
1
] |
Mathlib/Combinatorics/SetFamily/Compression/UV.lean | UV.compress_of_disjoint_of_le' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝² : GeneralizedBooleanAlgebra α\ninst✝¹ : DecidableRel Disjoint\ninst✝ : DecidableRel fun x x_1 => x ≤ x_1\ns : Finset α\nu v a b : α\nhva : Disjoint v a\nhua : u ≤ a\n⊢ compress u v ((a ⊔ v) \\ u) = a",
"tactic": "rw [compress_of_disjoint... | [
114,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousSMul.of_nhds_zero | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nM : Type u_2\ninst✝⁶ : Ring R\ninst✝⁵ : TopologicalSpace R\ninst✝⁴ : TopologicalSpace M\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\ninst✝¹ : TopologicalRing R\ninst✝ : TopologicalAddGroup M\nhmul : Tendsto (fun p => p.fst • p.snd) (𝓝 0 ×ˢ 𝓝 0)... | [
50,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Mathlib/Order/Bounds/Basic.lean | mem_lowerBounds_image2_of_mem_lowerBounds_of_mem_lowerBounds | [] | [
1512,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1510,
1
] |
Mathlib/Data/Set/Basic.lean | Set.union_def | [] | [
734,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
733,
1
] |
Mathlib/Algebra/Lie/Basic.lean | LieHom.map_add | [] | [
312,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
311,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | Orthonormal.inner_finsupp_eq_sum_right | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.2058385\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nι : Type u_3\ndec_ι : DecidableEq ι\nv : ι ... | [
845,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
843,
1
] |
Mathlib/NumberTheory/Liouville/LiouvilleWith.lean | LiouvilleWith.sub_rat | [] | [
269,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.tendstoLocallyUniformly_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.81094\nι✝ : Type ?u.81097\ninst✝¹ : PseudoMetricSpace α\nx y z : α\nδ ε ε₁ ε₂ : ℝ\ns : Set α\nι : Type u_1\ninst✝ : TopologicalSpace β\nF : ι → β → α\nf : β → α\np : Filter ι\n⊢ TendstoLocallyUniformly F f p ↔\n ∀ (ε : ℝ), ... | [
925,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
920,
1
] |
Mathlib/Algebra/Order/Archimedean.lean | archimedean_iff_int_lt | [
{
"state_after": "α : Type u_1\ninst✝ : LinearOrderedField α\n⊢ (∀ (x : α), ∃ n, x < ↑n) → ∀ (x : α), ∃ n, x < ↑n",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedField α\n⊢ (∀ (x : α), ∃ n, x < ↑n) → Archimedean α",
"tactic": "rw [archimedean_iff_nat_lt]"
},
{
"state_after": "α : Type u_1\... | [
350,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
344,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/ZeroMorphisms.lean | CategoryTheory.Limits.isIso_of_source_target_iso_zero | [
{
"state_after": "C : Type u\ninst✝³ : Category C\nD : Type u'\ninst✝² : Category D\ninst✝¹ : HasZeroMorphisms C\ninst✝ : HasZeroObject C\nX Y : C\nf : X ⟶ Y\ni : X ≅ 0\nj : Y ≅ 0\n⊢ IsIso 0",
"state_before": "C : Type u\ninst✝³ : Category C\nD : Type u'\ninst✝² : Category D\ninst✝¹ : HasZeroMorphisms C\nin... | [
533,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
530,
1
] |
Mathlib/Data/Set/Function.lean | Set.EqOn.trans | [] | [
210,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/Data/TypeVec.lean | TypeVec.id_comp | [] | [
83,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/Data/Matrix/Rank.lean | Matrix.rank_conjTranspose | [] | [
220,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
216,
1
] |
Mathlib/ModelTheory/Substructures.lean | FirstOrder.Language.Substructure.comap_inf | [] | [
524,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
522,
1
] |
Mathlib/Algebra/Algebra/Basic.lean | Module.End_algebraMap_isUnit_inv_apply_eq_iff' | [
{
"state_after": "R : Type u\nM : Type v\ninst✝² : CommSemiring R\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\nx : R\nh : IsUnit (↑(algebraMap R (End R M)) x)\nm m' : M\nH : m = x • m'\n⊢ ↑↑(IsUnit.unit h) m' = ↑↑(IsUnit.unit h) (↑↑(IsUnit.unit h)⁻¹ (x • m'))",
"state_before": "R : Type u\nM : Type v\nins... | [
683,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
675,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean | UniformFun.hasBasis_uniformity_of_basis | [] | [
325,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
319,
11
] |
Mathlib/Data/Pi/Algebra.lean | Sum.elim_mulSingle_one | [
{
"state_after": "no goals",
"state_before": "I : Type u\nα : Type u_1\nβ : Type u_2\nγ : Type u_3\nf : I → Type v₁\ng : I → Type v₂\nh : I → Type v₃\nx y : (i : I) → f i\ni✝ : I\na a' : α → γ\nb b' : β → γ\ninst✝² : DecidableEq α\ninst✝¹ : DecidableEq β\ninst✝ : One γ\ni : α\nc : γ\n⊢ Sum.elim (Pi.mulSingl... | [
456,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
454,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.tendsto_ae_map | [] | [
1280,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1279,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.Subsequent.moveLeft_mk_right | [
{
"state_after": "no goals",
"state_before": "xr : Type u_1\ni : xr\nxl : Type u_1\nxL : xl → PGame\nxR : xr → PGame\nj : LeftMoves (xR i)\n⊢ Subsequent (PGame.moveLeft (xR i) j) (mk xl xr xL xR)",
"tactic": "pgame_wf_tac"
}
] | [
321,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
319,
9
] |
Mathlib/AlgebraicTopology/DoldKan/NCompGamma.lean | AlgebraicTopology.DoldKan.PInfty_comp_map_mono_eq_zero | [
{
"state_after": "case h\nC : Type u_2\ninst✝¹ : Category C\ninst✝ : Preadditive C\nX : SimplicialObject C\nn : ℕ\nΔ' : SimplexCategory\ni✝ : Δ' ⟶ [n]\nhi✝ : Mono i✝\nh₁✝ : len Δ' ≠ n\nh₂✝ : ¬Isδ₀ i✝\nm : ℕ\ni : [m] ⟶ [n]\nhi : Mono i\nh₁ : len [m] ≠ n\nh₂ : ¬Isδ₀ i\n⊢ HomologicalComplex.Hom.f PInfty n ≫ X.map ... | [
79,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
39,
1
] |
Mathlib/Analysis/Normed/Group/Hom.lean | NormedAddGroupHom.mem_ker | [
{
"state_after": "no goals",
"state_before": "V : Type ?u.481267\nW : Type ?u.481270\nV₁ : Type u_1\nV₂ : Type u_2\nV₃ : Type ?u.481279\ninst✝⁴ : SeminormedAddCommGroup V\ninst✝³ : SeminormedAddCommGroup W\ninst✝² : SeminormedAddCommGroup V₁\ninst✝¹ : SeminormedAddCommGroup V₂\ninst✝ : SeminormedAddCommGrou... | [
746,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
745,
1
] |
Mathlib/Algebra/Group/Pi.lean | Function.update_inv | [] | [
631,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
629,
1
] |
Mathlib/Topology/Separation.lean | isIrreducible_iff_singleton | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝³ : TopologicalSpace α\nγ : Type ?u.143258\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : T2Space α\nS : Set α\n⊢ IsIrreducible S ↔ ∃ x, S = {x}",
"tactic": "rw [IsIrreducible, isPreirreducible_iff_subsingleto... | [
1448,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1446,
1
] |
Mathlib/Computability/Partrec.lean | Computable.option_map | [
{
"state_after": "case h.e'_5.h\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.185392\nσ : Type u_3\ninst✝³ : Primcodable α\ninst✝² : Primcodable β\ninst✝¹ : Primcodable γ\ninst✝ : Primcodable σ\nf : α → Option β\ng : α → β → σ\nhf : Computable f\nhg : Computable₂ g\nx✝ : α\n⊢ Option.map (g x✝) (f x✝) = Option.bind (... | [
700,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
697,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.powerlt_succ | [] | [
2303,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2301,
1
] |
Mathlib/Topology/Algebra/Order/Compact.lean | IsCompact.sSup_lt_iff_of_continuous | [] | [
338,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
336,
1
] |
Mathlib/Data/List/NatAntidiagonal.lean | List.Nat.length_antidiagonal | [
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ length (antidiagonal n) = n + 1",
"tactic": "rw [antidiagonal, length_map, length_range]"
}
] | [
56,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
1
] |
Mathlib/Data/Num/Lemmas.lean | Num.of_nat_inj | [] | [
502,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
501,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearMap.range_codRestrict | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nR₁ : Type ?u.1236277\nR₂ : Type u_1\nR₃ : Type ?u.1236283\nR₄ : Type ?u.1236286\nS : Type ?u.1236289\nK : Type ?u.1236292\nK₂ : Type ?u.1236295\nM : Type u_3\nM' : Type ?u.1236301\nM₁ : Type ?u.1236304\nM₂ : Type u_4\nM₃ : Type ?u.1236310\nM₄ : Typ... | [
1378,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1375,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | TendstoUniformly.tendstoLocallyUniformly | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι : Type x\ninst✝¹ : UniformSpace β\nF : ι → α → β\nf : α → β\ns s' : Set α\nx✝ : α\np : Filter ι\np' : Filter α\ng : ι → α\ninst✝ : TopologicalSpace α\nh : TendstoUniformly F f p\nu : Set (β × β)\nhu : u ∈ 𝓤 β\nx : α\n⊢ ∀ᶠ (... | [
643,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
642,
11
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.SameCycle.conj | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.39785\nα : Type u_1\nβ : Type ?u.39791\nf g : Perm α\np : α → Prop\nx y z : α\n⊢ SameCycle f x y → SameCycle (g * f * g⁻¹) (↑g x) (↑g y)",
"tactic": "simp [sameCycle_conj]"
}
] | [
125,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Algebra/CovariantAndContravariant.lean | act_rel_of_rel_of_act_rel | [] | [
197,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
1
] |
Mathlib/NumberTheory/Bernoulli.lean | bernoulli'_two | [
{
"state_after": "A : Type ?u.185050\ninst✝¹ : CommRing A\ninst✝ : Algebra ℚ A\n⊢ 1 - (0 + ↑(Nat.choose 2 0) / (↑2 - ↑0 + 1) * bernoulli' 0 + ↑(Nat.choose 2 1) / (↑2 - ↑1 + 1) * bernoulli' 1) = 1 / 6",
"state_before": "A : Type ?u.185050\ninst✝¹ : CommRing A\ninst✝ : Algebra ℚ A\n⊢ bernoulli' 2 = 1 / 6",
... | [
120,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.div_empty | [] | [
583,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
582,
1
] |
Mathlib/Combinatorics/Additive/Behrend.lean | Behrend.dValue_pos | [
{
"state_after": "α : Type ?u.742881\nβ : Type ?u.742884\nn d k N : ℕ\nx : Fin n → ℕ\nhN₃ : 8 ≤ N\nhN₀ : 0 < ↑N\n⊢ 0 < dValue N",
"state_before": "α : Type ?u.742881\nβ : Type ?u.742884\nn d k N : ℕ\nx : Fin n → ℕ\nhN₃ : 8 ≤ N\n⊢ 0 < dValue N",
"tactic": "have hN₀ : 0 < (N : ℝ) := cast_pos.2 (succ_pos'.... | [
429,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
409,
1
] |
Mathlib/Topology/FiberBundle/Trivialization.lean | Trivialization.continuousOn | [] | [
559,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
558,
11
] |
Mathlib/Data/Polynomial/Derivative.lean | Polynomial.derivative_pow_succ | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nT : Type w\nι : Type y\nA : Type z\na b : R\nn✝ : ℕ\ninst✝ : CommSemiring R\np : R[X]\nn : ℕ\n⊢ ↑derivative (p ^ (Nat.zero + 1)) = ↑C (↑Nat.zero + 1) * p ^ Nat.zero * ↑derivative p",
"tactic": "simp"
},
{
"state_after": "R : T... | [
481,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
477,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean | NNReal.rpow_left_bijective | [] | [
255,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.