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/LinearAlgebra/Matrix/Hermitian.lean | Matrix.isHermitian_zero | [] | [
153,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/Order/Bounds/Basic.lean | isGLB_Ioo | [
{
"state_after": "case inl\nα : Type u\nβ : Type v\nγ : Type w\nι : Sort x\ninst✝³ : Preorder α\ninst✝² : Preorder β\ns t : Set α\na✝ b✝ : α\ninst✝¹ : SemilatticeSup γ\ninst✝ : DenselyOrdered γ\na b : γ\nh : a < b\nx : γ\nhx : x ∈ lowerBounds (Ioo a b)\nh₁ : a = x ⊔ a\n⊢ x ≤ a\n\ncase inr\nα : Type u\nβ : Type ... | [
746,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
739,
1
] |
Mathlib/Analysis/Normed/Group/Hom.lean | NormedAddGroupHom.nsmul_apply | [] | [
560,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
559,
1
] |
Mathlib/Algebra/Hom/Units.lean | IsUnit.div_div_cancel_left | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.67029\nG : Type ?u.67032\nα : Type u_1\nM : Type ?u.67038\nN : Type ?u.67041\ninst✝ : DivisionCommMonoid α\na b c d : α\nh : IsUnit a\n⊢ a / b / a = b⁻¹",
"tactic": "rw [div_eq_mul_inv, div_eq_mul_inv, mul_right_comm, h.mul_inv_cancel, one_mul]"
... | [
511,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
510,
11
] |
Mathlib/Algebra/Module/Injective.lean | Module.Baer.extensionOfMax_is_max | [] | [
249,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
246,
1
] |
Mathlib/RingTheory/Coprime/Basic.lean | IsCoprime.dvd_of_dvd_mul_right | [
{
"state_after": "R : Type u\ninst✝ : CommSemiring R\nx y z : R\nH1 : IsCoprime x z\nH2 : x ∣ y * z\na b : R\nH : a * x + b * z = 1\n⊢ x ∣ y",
"state_before": "R : Type u\ninst✝ : CommSemiring R\nx y z : R\nH1 : IsCoprime x z\nH2 : x ∣ y * z\n⊢ x ∣ y",
"tactic": "let ⟨a, b, H⟩ := H1"
},
{
"state... | [
93,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/CategoryTheory/Sites/Sieves.lean | CategoryTheory.Sieve.generate_sieve | [] | [
427,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
426,
1
] |
Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean | RingSubgroupsBasis.mem_addGroupFilterBasis | [] | [
140,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Mul.lean | DifferentiableAt.clm_apply | [] | [
140,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/Topology/Order.lean | mem_nhds_discrete | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nt t₁ t₂ : TopologicalSpace α\ns✝ : Set α\ninst✝¹ : TopologicalSpace α\ninst✝ : DiscreteTopology α\nx : α\ns : Set α\n⊢ s ∈ 𝓝 x ↔ x ∈ s",
"tactic": "rw [nhds_discrete, mem_pure]"
}
] | [
301,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
300,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Asymptotics.lean | tendsto_rpow_atTop | [
{
"state_after": "y : ℝ\nhy : 0 < y\n⊢ ∀ (b : ℝ), ∃ i, ∀ (a : ℝ), i ≤ a → b ≤ a ^ y",
"state_before": "y : ℝ\nhy : 0 < y\n⊢ Tendsto (fun x => x ^ y) atTop atTop",
"tactic": "rw [tendsto_atTop_atTop]"
},
{
"state_after": "y : ℝ\nhy : 0 < y\nb : ℝ\n⊢ ∃ i, ∀ (a : ℝ), i ≤ a → b ≤ a ^ y",
"state_... | [
48,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
38,
1
] |
Std/Data/List/Lemmas.lean | List.mem_inter_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : DecidableEq α\nx : α\nl₁ l₂ : List α\n⊢ x ∈ List.inter l₁ l₂ ↔ x ∈ l₁ ∧ x ∈ l₂",
"tactic": "cases l₁ <;> simp [List.inter, mem_filter]"
}
] | [
1445,
45
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1443,
9
] |
Mathlib/Topology/Algebra/Polynomial.lean | Polynomial.continuousAt_aeval | [] | [
88,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
11
] |
Mathlib/Logic/Nonempty.lean | Nonempty.exists | [] | [
116,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Data/Finset/Sups.lean | Finset.disjSups_left_comm | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝³ : DecidableEq α\ninst✝² : DistribLattice α\ninst✝¹ : OrderBot α\ninst✝ : DecidableRel Disjoint\ns t u v : Finset α\n⊢ s ○ (t ○ u) = t ○ (s ○ u)",
"tactic": "simp_rw [← disjSups_assoc, disjSups_comm s]"
}
] | [
547,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
546,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.C_1 | [] | [
503,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
502,
1
] |
Mathlib/Logic/Function/Basic.lean | Function.Involutive.ite_not | [
{
"state_after": "no goals",
"state_before": "α : Sort u\nf : α → α\nh : Involutive f\nP : Prop\ninst✝ : Decidable P\nx : α\n⊢ f (if P then x else f x) = if ¬P then x else f x",
"tactic": "rw [apply_ite f, h, ite_not]"
}
] | [
907,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
906,
11
] |
Mathlib/Analysis/Complex/CauchyIntegral.lean | DiffContOnCl.two_pi_i_inv_smul_circleIntegral_sub_inv_smul | [
{
"state_after": "E : Type u\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℂ E\ninst✝ : CompleteSpace E\nR : ℝ\nc w : ℂ\nf : ℂ → E\nhf : DiffContOnCl ℂ f (ball c R)\nhw : w ∈ ball c R\nhR : 0 < R\n⊢ ((2 * ↑π * I)⁻¹ • ∮ (z : ℂ) in C(c, R), (z - w)⁻¹ • f z) = f w",
"state_before": "E : Type u\ninst✝² :... | [
531,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
524,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/CommSq.lean | CategoryTheory.IsPullback.isoPullback_inv_snd | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nP X Y Z : C\nfst : P ⟶ X\nsnd : P ⟶ Y\nf : X ⟶ Z\ng : Y ⟶ Z\nh : IsPullback fst snd f g\ninst✝ : HasPullback f g\n⊢ (isoPullback h).inv ≫ snd = pullback.snd",
"tactic": "simp [Iso.inv_comp_eq]"
}
] | [
308,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
307,
1
] |
Mathlib/Algebra/Hom/Equiv/Basic.lean | MulEquiv.ofBijective_apply_symm_apply | [] | [
571,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
569,
1
] |
Mathlib/LinearAlgebra/Lagrange.lean | Polynomial.eq_of_degrees_lt_of_eval_index_eq | [
{
"state_after": "R : Type u_2\ninst✝¹ : CommRing R\ninst✝ : IsDomain R\nf g : R[X]\nι : Type u_1\nv : ι → R\ns : Finset ι\nhvs : Set.InjOn v ↑s\ndegree_f_lt : degree f < ↑(card s)\ndegree_g_lt : degree g < ↑(card s)\neval_fg : ∀ (i : ι), i ∈ s → eval (v i) f = eval (v i) g\n⊢ degree (f - g) < ↑(card s)",
"... | [
104,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Order/JordanHolder.lean | CompositionSeries.isMaximal_eraseTop_top | [
{
"state_after": "X : Type u\ninst✝¹ : Lattice X\ninst✝ : JordanHolderLattice X\ns : CompositionSeries X\nh : 0 < s.length\nthis : s.length - 1 + 1 = s.length\n⊢ IsMaximal (top (eraseTop s)) (top s)",
"state_before": "X : Type u\ninst✝¹ : Lattice X\ninst✝ : JordanHolderLattice X\ns : CompositionSeries X\nh ... | [
449,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
444,
1
] |
Mathlib/MeasureTheory/Decomposition/Lebesgue.lean | MeasureTheory.Measure.LebesgueDecomposition.zero_mem_measurableLE | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.86195\nm : MeasurableSpace α\nμ ν : Measure α\nA : Set α\nx✝ : MeasurableSet A\n⊢ (∫⁻ (x : α) in A, OfNat.ofNat 0 x ∂μ) ≤ ↑↑ν A",
"tactic": "simp"
}
] | [
466,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
465,
1
] |
Mathlib/Data/Fintype/Basic.lean | Multiset.count_univ | [] | [
1194,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1193,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean | Real.continuous_arctan | [] | [
210,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/Geometry/Euclidean/Sphere/Power.lean | InnerProductGeometry.mul_norm_eq_abs_sub_sq_norm | [
{
"state_after": "case intro.intro\nV : Type u_1\ninst✝¹ : NormedAddCommGroup V\ninst✝ : InnerProductSpace ℝ V\nx y z : V\nh₂ : ‖z - y‖ = ‖z + y‖\nk : ℝ\nhk_ne_one : k ≠ 1\nhk : x + y = k • (x - y)\n⊢ ‖x - y‖ * ‖x + y‖ = abs (‖z + y‖ ^ 2 - ‖z - x‖ ^ 2)",
"state_before": "V : Type u_1\ninst✝¹ : NormedAddComm... | [
67,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
43,
1
] |
Mathlib/Analysis/Normed/Group/AddTorsor.lean | continuous_vsub | [] | [
274,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
1
] |
Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | intervalIntegral.integral_hasFDerivWithinAt | [] | [
865,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
858,
1
] |
Mathlib/Topology/Algebra/UniformRing.lean | UniformSpace.Completion.coe_mul | [] | [
73,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/CategoryTheory/Adjunction/Opposites.lean | CategoryTheory.Adjunction.rightAdjointUniq_inv_app | [] | [
291,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
289,
1
] |
Mathlib/Algebra/Tropical/BigOperators.lean | untrop_sum_eq_sInf_image | [
{
"state_after": "case inl\nR : Type u_1\nS : Type u_2\ninst✝ : ConditionallyCompleteLinearOrder R\nf : S → Tropical (WithTop R)\n⊢ untrop (∑ i in ∅, f i) = sInf (untrop ∘ f '' ↑∅)\n\ncase inr\nR : Type u_1\nS : Type u_2\ninst✝ : ConditionallyCompleteLinearOrder R\ns : Finset S\nf : S → Tropical (WithTop R)\nh ... | [
135,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.disjoint_singleton | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.75361\nγ : Type ?u.75364\nf : α → β\ns t u : Finset α\na b : α\n⊢ _root_.Disjoint {a} {b} ↔ a ≠ b",
"tactic": "rw [disjoint_singleton_left, mem_singleton]"
}
] | [
969,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
968,
1
] |
Mathlib/Data/List/Perm.lean | List.Perm.append | [] | [
124,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/LinearAlgebra/Matrix/BilinearForm.lean | BilinForm.nondegenerate_toMatrix'_iff | [] | [
578,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
576,
1
] |
Mathlib/Data/Prod/Basic.lean | Prod.map_leftInverse | [
{
"state_after": "α : Type u_4\nβ : Type u_1\nγ : Type u_3\nδ : Type u_2\ninst✝¹ : Nonempty β\ninst✝ : Nonempty δ\nf₁ : α → β\ng₁ : γ → δ\nf₂ : β → α\ng₂ : δ → γ\nh : LeftInverse (map f₁ g₁) (map f₂ g₂)\nb : β\ninhabited_h : Inhabited δ\n⊢ f₁ (f₂ b) = b",
"state_before": "α : Type u_4\nβ : Type u_1\nγ : Typ... | [
397,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
388,
1
] |
Mathlib/Order/Filter/Pi.lean | Filter.mem_pi_of_mem | [] | [
67,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | normalize_zero | [] | [
142,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/Analysis/Asymptotics/Theta.lean | Asymptotics.IsTheta.inv | [] | [
234,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
232,
1
] |
Mathlib/MeasureTheory/Measure/AEMeasurable.lean | AEMeasurable.mono_set | [] | [
55,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_mk | [] | [
71,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.hasBasis_self | [
{
"state_after": "α : Type u_1\nβ : Type ?u.22063\nγ : Type ?u.22066\nι : Sort ?u.22069\nι' : Sort ?u.22072\nl✝ l' : Filter α\np : ι → Prop\ns : ι → Set α\nt : Set α\ni : ι\np' : ι' → Prop\ns' : ι' → Set α\ni' : ι'\nl : Filter α\nP : Set α → Prop\n⊢ (∀ (t : Set α), t ∈ l ↔ ∃ i, i ∈ l ∧ P i ∧ i ⊆ t) ↔ ∀ (t : Set... | [
418,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
414,
1
] |
Mathlib/Algebra/Hom/Iterate.lean | zpow_iterate | [] | [
225,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
220,
1
] |
Mathlib/Deprecated/Ring.lean | IsRingHom.map_zero | [
{
"state_after": "α : Type u\nβ : Type v\ninst✝¹ : Ring α\ninst✝ : Ring β\nf : α → β\nhf✝ : IsRingHom f\nx y : α\nhf : IsRingHom f\n⊢ f 0 = f 0 + f 0 - f 0",
"state_before": "α : Type u\nβ : Type v\ninst✝¹ : Ring α\ninst✝ : Ring β\nf : α → β\nhf✝ : IsRingHom f\nx y : α\nhf : IsRingHom f\n⊢ f 0 = f (0 + 0) -... | [
107,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/WideEqualizers.lean | CategoryTheory.Limits.epi_of_isColimit_parallelFamily | [] | [
774,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
772,
1
] |
Mathlib/FieldTheory/RatFunc.lean | RatFunc.eval_add | [
{
"state_after": "K : Type u\ninst✝¹ : Field K\nL : Type u_1\ninst✝ : Field L\nf : K →+* L\na : L\nx y : RatFunc K\nhx : Polynomial.eval₂ f a (denom x) ≠ 0\nhy : Polynomial.eval₂ f a (denom y) ≠ 0\n⊢ Polynomial.eval₂ f a (num (x + y)) / Polynomial.eval₂ f a (denom (x + y)) =\n Polynomial.eval₂ f a (num x) / ... | [
1530,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1519,
1
] |
Mathlib/Analysis/Normed/Group/Pointwise.lean | ball_mul_one | [
{
"state_after": "no goals",
"state_before": "E : Type u_1\ninst✝ : SeminormedCommGroup E\nε δ : ℝ\ns t : Set E\nx y : E\n⊢ ball 1 δ * s = thickening δ s",
"tactic": "rw [mul_comm, mul_ball_one]"
}
] | [
222,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
222,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean | EuclideanGeometry.cos_eq_neg_one_iff_angle_eq_pi | [] | [
495,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
493,
8
] |
Mathlib/CategoryTheory/Abelian/Projective.lean | CategoryTheory.ProjectiveResolution.ofComplex_sq_10_comm | [
{
"state_after": "C : Type u\ninst✝² : Category C\ninst✝¹ : Abelian C\ninst✝ : EnoughProjectives C\nZ : C\n⊢ 0 =\n (ChainComplex.mkAux (over Z) (syzygies (Projective.π Z)) (syzygies (d (Projective.π Z))) (d (Projective.π Z))\n (d (d (Projective.π Z)))\n (_ :\n {\n ... | [
121,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Analysis/Calculus/Deriv/Add.lean | deriv_sub | [] | [
323,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
321,
1
] |
Mathlib/Data/Pi/Algebra.lean | Pi.const_one | [] | [
63,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/NumberTheory/Padics/PadicVal.lean | padicValNat.div_of_dvd | [
{
"state_after": "case inl\np b : ℕ\nhp : Fact (Nat.Prime p)\nh : b ∣ 0\n⊢ padicValNat p (0 / b) = padicValNat p 0 - padicValNat p b\n\ncase inr\np a b : ℕ\nhp : Fact (Nat.Prime p)\nh : b ∣ a\nha : a ≠ 0\n⊢ padicValNat p (a / b) = padicValNat p a - padicValNat p b",
"state_before": "p a b : ℕ\nhp : Fact (Na... | [
417,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
411,
11
] |
Mathlib/Analysis/NormedSpace/FiniteDimension.lean | summable_norm_iff | [
{
"state_after": "α : Type u_1\nE : Type u_2\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℝ E\ninst✝ : FiniteDimensional ℝ E\nf : α → E\nhf : Summable f\n⊢ Summable fun x => ‖f x‖",
"state_before": "α : Type u_1\nE : Type u_2\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℝ E\ninst✝ : FiniteDi... | [
680,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
659,
1
] |
Mathlib/CategoryTheory/Skeletal.lean | CategoryTheory.functor_skeletal | [] | [
73,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | Summable.summable_compl_iff | [] | [
869,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
866,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.mapRange.equiv_refl | [] | [
159,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/Order/Heyting/Hom.lean | BiheytingHom.comp_id | [] | [
597,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
596,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/WideEqualizers.lean | CategoryTheory.Limits.hasWideCoequalizers_of_hasColimit_parallelFamily | [] | [
806,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
803,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.toList_node | [
{
"state_after": "α : Type u_1\ns : ℕ\nl : Ordnode α\nx : α\nr : Ordnode α\n⊢ toList l ++ x :: foldr List.cons r [] = toList l ++ x :: toList r",
"state_before": "α : Type u_1\ns : ℕ\nl : Ordnode α\nx : α\nr : Ordnode α\n⊢ toList (node s l x r) = toList l ++ x :: toList r",
"tactic": "rw [toList, foldr,... | [
547,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
546,
1
] |
Mathlib/Geometry/Euclidean/Inversion.lean | EuclideanGeometry.inversion_involutive | [] | [
93,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/ModelTheory/Semantics.lean | FirstOrder.Language.Equiv.realize_formula | [
{
"state_after": "no goals",
"state_before": "L : Language\nL' : Language\nM : Type w\nN : Type u_1\nP : Type ?u.653346\ninst✝² : Structure L M\ninst✝¹ : Structure L N\ninst✝ : Structure L P\nα : Type u'\nβ : Type v'\nn : ℕ\nT : Theory L\ng : M ≃[L] N\nφ : Formula L α\nv : α → M\n⊢ Formula.Realize φ (↑g ∘ v... | [
974,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
971,
1
] |
Mathlib/Data/Polynomial/UnitTrinomial.lean | Polynomial.trinomial_trailing_coeff' | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nk m n : ℕ\nu v w : R\nhkm : k < m\nhmn : m < n\n⊢ coeff (trinomial k m n u v w) k = u",
"tactic": "rw [trinomial_def, coeff_add, coeff_add, coeff_C_mul_X_pow, coeff_C_mul_X_pow, coeff_C_mul_X_pow,\n if_pos rfl, if_neg hkm.n... | [
67,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | contDiffOn_top_iff_deriv_of_open | [
{
"state_after": "𝕜 : Type u_1\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✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : Normed... | [
2118,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2115,
1
] |
Mathlib/Analysis/Calculus/LagrangeMultipliers.lean | IsLocalExtrOn.range_ne_top_of_hasStrictFDerivAt | [
{
"state_after": "E : Type u_1\nF : Type u_2\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace ℝ E\ninst✝³ : CompleteSpace E\ninst✝² : NormedAddCommGroup F\ninst✝¹ : NormedSpace ℝ F\ninst✝ : CompleteSpace F\nf : E → F\nφ : E → ℝ\nx₀ : E\nf' : E →L[ℝ] F\nφ' : E →L[ℝ] ℝ\nhextr : IsLocalExtrOn φ {x | f x = f x₀... | [
55,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
46,
1
] |
Mathlib/Data/Set/NAry.lean | Set.image_image2_distrib | [
{
"state_after": "no goals",
"state_before": "α : Type u_3\nα' : Type u_5\nβ : Type u_4\nβ' : Type u_6\nγ : Type u_2\nγ' : Type ?u.43409\nδ : Type u_1\nδ' : Type ?u.43415\nε : Type ?u.43418\nε' : Type ?u.43421\nζ : Type ?u.43424\nζ' : Type ?u.43427\nν : Type ?u.43430\nf f'✝ : α → β → γ\ng✝ g' : α → β → γ → ... | [
348,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
345,
1
] |
Mathlib/Data/Complex/Basic.lean | Complex.AbsTheory.abs_mul | [
{
"state_after": "no goals",
"state_before": "z w : ℂ\n⊢ Real.sqrt (↑normSq (z * w)) = Real.sqrt (↑normSq z) * Real.sqrt (↑normSq w)",
"tactic": "rw [normSq_mul, Real.sqrt_mul (normSq_nonneg _)]"
}
] | [
924,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
923,
9
] |
Mathlib/Data/Set/Image.lean | Set.preimage_congr | [
{
"state_after": "case h\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.8381\nι : Sort ?u.8384\nι' : Sort ?u.8387\nf✝ : α → β\ng✝ : β → γ\nf g : α → β\ns : Set β\nh : ∀ (x : α), f x = g x\nx : α\n⊢ x ∈ f ⁻¹' s ↔ x ∈ g ⁻¹' s",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.8381\nι : Sort ?u.8384\nι' : So... | [
73,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/MeasureTheory/Measure/Content.lean | MeasureTheory.Content.outerMeasure_of_isOpen | [] | [
263,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
1
] |
Mathlib/Data/Fin/Tuple/Basic.lean | Fin.cons_right_injective | [] | [
118,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/Analysis/Seminorm.lean | Seminorm.smul_closedBall_zero | [
{
"state_after": "R : Type ?u.1205076\nR' : Type ?u.1205079\n𝕜 : Type u_1\n𝕜₂ : Type ?u.1205085\n𝕜₃ : Type ?u.1205088\n𝕝 : Type ?u.1205091\nE : Type u_2\nE₂ : Type ?u.1205097\nE₃ : Type ?u.1205100\nF : Type ?u.1205103\nG : Type ?u.1205106\nι : Type ?u.1205109\ninst✝² : NormedField 𝕜\ninst✝¹ : AddCommGroup ... | [
970,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
962,
1
] |
Mathlib/Topology/Instances/AddCircle.lean | AddCircle.addOrderOf_eq_pos_iff | [
{
"state_after": "case refine'_1\n𝕜 : Type u_1\nB : Type ?u.220024\ninst✝² : LinearOrderedField 𝕜\ninst✝¹ : TopologicalSpace 𝕜\ninst✝ : OrderTopology 𝕜\np q : 𝕜\nhp : Fact (0 < p)\nu : AddCircle p\nn : ℕ\nh : 0 < n\n⊢ (∃ m, m < n ∧ Nat.gcd m n = 1 ∧ ↑(↑m / ↑n * p) = u) → addOrderOf u = n\n\ncase refine'_2\... | [
444,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
420,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.pred_lt | [] | [
229,
47
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
227,
1
] |
Mathlib/Analysis/Calculus/BumpFunctionInner.lean | ContDiffBump.hasCompactSupport_normed | [
{
"state_after": "no goals",
"state_before": "E : Type u_1\nX : Type ?u.2210912\ninst✝⁹ : NormedAddCommGroup E\ninst✝⁸ : NormedSpace ℝ E\ninst✝⁷ : NormedAddCommGroup X\ninst✝⁶ : NormedSpace ℝ X\ninst✝⁵ : HasContDiffBump E\nc : E\nf : ContDiffBump c\nx : E\nn : ℕ∞\ninst✝⁴ : MeasurableSpace E\nμ : MeasureTheo... | [
545,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
544,
1
] |
Mathlib/Order/Closure.lean | ClosureOperator.idempotent | [] | [
162,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.max_zero_right | [] | [
740,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
739,
1
] |
Mathlib/Dynamics/Ergodic/Conservative.lean | MeasureTheory.Conservative.ae_frequently_mem_of_mem_nhds | [
{
"state_after": "ι : Type ?u.76491\nα : Type u_1\ninst✝³ : MeasurableSpace α\nf✝ : α → α\ns : Set α\nμ✝ : Measure α\ninst✝² : TopologicalSpace α\ninst✝¹ : SecondCountableTopology α\ninst✝ : OpensMeasurableSpace α\nf : α → α\nμ : Measure α\nh : Conservative f μ\nthis : ∀ (s : Set α), s ∈ countableBasis α → ∀ᵐ (... | [
183,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
1
] |
Mathlib/Topology/LocallyConstant/Basic.lean | IsLocallyConstant.comp | [
{
"state_after": "X : Type u_1\nY : Type u_2\nZ : Type u_3\nα : Type ?u.3651\ninst✝ : TopologicalSpace X\nf : X → Y\nhf : IsLocallyConstant f\ng : Y → Z\ns : Set Z\n⊢ IsOpen (f ⁻¹' (g ⁻¹' s))",
"state_before": "X : Type u_1\nY : Type u_2\nZ : Type u_3\nα : Type ?u.3651\ninst✝ : TopologicalSpace X\nf : X → Y... | [
134,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
11
] |
Mathlib/Data/Set/Basic.lean | Set.eq_or_mem_of_mem_insert | [] | [
1121,
5
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1120,
1
] |
Mathlib/Analysis/Normed/Group/AddTorsor.lean | uniformContinuous_vadd | [] | [
262,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | HasStrictFDerivAt.differentiableAt | [] | [
438,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
436,
11
] |
Mathlib/Data/Nat/Dist.lean | Nat.dist_tri_left | [] | [
58,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.nnnorm_def | [] | [
1003,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1003,
1
] |
Mathlib/Analysis/Normed/Ring/Seminorm.lean | MulRingSeminorm.ext | [] | [
259,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
258,
1
] |
Mathlib/Algebra/Homology/ShortExact/Preadditive.lean | CategoryTheory.Splitting.π_section_eq_id_sub | [] | [
290,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
289,
1
] |
Mathlib/LinearAlgebra/UnitaryGroup.lean | Matrix.UnitaryGroup.one_val | [] | [
134,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
9
] |
Mathlib/CategoryTheory/Monoidal/Category.lean | CategoryTheory.MonoidalCategory.prodMonoidal_leftUnitor_inv_snd | [
{
"state_after": "case mk\nC : Type u\n𝒞 : Category C\ninst✝⁴ : MonoidalCategory C\nC₁ : Type u₁\ninst✝³ : Category C₁\ninst✝² : MonoidalCategory C₁\nC₂ : Type u₂\ninst✝¹ : Category C₂\ninst✝ : MonoidalCategory C₂\nfst✝ : C₁\nsnd✝ : C₂\n⊢ (λ_ (fst✝, snd✝)).inv.snd = (λ_ (fst✝, snd✝).snd).inv",
"state_befor... | [
649,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
646,
1
] |
Mathlib/Data/Set/Intervals/Pi.lean | Set.image_mulSingle_Ioc | [] | [
214,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Order/Basic.lean | le_imp_le_iff_lt_imp_lt | [] | [
506,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
504,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.piecewise_cases | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.300214\nγ : Type ?u.300217\nδ : α → Sort u_2\ns : Finset α\nf g : (i : α) → δ i\ninst✝ : (j : α) → Decidable (j ∈ s)\ni : α\np : δ i → Prop\nhf : p (f i)\nhg : p (g i)\n⊢ p (piecewise s f g i)",
"tactic": "by_cases hi : i ∈ s <;> si... | [
2494,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2492,
1
] |
Mathlib/Order/WellFoundedSet.lean | Set.IsWf.le_min_iff | [] | [
647,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
646,
1
] |
Mathlib/Order/InitialSeg.lean | PrincipalSeg.ofElement_top | [] | [
392,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/Order/Bounds/Basic.lean | bddAbove_insert | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\ninst✝² : Preorder α\ninst✝¹ : Preorder β\ns✝ t : Set α\na✝ b : α\ninst✝ : SemilatticeSup γ\na : γ\ns : Set γ\n⊢ BddAbove (insert a s) ↔ BddAbove s",
"tactic": "simp only [insert_eq, bddAbove_union, bddAbove_sin... | [
926,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
924,
1
] |
Mathlib/Computability/PartrecCode.lean | Nat.Partrec.Code.eval_id | [
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ eval Code.id n = Part.some n",
"tactic": "simp! [Seq.seq]"
}
] | [
666,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
666,
1
] |
Mathlib/Logic/Basic.lean | ite_eq_or_eq | [] | [
1219,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1218,
1
] |
Mathlib/Analysis/LocallyConvex/AbsConvex.lean | AbsConvexOpenSets.coe_nhds | [] | [
115,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/Data/Nat/Pow.lean | Nat.mul_lt_mul_pow_succ | [
{
"state_after": "n a q : ℕ\na0 : 0 < a\nq1 : 1 < q\n⊢ n < a * q ^ n",
"state_before": "n a q : ℕ\na0 : 0 < a\nq1 : 1 < q\n⊢ n * q < a * q ^ (n + 1)",
"tactic": "rw [pow_succ, ← mul_assoc, mul_lt_mul_right (zero_lt_one.trans q1)]"
},
{
"state_after": "no goals",
"state_before": "n a q : ℕ\na... | [
126,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Topology/Compactification/OnePoint.lean | OnePoint.not_inseparable_coe_infty | [] | [
419,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
418,
1
] |
Mathlib/MeasureTheory/Measure/Lebesgue/Integral.lean | integral_comp_neg_Iic | [
{
"state_after": "E : Type u_1\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℝ E\ninst✝ : CompleteSpace E\nc : ℝ\nf : ℝ → E\nA : MeasurableEmbedding fun x => -x\n⊢ (∫ (x : ℝ) in Iic c, f (-x)) = ∫ (x : ℝ) in Ioi (-c), f x",
"state_before": "E : Type u_1\ninst✝² : NormedAddCommGroup E\ninst✝¹ : Normed... | [
100,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/Algebra/Lie/Quotient.lean | LieSubmodule.Quotient.mk_bracket | [] | [
138,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/Data/Seq/Computation.lean | Computation.eq_thinkN | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\na : α\nn : ℕ\n⊢ ∀ {s : Computation α}, Results s a n → s = thinkN (pure a) n",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ns : Computation α\na : α\nn : ℕ\nh : Results s a n\n⊢ s = thinkN (pure a) n",
"tactic": "revert s"
},
{
"state... | [
622,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
611,
1
] |
Mathlib/ModelTheory/Semantics.lean | FirstOrder.Language.ElementarilyEquivalent.theory_model | [] | [
1125,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1124,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.