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/Data/List/Lattice.lean | List.inter_cons_of_mem | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nl l₁✝ l₂ : List α\np : α → Prop\na : α\ninst✝ : DecidableEq α\nl₁ : List α\nh : a ∈ l₂\n⊢ (a :: l₁) ∩ l₂ = a :: l₁ ∩ l₂",
"tactic": "simp only [instInterList, List.inter, filter_cons_of_pos, h]"
}
] | [
147,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/Combinatorics/SimpleGraph/IncMatrix.lean | SimpleGraph.incMatrix_apply_mul_incMatrix_apply_of_not_adj | [
{
"state_after": "case h\nR : Type u_2\nα : Type u_1\nG : SimpleGraph α\ninst✝ : MulZeroOneClass R\na b : α\ne : Sym2 α\nhab : a ≠ b\nh : ¬Adj G a b\n⊢ ¬e ∈ incidenceSet G a ∩ incidenceSet G b",
"state_before": "R : Type u_2\nα : Type u_1\nG : SimpleGraph α\ninst✝ : MulZeroOneClass R\na b : α\ne : Sym2 α\nh... | [
91,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/RingTheory/WittVector/Defs.lean | WittVector.wittZSMul_vars | [] | [
422,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
420,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.multiset_prod_span_singleton | [
{
"state_after": "no goals",
"state_before": "R : Type u\nι : Type ?u.251146\ninst✝ : CommSemiring R\nI J K L : Ideal R\nm : Multiset R\n⊢ Multiset.prod (Multiset.map (fun x => span {x}) 0) = span {Multiset.prod 0}",
"tactic": "simp"
},
{
"state_after": "no goals",
"state_before": "R : Type ... | [
624,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
621,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.zero_toReal | [] | [
239,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
239,
9
] |
Mathlib/Logic/Basic.lean | Function.mt | [] | [
184,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
11
] |
Mathlib/Topology/Order/Basic.lean | interior_Ico | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝⁴ : TopologicalSpace α\ninst✝³ : LinearOrder α\ninst✝² : OrderTopology α\ninst✝¹ : DenselyOrdered α\na✝ b✝ : α\ns : Set α\ninst✝ : NoMinOrder α\na b : α\n⊢ interior (Ico a b) = Ioo a b",
"tactic": "rw [← Ici_inter_Iio... | [
2296,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2295,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | MvPowerSeries.eq_mul_inv_iff_mul_eq | [
{
"state_after": "no goals",
"state_before": "σ : Type u_1\nR : Type ?u.1886295\nk✝ : Type u_2\ninst✝ : Field k✝\nφ₁ φ₂ φ₃ : MvPowerSeries σ k✝\nh : ↑(constantCoeff σ k✝) φ₃ ≠ 0\nk : φ₁ = φ₂ * φ₃⁻¹\n⊢ φ₁ * φ₃ = φ₂",
"tactic": "simp [k, mul_assoc, MvPowerSeries.inv_mul_cancel _ h]"
},
{
"state_af... | [
997,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
994,
11
] |
Mathlib/Data/Rat/Floor.lean | Rat.round_cast | [
{
"state_after": "α : Type u_1\ninst✝¹ : LinearOrderedField α\ninst✝ : FloorRing α\nx : ℚ\nH : ↑2 = 2\n⊢ round ↑x = round x",
"state_before": "α : Type u_1\ninst✝¹ : LinearOrderedField α\ninst✝ : FloorRing α\nx : ℚ\n⊢ round ↑x = round x",
"tactic": "have H : ((2 : ℚ) : α) = (2 : α) := Rat.cast_coe_nat 2... | [
87,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
83,
1
] |
Mathlib/Analysis/Normed/Group/AddCircle.lean | AddCircle.coe_real_preimage_closedBall_eq_iUnion | [
{
"state_after": "case inl\nx ε : ℝ\n⊢ QuotientAddGroup.mk ⁻¹' closedBall (↑x) ε = ⋃ (z : ℤ), closedBall (x + z • 0) ε\n\ncase inr\np x ε : ℝ\nhp : p ≠ 0\n⊢ QuotientAddGroup.mk ⁻¹' closedBall (↑x) ε = ⋃ (z : ℤ), closedBall (x + z • p) ε",
"state_before": "p x ε : ℝ\n⊢ QuotientAddGroup.mk ⁻¹' closedBall (↑x)... | [
199,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
188,
1
] |
Mathlib/Analysis/Convex/Between.lean | Wbtw.trans_right_left | [
{
"state_after": "R : Type u_1\nV : Type u_2\nV' : Type ?u.578788\nP : Type u_3\nP' : Type ?u.578794\ninst✝³ : LinearOrderedField R\ninst✝² : AddCommGroup V\ninst✝¹ : Module R V\ninst✝ : AddTorsor V P\nw x y z : P\nh₁ : Wbtw R z x w\nh₂ : Wbtw R z y x\n⊢ Wbtw R y x w",
"state_before": "R : Type u_1\nV : Typ... | [
836,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
833,
1
] |
Mathlib/Order/Filter/FilterProduct.lean | Filter.Germ.max_def | [
{
"state_after": "case inl\nα : Type u\nβ : Type v\nφ : Ultrafilter α\ninst✝ : LinearOrder β\nx y : Germ (↑φ) β\na b : α → β\nh : ↑a ≤ ↑b\n⊢ max ↑a ↑b = map₂ max ↑a ↑b\n\ncase inr\nα : Type u\nβ : Type v\nφ : Ultrafilter α\ninst✝ : LinearOrder β\nx y : Germ (↑φ) β\na b : α → β\nh : ↑b ≤ ↑a\n⊢ max ↑a ↑b = map₂ m... | [
224,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
218,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | ContDiffWithinAt.congr' | [] | [
481,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
479,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | MonoidHom.liftOfRightInverse_comp | [] | [
3366,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3364,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_disj_sum | [
{
"state_after": "ι : Type ?u.308476\nβ : Type u\nα : Type v\nγ : Type w\ns✝ s₁ s₂ : Finset α\na : α\nf✝ g : α → β\ninst✝ : CommMonoid β\ns : Finset α\nt : Finset γ\nf : α ⊕ γ → β\n⊢ (∏ x in s, f (↑Function.Embedding.inl x)) * ∏ x in t, f (↑Function.Embedding.inr x) =\n (∏ x in s, f (Sum.inl x)) * ∏ x in t, ... | [
506,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
503,
1
] |
Mathlib/Data/Nat/Basic.lean | Nat.one_add_le_iff | [
{
"state_after": "no goals",
"state_before": "m n k a b : ℕ\n⊢ 1 + a ≤ b ↔ a < b",
"tactic": "simp only [add_comm, add_one_le_iff]"
}
] | [
233,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
233,
1
] |
Mathlib/GroupTheory/Submonoid/Pointwise.lean | Submonoid.smul_bot | [] | [
254,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
253,
1
] |
Mathlib/Topology/Algebra/Valuation.lean | Valued.mem_nhds | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝¹ : Ring R\nΓ₀ : Type v\ninst✝ : LinearOrderedCommGroupWithZero Γ₀\n_i : Valued R Γ₀\ns : Set R\nx : R\n⊢ s ∈ 𝓝 x ↔ ∃ γ, {y | ↑v (y - x) < ↑γ} ⊆ s",
"tactic": "simp only [← nhds_translation_add_neg x, ← sub_eq_add_neg, preimage_setOf_eq, tr... | [
142,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
src/lean/Init/Classical.lean | Classical.epsilon_spec_aux | [] | [
98,
45
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
97,
1
] |
Mathlib/GroupTheory/GroupAction/Group.lean | smul_ne_zero_iff_ne' | [] | [
292,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
291,
1
] |
Mathlib/Data/Rat/Cast.lean | Rat.cast_ne_zero | [] | [
215,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Algebra/Module/Equiv.lean | LinearEquiv.invFun_eq_symm | [] | [
303,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
302,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.IsSt.neg | [] | [
408,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
407,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.smul_finset_inter₀ | [] | [
2061,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2060,
1
] |
Mathlib/Algebra/Order/Sub/Canonical.lean | tsub_lt_tsub_right_of_le | [] | [
278,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.IsNormal.deriv_fp | [] | [
539,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
538,
1
] |
Mathlib/Combinatorics/Quiver/Symmetric.lean | Quiver.symmetrify_reverse | [] | [
126,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/Order/CompactlyGenerated.lean | DirectedOn.inf_sSup_eq | [
{
"state_after": "ι : Sort ?u.89037\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⊢ ∀ (c : α), CompleteLattice.IsCompactElement c → c ≤ a ⊓ sSup s → c ≤ ⨆ (b : α) (_ : b ∈ s), a ⊓ b",... | [
376,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
363,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.Relabelling.mk'_rightMovesEquiv | [] | [
1065,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1063,
1
] |
Mathlib/Algebra/BigOperators/Multiset/Lemmas.lean | Multiset.prod_eq_one_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : CanonicallyOrderedMonoid α\nm : Multiset α\nl : List α\n⊢ prod (Quotient.mk (List.isSetoid α) l) = 1 ↔ ∀ (x : α), x ∈ Quotient.mk (List.isSetoid α) l → x = 1",
"tactic": "simpa using List.prod_eq_one_iff l"
}
] | [
28,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
26,
1
] |
Mathlib/Data/Matrix/Notation.lean | Matrix.dotProduct_empty | [] | [
143,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Ioo_subset_Ioo_right | [] | [
444,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
443,
1
] |
Mathlib/Dynamics/PeriodicPts.lean | Function.isPeriodicPt_iff_minimalPeriod_dvd | [] | [
405,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
404,
1
] |
Mathlib/GroupTheory/Complement.lean | Subgroup.card_left_transversal | [] | [
282,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
281,
1
] |
Mathlib/CategoryTheory/StructuredArrow.lean | CategoryTheory.StructuredArrow.map_comp | [
{
"state_after": "C : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nS S' S'' : D\nY Y' : C\nT : C ⥤ D\nf : S ⟶ S'\nf' : S' ⟶ S''\nh : StructuredArrow S'' T\n⊢ (map (f ≫ f')).obj (mk h.hom) = (map f).obj ((map f').obj (mk h.hom))",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nD : Type ... | [
218,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
1
] |
Mathlib/Topology/Category/Profinite/Basic.lean | Profinite.isIso_of_bijective | [] | [
326,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
324,
1
] |
Mathlib/Analysis/ODE/PicardLindelof.lean | PicardLindelof.FunSpace.dist_le_of_forall | [] | [
249,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
246,
1
] |
Mathlib/Order/LocallyFinite.lean | WithTop.Icc_coe_top | [] | [
1113,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1112,
1
] |
Mathlib/Analysis/NormedSpace/lpSpace.lean | lp.coeFn_zero | [] | [
362,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.coeSubtype | [] | [
796,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
795,
1
] |
Mathlib/Data/Nat/Choose/Central.lean | Nat.four_pow_le_two_mul_self_mul_centralBinom | [
{
"state_after": "no goals",
"state_before": "x✝ : 0 < 1\n⊢ 4 ^ 1 ≤ 2 * 1 * centralBinom 1",
"tactic": "norm_num [centralBinom, choose]"
},
{
"state_after": "no goals",
"state_before": "x✝ : 0 < 2\n⊢ 4 ^ 2 ≤ 2 * 2 * centralBinom 2",
"tactic": "norm_num [centralBinom, choose]"
},
{
... | [
117,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Algebra/CharP/Basic.lean | frobenius_sub | [] | [
438,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
437,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.nhds_zero | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.48158\nβ : Type ?u.48161\nγ : Type ?u.48164\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nx y z ε ε₁ ε₂ : ℝ≥0∞\ns : Set ℝ≥0∞\n⊢ (⨅ (l : ℝ≥0∞) (_ : ⊥ < l), 𝓟 (Iio l)) = ⨅ (a : ℝ≥0∞) (_ : a ≠ 0), 𝓟 (Iio a)",
"tactic": "simp [pos_iff_ne_zero, Iio]"
}
] | [
197,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
1
] |
Mathlib/Data/Set/Pairwise/Basic.lean | pairwise_subtype_iff_pairwise_set | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.31833\nγ : Type ?u.31836\nι : Type ?u.31839\nι' : Type ?u.31842\nr✝ p q : α → α → Prop\ns : Set α\nr : α → α → Prop\n⊢ (Pairwise fun x y => r ↑x ↑y) ↔ Set.Pairwise s r",
"tactic": "simp only [Pairwise, Set.Pairwise, SetCoe.forall, N... | [
226,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/Topology/Algebra/UniformGroup.lean | TendstoUniformlyOnFilter.div | [] | [
491,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
488,
1
] |
Mathlib/Topology/Algebra/Group/Basic.lean | topologicalGroup_sInf | [] | [
1794,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1787,
1
] |
Std/Data/RBMap/Alter.lean | Std.RBNode.Path.zoom_zoomed₁ | [
{
"state_after": "α✝ : Type u_1\ncut : α✝ → Ordering\nt : RBNode α✝\npath : Path α✝\nt'✝ : RBNode α✝\npath'✝ : Path α✝\ne : zoom cut t path = (t'✝, path'✝)\npath' : Path α✝\nt' : RBNode α✝\nc✝ : RBColor\nl✝ : RBNode α✝\nv✝ : α✝\nr✝ : RBNode α✝\n⊢ zoom cut (node c✝ l✝ v✝ r✝) path = (t', path') → OnRoot (fun x =>... | [
225,
42
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
218,
1
] |
Mathlib/Analysis/NormedSpace/AddTorsorBases.lean | IsOpen.affineSpan_eq_top | [] | [
134,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | IsCompact.exists_open_superset_measure_lt_top' | [
{
"state_after": "case refine'_1\nα : Type u_1\nβ : Type ?u.3553252\nγ : Type ?u.3553255\nδ : Type ?u.3553258\nι : Type ?u.3553261\nR : Type ?u.3553264\nR' : Type ?u.3553267\ninst✝¹ : TopologicalSpace α\ninst✝ : MeasurableSpace α\nμ : MeasureTheory.Measure α\ns : Set α\nh : IsCompact s\nhμ : ∀ (x : α), x ∈ s → ... | [
4474,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
4461,
1
] |
Mathlib/Data/Holor.lean | Holor.cprankMax_1 | [
{
"state_after": "α : Type\nd : ℕ\nds ds₁ ds₂ ds₃ : List ℕ\ninst✝¹ : Monoid α\ninst✝ : AddMonoid α\nx : Holor α ds\nh : CPRankMax1 x\nh' : CPRankMax (0 + 1) (x + 0)\n⊢ CPRankMax 1 x",
"state_before": "α : Type\nd : ℕ\nds ds₁ ds₂ ds₃ : List ℕ\ninst✝¹ : Monoid α\ninst✝ : AddMonoid α\nx : Holor α ds\nh : CPRan... | [
335,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
332,
1
] |
Mathlib/Order/SuccPred/Basic.lean | Order.lt_succ | [] | [
332,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
331,
1
] |
Mathlib/Order/JordanHolder.lean | CompositionSeries.Equivalent.append | [
{
"state_after": "X : Type u\ninst✝¹ : Lattice X\ninst✝ : JordanHolderLattice X\ns₁ s₂ t₁ t₂ : CompositionSeries X\nhs : top s₁ = bot s₂\nht : top t₁ = bot t₂\nh₁ : Equivalent s₁ t₁\nh₂ : Equivalent s₂ t₂\ne : Fin (s₁.length + s₂.length) ≃ Fin (t₁.length + t₂.length) :=\n Trans.trans (Trans.trans finSumFinEqui... | [
660,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
645,
1
] |
Mathlib/LinearAlgebra/TensorAlgebra/Basic.lean | TensorAlgebra.hom_ext | [
{
"state_after": "R : Type u_2\ninst✝⁴ : CommSemiring R\nM : Type u_3\ninst✝³ : AddCommMonoid M\ninst✝² : Module R M\nA : Type u_1\ninst✝¹ : Semiring A\ninst✝ : Algebra R A\nf g : TensorAlgebra R M →ₐ[R] A\nw : ↑(lift R).symm f = ↑(lift R).symm g\n⊢ f = g",
"state_before": "R : Type u_2\ninst✝⁴ : CommSemiri... | [
162,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
159,
1
] |
Mathlib/MeasureTheory/Function/LpSpace.lean | MeasureTheory.Memℒp.neg_part | [] | [
1100,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1098,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Products.lean | CategoryTheory.Limits.Sigma.ι_reindex_inv | [
{
"state_after": "no goals",
"state_before": "β : Type w\nC : Type u\ninst✝² : Category C\nγ : Type v\nε : β ≃ γ\nf : γ → C\ninst✝¹ : HasCoproduct f\ninst✝ : HasCoproduct (f ∘ ↑ε)\nb : β\n⊢ ι f (↑ε b) ≫ (reindex ε f).inv = ι (f ∘ ↑ε) b",
"tactic": "simp [Iso.comp_inv_eq]"
}
] | [
445,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
444,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | LinearMap.coe_compMultilinearMap | [] | [
790,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
788,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.coe_ne_top | [] | [
283,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
283,
9
] |
Mathlib/SetTheory/Ordinal/Basic.lean | Ordinal.typein_apply | [
{
"state_after": "α✝ : Type ?u.73654\nβ✝ : Type ?u.73657\nγ : Type ?u.73660\nr✝ : α✝ → α✝ → Prop\ns✝ : β✝ → β✝ → Prop\nt : γ → γ → Prop\nα β : Type u_1\nr : α → α → Prop\ns : β → β → Prop\ninst✝¹ : IsWellOrder α r\ninst✝ : IsWellOrder β s\nf : r ≼i s\na : α\nx✝ : ↑{b | r b a}\nx : α\nh : x ∈ {b | r b a}\n⊢ ↑f.t... | [
471,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
461,
1
] |
Mathlib/MeasureTheory/Covering/BesicovitchVectorSpace.lean | Besicovitch.SatelliteConfig.centerAndRescale_radius | [
{
"state_after": "no goals",
"state_before": "E : Type u_1\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℝ E\nN✝ : ℕ\nτ✝ : ℝ\na✝ : SatelliteConfig E N✝ τ✝\nN : ℕ\nτ : ℝ\na : SatelliteConfig E N τ\n⊢ r (centerAndRescale a) (last N) = 1",
"tactic": "simp [SatelliteConfig.centerAndRescale, inv_mul_ca... | [
124,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/Data/Polynomial/Degree/Lemmas.lean | Polynomial.degree_pos_of_root | [
{
"state_after": "R : Type u\nS : Type v\nι : Type w\na b : R\nm n : ℕ\ninst✝ : Semiring R\np✝ q r p : R[X]\nhp : p ≠ 0\nh : IsRoot p a\nhlt : 0 ≥ degree p\nthis : p = ↑C (coeff p 0)\n⊢ False",
"state_before": "R : Type u\nS : Type v\nι : Type w\na b : R\nm n : ℕ\ninst✝ : Semiring R\np✝ q r p : R[X]\nhp : p... | [
71,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/RingTheory/Localization/Basic.lean | IsLocalization.sec_spec' | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\ninst✝⁴ : CommSemiring R\nM : Submonoid R\nS : Type u_1\ninst✝³ : CommSemiring S\ninst✝² : Algebra R S\nP : Type ?u.248906\ninst✝¹ : CommSemiring P\ninst✝ : IsLocalization M S\nz : S\n⊢ ↑(algebraMap R S) (sec M z).fst = ↑(algebraMap R S) ↑(sec M z).... | [
206,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/RingTheory/Localization/LocalizationLocalization.lean | IsLocalization.localization_localization_map_units | [
{
"state_after": "case intro.intro\nR : Type u_3\ninst✝⁹ : CommRing R\nM : Submonoid R\nS : Type u_1\ninst✝⁸ : CommRing S\ninst✝⁷ : Algebra R S\nP : Type ?u.58093\ninst✝⁶ : CommRing P\nN : Submonoid S\nT : Type u_2\ninst✝⁵ : CommRing T\ninst✝⁴ : Algebra R T\ninst✝³ : Algebra S T\ninst✝² : IsScalarTower R S T\ni... | [
73,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/Data/List/Cycle.lean | Cycle.next_reverse_eq_prev' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : DecidableEq α\ns : Cycle α\nhs : Nodup (reverse s)\nx : α\nhx : x ∈ reverse s\n⊢ next (reverse s) hs x hx = prev s (_ : Nodup s) x (_ : x ∈ s)",
"tactic": "simp [← prev_reverse_eq_next]"
}
] | [
868,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
866,
1
] |
Mathlib/MeasureTheory/Function/LocallyIntegrable.lean | MeasureTheory.locallyIntegrableOn_const | [] | [
215,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/Order/BoundedOrder.lean | not_isBot_iff_ne_bot | [] | [
354,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
353,
1
] |
Mathlib/Combinatorics/SetFamily/LYM.lean | Finset.IsAntichain.sperner | [
{
"state_after": "𝕜 : Type ?u.33953\nα : Type u_1\ninst✝¹ : LinearOrderedField 𝕜\ninst✝ : Fintype α\n𝒜 : Finset (Finset α)\nh𝒜 : IsAntichain (fun x x_1 => x ⊆ x_1) ↑𝒜\n⊢ ∑ r in Iic (Fintype.card α), ↑(card (𝒜 # r)) / ↑(Nat.choose (Fintype.card α) (Fintype.card α / 2)) ≤ 1",
"state_before": "𝕜 : Type ... | [
249,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
232,
1
] |
Mathlib/Data/Set/Image.lean | Set.compl_range_some | [] | [
1192,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1191,
1
] |
Mathlib/CategoryTheory/Limits/Types.lean | CategoryTheory.Limits.Types.colimitEquivQuot_apply | [
{
"state_after": "case a\nJ : Type v\ninst✝ : SmallCategory J\nF : J ⥤ TypeMax\nj : J\nx : F.obj j\n⊢ ↑(colimitEquivQuot F).symm (↑(colimitEquivQuot F) (colimit.ι F j x)) =\n ↑(colimitEquivQuot F).symm (Quot.mk (Quot.Rel F) { fst := j, snd := x })",
"state_before": "J : Type v\ninst✝ : SmallCategory J\nF... | [
304,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.insert_val | [] | [
1048,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1047,
1
] |
Mathlib/AlgebraicGeometry/PresheafedSpace.lean | AlgebraicGeometry.PresheafedSpace.ext | [
{
"state_after": "no goals",
"state_before": "C : Type ?u.71852\ninst✝ : Category C\nX Y : PresheafedSpace C\nα β : X ⟶ Y\nw : α.base = β.base\n⊢ Functor.op (Opens.map α.base) = Functor.op (Opens.map β.base)",
"tactic": "rw [w]"
}
] | [
192,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.prod_bot | [
{
"state_after": "case h.mk\nR : Type u_3\nR₂ : Type ?u.251481\nK : Type ?u.251484\nM : Type u_1\nM₂ : Type ?u.251490\nV : Type ?u.251493\nS : Type ?u.251496\ninst✝⁷ : Semiring R\ninst✝⁶ : AddCommMonoid M\ninst✝⁵ : Module R M\nx✝ : M\np p' : Submodule R M\ninst✝⁴ : Semiring R₂\nσ₁₂ : R →+* R₂\ninst✝³ : AddCommM... | [
790,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
790,
1
] |
src/lean/Init/SimpLemmas.lean | Bool.not_eq_true | [
{
"state_after": "no goals",
"state_before": "b : Bool\n⊢ (¬b = true) = (b = false)",
"tactic": "cases b <;> decide"
}
] | [
136,
99
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
136,
9
] |
Mathlib/Data/List/Perm.lean | List.perm_ext | [] | [
746,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
743,
1
] |
Mathlib/Topology/Sheaves/SheafCondition/Sites.lean | TopCat.Presheaf.presieveOfCovering.mem_grothendieckTopology | [
{
"state_after": "X : TopCat\nι : Type v\nU : ι → Opens ↑X\nx : ↑X\nhx : x ∈ iSup U\n⊢ ∃ U_1 f, (Sieve.generate (presieveOfCovering U)).arrows f ∧ x ∈ U_1",
"state_before": "X : TopCat\nι : Type v\nU : ι → Opens ↑X\n⊢ Sieve.generate (presieveOfCovering U) ∈ GrothendieckTopology.sieves (Opens.grothendieckTop... | [
110,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
106,
1
] |
Std/Data/String/Lemmas.lean | String.utf8GetAux_addChar_right_cancel | [] | [
197,
86
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
196,
1
] |
Mathlib/Topology/Algebra/Order/Floor.lean | tendsto_fract_left | [] | [
177,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | HasFDerivAtFilter.sub | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type u_3\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type ?u.446548\ninst✝³ : NormedAddCommGroup G\ninst✝² : Normed... | [
483,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
481,
1
] |
Mathlib/Analysis/Calculus/TangentCone.lean | uniqueDiffWithinAt_Iio | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.188395\ninst✝⁶ : NontriviallyNormedField 𝕜\nE : Type ?u.188401\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\nF : Type ?u.188496\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nG : Type ?u.188586\ninst✝¹ : NormedAddCommGroup ... | [
466,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
465,
1
] |
Mathlib/Algebra/Order/UpperLower.lean | IsLowerSet.smul_subset | [] | [
37,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
36,
1
] |
Mathlib/Data/Finsupp/AList.lean | AList.lookupFinsupp_apply | [
{
"state_after": "α : Type u_1\nM : Type u_2\ninst✝¹ : Zero M\ninst✝ : DecidableEq α\nl : AList fun _x => M\na : α\n⊢ Option.getD (lookup a l) 0 = Option.getD (lookup a l) 0",
"state_before": "α : Type u_1\nM : Type u_2\ninst✝¹ : Zero M\ninst✝ : DecidableEq α\nl : AList fun _x => M\na : α\n⊢ ↑(lookupFinsupp... | [
83,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Mathlib/CategoryTheory/Preadditive/ProjectiveResolution.lean | CategoryTheory.ProjectiveResolution.lift_commutes | [
{
"state_after": "case h\nC : Type u\ninst✝⁴ : Category C\ninst✝³ : HasZeroObject C\ninst✝² : HasZeroMorphisms C\ninst✝¹ : HasEqualizers C\ninst✝ : HasImages C\nY Z : C\nf : Y ⟶ Z\nP : ProjectiveResolution Y\nQ : ProjectiveResolution Z\n⊢ HomologicalComplex.Hom.f (lift f P Q ≫ Q.π) 0 = HomologicalComplex.Hom.f ... | [
209,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
207,
1
] |
Mathlib/CategoryTheory/Sites/Sieves.lean | CategoryTheory.Sieve.union_apply | [] | [
374,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
373,
1
] |
Mathlib/MeasureTheory/Measure/NullMeasurable.lean | Finset.nullMeasurableSet | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.22585\nα : Type u_1\nβ : Type ?u.22591\nγ : Type ?u.22594\nm0 : MeasurableSpace α\nμ : Measure α\ns✝ t : Set α\ninst✝ : MeasurableSingletonClass (NullMeasurableSpace α)\ns : Finset α\n⊢ NullMeasurableSet ↑s",
"tactic": "apply Finset.measurableSet... | [
370,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
369,
11
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.natDegree_monomial_le | [
{
"state_after": "R : Type u\nS : Type v\na✝ b c d : R\nn m✝ : ℕ\ninst✝ : Semiring R\np q r : R[X]\na : R\nm : ℕ\n⊢ (if a = 0 then 0 else m) ≤ m",
"state_before": "R : Type u\nS : Type v\na✝ b c d : R\nn m✝ : ℕ\ninst✝ : Semiring R\np q r : R[X]\na : R\nm : ℕ\n⊢ natDegree (↑(monomial m) a) ≤ m",
"tactic"... | [
337,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
334,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.prod_map_atBot_eq | [] | [
1421,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1419,
1
] |
Mathlib/Data/PFun.lean | PFun.dom_coe | [] | [
153,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/Data/Set/Finite.lean | Set.Finite.toFinset_symmDiff | [
{
"state_after": "case a\nα : Type u\nβ : Type v\nι : Sort w\nγ : Type x\ns t : Set α\na : α\nhs✝ : Set.Finite s\nht✝ : Set.Finite t\ninst✝ : DecidableEq α\nhs : Set.Finite s\nht : Set.Finite t\nh : Set.Finite (s ∆ t)\na✝ : α\n⊢ a✝ ∈ Finite.toFinset h ↔ a✝ ∈ Finite.toFinset hs ∆ Finite.toFinset ht",
"state_... | [
260,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
257,
11
] |
Mathlib/MeasureTheory/MeasurableSpaceDef.lean | MeasurableSet.univ | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.3526\nγ : Type ?u.3529\nδ : Type ?u.3532\nδ' : Type ?u.3535\nι : Sort ?u.3538\ns t u : Set α\nm : MeasurableSpace α\n⊢ MeasurableSet (univᶜ)",
"tactic": "simp"
}
] | [
105,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
11
] |
Mathlib/Topology/UniformSpace/Basic.lean | UniformSpace.le_sInf | [] | [
1180,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1178,
11
] |
Mathlib/CategoryTheory/Limits/Opposites.lean | CategoryTheory.Limits.hasLimitsOfShape_of_hasColimitsOfShape_op | [] | [
263,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
1
] |
Mathlib/Data/Set/Intervals/ProjIcc.lean | Set.projIcc_surjective | [] | [
87,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Topology/Order.lean | induced_iff_nhds_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type ?u.44785\nf✝ : α → β\nι : Sort ?u.44792\ntα : TopologicalSpace α\ntβ : TopologicalSpace β\nf : β → α\nh : ∀ (b : β), 𝓝 b = comap f (𝓝 (f b))\nx : β\n⊢ 𝓝 x = 𝓝 x",
"tactic": "rw [h, nhds_induced]"
}
] | [
847,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
844,
1
] |
Mathlib/Topology/Algebra/Order/LiminfLimsup.lean | Filter.Tendsto.limsup_eq | [] | [
201,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
199,
1
] |
Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean | Gamma_normal | [] | [
73,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Combinatorics/SetFamily/Intersecting.lean | Set.Intersecting.is_max_iff_card_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝² : BooleanAlgebra α\ninst✝¹ : Nontrivial α\ninst✝ : Fintype α\ns : Finset α\nhs : Intersecting ↑s\n⊢ (∀ (t : Finset α), Intersecting ↑t → s ⊆ t → s = t) ↔ 2 * card s = Fintype.card α",
"tactic": "classical\n refine'\n ⟨fun h => _, fun... | [
197,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
1
] |
Mathlib/LinearAlgebra/Basis.lean | Basis.extend_apply_self | [] | [
1421,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1419,
1
] |
Mathlib/Topology/UniformSpace/Equiv.lean | UniformEquiv.prodComm_symm | [] | [
310,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
309,
1
] |
Mathlib/SetTheory/Cardinal/Continuum.lean | Cardinal.aleph0_mul_continuum | [] | [
167,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
166,
1
] |
Mathlib/Data/Dfinsupp/Interval.lean | Dfinsupp.mem_rangeIcc_apply_iff | [] | [
125,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/CategoryTheory/EqToHom.lean | CategoryTheory.eqToHom_app | [
{
"state_after": "C : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nF : C ⥤ D\nX : C\n⊢ (eqToHom (_ : F = F)).app X = eqToHom (_ : F.obj X = F.obj X)",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nF G : C ⥤ D\nh : F = G\nX : C\n⊢ (eqToHom h).app X = eq... | [
285,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.