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/CharP/Basic.lean | CharP.exists | [
{
"state_after": "R : Type u_1\ninst✝ : NonAssocSemiring R\nthis : DecidableEq R := Classical.decEq R\nH : ∀ (p : ℕ), ↑p = 0 → p = 0\nx : ℕ\n⊢ ↑x = 0 ↔ x = 0",
"state_before": "R : Type u_1\ninst✝ : NonAssocSemiring R\nthis : DecidableEq R := Classical.decEq R\nH : ∀ (p : ℕ), ↑p = 0 → p = 0\nx : ℕ\n⊢ ↑x = 0... | [
188,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.set_lintegral_univ | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.925545\nγ : Type ?u.925548\nδ : Type ?u.925551\nm : MeasurableSpace α\nμ ν : Measure α\nf : α → ℝ≥0∞\n⊢ (∫⁻ (x : α) in univ, f x ∂μ) = ∫⁻ (x : α), f x ∂μ",
"tactic": "rw [Measure.restrict_univ]"
}
] | [
654,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
653,
1
] |
Mathlib/Deprecated/Subring.lean | Ring.InClosure.recOn | [
{
"state_after": "R : Type u\ninst✝¹ : Ring R\ncR : Type u\ninst✝ : CommRing cR\ns : Set R\nC : R → Prop\nx : R\nhx : x ∈ closure s\nh1 : C 1\nhneg1 : C (-1)\nhs : ∀ (z : R), z ∈ s → ∀ (n : R), C n → C (z * n)\nha : ∀ {x y : R}, C x → C y → C (x + y)\nh0 : C 0\n⊢ C x",
"state_before": "R : Type u\ninst✝¹ : ... | [
168,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
11
] |
Mathlib/Topology/MetricSpace/EMetricSpace.lean | uniformity_basis_edist_le' | [] | [
234,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/Dynamics/PeriodicPts.lean | Function.mem_periodicPts | [] | [
231,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | FiniteDimensional.eq_top_of_finrank_eq | [
{
"state_after": "K : Type u\nV : Type v\ninst✝⁵ : DivisionRing K\ninst✝⁴ : AddCommGroup V\ninst✝³ : Module K V\nV₂ : Type v'\ninst✝² : AddCommGroup V₂\ninst✝¹ : Module K V₂\ninst✝ : FiniteDimensional K V\nS : Submodule K V\nh : finrank K { x // x ∈ S } = finrank K V\nthis : IsNoetherian K V\n⊢ S = ⊤",
"sta... | [
376,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
352,
1
] |
Mathlib/Data/Polynomial/AlgebraMap.lean | Polynomial.aeval_fn_apply | [] | [
311,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
309,
1
] |
Mathlib/Data/Multiset/Fold.lean | Multiset.fold_cons_left | [] | [
64,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Algebra/Group/ULift.lean | ULift.down_intCast | [] | [
170,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
1
] |
Mathlib/Analysis/LocallyConvex/BalancedCoreHull.lean | balancedCore_subset | [] | [
77,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Std/Data/Option/Init/Lemmas.lean | Option.getD_none | [] | [
16,
51
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
16,
9
] |
Mathlib/RingTheory/Ideal/Basic.lean | Ideal.isMaximal_iff | [
{
"state_after": "α : Type u\nβ : Type v\ninst✝ : Semiring α\nI✝ : Ideal α\na b : α\nI J : Ideal α\n⊢ I ≤ J ∧ ¬J ≤ I → J = ⊤ ↔ ∀ (x : α), I ≤ J → ¬x ∈ I → x ∈ J → 1 ∈ J",
"state_before": "α : Type u\nβ : Type v\ninst✝ : Semiring α\nI✝ : Ideal α\na b : α\nI J : Ideal α\n⊢ I < J → J = ⊤ ↔ ∀ (x : α), I ≤ J → ¬... | [
313,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
303,
1
] |
Mathlib/FieldTheory/IntermediateField.lean | IntermediateField.coe_smul | [] | [
384,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
382,
1
] |
Mathlib/FieldTheory/Subfield.lean | Subfield.sInf_toSubring | [
{
"state_after": "case h\nK : Type u\nL : Type v\nM : Type w\ninst✝² : Field K\ninst✝¹ : Field L\ninst✝ : Field M\ns : Set (Subfield K)\nx : K\n⊢ x ∈ (sInf s).toSubring ↔ x ∈ ⨅ (t : Subfield K) (_ : t ∈ s), t.toSubring",
"state_before": "K : Type u\nL : Type v\nM : Type w\ninst✝² : Field K\ninst✝¹ : Field L... | [
641,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
630,
1
] |
Mathlib/Data/Finset/Card.lean | Finset.eq_of_superset_of_card_ge | [] | [
271,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Mathlib/RingTheory/Valuation/Basic.lean | AddValuation.map_inv | [] | [
786,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
785,
1
] |
Mathlib/Topology/MetricSpace/Completion.lean | UniformSpace.Completion.uniformity_dist | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝ : PseudoMetricSpace α\n⊢ 𝓤 (Completion α) = ⨅ (ε : ℝ) (_ : ε > 0), 𝓟 {p | dist p.fst p.snd < ε}",
"tactic": "simpa [iInf_subtype] using @Completion.uniformity_dist' α _"
}
] | [
168,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
11
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineIsometry.edist_map | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_5\nV : Type u_2\nV₁ : Type ?u.50158\nV₂ : Type u_3\nV₃ : Type ?u.50164\nV₄ : Type ?u.50167\nP₁ : Type ?u.50170\nP : Type u_4\nP₂ : Type u_1\nP₃ : Type ?u.50179\nP₄ : Type ?u.50182\ninst✝²⁰ : NormedField 𝕜\ninst✝¹⁹ : SeminormedAddCommGroup V\ninst✝¹⁸... | [
156,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/Data/Set/Prod.lean | Set.mk_preimage_prod_left | [
{
"state_after": "case h\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.25613\nδ : Type ?u.25616\ns s₁ s₂ : Set α\nt t₁ t₂ : Set β\na✝ : α\nb : β\nhb : b ∈ t\na : α\n⊢ a ∈ (fun a => (a, b)) ⁻¹' s ×ˢ t ↔ a ∈ s",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.25613\nδ : Type ?u.25616\ns s₁ s₂ : Set α\nt t... | [
227,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | ContDiffOn.inv | [] | [
1706,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1705,
1
] |
Mathlib/Analysis/NormedSpace/lpSpace.lean | lp.sum_rpow_le_norm_rpow | [
{
"state_after": "α : Type u_1\nE : α → Type u_2\np q : ℝ≥0∞\ninst✝ : (i : α) → NormedAddCommGroup (E i)\nhp : 0 < ENNReal.toReal p\nf : { x // x ∈ lp E p }\ns : Finset α\n⊢ ∑ i in s, ‖↑f i‖ ^ ENNReal.toReal p ≤ ∑' (i : α), ‖↑f i‖ ^ ENNReal.toReal p",
"state_before": "α : Type u_1\nE : α → Type u_2\np q : ℝ... | [
573,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
568,
1
] |
Mathlib/Data/Finset/Fold.lean | Finset.fold_hom | [
{
"state_after": "α : Type u_2\nβ : Type u_3\nγ : Type u_1\nop : β → β → β\nhc : IsCommutative β op\nha : IsAssociative β op\nf : α → β\nb : β\ns : Finset α\na : α\nop' : γ → γ → γ\ninst✝¹ : IsCommutative γ op'\ninst✝ : IsAssociative γ op'\nm : β → γ\nhm : ∀ (x y : β), m (op x y) = op' (m x) (m y)\n⊢ Multiset.f... | [
102,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/Algebra/Order/Sub/Defs.lean | tsub_le_tsub | [] | [
129,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/Control/Traversable/Lemmas.lean | Traversable.traverse_eq_map_id' | [
{
"state_after": "case h\nt : Type u → Type u\ninst✝⁵ : Traversable t\ninst✝⁴ : IsLawfulTraversable t\nF G : Type u → Type u\ninst✝³ : Applicative F\ninst✝² : LawfulApplicative F\ninst✝¹ : Applicative G\ninst✝ : LawfulApplicative G\nα β γ : Type u\ng : α → F β\nh : β → G γ\nf✝ : β → γ\nx : t β\nf : β → γ\nx✝ : ... | [
130,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/Data/Set/Basic.lean | Set.inter_union_diff | [] | [
1866,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1865,
1
] |
Std/Data/List/Lemmas.lean | List.mem_of_mem_take | [] | [
1734,
20
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1733,
1
] |
Mathlib/Data/Int/GCD.lean | Nat.exists_mul_emod_eq_one_of_coprime | [] | [
172,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
1
] |
Mathlib/LinearAlgebra/BilinearForm.lean | BilinForm.Nondegenerate.ker_eq_bot | [] | [
1328,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1326,
1
] |
Mathlib/Topology/Homeomorph.lean | Homeomorph.image_frontier | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.67510\nδ : Type ?u.67513\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\nh : α ≃ₜ β\ns : Set α\n⊢ ↑h '' frontier s = frontier (↑h '' s)",
"tactic": "r... | [
364,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
363,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.nat_cast_im | [] | [
993,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
993,
1
] |
Mathlib/Algebra/Lie/Solvable.lean | LieAlgebra.derivedSeriesOfIdeal_le | [
{
"state_after": "R : Type u\nL : Type v\nM : Type w\nL' : Type w₁\ninst✝⁴ : CommRing R\ninst✝³ : LieRing L\ninst✝² : LieAlgebra R L\ninst✝¹ : LieRing L'\ninst✝ : LieAlgebra R L'\nI✝ J✝ : LieIdeal R L\nf : L' →ₗ⁅R⁆ L\nI J : LieIdeal R L\nk : ℕ\nh₁ : I ≤ J\n⊢ ∀ {l : ℕ}, l ≤ k → D k I ≤ D l J",
"state_before"... | [
102,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/Algebra/Module/Torsion.lean | Submodule.mem_torsionBySet_iff | [
{
"state_after": "R : Type u_2\nM : Type u_1\ninst✝² : CommSemiring R\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\ns : Set R\na : R\nx : M\nh : ∀ (a : ↑s), ↑a • x = 0\n⊢ ∀ (p : Submodule R M), p ∈ torsionBy R M '' s → x ∈ p",
"state_before": "R : Type u_2\nM : Type u_1\ninst✝² : CommSemiring R\ninst✝¹ : A... | [
265,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
263,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | Complex.contDiff_cosh | [] | [
151,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Data/Bool/Basic.lean | Bool.xor_false_left | [
{
"state_after": "no goals",
"state_before": "⊢ ∀ (a : Bool), xor false a = a",
"tactic": "decide"
}
] | [
286,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
286,
1
] |
Mathlib/Combinatorics/Young/YoungDiagram.lean | YoungDiagram.cells_sup | [] | [
123,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/Order/Disjoint.lean | codisjoint_top_right | [] | [
249,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
249,
1
] |
Mathlib/Order/Filter/Interval.lean | Filter.Tendsto.Icc | [] | [
81,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
78,
11
] |
Mathlib/Order/CompleteLattice.lean | iInf_sup_iInf_le | [] | [
1945,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1944,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.count_eq_card_filter_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.433611\nγ : Type ?u.433614\ninst✝ : DecidableEq α\ns : Multiset α\na : α\n⊢ count a s = ↑card (filter (fun x => a = x) s)",
"tactic": "rw [count, countp_eq_card_filter]"
}
] | [
2628,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2627,
1
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | LocalEquiv.symm_mapsTo | [] | [
238,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Data/Finset/Sort.lean | Finset.orderEmbOfFin_apply | [
{
"state_after": "α : Type ?u.35647\nβ : Type ?u.35650\ninst✝ : LinearOrder α\ns : Finset α\nk : ℕ\nh : card s = k\ni : Fin k\n⊢ ↑i < k",
"state_before": "α : Type ?u.35647\nβ : Type ?u.35650\ninst✝ : LinearOrder α\ns : Finset α\nk : ℕ\nh : card s = k\ni : Fin k\n⊢ ↑i < List.length (sort (fun x x_1 => x ≤ x... | [
176,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | iteratedFDeriv_succ_const | [
{
"state_after": "case h.H\n𝕜 : Type u_1\ninst✝¹⁰ : NontriviallyNormedField 𝕜\nD : Type uD\ninst✝⁹ : NormedAddCommGroup D\ninst✝⁸ : NormedSpace 𝕜 D\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝... | [
134,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/Data/Set/Pointwise/Interval.lean | Set.preimage_const_add_Ico | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : OrderedAddCommGroup α\na b c : α\n⊢ (fun x => a + x) ⁻¹' Ico b c = Ico (b - a) (c - a)",
"tactic": "simp [← Ici_inter_Iio]"
}
] | [
69,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Mathlib/MeasureTheory/Function/L2Space.lean | MeasureTheory.Memℒp.const_inner | [] | [
78,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | Matrix.toLin_mul | [
{
"state_after": "case a\nR : Type u_3\ninst✝¹¹ : CommSemiring R\nl : Type u_1\nm : Type u_2\nn : Type u_4\ninst✝¹⁰ : Fintype n\ninst✝⁹ : Fintype m\ninst✝⁸ : DecidableEq n\nM₁ : Type u_5\nM₂ : Type u_7\ninst✝⁷ : AddCommMonoid M₁\ninst✝⁶ : AddCommMonoid M₂\ninst✝⁵ : Module R M₁\ninst✝⁴ : Module R M₂\nv₁ : Basis ... | [
686,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
681,
1
] |
Std/Data/RBMap/Alter.lean | Std.RBNode.Path.zoom_insert | [
{
"state_after": "α : Type u_1\nc : RBColor\nn : Nat\ncmp : α → α → Ordering\nt' : RBNode α\nv : α\npath : Path α\nt : RBNode α\nht : Balanced t c n\nH : zoom (cmp v) t root = (t', path)\nw✝¹ : RBColor\nw✝ : Nat\nht' : Balanced t' w✝¹ w✝\nhp' : Path.Balanced c n path w✝¹ w✝\n⊢ setBlack (insert path t' v) = setB... | [
176,
99
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
169,
1
] |
Mathlib/Topology/Algebra/Order/T5.lean | Set.compl_section_ordSeparatingSet_mem_nhds | [
{
"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\n⊢ ordConnectedSection (ordSeparatingSet s t)ᶜ ∈ 𝓝[Iic a] a ∧ ordConnectedSection (ordSeparatingSet s t)ᶜ ∈ 𝓝[Ici a] a",
"state_befo... | [
82,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/Order/Filter/Basic.lean | Function.Semiconj.filter_map | [] | [
2118,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2116,
1
] |
Mathlib/LinearAlgebra/SesquilinearForm.lean | LinearMap.mem_isPairSelfAdjointSubmodule | [] | [
566,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
564,
1
] |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | le_ciSup_iff' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.75010\nγ : Type ?u.75013\nι : Sort u_2\ninst✝ : ConditionallyCompleteLinearOrderBot α\ns : ι → α\na : α\nh : BddAbove (range s)\n⊢ a ≤ iSup s ↔ ∀ (b : α), (∀ (i : ι), s i ≤ b) → a ≤ b",
"tactic": "simp [iSup, h, le_csSup_iff', upper... | [
1052,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1051,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Continuity.lean | ContinuousAt.rpow_const | [] | [
318,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
316,
8
] |
Mathlib/Data/Setoid/Basic.lean | Setoid.eqvGen_idem | [] | [
256,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
255,
1
] |
Mathlib/Topology/Algebra/Order/UpperLower.lean | IsLowerSet.interior | [] | [
110,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
11
] |
Mathlib/GroupTheory/OrderOfElement.lean | orderOf_eq_zero | [
{
"state_after": "no goals",
"state_before": "G : Type u\nA : Type v\nx y : G\na b : A\nn m : ℕ\ninst✝¹ : Monoid G\ninst✝ : AddMonoid A\nh : ¬IsOfFinOrder x\n⊢ orderOf x = 0",
"tactic": "rwa [orderOf, minimalPeriod, dif_neg]"
}
] | [
167,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
166,
1
] |
Mathlib/RingTheory/Polynomial/Dickson.lean | Polynomial.dickson_one | [] | [
77,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/Data/ULift.lean | ULift.down_surjective | [] | [
118,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.forall_ne_top | [] | [
257,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
256,
1
] |
Mathlib/Order/UpperLower/Basic.lean | isUpperSet_iff_Ici_subset | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.7423\nγ : Type ?u.7426\nι : Sort ?u.7429\nκ : ι → Sort ?u.7434\ninst✝¹ : Preorder α\ninst✝ : Preorder β\ns : Set α\np : α → Prop\na : α\n⊢ IsUpperSet s ↔ ∀ ⦃a : α⦄, a ∈ s → Ici a ⊆ s",
"tactic": "simp [IsUpperSet, subset_def, @foral... | [
224,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Mathlib/Data/Multiset/Range.lean | Multiset.range_disjoint_map_add | [
{
"state_after": "a : ℕ\nm : Multiset ℕ\nx : ℕ\nhxa : x ∈ range a\nhxb : x ∈ map (fun x => a + x) m\n⊢ False",
"state_before": "a : ℕ\nm : Multiset ℕ\n⊢ Disjoint (range a) (map (fun x => a + x) m)",
"tactic": "intro x hxa hxb"
},
{
"state_after": "a : ℕ\nm : Multiset ℕ\nx : ℕ\nhxa : x < a\nhxb :... | [
74,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/Data/PNat/Factors.lean | PrimeMultiset.to_ofNatMultiset | [
{
"state_after": "v : Multiset ℕ\nh : ∀ (p : ℕ), p ∈ v → Nat.Prime p\n⊢ Multiset.map Coe.coe (Multiset.pmap (fun p hp => { val := p, property := hp }) v h) = v",
"state_before": "v : Multiset ℕ\nh : ∀ (p : ℕ), p ∈ v → Nat.Prime p\n⊢ toNatMultiset (ofNatMultiset v h) = v",
"tactic": "dsimp [ofNatMultiset... | [
166,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Topology/ContinuousOn.lean | ContinuousOn.comp_continuous | [
{
"state_after": "α : Type u_3\nβ : Type u_1\nγ : Type u_2\nδ : Type ?u.336497\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\ng : β → γ\nf : α → β\ns : Set β\nhg : ContinuousOn g s\nhf : ContinuousOn f univ\nhs : ∀ (x : α), f x ∈ s\n⊢ Continuo... | [
924,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
921,
1
] |
Mathlib/MeasureTheory/Function/AEMeasurableSequence.lean | aeSeq.prop_of_mem_aeSeqSet | [
{
"state_after": "ι : Sort u_3\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.311116\ninst✝¹ : MeasurableSpace α\ninst✝ : MeasurableSpace β\nf : ι → α → β\nμ : MeasureTheory.Measure α\np : α → (ι → β) → Prop\nhf : ∀ (i : ι), AEMeasurable (f i)\nx : α\nhx : x ∈ aeSeqSet hf p\n⊢ p x fun n => AEMeasurable.mk (f n) (_ : ... | [
81,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Data/Set/Basic.lean | Set.eq_of_subset_of_subset | [] | [
381,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
380,
1
] |
Mathlib/RingTheory/Ideal/Over.lean | Ideal.quotient_mk_maps_eq | [
{
"state_after": "R : Type u_1\ninst✝¹ : CommRing R\nS : Type ?u.53760\ninst✝ : CommRing S\nf : R →+* S\nI J : Ideal S\nP : Ideal R[X]\nx : R\n⊢ ↑(RingHom.comp (RingHom.comp (Quotient.mk (map (mapRingHom (Quotient.mk (comap C P))) P)) C)\n (Quotient.mk (comap C P)))\n x =\n ↑(RingHom.comp\n ... | [
112,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/LinearAlgebra/Alternating.lean | AlternatingMap.coe_mk | [] | [
126,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Algebra/BigOperators/Finsupp.lean | Finsupp.support_sum_eq_biUnion | [
{
"state_after": "case refine_1\nα✝ : Type ?u.566677\nι✝ : Type ?u.566680\nγ : Type ?u.566683\nA : Type ?u.566686\nB : Type ?u.566689\nC : Type ?u.566692\ninst✝⁴ : AddCommMonoid A\ninst✝³ : AddCommMonoid B\ninst✝² : AddCommMonoid C\nt : ι✝ → A → C\nh0 : ∀ (i : ι✝), t i 0 = 0\nh1 : ∀ (i : ι✝) (x y : A), t i (x +... | [
561,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
547,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.map_lift_pullbackComparison | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝³ : Category C\nD : Type u₂\ninst✝² : Category D\nW✝ X Y Z : C\nG : C ⥤ D\nf : X ⟶ Z\ng : Y ⟶ Z\ninst✝¹ : HasPullback f g\ninst✝ : HasPullback (G.map f) (G.map g)\nW : C\nh : W ⟶ X\nk : W ⟶ Y\nw : h ≫ f = k ≫ g\n⊢ G.map h ≫ G.map f = G.map k ≫ G... | [
1465,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1461,
1
] |
Mathlib/Algebra/Field/Basic.lean | Commute.inv_sub_inv | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.49028\nβ : Type ?u.49031\nK : Type u_1\ninst✝ : DivisionRing K\na b c d : K\nhab : _root_.Commute a b\nha : a ≠ 0\nhb : b ≠ 0\n⊢ a⁻¹ - b⁻¹ = (b - a) / (a * b)",
"tactic": "simp only [inv_eq_one_div, (Commute.one_right a).div_sub_div hab ha hb, on... | [
199,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
11
] |
Mathlib/RingTheory/Ideal/QuotientOperations.lean | Ideal.QuotientKerAlgEquivOfRightInverseSymm.apply | [] | [
327,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
324,
1
] |
Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean | Collinear.finiteDimensional_direction_affineSpan | [] | [
357,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
355,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | differentiableWithinAt_neg_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.407641\ninst✝³ : NormedAddCommGroup G\ninst✝² : Normed... | [
425,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
1
] |
Mathlib/Algebra/Group/Basic.lean | mul_inv_eq_one | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.55381\nβ : Type ?u.55384\nG : Type u_1\ninst✝ : Group G\na b c d : G\n⊢ a * b⁻¹ = 1 ↔ a = b",
"tactic": "rw [mul_eq_one_iff_eq_inv, inv_inv]"
}
] | [
716,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
716,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.eq_re_iff_mem_range_coe | [] | [
1149,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1148,
1
] |
Mathlib/CategoryTheory/Shift/Basic.lean | CategoryTheory.shiftFunctor_inv | [] | [
457,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
456,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.deriv_add_eq_mul_omega_add | [
{
"state_after": "a : Ordinal\n⊢ ∀ (b : Ordinal), deriv (fun x => a + x) b = a * ω + b",
"state_before": "a b : Ordinal\n⊢ deriv (fun x => a + x) b = a * ω + b",
"tactic": "revert b"
},
{
"state_after": "a : Ordinal\n⊢ deriv (fun x => a + x) 0 = (fun x x_1 => x + x_1) (a * ω) 0 ∧\n ∀ (a_1 : O... | [
607,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
600,
1
] |
Mathlib/Algebra/TrivSqZeroExt.lean | TrivSqZeroExt.inl_injective | [] | [
167,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
166,
1
] |
Mathlib/ModelTheory/Semantics.lean | FirstOrder.Language.Equiv.elementarilyEquivalent | [] | [
987,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
986,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearEquiv.ofLeftInverse_apply | [] | [
2191,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2189,
1
] |
Mathlib/Data/Nat/ModEq.lean | Nat.ModEq.rfl | [] | [
54,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
11
] |
Mathlib/Data/Complex/Basic.lean | Complex.coe_imAddGroupHom | [] | [
465,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
464,
1
] |
Mathlib/CategoryTheory/Limits/FilteredColimitCommutesFiniteLimit.lean | CategoryTheory.Limits.colimitLimitToLimitColimit_surjective | [
{
"state_after": "J K : Type v\ninst✝³ : SmallCategory J\ninst✝² : SmallCategory K\nF : J × K ⥤ Type v\ninst✝¹ : IsFiltered K\ninst✝ : FinCategory J\nx : limit (curry.obj F ⋙ colim)\n⊢ ∃ a, colimitLimitToLimitColimit F a = x",
"state_before": "J K : Type v\ninst✝³ : SmallCategory J\ninst✝² : SmallCategory K... | [
314,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/Algebra/ContinuedFractions/Translations.lean | GeneralizedContinuedFraction.zeroth_continuant_eq_h_one | [] | [
133,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
132,
1
] |
Mathlib/Algebra/BigOperators/Finsupp.lean | Finsupp.sum_sub_index | [] | [
510,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
507,
1
] |
Mathlib/Analysis/Complex/Basic.lean | Complex.nnnorm_eq_one_of_pow_eq_one | [
{
"state_after": "E : Type ?u.222428\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℂ E\nζ : ℂ\nn : ℕ\nh : ζ ^ n = 1\nhn : n ≠ 0\n⊢ ‖ζ‖₊ ^ n = 1 ^ n",
"state_before": "E : Type ?u.222428\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℂ E\nζ : ℂ\nn : ℕ\nh : ζ ^ n = 1\nhn : n ≠ 0\n⊢ ‖ζ‖₊ = 1",
"... | [
201,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
199,
1
] |
Mathlib/Analysis/Complex/AbsMax.lean | Complex.eqOn_closure_of_isPreconnected_of_isMaxOn_norm | [] | [
303,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
299,
1
] |
Mathlib/Data/List/Lattice.lean | List.inter_subset_right | [] | [
174,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snorm_mono_nnnorm | [] | [
409,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
407,
1
] |
Mathlib/Order/Heyting/Basic.lean | sdiff_sdiff_le | [] | [
715,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
714,
1
] |
Mathlib/Topology/Instances/Matrix.lean | Continuous.matrix_transpose | [] | [
92,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/MeasureTheory/Decomposition/Jordan.lean | MeasureTheory.SignedMeasure.toJordanDecomposition_neg | [
{
"state_after": "case a\nα : Type u_1\nβ : Type ?u.74331\ninst✝ : MeasurableSpace α\ns : SignedMeasure α\n⊢ toSignedMeasure (toJordanDecomposition (-s)) = toSignedMeasure (-toJordanDecomposition s)",
"state_before": "α : Type u_1\nβ : Type ?u.74331\ninst✝ : MeasurableSpace α\ns : SignedMeasure α\n⊢ toJorda... | [
463,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
460,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearMap.coe_finsupp_sum | [] | [
1124,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1123,
1
] |
Mathlib/RingTheory/Valuation/Integers.lean | Valuation.Integers.dvd_of_le | [
{
"state_after": "F : Type u\nΓ₀ : Type v\ninst✝³ : Field F\ninst✝² : LinearOrderedCommGroupWithZero Γ₀\nv : Valuation F Γ₀\nO : Type w\ninst✝¹ : CommRing O\ninst✝ : Algebra O F\nhv : Integers v O\nx y : O\nh : ↑v (↑(algebraMap O F) x) ≤ ↑v (↑(algebraMap O F) y)\nhy : ↑(algebraMap O F) y ≠ 0\n⊢ ↑v (↑(algebraMap... | [
126,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/Logic/Relation.lean | Relation.ReflTransGen.trans | [
{
"state_after": "case refl\nα : Type u_1\nβ : Type ?u.16334\nγ : Type ?u.16337\nδ : Type ?u.16340\nr : α → α → Prop\na b c d : α\nhab : ReflTransGen r a b\n⊢ ReflTransGen r a b\n\ncase tail\nα : Type u_1\nβ : Type ?u.16334\nγ : Type ?u.16337\nδ : Type ?u.16340\nr : α → α → Prop\na b c d : α\nhab : ReflTransGen... | [
273,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Mathlib/Algebra/Order/Ring/WithTop.lean | WithTop.mul_eq_top_iff | [
{
"state_after": "α : Type u_1\ninst✝² : DecidableEq α\ninst✝¹ : Zero α\ninst✝ : Mul α\na b : WithTop α\n⊢ (a = 0 ∨ b = 0) ∧ 0 = none ∨ ¬(a = 0 ∨ b = 0) ∧ (a = none ∨ b = none) ↔ a ≠ 0 ∧ b = none ∨ a = none ∧ b ≠ 0",
"state_before": "α : Type u_1\ninst✝² : DecidableEq α\ninst✝¹ : Zero α\ninst✝ : Mul α\na b ... | [
67,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Algebra/DirectSum/Module.lean | DirectSum.IsInternal.submodule_iSup_eq_top | [
{
"state_after": "R : Type u\ninst✝² : Semiring R\nι : Type v\ndec_ι : DecidableEq ι\nM : Type u_1\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\nA : ι → Submodule R M\nh : IsInternal A\n⊢ Function.Surjective ↑(↑(Dfinsupp.lsum ℕ) fun i => Submodule.subtype (A i))",
"state_before": "R : Type u\ninst✝² : Semi... | [
332,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
330,
1
] |
Mathlib/Data/Set/Function.lean | Set.MapsTo.surjOn_compl | [] | [
881,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
880,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsBigOWith.add | [
{
"state_after": "α : Type u_1\nβ : Type ?u.196977\nE : Type ?u.196980\nF : Type u_3\nG : Type ?u.196986\nE' : Type u_2\nF' : Type ?u.196992\nG' : Type ?u.196995\nE'' : Type ?u.196998\nF'' : Type ?u.197001\nG'' : Type ?u.197004\nR : Type ?u.197007\nR' : Type ?u.197010\n𝕜 : Type ?u.197013\n𝕜' : Type ?u.197016\... | [
1066,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1060,
1
] |
Mathlib/ModelTheory/FinitelyGenerated.lean | FirstOrder.Language.Substructure.FG.map | [
{
"state_after": "no goals",
"state_before": "L : Language\nM : Type u_4\ninst✝¹ : Structure L M\nN : Type u_1\ninst✝ : Structure L N\nf : M →[L] N\ns : Substructure L M\nhs : FG s\nt : Set M\nht : Set.Finite t ∧ LowerAdjoint.toFun (closure L) t = s\n⊢ LowerAdjoint.toFun (closure L) (↑f '' t) = Substructure... | [
87,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/ModelTheory/ElementaryMaps.lean | FirstOrder.Language.ElementaryEmbedding.ext | [] | [
202,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/Analysis/Convex/Basic.lean | convex_iff_forall_pos | [] | [
154,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.