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/Algebra/Order/Group/Defs.lean | div_lt_div_left' | [] | [
954,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
953,
1
] |
Mathlib/Logic/Equiv/Set.lean | Equiv.preimage_piEquivPiSubtypeProd_symm_pi | [
{
"state_after": "case h.mk\nα✝ : Sort u\nβ✝ : Sort v\nγ : Sort w\nα : Type u_1\nβ : α → Type u_2\np : α → Prop\ninst✝ : DecidablePred p\ns : (i : α) → Set (β i)\nf : (i : { x // p x }) → β ↑i\ng : (i : { x // ¬p x }) → β ↑i\n⊢ (f, g) ∈ ↑(piEquivPiSubtypeProd p β).symm ⁻¹' pi univ s ↔ (f, g) ∈ (pi univ fun i =>... | [
668,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
657,
1
] |
Mathlib/Algebra/Order/AbsoluteValue.lean | IsAbsoluteValue.sub_abv_le_abv_sub | [] | [
404,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
403,
1
] |
Mathlib/Analysis/Calculus/MeanValue.lean | Convex.norm_image_sub_le_of_norm_hasFDerivWithin_le' | [
{
"state_after": "E : Type u_1\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace ℝ E\nF : Type ?u.207397\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace ℝ F\n𝕜 : Type u_2\nG : Type u_3\ninst✝³ : IsROrC 𝕜\ninst✝² : NormedSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace 𝕜 G\nf g✝ : E → G\... | [
570,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
557,
1
] |
Mathlib/Topology/Filter.lean | Filter.mem_nhds_iff' | [] | [
113,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
111,
1
] |
Mathlib/Data/Fintype/Pi.lean | Fintype.mem_piFinset | [
{
"state_after": "case mp\nα : Type u_2\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nδ : α → Type u_1\nt : (a : α) → Finset (δ a)\nf : (a : α) → δ a\n⊢ f ∈ piFinset t → ∀ (a : α), f a ∈ t a\n\ncase mpr\nα : Type u_2\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nδ : α → Type u_1\nt : (a : α) → Finset (δ a)\nf : (a ... | [
45,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Mathlib/Topology/Order/Basic.lean | Set.PairwiseDisjoint.countable_of_Ioo | [] | [
1444,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1439,
1
] |
Mathlib/Algebra/Field/Basic.lean | one_div_mul_add_mul_one_div_eq_one_div_add_one_div | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.4001\nK : Type ?u.4004\ninst✝ : DivisionSemiring α\na b c d : α\nha : a ≠ 0\nhb : b ≠ 0\n⊢ 1 / a * (a + b) * (1 / b) = 1 / a + 1 / b",
"tactic": "rw [mul_add, one_div_mul_cancel ha, add_mul, one_mul, mul_assoc, mul_one_div_cancel hb... | [
57,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
1
] |
Mathlib/Algebra/BigOperators/Pi.lean | Finset.prod_fn | [] | [
55,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Logic/Embedding/Basic.lean | Function.Embedding.equiv_toEmbedding_trans_symm_toEmbedding | [
{
"state_after": "case h\nα : Sort u_1\nβ : Sort u_2\ne : α ≃ β\nx✝ : α\n⊢ ↑(Embedding.trans (Equiv.toEmbedding e) (Equiv.toEmbedding e.symm)) x✝ = ↑(Embedding.refl α) x✝",
"state_before": "α : Sort u_1\nβ : Sort u_2\ne : α ≃ β\n⊢ Embedding.trans (Equiv.toEmbedding e) (Equiv.toEmbedding e.symm) = Embedding.... | [
153,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Analysis/Normed/MulAction.lean | edist_smul₀ | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\ninst✝³ : NormedDivisionRing α\ninst✝² : SeminormedAddCommGroup β\ninst✝¹ : Module α β\ninst✝ : BoundedSMul α β\ns : α\nx y : β\n⊢ edist (s • x) (s • y) = ‖s‖₊ • edist x y",
"tactic": "simp only [edist_nndist, nndist_smul₀, ENNReal... | [
123,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/Order/Heyting/Basic.lean | sdiff_inf_self_right | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.139011\nα : Type u_1\nβ : Type ?u.139017\ninst✝ : GeneralizedCoheytingAlgebra α\na✝ b✝ c d a b : α\n⊢ b \\ (a ⊓ b) = b \\ a",
"tactic": "rw [sdiff_inf, sdiff_self, sup_bot_eq]"
}
] | [
689,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
688,
1
] |
Mathlib/Algebra/Order/Ring/Lemmas.lean | MulPosMono.toMulPosStrictMono | [] | [
996,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
994,
1
] |
Mathlib/Topology/Constructions.lean | isOpenMap_inr | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type ?u.120234\nδ : Type ?u.120237\nε : Type ?u.120240\nζ : Type ?u.120243\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\nu : Set β\nhu : IsOpen u\n⊢ IsOpen (inr '' ... | [
906,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
905,
1
] |
Mathlib/Data/List/Nodup.lean | List.Nodup.get_inj_iff | [] | [
118,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
116,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.chain'_adj_support | [] | [
653,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
651,
1
] |
Mathlib/ModelTheory/Definability.lean | FirstOrder.Language.DefinableSet.coe_bot | [] | [
349,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
348,
1
] |
Mathlib/CategoryTheory/Closed/Cartesian.lean | CategoryTheory.CartesianClosed.curry_uncurry | [] | [
210,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/Algebra/Order/Ring/Abs.lean | abs_two | [] | [
33,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
32,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.iUnion_finset | [] | [
150,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
11
] |
Mathlib/Data/Real/CauSeq.lean | CauSeq.sup_eq_left | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedField α\na b : CauSeq α abs\nh : b ≤ a\n⊢ a ⊔ b ≈ a",
"tactic": "simpa only [CauSeq.sup_comm] using CauSeq.sup_eq_right h"
}
] | [
944,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
943,
11
] |
Mathlib/Data/Real/CauSeqCompletion.lean | CauSeq.Completion.mk_sub | [] | [
111,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/Data/Nat/Count.lean | Nat.count_monotone | [
{
"state_after": "no goals",
"state_before": "p : ℕ → Prop\ninst✝ : DecidablePred p\nn : ℕ\n⊢ count p n ≤ count p (n + 1)",
"tactic": "by_cases h : p n <;> simp [count_succ, h]"
}
] | [
74,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/FieldTheory/IntermediateField.lean | IntermediateField.coe_pow | [] | [
276,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
275,
11
] |
Mathlib/Data/Pi/Algebra.lean | Function.extend_div | [
{
"state_after": "no goals",
"state_before": "I : Type u\nα : Type u_3\nβ : Type u_2\nγ : Type u_1\nf✝ : I → Type v₁\ng : I → Type v₂\nh : I → Type v₃\nx y : (i : I) → f✝ i\ni : I\ninst✝ : Div γ\nf : α → β\ng₁ g₂ : α → γ\ne₁ e₂ : β → γ\n⊢ extend f (g₁ / g₂) (e₁ / e₂) = extend f g₁ e₁ / extend f g₂ e₂",
... | [
400,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
396,
1
] |
Mathlib/Logic/Function/Iterate.lean | Function.Semiconj.iterate_left | [
{
"state_after": "case zero\nα : Type u\nβ : Type v\nf : α → α\ng : ℕ → α → α\nH : ∀ (n : ℕ), Semiconj f (g n) (g (n + 1))\nk✝ k : ℕ\n⊢ Semiconj (f^[Nat.zero]) (g k) (g (Nat.zero + k))\n\ncase succ\nα : Type u\nβ : Type v\nf : α → α\ng : ℕ → α → α\nH : ∀ (n : ℕ), Semiconj f (g n) (g (n + 1))\nk✝ n : ℕ\nihn : ∀ ... | [
118,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
1
] |
Mathlib/Topology/Order/Basic.lean | frontier_Ici | [] | [
2332,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2331,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.sub_imI | [] | [
930,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
930,
9
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.le_neg_iff | [
{
"state_after": "no goals",
"state_before": "x y : PGame\n⊢ y ≤ -x ↔ x ≤ -y",
"tactic": "rw [← neg_neg x, neg_le_neg_iff, neg_neg]"
}
] | [
1362,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1362,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Real.dist_le_of_mem_pi_Icc | [
{
"state_after": "case refine'_1\nα : Type u\nβ : Type v\nX : Type ?u.429067\nι : Type ?u.429070\ninst✝² : PseudoMetricSpace α\nπ : β → Type ?u.429078\ninst✝¹ : Fintype β\ninst✝ : (b : β) → PseudoMetricSpace (π b)\nx y x' y' : β → ℝ\nhx : x ∈ Set.Icc x' y'\nhy : y ∈ Set.Icc x' y'\nb : β\n⊢ x b ∈ Set.Icc (x' b) ... | [
2095,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2091,
1
] |
Mathlib/Algebra/Quandle.lean | Rack.envelAction_prop | [] | [
808,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
806,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.nat_eq_lift_iff | [
{
"state_after": "no goals",
"state_before": "α β : Type u\nn : ℕ\na : Cardinal\n⊢ ↑n = lift a ↔ ↑n = a",
"tactic": "rw [← lift_natCast.{v,u} n, lift_inj]"
}
] | [
1293,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1291,
1
] |
Mathlib/MeasureTheory/MeasurableSpace.lean | MeasurableEmbedding.of_measurable_inverse_on_range | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.879714\nδ : Type ?u.879717\nδ' : Type ?u.879720\nι : Sort uι\ns t u : Set α\ninst✝² : MeasurableSpace α\ninst✝¹ : MeasurableSpace β\ninst✝ : MeasurableSpace γ\nf : α → β\ng✝ : β → α\ng : ↑(range f) → α\nhf₁ : Measurable f\nhf₂ : MeasurableSet (range f)\n... | [
1568,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1562,
1
] |
Mathlib/RingTheory/HahnSeries.lean | HahnSeries.embDomainRingHom_C | [
{
"state_after": "no goals",
"state_before": "Γ : Type u_2\nR : Type u_1\ninst✝² : OrderedCancelAddCommMonoid Γ\nΓ' : Type u_3\ninst✝¹ : OrderedCancelAddCommMonoid Γ'\ninst✝ : NonAssocSemiring R\nf : Γ →+ Γ'\nhfi : Injective ↑f\nhf : ∀ (g g' : Γ), ↑f g ≤ ↑f g' ↔ g ≤ g'\nr : R\n⊢ ↑(single (↑{ toEmbedding := ... | [
1065,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1063,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | one_div_le_one_div_of_neg_of_le | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.177416\nα : Type u_1\nβ : Type ?u.177422\ninst✝ : LinearOrderedField α\na b c d : α\nn : ℤ\nhb : b < 0\nh : a ≤ b\n⊢ 1 / b ≤ 1 / a",
"tactic": "rwa [div_le_iff_of_neg' hb, ← div_eq_mul_one_div, div_le_one_of_neg (h.trans_lt hb)]"
}
] | [
867,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
866,
1
] |
Std/Data/String/Lemmas.lean | String.Pos.addChar_right_comm | [
{
"state_after": "case h\np : Pos\nc₁ c₂ : Char\n⊢ (p + c₁ + c₂).byteIdx = (p + c₂ + c₁).byteIdx",
"state_before": "p : Pos\nc₁ c₂ : Char\n⊢ p + c₁ + c₂ = p + c₂ + c₁",
"tactic": "apply ext"
},
{
"state_after": "case h\np : Pos\nc₁ c₂ : Char\n⊢ p.byteIdx + csize c₁ + csize c₂ = p.byteIdx + csize... | [
117,
27
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
114,
1
] |
Mathlib/Topology/Order.lean | eq_bot_of_singletons_open | [] | [
315,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/Init/Logic.lean | and_comm' | [] | [
127,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
24
] |
Mathlib/SetTheory/ZFC/Basic.lean | Class.coe_subset | [] | [
1633,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1632,
1
] |
Mathlib/Analysis/Complex/PhragmenLindelof.lean | PhragmenLindelof.right_half_plane_of_bounded_on_real | [
{
"state_after": "E : Type u_1\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℂ E\na b C : ℝ\nf g : ℂ → E\nz : ℂ\nhd : DiffContOnCl ℂ f {z | 0 < z.re}\nhexp : ∃ c, c < 2 ∧ ∃ B, f =O[comap (↑Complex.abs) atTop ⊓ 𝓟 {z | 0 < z.re}] fun z => expR (B * ↑Complex.abs z ^ c)\nhre : IsBoundedUnder (fun x x_1 => x ... | [
794,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
763,
1
] |
Mathlib/Data/PNat/Basic.lean | PNat.le_one_iff | [] | [
249,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
248,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | AffineMap.lineMap_rev_mem_affineSpan_pair | [] | [
1319,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1317,
1
] |
Mathlib/RingTheory/Multiplicity.lean | multiplicity.not_dvd_one_of_finite_one_right | [] | [
65,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/Topology/Algebra/Ring/Basic.lean | Subring.isClosed_topologicalClosure | [] | [
259,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
258,
1
] |
Mathlib/Analysis/Convex/Basic.lean | convex_segment | [
{
"state_after": "case intro.intro.intro.intro.intro.intro.intro.intro.intro.intro\n𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.24926\nβ : Type ?u.24929\ninst✝⁴ : OrderedSemiring 𝕜\ninst✝³ : AddCommMonoid E\ninst✝² : AddCommMonoid F\ninst✝¹ : Module 𝕜 E\ninst✝ : Module 𝕜 F\ns : Set E\nx✝ x y : E\nap bp : 𝕜\nha... | [
185,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
178,
1
] |
src/lean/Init/Core.lean | Quotient.ind | [] | [
1356,
11
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
1355,
11
] |
Mathlib/CategoryTheory/Limits/Shapes/WideEqualizers.lean | CategoryTheory.Limits.Trident.ι_ofι | [] | [
266,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
264,
1
] |
Mathlib/Data/List/Sort.lean | List.mergeSort_eq_self | [] | [
454,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
453,
1
] |
Mathlib/LinearAlgebra/QuadraticForm/Basic.lean | QuadraticForm.not_anisotropic_iff_exists | [
{
"state_after": "no goals",
"state_before": "S : Type ?u.477083\nR : Type u_1\nR₁ : Type ?u.477089\nM : Type u_2\ninst✝² : Semiring R\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\nQ : QuadraticForm R M\n⊢ ¬Anisotropic Q ↔ ∃ x, x ≠ 0 ∧ ↑Q x = 0",
"tactic": "simp only [Anisotropic, not_forall, exists_pr... | [
889,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
887,
1
] |
Mathlib/Data/IsROrC/Basic.lean | IsROrC.reLm_coe | [] | [
878,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
877,
1
] |
Mathlib/Topology/ContinuousFunction/Weierstrass.lean | exists_polynomial_near_continuousMap | [
{
"state_after": "a b : ℝ\nf : C(↑(Set.Icc a b), ℝ)\nε : ℝ\npos : 0 < ε\nw : ∃ᶠ (x : C(↑(Set.Icc a b), ℝ)) in nhds f, x ∈ ↑(polynomialFunctions (Set.Icc a b))\n⊢ ∃ p, ‖Polynomial.toContinuousMapOn p (Set.Icc a b) - f‖ < ε",
"state_before": "a b : ℝ\nf : C(↑(Set.Icc a b), ℝ)\nε : ℝ\npos : 0 < ε\n⊢ ∃ p, ‖Poly... | [
112,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
106,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean | Real.Angle.angle_eq_iff_two_pi_dvd_sub | [
{
"state_after": "ψ θ : ℝ\n⊢ ↑ψ = ↑θ ↔ ∃ k, θ - ψ = 2 * π * ↑k",
"state_before": "ψ θ : ℝ\n⊢ ↑θ = ↑ψ ↔ ∃ k, θ - ψ = 2 * π * ↑k",
"tactic": "simp only [QuotientAddGroup.eq, AddSubgroup.zmultiples_eq_closure,\n AddSubgroup.mem_closure_singleton, zsmul_eq_mul', (sub_eq_neg_add _ _).symm, eq_comm]"
},
... | [
125,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | tendsto_norm_nhdsWithin_one | [] | [
2033,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2032,
1
] |
Mathlib/Analysis/NormedSpace/OperatorNorm.lean | ContinuousLinearMap.exists_mul_lt_apply_of_lt_op_nnnorm | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\n𝕜₂ : Type u_2\n𝕜₃ : Type ?u.738492\nE : Type u_3\nEₗ : Type ?u.738498\nF : Type u_4\nFₗ : Type ?u.738504\nG : Type ?u.738507\nGₗ : Type ?u.738510\n𝓕 : Type ?u.738513\ninst✝¹⁶ : SeminormedAddCommGroup E\ninst✝¹⁵ : SeminormedAddCommGroup Eₗ\ninst... | [
510,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
506,
1
] |
Mathlib/Algebra/Star/Module.lean | IsSelfAdjoint.coe_selfAdjointPart_apply | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nA : Type u_1\ninst✝⁷ : Semiring R\ninst✝⁶ : StarSemigroup R\ninst✝⁵ : TrivialStar R\ninst✝⁴ : AddCommGroup A\ninst✝³ : Module R A\ninst✝² : StarAddMonoid A\ninst✝¹ : StarModule R A\ninst✝ : Invertible 2\nx : A\nhx : IsSelfAdjoint x\n⊢ ↑(↑(selfAdjoi... | [
143,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/FieldTheory/IntermediateField.lean | IntermediateField.inv_mem | [] | [
197,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
11
] |
Mathlib/Data/List/Basic.lean | List.get?_zero_scanl | [
{
"state_after": "case nil\nι : Type ?u.239850\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nf : β → α → β\nb : β\na : α\n⊢ get? (scanl f b []) 0 = some b\n\ncase cons\nι : Type ?u.239850\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nf : β → α → β\nb : β\na head✝ : α\ntail✝... | [
2619,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2616,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | HasStrictFDerivAt.cosh | [] | [
1057,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1055,
1
] |
Mathlib/Dynamics/FixedPoints/Basic.lean | Function.IsFixedPt.apply | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nf fa g : α → α\nx✝ y : α\nfb : β → β\nm n k : ℕ\ne : Perm α\nx : α\nhx : IsFixedPt f x\n⊢ IsFixedPt f (f x)",
"tactic": "convert hx"
}
] | [
95,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
11
] |
Mathlib/Data/Fin/Basic.lean | Fin.val_last | [] | [
526,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
525,
1
] |
Mathlib/SetTheory/ZFC/Basic.lean | PSet.equiv_empty | [] | [
420,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
419,
11
] |
Mathlib/Algebra/Order/UpperLower.lean | LowerSet.coe_div | [] | [
224,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | LinearMap.toMatrixAlgEquiv'_symm | [] | [
452,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
450,
1
] |
Mathlib/Order/LiminfLimsup.lean | Filter.mono_bliminf' | [] | [
874,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
873,
1
] |
Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean | MeasureTheory.ProbabilityMeasure.testAgainstNN_lipschitz | [] | [
216,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Data/List/Rotate.lean | List.get_eq_get_rotate | [
{
"state_after": "α : Type u\nl : List α\nn : ℕ\nk : Fin (length l)\n⊢ get l k =\n get l\n {\n val :=\n (↑{ val := (length l - n % length l + ↑k) % length l,\n isLt := (_ : (length l - n % length l + ↑k) % length l < length (rotate l n)) } +\n n) %\n ... | [
298,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
291,
1
] |
Mathlib/Computability/TMToPartrec.lean | Turing.PartrecToTM2.K'.elim_main | [] | [
1270,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1270,
1
] |
Mathlib/Algebra/Lie/Basic.lean | LieModuleEquiv.symm_trans_self | [] | [
1108,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1107,
1
] |
Mathlib/Topology/Algebra/Group/Basic.lean | tendsto_div_nhds_one_iff | [
{
"state_after": "no goals",
"state_before": "α✝ : Type u\nβ : Type v\nG : Type w\nH : Type x\ninst✝² : Group G\ninst✝¹ : TopologicalSpace G\ninst✝ : TopologicalGroup G\nα : Type u_1\nl : Filter α\nx : G\nu : α → G\nA : Tendsto (fun x_1 => x) l (𝓝 x)\nh : Tendsto (fun n => u n / x) l (𝓝 1)\n⊢ Tendsto u l ... | [
1199,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1196,
1
] |
Mathlib/NumberTheory/Padics/Hensel.lean | a_is_soln | [
{
"state_after": "no goals",
"state_before": "p : ℕ\ninst✝ : Fact (Nat.Prime p)\nF : Polynomial ℤ_[p]\na : ℤ_[p]\nhnorm : ‖Polynomial.eval a F‖ < ‖Polynomial.eval a (↑Polynomial.derivative F)‖ ^ 2\nha : Polynomial.eval a F = 0\n⊢ ‖a - a‖ < ‖Polynomial.eval a (↑Polynomial.derivative F)‖",
"tactic": "simp... | [
494,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
489,
9
] |
Mathlib/Data/Matrix/Notation.lean | Matrix.cons_vecMul | [
{
"state_after": "case h\nα : Type u\no n m : ℕ\nm' : Type uₘ\nn' : Type uₙ\no' : Type uₒ\na b : ℕ\ninst✝ : Semiring α\nx : α\nv : Fin n → α\nB : Fin (Nat.succ n) → o' → α\ni : o'\n⊢ vecMul (vecCons x v) (↑of B) i = (x • vecHead B + vecMul v (↑of (vecTail B))) i",
"state_before": "α : Type u\no n m : ℕ\nm' ... | [
279,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/Order/SuccPred/Basic.lean | Order.succ_le_succ_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝² : Preorder α\ninst✝¹ : SuccOrder α\na b : α\ninst✝ : NoMaxOrder α\n⊢ succ a ≤ succ b ↔ a ≤ b",
"tactic": "simp"
}
] | [
345,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
345,
1
] |
Mathlib/Algebra/Squarefree.lean | irreducible_sq_not_dvd_iff_eq_zero_and_no_irreducibles_or_squarefree | [
{
"state_after": "R : Type u_1\ninst✝¹ : CommMonoidWithZero R\ninst✝ : WfDvdMonoid R\nr : R\n⊢ (r = 0 ∧ ∀ (x : R), ¬Irreducible x) ∨ Squarefree r ↔ ∀ (x : R), Irreducible x → ¬x * x ∣ r",
"state_before": "R : Type u_1\ninst✝¹ : CommMonoidWithZero R\ninst✝ : WfDvdMonoid R\nr : R\n⊢ (∀ (x : R), Irreducible x ... | [
171,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/CategoryTheory/Adjunction/Mates.lean | CategoryTheory.transferNatTransSelf_adjunction_id_symm | [
{
"state_after": "C : Type u₁\nD : Type u₂\ninst✝¹ : Category C\ninst✝ : Category D\nL₁ L₂ L₃ : C ⥤ D\nR₁ R₂ R₃ : D ⥤ C\nadj₁ : L₁ ⊣ R₁\nadj₂ : L₂ ⊣ R₂\nadj₃ : L₃ ⊣ R₃\nL R : C ⥤ C\nadj : L ⊣ R\ng : R ⟶ 𝟭 C\nX : C\n⊢ 𝟙 X ≫ ((adj.unit.app X ≫ 𝟙 (R.obj (L.obj X)) ≫ g.app (L.obj X) ≫ 𝟙 (L.obj X)) ≫ 𝟙 (L.obj X... | [
217,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Data/List/Basic.lean | List.zipLeft'_cons_cons | [] | [
4060,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
4056,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.not_eventually | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.161458\nι : Sort x\np : α → Prop\nf : Filter α\n⊢ (¬∀ᶠ (x : α) in f, p x) ↔ ∃ᶠ (x : α) in f, ¬p x",
"tactic": "simp [Filter.Frequently]"
}
] | [
1317,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1316,
1
] |
Mathlib/Data/Sum/Basic.lean | Function.Surjective.sum_map | [] | [
579,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
572,
1
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | SemilinearIsometryClass.isometry | [] | [
87,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
11
] |
Mathlib/Data/Set/Pointwise/Interval.lean | Set.preimage_mul_const_Ici | [] | [
531,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
529,
1
] |
Mathlib/Topology/FiberBundle/Basic.lean | FiberBundle.totalSpaceMk_inducing | [] | [
202,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
Mathlib/Topology/Compactification/OnePoint.lean | OnePoint.nhdsWithin_coe | [] | [
297,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/RingTheory/WittVector/WittPolynomial.lean | wittPolynomial_one | [
{
"state_after": "no goals",
"state_before": "p : ℕ\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : DecidableEq R\nS : Type ?u.105241\ninst✝ : CommRing S\n⊢ W_ R 1 = ↑C ↑p * X 1 + X 0 ^ p",
"tactic": "simp only [wittPolynomial_eq_sum_c_mul_x_pow, sum_range_succ_comm, range_one, sum_singleton,\n one_mul, p... | [
149,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | differentiable_add_const_iff | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type u_3\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type ?u.222279\ninst✝³ : NormedAddCommGroup G\ninst✝² : Normed... | [
236,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
234,
1
] |
Mathlib/AlgebraicTopology/SimplexCategory.lean | SimplexCategory.Hom.ext' | [] | [
116,
5
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/MeasureTheory/Measure/Haar/OfBasis.lean | parallelepiped_orthonormalBasis_one_dim | [
{
"state_after": "ι : Type u_1\nι' : Type ?u.44123\nE : Type ?u.44126\nF : Type ?u.44129\ninst✝⁵ : Fintype ι\ninst✝⁴ : Fintype ι'\ninst✝³ : AddCommGroup E\ninst✝² : Module ℝ E\ninst✝¹ : AddCommGroup F\ninst✝ : Module ℝ F\nb : OrthonormalBasis ι ℝ ℝ\ne : ι ≃ Fin 1\n⊢ parallelepiped ↑b = Icc 0 1 ∨ parallelepiped ... | [
115,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalSubsemiring.mem_carrier | [] | [
120,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/CategoryTheory/Abelian/InjectiveResolution.lean | CategoryTheory.InjectiveResolution.descFOne_zero_comm | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝¹ : Category C\ninst✝ : Abelian C\nY Z : C\nf : Z ⟶ Y\nI : InjectiveResolution Y\nJ : InjectiveResolution Z\n⊢ HomologicalComplex.d J.cocomplex 0 1 ≫ descFOne f I J = descFZero f I J ≫ HomologicalComplex.d I.cocomplex 0 1",
"tactic": "simp [... | [
79,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/Topology/ContinuousOn.lean | nhdsWithin_le_of_mem | [] | [
202,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/RingTheory/Localization/Basic.lean | IsLocalization.nonZeroDivisors_le_comap | [
{
"state_after": "R : Type u_1\ninst✝⁴ : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst✝³ : CommSemiring S\ninst✝² : Algebra R S\nP : Type ?u.2732028\ninst✝¹ : CommSemiring P\ninst✝ : IsLocalization M S\na : R\nha : a ∈ nonZeroDivisors R\nb : S\ne : b * ↑(algebraMap R S) a = 0\n⊢ b = 0",
"state_before"... | [
834,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
825,
1
] |
Mathlib/AlgebraicTopology/SimplicialObject.lean | CategoryTheory.CosimplicialObject.δ_comp_σ_succ | [
{
"state_after": "C : Type u\ninst✝ : Category C\nX : CosimplicialObject C\nn : ℕ\ni : Fin (n + 1)\n⊢ X.map (SimplexCategory.δ (Fin.succ i)) ≫ X.map (SimplexCategory.σ i) = 𝟙 (X.obj [n])",
"state_before": "C : Type u\ninst✝ : Category C\nX : CosimplicialObject C\nn : ℕ\ni : Fin (n + 1)\n⊢ δ X (Fin.succ i) ... | [
545,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
543,
1
] |
Mathlib/Algebra/Free.lean | FreeMagma.length_toFreeSemigroup | [
{
"state_after": "α : Type u\nβ : Type v\nx✝ x y : FreeMagma α\nhx : FreeSemigroup.length (↑toFreeSemigroup x) = length x\nhy : FreeSemigroup.length (↑toFreeSemigroup y) = length y\n⊢ length x + length y = length (x * y)",
"state_before": "α : Type u\nβ : Type v\nx✝ x y : FreeMagma α\nhx : FreeSemigroup.len... | [
744,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
742,
1
] |
Mathlib/Order/Filter/Pointwise.lean | Filter.mem_smul | [] | [
965,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
964,
1
] |
Mathlib/Analysis/Calculus/Deriv/Slope.lean | HasDerivWithinAt.liminf_right_slope_le | [] | [
111,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.degree_eq_bot | [] | [
116,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | Measurable.nnreal_tsum | [
{
"state_after": "α : Type u_2\nβ : Type ?u.2930312\nγ : Type ?u.2930315\nγ₂ : Type ?u.2930318\nδ : Type ?u.2930321\nι✝ : Sort y\ns t u : Set α\ninst✝¹ : MeasurableSpace α\nι : Type u_1\ninst✝ : Countable ι\nf : ι → α → ℝ≥0\nh : ∀ (i : ι), Measurable (f i)\n⊢ Measurable fun x => ENNReal.toNNReal (∑' (b : ι), ↑(... | [
1946,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1943,
1
] |
Mathlib/Order/Monotone/Basic.lean | List.foldr_monotone | [] | [
726,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
725,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.spanExt_hom_app_zero | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nX Y Z X' Y' Z' : C\niX : X ≅ X'\niY : Y ≅ Y'\niZ : Z ≅ Z'\nf : X ⟶ Y\ng : X ⟶ Z\nf' : X' ⟶ Y'\ng' : X' ⟶ Z'\nwf : iX.hom ≫ f' = f ≫ iY.hom\nwg : iX.hom ≫ g' = g ≫ iZ.hom\n⊢ (spanExt iX iY iZ wf wg... | [
486,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
485,
1
] |
Mathlib/Logic/Basic.lean | apply_dite₂ | [
{
"state_after": "no goals",
"state_before": "α : Sort u_2\nβ : Sort u_3\nσ : α → Sort ?u.38655\nf✝ : α → β\nP✝ Q : Prop\ninst✝² : Decidable P✝\ninst✝¹ : Decidable Q\na✝ b✝ c✝ : α\nA : P✝ → α\nB : ¬P✝ → α\nγ : Sort u_1\nf : α → β → γ\nP : Prop\ninst✝ : Decidable P\na : P → α\nb : ¬P → α\nc : P → β\nd : ¬P →... | [
1227,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1224,
1
] |
Mathlib/Data/List/Nodup.lean | List.Nodup.map_update | [
{
"state_after": "case nil\nα : Type u\nβ : Type v\nl✝ l₁ l₂ : List α\nr : α → α → Prop\na b : α\ninst✝ : DecidableEq α\nl : List α\nhl✝ : Nodup l\nf : α → β\nx : α\ny : β\nhl : Nodup []\n⊢ map (update f x y) [] = if x ∈ [] then set (map f []) (indexOf x []) y else map f []\n\ncase cons\nα : Type u\nβ : Type v\... | [
423,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
414,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean | CategoryTheory.Limits.Fork.hom_comp_ι | [
{
"state_after": "case mk\nC : Type u\ninst✝ : Category C\nX Y : C\nf✝ g : X ⟶ Y\nt : Fork f✝ g\npt✝ : C\nπ✝ : (Functor.const WalkingParallelPair).obj pt✝ ⟶ parallelPair f✝ g\nf : { pt := pt✝, π := π✝ } ⟶ t\n⊢ f.Hom ≫ ι t = ι { pt := pt✝, π := π✝ }",
"state_before": "C : Type u\ninst✝ : Category C\nX Y : C\... | [
715,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
714,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.