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/Topology/LocalHomeomorph.lean | LocalHomeomorph.ofSet_trans_ofSet | [
{
"state_after": "α : Type u_1\nβ : Type ?u.73860\nγ : Type ?u.73863\nδ : Type ?u.73866\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\ne : LocalHomeomorph α β\ne' : LocalHomeomorph β γ\ns : Set α\nhs : IsOpen s\ns' : Set α\nhs' : IsOpen s'\n⊢ ... | [
889,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
886,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.IsCycle.sign | [
{
"state_after": "ι : Type ?u.914072\nα : Type u_1\nβ : Type ?u.914078\nf✝ g : Perm α\nx✝¹ y : α\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nx✝ : Perm α\nf : Perm α := x✝\nhf : IsCycle x✝\nx : α\nhx : ↑x✝ x ≠ x ∧ ∀ ⦃y : α⦄, ↑x✝ y ≠ y → SameCycle x✝ x y\nh1 : ↑f (↑f x) = x\nh : swap x (↑f x) * f = 1\n⊢ ↑Perm.sig... | [
557,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
532,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | orthonormal_sUnion_of_directed | [
{
"state_after": "𝕜 : Type u_2\nE : Type u_1\nF : Type ?u.2158643\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nι : Type ?u.2158692\ndec_ι : DecidableEq ι\ns : Set (Set E)\nhs : DirectedO... | [
954,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
951,
1
] |
Mathlib/Data/Fintype/Card.lean | Fintype.card_le_one_iff_subsingleton | [] | [
568,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
567,
1
] |
Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean | MeasureTheory.Lp.simpleFunc.uniformContinuous | [] | [
759,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
758,
11
] |
Mathlib/Order/Filter/Prod.lean | Filter.prod_le_prod | [] | [
286,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/Topology/Instances/EReal.lean | EReal.nhds_bot' | [] | [
164,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
1
] |
Mathlib/Init/Data/Nat/Bitwise.lean | Nat.bodd_one | [] | [
61,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/Data/Polynomial/Reverse.lean | Polynomial.coeff_one_reverse | [
{
"state_after": "R : Type u_1\ninst✝ : Semiring R\nf✝ f : R[X]\n⊢ coeff f (↑(revAt (natDegree f)) 1) = if natDegree f = 0 then 0 else coeff f (natDegree f - 1)",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nf✝ f : R[X]\n⊢ coeff (reverse f) 1 = nextCoeff f",
"tactic": "rw [coeff_reverse, nextCoeff... | [
345,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
339,
1
] |
Mathlib/Deprecated/Ring.lean | RingHom.to_isSemiringHom | [] | [
165,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Data/Matrix/Notation.lean | Matrix.smul_mat_cons | [
{
"state_after": "case h.h\nα : Type u\no n m : ℕ\nm' : Type uₘ\nn' : Type uₙ\no' : Type uₒ\na b : ℕ\ninst✝ : Semiring α\nx : α\nv : n' → α\nA : Fin m → n' → α\ni : Fin (Nat.succ m)\nx✝ : n'\n⊢ (x • vecCons v A) i x✝ = vecCons (x • v) (x • A) i x✝",
"state_before": "α : Type u\no n m : ℕ\nm' : Type uₘ\nn' :... | [
369,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
366,
1
] |
Mathlib/Algebra/Star/Subalgebra.lean | StarAlgHom.adjoin_le_equalizer | [] | [
745,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
744,
1
] |
Mathlib/Algebra/EuclideanDomain/Basic.lean | EuclideanDomain.lcm_dvd | [
{
"state_after": "R : Type u\ninst✝¹ : EuclideanDomain R\ninst✝ : DecidableEq R\nx y z : R\nhxz : x ∣ z\nhyz : y ∣ z\n⊢ x * y / gcd x y ∣ z",
"state_before": "R : Type u\ninst✝¹ : EuclideanDomain R\ninst✝ : DecidableEq R\nx y z : R\nhxz : x ∣ z\nhyz : y ∣ z\n⊢ lcm x y ∣ z",
"tactic": "rw [lcm]"
},
{... | [
291,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
271,
1
] |
Mathlib/Data/Polynomial/Degree/Lemmas.lean | Polynomial.natDegree_C_mul_eq_of_mul_ne_zero | [
{
"state_after": "R : Type u\nS : Type v\nι : Type w\na b : R\nm n : ℕ\ninst✝ : Semiring R\np q r : R[X]\nh : a * leadingCoeff p ≠ 0\n⊢ natDegree p ∈ support (↑C a * p)",
"state_before": "R : Type u\nS : Type v\nι : Type w\na b : R\nm n : ℕ\ninst✝ : Semiring R\np q r : R[X]\nh : a * leadingCoeff p ≠ 0\n⊢ na... | [
152,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/Algebra/Tropical/Basic.lean | Tropical.trop_zero | [] | [
405,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
404,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.smul_ofFunction | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.159032\nm : Set α → ℝ≥0∞\nm_empty : m ∅ = 0\nc : ℝ≥0∞\nhc : c ≠ ⊤\n⊢ (c • m) ∅ = 0",
"tactic": "simp [m_empty]"
},
{
"state_after": "case h\nα : Type u_1\nm : Set α → ℝ≥0∞\nm_empty : m ∅ = 0\nc : ℝ≥0∞\nhc : c ≠ ⊤\ns : Set α\n⊢ ↑(c • Outer... | [
827,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
821,
1
] |
Mathlib/Data/Part.lean | Part.get_some | [] | [
164,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
1
] |
Mathlib/LinearAlgebra/Matrix/Trace.lean | Matrix.trace_fin_one | [] | [
191,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Std/Data/Nat/Gcd.lean | Nat.lcm_one_right | [
{
"state_after": "no goals",
"state_before": "m : Nat\n⊢ lcm m 1 = m",
"tactic": "simp [lcm]"
}
] | [
191,
71
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
191,
9
] |
Mathlib/Data/Finset/Lattice.lean | Finset.exists_mem_eq_sup' | [
{
"state_after": "case refine'_1\nF : Type ?u.307909\nα : Type u_2\nβ : Type ?u.307915\nγ : Type ?u.307918\nι : Type u_1\nκ : Type ?u.307924\ninst✝ : LinearOrder α\ns : Finset ι\nH : Finset.Nonempty s\nf✝ : ι → α\na : α\nf : ι → α\nc : ι\n⊢ ∃ i, i ∈ {c} ∧ sup' {c} (_ : Finset.Nonempty {c}) f = f i\n\ncase refin... | [
1123,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1116,
1
] |
Mathlib/Algebra/Star/Basic.lean | star_intCast | [] | [
349,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
348,
1
] |
Mathlib/Algebra/Group/Commute.lean | Commute.symm_iff | [] | [
77,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
11
] |
Mathlib/RingTheory/FinitePresentation.lean | Algebra.FinitePresentation.of_restrict_scalars_finitePresentation | [
{
"state_after": "case intro.intro.intro.intro\nR : Type w₁\nA : Type w₂\nB : Type w₃\ninst✝⁶ : CommRing R\ninst✝⁵ : CommRing A\ninst✝⁴ : Algebra R A\ninst✝³ : CommRing B\ninst✝² : Algebra R B\ninst✝¹ : Algebra A B\ninst✝ : IsScalarTower R A B\nhRA : FiniteType R A\nn : ℕ\nf : MvPolynomial (Fin n) R →ₐ[R] B\nhf... | [
307,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Mathlib/NumberTheory/Padics/PadicNorm.lean | padicNorm.int_eq_one_iff | [
{
"state_after": "p : ℕ\nhp : Fact (Nat.Prime p)\nm : ℤ\n⊢ padicNorm p ↑m = 1 ↔ ¬↑(p ^ 1) ∣ m",
"state_before": "p : ℕ\nhp : Fact (Nat.Prime p)\nm : ℤ\n⊢ padicNorm p ↑m = 1 ↔ ¬↑p ∣ m",
"tactic": "nth_rw 2 [← pow_one p]"
},
{
"state_after": "p : ℕ\nhp : Fact (Nat.Prime p)\nm : ℤ\n⊢ padicNorm p ↑m... | [
294,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean | LinearMap.toMatrix₂_mul | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nR₁ : Type ?u.1890648\nR₂ : Type ?u.1890651\nM✝ : Type ?u.1890654\nM₁ : Type u_2\nM₂ : Type u_3\nM₁' : Type ?u.1890663\nM₂' : Type u_7\nn : Type u_6\nm : Type u_4\nn' : Type ?u.1890675\nm' : Type u_5\nι : Type ?u.1890681\ninst✝¹⁶ : CommRing R\ninst✝... | [
503,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
501,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.conjTranspose_pow | [] | [
2326,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2324,
1
] |
Mathlib/RingTheory/Localization/Basic.lean | IsLocalization.mk'_add | [
{
"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.894644\ninst✝¹ : CommSemiring P\ninst✝ : IsLocalization M S\nx₁ x₂ : R\ny₁ y₂ : { x // x ∈ M }\n⊢ ↑(algebraMap R ((fun x => (fun x => S) (x₂ * ↑y₁ + x₁ * ↑y₂)) (↑(y₁... | [
456,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
447,
1
] |
Mathlib/Algebra/Order/Monoid/MinMax.lean | min_le_mul_of_one_le_left | [] | [
145,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | AEMeasurable.isGLB | [
{
"state_after": "α : Type u_3\nβ : Type ?u.1213665\nγ : Type ?u.1213668\nγ₂ : Type ?u.1213671\nδ : Type u_2\nι✝ : Sort y\ns t u : Set α\ninst✝¹³ : TopologicalSpace α\ninst✝¹² : MeasurableSpace α\ninst✝¹¹ : BorelSpace α\ninst✝¹⁰ : TopologicalSpace β\ninst✝⁹ : MeasurableSpace β\ninst✝⁸ : BorelSpace β\ninst✝⁷ : T... | [
1165,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1141,
1
] |
Mathlib/Order/Compare.lean | cmp_eq_cmp_symm | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ✝ : Type ?u.19348\ninst✝¹ : LinearOrder α\nx y : α\nβ : Type u_2\ninst✝ : LinearOrder β\nx' y' : β\nh : cmp x y = cmp x' y'\n⊢ cmp y x = cmp y' x'",
"tactic": "rwa [← cmp_swap x', ← cmp_swap, swap_inj]"
},
{
"state_after": "no goals",
... | [
251,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
249,
1
] |
Mathlib/InformationTheory/Hamming.lean | Hamming.ofHamming_neg | [] | [
365,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
364,
1
] |
Mathlib/CategoryTheory/Sites/Sieves.lean | CategoryTheory.Sieve.ext | [] | [
274,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
11
] |
Mathlib/GroupTheory/NoncommPiCoprod.lean | MonoidHom.noncommPiCoprod_mrange | [
{
"state_after": "case a\nM : Type u_1\ninst✝² : Monoid M\nι : Type u_2\nhdec : DecidableEq ι\ninst✝¹ : Fintype ι\nN : ι → Type u_3\ninst✝ : (i : ι) → Monoid (N i)\nϕ : (i : ι) → N i →* M\nhcomm : Pairwise fun i j => ∀ (x : N i) (y : N j), Commute (↑(ϕ i) x) (↑(ϕ j) y)\nf g : (i : ι) → N i\n⊢ mrange (noncommPiC... | [
179,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/Data/List/Rotate.lean | List.length_cyclicPermutations_of_ne_nil | [
{
"state_after": "no goals",
"state_before": "α : Type u\nl✝ l' l : List α\nh : l ≠ []\n⊢ length (cyclicPermutations l) = length l",
"tactic": "simp [cyclicPermutations_of_ne_nil _ h]"
}
] | [
596,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
595,
1
] |
Mathlib/CategoryTheory/Iso.lean | CategoryTheory.IsIso.inv_comp_eq | [] | [
424,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
1
] |
Mathlib/SetTheory/Cardinal/Continuum.lean | Cardinal.continuum_mul_self | [] | [
157,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/Topology/Algebra/FilterBasis.lean | GroupFilterBasis.nhds_hasBasis | [
{
"state_after": "G : Type u\ninst✝ : Group G\nB✝ B : GroupFilterBasis G\nx₀ : G\n⊢ HasBasis (N B x₀) (fun V => V ∈ B) fun V => (fun y => x₀ * y) '' V",
"state_before": "G : Type u\ninst✝ : Group G\nB✝ B : GroupFilterBasis G\nx₀ : G\n⊢ HasBasis (𝓝 x₀) (fun V => V ∈ B) fun V => (fun y => x₀ * y) '' V",
... | [
220,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
217,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Finsupp.sum_smul_index_linearMap' | [
{
"state_after": "R✝ : Type ?u.3532\nR₁ : Type ?u.3535\nR₂ : Type ?u.3538\nR₃ : Type ?u.3541\nR₄ : Type ?u.3544\nS : Type ?u.3547\nK : Type ?u.3550\nK₂ : Type ?u.3553\nM✝ : Type ?u.3556\nM' : Type ?u.3559\nM₁ : Type ?u.3562\nM₂✝ : Type ?u.3565\nM₃ : Type ?u.3568\nM₄ : Type ?u.3571\nN : Type ?u.3574\nN₂ : Type ?... | [
93,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Data/Finset/Slice.lean | Set.sized_powersetLen | [] | [
98,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
97,
1
] |
Mathlib/Algebra/BigOperators/Fin.lean | Fin.partialProd_right_inv | [
{
"state_after": "case mk\nα : Type ?u.118731\nβ : Type ?u.118734\ninst✝¹ : Monoid α\nn : ℕ\nG : Type u_1\ninst✝ : Group G\nf : Fin n → G\ni : ℕ\nhn : i < n\n⊢ (partialProd f (↑castSucc { val := i, isLt := hn }))⁻¹ * partialProd f (succ { val := i, isLt := hn }) =\n f { val := i, isLt := hn }",
"state_be... | [
270,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
257,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Complex.lean | Complex.sin_eq_sin_iff | [
{
"state_after": "x y : ℂ\n⊢ (∃ k, y = 2 * ↑k * ↑π + (x - ↑π / 2) + ↑π / 2 ∨ y = 2 * ↑k * ↑π - (x - ↑π / 2) + ↑π / 2) ↔\n ∃ k, y = 2 * ↑k * ↑π + x ∨ y = (2 * ↑k + 1) * ↑π - x",
"state_before": "x y : ℂ\n⊢ sin x = sin y ↔ ∃ k, y = 2 * ↑k * ↑π + x ∨ y = (2 * ↑k + 1) * ↑π - x",
"tactic": "simp only [← C... | [
100,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
97,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/CommSq.lean | CategoryTheory.IsPushout.of_hasPushout | [] | [
373,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
371,
1
] |
Mathlib/ModelTheory/Graph.lean | FirstOrder.Language.Theory.simpleGraph_model_iff | [
{
"state_after": "no goals",
"state_before": "L : Language\nα : Type w\nV : Type w'\nn : ℕ\ninst✝ : Structure Language.graph V\n⊢ V ⊨ Theory.simpleGraph ↔ (Irreflexive fun x y => RelMap adj ![x, y]) ∧ Symmetric fun x y => RelMap adj ![x, y]",
"tactic": "simp [Theory.simpleGraph]"
}
] | [
83,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/NumberTheory/BernoulliPolynomials.lean | Polynomial.derivative_bernoulli_add_one | [
{
"state_after": "k : ℕ\n⊢ ∑ x in range (k + 1 + 1), ↑(monomial (k - x)) (_root_.bernoulli x * ↑(Nat.choose (k + 1) x) * ↑(k + 1 - x)) =\n (↑k + 1) * ∑ x in range (k + 1), ↑(monomial (k - x)) (_root_.bernoulli x * ↑(Nat.choose k x))",
"state_before": "k : ℕ\n⊢ ↑derivative (bernoulli (k + 1)) = (↑k + 1) *... | [
115,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.inter_assoc | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.181571\nγ : Type ?u.181574\ninst✝ : DecidableEq α\ns s₁✝ s₂✝ t t₁ t₂ u v : Finset α\na b : α\ns₁ s₂ s₃ : Finset α\nx✝ : α\n⊢ x✝ ∈ s₁ ∩ s₂ ∩ s₃ ↔ x✝ ∈ s₁ ∩ (s₂ ∩ s₃)",
"tactic": "simp only [mem_inter, and_assoc]"
}
] | [
1617,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1616,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | MeasurableSet.induction_on_open | [] | [
296,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
288,
1
] |
Mathlib/Order/Bounds/Basic.lean | isGLB_univ | [] | [
834,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
833,
1
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | LocalEquiv.source_subset_preimage_target | [] | [
538,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
537,
1
] |
Mathlib/Order/Antichain.lean | IsStrongAntichain.subset | [] | [
285,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
11
] |
Mathlib/Order/WellFoundedSet.lean | Set.WellFoundedOn.acc_iff_wellFoundedOn | [
{
"state_after": "case tfae_1_to_2\nι : Type ?u.5635\nα✝ : Type ?u.5638\nβ : Type ?u.5641\nr✝ r' : α✝ → α✝ → Prop\ns t : Set α✝\nx y : α✝\nα : Type u_1\nr : α → α → Prop\na : α\n⊢ Acc r a → WellFoundedOn {b | ReflTransGen r b a} r\n\nι : Type ?u.5635\nα✝ : Type ?u.5638\nβ : Type ?u.5641\nr✝ r' : α✝ → α✝ → Prop\... | [
131,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
116,
1
] |
Mathlib/Deprecated/Subgroup.lean | Additive.isNormalAddSubgroup | [] | [
190,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Data/Polynomial/RingDivision.lean | Polynomial.exists_min_root | [] | [
616,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
615,
1
] |
Mathlib/Combinatorics/Young/YoungDiagram.lean | YoungDiagram.mem_mk | [] | [
88,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/CategoryTheory/Localization/Predicate.lean | CategoryTheory.Localization.inverts | [] | [
165,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/Algebra/Group/Commute.lean | Commute.inv_right | [] | [
356,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
355,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.measure_sUnion₀ | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.10618\nγ : Type ?u.10621\nδ : Type ?u.10624\nι : Type ?u.10627\nR : Type ?u.10630\nR' : Type ?u.10633\nm : MeasurableSpace α\nμ μ₁ μ₂ : Measure α\ns s₁ s₂ t : Set α\nS : Set (Set α)\nhs : Set.Countable S\nhd : Set.Pairwise S (AEDisjoint... | [
175,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/Data/Nat/Factorization/Basic.lean | Nat.ord_proj_dvd_ord_proj_of_dvd | [
{
"state_after": "case inl\na b : ℕ\nhb0 : b ≠ 0\nhab : a ∣ b\np : ℕ\npp : ¬Prime p\n⊢ p ^ ↑(factorization a) p ∣ p ^ ↑(factorization b) p\n\ncase inr\na b : ℕ\nhb0 : b ≠ 0\nhab : a ∣ b\np : ℕ\npp : Prime p\n⊢ p ^ ↑(factorization a) p ∣ p ^ ↑(factorization b) p",
"state_before": "a b : ℕ\nhb0 : b ≠ 0\nhab :... | [
599,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
594,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.rev_rev | [] | [
477,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
476,
1
] |
Mathlib/Algebra/CubicDiscriminant.lean | Cubic.monic_of_a_eq_one | [
{
"state_after": "R : Type u_1\nS : Type ?u.558294\nF : Type ?u.558297\nK : Type ?u.558300\nP Q : Cubic R\na b c d a' b' c' d' : R\ninst✝ : Semiring R\nha : P.a = 1\n✝ : Nontrivial R\n⊢ Monic (toPoly P)",
"state_before": "R : Type u_1\nS : Type ?u.558294\nF : Type ?u.558297\nK : Type ?u.558300\nP Q : Cubic ... | [
246,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
244,
1
] |
Mathlib/Order/Filter/Extr.lean | IsMinFilter.neg | [] | [
483,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
482,
1
] |
Mathlib/NumberTheory/ArithmeticFunction.lean | Nat.ArithmeticFunction.mul_apply_one | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nf g : ArithmeticFunction R\n⊢ ↑(f * g) 1 = ↑f 1 * ↑g 1",
"tactic": "simp"
}
] | [
281,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
281,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.ncard_lt_ncard_iff_ncard_diff_lt_ncard_diff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.129820\ns t : Set α\na b x y : α\nf : α → β\nhs : autoParam (Set.Finite s) _auto✝\nht : autoParam (Set.Finite t) _auto✝\n⊢ ncard s < ncard t ↔ ncard (s \\ t) < ncard (t \\ s)",
"tactic": "rw [← ncard_inter_add_ncard_diff_eq_ncard s ... | [
564,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
561,
1
] |
Mathlib/Topology/Order/Basic.lean | Icc_mem_nhdsWithin_Iic' | [] | [
590,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
589,
1
] |
Mathlib/Data/Finset/Fin.lean | Finset.mem_attachFin | [] | [
40,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
35,
1
] |
Mathlib/RingTheory/DedekindDomain/Ideal.lean | singleton_span_mem_normalizedFactors_of_mem_normalizedFactors | [
{
"state_after": "case pos\nR : Type u_1\nA : Type ?u.1348878\nK : Type ?u.1348881\ninst✝⁸ : CommRing R\ninst✝⁷ : CommRing A\ninst✝⁶ : Field K\ninst✝⁵ : IsDomain A\ninst✝⁴ : IsDomain R\ninst✝³ : IsPrincipalIdealRing R\ninst✝² : NormalizationMonoid R\ninst✝¹ : DecidableEq R\ninst✝ : DecidableEq (Ideal R)\na b : ... | [
1434,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1417,
1
] |
Mathlib/Topology/Inseparable.lean | Inseparable.rfl | [] | [
346,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
345,
1
] |
Mathlib/Topology/UniformSpace/CompactConvergence.lean | Filter.HasBasis.compactConvergenceUniformity | [
{
"state_after": "case refine'_1\nα : Type u₁\nβ : Type u₂\ninst✝¹ : TopologicalSpace α\ninst✝ : UniformSpace β\nK : Set α\nV : Set (β × β)\nf : C(α, β)\nι : Type u_1\npi : ι → Prop\ns : ι → Set (β × β)\nh : HasBasis (𝓤 β) pi s\n⊢ ∀ (i : Set α × Set (β × β)),\n IsCompact i.fst ∧ i.snd ∈ 𝓤 β →\n ∃ i',\... | [
381,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
372,
1
] |
Mathlib/Analysis/Quaternion.lean | Quaternion.coeComplex_mul | [
{
"state_after": "no goals",
"state_before": "z w : ℂ\n⊢ ↑(z * w) = ↑z * ↑w",
"tactic": "ext <;> simp"
}
] | [
140,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/Algebra/Algebra/Equiv.lean | AlgEquiv.autCongr_symm | [] | [
703,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
702,
1
] |
Mathlib/Algebra/Order/Monoid/Lemmas.lean | mul_lt_mul_right' | [] | [
141,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | Real.norm_of_nonpos | [] | [
1719,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1718,
1
] |
Std/Data/List/Lemmas.lean | List.find?_eq_none | [
{
"state_after": "case cons\nα✝ : Type u_1\np : α✝ → Bool\nhead✝ : α✝\ntail✝ : List α✝\ntail_ih✝ : find? p tail✝ = none ↔ ∀ (x : α✝), x ∈ tail✝ → ¬p x = true\n⊢ (match p head✝ with\n | true => some head✝\n | false => find? p tail✝) =\n none ↔\n p head✝ = false ∧ ∀ (a : α✝), a ∈ tail✝ → p a = f... | [
1260,
43
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1259,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.C_0 | [] | [
209,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/Topology/Constructions.lean | continuous_inclusion | [] | [
1053,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1052,
1
] |
Mathlib/LinearAlgebra/ProjectiveSpace/Basic.lean | Projectivization.mk_rep | [] | [
87,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | intervalIntegral.deriv_integral_right | [] | [
777,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
774,
1
] |
Mathlib/Topology/Order/Priestley.lean | exists_clopen_lower_of_not_le | [] | [
61,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
58,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.natDegree_pow' | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\na b c d : R\nn✝ m : ℕ\ninst✝ : Semiring R\np q : R[X]\nι : Type ?u.688771\nn : ℕ\nh : leadingCoeff p ^ n ≠ 0\nhp0 : p = 0\nhn0 : n = 0\n⊢ natDegree (p ^ n) = n * natDegree p",
"tactic": "simp [*]"
},
{
"state_after": "R : Type... | [
999,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
987,
1
] |
Mathlib/LinearAlgebra/Dimension.lean | rank_fun' | [
{
"state_after": "no goals",
"state_before": "K : Type u\nV V₁ V₂ V₃ : Type v\nV' V'₁ : Type v'\nV'' : Type v''\nι : Type w\nι' : Type w'\nη : Type u₁'\nφ : η → Type ?u.540063\ninst✝¹⁴ : Ring K\ninst✝¹³ : StrongRankCondition K\ninst✝¹² : AddCommGroup V\ninst✝¹¹ : Module K V\ninst✝¹⁰ : Module.Free K V\ninst✝... | [
1028,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1027,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Kernels.lean | CategoryTheory.Limits.kernel.condition | [] | [
240,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
239,
1
] |
Mathlib/Data/Set/Function.lean | StrictMonoOn.strictMono | [] | [
327,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
325,
11
] |
Mathlib/Algebra/Lie/Submodule.lean | LieIdeal.comap_coeSubmodule | [] | [
815,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
813,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.isCaratheodory_iff | [] | [
1051,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1049,
1
] |
Mathlib/Analysis/Asymptotics/Theta.lean | Asymptotics.IsTheta.sup | [] | [
195,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.induction_on_union | [
{
"state_after": "α : Type u_1\nβ : Type ?u.167923\nγ : Type ?u.167926\ninst✝ : DecidableEq α\ns s₁ s₂ t t₁ t₂ u v : Finset α\na✝ b✝ : α\nP : Finset α → Finset α → Prop\nsymm : ∀ {a b : Finset α}, P a b → P b a\nempty_right : ∀ {a : Finset α}, P a ∅\nsingletons : ∀ {a b : α}, P {a} {b}\nunion_of : ∀ {a b c : Fi... | [
1526,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1517,
1
] |
Mathlib/CategoryTheory/Limits/Constructions/Over/Products.lean | CategoryTheory.Over.over_hasTerminal | [
{
"state_after": "J : Type w\nC : Type u\ninst✝ : Category C\nX B : C\nF : Discrete PEmpty ⥤ Over B\ns : Cone F\nm : s.pt ⟶ { pt := mk (𝟙 B), π := NatTrans.mk fun p => PEmpty.elim p.as }.pt\nx✝ : ∀ (j : Discrete PEmpty), m ≫ { pt := mk (𝟙 B), π := NatTrans.mk fun p => PEmpty.elim p.as }.π.app j = s.π.app j\n⊢... | [
190,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
175,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Complex.lean | Complex.inv_cpow_eq_ite' | [
{
"state_after": "x n : ℂ\n⊢ (x ^ n)⁻¹ =\n if arg x = π then if arg x = π then (x ^ n)⁻¹ else ↑(starRingEnd ℂ) (x ^ ↑(starRingEnd ℂ) n)⁻¹ else x⁻¹ ^ n",
"state_before": "x n : ℂ\n⊢ (x ^ n)⁻¹ = if arg x = π then ↑(starRingEnd ℂ) (x⁻¹ ^ ↑(starRingEnd ℂ) n) else x⁻¹ ^ n",
"tactic": "rw [inv_cpow_eq_ite,... | [
199,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/Algebra/Homology/Homology.lean | boundariesToCycles_naturality | [
{
"state_after": "case h\nι : Type u_1\nV : Type u\ninst✝⁴ : Category V\ninst✝³ : HasZeroMorphisms V\nc : ComplexShape ι\nC : HomologicalComplex V c\ninst✝² : HasEqualizers V\ninst✝¹ : HasImages V\ninst✝ : HasImageMaps V\nC₁ C₂ : HomologicalComplex V c\nf : C₁ ⟶ C₂\ni : ι\n⊢ (boundariesMap f i ≫ boundariesToCyc... | [
276,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
1
] |
Mathlib/Topology/Algebra/Order/ExtendFrom.lean | continuousOn_Ioc_extendFrom_Ioo | [
{
"state_after": "α : Type u_1\nβ : Type u_2\ninst✝⁵ : TopologicalSpace α\ninst✝⁴ : LinearOrder α\ninst✝³ : DenselyOrdered α\ninst✝² : OrderTopology α\ninst✝¹ : TopologicalSpace β\ninst✝ : RegularSpace β\nf : α → β\na b : α\nlb : β\nhab : a < b\nhf : ContinuousOn f (Ioo a b)\nhb : Tendsto f (𝓝[Iio b] b) (𝓝 lb... | [
74,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Mathlib/Logic/Relation.lean | Relation.ReflTransGen.lift | [] | [
529,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
527,
1
] |
Mathlib/Combinatorics/Hindman.lean | Hindman.exists_FP_of_finite_cover | [] | [
240,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/Algebra/Algebra/Pi.lean | Pi.algebraMap_apply | [] | [
58,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
56,
1
] |
Mathlib/Data/Set/Function.lean | Set.piecewise_univ | [
{
"state_after": "case h\nα : Type u_1\nβ : Type ?u.72334\nγ : Type ?u.72337\nι : Sort ?u.72340\nπ : α → Type ?u.72345\nδ : α → Sort u_2\ns : Set α\nf g : (i : α) → δ i\ninst✝ : (i : α) → Decidable (i ∈ univ)\ni : α\n⊢ piecewise univ f g i = f i",
"state_before": "α : Type u_1\nβ : Type ?u.72334\nγ : Type ?... | [
1359,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1356,
1
] |
Mathlib/GroupTheory/FreeAbelianGroup.lean | FreeAbelianGroup.map_add | [] | [
219,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
217,
11
] |
Mathlib/Algebra/Homology/Single.lean | ChainComplex.single₀_obj_X_succ | [] | [
155,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Data/Part.lean | Part.coe_some | [] | [
364,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
363,
1
] |
Mathlib/Topology/Algebra/OpenSubgroup.lean | Subgroup.isOpen_of_one_mem_interior | [] | [
340,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/Data/Num/Lemmas.lean | Num.ofNat'_zero | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.179471\n⊢ ofNat' 0 = 0",
"tactic": "simp [Num.ofNat']"
}
] | [
238,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
238,
1
] |
Mathlib/MeasureTheory/Integral/Bochner.lean | MeasureTheory.integral_nonpos_of_ae | [
{
"state_after": "α : Type u_1\nE : Type ?u.1098396\nF : Type ?u.1098399\n𝕜 : Type ?u.1098402\ninst✝¹⁰ : NormedAddCommGroup E\ninst✝⁹ : NormedSpace ℝ E\ninst✝⁸ : CompleteSpace E\ninst✝⁷ : NontriviallyNormedField 𝕜\ninst✝⁶ : NormedSpace 𝕜 E\ninst✝⁵ : SMulCommClass ℝ 𝕜 E\ninst✝⁴ : NormedAddCommGroup F\ninst✝³... | [
1215,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1212,
1
] |
Mathlib/Data/Real/NNReal.lean | NNReal.sup_mul | [] | [
562,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
561,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.