file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/MeasureTheory/Lattice.lean | AEMeasurable.sup' | [] | [
155,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/Order/LiminfLimsup.lean | Filter.isBoundedUnder_ge_inf | [] | [
304,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/Order/Closure.lean | ClosureOperator.closure_top | [] | [
234,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
233,
1
] |
Std/Data/Array/Lemmas.lean | Array.data_set | [] | [
85,
90
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
85,
9
] |
Mathlib/Data/MvPolynomial/Variables.lean | MvPolynomial.totalDegree_C | [
{
"state_after": "R : Type u\nS : Type v\nσ : Type u_1\nτ : Type ?u.373398\nr : R\ne : ℕ\nn✝ m : σ\ns : σ →₀ ℕ\ninst✝ : CommSemiring R\np q : MvPolynomial σ R\na : R\nn : σ →₀ ℕ\nhn : n ∈ support (↑C a)\nthis : n ∈ {0}\n⊢ (sum n fun x e => e) ≤ 0",
"state_before": "R : Type u\nS : Type v\nσ : Type u_1\nτ : ... | [
622,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
616,
1
] |
Mathlib/Order/CompleteLattice.lean | iInf_nat_gt_zero_eq | [
{
"state_after": "α : Type u_1\nβ : Type ?u.181361\nβ₂ : Type ?u.181364\nγ : Type ?u.181367\nι : Sort ?u.181370\nι' : Sort ?u.181373\nκ : ι → Sort ?u.181378\nκ' : ι' → Sort ?u.181383\ninst✝ : CompleteLattice α\nf✝ g s t : ι → α\na b : α\nf : ℕ → α\n⊢ (⨅ (i : ℕ) (_ : i > 0), f i) = ⨅ (b : ℕ) (_ : b ∈ {i | 0 < i}... | [
1678,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1676,
1
] |
Mathlib/RingTheory/FinitePresentation.lean | Algebra.FinitePresentation.of_surjective | [] | [
144,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Std/Logic.lean | and_left_comm | [
{
"state_after": "no goals",
"state_before": "a b c : Prop\n⊢ a ∧ b ∧ c ↔ b ∧ a ∧ c",
"tactic": "rw [← and_assoc, ← and_assoc, @and_comm a b]"
}
] | [
181,
47
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
180,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.image_iInter_subset | [] | [
1476,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1475,
1
] |
Mathlib/NumberTheory/Bernoulli.lean | sum_bernoulli | [
{
"state_after": "case zero\nA : Type ?u.636004\ninst✝¹ : CommRing A\ninst✝ : Algebra ℚ A\n⊢ ∑ k in range zero, ↑(Nat.choose zero k) * bernoulli k = if zero = 1 then 1 else 0\n\ncase succ\nA : Type ?u.636004\ninst✝¹ : CommRing A\ninst✝ : Algebra ℚ A\nn : ℕ\n⊢ ∑ k in range (succ n), ↑(Nat.choose (succ n) k) * be... | [
249,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
1
] |
Mathlib/SetTheory/Cardinal/Finite.lean | Nat.card_eq_one_iff_unique | [] | [
87,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/LinearAlgebra/Matrix/Adjugate.lean | Matrix.mul_adjugate | [
{
"state_after": "case a.h\nm : Type u\nn : Type v\nα : Type w\ninst✝⁴ : DecidableEq n\ninst✝³ : Fintype n\ninst✝² : DecidableEq m\ninst✝¹ : Fintype m\ninst✝ : CommRing α\nA : Matrix n n α\ni j : n\n⊢ (A ⬝ adjugate A) i j = (det A • 1) i j",
"state_before": "m : Type u\nn : Type v\nα : Type w\ninst✝⁴ : Deci... | [
295,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
292,
1
] |
Mathlib/Analysis/NormedSpace/Star/Basic.lean | CstarRing.norm_of_mem_unitary | [] | [
225,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/Topology/Separation.lean | eq_of_nhds_neBot | [] | [
927,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
926,
1
] |
Mathlib/LinearAlgebra/FreeModule/Finite/Rank.lean | LinearMap.finrank_le_finrank_of_injective | [] | [
194,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/GroupTheory/Perm/Support.lean | Equiv.Perm.eq_on_support_mem_disjoint | [
{
"state_after": "case nil\nα : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf g : Perm α\nl : List (Perm α)\nh✝ : f ∈ l\nhl✝ : List.Pairwise Disjoint l\nh : f ∈ []\nhl : List.Pairwise Disjoint []\n⊢ ∀ (x : α), x ∈ support f → ↑f x = ↑(List.prod []) x\n\ncase cons\nα : Type u_1\ninst✝¹ : DecidableEq α\n... | [
526,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
513,
1
] |
Std/Data/Rat/Lemmas.lean | Rat.divInt_neg' | [
{
"state_after": "no goals",
"state_before": "num den : Int\n⊢ num /. -den = -num /. den",
"tactic": "rw [← neg_divInt_neg, Int.neg_neg]"
}
] | [
134,
99
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
134,
1
] |
Mathlib/Data/List/Lattice.lean | List.forall_mem_inter_of_forall_right | [] | [
193,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
191,
1
] |
Mathlib/GroupTheory/PGroup.lean | IsPGroup.nonempty_fixed_point_of_prime_not_dvd_card | [
{
"state_after": "case intro\np : ℕ\nG : Type u_2\ninst✝³ : Group G\nhG : IsPGroup p G\nhp : Fact (Nat.Prime p)\nα : Type u_1\ninst✝² : MulAction G α\ninst✝¹ : Fintype α\nhpα : ¬p ∣ card α\ninst✝ : Finite ↑(fixedPoints G α)\nval✝ : Fintype ↑(fixedPoints G α)\n⊢ Nonempty ↑(fixedPoints G α)",
"state_before": ... | [
231,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Mathlib/Algebra/Free.lean | FreeSemigroup.length_mul | [
{
"state_after": "no goals",
"state_before": "α : Type u\nx y : FreeSemigroup α\n⊢ length (x * y) = length x + length y",
"tactic": "simp [length, ← add_assoc, add_right_comm, List.length, List.length_append]"
}
] | [
498,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
497,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean | ENNReal.mul_rpow_eq_ite | [
{
"state_after": "case inl\nx y : ℝ≥0∞\n⊢ (x * y) ^ 0 = if (x = 0 ∧ y = ⊤ ∨ x = ⊤ ∧ y = 0) ∧ 0 < 0 then ⊤ else x ^ 0 * y ^ 0\n\ncase inr\nx y : ℝ≥0∞\nz : ℝ\nhz : z ≠ 0\n⊢ (x * y) ^ z = if (x = 0 ∧ y = ⊤ ∨ x = ⊤ ∧ y = 0) ∧ z < 0 then ⊤ else x ^ z * y ^ z",
"state_before": "x y : ℝ≥0∞\nz : ℝ\n⊢ (x * y) ^ z = ... | [
501,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
483,
1
] |
Mathlib/CategoryTheory/Limits/ConcreteCategory.lean | CategoryTheory.Limits.Concrete.widePullback_ext' | [
{
"state_after": "C : Type u\ninst✝⁶ : Category C\ninst✝⁵ : ConcreteCategory C\nJ : Type w\ninst✝⁴ : SmallCategory J\nF : J ⥤ C\ninst✝³ : PreservesLimit F (forget C)\nB : C\nι : Type w\ninst✝² : Nonempty ι\nX : ι → C\nf : (j : ι) → X j ⟶ B\ninst✝¹ : HasWidePullback B X f\ninst✝ : PreservesLimit (wideCospan B X ... | [
85,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.zsmul_apply | [] | [
987,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
987,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | fderiv_csin | [] | [
415,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
413,
1
] |
Std/Data/String/Lemmas.lean | String.Pos.addChar_eq | [] | [
107,
79
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
107,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | TendstoUniformly.tendstoUniformlyOn | [] | [
231,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
11
] |
Mathlib/LinearAlgebra/ProjectiveSpace/Independence.lean | Projectivization.dependent_iff_not_independent | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nK : Type u_2\nV : Type u_3\ninst✝² : Field K\ninst✝¹ : AddCommGroup V\ninst✝ : Module K V\nf : ι → ℙ K V\n⊢ Dependent f ↔ ¬Independent f",
"tactic": "rw [dependent_iff, independent_iff]"
}
] | [
101,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | HasSum.sum_range_add | [
{
"state_after": "α : Type ?u.455352\nβ : Type ?u.455355\nγ : Type ?u.455358\nδ : Type ?u.455361\ninst✝⁵ : AddCommGroup α\ninst✝⁴ : TopologicalSpace α\ninst✝³ : TopologicalAddGroup α\nf✝ g : β → α\na✝ a₁ a₂ : α\nM : Type u_1\ninst✝² : AddCommMonoid M\ninst✝¹ : TopologicalSpace M\ninst✝ : ContinuousAdd M\nf : ℕ ... | [
961,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
958,
1
] |
Mathlib/Topology/Order/Basic.lean | tendsto_nhds_top_mono' | [] | [
1175,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1173,
1
] |
Mathlib/Data/Finset/Image.lean | Finset.mem_map | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.2249\nf : α ↪ β\ns : Finset α\nb : β\n⊢ (∃ a, a ∈ s.val ∧ ↑f a = b) ↔ ∃ a, a ∈ s ∧ ↑f a = b",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.2249\nf : α ↪ β\ns : Finset α\nb : β\n⊢ (∃ a, a ∈ s.val ∧ ↑f a = b) ↔ ∃ a, a ∈ s ∧ ↑f a = b",
"... | [
71,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/Logic/Equiv/TransferInstance.lean | Equiv.inv_def | [] | [
102,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
99,
1
] |
Mathlib/MeasureTheory/Measure/NullMeasurable.lean | MeasureTheory.NullMeasurableSet.of_subsingleton | [] | [
141,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/Analysis/Calculus/LocalExtr.lean | IsLocalMin.hasDerivAt_eq_zero | [
{
"state_after": "no goals",
"state_before": "f : ℝ → ℝ\nf' a b : ℝ\nh : IsLocalMin f a\nhf : HasDerivAt f f' a\n⊢ f' = 0",
"tactic": "simpa using FunLike.congr_fun (h.hasFDerivAt_eq_zero (hasDerivAt_iff_hasFDerivAt.1 hf)) 1"
}
] | [
231,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Ordered.lean | lineMap_lt_map_iff_slope_lt_slope | [] | [
303,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/MeasureTheory/Measure/NullMeasurable.lean | MeasureTheory.NullMeasurableSet.disjointed | [] | [
212,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
210,
11
] |
Mathlib/Algebra/RingQuot.lean | RingQuot.idealQuotientToRingQuot_apply | [] | [
523,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
521,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | edist_lt_coe | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.20200\nι : Type ?u.20203\ninst✝ : PseudoMetricSpace α\nx y : α\nc : ℝ≥0\n⊢ edist x y < ↑c ↔ nndist x y < c",
"tactic": "rw [edist_nndist, ENNReal.coe_lt_coe]"
}
] | [
333,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
332,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | LinearMap.toMatrix_transpose_apply | [] | [
589,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
587,
1
] |
Std/Data/Array/Lemmas.lean | Array.reverse_data | [
{
"state_after": "α : Type u_1\na : Array α\n⊢ (if h : size a ≤ 1 then a\n else\n reverse.loop a 0 { val := size a - 1, isLt := (_ : Nat.pred (Nat.sub (size a) 0) < Nat.sub (size a) 0) }).data =\n List.reverse a.data",
"state_before": "α : Type u_1\na : Array α\n⊢ (reverse a).data = List.reve... | [
265,
26
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
230,
9
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.add_compContinuous | [] | [
698,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
697,
1
] |
Mathlib/Data/Sym/Basic.lean | Sym.ext | [] | [
85,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
8
] |
Mathlib/GroupTheory/Complement.lean | Subgroup.MemLeftTransversals.toEquiv_apply | [
{
"state_after": "G : Type u_1\ninst✝ : Group G\nH K : Subgroup G\nS T : Set G\nf : G ⧸ H → G\nhf : ∀ (q : G ⧸ H), ↑(f q) = q\nq : G ⧸ H\n⊢ ↑(toEquiv (_ : (Set.range fun q => f q) ∈ leftTransversals ↑H)) q =\n { val := f q, property := (_ : ∃ y, (fun q => f q) y = f q) }",
"state_before": "G : Type u_1\n... | [
359,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
356,
1
] |
Mathlib/Topology/Algebra/Order/IntermediateValue.lean | Continuous.surjective | [] | [
620,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
617,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | Subalgebra.center_eq_top | [] | [
1365,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1364,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.count_replicate | [
{
"state_after": "case h.e'_2\nα : Type u_1\nβ : Type ?u.363947\nγ : Type ?u.363950\ninst✝ : DecidableEq α\na b : α\nn : ℕ\n⊢ count a (replicate n b) = List.count a (List.replicate n b)",
"state_before": "α : Type u_1\nβ : Type ?u.363947\nγ : Type ?u.363950\ninst✝ : DecidableEq α\na b : α\nn : ℕ\n⊢ count a ... | [
2440,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2438,
1
] |
Mathlib/Analysis/Calculus/FDeriv/RestrictScalars.lean | HasFDerivWithinAt.restrictScalars | [] | [
72,
4
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/GroupTheory/Commutator.lean | commutatorElement_eq_one_iff_mul_comm | [
{
"state_after": "no goals",
"state_before": "G : Type u_1\nG' : Type ?u.665\nF : Type ?u.668\ninst✝² : Group G\ninst✝¹ : Group G'\ninst✝ : MonoidHomClass F G G'\nf : F\ng₁ g₂ g₃ g : G\n⊢ ⁅g₁, g₂⁆ = 1 ↔ g₁ * g₂ = g₂ * g₁",
"tactic": "rw [commutatorElement_def, mul_inv_eq_one, mul_inv_eq_iff_eq_mul]"
}... | [
33,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
32,
1
] |
Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean | Asymptotics.IsEquivalent.congr_right | [] | [
121,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.disjoint_union_right | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.160671\nγ : Type ?u.160674\ninst✝ : DecidableEq α\ns s₁ s₂ t t₁ t₂ u v : Finset α\na b : α\n⊢ _root_.Disjoint s (t ∪ u) ↔ _root_.Disjoint s t ∧ _root_.Disjoint s u",
"tactic": "simp only [disjoint_right, mem_union, or_imp, forall_an... | [
1508,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1507,
1
] |
Mathlib/Data/Set/Sups.lean | Set.infs_singleton | [] | [
308,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
307,
1
] |
Mathlib/Data/Set/Basic.lean | Set.mem_insert_iff | [] | [
1134,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1133,
1
] |
Mathlib/RingTheory/Subsemiring/Basic.lean | Subsemiring.toSubmonoid_strictMono | [] | [
242,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
241,
1
] |
Mathlib/MeasureTheory/MeasurableSpace.lean | MeasurableSpace.comap_id | [] | [
117,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
116,
1
] |
Mathlib/Algebra/Algebra/Operations.lean | Submodule.one_le_one_div | [
{
"state_after": "case mp\nι : Sort uι\nR : Type u\ninst✝² : CommSemiring R\nA : Type v\ninst✝¹ : CommSemiring A\ninst✝ : Algebra R A\nM N : Submodule R A\nm n : A\nI : Submodule R A\n⊢ 1 ≤ 1 / I → I ≤ 1\n\ncase mpr\nι : Sort uι\nR : Type u\ninst✝² : CommSemiring R\nA : Type v\ninst✝¹ : CommSemiring A\ninst✝ : ... | [
712,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
709,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalRingHom.coe_srange | [] | [
360,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
359,
1
] |
Mathlib/Algebra/Order/Group/Abs.lean | max_sub_min_eq_abs' | [
{
"state_after": "case inl\nα : Type u_1\ninst✝³ : AddGroup α\ninst✝² : LinearOrder α\ninst✝¹ : CovariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1\na✝ b✝ c : α\ninst✝ : CovariantClass α α (swap fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1\na b : α\nab : a ≤ b\n⊢ max a b - min a b = abs (a - b)\n\ncase... | [
216,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
211,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | Measurable.ennnorm | [] | [
2070,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2069,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.lt_sub_of_add_lt | [
{
"state_after": "a b c : Nat\nh : a + b < c\n⊢ succ (a + b) ≤ c",
"state_before": "a b c : Nat\nh : a + b < c\n⊢ succ a + b ≤ c",
"tactic": "simp [Nat.succ_add]"
},
{
"state_after": "no goals",
"state_before": "a b c : Nat\nh : a + b < c\n⊢ succ (a + b) ≤ c",
"tactic": "exact h"
}
] | [
681,
24
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
679,
1
] |
Mathlib/Analysis/Normed/Group/Pointwise.lean | inv_cthickening | [
{
"state_after": "E : Type u_1\ninst✝ : SeminormedCommGroup E\nε δ : ℝ\ns t : Set E\nx y : E\n⊢ {x | EMetric.infEdist x s ≤ ENNReal.ofReal δ}⁻¹ = {x | EMetric.infEdist x⁻¹ s ≤ ENNReal.ofReal δ}",
"state_before": "E : Type u_1\ninst✝ : SeminormedCommGroup E\nε δ : ℝ\ns t : Set E\nx y : E\n⊢ (cthickening δ s)... | [
89,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Algebra/GroupPower/Basic.lean | pow_add | [
{
"state_after": "case zero\nα : Type ?u.13242\nM : Type u\nN : Type v\nG : Type w\nH : Type x\nA : Type y\nB : Type z\nR : Type u₁\nS : Type u₂\ninst✝¹ : Monoid M\ninst✝ : AddMonoid A\na : M\nm : ℕ\n⊢ a ^ (m + Nat.zero) = a ^ m * a ^ Nat.zero\n\ncase succ\nα : Type ?u.13242\nM : Type u\nN : Type v\nG : Type w\... | [
122,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.L1.SimpleFunc.setToL1S_mono_left' | [] | [
842,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
839,
1
] |
Mathlib/Data/Set/Basic.lean | Set.inter_insert_of_mem | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\na b : α\ns s₁ s₂ t t₁ t₂ u : Set α\nh : a ∈ s\n⊢ s ∩ insert a t = insert a (s ∩ t)",
"tactic": "rw [insert_inter_distrib, insert_eq_of_mem h]"
}
] | [
2003,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2002,
1
] |
Mathlib/Data/Matrix/Kronecker.lean | Matrix.kronecker_apply | [] | [
282,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
280,
1
] |
Mathlib/Analysis/NormedSpace/FiniteDimension.lean | LinearIndependent.eventually | [
{
"state_after": "case intro\n𝕜 : Type u\ninst✝¹¹ : NontriviallyNormedField 𝕜\nE : Type v\ninst✝¹⁰ : NormedAddCommGroup E\ninst✝⁹ : NormedSpace 𝕜 E\nF : Type w\ninst✝⁸ : NormedAddCommGroup F\ninst✝⁷ : NormedSpace 𝕜 F\nF' : Type x\ninst✝⁶ : AddCommGroup F'\ninst✝⁵ : Module 𝕜 F'\ninst✝⁴ : TopologicalSpace F'... | [
257,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
11
] |
Mathlib/Topology/MetricSpace/Isometry.lean | Isometry.injective | [] | [
198,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
11
] |
Mathlib/Analysis/Calculus/IteratedDeriv.lean | contDiffOn_of_differentiableOn_deriv | [
{
"state_after": "case h\n𝕜 : Type u_1\ninst✝⁴ : NontriviallyNormedField 𝕜\nF : Type u_2\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nE : Type ?u.43778\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace 𝕜 E\nn✝ : ℕ\nf : 𝕜 → F\ns : Set 𝕜\nx : 𝕜\nn : ℕ∞\nh : ∀ (m : ℕ), ↑m ≤ n → Differentiable... | [
151,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/Data/Fin/Tuple/Basic.lean | Fin.nat_find_mem_find | [
{
"state_after": "m n : ℕ\np : Fin n → Prop\ninst✝ : DecidablePred p\nh : ∃ i hin, p { val := i, isLt := hin }\ni : ℕ\nhin : i < n\nhi : p { val := i, isLt := hin }\n⊢ { val := Nat.find (_ : ∃ i hin, p { val := i, isLt := hin }),\n isLt := (_ : Nat.find (_ : ∃ i hin, p { val := i, isLt := hin }) < n) } ∈\n... | [
927,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
918,
1
] |
Mathlib/MeasureTheory/Function/LpSpace.lean | MeasureTheory.Lp.cauchy_complete_ℒp | [
{
"state_after": "α : Type u_2\nE : Type u_1\nF : Type ?u.8227274\nG : Type ?u.8227277\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedAddCommGroup F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : CompleteSpace E\nhp : 1 ≤ p\nf : ℕ → α → E\nhf : ∀ (n : ℕ), Mem... | [
1546,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1531,
1
] |
Mathlib/Data/Finset/PImage.lean | Finset.pimage_inter | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\ninst✝³ : DecidableEq β\nf g : α →. β\ninst✝² : (x : α) → Decidable (f x).Dom\ninst✝¹ : (x : α) → Decidable (g x).Dom\ns t : Finset α\nb : β\ninst✝ : DecidableEq α\n⊢ pimage f (s ∩ t) ⊆ pimage f s ∩ pimage f t",
"tactic": "simp onl... | [
124,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/Topology/Basic.lean | closure_eq_self_union_frontier | [] | [
788,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
787,
1
] |
Std/Data/Option/Lemmas.lean | Option.not_isSome_iff_eq_none | [
{
"state_after": "no goals",
"state_before": "α✝ : Type u_1\no : Option α✝\n⊢ ¬isSome o = true ↔ o = none",
"tactic": "cases o <;> simp"
}
] | [
71,
19
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
70,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | uniformity_lift_le_swap | [
{
"state_after": "α : Type ua\nβ : Type ub\nγ : Type uc\nδ : Type ud\nι : Sort ?u.50331\ninst✝ : UniformSpace α\ng : Set (α × α) → Filter β\nf : Filter β\nhg : Monotone g\nh : (Filter.lift (𝓤 α) fun s => g (Prod.swap ⁻¹' s)) ≤ f\n⊢ Filter.lift (𝓤 α) (g ∘ preimage Prod.swap) ≤ f",
"state_before": "α : Type... | [
554,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
549,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean | CategoryTheory.Limits.equalizer.hom_ext | [] | [
817,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
815,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | norm_inner_eq_norm_iff | [] | [
1625,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1617,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Ioi_subset_Ici_self | [] | [
536,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
536,
1
] |
Mathlib/Analysis/Convex/Topology.lean | Real.convex_iff_isPreconnected | [] | [
35,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
34,
1
] |
Mathlib/NumberTheory/Padics/PadicIntegers.lean | PadicInt.norm_add_eq_max_of_ne | [] | [
287,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
286,
1
] |
Mathlib/LinearAlgebra/Matrix/Circulant.lean | Matrix.Fin.conjTranspose_circulant | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.12395\nm : Type ?u.12398\nn : Type ?u.12401\nR : Type ?u.12404\ninst✝ : Star α\n⊢ ∀ (v : Fin 0 → α), (circulant v)ᴴ = circulant (star fun i => v (-i))",
"tactic": "simp [Injective]"
}
] | [
99,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
1
] |
Mathlib/Algebra/Quandle.lean | Rack.toEnvelGroup.mapAux.well_def | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝¹ : Rack R\nG : Type u_2\ninst✝ : Group G\nf : R →◃ Quandle.Conj G\na✝ b✝ a'✝ b'✝ : PreEnvelGroup R\nha : PreEnvelGroupRel' R a✝ a'✝\nhb : PreEnvelGroupRel' R b✝ b'✝\n⊢ mapAux f (PreEnvelGroup.mul a✝ b✝) = mapAux f (PreEnvelGroup.mul a'✝ b'✝)"... | [
739,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
726,
1
] |
Mathlib/MeasureTheory/Measure/Stieltjes.lean | StieltjesFunction.outer_trim | [
{
"state_after": "f : StieltjesFunction\ns : Set ℝ\n⊢ ↑(OuterMeasure.trim (StieltjesFunction.outer f)) s ≤ ↑(StieltjesFunction.outer f) s",
"state_before": "f : StieltjesFunction\n⊢ OuterMeasure.trim (StieltjesFunction.outer f) = StieltjesFunction.outer f",
"tactic": "refine' le_antisymm (fun s => _) (O... | [
493,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
470,
1
] |
Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean | SimpleGraph.trace_adjMatrix | [
{
"state_after": "no goals",
"state_before": "V : Type u_2\nα : Type u_1\nβ : Type ?u.56747\nG : SimpleGraph V\ninst✝³ : DecidableRel G.Adj\ninst✝² : Fintype V\ninst✝¹ : AddCommMonoid α\ninst✝ : One α\n⊢ trace (adjMatrix α G) = 0",
"tactic": "simp [Matrix.trace]"
}
] | [
243,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
242,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | UniformContinuous.comp_uniformCauchySeqOn | [] | [
516,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
514,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.inf_map_atTop_neBot_iff | [
{
"state_after": "ι : Type ?u.54429\nι' : Type ?u.54432\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.54441\ninst✝¹ : SemilatticeSup α\ninst✝ : Nonempty α\nF : Filter β\nu : α → β\n⊢ (∀ {p : β → Prop}, (∀ᶠ (x : β) in F, p x) → ∀ (a : α), ∃ b, b ≥ a ∧ p (u b)) ↔\n ∀ (U : Set β), U ∈ F → ∀ (N : α), ∃ n, n ≥ N ∧ u n... | [
451,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
449,
1
] |
Mathlib/RingTheory/EisensteinCriterion.lean | Polynomial.EisensteinCriterionAux.eval_zero_mem_ideal_of_eq_mul_X_pow | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : CommRing R\nn : ℕ\nP : Ideal R\nq : R[X]\nc : (R ⧸ P)[X]\nhq : map (mk P) q = c * X ^ n\nhn0 : 0 < n\n⊢ eval 0 q ∈ P",
"tactic": "rw [← coeff_zero_eq_eval_zero, ← eq_zero_iff_mem, ← coeff_map, hq,\ncoeff_zero_eq_eval_zero, coeff_zero_eq... | [
73,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Mathlib/Topology/Instances/AddCircle.lean | AddCircle.equivAddCircle_symm_apply_mk | [] | [
340,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/Analysis/Seminorm.lean | Seminorm.mem_ball | [] | [
648,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
647,
1
] |
Mathlib/Data/Polynomial/RingDivision.lean | Polynomial.card_nthRoots | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nT : Type w\na✝ b : R\nn✝ : ℕ\ninst✝¹ : CommRing R\ninst✝ : IsDomain R\np q : R[X]\nn : ℕ\na : R\nhn : n = 0\nh : X ^ n - ↑C a = 0\n⊢ ↑Multiset.card (nthRoots n a) ≤ n",
"tactic": "simp [Nat.zero_le, nthRoots, roots, h, dif_pos rfl, em... | [
803,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
789,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.coeff_mul_C | [] | [
1498,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1497,
1
] |
Mathlib/Algebra/Order/Archimedean.lean | exists_nat_gt | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : StrictOrderedSemiring α\ninst✝ : Archimedean α\nx : α\nn : ℕ\nh : x ≤ n • 1\n⊢ x ≤ ↑n",
"tactic": "rwa [← nsmul_one]"
}
] | [
117,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.coe_eq_coe | [] | [
60,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/Algebra/Parity.lean | Odd.map | [
{
"state_after": "case intro\nF : Type u_1\nα : Type u_2\nβ : Type u_3\nR : Type ?u.86642\ninst✝² : Semiring α\ninst✝¹ : Semiring β\nn : α\ninst✝ : RingHomClass F α β\nf : F\nm : α\n⊢ Odd (↑f (2 * m + 1))",
"state_before": "F : Type u_1\nα : Type u_2\nβ : Type u_3\nR : Type ?u.86642\ninst✝² : Semiring α\nin... | [
359,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
357,
1
] |
Mathlib/RingTheory/RootsOfUnity/Basic.lean | IsPrimitiveRoot.zmodEquivZpowers_symm_apply_pow' | [] | [
737,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
736,
1
] |
Mathlib/Data/Sign.lean | SignType.range_eq | [
{
"state_after": "α : Type u_1\nf : SignType → α\n⊢ ↑(Finset.image f {0, -1, 1}) = {f zero, f neg, f pos}",
"state_before": "α : Type u_1\nf : SignType → α\n⊢ Set.range f = {f zero, f neg, f pos}",
"tactic": "classical rw [← Fintype.coe_image_univ, univ_eq]"
},
{
"state_after": "no goals",
"... | [
291,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
289,
1
] |
Mathlib/Data/PFunctor/Multivariate/M.lean | MvPFunctor.M.dest_eq_dest' | [] | [
241,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
238,
1
] |
Mathlib/Data/Polynomial/FieldDivision.lean | Polynomial.degree_pos_of_irreducible | [] | [
498,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
495,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean | AffineMap.vadd_lineMap | [] | [
650,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
648,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | Subalgebra.isSimpleOrder_of_finrank | [
{
"state_after": "no goals",
"state_before": "K : Type u\nV : Type v\nF : Type u_1\nE : Type u_2\ninst✝² : Field F\ninst✝¹ : Ring E\ninst✝ : Algebra F E\nhr : finrank F E = 2\ni : Nontrivial E := nontrivial_of_finrank_pos (LT.lt.trans_eq zero_lt_two (Eq.symm hr))\nh : ⊥ = ⊤\n⊢ False",
"tactic": "cases h... | [
1457,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1439,
1
] |
Mathlib/Algebra/Order/Nonneg/Floor.lean | Nonneg.nat_floor_coe | [] | [
49,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
47,
1
] |
Mathlib/LinearAlgebra/Dimension.lean | infinite_basis_le_maximal_linearIndependent' | [
{
"state_after": "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.208466\nR : Type u\ninst✝⁸ : Ring R\nM : Type v\ninst✝⁷ : AddCommGroup M\ninst✝⁶ : Module R M\nM' : Type v'\ninst✝⁵ : AddCommGroup M'\ninst✝⁴ : Module R M'\nM₁ : Type v\n... | [
438,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
430,
1
] |
Mathlib/Order/Hom/Basic.lean | Equiv.coe_toOrderIso | [] | [
1128,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1126,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.