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/CompleteLattice.lean | FrameHom.id_comp | [] | [
637,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
636,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.biUnion_subset_iff_forall_subset | [] | [
3629,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3625,
1
] |
Mathlib/Combinatorics/Composition.lean | Composition.single_blocks | [] | [
583,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
582,
1
] |
Mathlib/Analysis/NormedSpace/Multilinear.lean | ContinuousMultilinearMap.continuous_restrictScalars | [] | [
612,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
609,
1
] |
Mathlib/Combinatorics/SimpleGraph/StronglyRegular.lean | SimpleGraph.bot_strongly_regular | [
{
"state_after": "V : Type u\ninst✝² : Fintype V\ninst✝¹ : DecidableEq V\nG : SimpleGraph V\ninst✝ : DecidableRel G.Adj\nn k ℓ μ : ℕ\nv w : V\n_h : v ≠ w\n⊢ filter (fun x => x ∈ commonNeighbors ⊥ v w) univ = ∅",
"state_before": "V : Type u\ninst✝² : Fintype V\ninst✝¹ : DecidableEq V\nG : SimpleGraph V\ninst... | [
68,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
61,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.eq_add_of_sub_eq | [
{
"state_after": "no goals",
"state_before": "a b c : Nat\nhle : b ≤ a\nh : a - b = c\n⊢ a = c + b",
"tactic": "rw [h.symm, Nat.sub_add_cancel hle]"
}
] | [
608,
38
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
607,
11
] |
Mathlib/Algebra/Group/Basic.lean | inv_involutive | [] | [
241,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
240,
1
] |
Mathlib/RingTheory/Subsemiring/Basic.lean | Subsemiring.mem_prod | [] | [
1052,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1050,
1
] |
Mathlib/Algebra/Homology/Homotopy.lean | prevD_comp_right | [
{
"state_after": "ι : Type u_1\nV : Type u\ninst✝¹ : Category V\ninst✝ : Preadditive V\nc : ComplexShape ι\nC D E : HomologicalComplex V c\nf✝ g✝ : C ⟶ D\nh k : D ⟶ E\ni : ι\nf : (i j : ι) → X C i ⟶ X D j\ng : D ⟶ E\nj : ι\n⊢ (f j (ComplexShape.prev c j) ≫ Hom.f g (ComplexShape.prev c j)) ≫ d E (ComplexShape.pr... | [
107,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/RingTheory/DedekindDomain/Ideal.lean | FractionalIdeal.isPrincipal_inv | [
{
"state_after": "R : Type ?u.84677\nA : Type ?u.84680\nK : Type u_2\ninst✝¹¹ : CommRing R\ninst✝¹⁰ : CommRing A\ninst✝⁹ : Field K\ninst✝⁸ : IsDomain A\nR₁ : Type u_1\ninst✝⁷ : CommRing R₁\ninst✝⁶ : IsDomain R₁\ninst✝⁵ : Algebra R₁ K\ninst✝⁴ : IsFractionRing R₁ K\nI✝ J : FractionalIdeal R₁⁰ K\nK' : Type ?u.8569... | [
236,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/Algebra/Hom/Equiv/Units/Basic.lean | Group.mulLeft_bijective | [] | [
150,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean | CategoryTheory.Limits.Fork.app_one_eq_ι_comp_right | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝ : Category C\nX Y : C\nf g : X ⟶ Y\ns : Fork f g\n⊢ s.π.app one = ι s ≫ g",
"tactic": "rw [← s.app_zero_eq_ι, ← s.w right, parallelPair_map_right]"
}
] | [
346,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
345,
1
] |
Mathlib/ModelTheory/LanguageMap.lean | FirstOrder.Language.LHom.comp_assoc | [] | [
170,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/RingTheory/Ideal/LocalRing.lean | LocalRing.ResidueField.map_residue | [] | [
436,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
434,
1
] |
Mathlib/Analysis/NormedSpace/ContinuousLinearMap.lean | continuous_of_linear_of_bound | [] | [
97,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/Data/Nat/Order/Lemmas.lean | Nat.not_two_dvd_bit1 | [
{
"state_after": "a b m n✝ k n : ℕ\n⊢ ¬2 = 1",
"state_before": "a b m n✝ k n : ℕ\n⊢ ¬2 ∣ bit1 n",
"tactic": "rw [bit1, Nat.dvd_add_right two_dvd_bit0, Nat.dvd_one]"
},
{
"state_after": "no goals",
"state_before": "a b m n✝ k n : ℕ\n⊢ ¬2 = 1",
"tactic": "decide"
}
] | [
106,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
11
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_piecewise | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.770262\nβ : Type u\nα : Type v\nγ : Type w\ns✝ s₁ s₂ : Finset α\na : α\nf✝ g✝ : α → β\ninst✝¹ : CommMonoid β\ninst✝ : DecidableEq α\ns t : Finset α\nf g : α → β\n⊢ ∏ x in s, piecewise t f g x = (∏ x in s ∩ t, f x) * ∏ x in s \\ t, g x",
"tactic":... | [
1539,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1537,
1
] |
Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean | SimpleGraph.nonuniformWitnesses_spec | [
{
"state_after": "α : Type u_1\n𝕜 : Type u_2\ninst✝¹ : LinearOrderedField 𝕜\nG : SimpleGraph α\ninst✝ : DecidableRel G.Adj\nε : 𝕜\ns t : Finset α\na b : α\nh : ¬IsUniform G ε s t\n⊢ ε ≤\n ↑(abs\n (edgeDensity G\n (Exists.choose\n (_ :\n ∃ s',\n ... | [
157,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | Polynomial.coe_def | [] | [
2540,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2539,
1
] |
Std/Data/List/Init/Lemmas.lean | List.all_cons | [] | [
37,
66
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
37,
9
] |
Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean | CategoryTheory.Limits.map_inl_inv_coprodComparison | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝⁶ : Category C\nX Y : C\nD : Type u₂\ninst✝⁵ : Category D\nF : C ⥤ D\nA A' B B' : C\ninst✝⁴ : HasBinaryCoproduct A B\ninst✝³ : HasBinaryCoproduct A' B'\ninst✝² : HasBinaryCoproduct (F.obj A) (F.obj B)\ninst✝¹ : HasBinaryCoproduct (F.obj A') (F.o... | [
1374,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1373,
1
] |
Mathlib/Data/Sigma/Interval.lean | Sigma.Ioo_mk_mk | [] | [
100,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
99,
1
] |
Mathlib/Order/Partition/Equipartition.lean | Finpartition.IsEquipartition.average_le_card_part | [
{
"state_after": "α : Type u_1\ninst✝ : DecidableEq α\ns t : Finset α\nP : Finpartition s\nhP : IsEquipartition P\nht : t ∈ P.parts\n⊢ (Finset.sum P.parts fun i => Finset.card i) / Finset.card P.parts ≤ Finset.card t",
"state_before": "α : Type u_1\ninst✝ : DecidableEq α\ns t : Finset α\nP : Finpartition s\... | [
59,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
56,
1
] |
Mathlib/RingTheory/UniqueFactorizationDomain.lean | UniqueFactorizationMonoid.exists_associated_prime_pow_of_unique_normalized_factor | [
{
"state_after": "α : Type u_1\ninst✝³ : CancelCommMonoidWithZero α\ninst✝² : DecidableEq α\ninst✝¹ : NormalizationMonoid α\ninst✝ : UniqueFactorizationMonoid α\np r : α\nh : ∀ {m : α}, m ∈ normalizedFactors r → m = p\nhr : r ≠ 0\n⊢ p ^ ZeroHom.toFun (↑Multiset.card) (normalizedFactors r) ~ᵤ r",
"state_befo... | [
760,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
756,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.bsup_eq_blsub_iff_succ | [
{
"state_after": "α : Type ?u.356089\nβ : Type ?u.356092\nγ : Type ?u.356095\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\no : Ordinal\nf : (a : Ordinal) → a < o → Ordinal\n⊢ sup (familyOfBFamily o f) = lsub (familyOfBFamily o f) ↔\n ∀ (a : Ordinal), a < lsub (familyOfBFamily o f) → succ a < lsub (f... | [
1860,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1857,
1
] |
Mathlib/Computability/TMToPartrec.lean | Turing.PartrecToTM2.codeSupp_comp | [
{
"state_after": "f g : Code\nk : Cont'\n⊢ trStmts₁ (trNormal g (Cont'.comp f k)) ∪\n (codeSupp' g (Cont'.comp f k) ∪ (trStmts₁ (trNormal f k) ∪ (codeSupp' f k ∪ contSupp k))) =\n trStmts₁ (trNormal g (Cont'.comp f k)) ∪ (codeSupp' g (Cont'.comp f k) ∪ (codeSupp' f k ∪ contSupp k))",
"state_before":... | [
1845,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1840,
1
] |
Mathlib/Analysis/Convex/Star.lean | StarConvex.prod | [] | [
146,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/NumberTheory/PellMatiyasevic.lean | Pell.xn_modEq_x2n_sub | [
{
"state_after": "a : ℕ\na1 : 1 < a\nn j : ℕ\nh : j ≤ 2 * n\njn : n ≤ j\nthis : 2 * n - j + j ≤ n + j\n⊢ xn a1 (2 * n - j) + xn a1 j ≡ 0 [MOD xn a1 n]",
"state_before": "a : ℕ\na1 : 1 < a\nn j : ℕ\nh : j ≤ 2 * n\njn : n ≤ j\n⊢ xn a1 (2 * n - j) + xn a1 j ≡ 0 [MOD xn a1 n]",
"tactic": "have : 2 * n - j +... | [
629,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
624,
1
] |
Mathlib/CategoryTheory/Sites/Grothendieck.lean | CategoryTheory.GrothendieckTopology.top_covering | [] | [
335,
5
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
334,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | Complex.tan_add_int_mul_pi | [] | [
1331,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1330,
1
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | intervalIntegral.integral_const | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.13713922\n𝕜 : Type ?u.13713925\nE : Type u_1\nF : Type ?u.13713931\nA : Type ?u.13713934\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\ninst✝ : NormedSpace ℝ E\na b : ℝ\nf g : ℝ → E\nμ : MeasureTheory.Measure ℝ\nc : E\n⊢ (∫ (x : ℝ) in a..... | [
642,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
640,
1
] |
Mathlib/RingTheory/AlgebraicIndependent.lean | AlgebraicIndependent.restrict_of_comp_subtype | [] | [
262,
5
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
260,
1
] |
Mathlib/Data/SetLike/Basic.lean | SetLike.not_le_iff_exists | [] | [
211,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
210,
1
] |
Mathlib/Data/Multiset/Range.lean | Multiset.range_succ | [
{
"state_after": "n : ℕ\n⊢ ↑[n] + ↑(List.range n) = n ::ₘ range n",
"state_before": "n : ℕ\n⊢ range (succ n) = n ::ₘ range n",
"tactic": "rw [range, List.range_succ, ← coe_add, add_comm]"
},
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ ↑[n] + ↑(List.range n) = n ::ₘ range n",
"... | [
39,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
38,
1
] |
Mathlib/Order/Hom/CompleteLattice.lean | map_iSup | [
{
"state_after": "no goals",
"state_before": "F : Type u_3\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.3707\nδ : Type ?u.3710\nι : Sort u_4\nκ : ι → Sort ?u.3718\ninst✝² : SupSet α\ninst✝¹ : SupSet β\ninst✝ : sSupHomClass F α β\nf : F\ng : ι → α\n⊢ ↑f (⨆ (i : ι), g i) = ⨆ (i : ι), ↑f (g i)",
"tactic": "sim... | [
132,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Mathlib/Combinatorics/Composition.lean | Composition.boundary_zero | [
{
"state_after": "no goals",
"state_before": "n : ℕ\nc : Composition n\n⊢ ↑(boundary c) 0 = 0",
"tactic": "simp [boundary, Fin.ext_iff]"
}
] | [
266,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
266,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.inter_insert_of_mem | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.184956\nγ : Type ?u.184959\ninst✝ : DecidableEq α\ns s₁✝ s₂✝ t t₁ t₂ u v : Finset α\na✝ b : α\ns₁ s₂ : Finset α\na : α\nh : a ∈ s₁\n⊢ s₁ ∩ insert a s₂ = insert a (s₁ ∩ s₂)",
"tactic": "rw [inter_comm, insert_inter_of_mem h, inter_co... | [
1658,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1657,
1
] |
Mathlib/Order/Lattice.lean | sup_left_right_swap | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝ : SemilatticeSup α\na✝ b✝ c✝ d a b c : α\n⊢ a ⊔ b ⊔ c = c ⊔ b ⊔ a",
"tactic": "rw [sup_comm, @sup_comm _ _ a, sup_assoc]"
}
] | [
262,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
1
] |
Mathlib/GroupTheory/Subsemigroup/Center.lean | Subsemigroup.mem_center_iff | [] | [
163,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/CategoryTheory/Adjunction/Mates.lean | CategoryTheory.transferNatTransSelf_id | [
{
"state_after": "case w.h\nC : Type u₁\nD : Type u₂\ninst✝¹ : Category C\ninst✝ : Category D\nL₁ L₂ L₃ : C ⥤ D\nR₁ R₂ R₃ : D ⥤ C\nadj₁ : L₁ ⊣ R₁\nadj₂ : L₂ ⊣ R₂\nadj₃ : L₃ ⊣ R₃\nx✝ : D\n⊢ (↑(transferNatTransSelf adj₁ adj₁) (𝟙 L₁)).app x✝ = (𝟙 R₁).app x✝",
"state_before": "C : Type u₁\nD : Type u₂\ninst✝¹... | [
188,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
185,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.PullbackCone.π_app_left | [] | [
531,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
531,
1
] |
Mathlib/Order/Bounded.lean | Set.unbounded_le_univ | [] | [
152,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Topology/MetricSpace/Isometry.lean | IsometryEquiv.nndist_eq | [] | [
360,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
358,
11
] |
Mathlib/Tactic/NormNum/Core.lean | Mathlib.Meta.NormNum.IsRat.to_isNat | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : Ring α\na✝ : ℕ\ninv : Invertible ↑1\nthis : Invertible 1\n⊢ ↑(Int.ofNat a✝) * ⅟↑1 = ↑a✝",
"tactic": "simp"
}
] | [
151,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Algebra/Associated.lean | Associates.isUnit_iff_eq_one | [] | [
886,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
885,
1
] |
Mathlib/CategoryTheory/Generator.lean | CategoryTheory.isSeparator_unop_iff | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nG : Cᵒᵖ\n⊢ IsSeparator G.unop ↔ IsCoseparator G",
"tactic": "rw [IsSeparator, IsCoseparator, ← isSeparating_unop_iff, Set.singleton_unop]"
}
] | [
419,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
418,
1
] |
Mathlib/MeasureTheory/Integral/SetIntegral.lean | MeasureTheory.set_integral_nonpos_le | [
{
"state_after": "α : Type u_1\nβ : Type ?u.297696\nE : Type ?u.297699\nF : Type ?u.297702\ninst✝ : MeasurableSpace α\nμ : Measure α\nf : α → ℝ\ns✝ s : Set α\nhs : MeasurableSet s\nhf : StronglyMeasurable f\nhfi : Integrable f\n⊢ (∫ (x : α), indicator {a | f a ≤ 0} (fun x => f x) x ∂μ) ≤ ∫ (x : α), indicator s ... | [
778,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
772,
1
] |
Mathlib/Algebra/Algebra/Unitization.lean | Unitization.fst_one | [] | [
360,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
359,
1
] |
Mathlib/Topology/VectorBundle/Basic.lean | VectorBundleCore.localTriv_symm_fst | [] | [
719,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
717,
1
] |
Mathlib/Algebra/Algebra/Hom.lean | AlgHom.comp_algebraMap | [] | [
242,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
241,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.update_zero_eq_erase | [
{
"state_after": "case a\nR : Type u\na b : R\nm n✝¹ : ℕ\ninst✝ : Semiring R\np✝ q p : R[X]\nn n✝ : ℕ\n⊢ coeff (update p n 0) n✝ = coeff (erase n p) n✝",
"state_before": "R : Type u\na b : R\nm n✝ : ℕ\ninst✝ : Semiring R\np✝ q p : R[X]\nn : ℕ\n⊢ update p n 0 = erase n p",
"tactic": "ext"
},
{
"s... | [
1108,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1106,
1
] |
Std/Data/List/Lemmas.lean | List.isPrefix.length_le | [] | [
1635,
22
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1634,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Concrete.lean | Equiv.Perm.length_toList | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : Fintype α\ninst✝ : DecidableEq α\np : Perm α\nx : α\n⊢ length (toList p x) = Finset.card (support (cycleOf p x))",
"tactic": "simp [toList]"
}
] | [
233,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
233,
1
] |
Std/Data/RBMap/WF.lean | Std.RBNode.Balanced.append | [
{
"state_after": "α : Type u_1\nc₁ : RBColor\nn : Nat\nc₂ : RBColor\nl r : RBNode α\nhl : Balanced l c₁ n\nhr : Balanced r c₂ n\n⊢ RedRed (c₁ = black → c₂ ≠ black)\n (match l, r with\n | nil, x => x\n | x, nil => x\n | node red a x b, node red c y d =>\n match append b c with\n | node red ... | [
383,
36
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
347,
11
] |
Mathlib/GroupTheory/Schreier.lean | Subgroup.card_commutator_dvd_index_center_pow | [
{
"state_after": "case pos\nG : Type u_1\ninst✝¹ : Group G\nH : Subgroup G\nR S : Set G\ninst✝ : Finite ↑(commutatorSet G)\nhG : index (center G) = 0\n⊢ Nat.card { x // x ∈ _root_.commutator G } ∣ index (center G) ^ (index (center G) * Nat.card ↑(commutatorSet G) + 1)\n\ncase neg\nG : Type u_1\ninst✝¹ : Group G... | [
181,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/RingTheory/GradedAlgebra/Basic.lean | DirectSum.coe_decompose_mul_of_left_mem_of_le | [
{
"state_after": "case intro\nι : Type u_3\nR : Type ?u.357840\nA : Type u_1\nσ : Type u_2\ninst✝⁸ : Semiring A\ninst✝⁷ : DecidableEq ι\ninst✝⁶ : CanonicallyOrderedAddMonoid ι\ninst✝⁵ : SetLike σ A\ninst✝⁴ : AddSubmonoidClass σ A\n𝒜 : ι → σ\ninst✝³ : GradedRing 𝒜\nb : A\nn i : ι\ninst✝² : Sub ι\ninst✝¹ : Orde... | [
318,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
315,
1
] |
Std/Data/Nat/Gcd.lean | Nat.coprime_one_left | [] | [
357,
60
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
357,
1
] |
Mathlib/LinearAlgebra/Prod.lean | LinearMap.prodMap_one | [] | [
341,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
340,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.mk_of_not_mem | [] | [
592,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
591,
1
] |
Mathlib/MeasureTheory/Constructions/Pi.lean | MeasureTheory.measurePreserving_piEquivPiSubtypeProd | [
{
"state_after": "ι✝ : Type ?u.5372445\nι' : Type ?u.5372448\nα✝ : ι✝ → Type ?u.5372453\ninst✝³ : Fintype ι✝\nm✝ : (i : ι✝) → OuterMeasure (α✝ i)\nι : Type u\nα : ι → Type v\ninst✝² : Fintype ι\nm : (i : ι) → MeasurableSpace (α i)\nμ : (i : ι) → Measure (α i)\ninst✝¹ : ∀ (i : ι), SigmaFinite (μ i)\np : ι → Prop... | [
747,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
735,
1
] |
Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean | PrimeSpectrum.sup_vanishingIdeal_le | [
{
"state_after": "R : Type u\nS : Type v\ninst✝¹ : CommRing R\ninst✝ : CommRing S\nt t' : Set (PrimeSpectrum R)\nr : R\n⊢ r ∈ vanishingIdeal t ⊔ vanishingIdeal t' → r ∈ vanishingIdeal (t ∩ t')",
"state_before": "R : Type u\nS : Type v\ninst✝¹ : CommRing R\ninst✝ : CommRing S\nt t' : Set (PrimeSpectrum R)\n⊢... | [
396,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
390,
1
] |
Mathlib/Logic/Basic.lean | forall_swap | [] | [
653,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
653,
1
] |
Mathlib/Data/Option/Defs.lean | Option.iget_some | [] | [
105,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/Order/GameAdd.lean | Prod.gameAdd_mk_iff | [] | [
73,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/MeasureTheory/Measure/NullMeasurable.lean | MeasureTheory.NullMeasurableSet.compl_iff | [] | [
136,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
135,
1
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineIsometryEquiv.coe_inv | [] | [
615,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
614,
1
] |
Mathlib/Data/Complex/Basic.lean | Complex.ofReal_prod | [] | [
1338,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1337,
1
] |
Mathlib/Topology/SubsetProperties.lean | IsCompact.nonempty_iInter_of_sequence_nonempty_compact_closed | [] | [
307,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
300,
1
] |
Mathlib/Data/Sum/Basic.lean | Sum.update_elim_inr | [
{
"state_after": "no goals",
"state_before": "α : Type u\nα' : Type w\nβ : Type v\nβ' : Type x\nγ : Type u_1\nδ : Type ?u.16302\ninst✝¹ : DecidableEq β\ninst✝ : DecidableEq (α ⊕ β)\nf : α → γ\ng : β → γ\ni : β\nx : γ\n⊢ x = Sum.elim f (update g i x) (inr i)",
"tactic": "simp"
},
{
"state_after":... | [
285,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
283,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.HasBasis.exists_iff | [] | [
381,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
376,
1
] |
Mathlib/LinearAlgebra/Finsupp.lean | Finsupp.mapRange.linearEquiv_apply | [] | [
858,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
857,
1
] |
Mathlib/Order/SymmDiff.lean | symmDiff_symmDiff_symmDiff_comm | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.73226\nα : Type u_1\nβ : Type ?u.73232\nπ : ι → Type ?u.73237\ninst✝ : GeneralizedBooleanAlgebra α\na b c d : α\n⊢ a ∆ b ∆ (c ∆ d) = a ∆ c ∆ (b ∆ d)",
"tactic": "simp_rw [symmDiff_assoc, symmDiff_left_comm]"
}
] | [
493,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
492,
1
] |
Mathlib/Data/Polynomial/Coeff.lean | Polynomial.coeff_mul_X_pow | [
{
"state_after": "case h₀\nR : Type u\nS : Type v\na b : R\nn✝ m : ℕ\ninst✝ : Semiring R\np✝ q r p : R[X]\nn d : ℕ\n⊢ ∀ (b : ℕ × ℕ), b ∈ Nat.antidiagonal (d + n) → b ≠ (d, n) → coeff p b.fst * coeff (X ^ n) b.snd = 0\n\ncase h₁\nR : Type u\nS : Type v\na b : R\nn✝ m : ℕ\ninst✝ : Semiring R\np✝ q r p : R[X]\nn d... | [
241,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
231,
1
] |
Mathlib/Topology/MetricSpace/Contracting.lean | ContractingWith.one_sub_K_ne_zero | [] | [
59,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
58,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.edges_map | [
{
"state_after": "no goals",
"state_before": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nf : G →g G'\nf' : G' →g G''\nu v u' v' : V\np : Walk G u v\n⊢ edges (Walk.map f p) = List.map (Sym2.map ↑f) (edges p)",
"tactic": "induction p with\n| nil =... | [
1524,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1519,
1
] |
Mathlib/Algebra/Order/Sub/Defs.lean | tsub_le_tsub_right | [] | [
109,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/LinearAlgebra/Matrix/DotProduct.lean | Matrix.dotProduct_star_self_eq_zero | [
{
"state_after": "no goals",
"state_before": "R : Type v\nn : Type w\ninst✝⁴ : Fintype n\ninst✝³ : PartialOrder R\ninst✝² : NonUnitalRing R\ninst✝¹ : StarOrderedRing R\ninst✝ : NoZeroDivisors R\nv : n → R\n⊢ (∀ (i : n), i ∈ Finset.univ → star (v i) * v i = 0) ↔ v = 0",
"tactic": "simp [Function.funext_i... | [
93,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/Data/Int/Dvd/Pow.lean | Int.dvd_of_pow_dvd | [] | [
38,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | DifferentiableWithinAt.csin | [] | [
389,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
387,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.fin_two_eq_of_eq_zero_iff | [
{
"state_after": "n m : ℕ\n⊢ ∀ {a b : Fin 2}, (a = 0 ↔ b = 0) → a = b",
"state_before": "n m : ℕ\na b : Fin 2\nh : a = 0 ↔ b = 0\n⊢ a = b",
"tactic": "revert a b"
},
{
"state_after": "no goals",
"state_before": "n m : ℕ\n⊢ ∀ {a b : Fin 2}, (a = 0 ↔ b = 0) → a = b",
"tactic": "simp [foral... | [
1777,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1775,
1
] |
Mathlib/NumberTheory/Multiplicity.lean | multiplicity.Nat.pow_add_pow | [
{
"state_after": "R : Type ?u.840239\nn✝ : ℕ\ninst✝ : CommRing R\na b x✝ y✝ : R\np : ℕ\nhp : Nat.Prime p\nhp1 : Odd p\nx y : ℕ\nhxy : p ∣ x + y\nhx : ¬p ∣ x\nn : ℕ\nhn : Odd n\n⊢ multiplicity ↑p ↑(x ^ n + y ^ n) = multiplicity ↑p ↑(x + y) + multiplicity p n",
"state_before": "R : Type ?u.840239\nn✝ : ℕ\nins... | [
249,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
244,
1
] |
Mathlib/Data/Set/Intervals/Disjoint.lean | IsLUB.biUnion_Iio_eq | [] | [
197,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
1
] |
Mathlib/Algebra/Order/Monoid/MinMax.lean | min_mul_mul_left | [] | [
53,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
52,
1
] |
Mathlib/Algebra/GroupPower/Order.lean | MonoidHom.map_sub_swap | [
{
"state_after": "no goals",
"state_before": "β : Type ?u.300600\nA : Type ?u.300603\nG : Type ?u.300606\nM : Type u_1\nR : Type u_2\ninst✝³ : Ring R\ninst✝² : Monoid M\ninst✝¹ : LinearOrder M\ninst✝ : CovariantClass M M (fun x x_1 => x * x_1) fun x x_1 => x ≤ x_1\nf : R →* M\nx y : R\n⊢ ↑f (x - y) = ↑f (y ... | [
808,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
808,
1
] |
Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean | LinearMap.toMatrix₂_compl₂ | [
{
"state_after": "R : Type u_1\nR₁ : Type ?u.1647539\nR₂ : Type ?u.1647542\nM : Type ?u.1647545\nM₁ : Type u_2\nM₂ : Type u_3\nM₁' : Type ?u.1647554\nM₂' : Type u_4\nn : Type u_5\nm : Type u_7\nn' : Type ?u.1647566\nm' : Type u_6\nι : Type ?u.1647572\ninst✝¹⁶ : CommRing R\ninst✝¹⁵ : AddCommMonoid M₁\ninst✝¹⁴ : ... | [
477,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
474,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.iUnion_mul_right_image | [] | [
484,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
483,
1
] |
Mathlib/Order/ModularLattice.lean | IsModularLattice.inf_sup_inf_assoc | [] | [
215,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Submodule.mul_annihilator | [
{
"state_after": "no goals",
"state_before": "R : Type u\nM : Type v\nF : Type ?u.61436\nG : Type ?u.61439\ninst✝² : CommSemiring R\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\nI✝ J : Ideal R\nN P : Submodule R M\nI : Ideal R\n⊢ I * annihilator I = ⊥",
"tactic": "rw [mul_comm, annihilator_mul]"
}
] | [
183,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/Order/Antisymmetrization.lean | antisymmRel_iff_eq | [] | [
74,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.pushoutCoconeOfLeftIso_ι_app_right | [] | [
1804,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1804,
1
] |
Mathlib/CategoryTheory/Abelian/Opposite.lean | CategoryTheory.image_ι_op_comp_imageUnopOp_hom | [
{
"state_after": "C : Type u_2\ninst✝¹ : Category C\ninst✝ : Abelian C\nX Y : C\nf : X ⟶ Y\nA B : Cᵒᵖ\ng : A ⟶ B\n⊢ (((((kernel.lift (cokernel.π g.unop) (cokernel.π (cokernel.π g.unop).op).unop\n (_ : (cokernel.π (cokernel.π g.unop).op).unop ≫ cokernel.π g.unop = 0) ≫\n (Abel... | [
179,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | ContDiffWithinAt.sin | [] | [
1049,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1047,
1
] |
Mathlib/NumberTheory/Padics/PadicNorm.lean | padicNorm.one | [
{
"state_after": "no goals",
"state_before": "p : ℕ\n⊢ padicNorm p 1 = 1",
"tactic": "simp [padicNorm]"
}
] | [
82,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
11
] |
Mathlib/Data/Complex/Basic.lean | Complex.normSq_inv | [] | [
820,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
819,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Basic.lean | Real.log_mul | [
{
"state_after": "no goals",
"state_before": "x y : ℝ\nhx : x ≠ 0\nhy : y ≠ 0\n⊢ exp (log (x * y)) = exp (log x + log y)",
"tactic": "rw [exp_log_eq_abs (mul_ne_zero hx hy), exp_add, exp_log_eq_abs hx, exp_log_eq_abs hy, abs_mul]"
}
] | [
131,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/ModelTheory/FinitelyGenerated.lean | FirstOrder.Language.Substructure.cg_bot | [] | [
142,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/Data/Set/Intervals/Group.lean | Set.pairwise_disjoint_Ioc_add_int_cast | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : OrderedRing α\na : α\n⊢ Pairwise (Disjoint on fun n => Ioc (a + ↑n) (a + ↑n + 1))",
"tactic": "simpa only [zsmul_one, Int.cast_add, Int.cast_one, ← add_assoc] using\n pairwise_disjoint_Ioc_add_zsmul a (1 : α)"
}
] | [
240,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Order/ModularLattice.lean | isModularLattice_iff_inf_sup_inf_assoc | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : Lattice α\nh : ∀ (x y z : α), x ⊓ z ⊔ y ⊓ z = (x ⊓ z ⊔ y) ⊓ z\nx✝ y z : α\nxz : x✝ ≤ z\n⊢ (x✝ ⊔ y) ⊓ z ≤ x✝ ⊔ y ⊓ z",
"tactic": "rw [← inf_eq_left.2 xz, h]"
}
] | [
384,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
381,
1
] |
Mathlib/Order/BoundedOrder.lean | top_unique | [] | [
163,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Finsupp.linearEquivFunOnFinite_single | [] | [
113,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
111,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.