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/Order/Hom/Basic.lean | OrderEmbedding.coe_ofStrictMono | [] | [
728,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
726,
1
] |
Mathlib/Topology/Algebra/Monoid.lean | continuous_mul_left | [] | [
99,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/Data/Option/Basic.lean | Option.joinM_eq_join | [] | [
100,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
99,
1
] |
Mathlib/Analysis/NormedSpace/OperatorNorm.lean | Continuous.prod_map_equivL | [] | [
1080,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1077,
1
] |
Mathlib/Order/CompleteLattice.lean | iInf_pos | [] | [
1086,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1085,
1
] |
Mathlib/RingTheory/GradedAlgebra/HomogeneousIdeal.lean | HomogeneousIdeal.toIdeal_add | [] | [
436,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
435,
1
] |
Mathlib/Topology/Order.lean | TopologicalSpace.nhds_mkOfNhds | [
{
"state_after": "α : Type u\nn : α → Filter α\na : α\nh₀ : pure ≤ n\nh₁ : ∀ (a : α) (s : Set α), s ∈ n a → ∃ t, t ∈ n a ∧ t ⊆ s ∧ ∀ (a' : α), a' ∈ t → s ∈ n a'\nthis : TopologicalSpace α := TopologicalSpace.mkOfNhds n\n⊢ 𝓝 a = n a",
"state_before": "α : Type u\nn : α → Filter α\na : α\nh₀ : pure ≤ n\nh₁ :... | [
123,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
111,
1
] |
Mathlib/Algebra/GroupWithZero/Units/Basic.lean | Ring.inverse_eq_inv | [
{
"state_after": "case inl\nα : Type ?u.20396\nM₀ : Type ?u.20399\nG₀ : Type u_1\nM₀' : Type ?u.20405\nG₀' : Type ?u.20408\nF : Type ?u.20411\nF' : Type ?u.20414\ninst✝¹ : MonoidWithZero M₀\ninst✝ : GroupWithZero G₀\na b c : G₀\n⊢ inverse 0 = 0⁻¹\n\ncase inr\nα : Type ?u.20396\nM₀ : Type ?u.20399\nG₀ : Type u_1... | [
300,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
297,
1
] |
Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean | Complex.arg_cos_add_sin_mul_I_eq_toIocMod | [
{
"state_after": "no goals",
"state_before": "θ : ℝ\n⊢ arg (cos ↑θ + sin ↑θ * I) = toIocMod two_pi_pos (-π) θ",
"tactic": "rw [← one_mul (_ + _), ← ofReal_one, arg_mul_cos_add_sin_mul_I_eq_toIocMod zero_lt_one]"
}
] | [
442,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
440,
1
] |
Mathlib/Topology/Algebra/Module/WeakDual.lean | WeakDual.continuous_of_continuous_eval | [] | [
289,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
287,
1
] |
src/lean/Init/Core.lean | Setoid.refl | [] | [
1095,
15
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
1094,
1
] |
Mathlib/LinearAlgebra/Basis.lean | Basis.equivFun_apply | [] | [
919,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
918,
1
] |
Mathlib/Topology/MetricSpace/ThickenedIndicator.lean | thickenedIndicator_le_one | [
{
"state_after": "α : Type u_1\ninst✝ : PseudoEMetricSpace α\nδ : ℝ\nδ_pos : 0 < δ\nE : Set α\nx : α\n⊢ (ENNReal.toNNReal ∘ thickenedIndicatorAux δ E) x ≤ 1",
"state_before": "α : Type u_1\ninst✝ : PseudoEMetricSpace α\nδ : ℝ\nδ_pos : 0 < δ\nE : Set α\nx : α\n⊢ ↑(thickenedIndicator δ_pos E) x ≤ 1",
"tac... | [
194,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.inf_set_eq_iInter | [] | [
755,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
754,
1
] |
Mathlib/Data/List/Pairwise.lean | List.Pairwise.filter_map | [] | [
218,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
1
] |
Mathlib/Data/Multiset/Pi.lean | Multiset.pi.cons_eta | [
{
"state_after": "case h.h\nα : Type u_1\ninst✝ : DecidableEq α\nβ : α → Type u\nδ : α → Sort v\nm : Multiset α\na : α\nf : (a' : α) → a' ∈ a ::ₘ m → δ a'\na' : α\nh' : a' ∈ a ::ₘ m\n⊢ Pi.cons m a (f a (_ : a ∈ a ::ₘ m)) (fun a' ha' => f a' (_ : a' ∈ a ::ₘ m)) a' h' = f a' h'",
"state_before": "α : Type u_1... | [
71,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/LinearAlgebra/Dimension.lean | rank_quotient_add_rank | [
{
"state_after": "no goals",
"state_before": "K : Type u\nV V₁ V₂ V₃ : Type v\nV' V'₁ : Type v'\nV'' : Type v''\nι : Type w\nι' : Type w'\nη : Type u₁'\nφ : η → Type ?u.574502\ninst✝⁶ : DivisionRing K\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module K V\ninst✝³ : AddCommGroup V'\ninst✝² : Module K V'\ninst✝¹ : Add... | [
1086,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1082,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | abs_inv | [] | [
1001,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1000,
1
] |
Mathlib/Data/Matrix/Reflection.lean | Matrix.vecMulᵣ_eq | [
{
"state_after": "l m n : ℕ\nα : Type u_1\nβ : Type ?u.51370\ninst✝ : NonUnitalNonAssocSemiring α\nv : Fin l → α\nA : Matrix (Fin l) (Fin m) α\n⊢ (fun x => v ⬝ᵥ Aᵀ x) = vecMul v A",
"state_before": "l m n : ℕ\nα : Type u_1\nβ : Type ?u.51370\ninst✝ : NonUnitalNonAssocSemiring α\nv : Fin l → α\nA : Matrix (F... | [
215,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Algebra/Order/Ring/Lemmas.lean | Right.mul_pos | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\na b c d : α\ninst✝² : MulZeroClass α\ninst✝¹ : Preorder α\ninst✝ : MulPosStrictMono α\nha : 0 < a\nhb : 0 < b\n⊢ 0 < a * b",
"tactic": "simpa only [zero_mul] using mul_lt_mul_of_pos_right ha hb"
}
] | [
360,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
359,
1
] |
Mathlib/RingTheory/WittVector/WittPolynomial.lean | wittPolynomial_vars_subset | [
{
"state_after": "p : ℕ\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : DecidableEq R\nS : Type ?u.160515\ninst✝ : CommRing S\nhp : NeZero p\nn : ℕ\n⊢ vars (↑(map (Int.castRingHom R)) (W_ ℤ n)) ⊆ vars (W_ ℤ n)",
"state_before": "p : ℕ\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : DecidableEq R\nS : Type ?u.1605... | [
193,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
191,
1
] |
Mathlib/MeasureTheory/MeasurableSpace.lean | MeasurableSet.measurableSet_liminf | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.912543\nγ : Type ?u.912546\nδ : Type ?u.912549\nδ' : Type ?u.912552\nι : Sort uι\ns✝ t u : Set α\ninst✝ : MeasurableSpace α\ns : ℕ → Set α\nhs : ∀ (n : ℕ), MeasurableSet (s n)\n⊢ MeasurableSet (liminf s atTop)",
"tactic": "simpa onl... | [
1913,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1911,
1
] |
Mathlib/Algebra/Quaternion.lean | QuaternionAlgebra.star_eq_two_re_sub | [] | [
662,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
661,
1
] |
Mathlib/Analysis/NormedSpace/MStructure.lean | IsLprojection.coe_top | [] | [
260,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
257,
1
] |
Mathlib/Topology/SubsetProperties.lean | ClosedEmbedding.noncompactSpace | [] | [
935,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
933,
11
] |
Mathlib/RingTheory/TensorProduct.lean | Algebra.TensorProduct.basisAux_map_smul | [
{
"state_after": "no goals",
"state_before": "k : Type u_1\ninst✝⁴ : CommRing k\nR : Type u_2\ninst✝³ : Ring R\ninst✝² : Algebra k R\nM : Type u_3\ninst✝¹ : AddCommMonoid M\ninst✝ : Module k M\nι : Type u_4\nb : Basis ι k M\nr : R\nx : R ⊗[k] M\n⊢ ↑(basisAux R b) (r • 0) = r • ↑(basisAux R b) 0",
"tacti... | [
1043,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1040,
1
] |
Mathlib/FieldTheory/Subfield.lean | Subfield.closure_eq_of_le | [] | [
731,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
729,
1
] |
Std/Data/String/Lemmas.lean | String.utf8Len_reverseAux | [
{
"state_after": "no goals",
"state_before": "cs₁ cs₂ : List Char\n⊢ utf8Len (List.reverseAux cs₁ cs₂) = utf8Len cs₁ + utf8Len cs₂",
"tactic": "induction cs₁ generalizing cs₂ <;> simp [*, ← Nat.add_assoc, Nat.add_right_comm]"
}
] | [
56,
83
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
54,
9
] |
Mathlib/Analysis/SpecialFunctions/Pow/Real.lean | Real.rpow_lt_one_of_one_lt_of_neg | [
{
"state_after": "case h.e'_4\nx✝ y z✝ x z : ℝ\nhx : 1 < x\nhz : z < 0\n⊢ 1 = x ^ 0",
"state_before": "x✝ y z✝ x z : ℝ\nhx : 1 < x\nhz : z < 0\n⊢ x ^ z < 1",
"tactic": "convert rpow_lt_rpow_of_exponent_lt hx hz"
},
{
"state_after": "no goals",
"state_before": "case h.e'_4\nx✝ y z✝ x z : ℝ\nh... | [
526,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
524,
1
] |
Mathlib/Data/PNat/Find.lean | PNat.le_find_iff | [
{
"state_after": "no goals",
"state_before": "p q : ℕ+ → Prop\ninst✝¹ : DecidablePred p\ninst✝ : DecidablePred q\nh : ∃ n, p n\nn✝ m n : ℕ+\n⊢ n ≤ PNat.find h ↔ ∀ (m : ℕ+), m < n → ¬p m",
"tactic": "simp only [← not_lt, find_lt_iff, not_exists, not_and]"
}
] | [
97,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
1
] |
Mathlib/NumberTheory/LucasLehmer.lean | LucasLehmer.sZMod_eq_sMod | [
{
"state_after": "no goals",
"state_before": "p i : ℕ\n⊢ sZMod p i = ↑(sMod p i)",
"tactic": "induction i <;> push_cast [← Int.coe_nat_two_pow_pred p, sMod, sZMod, *] <;> rfl"
}
] | [
141,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/CategoryTheory/Subobject/Lattice.lean | CategoryTheory.Subobject.top_factors | [] | [
258,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
257,
1
] |
Mathlib/Analysis/Normed/Group/Quotient.lean | NormedAddGroupHom.lift_normNoninc | [
{
"state_after": "M : Type u_2\nN✝ : Type ?u.479189\ninst✝² : SeminormedAddCommGroup M\ninst✝¹ : SeminormedAddCommGroup N✝\nN : Type u_1\ninst✝ : SeminormedAddCommGroup N\nS : AddSubgroup M\nf : NormedAddGroupHom M N\nhf : ∀ (s : M), s ∈ S → ↑f s = 0\nfb : NormNoninc f\nx : M ⧸ S\nfb' : ‖f‖ ≤ ↑1\n⊢ ‖↑(lift S f ... | [
420,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
416,
1
] |
Mathlib/LinearAlgebra/Matrix/Charpoly/Basic.lean | Matrix.aeval_self_charpoly | [
{
"state_after": "R : Type u\ninst✝² : CommRing R\nn : Type w\ninst✝¹ : DecidableEq n\ninst✝ : Fintype n\nM : Matrix n n R\nh : charpoly M • 1 = adjugate (charmatrix M) * charmatrix M\n⊢ ↑(aeval M) (charpoly M) = 0",
"state_before": "R : Type u\ninst✝² : CommRing R\nn : Type w\ninst✝¹ : DecidableEq n\ninst✝... | [
132,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Basic.lean | Real.log_nonpos_iff | [
{
"state_after": "no goals",
"state_before": "x y : ℝ\nhx : 0 < x\n⊢ log x ≤ 0 ↔ x ≤ 1",
"tactic": "rw [← not_lt, log_pos_iff hx, not_lt]"
}
] | [
195,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearMap.commute_pow_left_of_commute | [
{
"state_after": "case zero\nR : Type u_1\nR₁ : Type ?u.149423\nR₂ : Type u_2\nR₃ : Type ?u.149429\nR₄ : Type ?u.149432\nS : Type ?u.149435\nK : Type ?u.149438\nK₂ : Type ?u.149441\nM : Type u_3\nM' : Type ?u.149447\nM₁ : Type ?u.149450\nM₂ : Type u_4\nM₃ : Type ?u.149456\nM₄ : Type ?u.149459\nN : Type ?u.14946... | [
344,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
339,
1
] |
Mathlib/MeasureTheory/Integral/Bochner.lean | MeasureTheory.weightedSMul_empty | [
{
"state_after": "case h\nα : Type u_1\nE : Type ?u.19408\nF : Type u_2\n𝕜 : Type ?u.19414\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedSpace ℝ F\nm✝ : MeasurableSpace α\nμ✝ : Measure α\nm : MeasurableSpace α\nμ : Measure α\nx : F\n⊢ ↑(weightedSMul μ ∅) x = ↑0 x",
"state_before": "α : Type u_1\nE : Type ?... | [
184,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/NumberTheory/SumFourSquares.lean | Int.lt_of_sum_four_squares_eq_mul | [
{
"state_after": "a b c d k m : ℕ\nh : a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = k * m\nha : 2 * a < m\nhb : 2 * b < m\nhc : 2 * c < m\nhd : 2 * d < m\n⊢ 2 ^ 2 * (k * m) < 2 ^ 2 * (m * m)",
"state_before": "a b c d k m : ℕ\nh : a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = k * m\nha : 2 * a < m\nhb : 2 * b < m\nhc : 2 * c < m\nhd ... | [
81,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/FieldTheory/Fixed.lean | FixedPoints.minpoly.eval₂ | [
{
"state_after": "M : Type u\ninst✝⁵ : Monoid M\nG : Type u\ninst✝⁴ : Group G\nF : Type v\ninst✝³ : Field F\ninst✝² : MulSemiringAction M F\ninst✝¹ : MulSemiringAction G F\nm : M\ninst✝ : Fintype G\nx : F\n⊢ Polynomial.eval x (Polynomial.map (Subring.subtype (subfield G F).toSubring) (minpoly G F x)) =\n Pol... | [
197,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Topology/Perfect.lean | preperfect_iff_perfect_closure | [
{
"state_after": "case mp\nα : Type u_1\ninst✝¹ : TopologicalSpace α\nC : Set α\ninst✝ : T1Space α\nh : Preperfect C\n⊢ Perfect (closure C)\n\ncase mpr\nα : Type u_1\ninst✝¹ : TopologicalSpace α\nC : Set α\ninst✝ : T1Space α\nh : Perfect (closure C)\n⊢ Preperfect C",
"state_before": "α : Type u_1\ninst✝¹ : ... | [
127,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/FieldTheory/Subfield.lean | Subfield.coe_add | [] | [
367,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
366,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/SubboxInduction.lean | BoxIntegral.Prepartition.exists_tagged_le_isHenstock_isSubordinate_iUnion_eq | [
{
"state_after": "ι : Type u_1\ninst✝ : Fintype ι\nI✝ J I : Box ι\nr : (ι → ℝ) → ↑(Set.Ioi 0)\nπ : Prepartition I\nthis :\n ∀ (J : Box ι),\n ∃ π,\n TaggedPrepartition.IsPartition π ∧\n IsHenstock π ∧\n IsSubordinate π r ∧\n (∀ (J_1 : Box ι),\n J_1 ∈ π → ∃ m, ∀ ... | [
165,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/MeasureTheory/Integral/MeanInequalities.lean | ENNReal.lintegral_mul_le_one_of_lintegral_rpow_eq_one | [
{
"state_after": "α : Type u_1\ninst✝ : MeasurableSpace α\nμ : MeasureTheory.Measure α\np q : ℝ\nhpq : Real.IsConjugateExponent p q\nf g : α → ℝ≥0∞\nhf : AEMeasurable f\nhf_norm : (∫⁻ (a : α), f a ^ p ∂μ) = 1\nhg_norm : (∫⁻ (a : α), g a ^ q ∂μ) = 1\n⊢ (∫⁻ (a : α), f a ^ p * (ENNReal.ofReal p)⁻¹ + g a ^ q * (ENN... | [
77,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.coe_singletonMonoidHom | [] | [
815,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
814,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.filter_lt_le_eq_Ioc | [
{
"state_after": "case a\nι : Type ?u.37672\nα : Type u_1\ninst✝³ : Preorder α\ninst✝² : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\ninst✝¹ : Fintype α\ninst✝ : DecidablePred fun j => a < j ∧ j ≤ b\na✝ : α\n⊢ a✝ ∈ filter (fun j => a < j ∧ j ≤ b) univ ↔ a✝ ∈ Ioc a b",
"state_before": "ι : Type ?u.37672\nα... | [
375,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
372,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.cof_lsub_le_lift | [
{
"state_after": "α : Type ?u.22098\nr : α → α → Prop\nι : Type u\nf : ι → Ordinal\n⊢ cof (lsub f) ≤ (#ULift ι)",
"state_before": "α : Type ?u.22098\nr : α → α → Prop\nι : Type u\nf : ι → Ordinal\n⊢ cof (lsub f) ≤ Cardinal.lift (#ι)",
"tactic": "rw [← mk_uLift.{u, v}]"
},
{
"state_after": "case ... | [
317,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
311,
1
] |
Mathlib/Data/Matrix/DMatrix.lean | DMatrix.map_add | [
{
"state_after": "case a\nl : Type ?u.19439\nm : Type u_1\nn : Type u_2\no : Type ?u.19448\ninst✝⁵ : Fintype l\ninst✝⁴ : Fintype m\ninst✝³ : Fintype n\ninst✝² : Fintype o\nα : m → n → Type v\ninst✝¹ : (i : m) → (j : n) → AddMonoid (α i j)\nβ : m → n → Type w\ninst✝ : (i : m) → (j : n) → AddMonoid (β i j)\nf : ⦃... | [
153,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/GroupTheory/Submonoid/Basic.lean | Submonoid.mem_carrier | [] | [
174,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.cast_sub' | [] | [
389,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
388,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.hasPullback_of_left_iso | [] | [
1648,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1647,
1
] |
Mathlib/Analysis/Normed/Group/AddTorsor.lean | edist_vsub_vsub_le | [
{
"state_after": "α : Type ?u.29026\nV : Type u_1\nP : Type u_2\nW : Type ?u.29035\nQ : Type ?u.29038\ninst✝⁵ : SeminormedAddCommGroup V\ninst✝⁴ : PseudoMetricSpace P\ninst✝³ : NormedAddTorsor V P\ninst✝² : NormedAddCommGroup W\ninst✝¹ : MetricSpace Q\ninst✝ : NormedAddTorsor W Q\np₁ p₂ p₃ p₄ : P\n⊢ ↑(nndist (p... | [
206,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.Prime.pow_not_prime | [] | [
601,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
594,
1
] |
Mathlib/Analysis/InnerProductSpace/Symmetric.lean | LinearMap.IsSymmetric.inner_map_polarization | [
{
"state_after": "case inl\n𝕜 : Type u_1\nE : Type u_2\nE' : Type ?u.137322\nF : Type ?u.137325\nG : Type ?u.137328\ninst✝⁸ : IsROrC 𝕜\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : InnerProductSpace 𝕜 E\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : InnerProductSpace 𝕜 F\ninst✝³ : NormedAddCommGroup G\ninst✝² : InnerP... | [
187,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/Data/Set/Intervals/OrdConnected.lean | Set.OrdConnected.preimage_mono | [] | [
71,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/Topology/ContinuousFunction/Compact.lean | BoundedContinuousFunction.mkOfCompact_star | [] | [
535,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
533,
1
] |
Mathlib/Logic/Equiv/List.lean | Denumerable.list_ofNat_succ | [
{
"state_after": "case mk\nα : Type u_1\nβ : Type ?u.39088\ninst✝¹ : Denumerable α\ninst✝ : Denumerable β\nv v₁ v₂ : ℕ\ne : unpair v = (v₁, v₂)\n⊢ decodeList (succ v) = some (ofNat α (v₁, v₂).fst :: ofNat (List α) (v₁, v₂).snd)",
"state_before": "α : Type u_1\nβ : Type ?u.39088\ninst✝¹ : Denumerable α\ninst... | [
283,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/Logic/Function/Iterate.lean | Function.iterate_mul | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nf : α → α\nm : ℕ\n⊢ f^[m * 0] = f^[m]^[0]",
"tactic": "simp only [Nat.mul_zero, iterate_zero]"
},
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nf : α → α\nm n : ℕ\n⊢ f^[m * (n + 1)] = f^[m]^[n + 1]"... | [
84,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/Algebra/Lie/Subalgebra.lean | LieSubalgebra.add_mem | [] | [
137,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
136,
11
] |
Mathlib/Algebra/Star/CHSH.lean | CHSH_id | [
{
"state_after": "R : Type u\ninst✝ : CommRing R\nA₀ A₁ B₀ B₁ : R\nA₀_inv : A₀ ^ 2 = 1\nA₁_inv : A₁ ^ 2 = 1\nB₀_inv : B₀ ^ 2 = 1\nB₁_inv : B₁ ^ 2 = 1\n⊢ (2 - A₀ * B₀ - A₀ * B₁ - A₁ * B₀ + A₁ * B₁) * (2 - A₀ * B₀ - A₀ * B₁ - A₁ * B₀ + A₁ * B₁) -\n 4 * (2 - A₀ * B₀ - A₀ * B₁ - A₁ * B₀ + A₁ * B₁) =\n 0",
... | [
118,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
106,
1
] |
Mathlib/Analysis/Calculus/TangentCone.lean | uniqueDiffOn_Icc | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.179894\ninst✝⁶ : NontriviallyNormedField 𝕜\nE : Type ?u.179900\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\nF : Type ?u.179995\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nG : Type ?u.180085\ninst✝¹ : NormedAddCommGroup ... | [
432,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
431,
1
] |
Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean | AffineBasis.finite | [] | [
774,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
773,
11
] |
Mathlib/Topology/Separation.lean | pairwise_disjoint_nhds | [] | [
892,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
891,
1
] |
Mathlib/SetTheory/Ordinal/Exponential.lean | Ordinal.log_zero_left | [] | [
280,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.Equiv.symm | [] | [
613,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
612,
1
] |
Mathlib/Data/List/Chain.lean | List.Chain'.left_of_append | [] | [
302,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/Data/Polynomial/Div.lean | Polynomial.pow_rootMultiplicity_dvd | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nT : Type w\nA : Type z\na✝ b : R\nn : ℕ\ninst✝ : CommRing R\np✝ q p : R[X]\na : R\nh : p = 0\n⊢ (X - ↑C a) ^ rootMultiplicity a p ∣ p",
"tactic": "simp [h]"
},
{
"state_after": "R : Type u\nS : Type v\nT : Type w\nA : Type z\n... | [
591,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
588,
1
] |
Mathlib/Order/SemiconjSup.lean | IsOrderRightAdjoint.unique | [] | [
64,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
11
] |
Mathlib/Data/List/Pairwise.lean | List.Pairwise.map | [] | [
196,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.summable_measure_toReal | [
{
"state_after": "case hsum\nα : Type u_1\nβ : Type ?u.645610\nγ : Type ?u.645613\nδ : Type ?u.645616\nι : Type ?u.645619\nR : Type ?u.645622\nR' : Type ?u.645625\nm0 : MeasurableSpace α\ninst✝¹ : MeasurableSpace β\ninst✝ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set α\nhμ : IsFiniteMeasu... | [
3158,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3153,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean | Real.arctan_eq_of_tan_eq | [
{
"state_after": "no goals",
"state_before": "x y : ℝ\nh : tan x = y\nhx : x ∈ Ioo (-(π / 2)) (π / 2)\n⊢ tan (arctan y) = tan x",
"tactic": "rw [tan_arctan, h]"
}
] | [
180,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
178,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.lintegral_add_compl | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.1028581\nγ : Type ?u.1028584\nδ : Type ?u.1028587\nm : MeasurableSpace α\nμ ν : Measure α\nf : α → ℝ≥0∞\nA : Set α\nhA : MeasurableSet A\n⊢ ((∫⁻ (x : α) in A, f x ∂μ) + ∫⁻ (x : α) in Aᶜ, f x ∂μ) = ∫⁻ (x : α), f x ∂μ",
"tactic": "rw ... | [
1239,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1237,
1
] |
Mathlib/Algebra/CharZero/Lemmas.lean | Nat.cast_div_charZero | [
{
"state_after": "case inl\nR : Type ?u.1348\ninst✝³ : AddMonoidWithOne R\ninst✝² : CharZero R\nk : Type u_1\ninst✝¹ : DivisionSemiring k\ninst✝ : CharZero k\nm : ℕ\nn_dvd : 0 ∣ m\n⊢ ↑(m / 0) = ↑m / ↑0\n\ncase inr\nR : Type ?u.1348\ninst✝³ : AddMonoidWithOne R\ninst✝² : CharZero R\nk : Type u_1\ninst✝¹ : Divisi... | [
51,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
47,
1
] |
Mathlib/Data/PNat/Factors.lean | PrimeMultiset.coePNat_prime | [
{
"state_after": "case intro.mk.intro\nv : PrimeMultiset\np : ℕ+\nh : p ∈ toPNatMultiset v\nval✝ : ℕ\nhp' : Nat.Prime val✝\nleft✝ : { val := val✝, property := hp' } ∈ v\nh_eq : Coe.coe { val := val✝, property := hp' } = p\n⊢ PNat.Prime p",
"state_before": "v : PrimeMultiset\np : ℕ+\nh : p ∈ toPNatMultiset v... | [
126,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/MeasureTheory/Function/UniformIntegrable.lean | MeasureTheory.uniformIntegrable_zero_meas | [] | [
747,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
745,
1
] |
Std/Data/List/Lemmas.lean | List.length_pos_of_mem | [] | [
39,
34
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
38,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Fintype.prod_subtype_mul_prod_subtype | [
{
"state_after": "ι : Type ?u.881033\nβ✝ : Type u\nα✝ : Type v\nγ : Type w\ns✝ s₁ s₂ : Finset α✝\na : α✝\nf✝ g : α✝ → β✝\nα : Type u_1\nβ : Type u_2\ninst✝² : Fintype α\ninst✝¹ : CommMonoid β\np : α → Prop\nf : α → β\ninst✝ : DecidablePred p\ns : Finset α := Set.toFinset {x | p x}\n⊢ (∏ i : { x // p x }, f ↑i) ... | [
2032,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2024,
1
] |
Mathlib/Order/CompleteLattice.lean | iSup_eq_top | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.187342\nβ₂ : Type ?u.187345\nγ : Type ?u.187348\nι : Sort u_2\nι' : Sort ?u.187354\nκ : ι → Sort ?u.187359\nκ' : ι' → Sort ?u.187364\ninst✝ : CompleteLinearOrder α\nf : ι → α\n⊢ iSup f = ⊤ ↔ ∀ (b : α), b < ⊤ → ∃ i, b < f i",
"tactic... | [
1692,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1691,
1
] |
Mathlib/Order/Filter/Archimedean.lean | Filter.Tendsto.atBot_mul_const' | [
{
"state_after": "α : Type u_2\nR : Type u_1\nl : Filter α\nf : α → R\nr : R\ninst✝¹ : LinearOrderedRing R\ninst✝ : Archimedean R\nhr : 0 < r\nhf : Tendsto (fun x => -f x) l atTop\n⊢ Tendsto (fun x => -f x * r) l atTop",
"state_before": "α : Type u_2\nR : Type u_1\nl : Filter α\nf : α → R\nr : R\ninst✝¹ : L... | [
198,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
1
] |
Mathlib/Dynamics/FixedPoints/Basic.lean | Function.mem_fixedPoints | [] | [
142,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.lift_lt_aleph0 | [
{
"state_after": "no goals",
"state_before": "α β : Type u\nc : Cardinal\n⊢ lift c < ℵ₀ ↔ c < ℵ₀",
"tactic": "rw [← lift_aleph0.{u,v}, lift_lt]"
}
] | [
1271,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1270,
1
] |
Mathlib/Data/Set/Finite.lean | Set.Finite.toFinset_inter | [
{
"state_after": "case a\nα : Type u\nβ : Type v\nι : Sort w\nγ : Type x\ns t : Set α\na : α\nhs✝ : Set.Finite s\nht✝ : Set.Finite t\ninst✝ : DecidableEq α\nhs : Set.Finite s\nht : Set.Finite t\nh : Set.Finite (s ∩ t)\na✝ : α\n⊢ a✝ ∈ Finite.toFinset h ↔ a✝ ∈ Finite.toFinset hs ∩ Finite.toFinset ht",
"state_... | [
242,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
239,
11
] |
Mathlib/NumberTheory/Padics/RingHoms.lean | PadicInt.appr_mono | [
{
"state_after": "case hf\np : ℕ\nhp_prime : Fact (Nat.Prime p)\nr : ℚ\nx✝ x : ℤ_[p]\n⊢ ∀ (n : ℕ), appr x n ≤ appr x (n + 1)",
"state_before": "p : ℕ\nhp_prime : Fact (Nat.Prime p)\nr : ℚ\nx✝ x : ℤ_[p]\n⊢ Monotone (appr x)",
"tactic": "apply monotone_nat_of_le_succ"
},
{
"state_after": "case hf\... | [
336,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
331,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.infinitePos_abs_iff_infinite | [] | [
530,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
529,
9
] |
Mathlib/RingTheory/Polynomial/Quotient.lean | Polynomial.quotientSpanXSubCAlgEquiv_mk | [] | [
49,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
47,
1
] |
Mathlib/Data/Set/Pointwise/SMul.lean | Set.Nonempty.smul_zero | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.80091\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.80100\ninst✝² : Zero α\ninst✝¹ : Zero β\ninst✝ : SMulWithZero α β\ns : Set α\nt : Set β\nhs : Set.Nonempty s\n⊢ 0 ⊆ s • 0",
"tactic": "simpa [mem_smul] using hs"
}
] | [
802,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
801,
1
] |
Mathlib/MeasureTheory/Measure/NullMeasurable.lean | MeasureTheory.NullMeasurableSet.inter | [] | [
200,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
11
] |
Mathlib/GroupTheory/GroupAction/Opposite.lean | op_smul_eq_mul | [] | [
99,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/MeasureTheory/Measure/AEMeasurable.lean | AEMeasurable.nullMeasurable | [] | [
239,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
11
] |
Mathlib/Data/Prod/Basic.lean | Function.RightInverse.Prod_map | [] | [
336,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
334,
1
] |
Mathlib/LinearAlgebra/Matrix/IsDiag.lean | Matrix.isDiag_of_subsingleton | [] | [
65,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Std/Data/RBMap/Alter.lean | Std.RBNode.Path.Balanced.fill | [] | [
121,
65
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
117,
11
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.isBigO_of_le' | [] | [
554,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
553,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean | CategoryTheory.Limits.biprod.symmetry' | [
{
"state_after": "no goals",
"state_before": "J : Type w\nC : Type u\ninst✝² : Category C\ninst✝¹ : HasZeroMorphisms C\nP✝ Q✝ : C\ninst✝ : HasBinaryBiproducts C\nP Q : C\n⊢ lift snd fst ≫ lift snd fst = 𝟙 (P ⊞ Q)",
"tactic": "aesop_cat"
}
] | [
1850,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1848,
1
] |
Mathlib/MeasureTheory/Measure/Haar/NormedSpace.lean | MeasureTheory.Integrable.comp_mul_left' | [] | [
168,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
166,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | MulOpposite.nnnorm_op | [] | [
2618,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2617,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.mod_lt | [
{
"state_after": "α : Type ?u.259815\nβ : Type ?u.259818\nγ : Type ?u.259821\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\na b : Ordinal\nh : b ≠ 0\n⊢ a < b * (a / b) + b",
"state_before": "α : Type ?u.259815\nβ : Type ?u.259818\nγ : Type ?u.259821\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → P... | [
1052,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1051,
1
] |
Mathlib/Algebra/Order/Interval.lean | Interval.bot_pow | [] | [
327,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
325,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | OrderIso.comap_atTop | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.49076\nι' : Type ?u.49079\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.49088\ninst✝¹ : Preorder α\ninst✝ : Preorder β\ne : α ≃o β\n⊢ comap (↑e) atTop = atTop",
"tactic": "simp [atTop, ← e.surjective.iInf_comp]"
}
] | [
403,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
402,
1
] |
Mathlib/MeasureTheory/MeasurableSpace.lean | measurableSet_swap_iff | [] | [
743,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
741,
1
] |
Mathlib/Analysis/Calculus/FDerivMeasurable.lean | RightDerivMeasurableAux.d_subset_differentiable_set | [
{
"state_after": "F : Type u_1\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedSpace ℝ F\nf : ℝ → F\nK✝ K : Set F\nhK : IsComplete K\nP : ∀ {n : ℕ}, 0 < (1 / 2) ^ n\n⊢ D f K ⊆ {x | DifferentiableWithinAt ℝ f (Ici x) x ∧ derivWithin f (Ici x) x ∈ K}",
"state_before": "F : Type u_1\ninst✝¹ : NormedAddCommGroup ... | [
732,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
592,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.