file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/Order/Filter/Pointwise.lean | Filter.NeBot.of_vsub_left | [] | [
1121,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1120,
1
] |
Mathlib/Data/Nat/Bitwise.lean | Nat.zero_of_testBit_eq_false | [
{
"state_after": "case z\nn : ℕ\nh✝ : ∀ (i : ℕ), testBit n i = false\nh : ∀ (i : ℕ), testBit 0 i = false\n⊢ 0 = 0\n\ncase f\nn✝ : ℕ\nh✝ : ∀ (i : ℕ), testBit n✝ i = false\nb : Bool\nn : ℕ\nhn : (∀ (i : ℕ), testBit n i = false) → n = 0\nh : ∀ (i : ℕ), testBit (bit b n) i = false\n⊢ bit b n = 0",
"state_before... | [
69,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/Logic/Equiv/Defs.lean | Equiv.arrowCongr_comp | [
{
"state_after": "case h\nα : Sort u\nβ : Sort v\nγ : Sort w\nα₁ : Sort u_1\nβ₁ : Sort u_2\nγ₁ : Sort u_3\nα₂ : Sort u_4\nβ₂ : Sort u_5\nγ₂ : Sort u_6\nea : α₁ ≃ α₂\neb : β₁ ≃ β₂\nec : γ₁ ≃ γ₂\nf : α₁ → β₁\ng : β₁ → γ₁\nx✝ : α₂\n⊢ ↑(arrowCongr ea ec) (g ∘ f) x✝ = (↑(arrowCongr eb ec) g ∘ ↑(arrowCongr ea eb) f) ... | [
526,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
523,
1
] |
Mathlib/Order/Filter/Germ.lean | Filter.Germ.coe_smul' | [] | [
577,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
576,
1
] |
Mathlib/Data/List/Zip.lean | List.zip_map_right | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type u_1\nγ : Type u_2\nδ : Type ?u.23236\nε : Type ?u.23239\nf : β → γ\nl₁ : List α\nl₂ : List β\n⊢ zip l₁ (map f l₂) = map (Prod.map id f) (zip l₁ l₂)",
"tactic": "rw [← zip_map, map_id]"
}
] | [
135,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/Data/Set/Pointwise/Interval.lean | Set.preimage_const_mul_Ico_of_neg | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedField α\na✝ a b c : α\nh : c < 0\n⊢ (fun x x_1 => x * x_1) c ⁻¹' Ico a b = Ioc (b / c) (a / c)",
"tactic": "simpa only [mul_comm] using preimage_mul_const_Ico_of_neg a b h"
}
] | [
679,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
677,
1
] |
Mathlib/RingTheory/Ideal/QuotientOperations.lean | DoubleQuot.coe_liftSupQuotQuotMkₐ | [] | [
742,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
741,
1
] |
Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | intervalIntegral.deriv_integral_of_tendsto_ae_left | [] | [
801,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
798,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.add_lt_add_iff_left' | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.55356\nβ : Type ?u.55359\nγ : Type ?u.55362\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\na b c : Ordinal\n⊢ a + b < a + c ↔ b < c",
"tactic": "rw [← not_le, ← not_le, add_le_add_iff_left]"
}
] | [
123,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
9
] |
Mathlib/Topology/Algebra/Order/T5.lean | Set.compl_section_ordSeparatingSet_mem_nhdsWithin_Ici | [
{
"state_after": "X : Type u_1\ninst✝² : LinearOrder X\ninst✝¹ : TopologicalSpace X\ninst✝ : OrderTopology X\na b c : X\ns t : Set X\nhd : Disjoint s (closure t)\nha : a ∈ s\nhmem : tᶜ ∈ 𝓝[Ici a] a\n⊢ ordConnectedSection (ordSeparatingSet s t)ᶜ ∈ 𝓝[Ici a] a",
"state_before": "X : Type u_1\ninst✝² : Linear... | [
66,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
36,
1
] |
Mathlib/Order/Basic.lean | Prod.swap_lt_swap | [] | [
1217,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1216,
1
] |
Mathlib/GroupTheory/GroupAction/SubMulAction.lean | SubMulAction.smul_mem | [] | [
176,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
175,
1
] |
Mathlib/MeasureTheory/Decomposition/Lebesgue.lean | MeasureTheory.Measure.measurable_rnDeriv | [
{
"state_after": "case pos\nα : Type u_1\nβ : Type ?u.32980\nm : MeasurableSpace α\nμ✝ ν✝ μ ν : Measure α\nh : HaveLebesgueDecomposition μ ν\n⊢ Measurable (rnDeriv μ ν)\n\ncase neg\nα : Type u_1\nβ : Type ?u.32980\nm : MeasurableSpace α\nμ✝ ν✝ μ ν : Measure α\nh : ¬HaveLebesgueDecomposition μ ν\n⊢ Measurable (r... | [
131,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/Algebra/Ring/Defs.lean | neg_mul_neg | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nR : Type x\ninst✝¹ : Mul α\ninst✝ : HasDistribNeg α\na b : α\n⊢ -a * -b = a * b",
"tactic": "simp"
}
] | [
301,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/Analysis/Convex/Side.lean | Function.Injective.sOppSide_map_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nV : Type u_2\nV' : Type u_4\nP : Type u_3\nP' : Type u_5\ninst✝⁶ : StrictOrderedCommRing R\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P'\ns : AffineSub... | [
129,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/RingTheory/Localization/Integer.lean | IsLocalization.exists_integer_multiple | [
{
"state_after": "R : Type u_1\ninst✝⁴ : CommRing R\nM : Submonoid R\nS : Type u_2\ninst✝³ : CommRing S\ninst✝² : Algebra R S\nP : Type ?u.21895\ninst✝¹ : CommRing P\ninst✝ : IsLocalization M S\na : S\n⊢ ∃ b, IsInteger R (a * ↑(algebraMap R S) ↑b)",
"state_before": "R : Type u_1\ninst✝⁴ : CommRing R\nM : Su... | [
93,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.singletonSubgraph_connected | [
{
"state_after": "case preconnected\nV : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nv : V\n⊢ Preconnected (Subgraph.coe (SimpleGraph.singletonSubgraph G v))",
"state_before": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'... | [
2189,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2184,
1
] |
Mathlib/Topology/Constructions.lean | IsOpenMap.prod | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type u_1\nδ : Type u_2\nε : Type ?u.96477\nζ : Type ?u.96480\ninst✝⁵ : TopologicalSpace α\ninst✝⁴ : TopologicalSpace β\ninst✝³ : TopologicalSpace γ\ninst✝² : TopologicalSpace δ\ninst✝¹ : TopologicalSpace ε\ninst✝ : TopologicalSpace ζ\nf : α → β\ng : γ → δ\nhf : IsOp... | [
833,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
828,
11
] |
Mathlib/Data/List/Basic.lean | List.reverse_replicate | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.27597\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nn : ℕ\na : α\n⊢ length (reverse (replicate n a)) = n",
"tactic": "rw [length_reverse, length_replicate]"
}
] | [
669,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
666,
9
] |
Mathlib/Analysis/NormedSpace/Exponential.lean | exp_hasFPowerSeriesAt_zero | [] | [
445,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
444,
1
] |
Mathlib/Algebra/Free.lean | FreeSemigroup.pure_seq | [] | [
617,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
617,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Iic_erase | [
{
"state_after": "case a\nι : Type ?u.117576\nα : Type u_1\ninst✝² : PartialOrder α\ninst✝¹ : LocallyFiniteOrderBot α\ninst✝ : DecidableEq α\nb a✝ : α\n⊢ a✝ ∈ erase (Iic b) b ↔ a✝ ∈ Iio b",
"state_before": "ι : Type ?u.117576\nα : Type u_1\ninst✝² : PartialOrder α\ninst✝¹ : LocallyFiniteOrderBot α\ninst✝ : ... | [
715,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
713,
1
] |
Mathlib/RingTheory/Finiteness.lean | Submodule.fg_biSup | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nM : Type u_3\ninst✝² : Semiring R\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\nι : Type u_1\ns : Finset ι\nN : ι → Submodule R M\nh : ∀ (i : ι), i ∈ s → FG (N i)\n⊢ FG (⨆ (i : ι) (_ : i ∈ s), N i)",
"tactic": "simpa only [Finset.sup_eq_iSup] ... | [
194,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Analysis/Complex/Basic.lean | Complex.ringHom_eq_ofReal_of_continuous | [
{
"state_after": "no goals",
"state_before": "E : Type ?u.1071891\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℂ E\nf : ℝ →+* ℂ\nh : Continuous ↑f\n⊢ f = ofReal",
"tactic": "convert congr_arg AlgHom.toRingHom <| Subsingleton.elim (AlgHom.mk' f <| map_real_smul f h)\n (Algebra.ofId ℝ ℂ)"
}
] | [
394,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
392,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.mem_sInf | [] | [
995,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
994,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.list_get?₁ | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nσ : Type ?u.50240\ninst✝¹ : Primcodable α\ninst✝ : Primcodable σ\na : α\nl : List α\nn : ℕ\n⊢ (Nat.casesOn n (Nat.succ (encode a)) fun n => encode (List.get? l (ofNat ℕ n))) =\n encode (List.get? (a :: l) (ofNat ℕ n))",
"tactic": "cases n <;... | [
383,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/Probability/ConditionalProbability.lean | ProbabilityTheory.cond_isProbabilityMeasure | [
{
"state_after": "Ω : Type u_1\nm : MeasurableSpace Ω\nμ : MeasureTheory.Measure Ω\ns t : Set Ω\ninst✝ : IsFiniteMeasure μ\nhcs : ↑↑μ s ≠ 0\n⊢ (↑↑μ s)⁻¹ • ↑↑μ s = 1",
"state_before": "Ω : Type u_1\nm : MeasurableSpace Ω\nμ : MeasureTheory.Measure Ω\ns t : Set Ω\ninst✝ : IsFiniteMeasure μ\nhcs : ↑↑μ s ≠ 0\n⊢... | [
90,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Submonoid.LocalizationMap.mulEquivOfLocalizations_symm_apply | [] | [
1381,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1380,
1
] |
Mathlib/Algebra/Group/ULift.lean | ULift.mul_down | [] | [
52,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
51,
1
] |
Mathlib/Data/Int/GCD.lean | Int.dvd_of_dvd_mul_right_of_gcd_one | [
{
"state_after": "a b c : ℤ\nhabc : a ∣ c * b\nhab : gcd a b = 1\n⊢ a ∣ c",
"state_before": "a b c : ℤ\nhabc : a ∣ b * c\nhab : gcd a b = 1\n⊢ a ∣ c",
"tactic": "rw [mul_comm] at habc"
},
{
"state_after": "no goals",
"state_before": "a b c : ℤ\nhabc : a ∣ c * b\nhab : gcd a b = 1\n⊢ a ∣ c",
... | [
426,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
1
] |
Mathlib/Analysis/Fourier/FourierTransform.lean | Fourier.fourierIntegral_smul_const | [] | [
212,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
210,
1
] |
Mathlib/Data/Part.lean | Part.right_dom_of_mod_dom | [] | [
791,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
791,
1
] |
Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean | MeasureTheory.AECover.lintegral_tendsto_of_nat | [
{
"state_after": "α : Type u_1\nι : Type ?u.93118\ninst✝ : MeasurableSpace α\nμ : Measure α\nl : Filter ι\nφ : ℕ → Set α\nhφ : AECover μ atTop φ\nf : α → ℝ≥0∞\nhfm : AEMeasurable f\nlim₁ : Tendsto (fun i => ∫⁻ (x : α) in ⋂ (k : ℕ) (_ : k ∈ Ici i), φ k, f x ∂μ) atTop (𝓝 (∫⁻ (x : α), f x ∂μ))\n⊢ Tendsto (fun x =... | [
376,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
368,
1
] |
Mathlib/Algebra/Order/Monoid/Lemmas.lean | lt_of_mul_lt_of_one_le_right | [] | [
1086,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1083,
1
] |
Mathlib/Analysis/PSeries.lean | NNReal.summable_rpow_inv | [
{
"state_after": "no goals",
"state_before": "p : ℝ\n⊢ (Summable fun n => (↑n ^ p)⁻¹) ↔ 1 < p",
"tactic": "simp [← NNReal.summable_coe]"
}
] | [
276,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
274,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.univ_mul_univ | [] | [
996,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
995,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.preimage_mul_right_one' | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.134683\nα : Type u_1\nβ : Type ?u.134689\nγ : Type ?u.134692\ninst✝ : Group α\ns t : Set α\na b : α\n⊢ (fun x => x * b⁻¹) ⁻¹' 1 = {b}",
"tactic": "simp"
}
] | [
1250,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1250,
1
] |
Mathlib/Data/Quot.lean | Quotient.liftOn'_mk | [] | [
808,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
807,
11
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.domCongr_trans | [] | [
1768,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1765,
1
] |
Mathlib/Algebra/BigOperators/Finprod.lean | MonoidHom.map_finprod_of_preimage_one | [
{
"state_after": "case pos\nG : Type ?u.84392\nM : Type u_1\nN : Type u_2\nα : Sort u_3\nβ : Sort ?u.84404\nι : Sort ?u.84407\ninst✝¹ : CommMonoid M\ninst✝ : CommMonoid N\nf : M →* N\nhf : ∀ (x : M), ↑f x = 1 → x = 1\ng : α → M\nhg : Set.Finite (mulSupport (g ∘ PLift.down))\n⊢ ↑f (∏ᶠ (i : α), g i) = ∏ᶠ (i : α),... | [
318,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsBigO.prod_rightr | [] | [
972,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
970,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | tsum_unop | [] | [
1386,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1385,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearMap.smulRight_apply | [] | [
1172,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1170,
1
] |
Std/Data/Option/Lemmas.lean | Option.map_eq_map | [] | [
121,
65
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
121,
9
] |
Mathlib/Algebra/Star/Basic.lean | star_mul_star | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝¹ : Semigroup R\ninst✝ : StarSemigroup R\nx y : R\n⊢ star (x * star y) = y * star x",
"tactic": "rw [star_mul, star_star]"
}
] | [
146,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/Order/CompleteLattice.lean | iInf_iInf_eq_right | [] | [
1191,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1190,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.setToFun_smul | [
{
"state_after": "case pos\nα : Type u_4\nE : Type u_2\nF : Type u_3\nF' : Type ?u.1468982\nG : Type ?u.1468985\n𝕜 : Type u_1\np : ℝ≥0∞\ninst✝¹⁰ : NormedAddCommGroup E\ninst✝⁹ : NormedSpace ℝ E\ninst✝⁸ : NormedAddCommGroup F\ninst✝⁷ : NormedSpace ℝ F\ninst✝⁶ : NormedAddCommGroup F'\ninst✝⁵ : NormedSpace ℝ F'\n... | [
1421,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1412,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | Orthonormal.inner_left_sum | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.1958519\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nι : Type u_3\ndec_ι : DecidableEq ι\nv : ι → E\nhv : Orthonormal 𝕜 v\nl : ... | [
824,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
820,
1
] |
Std/Data/String/Lemmas.lean | String.utf8PrevAux_of_valid | [
{
"state_after": "no goals",
"state_before": "cs cs' : List Char\nc : Char\ni p : Nat\nhp : i + (utf8Len cs + csize c) = p\n⊢ utf8PrevAux (cs ++ c :: cs') { byteIdx := i } { byteIdx := p } = { byteIdx := i + utf8Len cs }",
"tactic": "match cs with\n| [] => simp [utf8PrevAux, ← hp, Pos.addChar_eq]\n| c':... | [
281,
39
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
272,
1
] |
Std/Data/RBMap/WF.lean | Std.RBNode.Ordered.balRight | [
{
"state_after": "α : Type u_1\ncmp : α → α → Ordering\nl : RBNode α\nv : α\nr : RBNode α\nlv : All (fun x => cmpLT cmp x v) l\nvr : All (fun x => cmpLT cmp v x) r\nhl : Ordered cmp l\nhr : Ordered cmp r\n⊢ Ordered cmp\n (match r with\n | node red b y c => node red l v (node black b y c)\n | r =>\n ... | [
284,
27
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
274,
11
] |
Std/Data/Int/Lemmas.lean | Int.ofNat_eq_coe | [] | [
17,
59
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
17,
9
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.im_imI | [] | [
808,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
808,
9
] |
Std/Data/Int/DivMod.lean | Int.ofNat_ediv | [] | [
25,
86
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
25,
20
] |
Mathlib/RingTheory/DedekindDomain/Ideal.lean | FractionalIdeal.inv_zero' | [] | [
77,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/Topology/Algebra/Order/MonotoneContinuity.lean | StrictMonoOn.continuousWithinAt_left_of_exists_between | [] | [
148,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Topology/ContinuousFunction/Compact.lean | ContinuousMap.apply_le_norm | [] | [
251,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
250,
1
] |
Mathlib/Topology/Basic.lean | isOpen_iUnion | [] | [
147,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/Data/Sum/Basic.lean | Sum.getLeft_inl | [] | [
99,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
99,
9
] |
Mathlib/ModelTheory/Semantics.lean | FirstOrder.Language.Theory.model_union_iff | [] | [
854,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
852,
1
] |
Mathlib/Analysis/Calculus/Inverse.lean | ContDiffAt.toLocalHomeomorph_coe | [] | [
761,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
758,
1
] |
Mathlib/CategoryTheory/Preadditive/AdditiveFunctor.lean | CategoryTheory.Functor.additive_of_preservesBinaryBiproducts | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\nD : Type u₂\ninst✝⁶ : Category C\ninst✝⁵ : Category D\ninst✝⁴ : Preadditive C\ninst✝³ : Preadditive D\nF : C ⥤ D\ninst✝² : HasBinaryBiproducts C\ninst✝¹ : PreservesZeroMorphisms F\ninst✝ : PreservesBinaryBiproducts F\nX Y : C\nf g : X ⟶ Y\n⊢ F.map (... | [
151,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/FieldTheory/PerfectClosure.lean | PerfectClosure.add_aux_left | [
{
"state_after": "K : Type u\ninst✝² : CommRing K\np : ℕ\ninst✝¹ : Fact (Nat.Prime p)\ninst✝ : CharP K p\nx1 x2 y : ℕ × K\nH : R K p x1 x2\nn : ℕ\nx : K\n⊢ R K p ((n, x).fst + y.fst, (↑(frobenius K p)^[y.fst]) (n, x).snd + (↑(frobenius K p)^[(n, x).fst]) y.snd)\n (Nat.succ (n + y.fst), ↑(frobenius K p) ((↑(f... | [
264,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
256,
9
] |
Mathlib/Data/Num/Lemmas.lean | Num.of_to_nat' | [] | [
365,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
363,
1
] |
Mathlib/Order/Atoms.lean | isAtom_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.1175\ninst✝¹ : Preorder α\ninst✝ : OrderBot α\na✝ b✝ x a b : α\n⊢ b < a → b = ⊥ ↔ b ≠ ⊥ → b ≤ a → a ≤ b",
"tactic": "simp only [Ne.def, @not_imp_comm (b = ⊥), not_imp, lt_iff_le_not_le]"
}
] | [
81,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.deleteEdges_empty_eq | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.243521\nV : Type u\nW : Type v\nG : SimpleGraph V\nG' : Subgraph G\ns : Set (Sym2 V)\n⊢ deleteEdges G' ∅ = G'",
"tactic": "ext <;> simp"
}
] | [
1054,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1053,
1
] |
Mathlib/Algebra/Support.lean | Function.mulSupport_one' | [] | [
132,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Mathlib/Data/Set/Finite.lean | Set.Finite.toFinset_compl | [
{
"state_after": "case a\nα : Type u\nβ : Type v\nι : Sort w\nγ : Type x\ns t : Set α\na : α\nhs✝ : Set.Finite s\nht : Set.Finite t\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nhs : Set.Finite s\nh : Set.Finite (sᶜ)\na✝ : α\n⊢ a✝ ∈ Finite.toFinset h ↔ a✝ ∈ Finite.toFinset hsᶜ",
"state_before": "α : Type u\nβ... | [
266,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
263,
11
] |
Mathlib/CategoryTheory/Elements.lean | CategoryTheory.CategoryOfElements.from_toCostructuredArrow_eq | [
{
"state_after": "case refine'_1\nC : Type u\ninst✝ : Category C\nF✝ : C ⥤ Type w\nF : Cᵒᵖ ⥤ Type v\n⊢ ∀ (X : Functor.Elements F),\n ((toCostructuredArrow F).rightOp ⋙ fromCostructuredArrow F).obj X = (𝟭 (Functor.Elements F)).obj X\n\ncase refine'_2\nC : Type u\ninst✝ : Category C\nF✝ : C ⥤ Type w\nF : Cᵒᵖ ... | [
236,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
1
] |
Mathlib/Analysis/Seminorm.lean | Seminorm.comp_id | [] | [
329,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
328,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.eventually_gt_atTop | [] | [
194,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Analysis/NormedSpace/lpSpace.lean | lp.norm_compl_sum_single | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nE : α → Type u_2\np q : ℝ≥0∞\ninst✝⁴ : (i : α) → NormedAddCommGroup (E i)\n𝕜 : Type ?u.956057\ninst✝³ : NormedRing 𝕜\ninst✝² : (i : α) → Module 𝕜 (E i)\ninst✝¹ : ∀ (i : α), BoundedSMul 𝕜 (E i)\ninst✝ : DecidableEq α\nhp : 0 < ENNReal.toReal p\n... | [
1077,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1075,
11
] |
Std/Data/Int/Lemmas.lean | Int.mul_zero | [
{
"state_after": "no goals",
"state_before": "a : Int\n⊢ a * 0 = 0",
"tactic": "cases a <;> rfl"
}
] | [
406,
79
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
406,
19
] |
Mathlib/LinearAlgebra/AffineSpace/Combination.lean | Finset.affineCombination_eq_weightedVSubOfPoint_vadd_of_sum_eq_one | [] | [
426,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
1
] |
Mathlib/RingTheory/UniqueFactorizationDomain.lean | Associates.count_self | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝² : CancelCommMonoidWithZero α\ndec_irr : (p : Associates α) → Decidable (Irreducible p)\ninst✝¹ : UniqueFactorizationMonoid α\ndec : DecidableEq α\ndec' : DecidableEq (Associates α)\ninst✝ : Nontrivial α\np : Associates α\nhp : Irreducible p\... | [
1719,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1718,
1
] |
Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean | Matrix.toLinearMap₂'_stdBasis | [] | [
229,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
226,
1
] |
Mathlib/Analysis/NormedSpace/Star/Multiplier.lean | DoubleCentralizer.add_snd | [] | [
261,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
260,
1
] |
Mathlib/CategoryTheory/Closed/Cartesian.lean | CategoryTheory.CartesianClosed.uncurry_curry | [] | [
205,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/MeasureTheory/Decomposition/Lebesgue.lean | MeasureTheory.SignedMeasure.not_haveLebesgueDecomposition_iff | [] | [
793,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
789,
1
] |
Mathlib/Algebra/Order/Floor.lean | Nat.floor_lt_one | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.20203\nα : Type u_1\nβ : Type ?u.20209\ninst✝¹ : LinearOrderedSemiring α\ninst✝ : FloorSemiring α\na : α\nn : ℕ\nha : 0 ≤ a\n⊢ a < ↑1 ↔ a < 1",
"tactic": "rw [Nat.cast_one]"
}
] | [
146,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/GroupTheory/Transfer.lean | MonoidHom.transfer_center_eq_pow | [
{
"state_after": "no goals",
"state_before": "G : Type u_1\ninst✝² : Group G\nH : Subgroup G\nA : Type ?u.848720\ninst✝¹ : CommGroup A\nϕ : { x // x ∈ H } →* A\nT : ↑(leftTransversals ↑H)\ninst✝ : FiniteIndex (center G)\ng : G\nk : ℕ\nx✝ : G\nhk : x✝⁻¹ * g ^ k * x✝ ∈ center G\n⊢ x✝⁻¹ * g ^ k * x✝ = g ^ k",
... | [
194,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/MeasureTheory/PiSystem.lean | le_generateFrom_piiUnionInter | [] | [
503,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
501,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.coe_mul | [] | [
704,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
703,
1
] |
Mathlib/Order/Atoms.lean | GaloisInsertion.isAtom_iff | [
{
"state_after": "α : Type u_1\nβ : Type u_2\ninst✝⁴ : PartialOrder α\ninst✝³ : PartialOrder β\ninst✝² : OrderBot α\ninst✝¹ : IsAtomic α\ninst✝ : OrderBot β\nl : α → β\nu : β → α\ngi : GaloisInsertion l u\nhbot : u ⊥ = ⊥\nh_atom : ∀ (a : α), IsAtom a → u (l a) = a\na : α\nhla : IsAtom (l a)\n⊢ IsAtom a",
"s... | [
736,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
723,
1
] |
Mathlib/LinearAlgebra/Contraction.lean | dualTensorHomEquivOfBasis_apply | [
{
"state_after": "case h\nι : Type w\nR : Type u\nM : Type v₁\nN : Type v₂\nP : Type v₃\nQ : Type v₄\ninst✝¹⁰ : CommRing R\ninst✝⁹ : AddCommGroup M\ninst✝⁸ : AddCommGroup N\ninst✝⁷ : AddCommGroup P\ninst✝⁶ : AddCommGroup Q\ninst✝⁵ : Module R M\ninst✝⁴ : Module R N\ninst✝³ : Module R P\ninst✝² : Module R Q\ninst... | [
183,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Mul.lean | DifferentiableWithinAt.clm_apply | [] | [
135,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
133,
1
] |
Mathlib/Data/Int/Bitwise.lean | Int.bit_coe_nat | [
{
"state_after": "b : Bool\nn : ℕ\n⊢ (2 * ↑n + bif b then 1 else 0) = ↑(2 * n + bif b then 1 else 0)",
"state_before": "b : Bool\nn : ℕ\n⊢ bit b ↑n = ↑(Nat.bit b n)",
"tactic": "rw [bit_val, Nat.bit_val]"
},
{
"state_after": "no goals",
"state_before": "b : Bool\nn : ℕ\n⊢ (2 * ↑n + bif b the... | [
157,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/Dynamics/Minimal.lean | denseRange_smul | [] | [
61,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/Data/Polynomial/Degree/TrailingDegree.lean | Polynomial.natTrailingDegree_le_of_ne_zero | [
{
"state_after": "R : Type u\nS : Type v\na b : R\nn m : ℕ\ninst✝ : Semiring R\np q r : R[X]\nh : coeff p n ≠ 0\nthis : ↑(natTrailingDegree p) = ↑(natTrailingDegree p)\n⊢ natTrailingDegree p ≤ n",
"state_before": "R : Type u\nS : Type v\na b : R\nn m : ℕ\ninst✝ : Semiring R\np q r : R[X]\nh : coeff p n ≠ 0\... | [
167,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Topology/Homeomorph.lean | Homeomorph.image_symm | [] | [
210,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/LinearAlgebra/StdBasis.lean | LinearMap.iSup_range_stdBasis_eq_iInf_ker_proj | [
{
"state_after": "R : Type u_3\nι : Type u_1\ninst✝³ : Semiring R\nφ : ι → Type u_2\ninst✝² : (i : ι) → AddCommMonoid (φ i)\ninst✝¹ : (i : ι) → Module R (φ i)\ninst✝ : DecidableEq ι\nI J : Set ι\nhd : Disjoint I J\nhu : Set.univ ⊆ I ∪ J\nhI : Set.Finite I\n⊢ (⨅ (i : ι) (_ : i ∈ J), ker (proj i)) ≤ ⨆ (i : ι) (_ ... | [
134,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/Algebra/Symmetrized.lean | SymAlg.unsym_mul | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝⁴ : Mul α\ninst✝³ : Add α\ninst✝² : One α\ninst✝¹ : OfNat α 2\ninst✝ : Invertible 2\na b : αˢʸᵐ\n⊢ ↑unsym (a * b) = ⅟2 * (↑unsym a * ↑unsym b + ↑unsym b * ↑unsym a)",
"tactic": "rfl"
}
] | [
208,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
207,
1
] |
Mathlib/LinearAlgebra/Orientation.lean | Basis.orientation_comp_linearEquiv_eq_neg_iff_det_neg | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\ninst✝⁴ : LinearOrderedCommRing R\nM : Type u_3\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\nι : Type u_1\ninst✝¹ : Fintype ι\ninst✝ : DecidableEq ι\ne : Basis ι R M\nf : M ≃ₗ[R] M\n⊢ Basis.orientation (Basis.map e f) = -Basis.orientation e ↔ ↑Lin... | [
260,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
257,
1
] |
Mathlib/CategoryTheory/Monoidal/Category.lean | CategoryTheory.MonoidalCategory.prodMonoidal_leftUnitor_inv_fst | [
{
"state_after": "case mk\nC : Type u\n𝒞 : Category C\ninst✝⁴ : MonoidalCategory C\nC₁ : Type u₁\ninst✝³ : Category C₁\ninst✝² : MonoidalCategory C₁\nC₂ : Type u₂\ninst✝¹ : Category C₂\ninst✝ : MonoidalCategory C₂\nfst✝ : C₁\nsnd✝ : C₂\n⊢ (λ_ (fst✝, snd✝)).inv.fst = (λ_ (fst✝, snd✝).fst).inv",
"state_befor... | [
642,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
639,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.zero_leftMoves | [] | [
336,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
335,
1
] |
Mathlib/LinearAlgebra/Matrix/Charpoly/LinearMap.lean | Matrix.isRepresentation.toEnd_represents | [] | [
184,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.support_neg | [
{
"state_after": "case ofFinsupp\nR : Type u\na b : R\nm n : ℕ\ninst✝ : Ring R\ntoFinsupp✝ : AddMonoidAlgebra R ℕ\n⊢ support (-{ toFinsupp := toFinsupp✝ }) = support { toFinsupp := toFinsupp✝ }",
"state_before": "R : Type u\na b : R\nm n : ℕ\ninst✝ : Ring R\np : R[X]\n⊢ support (-p) = support p",
"tacti... | [
1180,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1177,
1
] |
src/lean/Init/Prelude.lean | of_decide_eq_false | [] | [
863,
21
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
860,
1
] |
Mathlib/Data/LazyList/Basic.lean | LazyList.append_assoc | [
{
"state_after": "case nil\nα : Type u_1\nys zs : LazyList α\n⊢ append (append nil { fn := fun x => ys }) { fn := fun x => zs } =\n append nil { fn := fun x => append ys { fn := fun x => zs } }\n\ncase cons\nα : Type u_1\nxs ys zs : LazyList α\nhd✝ : α\ntl✝ : Thunk (LazyList α)\ntl_ih✝ : ?m.66098 tl✝\n⊢ appe... | [
178,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/Algebra/Group/Opposite.lean | MulOpposite.unop_natCast | [] | [
195,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | EMetric.infEdist_closure_pos_iff_not_mem_closure | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.18028\nα : Type u\nβ : Type v\ninst✝¹ : PseudoEMetricSpace α\ninst✝ : PseudoEMetricSpace β\nx✝ y : α\ns t : Set α\nΦ : α → β\nx : α\nE : Set α\n⊢ 0 < infEdist x (closure E) ↔ ¬x ∈ closure E",
"tactic": "rw [infEdist_closure, infEdist_pos_iff_not_... | [
174,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.