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/Algebra/Order/Floor.lean | Int.fract_add_int | [
862,
1
] | [
864,
7
] | [{"tactic": "rw [fract]", "annotated_tactic": ["rw [<a>fract</a>]", [{"full_name": "Int.fract", "def_path": "Mathlib/Algebra/Order/Floor.lean", "def_pos": [629, 5], "def_end_pos": [629, 10]}]], "state_before": "F : Type u_1\n\u03b1 : Type u_2\n\u03b2 : Type u_3\ninst\u271d\u00b9 : LinearOrderedRing \u03b1\ninst\u271d :... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Matrix/Basic.lean | Matrix.map_updateColumn | [
2856,
1
] | [
2860,
26
] | [{"tactic": "ext", "annotated_tactic": ["ext", []], "state_before": "l : Type u_1\nm : Type u_2\nn : Type u_3\no : Type u_4\nm' : o \u2192 Type u_5\nn' : o \u2192 Type u_6\nR : Type u_7\nS : Type u_8\n\u03b1 : Type v\n\u03b2 : Type w\n\u03b3 : Type u_9\nM : Matrix m n \u03b1\ni : m\nj : n\nb : n \u2192 \u03b1\nc : m \u... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Vector/Mem.lean | Vector.mem_iff_get | [
31,
1
] | [
35,
38
] | [{"tactic": "simp only [List.mem_iff_get, Fin.exists_iff, Vector.get_eq_get]", "annotated_tactic": ["simp only [<a>List.mem_iff_get</a>, <a>Fin.exists_iff</a>, <a>Vector.get_eq_get</a>]", [{"full_name": "List.mem_iff_get", "def_path": "lake-packages/std/Std/Data/List/Lemmas.lean", "def_pos": [619, 9], "def_end_pos": [6... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/CategoryTheory/Limits/Shapes/Kernels.lean | CategoryTheory.Limits.eq_zero_of_mono_cokernel | [
784,
1
] | [
785,
43
] | [{"tactic": "simp", "annotated_tactic": ["simp", []], "state_before": "C : Type u\ninst\u271d\u00b3 : Category.{v, u} C\ninst\u271d\u00b2 : HasZeroMorphisms C\nX Y : C\nf : X \u27f6 Y\ninst\u271d\u00b9 : HasCokernel f\ninst\u271d : Mono (cokernel.\u03c0 f)\n\u22a2 f \u226b cokernel.\u03c0 f = 0 \u226b cokernel.\u03c0 f... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | Complex.tan_nat_mul_pi_sub | [
1348,
1
] | [
1349,
44
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Filter/Basic.lean | Filter.iInf_sets_eq_finite | [
846,
1
] | [
849,
46
] | [{"tactic": "rw [iInf_eq_iInf_finset, iInf_sets_eq]", "annotated_tactic": ["rw [<a>iInf_eq_iInf_finset</a>, <a>iInf_sets_eq</a>]", [{"full_name": "iInf_eq_iInf_finset", "def_path": "Mathlib/Data/Finset/Lattice.lean", "def_pos": [1922, 9], "def_end_pos": [1922, 28]}, {"full_name": "Filter.iInf_sets_eq", "def_path": "Mat... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_flip | [
1471,
1
] | [
1476,
16
] | [{"tactic": "induction' n with n ih", "annotated_tactic": ["induction' n with n ih", []], "state_before": "\u03b9 : Type u_1\n\u03b2 : Type u\n\u03b1 : Type v\n\u03b3 : Type w\ns s\u2081 s\u2082 : Finset \u03b1\na : \u03b1\nf\u271d g : \u03b1 \u2192 \u03b2\ninst\u271d : CommMonoid \u03b2\nn : \u2115\nf : \u2115 \u2192 ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.equivMapOfInjective_coe_mulEquiv | [
3565,
1
] | [
3568,
6
] | [{"tactic": "ext", "annotated_tactic": ["ext", []], "state_before": "G : Type u_1\nG' : Type u_2\nG'' : Type u_3\ninst\u271d\u2074 : Group G\ninst\u271d\u00b3 : Group G'\ninst\u271d\u00b2 : Group G''\nA : Type u_4\ninst\u271d\u00b9 : AddGroup A\nN : Type u_5\ninst\u271d : Group N\nH : Subgroup G\ne : G \u2243* G'\n\u22... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Polynomial/UnitTrinomial.lean | Polynomial.IsUnitTrinomial.irreducible_aux1 | [
221,
1
] | [
253,
74
] | [{"tactic": "have key : n - m + k < n := by rwa [\u2190 lt_tsub_iff_right, tsub_lt_tsub_iff_left_of_le hmn.le]", "annotated_tactic": ["have key : n - m + k < n := by rwa [\u2190 <a>lt_tsub_iff_right</a>, <a>tsub_lt_tsub_iff_left_of_le</a> hmn.le]", [{"full_name": "lt_tsub_iff_right", "def_path": "Mathlib/Algebra/Order/... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean | ModelWithCorners.image_mem_nhdsWithin | [
315,
1
] | [
316,
37
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Measure/Haar/InnerProductSpace.lean | PiLp.volume_preserving_equiv | [
94,
1
] | [
95,
53
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Fintype/Pi.lean | Fintype.piFinset_disjoint_of_disjoint | [
72,
1
] | [
76,
25
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/GCDMonoid/Basic.lean | Associates.mk_normalize | [
128,
1
] | [
129,
64
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Hom/Lattice.lean | SupHom.coe_comp | [
403,
1
] | [
404,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Nat/MaxPowDiv.lean | Nat.maxPowDiv.le_of_dvd | [
104,
1
] | [
112,
34
] | [{"tactic": "have \u27e8c, hc\u27e9 := h", "annotated_tactic": ["have \u27e8c, hc\u27e9 := h", []], "state_before": "p n pow : \u2115\nhp : 1 < p\nhn : 0 < n\nh : p ^ pow \u2223 n\n\u22a2 pow \u2264 maxPowDiv p n", "state_after": "p n pow : \u2115\nhp : 1 < p\nhn : 0 < n\nh : p ^ pow \u2223 n\nc : \u2115\nhc : n = p ^ ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/Perm/Cycle/Concrete.lean | Equiv.Perm.IsCycle.existsUnique_cycle_nontrivial_subtype | [
486,
1
] | [
497,
33
] | [{"tactic": "obtain \u27e8\u27e8s, hn\u27e9, hs, hs'\u27e9 := hf.existsUnique_cycle_subtype", "annotated_tactic": ["obtain \u27e8\u27e8s, hn\u27e9, hs, hs'\u27e9 := hf.existsUnique_cycle_subtype", []], "state_before": "\u03b1 : Type u_1\ninst\u271d\u00b9 : Finite \u03b1\ninst\u271d : DecidableEq \u03b1\nf : Perm \u03b1... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Order/Field/Basic.lean | div_lt_div_of_neg_of_lt | [
789,
1
] | [
791,
53
] | [{"tactic": "rw [div_eq_mul_one_div a c, div_eq_mul_one_div b c]", "annotated_tactic": ["rw [<a>div_eq_mul_one_div</a> a c, <a>div_eq_mul_one_div</a> b c]", [{"full_name": "div_eq_mul_one_div", "def_path": "Mathlib/Algebra/Group/Basic.lean", "def_pos": [329, 9], "def_end_pos": [329, 27]}, {"full_name": "div_eq_mul_one_... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/Subgroup/Basic.lean | MonoidHom.closure_preimage_le | [
3005,
1
] | [
3006,
91
] | [{"tactic": "rw [SetLike.mem_coe, mem_comap]", "annotated_tactic": ["rw [<a>SetLike.mem_coe</a>, <a>mem_comap</a>]", [{"full_name": "SetLike.mem_coe", "def_path": "Mathlib/Data/SetLike/Basic.lean", "def_pos": [163, 9], "def_end_pos": [163, 16]}, {"full_name": "Subgroup.mem_comap", "def_path": "Mathlib/GroupTheory/Subgr... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Finset/NatAntidiagonal.lean | Finset.Nat.map_prodComm_antidiagonal | [
92,
9
] | [
94,
24
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Rat/Cast/Lemmas.lean | Rat.cast_inv_nat | [
28,
1
] | [
32,
81
] | [{"tactic": "cases' n with n", "annotated_tactic": ["cases' n with n", []], "state_before": "\u03b1 : Type u_1\ninst\u271d : DivisionRing \u03b1\nn : \u2115\n\u22a2 \u2191(\u2191n)\u207b\u00b9 = (\u2191n)\u207b\u00b9", "state_after": "case zero\n\u03b1 : Type u_1\ninst\u271d : DivisionRing \u03b1\n\u22a2 \u2191(\u2191N... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/NumberTheory/NumberField/Embeddings.lean | NumberField.InfinitePlace.card_filter_mk_eq | [
392,
1
] | [
404,
71
] | [{"tactic": "conv_lhs =>\n congr; congr; ext\n rw [\u2190 mk_embedding w, mk_eq_iff, ComplexEmbedding.conjugate, star_involutive.eq_iff]", "annotated_tactic": ["conv_lhs =>\n congr; congr; ext\n rw [\u2190 <a>mk_embedding</a> w, <a>mk_eq_iff</a>, <a>ComplexEmbedding.conjugate</a>, star_involutive.eq_iff]", [{"f... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Nat/Prime.lean | Nat.minFac_one | [
272,
1
] | [
273,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Order/ToIntervalMod.lean | toIcoDiv_sub_zsmul' | [
281,
1
] | [
282,
74
] | [{"tactic": "rw [sub_eq_add_neg, \u2190 neg_smul, toIcoDiv_add_zsmul', sub_neg_eq_add]", "annotated_tactic": ["rw [<a>sub_eq_add_neg</a>, \u2190 <a>neg_smul</a>, <a>toIcoDiv_add_zsmul'</a>, <a>sub_neg_eq_add</a>]", [{"full_name": "sub_eq_add_neg", "def_path": "Mathlib/Algebra/Group/Defs.lean", "def_pos": [975, 3], "def... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/FieldTheory/Separable.lean | Polynomial.separable_one | [
56,
1
] | [
57,
21
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Category/ModuleCat/Biproducts.lean | ModuleCat.binaryProductLimitCone_cone_π_app_right | [
66,
1
] | [
68,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Monotone/Basic.lean | strictMonoOn_id | [
555,
1
] | [
555,
89
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/Coprod/Basic.lean | Monoid.Coprod.mk_surjective | [
160,
1
] | [
160,
73
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Calculus/FDeriv/Mul.lean | DifferentiableAt.inverse | [
551,
1
] | [
553,
42
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Combinatorics/Additive/SalemSpencer.lean | addSalemSpencer_sphere | [
296,
1
] | [
302,
42
] | [{"tactic": "obtain rfl | hr := eq_or_ne r 0", "annotated_tactic": ["obtain rfl | hr := <a>eq_or_ne</a> r 0", [{"full_name": "eq_or_ne", "def_path": "Mathlib/Logic/Basic.lean", "def_pos": [209, 9], "def_end_pos": [209, 17]}]], "state_before": "F : Type u_1\n\u03b1 : Type u_2\n\u03b2 : Type u_3\n\ud835\udd5c : Type u_4\... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/LinearAlgebra/Trace.lean | LinearMap.trace_prodMap | [
215,
1
] | [
229,
101
] | [{"tactic": "let e := (dualTensorHomEquiv R M M).prod (dualTensorHomEquiv R N N)", "annotated_tactic": ["let e := (<a>dualTensorHomEquiv</a> R M M).<a>prod</a> (<a>dualTensorHomEquiv</a> R N N)", [{"full_name": "dualTensorHomEquiv", "def_path": "Mathlib/LinearAlgebra/Contraction.lean", "def_pos": [212, 19], "def_end_po... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/Algebra/Order/Floor.lean | continuousOn_fract | [
154,
1
] | [
156,
45
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/UpperLower/Basic.lean | UpperSet.mem_iInf_iff | [
650,
1
] | [
652,
19
] | [{"tactic": "rw [\u2190 SetLike.mem_coe, coe_iInf]", "annotated_tactic": ["rw [\u2190 <a>SetLike.mem_coe</a>, <a>coe_iInf</a>]", [{"full_name": "SetLike.mem_coe", "def_path": "Mathlib/Data/SetLike/Basic.lean", "def_pos": [163, 9], "def_end_pos": [163, 16]}, {"full_name": "UpperSet.coe_iInf", "def_path": "Mathlib/Order/... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Probability/Kernel/MeasurableIntegral.lean | Measurable.lintegral_kernel_prod_left | [
215,
1
] | [
217,
33
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/BooleanAlgebra.lean | compl_sdiff_compl | [
732,
1
] | [
732,
87
] | [{"tactic": "rw [sdiff_compl, sdiff_eq, inf_comm]", "annotated_tactic": ["rw [<a>sdiff_compl</a>, <a>sdiff_eq</a>, <a>inf_comm</a>]", [{"full_name": "sdiff_compl", "def_path": "Mathlib/Order/BooleanAlgebra.lean", "def_pos": [705, 9], "def_end_pos": [705, 20]}, {"full_name": "sdiff_eq", "def_path": "Mathlib/Order/Boolea... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/List/Chain.lean | List.chain'_iff_get | [
348,
1
] | [
360,
61
] | [{"tactic": "simp", "annotated_tactic": ["simp", []], "state_before": "\u03b1 : Type u\n\u03b2 : Type v\nR\u271d r : \u03b1 \u2192 \u03b1 \u2192 Prop\nl l\u2081 l\u2082 : List \u03b1\na b : \u03b1\nR : \u03b1 \u2192 \u03b1 \u2192 Prop\n\u22a2 Chain' R []", "state_after": "no goals"}, {"tactic": "simp at h", "annotated_... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Order/Sub/Defs.lean | AddLECancellable.lt_add_of_tsub_lt_right | [
316,
11
] | [
321,
17
] | [{"tactic": "rw [lt_iff_le_and_ne, \u2190 tsub_le_iff_right]", "annotated_tactic": ["rw [<a>lt_iff_le_and_ne</a>, \u2190 <a>tsub_le_iff_right</a>]", [{"full_name": "lt_iff_le_and_ne", "def_path": "Mathlib/Order/Basic.lean", "def_pos": [394, 9], "def_end_pos": [394, 25]}, {"full_name": "tsub_le_iff_right", "def_path": "... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/Submonoid/Membership.lean | Submonoid.closure_induction_right | [
438,
1
] | [
443,
35
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/NumberTheory/LucasLehmer.lean | LucasLehmer.X.mul_fst | [
238,
1
] | [
239,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean | CircleDeg1Lift.dist_map_zero_translationNumber_le | [
683,
1
] | [
686,
38
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Finset/Basic.lean | Finset.sdiff_insert | [
2350,
1
] | [
2352,
16
] | [{"tactic": "simp_rw [\u2190 sdiff_singleton_eq_erase, insert_eq, sdiff_sdiff_left', sdiff_union_distrib,\n inter_comm]", "annotated_tactic": ["simp_rw [\u2190 <a>sdiff_singleton_eq_erase</a>, <a>insert_eq</a>, <a>sdiff_sdiff_left'</a>, <a>sdiff_union_distrib</a>,\n <a>inter_comm</a>]", [{"full_name": "Finset.sdiff... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/DedekindDomain/Ideal.lean | normalizedFactorsEquivOfQuotEquiv_multiplicity_eq_multiplicity | [
1176,
1
] | [
1182,
82
] | [{"tactic": "rw [normalizedFactorsEquivOfQuotEquiv, Equiv.coe_fn_mk, Subtype.coe_mk]", "annotated_tactic": ["rw [<a>normalizedFactorsEquivOfQuotEquiv</a>, <a>Equiv.coe_fn_mk</a>, <a>Subtype.coe_mk</a>]", [{"full_name": "normalizedFactorsEquivOfQuotEquiv", "def_path": "Mathlib/RingTheory/DedekindDomain/Ideal.lean", "def... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Nat/Interval.lean | Nat.image_sub_const_Ico | [
223,
1
] | [
234,
61
] | [{"tactic": "ext x", "annotated_tactic": ["ext x", []], "state_before": "a b c : \u2115\nh : c \u2264 a\n\u22a2 image (fun x => x - c) (Ico a b) = Ico (a - c) (b - c)", "state_after": "case a\na b c : \u2115\nh : c \u2264 a\nx : \u2115\n\u22a2 x \u2208 image (fun x => x - c) (Ico a b) \u2194 x \u2208 Ico (a - c) (b - c... |
https://github.com/leanprover/std4 | 869c615eb10130c0637a7bc038e2b80253559913 | lake-packages/std/Std/Data/List/Lemmas.lean | List.get!_len_le | [
596,
1
] | [
598,
71
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/NumberTheory/ADEInequality.lean | ADEInequality.classification | [
278,
1
] | [
279,
58
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Matrix/Block.lean | Matrix.fromBlocks_apply₂₁ | [
63,
1
] | [
65,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/DiscreteQuotient.lean | DiscreteQuotient.trans | [
96,
1
] | [
96,
74
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/Bases.lean | TopologicalSpace.countable_countableBasis | [
695,
1
] | [
696,
43
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Finset/Basic.lean | Finset.biUnion_subset_iff_forall_subset | [
3698,
1
] | [
3702,
17
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Combinatorics/SetFamily/Compression/Down.lean | Down.mem_compression_of_insert_mem_compression | [
265,
1
] | [
269,
53
] | [{"tactic": "by_cases ha : a \u2208 s", "annotated_tactic": ["by_cases ha : a \u2208 s", []], "state_before": "\u03b1 : Type u_1\ninst\u271d : DecidableEq \u03b1\n\ud835\udc9c \u212c : Finset (Finset \u03b1)\ns : Finset \u03b1\na : \u03b1\nh : insert a s \u2208 \ud835\udcd3 a \ud835\udc9c\n\u22a2 s \u2208 \ud835\udcd3 ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Set/Pointwise/Basic.lean | Set.image_mul_left | [
1199,
1
] | [
1200,
57
] | [{"tactic": "rw [image_eq_preimage_of_inverse] <;> intro c <;> simp", "annotated_tactic": ["rw [<a>image_eq_preimage_of_inverse</a>] <;> intro c <;> simp", [{"full_name": "Set.image_eq_preimage_of_inverse", "def_path": "Mathlib/Data/Set/Image.lean", "def_pos": [427, 9], "def_end_pos": [427, 37]}]], "state_before": "F :... |
https://github.com/leanprover/std4 | 869c615eb10130c0637a7bc038e2b80253559913 | lake-packages/std/Std/Data/List/Pairwise.lean | List.map_get_sublist | [
204,
1
] | [
218,
55
] | [{"tactic": "suffices \u2200 n l', l' = l.drop n \u2192 (\u2200 i \u2208 is, n \u2264 i) \u2192 map (get l) is <+ l'\n from this 0 l (by simp) (by simp)", "annotated_tactic": ["suffices \u2200 n l', l' = l.drop n \u2192 (\u2200 i \u2208 is, n \u2264 i) \u2192 <a>map</a> (<a>get</a> l) is <+ l'\n from this 0 l (by s... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Ordmap/Ordset.lean | Ordnode.Balanced.dual | [
218,
1
] | [
220,
96
] | [{"tactic": "rw [size_dual, size_dual]", "annotated_tactic": ["rw [<a>size_dual</a>, <a>size_dual</a>]", [{"full_name": "Ordnode.size_dual", "def_path": "Mathlib/Data/Ordmap/Ordset.lean", "def_pos": [156, 9], "def_end_pos": [156, 18]}, {"full_name": "Ordnode.size_dual", "def_path": "Mathlib/Data/Ordmap/Ordset.lean", "d... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Convex/SpecificFunctions/Basic.lean | convexOn_zpow | [
125,
1
] | [
149,
17
] | [{"tactic": "simp_rw [zpow_ofNat]", "annotated_tactic": ["simp_rw [<a>zpow_ofNat</a>]", [{"full_name": "zpow_ofNat", "def_path": "Mathlib/Algebra/Group/Defs.lean", "def_pos": [948, 9], "def_end_pos": [948, 19]}]], "state_before": "n : \u2115\n\u22a2 ConvexOn \u211d (Ioi 0) fun x => x ^ \u2191n", "state_after": "n : \u2... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Calculus/ContDiff.lean | norm_iteratedFDerivWithin_clm_apply | [
2759,
1
] | [
2770,
79
] | [{"tactic": "let B : (F \u2192L[\ud835\udd5c] G) \u2192L[\ud835\udd5c] F \u2192L[\ud835\udd5c] G := ContinuousLinearMap.flip (ContinuousLinearMap.apply \ud835\udd5c G)", "annotated_tactic": ["let B : (F \u2192L[\ud835\udd5c] G) \u2192L[\ud835\udd5c] F \u2192L[\ud835\udd5c] G := <a>ContinuousLinearMap.flip</a> (<a>Conti... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/List/Basic.lean | List.take_add | [
1992,
1
] | [
2003,
11
] | [{"tactic": "convert_to take (m + n) (take m l ++ drop m l) = take m l ++ take n (drop m l)", "annotated_tactic": ["convert_to <a>take</a> (m + n) (<a>take</a> m l ++ <a>drop</a> m l) = <a>take</a> m l ++ <a>take</a> n (<a>drop</a> m l)", [{"full_name": "List.take", "def_path": "lake-packages/lean4/src/lean/Init/Data/L... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/GroupPower/Ring.lean | sq_eq_one_iff | [
260,
1
] | [
261,
66
] | [{"tactic": "rw [\u2190 (Commute.one_right a).sq_eq_sq_iff_eq_or_eq_neg, one_pow]", "annotated_tactic": ["rw [\u2190 (<a>Commute.one_right</a> a).<a>sq_eq_sq_iff_eq_or_eq_neg</a>, <a>one_pow</a>]", [{"full_name": "Commute.one_right", "def_path": "Mathlib/Algebra/Group/Commute/Defs.lean", "def_pos": [147, 9], "def_end_p... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/ContinuousOn.lean | mem_nhdsWithin_iff_exists_mem_nhds_inter | [
98,
1
] | [
100,
51
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Nat/Parity.lean | Function.Involutive.iterate_bit1 | [
302,
1
] | [
303,
75
] | [{"tactic": "rw [bit1, \u2190succ_eq_add_one, iterate_succ, hf.iterate_bit0, comp.left_id]", "annotated_tactic": ["rw [<a>bit1</a>, \u2190<a>succ_eq_add_one</a>, <a>iterate_succ</a>, hf.iterate_bit0, <a>comp.left_id</a>]", [{"full_name": "bit1", "def_path": "Mathlib/Init/ZeroOne.lean", "def_pos": [39, 34], "def_end_pos... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.exists_boundary_dart | [
1335,
1
] | [
1342,
50
] | [{"tactic": "induction' p with _ x y w a p' ih", "annotated_tactic": ["induction' p with _ x y w a p' ih", []], "state_before": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nu v : V\np : Walk G u v\nS : Set V\nuS : u \u2208 S\nvS : \u00acv \u2208 S\n\u22a2 \u2203... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/BoundedVariation.lean | eVariationOn.comp_le_of_monotoneOn | [
521,
1
] | [
524,
97
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Computability/Partrec.lean | Computable.fin_app | [
396,
1
] | [
397,
26
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/GroupAction/FixingSubgroup.lean | fixingSubmonoid_antitone | [
72,
1
] | [
73,
50
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Multiset/Pi.lean | Multiset.mem_pi | [
139,
1
] | [
156,
21
] | [{"tactic": "intro f", "annotated_tactic": ["intro f", []], "state_before": "\u03b1 : Type u_1\ninst\u271d : DecidableEq \u03b1\n\u03b2 : \u03b1 \u2192 Type u\n\u03b4 : \u03b1 \u2192 Sort v\nm : Multiset \u03b1\nt : (a : \u03b1) \u2192 Multiset (\u03b2 a)\n\u22a2 \u2200 (f : (a : \u03b1) \u2192 a \u2208 m \u2192 \u03b2... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Finset/LocallyFinite.lean | Finset.Ioc_filter_lt_of_lt_right | [
363,
1
] | [
365,
68
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | intervalIntegral.norm_integral_le_abs_integral_norm | [
547,
1
] | [
549,
68
] | [{"tactic": "simp only [\u2190 Real.norm_eq_abs, norm_integral_eq_norm_integral_Ioc]", "annotated_tactic": ["simp only [\u2190 <a>Real.norm_eq_abs</a>, <a>norm_integral_eq_norm_integral_Ioc</a>]", [{"full_name": "Real.norm_eq_abs", "def_path": "Mathlib/Analysis/Normed/Group/Basic.lean", "def_pos": [1761, 9], "def_end_p... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/List/Range.lean | List.pairwise_le_finRange | [
163,
1
] | [
164,
54
] | [{"tactic": "simp", "annotated_tactic": ["simp", []], "state_before": "\u03b1 : Type u\nn : \u2115\n\u22a2 \u2200 (x : \u2115), x \u2208 range n \u2192 x < n", "state_after": "no goals"}, {"tactic": "simp", "annotated_tactic": ["simp", []], "state_before": "\u03b1 : Type u\nn : \u2115\n\u22a2 \u2200 \u2983x : \u2115\u2... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/SpecialFunctions/Log/Basic.lean | Real.isLittleO_log_id_atTop | [
415,
1
] | [
416,
59
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/Subsemiring/Basic.lean | Subsemiring.top_prod_top | [
1099,
1
] | [
1100,
36
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Set/Intervals/Basic.lean | Set.Ici_diff_Ici | [
1094,
1
] | [
1094,
92
] | [{"tactic": "rw [diff_eq, compl_Ici, Ici_inter_Iio]", "annotated_tactic": ["rw [<a>diff_eq</a>, <a>compl_Ici</a>, <a>Ici_inter_Iio</a>]", [{"full_name": "Set.diff_eq", "def_path": "Mathlib/Data/Set/Basic.lean", "def_pos": [1814, 9], "def_end_pos": [1814, 16]}, {"full_name": "Set.compl_Ici", "def_path": "Mathlib/Data/Se... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/UniformSpace/AbstractCompletion.lean | AbstractCompletion.compare_coe | [
254,
1
] | [
255,
46
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/FieldTheory/KrullTopology.lean | IntermediateField.finiteDimensional_bot | [
88,
1
] | [
90,
62
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Probability/Kernel/IntegralCompProd.lean | ProbabilityTheory.kernel.integral_fn_integral_sub | [
168,
1
] | [
174,
30
] | [{"tactic": "refine' integral_congr_ae _", "annotated_tactic": ["refine' <a>integral_congr_ae</a> _", [{"full_name": "MeasureTheory.integral_congr_ae", "def_path": "Mathlib/MeasureTheory/Integral/Bochner.lean", "def_pos": [938, 9], "def_end_pos": [938, 26]}]], "state_before": "\u03b1 : Type u_1\n\u03b2 : Type u_2\n\u03... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Measure/Hausdorff.lean | MeasureTheory.Measure.le_hausdorffMeasure | [
585,
1
] | [
587,
25
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/SetTheory/Ordinal/Principal.lean | Ordinal.principal_mul_two | [
269,
1
] | [
274,
25
] | [{"tactic": "have h\u2082 : succ (1 : Ordinal) = 2 := by simp", "annotated_tactic": ["have h\u2082 : <a>succ</a> (1 : <a>Ordinal</a>) = 2 := by simp", [{"full_name": "Order.succ", "def_path": "Mathlib/Order/SuccPred/Basic.lean", "def_pos": [209, 5], "def_end_pos": [209, 9]}, {"full_name": "Ordinal", "def_path": "Mathli... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Combinatorics/Composition.lean | Composition.invEmbedding_comp | [
438,
1
] | [
440,
83
] | [{"tactic": "simp_rw [coe_invEmbedding, index_embedding, coe_embedding, add_tsub_cancel_left]", "annotated_tactic": ["simp_rw [<a>coe_invEmbedding</a>, <a>index_embedding</a>, <a>coe_embedding</a>, <a>add_tsub_cancel_left</a>]", [{"full_name": "Composition.coe_invEmbedding", "def_path": "Mathlib/Combinatorics/Compositi... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Group/TypeTags.lean | toMul_sub | [
340,
1
] | [
341,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Computability/Partrec.lean | Computable.vector_toList | [
371,
1
] | [
372,
32
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Geometry/Manifold/ChartedSpace.lean | mem_pregroupoid_of_eq_on_source | [
411,
1
] | [
414,
48
] | [{"tactic": "rw [\u2190 he'.1]", "annotated_tactic": ["rw [\u2190 he'.1]", []], "state_before": "H : Type u\nH' : Type u_1\nM : Type u_2\nM' : Type u_3\nM'' : Type u_4\ninst\u271d : TopologicalSpace H\nPG : Pregroupoid H\ne e' : LocalHomeomorph H H\nhe' : e \u2248 e'\nhe : Pregroupoid.property PG (\u2191e) e.source\n\u... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/LinearAlgebra/Basic.lean | Submodule.map_symm_eq_iff | [
2413,
1
] | [
2421,
55
] | [{"tactic": "constructor <;> rintro rfl", "annotated_tactic": ["constructor <;> rintro rfl", []], "state_before": "R : Type u_1\nR\u2081 : Type u_2\nR\u2082 : Type u_3\nR\u2083 : Type u_4\nR\u2084 : Type u_5\nS : Type u_6\nK\u271d : Type u_7\nK\u2082 : Type u_8\nM : Type u_9\nM' : Type u_10\nM\u2081 : Type u_11\nM\u208... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/NumberTheory/LegendreSymbol/MulCharacter.lean | MulChar.IsQuadratic.pow_char | [
490,
1
] | [
497,
38
] | [{"tactic": "ext x", "annotated_tactic": ["ext x", []], "state_before": "R : Type u\ninst\u271d\u00b3 : CommRing R\nR' : Type v\ninst\u271d\u00b2 : CommRing R'\nR'' : Type w\ninst\u271d\u00b9 : CommRing R''\n\u03c7 : MulChar R R'\nh\u03c7 : IsQuadratic \u03c7\np : \u2115\nhp : Fact (Nat.Prime p)\ninst\u271d : CharP R' ... |
https://github.com/leanprover/std4 | 869c615eb10130c0637a7bc038e2b80253559913 | lake-packages/std/Std/Data/RBMap/Alter.lean | Std.RBNode.Path.Balanced.del | [
178,
11
] | [
195,
91
] | [{"tactic": "induction hp generalizing t c' with\n| root => match c', ht with\n | red, \u27e8_, h\u27e9 | black, \u27e8_, _, h\u27e9 => exact h.setBlack\n| @redL _ n _ _ hb hp ih => match c', n, ht with\n | red, _, _ => cases hc rfl rfl\n | black, _, \u27e8_, rfl, ha\u27e9 => exact ih ((hb.balLeft ha).of_false (fun.... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/DFinsupp/Interval.lean | DFinsupp.support_rangeIcc_subset | [
125,
1
] | [
132,
19
] | [{"tactic": "refine' fun x hx => _", "annotated_tactic": ["refine' fun x hx => _", []], "state_before": "\u03b9 : Type u_1\n\u03b1 : \u03b9 \u2192 Type u_2\ninst\u271d\u2074 : (i : \u03b9) \u2192 Zero (\u03b1 i)\ninst\u271d\u00b3 : (i : \u03b9) \u2192 PartialOrder (\u03b1 i)\ninst\u271d\u00b2 : (i : \u03b9) \u2192 Loca... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Convex/Combination.lean | convexHull_sub | [
471,
1
] | [
472,
59
] | [{"tactic": "simp_rw [sub_eq_add_neg, convexHull_add, convexHull_neg]", "annotated_tactic": ["simp_rw [<a>sub_eq_add_neg</a>, <a>convexHull_add</a>, <a>convexHull_neg</a>]", [{"full_name": "sub_eq_add_neg", "def_path": "Mathlib/Algebra/Group/Defs.lean", "def_pos": [975, 3], "def_end_pos": [975, 14]}, {"full_name": "con... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Polynomial/Mirror.lean | Polynomial.mirror_zero | [
44,
1
] | [
44,
64
] | [{"tactic": "simp [mirror]", "annotated_tactic": ["simp [<a>mirror</a>]", [{"full_name": "Polynomial.mirror", "def_path": "Mathlib/Data/Polynomial/Mirror.lean", "def_pos": [39, 19], "def_end_pos": [39, 25]}]], "state_before": "R : Type u_1\ninst\u271d : Semiring R\np q : R[X]\n\u22a2 mirror 0 = 0", "state_after": "no g... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Function/EssSup.lean | ae_essInf_le | [
118,
1
] | [
121,
26
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Matrix/Basic.lean | Matrix.diagonal_one | [
527,
1
] | [
528,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Ordmap/Ordset.lean | Ordnode.Sized.size_eq_zero | [
139,
1
] | [
140,
33
] | [{"tactic": "cases t <;> [simp;simp [ht.1]]", "annotated_tactic": ["cases t <;> [simp;simp [ht.1]]", []], "state_before": "\u03b1 : Type u_1\nt : Ordnode \u03b1\nht : Sized t\n\u22a2 size t = 0 \u2194 t = nil", "state_after": "no goals"}] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/NumberTheory/Liouville/LiouvilleWith.lean | LiouvilleWith.mul_rat | [
112,
1
] | [
127,
30
] | [{"tactic": "rcases h.exists_pos with \u27e8C, _hC\u2080, hC\u27e9", "annotated_tactic": ["rcases h.exists_pos with \u27e8C, _hC\u2080, hC\u27e9", []], "state_before": "p q x y : \u211d\nr : \u211a\nm : \u2124\nn : \u2115\nh : LiouvilleWith p x\nhr : r \u2260 0\n\u22a2 LiouvilleWith p (x * \u2191r)", "state_after": "ca... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Complex/Liouville.lean | Differentiable.exists_const_forall_eq_of_bounded | [
124,
1
] | [
126,
54
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Calculus/ParametricIntegral.lean | hasDerivAt_integral_of_dominated_loc_of_lip | [
199,
1
] | [
222,
83
] | [{"tactic": "set L : E \u2192L[\ud835\udd5c] \ud835\udd5c \u2192L[\ud835\udd5c] E := ContinuousLinearMap.smulRightL \ud835\udd5c \ud835\udd5c E 1", "annotated_tactic": ["set L : E \u2192L[\ud835\udd5c] \ud835\udd5c \u2192L[\ud835\udd5c] E := <a>ContinuousLinearMap.smulRightL</a> \ud835\udd5c \ud835\udd5c E 1", [{"full_... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Polynomial/HasseDeriv.lean | Polynomial.factorial_smul_hasseDeriv | [
145,
1
] | [
163,
39
] | [{"tactic": "induction' k with k ih", "annotated_tactic": ["induction' k with k ih", []], "state_before": "R : Type u_1\ninst\u271d : Semiring R\nk : \u2115\nf : R[X]\n\u22a2 \u2191(k ! \u2022 hasseDeriv k) = (\u2191derivative)^[k]", "state_after": "case zero\nR : Type u_1\ninst\u271d : Semiring R\nk : \u2115\nf : R[X]... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/CommutingProbability.lean | inv_card_commutator_le_commProb | [
137,
1
] | [
140,
43
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/Artinian.lean | IsArtinian.disjoint_partial_infs_eventually_top | [
292,
1
] | [
304,
96
] | [{"tactic": "rsuffices \u27e8n, w\u27e9 : \u2203 n : \u2115, \u2200 m, n \u2264 m \u2192 OrderDual.toDual f (m + 1) = \u22a4", "annotated_tactic": ["rsuffices \u27e8n, w\u27e9 : \u2203 n : \u2115, \u2200 m, n \u2264 m \u2192 <a>OrderDual.toDual</a> f (m + 1) = \u22a4", [{"full_name": "OrderDual.toDual", "def_path": "Ma... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/NhdsSet.lean | bUnion_mem_nhdsSet | [
54,
1
] | [
56,
46
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Filter/Basic.lean | Filter.map_comap_setCoe_val | [
2331,
1
] | [
2333,
36
] | [{"tactic": "rw [map_comap, Subtype.range_val]", "annotated_tactic": ["rw [<a>map_comap</a>, <a>Subtype.range_val</a>]", [{"full_name": "Filter.map_comap", "def_path": "Mathlib/Order/Filter/Basic.lean", "def_pos": [2323, 9], "def_end_pos": [2323, 18]}, {"full_name": "Subtype.range_val", "def_path": "Mathlib/Data/Set/Im... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/SetTheory/Cardinal/Cofinality.lean | RelIso.cof_le_lift | [
89,
1
] | [
101,
32
] | [{"tactic": "rw [Order.cof, Order.cof, lift_sInf, lift_sInf,\n le_csInf_iff'' (nonempty_image_iff.2 (Order.cof_nonempty s))]", "annotated_tactic": ["rw [<a>Order.cof</a>, <a>Order.cof</a>, <a>lift_sInf</a>, <a>lift_sInf</a>,\n <a>le_csInf_iff''</a> (<a>nonempty_image_iff</a>.2 (<a>Order.cof_nonempty</a> s))]", [{"f... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/Nullstellensatz.lean | MvPolynomial.IsPrime.vanishingIdeal_zeroLocus | [
217,
1
] | [
219,
64
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Geometry/Manifold/LocalInvariantProperties.lean | StructureGroupoid.LocalInvariantProp.liftPropWithinAt_inter' | [
360,
1
] | [
365,
61
] | [{"tactic": "rw [LiftPropWithinAt, LiftPropWithinAt, continuousWithinAt_inter' ht, hG.congr_set]", "annotated_tactic": ["rw [<a>LiftPropWithinAt</a>, <a>LiftPropWithinAt</a>, <a>continuousWithinAt_inter'</a> ht, hG.congr_set]", [{"full_name": "ChartedSpace.LiftPropWithinAt", "def_path": "Mathlib/Geometry/Manifold/Local... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Algebra/Basic.lean | Algebra.coe_algebraMap_ofSubring | [
535,
1
] | [
537,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/NormedSpace/ProdLp.lean | WithLp.prod_norm_eq_of_L2 | [
635,
1
] | [
637,
12
] | [{"tactic": "rw [prod_norm_eq_of_nat 2 (by norm_cast) _, Real.sqrt_eq_rpow]", "annotated_tactic": ["rw [<a>prod_norm_eq_of_nat</a> 2 (by norm_cast) _, <a>Real.sqrt_eq_rpow</a>]", [{"full_name": "WithLp.prod_norm_eq_of_nat", "def_path": "Mathlib/Analysis/NormedSpace/ProdLp.lean", "def_pos": [618, 9], "def_end_pos": [618... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.