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/RingTheory/Multiplicity.lean | multiplicity.isUnit_right | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : CommMonoid α\ninst✝ : DecidableRel fun x x_1 => x ∣ x_1\na b : α\nha : ¬IsUnit a\nhb : IsUnit b\n⊢ a ^ 0 ∣ b",
"tactic": "simp only [_root_.pow_zero, one_dvd]"
},
{
"state_after": "α : Type u_1\ninst✝¹ : CommMonoid α\ninst✝ : D... | [
319,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
315,
1
] |
Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean | SimpleGraph.exists_ne_odd_degree_of_exists_odd_degree | [
{
"state_after": "V : Type u\nG : SimpleGraph V\ninst✝¹ : Fintype V\ninst✝ : DecidableRel G.Adj\nv : V\nh : Odd (degree G v)\nthis : DecidableEq V\n⊢ ∃ w, w ≠ v ∧ Odd (degree G w)",
"state_before": "V : Type u\nG : SimpleGraph V\ninst✝¹ : Fintype V\ninst✝ : DecidableRel G.Adj\nv : V\nh : Odd (degree G v)\n⊢... | [
170,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Data/QPF/Multivariate/Constructions/Comp.lean | MvQPF.Comp.mk_get | [] | [
54,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
11
] |
Mathlib/CategoryTheory/Limits/Opposites.lean | CategoryTheory.Limits.hasColimits_of_hasLimits_op | [] | [
320,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
319,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.ne_of_adj | [
{
"state_after": "ι : Sort ?u.11825\n𝕜 : Type ?u.11828\nV : Type u\nW : Type v\nX : Type w\nG : SimpleGraph V\nG' : SimpleGraph W\na c u v w : V\ne : Sym2 V\nh : Adj G a a\n⊢ False",
"state_before": "ι : Sort ?u.11825\n𝕜 : Type ?u.11828\nV : Type u\nW : Type v\nX : Type w\nG : SimpleGraph V\nG' : SimpleGr... | [
207,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
205,
1
] |
Mathlib/Data/List/Indexes.lean | List.mapIdx_append | [
{
"state_after": "case nil\nα✝ : Type u\nβ : Type v\nα : Type u_1\nL : List α\nf✝ f : ℕ → α → β\n⊢ mapIdx f ([] ++ L) = mapIdx f [] ++ mapIdx (fun i a => f (i + length []) a) L\n\ncase cons\nα✝ : Type u\nβ : Type v\nα : Type u_1\nL : List α\nf✝ : ℕ → α → β\na : α\nJ : List α\nIH : ∀ (f : ℕ → α → β), mapIdx f (J... | [
187,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | WithTop.sInf_empty | [] | [
86,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Data/Num/Lemmas.lean | ZNum.add_le_add_left | [
{
"state_after": "α : Type ?u.1030791\na b : ZNum\nh : a ≤ b\nc : ZNum\n⊢ c + a ≤ c + b",
"state_before": "α : Type ?u.1030791\n⊢ ∀ (a b : ZNum), a ≤ b → ∀ (c : ZNum), c + a ≤ c + b",
"tactic": "intro a b h c"
},
{
"state_after": "α : Type ?u.1030791\na b c : ZNum\n⊢ a ≤ b → c + a ≤ c + b",
... | [
1497,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1493,
9
] |
Mathlib/Data/Fin/Tuple/Monotone.lean | strictAnti_vecEmpty | [] | [
70,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.mul_div_cancel | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.243802\nβ : Type ?u.243805\nγ : Type ?u.243808\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\na b : Ordinal\nb0 : b ≠ 0\n⊢ b * a / b = a",
"tactic": "simpa only [add_zero, zero_div] using mul_add_div a b0 0"
}
] | [
957,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
956,
1
] |
Mathlib/LinearAlgebra/Finrank.lean | subalgebra_top_rank_eq_submodule_top_rank | [
{
"state_after": "K : Type u\nV : Type v\nF : Type u_2\nE : Type u_1\ninst✝² : CommRing F\ninst✝¹ : Ring E\ninst✝ : Algebra F E\n⊢ Module.rank F { x // x ∈ ⊤ } = Module.rank F { x // x ∈ ↑Subalgebra.toSubmodule ⊤ }",
"state_before": "K : Type u\nV : Type v\nF : Type u_2\nE : Type u_1\ninst✝² : CommRing F\ni... | [
543,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
540,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.subset_inter | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.174037\nγ : Type ?u.174040\ninst✝ : DecidableEq α\ns s₁✝ s₂✝ t t₁ t₂ u✝ v : Finset α\na b : α\ns₁ s₂ u : Finset α\n⊢ s₁ ⊆ s₂ → s₁ ⊆ u → s₁ ⊆ s₂ ∩ u",
"tactic": "simp (config := { contextual := true }) [subset_iff, mem_inter]"
}
] | [
1593,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1592,
1
] |
Mathlib/Data/List/Perm.lean | List.erase_subperm | [] | [
788,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
787,
1
] |
Mathlib/Topology/Algebra/Module/Multilinear.lean | ContinuousMultilinearMap.sub_apply | [] | [
446,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
445,
1
] |
Mathlib/Data/Sym/Sym2.lean | Sym2.mk''_eq_mk''_iff | [
{
"state_after": "case mk\nα : Type u_1\nβ : Type ?u.5513\nγ : Type ?u.5516\nq : α × α\nfst✝ snd✝ : α\n⊢ Quotient.mk (Rel.setoid α) (fst✝, snd✝) = Quotient.mk (Rel.setoid α) q ↔ (fst✝, snd✝) = q ∨ (fst✝, snd✝) = Prod.swap q",
"state_before": "α : Type u_1\nβ : Type ?u.5513\nγ : Type ?u.5516\np q : α × α\n⊢ ... | [
175,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Mathlib/Order/Antichain.lean | IsAntichain.bot_mem_iff | [] | [
253,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
252,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Metric.hausdorffDist_closure₂ | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.86905\nα : Type u\nβ : Type v\ninst✝¹ : PseudoMetricSpace α\ninst✝ : PseudoMetricSpace β\ns t u : Set α\nx y : α\nΦ : α → β\n⊢ hausdorffDist s (closure t) = hausdorffDist s t",
"tactic": "simp [hausdorffDist]"
}
] | [
869,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
868,
1
] |
Mathlib/Algebra/Order/Sub/Canonical.lean | eq_tsub_iff_add_eq_of_le | [] | [
209,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
208,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.singleton_le | [] | [
602,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
599,
1
] |
Mathlib/Analysis/InnerProductSpace/l2Space.lean | Orthonormal.exists_hilbertBasis_extension | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.915782\n𝕜 : Type u_2\ninst✝⁴ : IsROrC 𝕜\nE : Type u_1\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ncplt : CompleteSpace E\nG : ι → Type ?u.915933\ninst✝¹ : (i : ι) → NormedAddCommGroup (G i)\ninst✝ : (i : ι) → InnerProductSpace ... | [
599,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
593,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Split.lean | BoxIntegral.Prepartition.split_of_not_mem_Ioo | [
{
"state_after": "ι : Type u_1\nM : Type ?u.36480\nn : ℕ\nI J✝ : Box ι\ni : ι\nx : ℝ\nh : ¬x ∈ Ioo (Box.lower I i) (Box.upper I i)\nJ : Box ι\nhJ : J ∈ ⊤.boxes\n⊢ J ∈ (split I i x).boxes",
"state_before": "ι : Type u_1\nM : Type ?u.36480\nn : ℕ\nI J : Box ι\ni : ι\nx : ℝ\nh : ¬x ∈ Ioo (Box.lower I i) (Box.u... | [
211,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/Data/PFunctor/Multivariate/Basic.lean | MvPFunctor.comp_map | [] | [
74,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean | Real.arccos_of_one_le | [
{
"state_after": "no goals",
"state_before": "x : ℝ\nhx : 1 ≤ x\n⊢ arccos x = 0",
"tactic": "rw [arccos, arcsin_of_one_le hx, sub_self]"
}
] | [
412,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
411,
1
] |
Mathlib/Combinatorics/SimpleGraph/Coloring.lean | SimpleGraph.Colorable.chromaticNumber_mono | [] | [
335,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
333,
1
] |
Mathlib/Dynamics/PeriodicPts.lean | Function.minimalPeriod_eq_prime_pow | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.27026\nf fa : α → α\nfb : β → β\nx y : α\nm n p k : ℕ\nhp : Fact (Nat.Prime p)\nhk : ¬IsPeriodicPt f (p ^ k) x\nhk1 : IsPeriodicPt f (p ^ (k + 1)) x\n⊢ minimalPeriod f x = p ^ (k + 1)",
"tactic": "apply Nat.eq_prime_pow_of_dvd_least... | [
424,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
421,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.closure_le_normalClosure | [
{
"state_after": "no goals",
"state_before": "G : Type u_1\nG' : Type ?u.445572\ninst✝² : Group G\ninst✝¹ : Group G'\nA : Type ?u.445581\ninst✝ : AddGroup A\ns✝ s : Set G\n⊢ closure s ≤ normalClosure s",
"tactic": "simp only [subset_normalClosure, closure_le]"
}
] | [
2520,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2519,
1
] |
Mathlib/Algebra/BigOperators/Intervals.lean | Finset.prod_range_add_one_eq_factorial | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ns₂ s₁ s : Finset α\na : α\ng f : α → β\ninst✝ : CommMonoid β\nn : ℕ\n⊢ ∏ x in range (n + 1), (x + 1) = (n + 1)!",
"tactic": "simp [Finset.range_succ, prod_range_add_one_eq_factorial n]"
}
] | [
197,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
1
] |
Mathlib/Data/Finset/NoncommProd.lean | Finset.noncommProd_toFinset | [
{
"state_after": "F : Type ?u.140576\nι : Type ?u.140579\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.140588\nf✝ : α → β → β\nop : α → α → α\ninst✝² : Monoid β\ninst✝¹ : Monoid γ\ninst✝ : DecidableEq α\nl : List α\nf : α → β\ncomm : Set.Pairwise ↑(List.toFinset l) fun a b => Commute (f a) (f b)\nhl✝ : List.Nodup l\... | [
268,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
265,
1
] |
Mathlib/Data/Polynomial/Degree/Lemmas.lean | Polynomial.coeff_mul_of_natDegree_le | [
{
"state_after": "case inl.inl\nR : Type u\nS : Type v\nι : Type w\na b : R\ninst✝ : Semiring R\np q r : R[X]\npm : natDegree p ≤ natDegree p\nqn : natDegree q ≤ natDegree q\n⊢ coeff (p * q) (natDegree p + natDegree q) = coeff p (natDegree p) * coeff q (natDegree q)\n\ncase inl.inr\nR : Type u\nS : Type v\nι : ... | [
175,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
166,
1
] |
Mathlib/Order/CompactlyGenerated.lean | DirectedOn.disjoint_sSup_right | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.97615\nα : Type u_1\ninst✝² : CompleteLattice α\nf : ι → α\ninst✝¹ : CompleteLattice α\ninst✝ : IsCompactlyGenerated α\na b : α\ns : Set α\nh : DirectedOn (fun x x_1 => x ≤ x_1) s\n⊢ Disjoint a (sSup s) ↔ ∀ ⦃b : α⦄, b ∈ s → Disjoint a b",
"tactic... | [
394,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
392,
11
] |
Mathlib/Order/Category/PartOrdCat.lean | partOrdCat_dual_comp_forget_to_preordCat | [] | [
104,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Path.isTrail | [] | [
1284,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1283,
11
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.aleph0_mul_eq | [] | [
571,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
570,
1
] |
Mathlib/CategoryTheory/Endofunctor/Algebra.lean | CategoryTheory.Endofunctor.Algebra.iso_of_iso | [
{
"state_after": "C : Type u\ninst✝¹ : Category C\nF : C ⥤ C\nA A₀ A₁ A₂ : Algebra F\nf✝ : A₀ ⟶ A₁\ng : A₁ ⟶ A₂\nf : A₀ ⟶ A₁\ninst✝ : IsIso f.f\n⊢ F.map (inv f.f) ≫ F.map f.f ≫ A₁.str = A₁.str",
"state_before": "C : Type u\ninst✝¹ : Category C\nF : C ⥤ C\nA A₀ A₁ A₂ : Algebra F\nf✝ : A₀ ⟶ A₁\ng : A₁ ⟶ A₂\nf... | [
156,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/Topology/MetricSpace/PartitionOfUnity.lean | EMetric.exists_continuous_eNNReal_forall_closedBall_subset | [] | [
119,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Data/Matrix/Kronecker.lean | Matrix.kroneckerMap_transpose | [] | [
74,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Data/Sum/Basic.lean | Sum.elim_inl | [] | [
178,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
177,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | measurable_coe_nnreal_ennreal_iff | [] | [
1905,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1903,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Ioi_disjUnion_Iio | [
{
"state_after": "case a\nι : Type ?u.167907\nα : Type u_1\ninst✝³ : LinearOrder α\ninst✝² : Fintype α\ninst✝¹ : LocallyFiniteOrderTop α\ninst✝ : LocallyFiniteOrderBot α\na a✝ : α\n⊢ a✝ ∈ disjUnion (Ioi a) (Iio a) (_ : Disjoint (Ioi a) (Iio a)) ↔ a✝ ∈ {a}ᶜ",
"state_before": "ι : Type ?u.167907\nα : Type u_1... | [
867,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
864,
1
] |
Mathlib/Algebra/MonoidAlgebra/Basic.lean | MonoidAlgebra.liftNC_single | [] | [
150,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/Algebra/Order/Hom/Monoid.lean | OrderMonoidHom.coe_comp_monoidHom | [] | [
430,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
428,
1
] |
Mathlib/Algebra/Order/Group/Defs.lean | mul_inv_lt_one_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u\ninst✝² : Group α\ninst✝¹ : LT α\ninst✝ : CovariantClass α α (swap fun x x_1 => x * x_1) fun x x_1 => x < x_1\na b c : α\n⊢ b < 1 * a ↔ b < a",
"tactic": "rw [one_mul]"
}
] | [
334,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
333,
1
] |
Mathlib/Algebra/Ring/BooleanRing.lean | ofBoolAlg_top | [] | [
283,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.smul_finset_union | [] | [
1663,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1662,
1
] |
Mathlib/Data/Int/Bitwise.lean | Int.ldiff_bit | [
{
"state_after": "no goals",
"state_before": "a : Bool\nm : ℤ\nb : Bool\nn : ℤ\n⊢ ldiff' (bit a m) (bit b n) = bit (a && !b) (ldiff' m n)",
"tactic": "rw [← bitwise_diff, bitwise_bit]"
}
] | [
320,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
319,
1
] |
Mathlib/Data/List/Basic.lean | List.length_scanl | [
{
"state_after": "ι : Type ?u.238764\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nf : β → α → β\nb : β\na✝ : α\nl✝ : List α\na : β\nx : α\nl : List α\n⊢ length (scanl f (f a x) l) = length l + 1",
"state_before": "ι : Type ?u.238764\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ ... | [
2602,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2598,
1
] |
Mathlib/Data/PNat/Defs.lean | Nat.succPNat_coe | [] | [
87,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Std/Data/Nat/Gcd.lean | Nat.dvd_lcm_right | [] | [
201,
83
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
201,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.generate_neBot_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.21459\nγ : Type ?u.21462\nι : Sort ?u.21465\nι' : Sort ?u.21468\nl l' : Filter α\np : ι → Prop\ns✝ : ι → Set α\nt : Set α\ni : ι\np' : ι' → Prop\ns' : ι' → Set α\ni' : ι'\ns : Set (Set α)\n⊢ (∀ {i : Set (Set α)}, Set.Finite i ∧ i ⊆ s → ... | [
403,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
401,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.sup_id_eq_sSup | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.88438\nα : Type u_1\nβ : Type ?u.88444\nγ : Type ?u.88447\nι : Type ?u.88450\nκ : Type ?u.88453\ninst✝ : CompleteLattice α\ns : Finset α\n⊢ sup s id = sSup ↑s",
"tactic": "simp [sSup_eq_iSup, sup_eq_iSup]"
}
] | [
291,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
290,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.empty_mul | [] | [
356,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
355,
1
] |
Mathlib/Algebra/Star/SelfAdjoint.lean | IsSelfAdjoint.sub | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nA : Type ?u.10014\ninst✝¹ : AddGroup R\ninst✝ : StarAddMonoid R\nx y : R\nhx : IsSelfAdjoint x\nhy : IsSelfAdjoint y\n⊢ IsSelfAdjoint (x - y)",
"tactic": "simp only [isSelfAdjoint_iff, star_sub, hx.star_eq, hy.star_eq]"
}
] | [
136,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
135,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.ringHom_eq_of_ker_eq | [
{
"state_after": "n : ℕ\nR : Type u_1\ninst✝ : CommRing R\nf g : R →+* ZMod n\nh : RingHom.ker f = RingHom.ker g\nthis :\n RingHom.comp\n (↑(RingHom.liftOfRightInverse f cast (_ : Function.RightInverse cast ↑f))\n { val := g, property := (_ : RingHom.ker f ≤ RingHom.ker g) })\n f =\n ↑{ val... | [
1183,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1179,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.lt_of_succ_lt | [] | [
305,
16
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
304,
1
] |
Mathlib/RingTheory/HahnSeries.lean | HahnSeries.addVal_apply | [] | [
1368,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1366,
1
] |
Mathlib/NumberTheory/Zsqrtd/Basic.lean | Zsqrtd.Nonneg.add | [
{
"state_after": "case intro.intro.inl.intro.intro.inl\nd x y : ℕ\nha : Nonneg { re := ↑x, im := ↑y }\nz w : ℕ\nhb : Nonneg { re := ↑z, im := ↑w }\n⊢ Nonneg ({ re := ↑x, im := ↑y } + { re := ↑z, im := ↑w })\n\ncase intro.intro.inl.intro.intro.inr.inl\nd x y : ℕ\nha : Nonneg { re := ↑x, im := ↑y }\nz w : ℕ\nhb :... | [
728,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
694,
1
] |
Mathlib/Algebra/Squarefree.lean | Int.squarefree_natAbs | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.124635\nn : ℤ\n⊢ Squarefree (natAbs n) ↔ Squarefree n",
"tactic": "simp_rw [Squarefree, natAbs_surjective.forall, ← natAbs_mul, natAbs_dvd_natAbs,\n isUnit_iff_natAbs_eq, Nat.isUnit_iff]"
}
] | [
274,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
272,
1
] |
Mathlib/Algebra/Module/LinearMap.lean | LinearMap.coe_toAddHom | [] | [
225,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
1
] |
Mathlib/LinearAlgebra/Eigenspace/Basic.lean | Module.End.mem_spectrum_of_hasEigenvalue | [
{
"state_after": "K R : Type v\nV M : Type w\ninst✝⁵ : CommRing R\ninst✝⁴ : AddCommGroup M\ninst✝³ : Module R M\ninst✝² : Field K\ninst✝¹ : AddCommGroup V\ninst✝ : Module K V\nf : End R M\nμ : R\nhμ : HasEigenvalue f μ\nh_unit : IsUnit (↑(algebraMap R (End R M)) μ - f)\n⊢ False",
"state_before": "K R : Type... | [
119,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Mathlib/Topology/Algebra/Group/Basic.lean | GroupTopology.toTopologicalSpace_le | [] | [
1899,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1897,
1
] |
Std/Data/List/Lemmas.lean | List.map_filter | [
{
"state_after": "β : Type u_1\nα : Type u_2\np : α → Bool\nf : β → α\nl : List β\n⊢ filterMap (fun x => Option.filter p ((some ∘ f) x)) l =\n filterMap (fun x => if (p ∘ f) x = true then (some ∘ f) x else none) l",
"state_before": "β : Type u_1\nα : Type u_2\np : α → Bool\nf : β → α\nl : List β\n⊢ filte... | [
1233,
67
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1232,
1
] |
Mathlib/Algebra/Hom/GroupAction.lean | MulActionHom.id_comp | [
{
"state_after": "no goals",
"state_before": "M' : Type u_1\nX : Type u_2\ninst✝²³ : SMul M' X\nY : Type u_3\ninst✝²² : SMul M' Y\nZ : Type ?u.46874\ninst✝²¹ : SMul M' Z\nM : Type ?u.46881\ninst✝²⁰ : Monoid M\nA : Type ?u.46887\ninst✝¹⁹ : AddMonoid A\ninst✝¹⁸ : DistribMulAction M A\nA' : Type ?u.46915\ninst... | [
166,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
165,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | ContDiffOn.of_succ | [] | [
678,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
677,
1
] |
Std/Data/Option/Lemmas.lean | Option.isSome_none | [] | [
51,
60
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
51,
9
] |
Mathlib/Data/Real/Basic.lean | Real.mk_sup | [] | [
471,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
470,
1
] |
Mathlib/MeasureTheory/Measure/AEDisjoint.lean | MeasureTheory.AEDisjoint.mono_ae | [] | [
83,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.support_update | [
{
"state_after": "case a\nι : Type u\nγ : Type w\nβ : ι → Type v\nβ₁ : ι → Type v₁\nβ₂ : ι → Type v₂\ndec : DecidableEq ι\ninst✝² : (i : ι) → Zero (β i)\ninst✝¹ : (i : ι) → (x : β i) → Decidable (x ≠ 0)\nf : Π₀ (i : ι), β i\ni : ι\nb : β i\ninst✝ : Decidable (b = 0)\nj : ι\n⊢ j ∈ support (update i f b) ↔ j ∈ if... | [
1243,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1237,
1
] |
Mathlib/RingTheory/Polynomial/ScaleRoots.lean | Polynomial.scaleRoots_aeval_eq_zero | [] | [
125,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Std/Data/Int/DivMod.lean | Int.emod_lt_of_pos | [
{
"state_after": "a b : Int\nm n : Nat\nH : 0 < ↑(succ n)\n⊢ -[m+1] % ↑(succ n) < ↑(succ n)",
"state_before": "a b : Int\nm n : Nat\nH : 0 < ↑(succ n)\n⊢ -[m+1] % ↑(succ n) < ↑(succ n)",
"tactic": "simp [emod, Int.subNatNat_eq_coe]"
},
{
"state_after": "no goals",
"state_before": "a b : Int\... | [
387,
59
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
382,
1
] |
Mathlib/Data/Finset/Sum.lean | Finset.disjSum_strictMono_left | [] | [
108,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.inf_eq_top_iff | [] | [
477,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
476,
11
] |
Mathlib/Analysis/Convex/Side.lean | AffineSubspace.SOppSide.left_not_mem | [] | [
183,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Data/Nat/Basic.lean | Nat.mul_left_eq_self_iff | [
{
"state_after": "no goals",
"state_before": "m n k a b : ℕ\nhb : 0 < b\n⊢ a * b = b ↔ a = 1",
"tactic": "rw [mul_comm, Nat.mul_right_eq_self_iff hb]"
}
] | [
359,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
358,
1
] |
Mathlib/Algebra/Algebra/Hom.lean | AlgHom.map_bit0 | [] | [
282,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
281,
11
] |
Mathlib/Order/ZornAtoms.lean | IsCoatomic.of_isChain_bounded | [
{
"state_after": "α : Type u_1\ninst✝¹ : PartialOrder α\ninst✝ : OrderTop α\nh : ∀ (c : Set α), IsChain (fun x x_1 => x ≤ x_1) c → Set.Nonempty c → ¬⊤ ∈ c → ∃ x x_1, x ∈ upperBounds c\nx : α\nhx : x < ⊤\n⊢ ∃ a, IsCoatom a ∧ x ≤ a",
"state_before": "α : Type u_1\ninst✝¹ : PartialOrder α\ninst✝ : OrderTop α\n... | [
39,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
27,
1
] |
Mathlib/CategoryTheory/Abelian/Pseudoelements.lean | CategoryTheory.Abelian.Pseudoelement.over_coe_def | [] | [
166,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
166,
1
] |
Mathlib/Data/Finset/Image.lean | Finset.coe_image_subset_range | [] | [
463,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
460,
1
] |
Mathlib/Computability/Partrec.lean | Computable.nat_div2 | [] | [
334,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
333,
1
] |
Mathlib/Order/Disjoint.lean | disjoint_toDual_iff | [] | [
417,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
415,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsBigO.exists_nonneg | [] | [
220,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
218,
1
] |
Mathlib/Topology/MetricSpace/Gluing.lean | Metric.toInductiveLimit_commute | [
{
"state_after": "X : ℕ → Type u\ninst✝ : (n : ℕ) → MetricSpace (X n)\nf : (n : ℕ) → X n → X (n + 1)\nI : ∀ (n : ℕ), Isometry (f n)\nn : ℕ\nx✝ : PseudoMetricSpace ((n : ℕ) × X n) := inductivePremetric I\n⊢ toInductiveLimit I (succ n) ∘ f n = toInductiveLimit I n",
"state_before": "X : ℕ → Type u\ninst✝ : (n... | [
647,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
638,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean | MeasureTheory.ae_of_all | [] | [
398,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
397,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean | MeasureTheory.measure_mono_ae | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.137021\nγ : Type ?u.137024\nδ : Type ?u.137027\nι : Type ?u.137030\ninst✝ : MeasurableSpace α\nμ μ₁ μ₂ : Measure α\ns s₁ s₂ t : Set α\nH : s ≤ᵐ[μ] t\n⊢ ↑↑μ (s ∪ t) = ↑↑μ (t ∪ s \\ t)",
"tactic": "rw [union_diff_self, Set.union_comm]... | [
567,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
562,
1
] |
Mathlib/Algebra/GroupPower/Basic.lean | dvd_pow_self | [] | [
244,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.filter_inter_filter_neg_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.417033\nγ : Type ?u.417036\np q : α → Prop\ninst✝² : DecidablePred p\ninst✝¹ : DecidablePred q\ninst✝ : DecidableEq α\ns t : Finset α\n⊢ filter p s ∩ filter (fun a => ¬p a) t = ∅",
"tactic": "simpa using (disjoint_filter_filter_neg ... | [
2951,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2949,
1
] |
Mathlib/Data/Num/Lemmas.lean | ZNum.div_to_int | [
{
"state_after": "no goals",
"state_before": "⊢ ↑(0 / 0) = ↑0 / ↑0",
"tactic": "simp [Int.ediv_zero]"
},
{
"state_after": "n d : PosNum\n⊢ ↑↑(PosNum.div' n d) = ↑(pos n) / ↑(pos d)",
"state_before": "n d : PosNum\n⊢ ↑(PosNum.div' n d) = ↑(pos n) / ↑(pos d)",
"tactic": "rw [← Num.to_nat_t... | [
1755,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1736,
1
] |
Mathlib/RingTheory/IntegralClosure.lean | isIntegral_algEquiv | [
{
"state_after": "no goals",
"state_before": "R : Type u_3\nA✝ : Type ?u.168448\nB✝ : Type ?u.168451\nS : Type ?u.168454\ninst✝⁹ : CommRing R\ninst✝⁸ : CommRing A✝\ninst✝⁷ : CommRing B✝\ninst✝⁶ : CommRing S\ninst✝⁵ : Algebra R A✝\ninst✝⁴ : Algebra R B✝\nf✝ : R →+* S\nA : Type u_1\nB : Type u_2\ninst✝³ : Rin... | [
159,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/Data/Finset/Powerset.lean | Finset.powersetLen_empty | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ns✝ t : Finset α\nn : ℕ\ns : Finset α\nh : card s < n\n⊢ card (powersetLen n s) = 0",
"tactic": "rw [card_powersetLen, Nat.choose_eq_zero_of_lt h]"
}
] | [
232,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
231,
1
] |
Mathlib/Algebra/Category/ModuleCat/Colimits.lean | ModuleCat.Colimits.quot_neg | [] | [
213,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/SetTheory/Cardinal/Continuum.lean | Cardinal.aleph0_power_aleph0 | [] | [
187,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
186,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | edist_eq_coe_nnnorm_div | [
{
"state_after": "no goals",
"state_before": "𝓕 : Type ?u.328683\n𝕜 : Type ?u.328686\nα : Type ?u.328689\nι : Type ?u.328692\nκ : Type ?u.328695\nE : Type u_1\nF : Type ?u.328701\nG : Type ?u.328704\ninst✝² : SeminormedGroup E\ninst✝¹ : SeminormedGroup F\ninst✝ : SeminormedGroup G\ns : Set E\na✝ a₁ a₂ b✝ ... | [
983,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
982,
1
] |
Std/Data/String/Lemmas.lean | String.Iterator.ValidFor.out' | [
{
"state_after": "no goals",
"state_before": "l r : List Char\n⊢ { s := { data := List.reverseAux l r }, i := { byteIdx := utf8Len l } } =\n { s := { data := List.reverse l ++ r }, i := { byteIdx := utf8Len (List.reverse l) } }",
"tactic": "simp [List.reverseAux_eq]"
}
] | [
519,
42
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
518,
1
] |
Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean | CircleDeg1Lift.units_apply_inv_apply | [
{
"state_after": "no goals",
"state_before": "f✝ g : CircleDeg1Lift\nf : CircleDeg1Liftˣ\nx : ℝ\n⊢ ↑↑f (↑↑f⁻¹ x) = x",
"tactic": "simp only [← mul_apply, f.mul_inv, coe_one, id]"
}
] | [
219,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
218,
1
] |
Mathlib/Analysis/Normed/Group/Seminorm.lean | GroupNorm.sup_apply | [] | [
843,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
842,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | UniformContinuous.subtype_mk | [] | [
1498,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1495,
1
] |
Mathlib/Topology/Algebra/OpenSubgroup.lean | OpenSubgroup.coe_prod | [] | [
203,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/RightAngle.lean | EuclideanGeometry.dist_sq_eq_dist_sq_add_dist_sq_iff_angle_eq_pi_div_two | [
{
"state_after": "no goals",
"state_before": "V : Type u_2\nP : Type u_1\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerProductSpace ℝ V\ninst✝¹ : MetricSpace P\ninst✝ : NormedAddTorsor V P\np1 p2 p3 : P\n⊢ dist p1 p3 * dist p1 p3 = dist p1 p2 * dist p1 p2 + dist p3 p2 * dist p3 p2 ↔ ∠ p1 p2 p3 = π / 2",
... | [
372,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
367,
1
] |
Mathlib/Algebra/Order/Chebyshev.lean | Antivary.card_mul_sum_le_sum_mul_sum | [] | [
149,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/RingTheory/Derivation/Basic.lean | Derivation.coe_smul_linearMap | [] | [
246,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/Analysis/Calculus/TangentCone.lean | UniqueDiffWithinAt.prod | [
{
"state_after": "𝕜 : Type u_2\ninst✝⁶ : NontriviallyNormedField 𝕜\nE : Type u_3\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\nF : Type u_1\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nG : Type ?u.128591\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace ℝ G\nx y✝ : E\ns t✝ : Set E... | [
344,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
336,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.