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/RingTheory/Adjoin/FG.lean | Subalgebra.induction_on_adjoin | [
{
"state_after": "case intro\nR : Type u\nA : Type v\nB : Type w\ninst✝⁵ : CommSemiring R\ninst✝⁴ : Semiring A\ninst✝³ : Algebra R A\ninst✝² : Semiring B\ninst✝¹ : Algebra R B\ninst✝ : IsNoetherian R A\nP : Subalgebra R A → Prop\nbase : P ⊥\nih : ∀ (S : Subalgebra R A) (x : A), P S → P (Algebra.adjoin R (insert... | [
183,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.iUnion_union | [] | [
544,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
543,
1
] |
Mathlib/Data/List/AList.lean | AList.lookup_union_eq_some | [] | [
475,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
473,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.ae_dirac_iff | [] | [
3011,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3009,
1
] |
Mathlib/Topology/MetricSpace/ThickenedIndicator.lean | thickenedIndicatorAux_closure_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : PseudoEMetricSpace α\nδ : ℝ\nE : Set α\n⊢ thickenedIndicatorAux δ (closure E) = thickenedIndicatorAux δ E",
"tactic": "simp_rw [thickenedIndicatorAux, infEdist_closure]"
}
] | [
84,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/Data/Nat/ModEq.lean | Nat.ModEq.comm | [] | [
74,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
11
] |
Mathlib/GroupTheory/Subgroup/Pointwise.lean | AddSubgroup.coe_pointwise_smul | [] | [
461,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
460,
1
] |
Mathlib/Topology/UniformSpace/UniformEmbedding.lean | comap_uniformity_of_spaced_out | [
{
"state_after": "α✝ : Type u\nβ : Type v\nγ : Type w\ninst✝² : UniformSpace α✝\ninst✝¹ : UniformSpace β\ninst✝ : UniformSpace γ\nα : Type u_1\nf : α → β\ns : Set (β × β)\nhs : s ∈ 𝓤 β\nhf : Pairwise fun x y => ¬(f x, f y) ∈ s\n⊢ comap (Prod.map f f) (𝓤 β) ≤ 𝓟 idRel",
"state_before": "α✝ : Type u\nβ : Ty... | [
216,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalSubsemiring.mem_map | [
{
"state_after": "case h.e'_2.h.e'_2.h.a\nR : Type u\nS : Type v\nT : Type w\ninst✝⁴ : NonUnitalNonAssocSemiring R\nM : Subsemigroup R\ninst✝³ : NonUnitalNonAssocSemiring S\ninst✝² : NonUnitalNonAssocSemiring T\nF : Type u_1\nG : Type ?u.101174\ninst✝¹ : NonUnitalRingHomClass F R S\ninst✝ : NonUnitalRingHomClas... | [
306,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
304,
1
] |
Mathlib/Data/Matrix/DMatrix.lean | DMatrix.map_zero | [
{
"state_after": "case a\nl : Type ?u.18435\nm : Type u_1\nn : Type u_2\no : Type ?u.18444\ninst✝⁵ : Fintype l\ninst✝⁴ : Fintype m\ninst✝³ : Fintype n\ninst✝² : Fintype o\nα : m → n → Type v\ninst✝¹ : (i : m) → (j : n) → Zero (α i j)\nβ : m → n → Type w\ninst✝ : (i : m) → (j : n) → Zero (β i j)\nf : ⦃i : m⦄ → ⦃... | [
147,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.neg_ofLists | [
{
"state_after": "L R : List PGame\n⊢ (HEq (fun j => -List.nthLe R ↑j.down (_ : ↑j.down < List.length R)) fun i =>\n -List.nthLe R ↑i.down (_ : ↑i.down < List.length R)) ∧\n HEq (fun i => -List.nthLe L ↑i.down (_ : ↑i.down < List.length L)) fun j =>\n -List.nthLe L ↑j.down (_ : ↑j.down < List.lengt... | [
1223,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1205,
1
] |
Mathlib/Data/List/Sublists.lean | List.sublists_cons_perm_append | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\na : α\nl : List α\n⊢ sublists' l ++ map (cons a) (sublists' l) ~ sublists l ++ map (cons a) (sublists l)",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\na : α\nl : List α\n⊢ sublists' (a :: l) ~ sublists l ++ map (cons a) (sublists l)",
"tacti... | [
427,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
1
] |
Mathlib/Algebra/Star/StarAlgHom.lean | StarAlgEquiv.rightInverse_symm | [] | [
921,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
920,
1
] |
Mathlib/Topology/Order/Basic.lean | eventually_abs_sub_lt | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² : TopologicalSpace α\ninst✝¹ : LinearOrderedAddCommGroup α\ninst✝ : OrderTopology α\nl : Filter β\nf g : β → α\na ε : α\nhε : 0 < ε\n⊢ {x | (fun x => abs (x - a) < ε) x} ∈ 𝓟 {b | abs (a - b) < ε}",
"tactic": "simp ... | [
1874,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1872,
1
] |
Mathlib/Analysis/LocallyConvex/WithSeminorms.lean | WithSeminorms.hasBasis_zero_ball | [
{
"state_after": "𝕜 : Type u_1\n𝕜₂ : Type ?u.185021\n𝕝 : Type ?u.185024\n𝕝₂ : Type ?u.185027\nE : Type u_2\nF : Type ?u.185033\nG : Type ?u.185036\nι : Type u_3\nι' : Type ?u.185042\ninst✝⁴ : NormedField 𝕜\ninst✝³ : AddCommGroup E\ninst✝² : Module 𝕜 E\ninst✝¹ : Nonempty ι\ninst✝ : TopologicalSpace E\np : ... | [
306,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
297,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.subset_smul | [] | [
1424,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1422,
1
] |
Mathlib/SetTheory/ZFC/Basic.lean | ZFSet.mem_insert | [] | [
904,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
903,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.mem_attach | [] | [
2412,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2411,
1
] |
Mathlib/Computability/Partrec.lean | Nat.rfindOpt_dom | [
{
"state_after": "α : Type u_1\nf : ℕ → Option α\nh : ∃ n a, a ∈ f n\nh' : ∃ n, Option.isSome (f n) = true\n⊢ (rfindOpt f).Dom",
"state_before": "α : Type u_1\nf : ℕ → Option α\nh : ∃ n a, a ∈ f n\n⊢ (rfindOpt f).Dom",
"tactic": "have h' : ∃ n, (f n).isSome := h.imp fun n => Option.isSome_iff_exists.2"
... | [
146,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
136,
1
] |
Mathlib/Combinatorics/SimpleGraph/Density.lean | Rel.mul_edgeDensity_le_edgeDensity | [
{
"state_after": "𝕜 : Type ?u.28107\nι : Type ?u.28110\nκ : Type ?u.28113\nα : Type u_1\nβ : Type u_2\ninst✝¹ : LinearOrderedField 𝕜\nr : α → β → Prop\ninst✝ : (a : α) → DecidablePred (r a)\ns s₁ s₂ : Finset α\nt t₁ t₂ : Finset β\na : α\nb : β\nδ : 𝕜\nhs : s₂ ⊆ s₁\nht : t₂ ⊆ t₁\nhs₂ : Finset.Nonempty s₂\nht₂... | [
192,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
186,
1
] |
Mathlib/Algebra/Module/Torsion.lean | Submodule.annihilator_top_inter_nonZeroDivisors | [
{
"state_after": "case intro\nR : Type u_1\nM : Type u_2\ninst✝³ : CommSemiring R\ninst✝² : AddCommMonoid M\ninst✝¹ : Module R M\ninst✝ : Module.Finite R M\nhM : Module.IsTorsion R M\nS : Finset M\nhS : span R ↑S = ⊤\n⊢ ↑(annihilator ⊤) ∩ ↑R⁰ ≠ ∅",
"state_before": "R : Type u_1\nM : Type u_2\ninst✝³ : CommS... | [
689,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
681,
1
] |
Mathlib/Order/Minimal.lean | eq_of_mem_maximals | [] | [
89,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snorm_sum_le | [] | [
1221,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1216,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.tendsto_pure_pure | [] | [
3057,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3056,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.castHom_injective | [
{
"state_after": "n : ℕ\nR : Type u_1\ninst✝¹ : Ring R\ninst✝ : CharP R n\n⊢ ∀ (a : ZMod n), ↑(castHom (_ : n ∣ n) R) a = 0 → a = 0",
"state_before": "n : ℕ\nR : Type u_1\ninst✝¹ : Ring R\ninst✝ : CharP R n\n⊢ Injective ↑(castHom (_ : n ∣ n) R)",
"tactic": "rw [injective_iff_map_eq_zero]"
},
{
"... | [
414,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
409,
1
] |
Mathlib/Analysis/NormedSpace/Multilinear.lean | ContinuousLinearEquiv.compContinuousMultilinearMapL_apply | [] | [
1013,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1010,
1
] |
Mathlib/Analysis/Analytic/Basic.lean | FormalMultilinearSeries.not_summable_norm_of_radius_lt_nnnorm | [] | [
281,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
Mathlib/Algebra/Ring/Equiv.lean | RingEquiv.toRingHom_refl | [] | [
734,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
733,
1
] |
Mathlib/Data/Int/Cast/Lemmas.lean | Int.castRingHom_int | [] | [
345,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
344,
1
] |
Mathlib/LinearAlgebra/Alternating.lean | AlternatingMap.sub_apply | [] | [
394,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
393,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.natDegree_neg | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\na b c d : R\nn m : ℕ\ninst✝ : Ring R\np : R[X]\n⊢ natDegree (-p) = natDegree p",
"tactic": "simp [natDegree]"
}
] | [
541,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
541,
1
] |
Mathlib/Order/Bounds/Basic.lean | union_upperBounds_subset_upperBounds_inter | [] | [
374,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
371,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | UniformContinuousOn.tendstoUniformlyOn | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nι : Type x\ninst✝² : UniformSpace β\nF✝ : ι → α → β\nf : α → β\ns s' : Set α\nx✝ : α\np : Filter ι\np' : Filter α\ng : ι → α\ninst✝¹ : UniformSpace α\ninst✝ : UniformSpace γ\nx : α\nU : Set α\nV : Set β\nF : α → β → γ\nhF : UniformContinuousOn (↿F) (U ×ˢ V)\... | [
384,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
373,
1
] |
Mathlib/Data/Fin/Tuple/Basic.lean | Fin.preimage_insertNth_Icc_of_not_mem | [
{
"state_after": "no goals",
"state_before": "m n : ℕ\nα : Fin (n + 1) → Type u\nβ : Type v\ninst✝ : (i : Fin (n + 1)) → Preorder (α i)\ni : Fin (n + 1)\nx : α i\nq₁ q₂ : (j : Fin (n + 1)) → α j\nhx : ¬x ∈ Icc (q₁ i) (q₂ i)\np : (j : Fin n) → α (↑(succAbove i) j)\n⊢ p ∈ insertNth i x ⁻¹' Icc q₁ q₂ ↔ p ∈ ∅",... | [
830,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
827,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.add_apply | [] | [
795,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
793,
1
] |
Mathlib/GroupTheory/FreeProduct.lean | FreeProduct.lift_word_ping_pong | [
{
"state_after": "case singleton\nι : Type u_1\nM : ι → Type ?u.671928\ninst✝⁴ : (i : ι) → Monoid (M i)\nN : Type ?u.671939\ninst✝³ : Monoid N\nhnontriv : Nontrivial ι\nG : Type u_4\ninst✝² : Group G\nH : ι → Type u_2\ninst✝¹ : (i : ι) → Group (H i)\nf : (i : ι) → H i →* G\nhcard : 3 ≤ (#ι) ∨ ∃ i, 3 ≤ (#H i)\nα... | [
735,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
727,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | NormedCommGroup.uniformity_basis_dist | [
{
"state_after": "case h.e'_5\n𝓕 : Type ?u.138811\n𝕜 : Type ?u.138814\nα : Type ?u.138817\nι : Type ?u.138820\nκ : Type ?u.138823\nE : Type u_1\nF : Type ?u.138829\nG : Type ?u.138832\ninst✝² : SeminormedGroup E\ninst✝¹ : SeminormedGroup F\ninst✝ : SeminormedGroup G\ns : Set E\na a₁ a₂ b b₁ b₂ : E\nr r₁ r₂ : ... | [
782,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
779,
1
] |
Mathlib/Analysis/Convex/Basic.lean | Convex.sub | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.247569\nβ : Type ?u.247572\ninst✝⁴ : OrderedRing 𝕜\ninst✝³ : AddCommGroup E\ninst✝² : AddCommGroup F\ninst✝¹ : Module 𝕜 E\ninst✝ : Module 𝕜 F\ns t : Set E\nhs : Convex 𝕜 s\nht : Convex 𝕜 t\n⊢ Convex 𝕜 (s + -t)",
"state_before": "𝕜 : Type u_1\... | [
513,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
511,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.list_getD | [
{
"state_after": "α : Type u_1\nβ : Type ?u.308289\nγ : Type ?u.308292\nσ : Type ?u.308295\ninst✝³ : Primcodable α\ninst✝² : Primcodable β\ninst✝¹ : Primcodable γ\ninst✝ : Primcodable σ\nd : α\n⊢ Primrec₂ fun l n => Option.getD (List.get? l n) d",
"state_before": "α : Type u_1\nβ : Type ?u.308289\nγ : Type ... | [
1093,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1091,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.eventually_imp_distrib_left | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.144553\nι : Sort x\nf : Filter α\np : Prop\nq : α → Prop\n⊢ (∀ᶠ (x : α) in f, p → q x) ↔ p → ∀ᶠ (x : α) in f, q x",
"tactic": "simp only [imp_iff_not_or, eventually_or_distrib_left]"
}
] | [
1199,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1197,
1
] |
Mathlib/LinearAlgebra/ProjectiveSpace/Subspace.lean | Projectivization.Subspace.subset_span | [] | [
93,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Reflexive.lean | CategoryTheory.IsKernelPair.isReflexivePair | [] | [
111,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.lift_injective | [] | [
347,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
346,
1
] |
Mathlib/Data/List/Nodup.lean | List.nodup_reverse | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nl✝ l₁ l₂ : List α\nr : α → α → Prop\na b : α\nl : List α\n⊢ Pairwise (fun a b => b ≠ a) l ↔ Nodup l",
"tactic": "simp only [Nodup, Ne.def, eq_comm]"
}
] | [
300,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
299,
1
] |
Mathlib/Algebra/Support.lean | Function.mulSupport_along_fiber_subset | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nA : Type ?u.17516\nB : Type ?u.17519\nM : Type u_3\nN : Type ?u.17525\nP : Type ?u.17528\nR : Type ?u.17531\nS : Type ?u.17534\nG : Type ?u.17537\nM₀ : Type ?u.17540\nG₀ : Type ?u.17543\nι : Sort ?u.17546\ninst✝² : One M\ninst✝¹ : One... | [
245,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/LinearAlgebra/Basis.lean | Basis.span_eq | [] | [
575,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
574,
11
] |
Mathlib/Logic/Unique.lean | Unique.forall_iff | [
{
"state_after": "no goals",
"state_before": "α : Sort u_1\ninst✝ : Unique α\np : α → Prop\nh : p default\nx : α\n⊢ p x",
"tactic": "rwa [Unique.eq_default x]"
}
] | [
158,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/Probability/CondCount.lean | ProbabilityTheory.condCount_compl | [
{
"state_after": "no goals",
"state_before": "Ω : Type u_1\ninst✝¹ : MeasurableSpace Ω\ninst✝ : MeasurableSingletonClass Ω\ns t✝ u t : Set Ω\nhs : Set.Finite s\nhs' : Set.Nonempty s\n⊢ ↑↑(condCount s) t + ↑↑(condCount s) (tᶜ) = 1",
"tactic": "rw [← condCount_union hs disjoint_compl_right, Set.union_comp... | [
169,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
166,
1
] |
Mathlib/Probability/ProbabilityMassFunction/Basic.lean | Pmf.toOuterMeasure_mono | [] | [
222,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
220,
1
] |
Mathlib/Data/List/Lattice.lean | List.mem_of_mem_inter_left | [] | [
156,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/Topology/Algebra/Order/LeftRightLim.lean | Antitone.rightLim | [] | [
324,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
11
] |
Mathlib/Data/Set/Pairwise/Basic.lean | Set.InjOn.pairwiseDisjoint_image | [] | [
300,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
298,
1
] |
Mathlib/Data/Finset/Fold.lean | Finset.fold_max_le | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.68583\nop : β → β → β\nhc : IsCommutative β op\nha : IsAssociative β op\nf : α → β\nb : β\ns : Finset α\na : α\ninst✝ : LinearOrder β\nc : β\n⊢ c ≥ fold max b f s ↔ b ≤ c ∧ ∀ (x : α), x ∈ s → f x ≤ c",
"state_before": "α : Type u_2\nβ : Type u_1\nγ :... | [
247,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
242,
1
] |
Mathlib/LinearAlgebra/Matrix/Orthogonal.lean | Matrix.HasOrthogonalCols.hasOrthogonalRows | [] | [
81,
4
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Submonoid.LocalizationMap.lift_eq_iff | [
{
"state_after": "no goals",
"state_before": "M : Type u_1\ninst✝² : CommMonoid M\nS : Submonoid M\nN : Type u_3\ninst✝¹ : CommMonoid N\nP : Type u_2\ninst✝ : CommMonoid P\nf : LocalizationMap S N\ng : M →* P\nhg : ∀ (y : { x // x ∈ S }), IsUnit (↑g ↑y)\nx y : M × { x // x ∈ S }\n⊢ ↑(lift f hg) (mk' f x.fst... | [
1018,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1016,
1
] |
Mathlib/Data/Part.lean | Part.pure_eq_some | [] | [
603,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
602,
1
] |
Mathlib/Analysis/Convex/Hull.lean | convexHull_nonempty_iff | [
{
"state_after": "𝕜 : Type u_2\nE : Type u_1\nF : Type ?u.18161\ninst✝⁴ : OrderedSemiring 𝕜\ninst✝³ : AddCommMonoid E\ninst✝² : AddCommMonoid F\ninst✝¹ : Module 𝕜 E\ninst✝ : Module 𝕜 F\ns t : Set E\nx y : E\n⊢ ¬↑(convexHull 𝕜).toOrderHom s = ∅ ↔ ¬s = ∅",
"state_before": "𝕜 : Type u_2\nE : Type u_1\nF ... | [
115,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Mathlib/RingTheory/IntegralClosure.lean | isIntegral_of_surjective | [] | [
1033,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1031,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsLittleO.prod_left | [] | [
1028,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1025,
1
] |
Mathlib/Order/WellFoundedSet.lean | Set.IsWf.isPwo | [
{
"state_after": "ι : Type ?u.108989\nα : Type u_1\nβ : Type ?u.108995\ninst✝ : LinearOrder α\ns : Set α\nhs : IsWf s\nf : ℕ → α\nhf : ∀ (n : ℕ), f n ∈ s\n⊢ ∃ m n, m < n ∧ (fun x x_1 => x ≤ x_1) (f m) (f n)",
"state_before": "ι : Type ?u.108989\nα : Type u_1\nβ : Type ?u.108995\ninst✝ : LinearOrder α\ns : S... | [
526,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
521,
11
] |
Mathlib/Data/List/Rotate.lean | List.rotate_length | [
{
"state_after": "no goals",
"state_before": "α : Type u\nl : List α\n⊢ rotate l (length l) = l",
"tactic": "rw [rotate_eq_rotate', rotate'_length]"
}
] | [
168,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.norm_mul_le | [
{
"state_after": "no goals",
"state_before": "α : Type u\nL L₁ L₂ L₃ L₄ : List (α × Bool)\ninst✝ : DecidableEq α\nx y : FreeGroup α\n⊢ norm (x * y) = norm (mk (toWord x ++ toWord y))",
"tactic": "rw [← mul_mk, mk_toWord, mk_toWord]"
}
] | [
1438,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1434,
1
] |
Mathlib/Algebra/CharP/Algebra.lean | charZero_of_injective_algebraMap | [
{
"state_after": "R : Type u_1\nA : Type u_2\ninst✝³ : CommSemiring R\ninst✝² : Semiring A\ninst✝¹ : Algebra R A\nh : Function.Injective ↑(algebraMap R A)\ninst✝ : CharZero R\nx y : ℕ\nhxy : ↑(algebraMap ℕ A) x = ↑(algebraMap ℕ A) y\n⊢ x = y",
"state_before": "R : Type u_1\nA : Type u_2\ninst✝³ : CommSemiri... | [
59,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Analysis/Convex/Between.lean | AffineEquiv.sbtw_map_iff | [
{
"state_after": "R : Type u_1\nV : Type u_4\nV' : Type u_5\nP : Type u_2\nP' : Type u_3\ninst✝⁶ : OrderedRing R\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P'\nx y z : P\nf : P ≃ᵃ[R] P'\n⊢ Function.Injective ↑↑f",
... | [
183,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/Analysis/Convex/Basic.lean | AntitoneOn.convex_gt | [] | [
377,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
375,
1
] |
Mathlib/Topology/UnitInterval.lean | unitInterval.mem_iff_one_sub_mem | [
{
"state_after": "t : ℝ\n⊢ 0 ≤ t ∧ t ≤ 1 ↔ 0 ≤ 1 - t ∧ 1 - t ≤ 1",
"state_before": "t : ℝ\n⊢ t ∈ I ↔ 1 - t ∈ I",
"tactic": "rw [mem_Icc, mem_Icc]"
},
{
"state_after": "no goals",
"state_before": "t : ℝ\n⊢ 0 ≤ t ∧ t ≤ 1 ↔ 0 ≤ 1 - t ∧ 1 - t ≤ 1",
"tactic": "constructor <;> intro <;> constr... | [
68,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineMap.lean | AffineMap.fst_lineMap | [] | [
614,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
613,
1
] |
Mathlib/Analysis/Convex/Star.lean | StarConvex.openSegment_subset | [] | [
91,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.pow_mem_pow | [
{
"state_after": "F : Type ?u.259960\nα : Type u_1\nβ : Type ?u.259966\nγ : Type ?u.259969\ninst✝² : DecidableEq α\ninst✝¹ : DecidableEq β\ninst✝ : Monoid α\ns t : Finset α\na : α\nm n : ℕ\nha : a ∈ s\n⊢ 1 ∈ s ^ 0",
"state_before": "F : Type ?u.259960\nα : Type u_1\nβ : Type ?u.259966\nγ : Type ?u.259969\ni... | [
883,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
877,
1
] |
Std/Data/RBMap/Alter.lean | Std.RBNode.WF.modify | [] | [
403,
65
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
400,
1
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | intervalIntegral.integral_smul_measure | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.13831725\n𝕜 : Type ?u.13831728\nE : Type u_1\nF : Type ?u.13831734\nA : Type ?u.13831737\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\ninst✝ : NormedSpace ℝ E\na b : ℝ\nf g : ℝ → E\nμ : MeasureTheory.Measure ℝ\nc : ℝ≥0∞\n⊢ (∫ (x : ℝ) in ... | [
647,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
645,
8
] |
Mathlib/Data/Set/NAry.lean | Set.image2_inter_subset_right | [
{
"state_after": "case intro.intro.intro.intro.intro\nα : Type u_2\nα' : Type ?u.22358\nβ : Type u_3\nβ' : Type ?u.22364\nγ : Type u_1\nγ' : Type ?u.22370\nδ : Type ?u.22373\nδ' : Type ?u.22376\nε : Type ?u.22379\nε' : Type ?u.22382\nζ : Type ?u.22385\nζ' : Type ?u.22388\nν : Type ?u.22391\nf f' : α → β → γ\ng ... | [
187,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
185,
1
] |
Mathlib/Analysis/Calculus/Deriv/Add.lean | derivWithin_sub_const | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u\ninst✝⁴ : NontriviallyNormedField 𝕜\nF : Type v\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nE : Type w\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace 𝕜 E\nf f₀ f₁ g : 𝕜 → F\nf' f₀' f₁' g' : F\nx : 𝕜\ns t : Set 𝕜\nL : Filter �... | [
343,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
341,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Module.lean | ContinuousLinearEquiv.tsum_eq_iff | [
{
"state_after": "case pos\nι : Type u_5\nR : Type u_3\nR₂ : Type u_4\nM : Type u_1\nM₂ : Type u_2\ninst✝¹¹ : Semiring R\ninst✝¹⁰ : Semiring R₂\ninst✝⁹ : AddCommMonoid M\ninst✝⁸ : Module R M\ninst✝⁷ : AddCommMonoid M₂\ninst✝⁶ : Module R₂ M₂\ninst✝⁵ : TopologicalSpace M\ninst✝⁴ : TopologicalSpace M₂\nσ : R →+* R... | [
99,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.not_prime_mul' | [
{
"state_after": "a b n : ℕ\nh : a * b = n\nh₁ : 1 < a\nh₂ : 1 < b\n⊢ ¬Prime (a * b)",
"state_before": "a b n : ℕ\nh : a * b = n\nh₁ : 1 < a\nh₂ : 1 < b\n⊢ ¬Prime n",
"tactic": "rw [← h]"
},
{
"state_after": "no goals",
"state_before": "a b n : ℕ\nh : a * b = n\nh₁ : 1 < a\nh₂ : 1 < b\n⊢ ¬Pr... | [
226,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/Analysis/Calculus/IteratedDeriv.lean | iteratedDerivWithin_zero | [
{
"state_after": "case h\n𝕜 : Type u_1\ninst✝⁴ : NontriviallyNormedField 𝕜\nF : Type u_2\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nE : Type ?u.31201\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace 𝕜 E\nn : ℕ\nf : 𝕜 → F\ns : Set 𝕜\nx✝ x : 𝕜\n⊢ iteratedDerivWithin 0 f s x = f x",
"s... | [
120,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Mathlib/Topology/LocalHomeomorph.lean | LocalHomeomorph.continuousAt | [] | [
354,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
353,
11
] |
Mathlib/Order/Filter/Basic.lean | Filter.lawfulMonad | [] | [
2028,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2019,
11
] |
Mathlib/RingTheory/Artinian.lean | IsArtinian.surjective_of_injective_endomorphism | [
{
"state_after": "case intro.intro\nR : Type u_1\nM : Type u_2\ninst✝³ : Ring R\ninst✝² : AddCommGroup M\ninst✝¹ : Module R M\ninst✝ : IsArtinian R M\nf : M →ₗ[R] M\ns : Injective ↑f\nn : ℕ\nne : n ≠ 0\nw : LinearMap.ker (f ^ n) ⊔ LinearMap.range (f ^ n) = ⊤\n⊢ Surjective ↑f",
"state_before": "R : Type u_1\... | [
247,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/Data/Nat/ModEq.lean | Nat.add_div_of_dvd_left | [
{
"state_after": "no goals",
"state_before": "m n a✝ b✝ c✝ d a b c : ℕ\nhca : c ∣ b\n⊢ (a + b) / c = a / c + b / c",
"tactic": "rwa [add_comm, Nat.add_div_of_dvd_right, add_comm]"
}
] | [
477,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
476,
11
] |
Mathlib/CategoryTheory/Limits/Preserves/Shapes/Zero.lean | CategoryTheory.Functor.map_zero | [] | [
56,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
11
] |
Mathlib/LinearAlgebra/Finsupp.lean | Finsupp.disjoint_lsingle_lsingle | [
{
"state_after": "case refine'_1\nα : Type u_1\nM : Type u_2\nN : Type ?u.38530\nP : Type ?u.38533\nR : Type u_3\nS : Type ?u.38539\ninst✝⁷ : Semiring R\ninst✝⁶ : Semiring S\ninst✝⁵ : AddCommMonoid M\ninst✝⁴ : Module R M\ninst✝³ : AddCommMonoid N\ninst✝² : Module R N\ninst✝¹ : AddCommMonoid P\ninst✝ : Module R ... | [
175,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/Algebra/Algebra/Basic.lean | algebraMap_smul | [] | [
873,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
872,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.one_lt_inv | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.270867\nβ : Type ?u.270870\na b c d : ℝ≥0∞\nr p q : ℝ≥0\n⊢ 1 < a⁻¹ ↔ a < 1",
"tactic": "rw [lt_inv_iff_lt_inv, inv_one]"
}
] | [
1520,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1520,
11
] |
Mathlib/Order/Filter/Germ.lean | Filter.Germ.coe_tendsto | [] | [
227,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
226,
1
] |
Mathlib/Data/Set/Pairwise/Basic.lean | Set.pairwise_insert_of_symmetric | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.11504\nγ : Type ?u.11507\nι : Type ?u.11510\nι' : Type ?u.11513\nr p q : α → α → Prop\nf g : ι → α\ns t u : Set α\na b : α\nhr : Symmetric r\n⊢ Set.Pairwise (insert a s) r ↔ Set.Pairwise s r ∧ ∀ (b : α), b ∈ s → a ≠ b → r a b",
"tac... | [
178,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
1
] |
Mathlib/NumberTheory/ArithmeticFunction.lean | Nat.ArithmeticFunction.zeta_apply_ne | [] | [
457,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
456,
1
] |
Mathlib/Order/SuccPred/IntervalSucc.lean | Monotone.pairwise_disjoint_on_Ico_succ | [] | [
68,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/Order/CompleteLattice.lean | Antitone.le_map_iInf | [] | [
943,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
941,
1
] |
Mathlib/Data/Finset/NatAntidiagonal.lean | Finset.Nat.antidiagonal_congr | [
{
"state_after": "n : ℕ\np q : ℕ × ℕ\nhp : p ∈ antidiagonal n\nhq : q ∈ antidiagonal n\nh : p.fst = q.fst\n⊢ q.fst + p.snd = q.fst + q.snd",
"state_before": "n : ℕ\np q : ℕ × ℕ\nhp : p ∈ antidiagonal n\nhq : q ∈ antidiagonal n\n⊢ p = q ↔ p.fst = q.fst",
"tactic": "refine' ⟨congr_arg Prod.fst, fun h ↦ Pr... | [
98,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/Order/RelClasses.lean | WellFoundedLT.fix_eq | [] | [
425,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
1
] |
Mathlib/Analysis/Normed/Field/Basic.lean | nnnorm_one | [] | [
146,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/Order/SuccPred/Limit.lean | Order.IsPredLimit.lt_pred_iff | [] | [
364,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
363,
1
] |
Mathlib/Data/Set/Pointwise/SMul.lean | Set.smul_set_inter | [] | [
931,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
930,
1
] |
Mathlib/Algebra/Order/Floor.lean | round_zero | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.249523\nα : Type u_1\nβ : Type ?u.249529\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\n⊢ round 0 = 0",
"tactic": "simp [round]"
}
] | [
1339,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1339,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.aleph'_alephIdx | [] | [
188,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Data/List/Infix.lean | List.dropLast_sublist | [] | [
179,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
178,
1
] |
Mathlib/Algebra/BigOperators/Finprod.lean | finprod_false | [] | [
213,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | norm_nonneg' | [
{
"state_after": "𝓕 : Type ?u.69547\n𝕜 : Type ?u.69550\nα : Type ?u.69553\nι : Type ?u.69556\nκ : Type ?u.69559\nE : Type u_1\nF : Type ?u.69565\nG : Type ?u.69568\ninst✝² : SeminormedGroup E\ninst✝¹ : SeminormedGroup F\ninst✝ : SeminormedGroup G\ns : Set E\na✝ a₁ a₂ b b₁ b₂ : E\nr r₁ r₂ : ℝ\na : E\n⊢ 0 ≤ dis... | [
489,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
487,
1
] |
Mathlib/Order/Hom/Lattice.lean | SupBotHom.comp_apply | [] | [
799,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
798,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.