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/Data/Matrix/Block.lean | Matrix.blockDiagonal'_sub | [] | [
751,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
749,
1
] |
Mathlib/MeasureTheory/Measure/NullMeasurable.lean | MeasureTheory.NullMeasurableSet.iUnion | [] | [
151,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
11
] |
Mathlib/Topology/MetricSpace/Basic.lean | nndist_eq_zero | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.551874\nι : Type ?u.551877\ninst✝¹ : PseudoMetricSpace α\nγ : Type w\ninst✝ : MetricSpace γ\nx y : γ\n⊢ nndist x y = 0 ↔ x = y",
"tactic": "simp only [← NNReal.eq_iff, ← dist_nndist, imp_self, NNReal.coe_zero, dist_eq_zero... | [
2885,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2884,
1
] |
Mathlib/Data/Set/Pairwise/Basic.lean | Set.pairwise_singleton | [] | [
93,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Data/Nat/Lattice.lean | Set.biInter_lt_succ' | [] | [
218,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
217,
1
] |
Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean | ProjectiveSpectrum.isClosed_zeroLocus | [
{
"state_after": "R : Type u_2\nA : Type u_1\ninst✝³ : CommSemiring R\ninst✝² : CommRing A\ninst✝¹ : Algebra R A\n𝒜 : ℕ → Submodule R A\ninst✝ : GradedAlgebra 𝒜\ns : Set A\n⊢ ∃ s_1, zeroLocus 𝒜 s = zeroLocus 𝒜 s_1",
"state_before": "R : Type u_2\nA : Type u_1\ninst✝³ : CommSemiring R\ninst✝² : CommRing ... | [
360,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
358,
1
] |
Mathlib/MeasureTheory/Function/Egorov.lean | MeasureTheory.tendstoUniformlyOn_of_ae_tendsto | [] | [
212,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.Prime.mul_eq_prime_sq_iff | [
{
"state_after": "x y p : ℕ\nhp : Prime p\nhx : x ≠ 1\nhy : y ≠ 1\nh : x * y = p ^ 2\n⊢ x = p ∧ y = p",
"state_before": "x y p : ℕ\nhp : Prime p\nhx : x ≠ 1\nhy : y ≠ 1\n⊢ x * y = p ^ 2 ↔ x = p ∧ y = p",
"tactic": "refine' ⟨fun h => _, fun ⟨h₁, h₂⟩ => h₁.symm ▸ h₂.symm ▸ (sq _).symm⟩"
},
{
"stat... | [
658,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
634,
1
] |
Std/Data/Int/DivMod.lean | Int.ediv_one | [] | [
131,
48
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
129,
9
] |
Mathlib/Analysis/Convex/Cone/Basic.lean | ConvexCone.comap_comap | [] | [
303,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/Analysis/NormedSpace/Exponential.lean | exp_add_of_commute | [] | [
463,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
461,
1
] |
Mathlib/RingTheory/FinitePresentation.lean | Algebra.FinitePresentation.self | [] | [
118,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
116,
1
] |
Mathlib/CategoryTheory/Closed/Monoidal.lean | CategoryTheory.MonoidalClosed.pre_comm_ihom_map | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝⁵ : Category C\ninst✝⁴ : MonoidalCategory C\nA B X✝ X' Y✝ Y' Z✝ : C\ninst✝³ : Closed A\ninst✝² : Closed B\nW X Y Z : C\ninst✝¹ : Closed W\ninst✝ : Closed X\nf : W ⟶ X\ng : Y ⟶ Z\n⊢ (pre f).app Y ≫ (ihom W).map g = (ihom X).map g ≫ (pre f).app Z"... | [
288,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
287,
1
] |
Mathlib/Data/Num/Lemmas.lean | ZNum.cmp_to_int | [
{
"state_after": "α : Type ?u.968134\na b : PosNum\nthis : Ordering.casesOn (PosNum.cmp a b) (↑a < ↑b) (a = b) (↑b < ↑a)\n⊢ Ordering.casesOn (cmp (pos a) (pos b)) (↑(pos a) < ↑(pos b)) (pos a = pos b) (↑(pos b) < ↑(pos a))",
"state_before": "α : Type ?u.968134\na b : PosNum\n⊢ Ordering.casesOn (cmp (pos a) ... | [
1389,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1376,
1
] |
Mathlib/Topology/UniformSpace/Cauchy.lean | Cauchy.ultrafilter_of | [
{
"state_after": "α : Type u\nβ : Type v\ninst✝ : UniformSpace α\nl : Filter α\nh : Cauchy l\nthis : NeBot l\n⊢ Cauchy ↑(Ultrafilter.of l)",
"state_before": "α : Type u\nβ : Type v\ninst✝ : UniformSpace α\nl : Filter α\nh : Cauchy l\n⊢ Cauchy ↑(Ultrafilter.of l)",
"tactic": "haveI := h.1"
},
{
"... | [
64,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/Order/LocallyFinite.lean | Finset.map_subtype_embedding_Ici | [
{
"state_after": "α : Type u_1\nβ : Type ?u.223222\ninst✝² : Preorder α\np : α → Prop\ninst✝¹ : DecidablePred p\ninst✝ : LocallyFiniteOrderTop α\na : Subtype p\nhp : ∀ ⦃a x : α⦄, a ≤ x → p a → p x\n⊢ map (Embedding.subtype p) (Finset.subtype p (Ici ↑a)) = Ici ↑a",
"state_before": "α : Type u_1\nβ : Type ?u.... | [
1331,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1329,
1
] |
Mathlib/Data/List/Perm.lean | List.Perm.bagInter | [] | [
858,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
856,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.singleton_mul | [] | [
404,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
403,
1
] |
Mathlib/Computability/Primrec.lean | Primrec₂.ofNat_iff | [
{
"state_after": "no goals",
"state_before": "α✝ : Type ?u.68744\nβ✝ : Type ?u.68747\nσ✝ : Type ?u.68750\ninst✝⁵ : Primcodable α✝\ninst✝⁴ : Primcodable β✝\ninst✝³ : Primcodable σ✝\nα : Type u_1\nβ : Type u_2\nσ : Type u_3\ninst✝² : Denumerable α\ninst✝¹ : Denumerable β\ninst✝ : Primcodable σ\nf : α → β → σ\... | [
458,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
456,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.image_div_prod | [] | [
547,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
546,
1
] |
Mathlib/Algebra/GroupPower/Ring.lean | sq_eq_one_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nS : Type ?u.125015\nM : Type ?u.125018\ninst✝¹ : Ring R\na b : R\ninst✝ : NoZeroDivisors R\n⊢ a ^ 2 = 1 ↔ a = 1 ∨ a = -1",
"tactic": "rw [← (Commute.one_right a).sq_eq_sq_iff_eq_or_eq_neg, one_pow]"
}
] | [
263,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
262,
1
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | intervalIntegral.integral_comp_div | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.14843380\n𝕜 : Type ?u.14843383\nE : Type u_1\nF : Type ?u.14843389\nA : Type ?u.14843392\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\ninst✝ : NormedSpace ℝ E\na b c d : ℝ\nf : ℝ → E\nhc : c ≠ 0\n⊢ (∫ (x : ℝ) in a..b, f (x / c)) = c • ∫ ... | [
727,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
726,
1
] |
Mathlib/Analysis/Normed/Group/HomCompletion.lean | NormedAddGroupHom.extension_def | [] | [
217,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
1
] |
Mathlib/Algebra/MonoidAlgebra/Degree.lean | AddMonoidAlgebra.sup_support_pow_le | [
{
"state_after": "R : Type u_3\nA : Type u_2\nT : Type ?u.47893\nB : Type u_1\nι : Type ?u.47899\ninst✝¹¹ : SemilatticeSup B\ninst✝¹⁰ : OrderBot B\ninst✝⁹ : SemilatticeInf T\ninst✝⁸ : OrderTop T\ninst✝⁷ : Semiring R\ninst✝⁶ : AddMonoid A\ninst✝⁵ : AddMonoid B\ninst✝⁴ : CovariantClass B B (fun x x_1 => x + x_1) ... | [
122,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Mathlib/Algebra/Homology/Augment.lean | ChainComplex.augmentTruncate_inv_f_zero | [] | [
183,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
181,
1
] |
Mathlib/CategoryTheory/Limits/Types.lean | CategoryTheory.Limits.Types.FilteredColimit.rel_eq_eqvGen_quot_rel | [
{
"state_after": "case h.mk.h.mk.a\nJ : Type v\ninst✝¹ : SmallCategory J\nF : J ⥤ TypeMax\ninst✝ : IsFilteredOrEmpty J\nj : J\nx : F.obj j\nj' : J\ny : F.obj j'\n⊢ FilteredColimit.Rel F { fst := j, snd := x } { fst := j', snd := y } ↔\n EqvGen (Quot.Rel F) { fst := j, snd := x } { fst := j', snd := y }",
... | [
470,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
464,
11
] |
Mathlib/Data/List/Chain.lean | List.chain'_nil | [] | [
194,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Std/Data/List/Lemmas.lean | List.getLastD_cons | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\na b : α\nl : List α\n⊢ getLastD (b :: l) a = getLastD l b",
"tactic": "cases l <;> rfl"
}
] | [
462,
98
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
462,
9
] |
Mathlib/Topology/MetricSpace/Basic.lean | nndist_triangle | [] | [
390,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
389,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.toReal_ofNat | [] | [
710,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
708,
9
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.dart_fst_mem_support_of_mem_darts | [
{
"state_after": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nu v v✝ : V\nh : Adj G u v✝\np' : Walk G v✝ v\nd : Dart G\nhd : d = { toProd := (u, v✝), is_adj := h } ∨ d ∈ darts p'\n⊢ d.fst = u ∨ d.fst ∈ support p'",
"state_before": "V : Type u\nV' : T... | [
790,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
784,
1
] |
Mathlib/Data/Multiset/Powerset.lean | Multiset.powersetAux'_nil | [] | [
55,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
1
] |
Mathlib/MeasureTheory/Function/LocallyIntegrable.lean | MeasureTheory.IntegrableOn.mul_continuousOn_of_subset | [
{
"state_after": "case intro\nX : Type u_1\nY : Type ?u.2476922\nE : Type ?u.2476925\nR : Type u_2\ninst✝⁷ : MeasurableSpace X\ninst✝⁶ : TopologicalSpace X\ninst✝⁵ : MeasurableSpace Y\ninst✝⁴ : TopologicalSpace Y\ninst✝³ : NormedAddCommGroup E\nf : X → E\nμ : Measure X\ns : Set X\ninst✝² : OpensMeasurableSpace ... | [
396,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
385,
1
] |
Mathlib/Data/Nat/Order/Basic.lean | Nat.eq_one_of_mul_eq_one_right | [] | [
155,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Data/Fintype/Basic.lean | Set.disjoint_toFinset | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.86017\nγ : Type ?u.86020\ns t : Set α\ninst✝¹ : Fintype ↑s\ninst✝ : Fintype ↑t\n⊢ Disjoint (toFinset s) (toFinset t) ↔ Disjoint s t",
"tactic": "simp only [← disjoint_coe, coe_toFinset]"
}
] | [
689,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
688,
1
] |
Mathlib/NumberTheory/Divisors.lean | Nat.divisors_subset_properDivisors | [
{
"state_after": "n m : ℕ\nhzero : n ≠ 0\nh : m ∣ n\nhdiff : m ≠ n\n⊢ ∀ ⦃x : ℕ⦄, x ∈ divisors m → x ∈ properDivisors n",
"state_before": "n m : ℕ\nhzero : n ≠ 0\nh : m ∣ n\nhdiff : m ≠ n\n⊢ divisors m ⊆ properDivisors n",
"tactic": "apply Finset.subset_iff.2"
},
{
"state_after": "n m : ℕ\nhzero ... | [
157,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_filter_of_ne | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.334765\nβ : Type u\nα : Type v\nγ : Type w\ns s₁ s₂ : Finset α\na : α\nf g : α → β\ninst✝¹ : CommMonoid β\np : α → Prop\ninst✝ : DecidablePred p\nhp : ∀ (x : α), x ∈ s → f x ≠ 1 → p x\nx : α\n⊢ x ∈ s → ¬x ∈ filter p s → f x = 1",
"tactic": "class... | [
760,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
755,
1
] |
Mathlib/Init/Data/Fin/Basic.lean | Fin.veq_of_eq | [] | [
18,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
17,
1
] |
Mathlib/LinearAlgebra/Matrix/Basis.lean | basis_toMatrix_mul_linearMap_toMatrix_mul_basis_toMatrix | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nι' : Type u_2\nκ : Type u_3\nκ' : Type u_5\nR : Type u_4\nM : Type u_7\ninst✝¹³ : CommSemiring R\ninst✝¹² : AddCommMonoid M\ninst✝¹¹ : Module R M\nR₂ : Type ?u.410998\nM₂ : Type ?u.411001\ninst✝¹⁰ : CommRing R₂\ninst✝⁹ : AddCommGroup M₂\ninst✝⁸ : M... | [
200,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/Topology/Separation.lean | Set.Finite.isClosed | [
{
"state_after": "α : Type u\nβ : Type v\ninst✝¹ : TopologicalSpace α\ninst✝ : T1Space α\ns : Set α\nhs : Set.Finite s\n⊢ IsClosed (⋃ (x : α) (_ : x ∈ s), {x})",
"state_before": "α : Type u\nβ : Type v\ninst✝¹ : TopologicalSpace α\ninst✝ : T1Space α\ns : Set α\nhs : Set.Finite s\n⊢ IsClosed s",
"tactic"... | [
416,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
414,
11
] |
Mathlib/LinearAlgebra/StdBasis.lean | Pi.linearIndependent_stdBasis | [
{
"state_after": "R : Type u_1\nη : Type u_3\nιs : η → Type u_4\nMs : η → Type u_2\ninst✝³ : Ring R\ninst✝² : (i : η) → AddCommGroup (Ms i)\ninst✝¹ : (i : η) → Module R (Ms i)\ninst✝ : DecidableEq η\nv : (j : η) → ιs j → Ms j\nhs : ∀ (i : η), LinearIndependent R (v i)\nhs' : ∀ (j : η), LinearIndependent R fun i... | [
206,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | hasSum_iff_hasSum_of_ne_zero_bij | [] | [
250,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
242,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Basic.lean | Real.log_nonneg | [] | [
192,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
191,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.prod_span_singleton | [] | [
617,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
615,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.support_monomial' | [
{
"state_after": "R : Type u\na✝ b : R\nm n✝ : ℕ\ninst✝ : Semiring R\np q : R[X]\nn : ℕ\na : R\n⊢ (match { toFinsupp := Finsupp.single n a } with\n | { toFinsupp := p } => p.support) ⊆\n {n}",
"state_before": "R : Type u\na✝ b : R\nm n✝ : ℕ\ninst✝ : Semiring R\np q : R[X]\nn : ℕ\na : R\n⊢ support (↑(m... | [
841,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
839,
1
] |
Mathlib/Deprecated/Subfield.lean | Field.subset_closure | [] | [
133,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
132,
1
] |
Mathlib/Order/Minimal.lean | minimals_union | [] | [
157,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/GroupTheory/FreeAbelianGroup.lean | FreeAbelianGroup.map_comp_apply | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nf : α → β\ng : β → γ\nx : FreeAbelianGroup α\n⊢ ↑(AddMonoidHom.comp (map g) (map f)) x = ↑(map g) (↑(map f) x)",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nf : α → β\ng : β → γ\nx : FreeAbelianGroup α\n⊢ ↑(map (g ∘ f)) x = ↑(map g) (↑(map f) x)... | [
391,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
388,
1
] |
Mathlib/Topology/Homotopy/Basic.lean | ContinuousMap.Homotopic.symm | [] | [
366,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
365,
1
] |
Mathlib/Probability/Independence/Basic.lean | ProbabilityTheory.indepSet_empty_left | [] | [
179,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
178,
1
] |
Mathlib/Analysis/Calculus/Deriv/Slope.lean | HasDerivWithinAt.liminf_right_norm_slope_le | [] | [
163,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.nnnorm_coe_le_nnnorm | [] | [
1007,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1006,
1
] |
Mathlib/GroupTheory/GroupAction/Quotient.lean | MulAction.injective_ofQuotientStabilizer | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² inst✝¹ : Group α\ninst✝ : MulAction α β\nx : β\ny₁ y₂ : α ⧸ stabilizer α x\ng₁ g₂ : α\nH : g₁ • x = g₂ • x\n⊢ g₁⁻¹ * g₂ ∈ stabilizer α x",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² inst✝¹ : Group α\ninst✝ : MulAction α β\nx : β\n... | [
190,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Algebra/Bounds.lean | bddBelow_inv | [] | [
42,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
41,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Independent.lean | sign_eq_of_affineCombination_mem_affineSpan_single_lineMap | [
{
"state_after": "no goals",
"state_before": "k : Type u_1\nV : Type u_2\nP : Type u_3\ninst✝³ : LinearOrderedRing k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\nι : Type u_4\np : ι → P\nh : AffineIndependent k p\nw : ι → k\ns : Finset ι\nhw : ∑ i in s, w i = 1\ni₁ i₂ i₃ : ι\nh₁ :... | [
768,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
751,
1
] |
Mathlib/RingTheory/DedekindDomain/Ideal.lean | IsDedekindDomain.exists_forall_sub_mem_ideal | [
{
"state_after": "case intro\nR : Type u_2\nA : Type ?u.1320972\nK : Type ?u.1320975\ninst✝⁵ : CommRing R\ninst✝⁴ : CommRing A\ninst✝³ : Field K\ninst✝² : IsDomain A\ninst✝¹ : IsDomain R\ninst✝ : IsDedekindDomain R\nι : Type u_1\ns : Finset ι\nP : ι → Ideal R\ne : ι → ℕ\nprime : ∀ (i : ι), i ∈ s → Prime (P i)\n... | [
1396,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1389,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.nontrivial_span_singleton | [
{
"state_after": "R : Type u_2\nR₂ : Type ?u.114155\nK : Type ?u.114158\nM : Type u_1\nM₂ : Type ?u.114164\nV : Type ?u.114167\nS : Type ?u.114170\ninst✝⁵ : Semiring R\ninst✝⁴ : AddCommMonoid M\ninst✝³ : Module R M\nx✝ : M\np p' : Submodule R M\ninst✝² : Semiring R₂\nσ₁₂ : R →+* R₂\ninst✝¹ : AddCommMonoid M₂\ni... | [
398,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
393,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Tagged.lean | BoxIntegral.TaggedPrepartition.disjUnion_boxes | [] | [
358,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
357,
1
] |
Mathlib/GroupTheory/Perm/Basic.lean | Equiv.Perm.sigmaCongrRight_inv | [] | [
249,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
247,
1
] |
Mathlib/GroupTheory/OrderOfElement.lean | orderOf_ofAdd_eq_addOrderOf | [] | [
147,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/Analysis/LocallyConvex/BalancedCoreHull.lean | mem_balancedCoreAux_iff | [] | [
108,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Logic/Relation.lean | Relation.refl_trans_gen_idem | [] | [
558,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
557,
1
] |
Mathlib/Algebra/Order/Sub/Canonical.lean | AddLECancellable.lt_tsub_iff_left_of_le | [
{
"state_after": "α : Type u_1\ninst✝⁵ : AddCommSemigroup α\ninst✝⁴ : PartialOrder α\ninst✝³ : ExistsAddOfLE α\ninst✝² : CovariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1\ninst✝¹ : Sub α\ninst✝ : OrderedSub α\na b c d : α\nhc : AddLECancellable c\nh : c ≤ b\n⊢ a < b - c ↔ a + c < b",
"state_bef... | [
152,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
11
] |
Std/Data/Int/Lemmas.lean | Int.add_le_add_right | [] | [
758,
64
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
757,
11
] |
Mathlib/RingTheory/TensorProduct.lean | Algebra.TensorProduct.algEquivOfLinearEquivTensorProduct_apply | [] | [
710,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
708,
1
] |
Mathlib/Order/PrimeIdeal.lean | Order.Ideal.isPrime_of_mem_or_compl_mem | [
{
"state_after": "P : Type u_1\ninst✝¹ : BooleanAlgebra P\nx : P\nI : Ideal P\ninst✝ : IsProper I\nh : ∀ {x : P}, x ∈ I ∨ xᶜ ∈ I\n⊢ ∀ {x y : P}, x ⊓ y ∈ I → ¬x ∈ I → y ∈ I",
"state_before": "P : Type u_1\ninst✝¹ : BooleanAlgebra P\nx : P\nI : Ideal P\ninst✝ : IsProper I\nh : ∀ {x : P}, x ∈ I ∨ xᶜ ∈ I\n⊢ IsP... | [
193,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
188,
1
] |
Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.extend_apply' | [] | [
383,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
381,
1
] |
Mathlib/Data/Nat/Choose/Factorization.lean | Nat.le_two_mul_of_factorization_centralBinom_pos | [] | [
129,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/Logic/Nontrivial.lean | exists_ne | [
{
"state_after": "α : Type u_1\nβ : Type ?u.349\ninst✝ : Nontrivial α\nx : α\nthis : DecidableEq α := Classical.decEq α\n⊢ ∃ y, y ≠ x",
"state_before": "α : Type u_1\nβ : Type ?u.349\ninst✝ : Nontrivial α\nx : α\n⊢ ∃ y, y ≠ x",
"tactic": "letI := Classical.decEq α"
},
{
"state_after": "no goals"... | [
57,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
56,
1
] |
Mathlib/Topology/DenseEmbedding.lean | DenseInducing.extend_unique | [] | [
193,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
191,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.mem_of_superset | [] | [
154,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/LinearAlgebra/Matrix/BilinearForm.lean | BilinForm.toMatrix_apply | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.1078977\nM : Type ?u.1078980\ninst✝¹⁷ : Semiring R\ninst✝¹⁶ : AddCommMonoid M\ninst✝¹⁵ : Module R M\nR₁ : Type ?u.1079016\nM₁ : Type ?u.1079019\ninst✝¹⁴ : Ring R₁\ninst✝¹³ : AddCommGroup M₁\ninst✝¹² : Module R₁ M₁\nR₂ : Type u_1\nM₂ : Type u_2\ninst✝... | [
308,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
305,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.tendsto_measure_iUnion | [
{
"state_after": "α : Type u_2\nβ : Type ?u.56609\nγ : Type ?u.56612\nδ : Type ?u.56615\nι : Type u_1\nR : Type ?u.56621\nR' : Type ?u.56624\nm : MeasurableSpace α\nμ μ₁ μ₂ : Measure α\ns✝ s₁ s₂ t : Set α\ninst✝¹ : SemilatticeSup ι\ninst✝ : Countable ι\ns : ι → Set α\nhm : Monotone s\n⊢ Tendsto (↑↑μ ∘ s) atTop ... | [
521,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
518,
1
] |
Mathlib/CategoryTheory/Sites/Sieves.lean | CategoryTheory.Sieve.pullback_eq_top_of_mem | [] | [
486,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
485,
1
] |
Mathlib/GroupTheory/Perm/Support.lean | Equiv.Perm.support_prod_le | [
{
"state_after": "case nil\nα : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf g : Perm α\n⊢ support (List.prod []) ≤ List.foldr (fun x x_1 => x ⊔ x_1) ⊥ (List.map support [])\n\ncase cons\nα : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf g hd : Perm α\ntl : List (Perm α)\nhl : support (List.p... | [
425,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
420,
1
] |
Mathlib/Topology/Basic.lean | interior_singleton | [] | [
1321,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1320,
1
] |
Mathlib/Order/FixedPoints.lean | OrderHom.le_lfp | [] | [
69,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Mathlib/CategoryTheory/Category/KleisliCat.lean | CategoryTheory.KleisliCat.comp_def | [] | [
68,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Submodule.comapSubtypeEquivOfLe_apply_coe | [] | [
2472,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2469,
1
] |
Mathlib/Logic/Function/Basic.lean | Function.injective_of_subsingleton | [] | [
152,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Mathlib/GroupTheory/Submonoid/Basic.lean | Submonoid.closure_induction | [] | [
450,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
448,
1
] |
Mathlib/Data/Multiset/Bind.lean | Multiset.bind_zero | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.11661\nδ : Type ?u.11664\na : α\ns t : Multiset α\nf g : α → Multiset β\n⊢ (bind s fun x => 0) = 0",
"tactic": "simp [bind, join, nsmul_zero]"
}
] | [
123,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/Algebra/Tropical/Basic.lean | Tropical.trop_mul_def | [] | [
397,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
396,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.eventually_iff_exists_mem | [] | [
1117,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1115,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.eventually_atBot | [] | [
182,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/Order/Filter/Prod.lean | Filter.prod_comm | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.14817\nδ : Type ?u.14820\nι : Sort ?u.14823\ns : Set α\nt : Set β\nf : Filter α\ng : Filter β\n⊢ Prod.swap <$> (g ×ˢ f) = map (fun p => (p.snd, p.fst)) (g ×ˢ f)",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.14817\nδ : Type ?u.14820\nι : ... | [
256,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Mathlib/NumberTheory/PellMatiyasevic.lean | Pell.pell_eqz | [] | [
239,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
238,
1
] |
Mathlib/Data/Set/Finite.lean | Set.Infinite.exists_subset_card_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\nγ : Type x\ns : Set α\nhs : Set.Infinite s\nn : ℕ\n⊢ ↑(Finset.map (Embedding.subtype fun x => x ∈ s) (Finset.map (natEmbedding s hs) (Finset.range n))) ⊆ s ∧\n Finset.card (Finset.map (Embedding.subtype fun x => x ∈ s) (Fin... | [
1296,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1294,
1
] |
Mathlib/Computability/TMToPartrec.lean | Turing.PartrecToTM2.contSupp_cons₂ | [] | [
1876,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1874,
1
] |
Std/Data/String/Lemmas.lean | String.Pos.zero_addChar_byteIdx | [
{
"state_after": "no goals",
"state_before": "c : Char\n⊢ (0 + c).byteIdx = csize c",
"tactic": "simp only [addChar_byteIdx, byteIdx_zero, Nat.zero_add]"
}
] | [
110,
58
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
109,
1
] |
Mathlib/Order/WithBot.lean | WithTop.some_eq_coe | [] | [
601,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
600,
1
] |
Mathlib/CategoryTheory/Idempotents/Karoubi.lean | CategoryTheory.Idempotents.Karoubi.decompId_i_naturality | [
{
"state_after": "no goals",
"state_before": "C : Type ?u.50202\ninst✝ : Category C\nP Q : Karoubi C\nf : P ⟶ Q\n⊢ mk P.X (𝟙 P.X) ⟶ mk Q.X (𝟙 Q.X)",
"tactic": "exact Hom.mk f.f (by simp)"
},
{
"state_after": "no goals",
"state_before": "C : Type ?u.50202\ninst✝ : Category C\nP Q : Karoubi ... | [
297,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
295,
1
] |
Mathlib/Computability/TuringMachine.lean | Turing.ListBlank.nth_modifyNth | [
{
"state_after": "case zero\nΓ : Type u_1\ninst✝ : Inhabited Γ\nf : Γ → Γ\ni✝ : ℕ\nL✝ : ListBlank Γ\ni : ℕ\nL : ListBlank Γ\n⊢ nth (modifyNth f Nat.zero L) i = if i = Nat.zero then f (nth L i) else nth L i\n\ncase succ\nΓ : Type u_1\ninst✝ : Inhabited Γ\nf : Γ → Γ\ni✝ : ℕ\nL✝ : ListBlank Γ\nn : ℕ\nIH : ∀ (i : ℕ... | [
348,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
340,
1
] |
Mathlib/Init/CcLemmas.lean | or_eq_of_eq_true_right | [] | [
40,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
39,
1
] |
Mathlib/Algebra/Ring/Divisibility.lean | dvd_neg | [
{
"state_after": "α : Type u_1\nβ : Type ?u.2595\ninst✝¹ : Semigroup α\ninst✝ : HasDistribNeg α\na b c : α\n⊢ (∃ b_1, b = a * b_1) ↔ a ∣ b",
"state_before": "α : Type u_1\nβ : Type ?u.2595\ninst✝¹ : Semigroup α\ninst✝ : HasDistribNeg α\na b c : α\n⊢ (∃ b_1, -b = a * ↑(Equiv.neg α).symm b_1) ↔ a ∣ b",
"t... | [
61,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/RingTheory/AlgebraicIndependent.lean | AlgebraicIndependent.map' | [] | [
160,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
159,
1
] |
Mathlib/Algebra/Order/Floor.lean | Nat.preimage_Iio | [
{
"state_after": "case h\nF : Type ?u.75344\nα : Type u_1\nβ : Type ?u.75350\ninst✝¹ : LinearOrderedSemiring α\ninst✝ : FloorSemiring α\na✝ : α\nn : ℕ\na : α\nx✝ : ℕ\n⊢ x✝ ∈ Nat.cast ⁻¹' Iio a ↔ x✝ ∈ Iio ⌈a⌉₊",
"state_before": "F : Type ?u.75344\nα : Type u_1\nβ : Type ?u.75350\ninst✝¹ : LinearOrderedSemiri... | [
428,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
426,
1
] |
Mathlib/Data/Complex/Exponential.lean | Complex.sinh_two_mul | [
{
"state_after": "x y : ℂ\n⊢ sinh x * cosh x + cosh x * sinh x = 2 * sinh x * cosh x",
"state_before": "x y : ℂ\n⊢ sinh (2 * x) = 2 * sinh x * cosh x",
"tactic": "rw [two_mul, sinh_add]"
},
{
"state_after": "no goals",
"state_before": "x y : ℂ\n⊢ sinh x * cosh x + cosh x * sinh x = 2 * sinh ... | [
774,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
772,
1
] |
Mathlib/Data/Erased.lean | Erased.out_mk | [
{
"state_after": "α : Sort u_1\na : α\nh : ∃ a_1, (fun b => a_1 = b) = (mk a).fst := (mk a).snd\n⊢ out (mk a) = a",
"state_before": "α : Sort u_1\na : α\n⊢ out (mk a) = a",
"tactic": "let h := (mk a).2"
},
{
"state_after": "α : Sort u_1\na : α\nh : ∃ a_1, (fun b => a_1 = b) = (mk a).fst := (mk a... | [
63,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/Data/Finset/Sups.lean | Finset.forall_infs_iff | [] | [
283,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.