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/Polynomial/Basic.lean | Polynomial.support_eq_empty | [
420,
1
] | [
422,
17
] | [{"tactic": "rcases p with \u27e8\u27e9", "annotated_tactic": ["rcases p with \u27e8\u27e9", []], "state_before": "R : Type u\na b : R\nm n : \u2115\ninst\u271d : Semiring R\np q : R[X]\n\u22a2 support p = \u2205 \u2194 p = 0", "state_after": "case ofFinsupp\nR : Type u\na b : R\nm n : \u2115\ninst\u271d : Semiring R\n... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.deleteEdges_eq_sdiff_fromEdgeSet | [
1138,
1
] | [
1141,
90
] | [{"tactic": "ext", "annotated_tactic": ["ext", []], "state_before": "\u03b9 : Sort u_1\n\ud835\udd5c : Type u_2\nV : Type u\nW : Type v\nX : Type w\nG : SimpleGraph V\nG' : SimpleGraph W\na b c u v w : V\ne : Sym2 V\ns : Set (Sym2 V)\n\u22a2 deleteEdges G s = G \\ fromEdgeSet s", "state_after": "case Adj.h.h.a\n\u03b9 ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Tactic/Ring/Basic.lean | Mathlib.Tactic.Ring.add_pos_left | [
614,
1
] | [
614,
99
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/Algebra/ConstMulAction.lean | Continuous.const_smul | [
110,
1
] | [
111,
36
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Geometry/Manifold/PartitionOfUnity.lean | exists_smooth_forall_mem_convex_of_local_const | [
587,
1
] | [
591,
53
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Normed/Group/Seminorm.lean | NonarchAddGroupSeminorm.ext | [
527,
1
] | [
528,
18
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Convex/Side.lean | AffineSubspace.SSameSide.not_wOppSide | [
646,
1
] | [
652,
19
] | [{"tactic": "intro ho", "annotated_tactic": ["intro ho", []], "state_before": "R : Type u_1\nV : Type u_2\nV' : Type u_3\nP : Type u_4\nP' : Type u_5\ninst\u271d\u2076 : LinearOrderedField R\ninst\u271d\u2075 : AddCommGroup V\ninst\u271d\u2074 : Module R V\ninst\u271d\u00b3 : AddTorsor V P\ninst\u271d\u00b2 : AddCommGr... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Lie/Submodule.lean | LieSubmodule.coe_toSubmodule | [
85,
1
] | [
86,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/Multiplicity.lean | multiplicity.finite_mul | [
509,
1
] | [
510,
58
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Minimal.lean | maximals_inter_subset | [
214,
1
] | [
215,
45
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Complex/Exponential.lean | Real.tanh_zero | [
1396,
1
] | [
1396,
49
] | [{"tactic": "simp [tanh]", "annotated_tactic": ["simp [<a>tanh</a>]", [{"full_name": "Real.tanh", "def_path": "Mathlib/Data/Complex/Exponential.lean", "def_pos": [471, 12], "def_end_pos": [471, 16]}]], "state_before": "x y : \u211d\n\u22a2 tanh 0 = 0", "state_after": "no goals"}] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/InnerProductSpace/Calculus.lean | contDiffOn_euclidean | [
376,
1
] | [
379,
6
] | [{"tactic": "rw [\u2190 (EuclideanSpace.equiv \u03b9 \ud835\udd5c).comp_contDiffOn_iff, contDiffOn_pi]", "annotated_tactic": ["rw [\u2190 (<a>EuclideanSpace.equiv</a> \u03b9 \ud835\udd5c).<a>comp_contDiffOn_iff</a>, <a>contDiffOn_pi</a>]", [{"full_name": "EuclideanSpace.equiv", "def_path": "Mathlib/Analysis/InnerProduc... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Algebra/Equiv.lean | AlgEquiv.map_finsupp_prod | [
792,
8
] | [
794,
25
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Lie/Nilpotent.lean | LieSubmodule.lcs_le_iff | [
476,
1
] | [
479,
16
] | [{"tactic": "convert lcs_add_le_iff (R := R) (L := L) (M := M) 0 k", "annotated_tactic": ["convert <a>lcs_add_le_iff</a> (R := R) (L := L) (M := M) 0 k", [{"full_name": "LieSubmodule.lcs_add_le_iff", "def_path": "Mathlib/Algebra/Lie/Nilpotent.lean", "def_pos": [470, 9], "def_end_pos": [470, 23]}]], "state_before": "R :... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/Localization/AsSubring.lean | Localization.subalgebra.mem_range_mapToFractionRing_iff_ofField | [
115,
1
] | [
123,
6
] | [{"tactic": "rw [mem_range_mapToFractionRing_iff]", "annotated_tactic": ["rw [<a>mem_range_mapToFractionRing_iff</a>]", [{"full_name": "Localization.mem_range_mapToFractionRing_iff", "def_path": "Mathlib/RingTheory/Localization/AsSubring.lean", "def_pos": [49, 9], "def_end_pos": [49, 40]}]], "state_before": "A : Type u... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/NumberTheory/ADEInequality.lean | ADEInequality.Admissible.one_lt_sumInv | [
159,
1
] | [
170,
53
] | [{"tactic": "rw [Admissible]", "annotated_tactic": ["rw [<a>Admissible</a>]", [{"full_name": "ADEInequality.Admissible", "def_path": "Mathlib/NumberTheory/ADEInequality.lean", "def_pos": [123, 5], "def_end_pos": [123, 15]}]], "state_before": "pqr : Multiset \u2115+\n\u22a2 Admissible pqr \u2192 1 < sumInv pqr", "state_... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Nat/Prime.lean | Nat.Prime.dvd_mul_of_dvd_ne | [
686,
1
] | [
688,
75
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Nat/Basic.lean | Nat.find_eq_zero | [
876,
1
] | [
876,
88
] | [{"tactic": "simp [find_eq_iff]", "annotated_tactic": ["simp [<a>find_eq_iff</a>]", [{"full_name": "Nat.find_eq_iff", "def_path": "Mathlib/Data/Nat/Basic.lean", "def_pos": [846, 9], "def_end_pos": [846, 20]}]], "state_before": "m n k : \u2115\np q : \u2115 \u2192 Prop\ninst\u271d\u00b9 : DecidablePred p\ninst\u271d : D... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Finset/Lattice.lean | Finset.sup'_mem | [
881,
1
] | [
883,
25
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean | ContinuousMap.Homotopy.apply_one_path | [
180,
1
] | [
186,
53
] | [{"tactic": "apply @eq_path_of_eq_image _ _ _ _ H.uliftMap _ _ _ _ _ ((Path.refl (ULift.up _)).prod p')", "annotated_tactic": ["apply @<a>eq_path_of_eq_image</a> _ _ _ _ H.uliftMap _ _ _ _ _ ((<a>Path.refl</a> (<a>ULift.up</a> _)).<a>prod</a> p')", [{"full_name": "ContinuousMap.Homotopy.eq_path_of_eq_image", "def_path"... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.L1.setToL1_indicatorConstLp | [
1143,
1
] | [
1147,
61
] | [{"tactic": "rw [\u2190 Lp.simpleFunc.coe_indicatorConst hs h\u03bcs x]", "annotated_tactic": ["rw [\u2190 <a>Lp.simpleFunc.coe_indicatorConst</a> hs h\u03bcs x]", [{"full_name": "MeasureTheory.Lp.simpleFunc.coe_indicatorConst", "def_path": "Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean", "def_pos": [700, 9], "... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Part.lean | Part.some_div_some | [
782,
1
] | [
782,
94
] | [{"tactic": "simp [div_def]", "annotated_tactic": ["simp [<a>div_def</a>]", [{"full_name": "Part.div_def", "def_path": "Mathlib/Data/Part.lean", "def_pos": [704, 9], "def_end_pos": [704, 16]}]], "state_before": "\u03b1 : Type u_1\n\u03b2 : Type u_2\n\u03b3 : Type u_3\ninst\u271d : Div \u03b1\na b : \u03b1\n\u22a2 some ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/NumberTheory/PellMatiyasevic.lean | Pell.x_sub_y_dvd_pow_lem | [
564,
1
] | [
567,
10
] | [{"tactic": "ring", "annotated_tactic": ["ring", []], "state_before": "a : \u2115\na1 : 1 < a\ny2 y1 y0 yn1 yn0 xn1 xn0 ay a2 : \u2124\n\u22a2 (a2 * yn1 - yn0) * ay + y2 - (a2 * xn1 - xn0) = y2 - a2 * y1 + y0 + a2 * (yn1 * ay + y1 - xn1) - (yn0 * ay + y0 - xn0)", "state_after": "no goals"}] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.lsub_lt_ord | [
335,
1
] | [
337,
43
] | [{"tactic": "rwa [(#\u03b9).lift_id]", "annotated_tactic": ["rwa [(#\u03b9).<a>lift_id</a>]", [{"full_name": "Cardinal.lift_id", "def_path": "Mathlib/SetTheory/Cardinal/Basic.lean", "def_pos": [224, 9], "def_end_pos": [224, 16]}]], "state_before": "\u03b1 : Type u_1\nr : \u03b1 \u2192 \u03b1 \u2192 Prop\n\u03b9 : Type ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Real/CauSeq.lean | CauSeq.const_inj | [
238,
1
] | [
239,
78
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Set/Image.lean | Set.preimage_const_of_mem | [
138,
1
] | [
139,
31
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Category/ModuleCat/Presheaf.lean | PresheafOfModules.map_comp | [
80,
1
] | [
83,
7
] | [{"tactic": "ext", "annotated_tactic": ["ext", []], "state_before": "C : Type u\u2081\ninst\u271d : Category.{v\u2081, u\u2081} C\nR : C\u1d52\u1d56 \u2964 RingCat\nP : PresheafOfModules R\nX Y Z : C\u1d52\u1d56\nf : X \u27f6 Y\ng : Y \u27f6 Z\n\u22a2 map P (f \u226b g) = comp (map P g) (map P f)", "state_after": "case... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/MonoidLocalization.lean | Submonoid.LocalizationMap.ofMulEquivOfLocalizations_id | [
1465,
1
] | [
1466,
11
] | [{"tactic": "ext", "annotated_tactic": ["ext", []], "state_before": "M : Type u_1\ninst\u271d\u00b3 : CommMonoid M\nS : Submonoid M\nN : Type u_2\ninst\u271d\u00b2 : CommMonoid N\nP : Type u_3\ninst\u271d\u00b9 : CommMonoid P\nf : LocalizationMap S N\ng : M \u2192* P\nhg : \u2200 (y : { x // x \u2208 S }), IsUnit (\u21... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/PropInstances.lean | Prop.top_eq_true | [
47,
1
] | [
48,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/CategoryTheory/Bicategory/Adjunction.lean | CategoryTheory.Bicategory.leftZigzagIso_inv | [
132,
1
] | [
133,
49
] | [{"tactic": "simp [bicategoricalComp, bicategoricalIsoComp]", "annotated_tactic": ["simp [<a>bicategoricalComp</a>, <a>bicategoricalIsoComp</a>]", [{"full_name": "Mathlib.Tactic.BicategoryCoherence.bicategoricalComp", "def_path": "Mathlib/Tactic/CategoryTheory/BicategoryCoherence.lean", "def_pos": [210, 5], "def_end_po... |
https://github.com/leanprover/std4 | 869c615eb10130c0637a7bc038e2b80253559913 | lake-packages/std/Std/Data/Nat/Gcd.lean | Nat.coprime_one_right_eq_true | [
378,
9
] | [
378,
100
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Nat/Sqrt.lean | Nat.lt_succ_sqrt' | [
76,
1
] | [
77,
47
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/LocallyConvex/Basic.lean | balanced_zero_union_interior | [
355,
1
] | [
367,
50
] | [{"tactic": "intro a ha", "annotated_tactic": ["intro a ha", []], "state_before": "\ud835\udd5c : Type u_1\n\ud835\udd5d : Type u_2\nE : Type u_3\n\u03b9 : Sort u_4\n\u03ba : \u03b9 \u2192 Sort u_5\ninst\u271d\u2078 : NormedField \ud835\udd5c\ninst\u271d\u2077 : NormedRing \ud835\udd5d\ninst\u271d\u2076 : NormedSpace \... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/GCDMonoid/Finset.lean | Finset.gcd_mono | [
198,
1
] | [
199,
36
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Antichain.lean | IsStrongAntichain.mono | [
285,
1
] | [
286,
86
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RepresentationTheory/Action.lean | Action.functorCategoryMonoidalEquivalence.ε_app | [
654,
1
] | [
658,
6
] | [{"tactic": "dsimp only [functorCategoryMonoidalEquivalence]", "annotated_tactic": ["dsimp only [<a>functorCategoryMonoidalEquivalence</a>]", [{"full_name": "Action.functorCategoryMonoidalEquivalence", "def_path": "Mathlib/RepresentationTheory/Action.lean", "def_pos": [623, 5], "def_end_pos": [623, 39]}]], "state_befor... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/Algebra/Order/Compact.lean | Continuous.exists_forall_ge' | [
272,
1
] | [
274,
50
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/BoundedOrder.lean | isBot_bot | [
261,
1
] | [
261,
53
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/MetricSpace/Infsep.lean | Set.Finite.infsep_of_nontrivial | [
492,
1
] | [
494,
45
] | [{"tactic": "simpa", "annotated_tactic": ["simpa", []], "state_before": "\u03b1 : Type u_1\n\u03b2 : Type u_2\ninst\u271d : PseudoMetricSpace \u03b1\nx y z : \u03b1\ns t : Set \u03b1\nhsf : Set.Finite s\nhs : Set.Nontrivial s\n\u22a2 Finset.Nonempty (Finite.toFinset (_ : Set.Finite (offDiag s)))", "state_after": "no go... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Bounds/Basic.lean | bddBelow_Ioo | [
683,
1
] | [
684,
40
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Nat/Choose/Factorization.lean | Nat.prod_pow_factorization_centralBinom | [
147,
1
] | [
150,
11
] | [{"tactic": "apply prod_pow_factorization_choose", "annotated_tactic": ["apply <a>prod_pow_factorization_choose</a>", [{"full_name": "Nat.prod_pow_factorization_choose", "def_path": "Mathlib/Data/Nat/Choose/Factorization.lean", "def_pos": [130, 9], "def_end_pos": [130, 38]}]], "state_before": "p n\u271d k n : \u2115\n\... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/OmegaCompletePartialOrder.lean | OmegaCompletePartialOrder.ContinuousHom.bind_continuous' | [
703,
1
] | [
707,
54
] | [{"tactic": "intro c", "annotated_tactic": ["intro c", []], "state_before": "\u03b1 : Type u\n\u03b1' : Type u_1\n\u03b2\u271d : Type v\n\u03b2' : Type u_2\n\u03b3\u271d : Type u_3\n\u03c6 : Type u_4\ninst\u271d\u2075 : OmegaCompletePartialOrder \u03b1\ninst\u271d\u2074 : OmegaCompletePartialOrder \u03b2\u271d\ninst\u2... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Hom/CompleteLattice.lean | FrameHom.coe_comp | [
611,
1
] | [
612,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/CategoryTheory/Category/Basic.lean | CategoryTheory.dite_comp | [
257,
1
] | [
259,
88
] | [{"tactic": "aesop", "annotated_tactic": ["aesop", []], "state_before": "C : Type u\ninst\u271d\u00b9 : Category.{v, u} C\nX\u271d Y\u271d Z\u271d : C\nP : Prop\ninst\u271d : Decidable P\nX Y Z : C\nf : P \u2192 (X \u27f6 Y)\nf' : \u00acP \u2192 (X \u27f6 Y)\ng : Y \u27f6 Z\n\u22a2 (if h : P then f h else f' h) \u226b ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.bddAbove_iff_small | [
1379,
1
] | [
1381,
82
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Finsupp/Defs.lean | Finsupp.support_add_eq | [
985,
1
] | [
994,
88
] | [{"tactic": "have : a \u2209 g\u2082.support := disjoint_left.1 h ha", "annotated_tactic": ["have : a \u2209 g\u2082.support := <a>disjoint_left</a>.1 h ha", [{"full_name": "Finset.disjoint_left", "def_path": "Mathlib/Data/Finset/Basic.lean", "def_pos": [939, 9], "def_end_pos": [939, 22]}]], "state_before": "\u03b1 : T... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Logic/Basic.lean | bex_or_left | [
1117,
1
] | [
1120,
64
] | [{"tactic": "simp only [exists_prop]", "annotated_tactic": ["simp only [<a>exists_prop</a>]", [{"full_name": "exists_prop", "def_path": "lake-packages/std/Std/Logic.lean", "def_pos": [485, 17], "def_end_pos": [485, 28]}]], "state_before": "\u03b1 : Sort u_1\nr p q : \u03b1 \u2192 Prop\nP Q : (x : \u03b1) \u2192 p x \u2... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Combinatorics/Young/YoungDiagram.lean | YoungDiagram.pos_of_mem_rowLens | [
430,
1
] | [
433,
69
] | [{"tactic": "rw [rowLens, List.mem_map] at hx", "annotated_tactic": ["rw [<a>rowLens</a>, <a>List.mem_map</a>] at hx", [{"full_name": "YoungDiagram.rowLens", "def_path": "Mathlib/Combinatorics/Young/YoungDiagram.lean", "def_pos": [411, 5], "def_end_pos": [411, 12]}, {"full_name": "List.mem_map", "def_path": "lake-packa... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/Order/Basic.lean | Monotone.tendsto_nhdsWithin_Ioi | [
2974,
1
] | [
2977,
66
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/ModelTheory/Satisfiability.lean | FirstOrder.Language.exists_elementaryEmbedding_card_eq | [
260,
1
] | [
269,
31
] | [{"tactic": "cases le_or_gt (lift.{w'} \u03ba) (Cardinal.lift.{w} #M)", "annotated_tactic": ["cases <a>le_or_gt</a> (<a>lift</a>.{w'} \u03ba) (<a>Cardinal.lift</a>.{w} #M)", [{"full_name": "le_or_gt", "def_path": "Mathlib/Init/Order/Defs.lean", "def_pos": [348, 9], "def_end_pos": [348, 17]}, {"full_name": "Cardinal.lif... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Real/ConjugateExponents.lean | Real.isConjugateExponent_conjugateExponent | [
123,
1
] | [
124,
85
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Multiset/Powerset.lean | Multiset.powersetAux_perm | [
76,
1
] | [
78,
68
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/LocalHomeomorph.lean | LocalHomeomorph.eqOnSource_refl | [
947,
1
] | [
947,
49
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/Order/Basic.lean | nhdsWithin_Icc_eq_nhdsWithin_Ici | [
574,
1
] | [
575,
67
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/CompactOpen.lean | ContinuousMap.tendsto_compactOpen_iff_forall | [
283,
1
] | [
287,
76
] | [{"tactic": "simp [nhds_iInf, nhds_induced, Filter.tendsto_comap_iff, Function.comp]", "annotated_tactic": ["simp [<a>nhds_iInf</a>, <a>nhds_induced</a>, <a>Filter.tendsto_comap_iff</a>, <a>Function.comp</a>]", [{"full_name": "nhds_iInf", "def_path": "Mathlib/Topology/Order.lean", "def_pos": [684, 9], "def_end_pos": [6... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean | MeasureTheory.aecover_Icc | [
139,
1
] | [
140,
42
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.Integrable.toL1_smul | [
1480,
1
] | [
1482,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/MonoidLocalization.lean | Submonoid.LocalizationMap.lift_spec | [
959,
1
] | [
960,
24
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Probability/Kernel/Basic.lean | ProbabilityTheory.kernel.restrict_apply' | [
509,
1
] | [
511,
56
] | [{"tactic": "rw [restrict_apply \u03ba hs a, Measure.restrict_apply ht]", "annotated_tactic": ["rw [<a>restrict_apply</a> \u03ba hs a, <a>Measure.restrict_apply</a> ht]", [{"full_name": "ProbabilityTheory.kernel.restrict_apply", "def_path": "Mathlib/Probability/Kernel/Basic.lean", "def_pos": [504, 9], "def_end_pos": [5... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/MeasurableSpace/Basic.lean | measurable_of_restrict_of_restrict_compl | [
654,
1
] | [
656,
86
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.cospanCompIso_hom_app_one | [
310,
1
] | [
310,
97
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Finset/PImage.lean | Finset.pimage_eq_image_filter | [
90,
1
] | [
97,
27
] | [{"tactic": "ext x", "annotated_tactic": ["ext x", []], "state_before": "\u03b1 : Type u_1\n\u03b2 : Type u_2\ninst\u271d\u00b2 : DecidableEq \u03b2\nf g : \u03b1 \u2192. \u03b2\ninst\u271d\u00b9 : (x : \u03b1) \u2192 Decidable (f x).Dom\ninst\u271d : (x : \u03b1) \u2192 Decidable (g x).Dom\ns t : Finset \u03b1\nb : \u... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Order/ToIntervalMod.lean | toIocMod_le_right | [
107,
1
] | [
108,
46
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/GroupWithZero/Defs.lean | mul_left_injective₀ | [
75,
1
] | [
76,
34
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Fin/VecNotation.lean | Matrix.cons_add | [
462,
1
] | [
465,
54
] | [{"tactic": "ext i", "annotated_tactic": ["ext i", []], "state_before": "\u03b1 : Type u\nm n o : \u2115\nm' : Type u_1\nn' : Type u_2\no' : Type u_3\ninst\u271d : Add \u03b1\nx : \u03b1\nv : Fin n \u2192 \u03b1\nw : Fin (Nat.succ n) \u2192 \u03b1\n\u22a2 vecCons x v + w = vecCons (x + vecHead w) (v + vecTail w)", "sta... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.cons_isCycle_iff | [
1085,
1
] | [
1090,
8
] | [{"tactic": "simp only [Walk.isCycle_def, Walk.isPath_def, Walk.isTrail_def, edges_cons, List.nodup_cons,\n support_cons, List.tail_cons]", "annotated_tactic": ["simp only [<a>Walk.isCycle_def</a>, <a>Walk.isPath_def</a>, <a>Walk.isTrail_def</a>, <a>edges_cons</a>, <a>List.nodup_cons</a>,\n <a>support_cons</a>, <a>... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Integral/CircleIntegral.lean | hasDerivAt_circleMap | [
172,
1
] | [
175,
93
] | [{"tactic": "simpa only [mul_assoc, one_mul, ofRealClm_apply, circleMap, ofReal_one, zero_add]\n using (((ofRealClm.hasDerivAt (x := \u03b8)).mul_const I).cexp.const_mul (R : \u2102)).const_add c", "annotated_tactic": ["simpa only [<a>mul_assoc</a>, <a>one_mul</a>, <a>ofRealClm_apply</a>, <a>circleMap</a>, <a>ofReal_o... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean | second_derivative_symmetric_of_eventually | [
308,
1
] | [
316,
97
] | [{"tactic": "rcases Metric.mem_nhds_iff.1 hf with \u27e8\u03b5, \u03b5pos, h\u03b5\u27e9", "annotated_tactic": ["rcases <a>Metric.mem_nhds_iff</a>.1 hf with \u27e8\u03b5, \u03b5pos, h\u03b5\u27e9", [{"full_name": "Metric.mem_nhds_iff", "def_path": "Mathlib/Topology/MetricSpace/Basic.lean", "def_pos": [954, 9], "def_end... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/DFinsupp/Basic.lean | DFinsupp.prod_mul | [
1816,
1
] | [
1819,
26
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/ContinuousFunction/Ideals.lean | ContinuousMap.setOfIdeal_ofSet_eq_interior | [
314,
1
] | [
333,
21
] | [{"tactic": "refine'\n Set.Subset.antisymm\n ((setOfIdeal_open (idealOfSet \ud835\udd5c s)).subset_interior_iff.mpr fun x hx =>\n let \u27e8f, hf, hfx\u27e9 := mem_setOfIdeal.mp hx\n Set.not_mem_compl_iff.mp (mt (@hf x) hfx))\n fun x hx => _", "annotated_tactic": ["refine'\n <a>Set.Subset.antisymm</... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/IndicatorFunction.lean | Set.mulIndicator_mul_compl_eq_piecewise | [
454,
1
] | [
461,
58
] | [{"tactic": "ext x", "annotated_tactic": ["ext x", []], "state_before": "\u03b1 : Type u_1\n\u03b2 : Type u_2\n\u03b9 : Type u_3\nM : Type u_4\nN : Type u_5\ninst\u271d\u00b9 : MulOneClass M\ns t : Set \u03b1\nf\u271d g\u271d : \u03b1 \u2192 M\na : \u03b1\ninst\u271d : DecidablePred fun x => x \u2208 s\nf g : \u03b1 \u... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/JordanHolder.lean | CompositionSeries.toList_sorted | [
254,
1
] | [
258,
25
] | [{"tactic": "dsimp [toList]", "annotated_tactic": ["dsimp [<a>toList</a>]", [{"full_name": "CompositionSeries.toList", "def_path": "Mathlib/Order/JordanHolder.lean", "def_pos": [200, 5], "def_end_pos": [200, 11]}]], "state_before": "X : Type u\ninst\u271d\u00b9 : Lattice X\ninst\u271d : JordanHolderLattice X\ns : Compo... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Logic/Basic.lean | Decidable.and_forall_ne | [
758,
1
] | [
760,
85
] | [{"tactic": "simp only [\u2190 @forall_eq _ p a, \u2190 forall_and, \u2190 or_imp, Decidable.em, forall_const]", "annotated_tactic": ["simp only [\u2190 @<a>forall_eq</a> _ p a, \u2190 <a>forall_and</a>, \u2190 <a>or_imp</a>, <a>Decidable.em</a>, <a>forall_const</a>]", [{"full_name": "forall_eq", "def_path": "lake-pack... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Tactic/NormNum/GCD.lean | Tactic.NormNum.nat_gcd_helper_1' | [
49,
1
] | [
51,
63
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/PFunctor/Univariate/M.lean | PFunctor.M.iselect_eq_default | [
512,
1
] | [
529,
15
] | [{"tactic": "induction' ps with ps_hd ps_tail ps_ih generalizing x", "annotated_tactic": ["induction' ps with ps_hd ps_tail ps_ih generalizing x", []], "state_before": "F : PFunctor.{u}\nX : Type u_1\nf : X \u2192 \u2191F X\ninst\u271d\u00b9 : DecidableEq F.A\ninst\u271d : Inhabited (M F)\nps : Path F\nx : M F\nh : \u0... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.norm_setToFun_le_mul_norm | [
1688,
1
] | [
1690,
73
] | [{"tactic": "rw [L1.setToFun_eq_setToL1]", "annotated_tactic": ["rw [<a>L1.setToFun_eq_setToL1</a>]", [{"full_name": "MeasureTheory.L1.setToFun_eq_setToL1", "def_path": "Mathlib/MeasureTheory/Integral/SetToL1.lean", "def_pos": [1281, 9], "def_end_pos": [1281, 31]}]], "state_before": "\u03b1 : Type u_1\nE : Type u_2\nF ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | algebraMap_mem | [
108,
1
] | [
111,
82
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/CompactlyGenerated.lean | exists_setIndependent_of_sSup_atoms_eq_top | [
607,
1
] | [
610,
56
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/Maps.lean | IsOpenMap.mapsTo_interior | [
368,
1
] | [
371,
93
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Logic/Function/Basic.lean | Function.LeftInverse.eq_rightInverse | [
389,
1
] | [
393,
65
] | [{"tactic": "rw [h\u2082.comp_eq_id, comp.right_id]", "annotated_tactic": ["rw [h\u2082.comp_eq_id, <a>comp.right_id</a>]", [{"full_name": "Function.comp.right_id", "def_path": "Mathlib/Init/Function.lean", "def_pos": [100, 9], "def_end_pos": [100, 22]}]], "state_before": "\u03b1 : Sort u_1\n\u03b2 : Sort u_2\n\u03b3 :... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/GroupTheory/Exponent.lean | Monoid.exponentExists_iff_ne_zero | [
78,
1
] | [
83,
10
] | [{"tactic": "rw [exponent]", "annotated_tactic": ["rw [<a>exponent</a>]", [{"full_name": "Monoid.exponent", "def_path": "Mathlib/GroupTheory/Exponent.lean", "def_pos": [70, 19], "def_end_pos": [70, 27]}]], "state_before": "G : Type u\ninst\u271d : Monoid G\n\u22a2 ExponentExists G \u2194 exponent G \u2260 0", "state_af... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/UniformSpace/Equicontinuity.lean | Equicontinuous.closure' | [
485,
1
] | [
487,
80
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/UniformSpace/AbstractCompletion.lean | AbstractCompletion.inverse_compare | [
258,
1
] | [
264,
6
] | [{"tactic": "have uc := pkg.uniformContinuous_compare pkg'", "annotated_tactic": ["have uc := pkg.uniformContinuous_compare pkg'", []], "state_before": "\u03b1 : Type u_1\ninst\u271d\u00b9 : UniformSpace \u03b1\npkg : AbstractCompletion \u03b1\n\u03b2 : Type u_2\ninst\u271d : UniformSpace \u03b2\npkg' : AbstractComplet... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Algebra/Order/Ring/Lemmas.lean | mul_left_cancel_iff_of_pos | [
520,
1
] | [
522,
55
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/RingTheory/Valuation/ValuationSubring.lean | ValuationSubring.idealOfLE_ofPrime | [
338,
1
] | [
342,
32
] | [{"tactic": "refine Ideal.ext (fun x => ?_)", "annotated_tactic": ["refine <a>Ideal.ext</a> (fun x => ?_)", [{"full_name": "Ideal.ext", "def_path": "Mathlib/RingTheory/Ideal/Basic.lean", "def_pos": [70, 9], "def_end_pos": [70, 12]}]], "state_before": "K : Type u\ninst\u271d\u00b9 : Field K\nA\u271d A : ValuationSubring... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/SpecificLimits/Basic.lean | NNReal.tendsto_const_div_atTop_nhds_0_nat | [
45,
1
] | [
47,
77
] | [{"tactic": "simpa using tendsto_const_nhds.mul NNReal.tendsto_inverse_atTop_nhds_0_nat", "annotated_tactic": ["simpa using tendsto_const_nhds.mul <a>NNReal.tendsto_inverse_atTop_nhds_0_nat</a>", [{"full_name": "NNReal.tendsto_inverse_atTop_nhds_0_nat", "def_path": "Mathlib/Analysis/SpecificLimits/Basic.lean", "def_pos... |
https://github.com/leanprover/std4 | 869c615eb10130c0637a7bc038e2b80253559913 | lake-packages/std/Std/Data/Int/DivMod.lean | Int.mul_fmod_right | [
468,
9
] | [
469,
35
] | [{"tactic": "rw [Int.mul_comm, mul_fmod_left]", "annotated_tactic": ["rw [<a>Int.mul_comm</a>, <a>mul_fmod_left</a>]", [{"full_name": "Int.mul_comm", "def_path": "lake-packages/std/Std/Data/Int/Lemmas.lean", "def_pos": [380, 19], "def_end_pos": [380, 27]}, {"full_name": "Int.mul_fmod_left", "def_path": "lake-packages/s... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Fintype/BigOperators.lean | Fintype.prod_option | [
113,
1
] | [
114,
32
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Set/Intervals/Basic.lean | Set.Icc_subset_Ico_union_Icc | [
1554,
1
] | [
1555,
84
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Analysis/Calculus/MeanValue.lean | Convex.norm_image_sub_le_of_norm_hasFDerivWithin_le' | [
566,
1
] | [
579,
93
] | [{"tactic": "let g y := f y - \u03c6 y", "annotated_tactic": ["let g y := f y - \u03c6 y", []], "state_before": "E : Type u_1\ninst\u271d\u2077 : NormedAddCommGroup E\ninst\u271d\u2076 : NormedSpace \u211d E\nF : Type u_2\ninst\u271d\u2075 : NormedAddCommGroup F\ninst\u271d\u2074 : NormedSpace \u211d F\n\ud835\udd5c : ... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean | CategoryTheory.Limits.prod.lift_fst_snd | [
737,
1
] | [
738,
63
] | [{"tactic": "ext <;> simp", "annotated_tactic": ["ext <;> simp", []], "state_before": "C : Type u\ninst\u271d\u00b9 : Category.{v, u} C\nX\u271d Y\u271d X Y : C\ninst\u271d : HasBinaryProduct X Y\n\u22a2 lift fst snd = \ud835\udfd9 (X \u2a2f Y)", "state_after": "no goals"}] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/LocalExtr.lean | IsLocalMaxOn.comp_mono | [
248,
8
] | [
250,
18
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/CategoryTheory/Limits/Shapes/WideEqualizers.lean | CategoryTheory.Limits.parallelFamily_obj_one | [
143,
1
] | [
144,
6
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Data/Vector/Basic.lean | Vector.scanl_singleton | [
364,
1
] | [
366,
63
] | [{"tactic": "rw [\u2190 cons_head_tail v]", "annotated_tactic": ["rw [\u2190 <a>cons_head_tail</a> v]", [{"full_name": "Vector.cons_head_tail", "def_path": "Mathlib/Data/Vector.lean", "def_pos": [81, 9], "def_end_pos": [81, 23]}]], "state_before": "n : \u2115\n\u03b1 : Type u_1\n\u03b2 : Type u_2\nf : \u03b2 \u2192 \u0... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Order/Bounds/Basic.lean | mem_upperBounds_image2_of_mem_upperBounds_of_mem_lowerBounds | [
1415,
1
] | [
1417,
78
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/LinearAlgebra/Orientation.lean | Basis.orientation_adjustToOrientation | [
319,
1
] | [
325,
12
] | [{"tactic": "rw [adjustToOrientation]", "annotated_tactic": ["rw [<a>adjustToOrientation</a>]", [{"full_name": "Basis.adjustToOrientation", "def_path": "Mathlib/LinearAlgebra/Orientation.lean", "def_pos": [311, 5], "def_end_pos": [311, 24]}]], "state_before": "R : Type u_1\ninst\u271d\u2076 : LinearOrderedCommRing R\nM... |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Iso.reachable_iff | [
1993,
1
] | [
1995,
85
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Topology/Sheaves/SheafCondition/UniqueGluing.lean | TopCat.Presheaf.isSheaf_iff_isSheafUniqueGluing | [
164,
1
] | [
166,
59
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/Combinatorics/SimpleGraph/Density.lean | SimpleGraph.interedges_biUnion_right | [
364,
1
] | [
366,
39
] | [] |
https://github.com/leanprover-community/mathlib4 | 3ce43c18f614b76e161f911b75a3e1ef641620ff | Mathlib/MeasureTheory/Integral/Average.lean | MeasureTheory.measure_integral_le_pos | [
572,
1
] | [
574,
63
] | [{"tactic": "simpa only [average_eq_integral] using\n measure_average_le_pos (IsProbabilityMeasure.ne_zero \u03bc) hf", "annotated_tactic": ["simpa only [<a>average_eq_integral</a>] using\n <a>measure_average_le_pos</a> (<a>IsProbabilityMeasure.ne_zero</a> \u03bc) hf", [{"full_name": "MeasureTheory.average_eq_integ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.