url stringclasses 3
values | commit stringclasses 3
values | file_path stringlengths 20 79 | full_name stringlengths 3 115 | start list | end list | traced_tactics stringlengths 2 997k |
|---|---|---|---|---|---|---|
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Matrix/Notation.lean | Matrix.empty_mul | [
247,
1
] | [
248,
13
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/SpecificGroups/Alternating.lean | Equiv.Perm.isThreeCycle_sq_of_three_mem_cycleType_five | [
194,
1
] | [
207,
38
] | [{"tactic": "obtain \u27e8c, g', rfl, hd, _, h3\u27e9 := mem_cycleType_iff.1 h", "annotated_tactic": ["obtain \u27e8c, g', rfl, hd, _, h3\u27e9 := <a>mem_cycleType_iff</a>.1 h", [{"full_name": "Equiv.Perm.mem_cycleType_iff", "def_path": "Mathlib/GroupTheory/Perm/Cycle/Type.lean", "def_pos": [289, 9], "def_end_pos": [28... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/List/OfFn.lean | List.ofFn_eq_nil_iff | [
131,
1
] | [
132,
83
] | [{"tactic": "cases n <;> simp only [ofFn_zero, ofFn_succ, eq_self_iff_true, Nat.succ_ne_zero]", "annotated_tactic": ["cases n <;> simp only [<a>ofFn_zero</a>, <a>ofFn_succ</a>, <a>eq_self_iff_true</a>, <a>Nat.succ_ne_zero</a>]", [{"full_name": "List.ofFn_zero", "def_path": "Mathlib/Data/List/OfFn.lean", "def_pos": [109... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Probability/Moments.lean | ProbabilityTheory.cgf_neg | [
216,
1
] | [
216,
75
] | [{"tactic": "simp_rw [cgf, mgf_neg]", "annotated_tactic": ["simp_rw [<a>cgf</a>, <a>mgf_neg</a>]", [{"full_name": "ProbabilityTheory.cgf", "def_path": "Mathlib/Probability/Moments.lean", "def_pos": [108, 5], "def_end_pos": [108, 8]}, {"full_name": "ProbabilityTheory.mgf_neg", "def_path": "Mathlib/Probability/Moments.le... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/Sequences.lean | continuous_iff_seqContinuous | [
227,
1
] | [
229,
55
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/GroupPower/Basic.lean | Commute.zpow_left | [
486,
1
] | [
487,
29
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/GCDMonoid/Finset.lean | Finset.gcd_eq_zero_iff | [
210,
1
] | [
221,
29
] | [{"tactic": "rw [gcd_def, Multiset.gcd_eq_zero_iff]", "annotated_tactic": ["rw [<a>gcd_def</a>, <a>Multiset.gcd_eq_zero_iff</a>]", [{"full_name": "Finset.gcd_def", "def_path": "Mathlib/Algebra/GCDMonoid/Finset.lean", "def_pos": [141, 9], "def_end_pos": [141, 16]}, {"full_name": "Multiset.gcd_eq_zero_iff", "def_path": "... |
https://github.com/leanprover/std4 | 869c615eb10130c0637a7bc038e2b80253559913 | lake-packages/std/Std/Logic.lean | Decidable.not_iff_comm | [
594,
1
] | [
595,
79
] | [{"tactic": "rw [@iff_def (\u00aca), @iff_def (\u00acb)]", "annotated_tactic": ["rw [@<a>iff_def</a> (\u00aca), @<a>iff_def</a> (\u00acb)]", [{"full_name": "iff_def", "def_path": "lake-packages/std/Std/Logic.lean", "def_pos": [38, 9], "def_end_pos": [38, 16]}, {"full_name": "iff_def", "def_path": "lake-packages/std/Std... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/InnerProductSpace/Adjoint.lean | LinearMap.eq_adjoint_iff_basis | [
442,
1
] | [
447,
86
] | [{"tactic": "refine' \u27e8fun h x y => by rw [h, adjoint_inner_left], fun h => _\u27e9", "annotated_tactic": ["refine' \u27e8fun h x y => by rw [h, <a>adjoint_inner_left</a>], fun h => _\u27e9", [{"full_name": "LinearMap.adjoint_inner_left", "def_path": "Mathlib/Analysis/InnerProductSpace/Adjoint.lean", "def_pos": [39... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.eval_prod | [
1193,
1
] | [
1195,
24
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Tactic/NormNum/Basic.lean | Mathlib.Meta.NormNum.isNat_natSucc | [
473,
1
] | [
475,
36
] | [{"tactic": "simp", "annotated_tactic": ["simp", []], "state_before": "n\u271d : \u2115\n\u22a2 Nat.succ \u2191n\u271d = \u2191(Nat.succ n\u271d)", "state_after": "no goals"}] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/MellinTransform.lean | mellinConvergent_of_isBigO_rpow | [
290,
1
] | [
296,
100
] | [{"tactic": "rw [MellinConvergent,\n mellin_convergent_iff_norm Subset.rfl measurableSet_Ioi hfc.aestronglyMeasurable]", "annotated_tactic": ["rw [<a>MellinConvergent</a>,\n <a>mellin_convergent_iff_norm</a> <a>Subset.rfl</a> <a>measurableSet_Ioi</a> hfc.aestronglyMeasurable]", [{"full_name": "MellinConvergent", "d... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Calculus/FDeriv/Mul.lean | Differentiable.smul | [
211,
1
] | [
212,
71
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Computability/Language.lean | Language.nil_mem_one | [
105,
1
] | [
106,
22
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | fderivWithin_csin | [
404,
1
] | [
406,
45
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/Localization/NumDen.lean | IsFractionRing.mk'_num_den | [
67,
1
] | [
68,
82
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Function/Egorov.lean | MeasureTheory.Egorov.iUnionNotConvergentSeq_measurableSet | [
140,
1
] | [
144,
82
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.leadingCoeff_mul | [
1623,
1
] | [
1629,
86
] | [{"tactic": "by_cases hp : p = 0", "annotated_tactic": ["by_cases hp : p = 0", []], "state_before": "R : Type u\nS : Type v\na b c d : R\nn m : \u2115\ninst\u271d\u00b9 : Semiring R\ninst\u271d : NoZeroDivisors R\np\u271d q\u271d p q : R[X]\n\u22a2 leadingCoeff (p * q) = leadingCoeff p * leadingCoeff q", "state_after":... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/MetricSpace/ShrinkingLemma.lean | exists_iUnion_ball_eq_radius_lt | [
52,
1
] | [
56,
33
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean | CategoryTheory.Limits.eq_of_epi_equalizer | [
884,
1
] | [
885,
62
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | AffineSubspace.span_union | [
739,
1
] | [
740,
37
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Module/Submodule/Lattice.lean | Submodule.mem_right_iff_eq_zero_of_disjoint | [
384,
1
] | [
386,
88
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Quaternion.lean | Quaternion.rat_cast_imK | [
1397,
1
] | [
1398,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Sym/Basic.lean | Sym.cons_erase | [
223,
1
] | [
224,
41
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/GroupAction/FixingSubgroup.lean | fixedPoints_subgroup_antitone | [
136,
1
] | [
137,
59
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/CharP/Basic.lean | RingHom.charP_iff_charP | [
322,
1
] | [
324,
73
] | [{"tactic": "simp only [charP_iff, \u2190 f.injective.eq_iff, map_natCast f, f.map_zero]", "annotated_tactic": ["simp only [<a>charP_iff</a>, \u2190 f.injective.eq_iff, <a>map_natCast</a> f, f.map_zero]", [{"full_name": "charP_iff", "def_path": "Mathlib/Algebra/CharP/Basic.lean", "def_pos": [104, 10], "def_end_pos": [1... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Computability/Primrec.lean | Nat.Primrec'.encode | [
1481,
11
] | [
1484,
94
] | [{"tactic": "rw [v.eq_nil]", "annotated_tactic": ["rw [v.eq_nil]", []], "state_before": "v : Vector \u2115 0\n\u22a2 0 = encode v", "state_after": "v : Vector \u2115 0\n\u22a2 0 = encode nil"}, {"tactic": "rfl", "annotated_tactic": ["rfl", []], "state_before": "v : Vector \u2115 0\n\u22a2 0 = encode nil", "state_after"... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/LinearAlgebra/QuadraticForm/Basic.lean | QuadraticForm.map_add_self | [
231,
1
] | [
233,
11
] | [{"tactic": "rw [\u2190 one_smul R x, \u2190 add_smul, map_smul]", "annotated_tactic": ["rw [\u2190 <a>one_smul</a> R x, \u2190 <a>add_smul</a>, <a>map_smul</a>]", [{"full_name": "one_smul", "def_path": "Mathlib/GroupTheory/GroupAction/Defs.lean", "def_pos": [492, 9], "def_end_pos": [492, 17]}, {"full_name": "add_smul"... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/MetricSpace/Basic.lean | continuous_nndist | [
1871,
1
] | [
1872,
38
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/Adjoin/FG.lean | Subalgebra.fg_of_fg_map | [
152,
1
] | [
159,
29
] | [{"tactic": "rw [\u2190 Algebra.adjoin_image, Finset.coe_preimage, Set.image_preimage_eq_of_subset, hs]", "annotated_tactic": ["rw [\u2190 <a>Algebra.adjoin_image</a>, <a>Finset.coe_preimage</a>, <a>Set.image_preimage_eq_of_subset</a>, hs]", [{"full_name": "Algebra.adjoin_image", "def_path": "Mathlib/RingTheory/Adjoin/... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/LinearAlgebra/Quotient.lean | LinearMap.range_eq_top_of_cancel | [
596,
1
] | [
600,
17
] | [{"tactic": "have h\u2081 : (0 : M\u2082 \u2192\u2097[R\u2082] M\u2082 \u29f8 (range f)).comp f = 0 := zero_comp _", "annotated_tactic": ["have h\u2081 : (0 : M\u2082 \u2192\u2097[R\u2082] M\u2082 \u29f8 (<a>range</a> f)).<a>comp</a> f = 0 := <a>zero_comp</a> _", [{"full_name": "LinearMap.range", "def_path": "Mathlib/L... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Bounds.lean | bddAbove_inv | [
32,
1
] | [
33,
37
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/AlgebraicGeometry/StructureSheaf.lean | AlgebraicGeometry.StructureSheaf.normalize_finite_fraction_representation | [
732,
1
] | [
816,
7
] | [{"tactic": "have fractions_eq :\n \u2200 i j : \u03b9,\n IsLocalization.mk' (Localization.Away (h i * h j))\n (a i * h j) \u27e8h i * h j, Submonoid.mem_powers _\u27e9 =\n IsLocalization.mk' _ (h i * a j) \u27e8h i * h j, Submonoid.mem_powers _\u27e9 := by\n intro i j\n let D := PrimeSpectrum.basicOpen (... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/LinearAlgebra/ExteriorAlgebra/Basic.lean | ExteriorAlgebra.ιMulti_succ_curryLeft | [
328,
1
] | [
333,
10
] | [{"tactic": "simp_rw [Matrix.tail_cons]", "annotated_tactic": ["simp_rw [<a>Matrix.tail_cons</a>]", [{"full_name": "Matrix.tail_cons", "def_path": "Mathlib/Data/Fin/VecNotation.lean", "def_pos": [157, 9], "def_end_pos": [157, 18]}]], "state_before": "R : Type u1\ninst\u271d\u2074 : CommRing R\nM : Type u2\ninst\u271d\u... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/EisensteinCriterion.lean | Polynomial.EisensteinCriterionAux.map_eq_C_mul_X_pow_of_forall_coeff_mem | [
32,
1
] | [
48,
51
] | [{"tactic": "by_cases hf0 : f = 0", "annotated_tactic": ["by_cases hf0 : f = 0", []], "state_before": "R : Type u_1\ninst\u271d : CommRing R\nf : R[X]\nP : Ideal R\nhfP : \u2200 (n : \u2115), \u2191n < degree f \u2192 coeff f n \u2208 P\nn : \u2115\n\u22a2 coeff (map (mk P) f) n = coeff (\u2191C (\u2191(mk P) (leadingC... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | WithBot.ciSup_empty | [
133,
1
] | [
135,
34
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Hom/CompleteLattice.lean | sSupHom.cancel_left | [
346,
1
] | [
348,
81
] | [{"tactic": "rw [\u2190 comp_apply, h, comp_apply]", "annotated_tactic": ["rw [\u2190 <a>comp_apply</a>, h, <a>comp_apply</a>]", [{"full_name": "sSupHom.comp_apply", "def_path": "Mathlib/Order/Hom/CompleteLattice.lean", "def_pos": [319, 9], "def_end_pos": [319, 19]}, {"full_name": "sSupHom.comp_apply", "def_path": "Mat... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/PowerSeries/Basic.lean | Polynomial.coeToPowerSeries.algHom_apply | [
2768,
1
] | [
2770,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Seq/Computation.lean | Computation.eq_of_bisim | [
293,
1
] | [
315,
32
] | [{"tactic": "apply Subtype.eq", "annotated_tactic": ["apply <a>Subtype.eq</a>", [{"full_name": "Subtype.eq", "def_path": "lake-packages/lean4/src/lean/Init/Core.lean", "def_pos": [960, 19], "def_end_pos": [960, 21]}]], "state_before": "\u03b1 : Type u\n\u03b2 : Type v\n\u03b3 : Type w\nR : Computation \u03b1 \u2192 Com... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Nat/Prime.lean | Nat.Prime.eq_two_or_odd | [
492,
1
] | [
494,
88
] | [{"tactic": "decide", "annotated_tactic": ["decide", []], "state_before": "p : \u2115\nhp : Prime p\nh : p % 2 = 0\n\u22a2 \u00ac2 = 1", "state_after": "no goals"}] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Multiset/FinsetOps.lean | Multiset.ndinsert_le | [
91,
1
] | [
97,
17
] | [{"tactic": "simp [h, l]", "annotated_tactic": ["simp [h, l]", []], "state_before": "\u03b1 : Type u_1\ninst\u271d : DecidableEq \u03b1\ns\u271d : Multiset \u03b1\na : \u03b1\ns t : Multiset \u03b1\nx\u271d : s \u2264 t \u2227 a \u2208 t\nl : s \u2264 t\nm : a \u2208 t\nh : a \u2208 s\n\u22a2 ndinsert a s \u2264 t", "s... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/Ideal/Basic.lean | Ideal.maximal_of_no_maximal | [
353,
1
] | [
357,
44
] | [{"tactic": "by_contra hnonmax", "annotated_tactic": ["by_contra hnonmax", []], "state_before": "\u03b1 : Type u\n\u03b2 : Type v\ninst\u271d\u00b9 : Semiring \u03b1\nI : Ideal \u03b1\na b : \u03b1\nR : Type u\ninst\u271d : Semiring R\nP : Ideal R\nhmax : \u2200 (m : Ideal R), P < m \u2192 \u00acIsMaximal m\nJ : Ideal ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Real/Sign.lean | Real.sign_mul_pos_of_ne_zero | [
98,
1
] | [
101,
32
] | [{"tactic": "refine' lt_of_le_of_ne (sign_mul_nonneg r) fun h => hr _", "annotated_tactic": ["refine' <a>lt_of_le_of_ne</a> (<a>sign_mul_nonneg</a> r) fun h => hr _", [{"full_name": "lt_of_le_of_ne", "def_path": "Mathlib/Init/Order/Defs.lean", "def_pos": [196, 9], "def_end_pos": [196, 23]}, {"full_name": "Real.sign_mul... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/Instances/Int.lean | Int.dist_cast_real | [
34,
1
] | [
35,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/UnionFind.lean | UFModel.Agrees.empty | [
90,
1
] | [
90,
73
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/List/BigOperators/Lemmas.lean | List.dvd_prod | [
82,
1
] | [
85,
26
] | [{"tactic": "let \u27e8s, t, h\u27e9 := mem_split ha", "annotated_tactic": ["let \u27e8s, t, h\u27e9 := <a>mem_split</a> ha", [{"full_name": "List.mem_split", "def_path": "Mathlib/Data/List/Basic.lean", "def_pos": [103, 9], "def_end_pos": [103, 18]}]], "state_before": "\u03b9 : Type u_1\n\u03b1 : Type u_2\nM : Type u_3... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Nat/WithBot.lean | Nat.WithBot.one_le_iff_zero_lt | [
76,
1
] | [
80,
81
] | [{"tactic": "refine' \u27e8fun h => lt_of_lt_of_le (WithBot.coe_lt_coe.mpr zero_lt_one) h, fun h => _\u27e9", "annotated_tactic": ["refine' \u27e8fun h => <a>lt_of_lt_of_le</a> (WithBot.coe_lt_coe.mpr <a>zero_lt_one</a>) h, fun h => _\u27e9", [{"full_name": "lt_of_lt_of_le", "def_path": "Mathlib/Init/Order/Defs.lean", ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/SetTheory/Ordinal/Notation.lean | ONote.NFBelow.mono | [
277,
1
] | [
279,
39
] | [{"tactic": "induction' h with _ e n a eb b h\u2081 h\u2082 h\u2083 _ _ <;> constructor", "annotated_tactic": ["induction' h with _ e n a eb b h\u2081 h\u2082 h\u2083 _ _ <;> constructor", []], "state_before": "o : ONote\nb\u2081 b\u2082 : Ordinal.{0}\nbb : b\u2081 \u2264 b\u2082\nh : NFBelow o b\u2081\n\u22a2 NFBelow ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Tactic/NormNum/Ineq.lean | Mathlib.Meta.NormNum.isNat_lt_true | [
74,
1
] | [
77,
38
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Category/FGModuleCat/Basic.lean | FGModuleCat.ihom_obj | [
229,
1
] | [
230,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Decomposition/SignedHahn.lean | MeasureTheory.SignedMeasure.findExistsOneDivLT_spec | [
110,
9
] | [
113,
70
] | [{"tactic": "rw [findExistsOneDivLT, dif_pos hi]", "annotated_tactic": ["rw [<a>findExistsOneDivLT</a>, <a>dif_pos</a> hi]", [{"full_name": "_private.Mathlib.MeasureTheory.Decomposition.SignedHahn.0.MeasureTheory.SignedMeasure.findExistsOneDivLT", "def_path": "Mathlib/MeasureTheory/Decomposition/SignedHahn.lean", "def_... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Hom/Basic.lean | Equiv.toOrderIso_toEquiv | [
1129,
1
] | [
1131,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean | CircleDeg1Lift.translationNumber_of_eq_add_int | [
844,
1
] | [
846,
62
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Field/Defs.lean | Rat.cast_mk' | [
135,
1
] | [
136,
34
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/CategoryTheory/Opposites.lean | Quiver.Hom.op_unop | [
53,
1
] | [
54,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Logic/Function/Iterate.lean | Function.iterate_mul | [
90,
1
] | [
92,
97
] | [{"tactic": "simp only [Nat.mul_zero, iterate_zero]", "annotated_tactic": ["simp only [<a>Nat.mul_zero</a>, <a>iterate_zero</a>]", [{"full_name": "Nat.mul_zero", "def_path": "lake-packages/lean4/src/lean/Init/Data/Nat/Basic.lean", "def_pos": [159, 27], "def_end_pos": [159, 35]}, {"full_name": "Function.iterate_zero", "... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/PNat/Prime.lean | PNat.not_prime_one | [
141,
1
] | [
142,
20
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Analytic/Composition.lean | FormalMultilinearSeries.comp_coeff_one | [
280,
1
] | [
288,
48
] | [{"tactic": "have : {Composition.ones 1} = (Finset.univ : Finset (Composition 1)) :=\n Finset.eq_univ_of_card _ (by simp [composition_card])", "annotated_tactic": ["have : {<a>Composition.ones</a> 1} = (<a>Finset.univ</a> : <a>Finset</a> (<a>Composition</a> 1)) :=\n <a>Finset.eq_univ_of_card</a> _ (by simp [<a>comp... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Set/Intervals/Group.lean | Set.pairwise_disjoint_Ioc_mul_zpow | [
168,
1
] | [
179,
26
] | [{"tactic": "simp_rw [Function.onFun, Set.disjoint_iff]", "annotated_tactic": ["simp_rw [<a>Function.onFun</a>, <a>Set.disjoint_iff</a>]", [{"full_name": "Function.onFun", "def_path": "Mathlib/Init/Function.lean", "def_pos": [49, 5], "def_end_pos": [49, 10]}, {"full_name": "Set.disjoint_iff", "def_path": "Mathlib/Data/... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Order/SMul.lean | smul_nonneg | [
102,
1
] | [
105,
46
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/CategoryTheory/Limits/Shapes/ZeroMorphisms.lean | CategoryTheory.Limits.HasZeroObject.zeroIsoInitial_hom | [
321,
1
] | [
321,
90
] | [{"tactic": "ext", "annotated_tactic": ["ext", []], "state_before": "C : Type u\ninst\u271d\u2074 : Category.{v, u} C\nD : Type u'\ninst\u271d\u00b3 : Category.{v', u'} D\ninst\u271d\u00b2 : HasZeroObject C\ninst\u271d\u00b9 : HasZeroMorphisms C\ninst\u271d : HasInitial C\n\u22a2 zeroIsoInitial.hom = 0", "state_after":... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.map_coe_nnreal_restrict | [
763,
1
] | [
765,
43
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean | GromovHausdorff.candidatesBOfCandidates_mem | [
212,
1
] | [
214,
5
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Complex/Schwarz.lean | Complex.abs_deriv_le_one_of_mapsTo_ball | [
176,
1
] | [
178,
84
] | [{"tactic": "rwa [hc]", "annotated_tactic": ["rwa [hc]", []], "state_before": "f : \u2102 \u2192 \u2102\nc z : \u2102\nR R\u2081 R\u2082 : \u211d\nhd : DifferentiableOn \u2102 f (ball c R)\nh_maps : MapsTo f (ball c R) (ball c R)\nhc : f c = c\nh\u2080 : 0 < R\n\u22a2 MapsTo f (ball c R) (ball (f c) R)", "state_after":... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/WellFounded.lean | Acc.induction_bot' | [
247,
1
] | [
252,
21
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/UniformSpace/Separation.lean | UniformSpace.SeparationQuotient.map_id | [
408,
1
] | [
409,
38
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Hom/NonUnitalAlg.lean | NonUnitalAlgHom.prod_fst_snd | [
377,
1
] | [
378,
32
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Filter/Germ.lean | Filter.Germ.coe_int | [
465,
1
] | [
465,
82
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/List/Basic.lean | List.length_eq_three | [
224,
1
] | [
225,
77
] | [] |
https://github.com/leanprover/std4 | 869c615eb10130c0637a7bc038e2b80253559913 | lake-packages/std/Std/Logic.lean | Decidable.and_iff_not_or_not | [
623,
1
] | [
624,
26
] | [{"tactic": "rw [\u2190 not_and, not_not]", "annotated_tactic": ["rw [\u2190 <a>not_and</a>, <a>not_not</a>]", [{"full_name": "Decidable.not_and", "def_path": "lake-packages/std/Std/Logic.lean", "def_pos": [614, 9], "def_end_pos": [614, 26]}, {"full_name": "Decidable.not_not", "def_path": "lake-packages/std/Std/Logic.l... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/CategoryTheory/Limits/Shapes/WideEqualizers.lean | CategoryTheory.Limits.hasWideEqualizers_of_hasLimit_parallelFamily | [
791,
1
] | [
794,
76
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/CompleteLattice.lean | iInf_and' | [
1395,
1
] | [
1397,
19
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/List/Basic.lean | List.length_dropLast | [
646,
1
] | [
651,
9
] | [{"tactic": "rw [dropLast, length_cons, length_cons, length_dropLast (b::l), succ_sub_one, length_cons,\n succ_sub_one]", "annotated_tactic": ["rw [<a>dropLast</a>, <a>length_cons</a>, <a>length_cons</a>, length_dropLast (b::l), <a>succ_sub_one</a>, <a>length_cons</a>,\n <a>succ_sub_one</a>]", [{"full_name": "Lis... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/DirectSum/Basic.lean | DirectSum.sigmaUncurry_apply | [
343,
1
] | [
345,
36
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Order/Group/Abs.lean | max_sub_min_eq_abs | [
216,
1
] | [
218,
32
] | [{"tactic": "rw [abs_sub_comm]", "annotated_tactic": ["rw [<a>abs_sub_comm</a>]", [{"full_name": "abs_sub_comm", "def_path": "Mathlib/Algebra/Order/Group/Abs.lean", "def_pos": [99, 9], "def_end_pos": [99, 21]}]], "state_before": "\u03b1 : Type u_1\ninst\u271d\u00b3 : AddGroup \u03b1\ninst\u271d\u00b2 : LinearOrder \u03... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/LinearAlgebra/Dimension.lean | infinite_basis_le_maximal_linearIndependent' | [
431,
1
] | [
439,
43
] | [{"tactic": "let \u03a6 := fun k : \u03ba => (b.repr (v k)).support", "annotated_tactic": ["let \u03a6 := fun k : \u03ba => (b.repr (v k)).<a>support</a>", [{"full_name": "Finsupp.support", "def_path": "Mathlib/Data/Finsupp/Defs.lean", "def_pos": [96, 3], "def_end_pos": [96, 10]}]], "state_before": "K : Type u\nV V\u20... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/LocallyConstant/Basic.lean | LocallyConstant.map_id | [
413,
1
] | [
413,
45
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/Perm/Cycle/Concrete.lean | Equiv.Perm.toList_formPerm_singleton | [
346,
1
] | [
346,
86
] | [{"tactic": "simp", "annotated_tactic": ["simp", []], "state_before": "\u03b1 : Type u_1\ninst\u271d\u00b9 : Fintype \u03b1\ninst\u271d : DecidableEq \u03b1\np : Perm \u03b1\nx\u271d x y : \u03b1\n\u22a2 toList (formPerm [x]) y = []", "state_after": "no goals"}] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/Filtration.lean | Ideal.Filtration.Stable.of_le | [
405,
1
] | [
412,
61
] | [{"tactic": "have := isNoetherian_of_isNoetherianRing_of_finite R M", "annotated_tactic": ["have := <a>isNoetherian_of_isNoetherianRing_of_finite</a> R M", [{"full_name": "isNoetherian_of_isNoetherianRing_of_finite", "def_path": "Mathlib/RingTheory/Noetherian.lean", "def_pos": [593, 9], "def_end_pos": [593, 51]}]], "st... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/CubicDiscriminant.lean | Cubic.natDegree_of_c_ne_zero' | [
424,
1
] | [
425,
36
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Convex/Basic.lean | DirectedOn.convex_sUnion | [
131,
1
] | [
134,
71
] | [{"tactic": "rw [sUnion_eq_iUnion]", "annotated_tactic": ["rw [<a>sUnion_eq_iUnion</a>]", [{"full_name": "Set.sUnion_eq_iUnion", "def_path": "Mathlib/Data/Set/Lattice.lean", "def_pos": [1460, 9], "def_end_pos": [1460, 25]}]], "state_before": "\ud835\udd5c : Type u_1\nE : Type u_2\nF : Type u_3\n\u03b2 : Type u_4\ninst\... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/Basic.lean | frontier_interior_subset | [
739,
1
] | [
740,
80
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/BoxIntegral/Partition/Tagged.lean | BoxIntegral.TaggedPrepartition.mem_filter | [
108,
1
] | [
109,
20
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Order/Field/Basic.lean | one_div_lt_one_div | [
475,
1
] | [
476,
36
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Multiset/FinsetOps.lean | Multiset.zero_ndunion | [
150,
1
] | [
151,
34
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Star/StarAlgHom.lean | StarAlgHom.comp_id | [
488,
1
] | [
489,
19
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Module/LinearMap.lean | LinearMap.commute_pow_left_of_commute | [
1151,
1
] | [
1158,
54
] | [{"tactic": "induction' k with k ih", "annotated_tactic": ["induction' k with k ih", []], "state_before": "R : Type u_1\nR\u2081 : Type u_2\nR\u2082 : Type u_3\nR\u2083 : Type u_4\nk\u271d : Type u_5\nS : Type u_6\nS\u2083 : Type u_7\nT : Type u_8\nM : Type u_9\nM\u2081 : Type u_10\nM\u2082 : Type u_11\nM\u2083 : Type ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Lie/Quotient.lean | LieSubmodule.Quotient.mk_eq_zero | [
198,
1
] | [
199,
46
] | [] |
https://github.com/leanprover/std4 | 869c615eb10130c0637a7bc038e2b80253559913 | lake-packages/std/Std/Data/Rat/Lemmas.lean | Rat.mkRat_mul_right | [
114,
1
] | [
115,
90
] | [{"tactic": "rw [\u2190 mkRat_mul_left (d := d) a0]", "annotated_tactic": ["rw [\u2190 <a>mkRat_mul_left</a> (d := d) a0]", [{"full_name": "Rat.mkRat_mul_left", "def_path": "lake-packages/std/Std/Data/Rat/Lemmas.lean", "def_pos": [110, 9], "def_end_pos": [110, 23]}]], "state_before": "n : Int\nd a : Nat\na0 : a \u2260 ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Nat/Order/Basic.lean | Nat.add_eq_three_iff | [
192,
1
] | [
196,
44
] | [{"tactic": "cases n <;>\nsimp [(succ_ne_zero 1).symm, succ_eq_add_one, (show 3 = Nat.succ 2 from rfl),\n \u2190 add_assoc, succ_inj', add_eq_two_iff]", "annotated_tactic": ["cases n <;>\n simp [(<a>succ_ne_zero</a> 1).<a>symm</a>, <a>succ_eq_add_one</a>, (show 3 = <a>Nat.succ</a> 2 from <a>rfl</a>),\n \u2190 <a>a... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | HasFDerivWithinAt.ccosh | [
447,
1
] | [
449,
62
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Polynomial/Div.lean | Polynomial.divByMonic_eq_zero_iff | [
277,
1
] | [
284,
91
] | [{"tactic": "have := modByMonic_add_div p hq", "annotated_tactic": ["have := <a>modByMonic_add_div</a> p hq", [{"full_name": "Polynomial.modByMonic_add_div", "def_path": "Mathlib/Data/Polynomial/Div.lean", "def_pos": [273, 9], "def_end_pos": [273, 27]}]], "state_before": "R : Type u\nS : Type v\nT : Type w\nA : Type z\... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/BoxIntegral/Box/Basic.lean | BoxIntegral.Box.coe_inj | [
182,
1
] | [
183,
23
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Computability/Primrec.lean | Primrec.option_guard | [
757,
1
] | [
759,
66
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/FreeGroup/Basic.lean | FreeGroup.quot_lift_mk | [
500,
1
] | [
502,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Ring/Equiv.lean | RingEquiv.map_one | [
521,
11
] | [
522,
12
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Set/Basic.lean | Set.inclusion_inclusion | [
2815,
1
] | [
2818,
6
] | [{"tactic": "cases x", "annotated_tactic": ["cases x", []], "state_before": "\u03b1 : Type u_1\ns t u : Set \u03b1\nhst : s \u2286 t\nhtu : t \u2286 u\nx : \u2191s\n\u22a2 inclusion htu (inclusion hst x) = inclusion (_ : s \u2286 u) x", "state_after": "case mk\n\u03b1 : Type u_1\ns t u : Set \u03b1\nhst : s \u2286 t\nh... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/InnerProductSpace/Basic.lean | Orthonormal.map_equiv | [
1432,
1
] | [
1435,
18
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Finmap.lean | Finmap.toFinmap_cons | [
520,
1
] | [
522,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Multiset/Fold.lean | Multiset.fold_cons_right | [
64,
1
] | [
65,
17
] | [{"tactic": "simp [hc.comm]", "annotated_tactic": ["simp [hc.comm]", []], "state_before": "\u03b1 : Type u_1\n\u03b2 : Type u_2\nop : \u03b1 \u2192 \u03b1 \u2192 \u03b1\nhc : IsCommutative \u03b1 op\nha : IsAssociative \u03b1 op\nb a : \u03b1\ns : Multiset \u03b1\n\u22a2 fold op b (a ::\u2098 s) = op (fold op b s) a", ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.