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/Order/Filter/Prod.lean | Filter.mem_prod_top | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.3562\nδ : Type ?u.3565\nι : Sort ?u.3568\ns✝ : Set α\nt : Set β\nf✝ : Filter α\ng : Filter β\nf : Filter α\ns : Set (α × β)\n⊢ {a | ∀ (b : β), b ∈ univ → (a, b) ∈ s} ∈ f ↔ {a | ∀ (b : β), (a, b) ∈ s} ∈ f",
"state_before": "α : Type u_1\nβ : Type u_2\... | [
103,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Data/Real/CauSeqCompletion.lean | CauSeq.le_lim | [] | [
454,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
453,
1
] |
Mathlib/Topology/MetricSpace/Isometry.lean | IsometryEquiv.symm_trans_apply | [] | [
466,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
464,
1
] |
Mathlib/CategoryTheory/Preadditive/Biproducts.lean | CategoryTheory.Biproduct.column_nonzero_of_iso' | [
{
"state_after": "case intro\nC : Type u\ninst✝⁵ : Category C\ninst✝⁴ : Preadditive C\nσ τ : Type\ninst✝³ : Finite τ\nS : σ → C\ninst✝² : HasBiproduct S\nT : τ → C\ninst✝¹ : HasBiproduct T\ns : σ\nf : ⨁ S ⟶ ⨁ T\ninst✝ : IsIso f\nval✝ : Fintype τ\n⊢ (∀ (t : τ), biproduct.ι S s ≫ f ≫ biproduct.π T t = 0) → 𝟙 (S ... | [
860,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
837,
1
] |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean | SimpleGraph.isAcyclic_iff_forall_adj_isBridge | [
{
"state_after": "V : Type u\nG : SimpleGraph V\n⊢ IsAcyclic G ↔\n ∀ ⦃v w : V⦄,\n Adj G v w →\n Adj G v w ∧ ∀ ⦃u : V⦄ (p : Walk G u u), Walk.IsCycle p → ¬Quotient.mk (Sym2.Rel.setoid V) (v, w) ∈ Walk.edges p",
"state_before": "V : Type u\nG : SimpleGraph V\n⊢ IsAcyclic G ↔ ∀ ⦃v w : V⦄, Adj G ... | [
78,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/Algebra/Module/Equiv.lean | LinearEquiv.symm_comp_eq | [] | [
427,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
426,
1
] |
Mathlib/LinearAlgebra/BilinearForm.lean | BilinForm.linearIndependent_of_iIsOrtho | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.787806\nM : Type ?u.787809\ninst✝²² : Semiring R\ninst✝²¹ : AddCommMonoid M\ninst✝²⁰ : Module R M\nR₁ : Type ?u.787845\nM₁ : Type ?u.787848\ninst✝¹⁹ : Ring R₁\ninst✝¹⁸ : AddCommGroup M₁\ninst✝¹⁷ : Module R₁ M₁\nR₂ : Type ?u.788457\nM₂ : Type ?u.78846... | [
823,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
812,
1
] |
Mathlib/Algebra/Order/Group/Abs.lean | abs_of_neg | [] | [
123,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/NumberTheory/Padics/PadicNumbers.lean | Padic.const_equiv | [
{
"state_after": "no goals",
"state_before": "p : ℕ\ninst✝ : Fact (Nat.Prime p)\nq r : ℚ\nheq : q = r\n⊢ const (padicNorm p) q ≈ const (padicNorm p) r",
"tactic": "rw [heq]"
}
] | [
525,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
523,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Dense.exists_dist_lt | [
{
"state_after": "α : Type u\nβ : Type v\nX : Type ?u.155993\nι : Type ?u.155996\ninst✝ : PseudoMetricSpace α\nx✝ y z : α\nδ ε✝ ε₁ ε₂ : ℝ\ns✝ s : Set α\nhs : Dense s\nx : α\nε : ℝ\nhε : 0 < ε\nthis : Set.Nonempty (ball x ε)\n⊢ ∃ y, y ∈ s ∧ dist x y < ε",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.... | [
1135,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1132,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/WideEqualizers.lean | CategoryTheory.Limits.Cocone.ofCotrident_ι | [
{
"state_after": "no goals",
"state_before": "J : Type w\nC : Type u\ninst✝ : Category C\nX Y : C\nf : J → (X ⟶ Y)\nF : WalkingParallelFamily J ⥤ C\nt : Cotrident fun j => F.map (line j)\nj : WalkingParallelFamily J\n⊢ F.obj j = (parallelFamily fun j => F.map (line j)).obj j",
"tactic": "cases j <;> aes... | [
475,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
472,
1
] |
Mathlib/Algebra/Order/AbsoluteValue.lean | IsAbsoluteValue.abv_inv | [] | [
474,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
473,
1
] |
Mathlib/NumberTheory/Divisors.lean | Nat.pos_of_mem_properDivisors | [] | [
194,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Algebra/BigOperators/Order.lean | GCongr.prod_lt_prod_of_nonempty' | [] | [
469,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
467,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_const | [] | [
1441,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1440,
1
] |
Mathlib/Analysis/Calculus/Deriv/Basic.lean | HasFDerivWithinAt.hasDerivWithinAt | [] | [
185,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/Algebra/Associated.lean | MulEquiv.prime_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.25765\nδ : Type ?u.25768\ninst✝³ : CommMonoidWithZero α\ninst✝² : CommMonoidWithZero β\nF : Type ?u.25777\nG : Type ?u.25780\ninst✝¹ : MonoidWithZeroHomClass F α β\ninst✝ : MulHomClass G β α\nf : F\ng : G\np : α\ne : α ≃* ... | [
94,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Analysis/Calculus/Deriv/Add.lean | HasStrictDerivAt.add_const | [] | [
89,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Algebra/GroupPower/Ring.lean | zero_pow' | [
{
"state_after": "R : Type ?u.3804\nS : Type ?u.3807\nM : Type u_1\ninst✝ : MonoidWithZero M\nk : ℕ\nx✝ : k + 1 ≠ 0\n⊢ 0 * 0 ^ k = 0",
"state_before": "R : Type ?u.3804\nS : Type ?u.3807\nM : Type u_1\ninst✝ : MonoidWithZero M\nk : ℕ\nx✝ : k + 1 ≠ 0\n⊢ 0 ^ (k + 1) = 0",
"tactic": "rw [pow_succ]"
},
... | [
44,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
40,
1
] |
Mathlib/LinearAlgebra/Matrix/Circulant.lean | Matrix.circulant_single_one | [
{
"state_after": "case a.h\nα✝ : Type ?u.41028\nβ : Type ?u.41031\nm : Type ?u.41034\nn✝ : Type ?u.41037\nR : Type ?u.41040\nα : Type u_1\nn : Type u_2\ninst✝³ : Zero α\ninst✝² : One α\ninst✝¹ : DecidableEq n\ninst✝ : AddGroup n\ni j : n\n⊢ circulant (Pi.single 0 1) i j = OfNat.ofNat 1 i j",
"state_before":... | [
170,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
src/lean/Init/Data/List/Basic.lean | List.mem_append_of_mem_right | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nb : α\nbs as : List α\nh : b ∈ bs\n⊢ b ∈ as ++ bs",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nb : α\nbs as : List α\n⊢ b ∈ bs → b ∈ as ++ bs",
"tactic": "intro h"
},
{
"state_after": "no goals",
"state_before": "α : Type u\nβ :... | [
386,
39
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
382,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.moveLeft_neg_symm | [
{
"state_after": "no goals",
"state_before": "x : PGame\ni : RightMoves (-x)\n⊢ moveLeft x (↑toRightMovesNeg.symm i) = -moveRight (-x) i",
"tactic": "simp"
}
] | [
1289,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1288,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | tsum_tsum_eq_single | [] | [
531,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
527,
1
] |
Mathlib/LinearAlgebra/Matrix/Determinant.lean | Matrix.det_updateRow_smul' | [] | [
415,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
413,
1
] |
Mathlib/Data/Set/Prod.lean | Set.eval_image_pi | [] | [
814,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
813,
1
] |
Mathlib/Analysis/Calculus/LHopital.lean | deriv.lhopital_zero_right_on_Ico | [
{
"state_after": "case refine'_1\na b : ℝ\nhab : a < b\nl : Filter ℝ\nf f' g g' : ℝ → ℝ\nhdf : DifferentiableOn ℝ f (Ioo a b)\nhcf : ContinuousOn f (Ico a b)\nhcg : ContinuousOn g (Ico a b)\nhg' : ∀ (x : ℝ), x ∈ Ioo a b → deriv g x ≠ 0\nhfa : f a = 0\nhga : g a = 0\nhdiv : Tendsto (fun x => deriv f x / deriv g ... | [
232,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.comap_hasBasis | [] | [
805,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
803,
1
] |
Mathlib/Data/Set/Image.lean | Function.Injective.preimage_image | [] | [
1287,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1286,
1
] |
Mathlib/Algebra/Category/ModuleCat/Basic.lean | ModuleCat.coe_of | [] | [
201,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
200,
1
] |
Mathlib/Data/Real/Basic.lean | Real.cauchy_natCast | [] | [
193,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/Analysis/Convex/Cone/Basic.lean | ConvexCone.Flat.pointed | [
{
"state_after": "case intro.intro.intro\n𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.77348\nG : Type ?u.77351\ninst✝² : OrderedSemiring 𝕜\ninst✝¹ : AddCommGroup E\ninst✝ : SMul 𝕜 E\nS✝ S : ConvexCone 𝕜 E\nx : E\nhx : x ∈ S\nleft✝ : x ≠ 0\nhxneg : -x ∈ S\n⊢ Pointed S",
"state_before": "𝕜 : Type u_1\nE : Ty... | [
403,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
400,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.dist_lt_iff_of_compact | [
{
"state_after": "case mp\nF : Type ?u.285808\nα : Type u\nβ : Type v\nγ : Type w\ninst✝³ : TopologicalSpace α\ninst✝² : PseudoMetricSpace β\ninst✝¹ : PseudoMetricSpace γ\nf g : α →ᵇ β\nx : α\nC : ℝ\ninst✝ : CompactSpace α\nC0 : 0 < C\n⊢ dist f g < C → ∀ (x : α), dist (↑f x) (↑g x) < C\n\ncase mpr\nF : Type ?u.... | [
211,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
200,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.disjoint_span_singleton | [
{
"state_after": "R : Type ?u.153486\nR₂ : Type ?u.153489\nK✝ : Type ?u.153492\nM : Type ?u.153495\nM₂ : Type ?u.153498\nV : Type ?u.153501\nS : Type ?u.153504\ninst✝⁸ : Semiring R\ninst✝⁷ : AddCommMonoid M\ninst✝⁶ : Module R M\nx✝ : M\np p' : Submodule R M\ninst✝⁵ : Semiring R₂\nσ₁₂ : R →+* R₂\ninst✝⁴ : AddCom... | [
464,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
456,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.sInter_insert | [] | [
1145,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1144,
1
] |
Mathlib/Data/Sum/Order.lean | Sum.Lex.toLex_strictMono | [] | [
402,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
402,
1
] |
Mathlib/Data/Fintype/Card.lean | Fintype.finite | [] | [
408,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
407,
11
] |
Mathlib/Probability/Independence/ZeroOne.lean | ProbabilityTheory.indep_limsup_atBot_self | [
{
"state_after": "Ω : Type u_1\nι : Type u_2\nm m0 : MeasurableSpace Ω\nμ : MeasureTheory.Measure Ω\ninst✝³ : IsProbabilityMeasure μ\ns : ι → MeasurableSpace Ω\ninst✝² : SemilatticeInf ι\ninst✝¹ : NoMinOrder ι\ninst✝ : Nonempty ι\nh_le : ∀ (n : ι), s n ≤ m0\nh_indep : iIndep s\nns : ι → Set ι := Set.Ici\n⊢ Inde... | [
176,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/CategoryTheory/Adjunction/Opposites.lean | CategoryTheory.Adjunction.rightAdjointUniq_hom_app_counit | [
{
"state_after": "case a\nC : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nF : C ⥤ D\nG G' : D ⥤ C\nadj1 : F ⊣ G\nadj2 : F ⊣ G'\nx : D\n⊢ (F.map ((rightAdjointUniq adj1 adj2).hom.app x) ≫ adj2.counit.app x).op = (adj1.counit.app x).op",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nD ... | [
278,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
263,
1
] |
Mathlib/MeasureTheory/Group/Arithmetic.lean | Measurable.mul_const | [] | [
125,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.Iso.card_eq_of_iso | [
{
"state_after": "ι : Sort ?u.637529\n𝕜 : Type ?u.637532\nV : Type u\nW : Type v\nX : Type w\nG : SimpleGraph V\nG' : SimpleGraph W\na b c u v w : V\ne : Sym2 V\nf✝ : G ≃g G'\ninst✝¹ : Fintype V\ninst✝ : Fintype W\nf : G ≃g G'\n⊢ Fintype.card W = Fintype.card W",
"state_before": "ι : Sort ?u.637529\n𝕜 : T... | [
1965,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1962,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.sum_int_mod | [
{
"state_after": "ι : Type ?u.877325\nβ : Type u\nα : Type v\nγ : Type w\ns✝ s₁ s₂ : Finset α\na : α\nf✝ g : α → β\ns : Finset α\nn : ℤ\nf : α → ℤ\n⊢ Multiset.sum (Multiset.map ((fun x => x % n) ∘ fun i => f i) s.val) % n =\n Multiset.sum (Multiset.map (fun i => f i % n) s.val) % n",
"state_before": "ι :... | [
1957,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1955,
1
] |
Std/Data/Nat/Gcd.lean | Nat.lcm_self | [
{
"state_after": "no goals",
"state_before": "m : Nat\n⊢ lcm m m = m",
"tactic": "match eq_zero_or_pos m with\n| .inl h => rw [h, lcm_zero_left]\n| .inr h => simp [lcm, Nat.mul_div_cancel _ h]"
},
{
"state_after": "no goals",
"state_before": "m : Nat\nh : m = 0\n⊢ lcm m m = m",
"tactic":... | [
196,
49
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
193,
9
] |
Mathlib/Analysis/NormedSpace/Exponential.lean | invOf_exp | [] | [
480,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
479,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.integrable_add_measure | [] | [
549,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
547,
1
] |
Mathlib/Data/Set/Basic.lean | Set.nontrivial_mono | [] | [
2601,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2599,
1
] |
Mathlib/MeasureTheory/Measure/GiryMonad.lean | MeasureTheory.Measure.bind_dirac | [
{
"state_after": "case h\nα : Type u_2\nβ : Type u_1\ninst✝¹ : MeasurableSpace α\ninst✝ : MeasurableSpace β\nf : α → Measure β\nhf : Measurable f\na : α\ns : Set β\nhs : MeasurableSet s\n⊢ ↑↑(bind (dirac a) f) s = ↑↑(f a) s",
"state_before": "α : Type u_2\nβ : Type u_1\ninst✝¹ : MeasurableSpace α\ninst✝ : M... | [
202,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
199,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | hasSum_ite_eq | [
{
"state_after": "case h.e'_6\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.41040\nδ : Type ?u.41043\ninst✝² : AddCommMonoid α\ninst✝¹ : TopologicalSpace α\nf g : β → α\na✝ b✝ : α\ns : Finset β\nb : β\ninst✝ : DecidablePred fun x => x = b\na : α\n⊢ a = if b = b then a else 0",
"state_before": "α : Type u_2\nβ : ... | [
211,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
208,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | UniformCauchySeqOn.comp | [
{
"state_after": "α : Type u\nβ : Type v\nγ✝ : Type w\nι : Type x\ninst✝ : UniformSpace β\nF : ι → α → β\nf : α → β\ns s' : Set α\nx : α\np : Filter ι\np' : Filter α\ng✝ : ι → α\nγ : Type u_1\nhf : UniformCauchySeqOnFilter F p (𝓟 s)\ng : γ → α\n⊢ UniformCauchySeqOnFilter (fun n => F n ∘ g) p (𝓟 (g ⁻¹' s))",
... | [
509,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
506,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.list_head? | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.248636\nγ : Type ?u.248639\nσ : Type ?u.248642\ninst✝³ : Primcodable α\ninst✝² : Primcodable β\ninst✝¹ : Primcodable γ\ninst✝ : Primcodable σ\nl : List α\n⊢ (List.casesOn (id l) none fun b l_1 => some (l, b, l_1).snd.fst) = List.head? l... | [
1043,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1041,
1
] |
Mathlib/Data/Set/Basic.lean | Set.mem_univ | [] | [
665,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
664,
1
] |
src/lean/Init/Data/Nat/Linear.lean | Nat.Linear.PolyCnstr.denote_combine | [
{
"state_after": "case mk\nctx : Context\nc₂ : PolyCnstr\nh₂ : denote ctx c₂\neq✝ : Bool\nlhs✝ rhs✝ : Poly\nh₁ : denote ctx { eq := eq✝, lhs := lhs✝, rhs := rhs✝ }\n⊢ denote ctx (combine { eq := eq✝, lhs := lhs✝, rhs := rhs✝ } c₂)",
"state_before": "ctx : Context\nc₁ c₂ : PolyCnstr\nh₁ : denote ctx c₁\nh₂ :... | [
613,
113
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
605,
1
] |
Mathlib/Init/Data/Nat/Bitwise.lean | Nat.bit_zero | [] | [
181,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | InnerProductSpace.Core.cauchy_schwarz_aux | [
{
"state_after": "𝕜 : Type u_1\nE : Type ?u.645181\nF : Type u_2\ninst✝² : IsROrC 𝕜\ninst✝¹ : AddCommGroup F\ninst✝ : Module 𝕜 F\nc : Core 𝕜 F\nx y : F\n⊢ inner (inner x y • x - inner x x • y) (inner x y • x - inner x x • y) =\n ↑(normSq x * (normSq x * normSq y - ‖inner x y‖ ^ 2))",
"state_before": ... | [
327,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
319,
1
] |
Mathlib/LinearAlgebra/QuadraticForm/Basic.lean | QuadraticForm.discr_comp | [
{
"state_after": "no goals",
"state_before": "S : Type ?u.617859\nR : Type ?u.617862\nR₁ : Type u_1\nM : Type ?u.617868\nn : Type w\ninst✝⁵ : Fintype n\ninst✝⁴ : CommRing R₁\ninst✝³ : DecidableEq n\ninst✝² : Invertible 2\nm : Type w\ninst✝¹ : DecidableEq m\ninst✝ : Fintype m\nQ : QuadraticForm R₁ (n → R₁)\n... | [
1041,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1038,
1
] |
Mathlib/GroupTheory/PGroup.lean | IsPGroup.index | [
{
"state_after": "p : ℕ\nG : Type u_1\ninst✝¹ : Group G\nhG : IsPGroup p G\nhp : Fact (Nat.Prime p)\nH : Subgroup G\ninst✝ : Subgroup.FiniteIndex H\nthis : Fintype (G ⧸ Subgroup.normalCore H)\n⊢ ∃ n, Subgroup.index H = p ^ n",
"state_before": "p : ℕ\nG : Type u_1\ninst✝¹ : Group G\nhG : IsPGroup p G\nhp : F... | [
145,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/Algebra/Star/Basic.lean | star_zero | [] | [
280,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.smul_finset_subset_iff₀ | [] | [
2053,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2052,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.star_imK | [] | [
1102,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1102,
9
] |
Mathlib/CategoryTheory/Limits/Shapes/Kernels.lean | CategoryTheory.Limits.CokernelCofork.π_ofπ | [] | [
566,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
564,
1
] |
Mathlib/MeasureTheory/Integral/Bochner.lean | MeasureTheory.L1.SimpleFunc.integral_eq_integral | [] | [
525,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
525,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.rescale_injective | [
{
"state_after": "R : Type u_1\ninst✝¹ : CommRing R\ninst✝ : IsDomain R\na : R\nha : a ≠ 0\np q : PowerSeries R\nh : ↑(rescale a) p = ↑(rescale a) q\n⊢ p = q",
"state_before": "R : Type u_1\ninst✝¹ : CommRing R\ninst✝ : IsDomain R\na : R\nha : a ≠ 0\n⊢ Function.Injective ↑(rescale a)",
"tactic": "intro ... | [
2065,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2057,
1
] |
Mathlib/Combinatorics/Composition.lean | Composition.monotone_sizeUpTo | [] | [
254,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
253,
1
] |
Mathlib/Data/Seq/Computation.lean | Computation.destruct_eq_pure | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ns : Computation α\na : α\n⊢ (match ↑s 0 with\n | none => Sum.inr (tail s)\n | some a => Sum.inl a) =\n Sum.inl a →\n s = pure a",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ns : Computation α\na : α\n⊢ destruct s = Sum.inl a → ... | [
128,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/CategoryTheory/Bicategory/Basic.lean | CategoryTheory.Bicategory.rightUnitor_naturality | [
{
"state_after": "no goals",
"state_before": "B : Type u\ninst✝ : Bicategory B\na b c d e : B\nf g : a ⟶ b\nη : f ⟶ g\n⊢ η ▷ 𝟙 b ≫ (ρ_ g).hom = (ρ_ f).hom ≫ η",
"tactic": "simp"
}
] | [
405,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
404,
1
] |
Mathlib/RingTheory/Polynomial/Content.lean | Polynomial.isUnit_primPart_C | [
{
"state_after": "case pos\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : IsDomain R\ninst✝ : NormalizedGCDMonoid R\nr : R\nh0 : r = 0\n⊢ IsUnit (primPart (↑C r))\n\ncase neg\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : IsDomain R\ninst✝ : NormalizedGCDMonoid R\nr : R\nh0 : ¬r = 0\n⊢ IsUnit (primPart (↑C r))",
... | [
308,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/NumberTheory/Zsqrtd/Basic.lean | Zsqrtd.le_of_le_le | [] | [
741,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
738,
1
] |
Mathlib/Data/List/Zip.lean | List.zipWith_nil_left | [] | [
47,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
47,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.foldr_cons | [] | [
1390,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1389,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.setToFun_add_left' | [
{
"state_after": "case pos\nα : Type u_1\nE : Type u_2\nF : Type u_3\nF' : Type ?u.1352463\nG : Type ?u.1352466\n𝕜 : Type ?u.1352469\np : ℝ≥0∞\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace ℝ E\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace ℝ F\ninst✝³ : NormedAddCommGroup F'\ninst✝² : NormedSpace ... | [
1332,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1326,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.foldr_zero | [] | [
1385,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1384,
1
] |
Mathlib/Order/BoundedOrder.lean | StrictAnti.apply_eq_top_iff | [] | [
204,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/MeasureTheory/Covering/Vitali.lean | Vitali.exists_disjoint_subfamily_covering_enlargment_closedBall | [
{
"state_after": "case inl\nα : Type u_1\nι : Type u_2\ninst✝ : MetricSpace α\nx : ι → α\nr : ι → ℝ\nR : ℝ\nhr : ∀ (a : ι), a ∈ ∅ → r a ≤ R\n⊢ ∃ u x_1,\n (PairwiseDisjoint u fun a => closedBall (x a) (r a)) ∧\n ∀ (a : ι), a ∈ ∅ → ∃ b, b ∈ u ∧ closedBall (x a) (r a) ⊆ closedBall (x b) (5 * r b)\n\ncase i... | [
194,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
165,
1
] |
Mathlib/Data/Polynomial/Eval.lean | Polynomial.eval₂_dvd | [] | [
291,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
290,
1
] |
Mathlib/Topology/Maps.lean | IsClosedMap.id | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.198171\nγ : Type ?u.198174\nδ : Type ?u.198177\ninst✝² : TopologicalSpace α\ninst✝¹ : TopologicalSpace β\ninst✝ : TopologicalSpace γ\ns : Set α\nhs : IsClosed s\n⊢ IsClosed (id '' s)",
"tactic": "rwa [image_id]"
}
] | [
483,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
483,
11
] |
Std/Data/Nat/Lemmas.lean | Nat.mul_div_assoc | [
{
"state_after": "no goals",
"state_before": "k n m : Nat\nH : k ∣ n\n⊢ m * n / k = m * (n / k)",
"tactic": "match Nat.eq_zero_or_pos k with\n| .inl h0 => rw [h0, Nat.div_zero, Nat.div_zero, Nat.mul_zero]\n| .inr hpos =>\n have h1 : m * n / k = m * (n / k * k) / k := by rw [Nat.div_mul_cancel H]\n rw ... | [
744,
56
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
739,
11
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.map_id' | [] | [
1248,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1247,
1
] |
Mathlib/Deprecated/Group.lean | MulEquiv.isMulHom | [] | [
149,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.nat_cast_val | [] | [
260,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
259,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.seq_seq | [
{
"state_after": "case refine'_1\nα : Type u_3\nβ : Type u_1\nγ : Type u_2\nι : Sort ?u.273159\nι' : Sort ?u.273162\nι₂ : Sort ?u.273165\nκ : ι → Sort ?u.273170\nκ₁ : ι → Sort ?u.273175\nκ₂ : ι → Sort ?u.273180\nκ' : ι' → Sort ?u.273185\ns : Set (β → γ)\nt : Set (α → β)\nu : Set α\nc : γ\n⊢ c ∈ seq s (seq t u) ... | [
1984,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1978,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.edgeFinset_deleteEdges | [
{
"state_after": "case a\nι : Sort ?u.165735\n𝕜 : Type ?u.165738\nV : Type u\nW : Type v\nX : Type w\nG : SimpleGraph V\nG' : SimpleGraph W\na b c u v w : V\ne✝ : Sym2 V\ninst✝³ : Fintype (Sym2 V)\ninst✝² : DecidableEq V\ninst✝¹ : DecidableRel G.Adj\ns : Finset (Sym2 V)\ninst✝ : DecidableRel (deleteEdges G ↑s)... | [
1185,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1181,
1
] |
Mathlib/Topology/Order/Basic.lean | closure_Ioo | [
{
"state_after": "case h₁\nα : Type u\nβ : Type v\nγ : Type w\ninst✝³ : TopologicalSpace α\ninst✝² : LinearOrder α\ninst✝¹ : OrderTopology α\ninst✝ : DenselyOrdered α\na✝ b✝ : α\ns : Set α\na b : α\nhab : a ≠ b\n⊢ closure (Ioo a b) ⊆ Icc a b\n\ncase h₂\nα : Type u\nβ : Type v\nγ : Type w\ninst✝³ : TopologicalSp... | [
2250,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2241,
1
] |
Mathlib/Data/Stream/Init.lean | Stream'.tail_iterate | [
{
"state_after": "case a\nα : Type u\nβ : Type v\nδ : Type w\nf : α → α\na : α\nn : ℕ\n⊢ nth (tail (iterate f a)) n = nth (iterate f (f a)) n",
"state_before": "α : Type u\nβ : Type v\nδ : Type w\nf : α → α\na : α\n⊢ tail (iterate f a) = iterate f (f a)",
"tactic": "ext n"
},
{
"state_after": "c... | [
281,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.eventuallyEq_bind | [] | [
2725,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2723,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Images.lean | CategoryTheory.Limits.image.fac | [] | [
340,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
339,
1
] |
Mathlib/RingTheory/Ideal/Basic.lean | Ideal.span_pair_add_mul_right | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝¹ : Semiring α\nI : Ideal α\na b : α\nR : Type u\ninst✝ : CommRing R\nx y z : R\n⊢ span {x, y + x * z} = span {x, y}",
"tactic": "rw [span_pair_comm, span_pair_add_mul_left, span_pair_comm]"
}
] | [
388,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
386,
1
] |
Mathlib/NumberTheory/Fermat4.lean | Fermat42.exists_pos_odd_minimal | [
{
"state_after": "case intro.intro.intro.intro\na b c : ℤ\nh : Fermat42 a b c\na0 b0 c0 : ℤ\nhf : Minimal a0 b0 c0\nhc : a0 % 2 = 1\n⊢ ∃ a0 b0 c0, Minimal a0 b0 c0 ∧ a0 % 2 = 1 ∧ 0 < c0",
"state_before": "a b c : ℤ\nh : Fermat42 a b c\n⊢ ∃ a0 b0 c0, Minimal a0 b0 c0 ∧ a0 % 2 = 1 ∧ 0 < c0",
"tactic": "ob... | [
154,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/RingTheory/GradedAlgebra/HomogeneousIdeal.lean | Ideal.homogeneousCore_eq_sSup | [] | [
509,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
507,
1
] |
Std/Data/Int/Lemmas.lean | Int.add_lt_add_of_lt_of_le | [] | [
809,
76
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
808,
11
] |
Mathlib/MeasureTheory/Covering/VitaliFamily.lean | VitaliFamily.FineSubfamilyOn.exists_disjoint_covering_ae | [] | [
117,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
111,
1
] |
Mathlib/Data/Set/Intervals/Monoid.lean | Set.image_add_const_Ico | [] | [
97,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
1
] |
Mathlib/Algebra/Module/LinearMap.lean | LinearMap.ext_ring_op | [
{
"state_after": "R : Type u_1\nR₁ : Type ?u.223404\nR₂ : Type ?u.223407\nR₃ : Type ?u.223410\nk : Type ?u.223413\nS : Type u_2\nS₃ : Type ?u.223419\nT : Type ?u.223422\nM : Type ?u.223425\nM₁ : Type ?u.223428\nM₂ : Type ?u.223431\nM₃ : Type u_3\nN₁ : Type ?u.223437\nN₂ : Type ?u.223440\nN₃ : Type ?u.223443\nι ... | [
505,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
497,
1
] |
Mathlib/Data/Set/Intervals/OrdConnected.lean | Set.ordConnected_uIoc | [] | [
254,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
253,
1
] |
Mathlib/Data/List/Perm.lean | List.Perm.product | [] | [
1119,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1117,
1
] |
Mathlib/MeasureTheory/Measure/Regular.lean | MeasurableSet.exists_lt_isClosed_of_ne_top | [] | [
604,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
601,
1
] |
Mathlib/Geometry/Euclidean/Inversion.lean | EuclideanGeometry.inversion_dist_center | [
{
"state_after": "case inl\nV : Type u_2\nP : Type u_1\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerProductSpace ℝ V\ninst✝¹ : MetricSpace P\ninst✝ : NormedAddTorsor V P\na b c d x✝ y z : P\nR : ℝ\nx : P\n⊢ inversion x (dist x x) x = x\n\ncase inr\nV : Type u_2\nP : Type u_1\ninst✝³ : NormedAddCommGroup V\nins... | [
59,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
1
] |
Mathlib/GroupTheory/Submonoid/Membership.lean | Submonoid.multiset_noncommProd_mem | [
{
"state_after": "case h\nM : Type u_1\nA : Type ?u.28763\nB : Type ?u.28766\ninst✝² : Monoid M\ninst✝¹ : SetLike B M\ninst✝ : SubmonoidClass B M\nS✝ : B\ns S : Submonoid M\nm : Multiset M\ncomm✝ : Set.Pairwise {x | x ∈ m} Commute\nh✝ : ∀ (x : M), x ∈ m → x ∈ S\nl : List M\ncomm : Set.Pairwise {x | x ∈ Quotient... | [
158,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Order/SemiconjSup.lean | isOrderRightAdjoint_sSup | [] | [
52,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
51,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.sub_lt_of_le | [] | [
580,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
579,
1
] |
Mathlib/CategoryTheory/Limits/Presheaf.lean | CategoryTheory.ColimitAdj.extendAlongYoneda_map | [
{
"state_after": "case w\nC : Type u₁\ninst✝² : SmallCategory C\nℰ : Type u₂\ninst✝¹ : Category ℰ\nA : C ⥤ ℰ\ninst✝ : HasColimits ℰ\nX Y : Cᵒᵖ ⥤ Type u₁\nf : X ⟶ Y\nJ : (Functor.Elements X)ᵒᵖ\n⊢ colimit.ι ((CategoryOfElements.π X).leftOp ⋙ A) J ≫ (extendAlongYoneda A).map f =\n colimit.ι ((CategoryOfElements... | [
175,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/Init/Data/Nat/GCD.lean | Nat.gcd_def | [
{
"state_after": "no goals",
"state_before": "x y : ℕ\n⊢ gcd x y = if x = 0 then y else gcd (y % x) x",
"tactic": "cases x <;> simp [Nat.gcd_succ]"
}
] | [
38,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.