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/Logic/Basic.lean | ExistsUnique.exists₂ | [] | [
947,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
945,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.HasBasis.eq_bot_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.20912\nγ : Type ?u.20915\nι : Sort u_2\nι' : Sort ?u.20921\nl l' : Filter α\np : ι → Prop\ns : ι → Set α\nt : Set α\ni : ι\np' : ι' → Prop\ns' : ι' → Set α\ni' : ι'\nhl : HasBasis l p s\n⊢ (∀ {i : ι}, p i → Set.Nonempty (s i)) ↔ ¬∃ i, p... | [
398,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
396,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearEquiv.ofSubmodules_apply | [] | [
2054,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2052,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.mem_of_mem_tail | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ns : WSeq α\na : α\nh : a ∈ tail s\n⊢ a ∈ s",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ns : WSeq α\na : α\n⊢ a ∈ tail s → a ∈ s",
"tactic": "intro h"
},
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ns : WSeq α\na : α\nh this... | [
981,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
971,
1
] |
Mathlib/GroupTheory/NoncommPiCoprod.lean | Subgroup.noncommPiCoprod_mulSingle | [
{
"state_after": "no goals",
"state_before": "G : Type u_1\ninst✝ : Group G\nι : Type u_2\nhdec : DecidableEq ι\nhfin : Fintype ι\nH : ι → Subgroup G\nf g : (i : ι) → { x // x ∈ H i }\nhcomm : ∀ (i j : ι), i ≠ j → ∀ (x y : G), x ∈ H i → y ∈ H j → Commute x y\ni : ι\ny : { x // x ∈ H i }\n⊢ ↑(noncommPiCoprod... | [
318,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
317,
1
] |
Mathlib/Data/MvPolynomial/Variables.lean | MvPolynomial.vars_mul | [
{
"state_after": "R : Type u\nS : Type v\nσ : Type u_1\nτ : Type ?u.160498\nr : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\np q : MvPolynomial σ R\ninst✝ : DecidableEq σ\nφ ψ : MvPolynomial σ R\ni : σ\n⊢ i ∈ vars (φ * ψ) → i ∈ vars φ ∪ vars ψ",
"state_before": "R : Type u\nS : Type v\nσ : Type u... | [
364,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
344,
1
] |
Mathlib/CategoryTheory/Bicategory/Basic.lean | CategoryTheory.Bicategory.pentagon_hom_hom_inv_hom_hom | [
{
"state_after": "no goals",
"state_before": "B : Type u\ninst✝ : Bicategory B\na b c d e : B\nf : a ⟶ b\ng : b ⟶ c\nh : c ⟶ d\ni : d ⟶ e\n⊢ inv ((α_ (f ≫ g) h i).hom ≫ (α_ f g (h ≫ i)).hom ≫ f ◁ (α_ g h i).inv) =\n inv ((α_ f g h).hom ▷ i ≫ (α_ f (g ≫ h) i).hom)",
"tactic": "simp"
}
] | [
289,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
286,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snorm_smul_le_mul_snorm | [] | [
1518,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1513,
1
] |
Mathlib/Data/Polynomial/HasseDeriv.lean | Polynomial.hasseDeriv_comp | [
{
"state_after": "case h.h\nR : Type u_1\ninst✝ : Semiring R\nk✝ : ℕ\nf : R[X]\nk l i : ℕ\n⊢ ↑(LinearMap.comp (LinearMap.comp (hasseDeriv k) (hasseDeriv l)) (monomial i)) 1 =\n ↑(LinearMap.comp (choose (k + l) k • hasseDeriv (k + l)) (monomial i)) 1",
"state_before": "R : Type u_1\ninst✝ : Semiring R\nk✝... | [
196,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.map_eq_bot_iff | [] | [
2958,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2957,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.option_isSome | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.115916\nγ : Type ?u.115919\nδ : Type ?u.115922\nσ : Type ?u.115925\ninst✝⁴ : Primcodable α\ninst✝³ : Primcodable β\ninst✝² : Primcodable γ\ninst✝¹ : Primcodable δ\ninst✝ : Primcodable σ\no : Option α\n⊢ (Option.casesOn (id o) false fun ... | [
647,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
646,
1
] |
Mathlib/RingTheory/Nilpotent.lean | isReduced_iff_pow_one_lt | [
{
"state_after": "no goals",
"state_before": "R S : Type u\nx y : R\ninst✝ : MonoidWithZero R\nk : ℕ\nhk : 1 < k\n⊢ IsReduced R ↔ ∀ (x : R), x ^ k = 0 → x = 0",
"tactic": "simp_rw [← zero_isRadical_iff, isRadical_iff_pow_one_lt k hk, zero_dvd_iff]"
}
] | [
136,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/Algebra/Algebra/Hom.lean | AlgHom.coe_comp | [] | [
335,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
334,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.int_cast_im | [] | [
1017,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1017,
1
] |
Mathlib/Data/Multiset/Lattice.lean | Multiset.sup_dedup | [] | [
78,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/Data/Set/Function.lean | Set.MapsTo.mono_left | [] | [
458,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
457,
1
] |
Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean | HomogeneousLocalization.zero_eq | [] | [
393,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
392,
1
] |
Mathlib/Algebra/Order/Group/Defs.lean | inv_lt' | [
{
"state_after": "no goals",
"state_before": "α : Type u\ninst✝³ : Group α\ninst✝² : LT α\ninst✝¹ : CovariantClass α α (fun x x_1 => x * x_1) fun x x_1 => x < x_1\ninst✝ : CovariantClass α α (swap fun x x_1 => x * x_1) fun x x_1 => x < x_1\na b c d : α\n⊢ a⁻¹ < b ↔ b⁻¹ < a",
"tactic": "rw [← inv_lt_inv_... | [
394,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
394,
1
] |
Mathlib/Logic/Equiv/Set.lean | Equiv.coe_ofInjective_symm | [
{
"state_after": "case h.mk.intro\nα✝ : Sort u\nβ✝ : Sort v\nγ : Sort w\nα : Type u_1\nβ : Type u_2\nf : α → β\nhf : Injective f\nx : α\n⊢ ↑(ofInjective f hf).symm { val := f x, property := (_ : ∃ y, f y = f x) } =\n rangeSplitting f { val := f x, property := (_ : ∃ y, f y = f x) }",
"state_before": "α✝ ... | [
628,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
624,
1
] |
Mathlib/Data/Matrix/Basis.lean | Matrix.induction_on | [
{
"state_after": "l : Type ?u.18908\nm : Type u_1\nn : Type u_2\nR : Type ?u.18917\nα : Type u_3\ninst✝⁷ : DecidableEq l\ninst✝⁶ : DecidableEq m\ninst✝⁵ : DecidableEq n\ninst✝⁴ : Semiring α\ninst✝³ : Fintype m\ninst✝² : Fintype n\ninst✝¹ : Nonempty m\ninst✝ : Nonempty n\nP : Matrix m n α → Prop\nM : Matrix m n ... | [
115,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
11
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.isCaratheodory_iUnion_lt | [
{
"state_after": "no goals",
"state_before": "α : Type u\nm : OuterMeasure α\ns✝ s₁ s₂ : Set α\ns : ℕ → Set α\nx✝ : ∀ (i : ℕ), i < 0 → IsCaratheodory m (s i)\n⊢ IsCaratheodory m (⋃ (i : ℕ) (_ : i < 0), s i)",
"tactic": "simp [Nat.not_lt_zero]"
},
{
"state_after": "α : Type u\nm : OuterMeasure α\... | [
986,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
979,
1
] |
Std/Logic.lean | imp_false | [] | [
124,
48
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
124,
1
] |
Mathlib/Algebra/MonoidAlgebra/Basic.lean | MonoidAlgebra.int_cast_def | [] | [
357,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
355,
1
] |
Mathlib/Data/Set/Function.lean | Set.SurjOn.inter_inter | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.41971\nι : Sort ?u.41974\nπ : α → Type ?u.41979\ns s₁ s₂ : Set α\nt t₁ t₂ : Set β\np : Set γ\nf f₁ f₂ f₃ : α → β\ng g₁ g₂ : β → γ\nf' f₁' f₂' : β → α\ng' : γ → β\na : α\nb : β\nh₁ : SurjOn f s₁ t₁\nh₂ : SurjOn f s₂ t₂\nh : InjOn f (s₁ ∪ s₂)\ny : β\nhy : ... | [
812,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
806,
1
] |
Mathlib/Order/Filter/Pi.lean | Filter.hasBasis_pi | [
{
"state_after": "no goals",
"state_before": "ι : Type u_2\nα : ι → Type u_1\nf f₁ f₂ : (i : ι) → Filter (α i)\ns✝ : (i : ι) → Set (α i)\nι' : ι → Type\ns : (i : ι) → ι' i → Set (α i)\np : (i : ι) → ι' i → Prop\nh : ∀ (i : ι), HasBasis (f i) (p i) (s i)\n⊢ HasBasis (pi f) (fun If => Set.Finite If.fst ∧ ∀ (i... | [
113,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
1
] |
Mathlib/Algebra/Order/ToIntervalMod.lean | iUnion_Ico_add_zsmul | [
{
"state_after": "α : Type u_1\ninst✝¹ : LinearOrderedAddCommGroup α\ninst✝ : Archimedean α\np : α\nhp : 0 < p\na b : α\n⊢ ∃ i, b ∈ Ico (a + i • p) (a + (i + 1) • p)",
"state_before": "α : Type u_1\ninst✝¹ : LinearOrderedAddCommGroup α\ninst✝ : Archimedean α\np : α\nhp : 0 < p\na : α\n⊢ (⋃ (n : ℤ), Ico (a +... | [
1066,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1061,
1
] |
Mathlib/Data/List/Sigma.lean | List.perm_lookupAll | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : α → Type v\nl l₁✝ l₂✝ : List (Sigma β)\ninst✝ : DecidableEq α\na : α\nl₁ l₂ : List (Sigma β)\nnd₁ : NodupKeys l₁\nnd₂ : NodupKeys l₂\np : l₁ ~ l₂\n⊢ lookupAll a l₁ = lookupAll a l₂",
"tactic": "simp [lookupAll_eq_dlookup, nd₁, nd₂, perm_dlook... | [
334,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
332,
1
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | intervalIntegral.integral_smul_const | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.13121336\n𝕜✝ : Type ?u.13121339\nE : Type u_2\nF : Type ?u.13121345\nA : Type ?u.13121348\ninst✝⁴ : NormedAddCommGroup E\ninst✝³ : CompleteSpace E\ninst✝² : NormedSpace ℝ E\na b : ℝ\nf✝ g : ℝ → E\nμ : MeasureTheory.Measure ℝ\n𝕜 : Type u_1\ninst✝¹ :... | [
613,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
611,
8
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | real_inner_div_norm_mul_norm_eq_neg_one_iff | [
{
"state_after": "𝕜 : Type ?u.3228331\nE : Type ?u.3228334\nF : Type u_1\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nx y : F\n⊢ (x ≠ 0 ∧ ∃ x_1, 0 < -x_1 ∧ -y = -x_1 • x) ↔ x ≠ 0 ∧ ∃ r, ... | [
1709,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1704,
1
] |
Mathlib/Topology/Algebra/Order/Floor.lean | tendsto_ceil_right | [
{
"state_after": "α : Type u_1\nβ : Type ?u.17413\nγ : Type ?u.17416\ninst✝³ : LinearOrderedRing α\ninst✝² : FloorRing α\ninst✝¹ : TopologicalSpace α\ninst✝ : OrderClosedTopology α\nn : ℤ\n⊢ pure (IntCast.intCast (n + 1)) ≤ 𝓝[Ici ↑(n + 1)] ↑(n + 1)",
"state_before": "α : Type u_1\nβ : Type ?u.17413\nγ : Ty... | [
142,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | Equiv.refl_toLocalEquiv | [] | [
1101,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1100,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.filter_sub | [] | [
1173,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1171,
1
] |
src/lean/Init/SimpLemmas.lean | cond_true | [] | [
145,
63
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
145,
9
] |
Mathlib/Init/Data/Nat/Lemmas.lean | Nat.cond_decide_mod_two | [
{
"state_after": "case pos\nx : ℕ\nd : Decidable (x % 2 = 1)\nh : x % 2 = 1\n⊢ (bif decide (x % 2 = 1) then 1 else 0) = x % 2\n\ncase neg\nx : ℕ\nd : Decidable (x % 2 = 1)\nh : ¬x % 2 = 1\n⊢ (bif decide (x % 2 = 1) then 1 else 0) = x % 2",
"state_before": "x : ℕ\nd : Decidable (x % 2 = 1)\n⊢ (bif decide (x ... | [
294,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
290,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.hasBasis_biInf_principal | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.64418\nι : Sort ?u.64421\nι' : Sort ?u.64424\nl l' : Filter α\np : ι → Prop\ns✝ : ι → Set α\nt✝ : Set α\ni : ι\np' : ι' → Prop\ns' : ι' → Set α\ni' : ι'\ns : β → Set α\nS : Set β\nh : DirectedOn (s ⁻¹'o fun x x_1 => x ≥ x_1) S\nne : Set.Nonempty S\nt : S... | [
782,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
776,
1
] |
Mathlib/Data/Finset/Preimage.lean | Finset.preimage_univ | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\nγ : Type x\nf : α → β\ninst✝¹ : Fintype α\ninst✝ : Fintype β\nhf : InjOn f (f ⁻¹' ↑univ)\n⊢ ↑(preimage univ f hf) = ↑univ",
"tactic": "simp"
}
] | [
55,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.diag_smul | [] | [
647,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
646,
1
] |
Mathlib/Algebra/LinearRecurrence.lean | LinearRecurrence.eq_mk_of_is_sol_of_eq_init' | [] | [
126,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Algebra/Group/Commute.lean | Commute.mul_inv | [
{
"state_after": "no goals",
"state_before": "G : Type u_1\ninst✝ : DivisionMonoid G\na b c d : G\nhab : Commute a b\n⊢ (a * b)⁻¹ = a⁻¹ * b⁻¹",
"tactic": "rw [hab.eq, mul_inv_rev]"
}
] | [
317,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
317,
11
] |
Mathlib/NumberTheory/BernoulliPolynomials.lean | Polynomial.bernoulli_succ_eval | [
{
"state_after": "case h\nn p : ℕ\n⊢ eval (↑n) (bernoulli (succ p)) - _root_.bernoulli (succ p) = (↑p + 1) * ∑ k in range n, ↑k ^ p",
"state_before": "n p : ℕ\n⊢ eval (↑n) (bernoulli (succ p)) = _root_.bernoulli (succ p) + (↑p + 1) * ∑ k in range n, ↑k ^ p",
"tactic": "apply eq_add_of_sub_eq'"
},
{
... | [
186,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/ModelTheory/Substructures.lean | FirstOrder.Language.LHom.mem_substructureReduct | [] | [
728,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
726,
1
] |
Mathlib/Data/QPF/Univariate/Basic.lean | Qpf.suppPreservation_iff_uniform | [
{
"state_after": "case mp\nF : Type u → Type u\ninst✝ : Functor F\nq : Qpf F\n⊢ SuppPreservation → IsUniform\n\ncase mpr\nF : Type u → Type u\ninst✝ : Functor F\nq : Qpf F\n⊢ IsUniform → SuppPreservation",
"state_before": "F : Type u → Type u\ninst✝ : Functor F\nq : Qpf F\n⊢ SuppPreservation ↔ IsUniform",
... | [
710,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
705,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/EulerSineProd.lean | EulerSine.integral_cos_mul_cos_pow | [
{
"state_after": "z : ℂ\nn : ℕ\nhn : 2 ≤ n\nhz : z ≠ 0\nnne : ↑n ≠ 0\n⊢ ((1 - 4 * z ^ 2 / ↑n ^ 2) * ∫ (x : ℝ) in 0 ..π / 2, Complex.cos (2 * z * ↑x) * ↑(cos x) ^ n) =\n (↑n - 1) / ↑n * ∫ (x : ℝ) in 0 ..π / 2, Complex.cos (2 * z * ↑x) * ↑(cos x) ^ (n - 2)",
"state_before": "z : ℂ\nn : ℕ\nhn : 2 ≤ n\nhz : ... | [
168,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/Data/Fin/VecNotation.lean | Matrix.cons_nonzero_iff | [] | [
566,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
564,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | DifferentiableAt.add | [] | [
154,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.mk_sub | [
{
"state_after": "ι : Type u\nγ : Type w\nβ : ι → Type v\nβ₁ : ι → Type v₁\nβ₂ : ι → Type v₂\ndec : DecidableEq ι\ninst✝ : (i : ι) → AddGroup (β i)\ns : Finset ι\nx y : (i : ↑↑s) → β ↑i\ni : ι\n⊢ (if H : i ∈ s then (x - y) { val := i, property := H } else 0) =\n (if H : i ∈ s then x { val := i, property := H... | [
1055,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1053,
1
] |
Mathlib/Topology/Order/Basic.lean | ContinuousWithinAt.closure_le | [] | [
221,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
217,
1
] |
Mathlib/Data/List/Perm.lean | List.perm_of_mem_permutations | [] | [
1219,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1217,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.inter_eq_right_iff_subset | [] | [
1799,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1798,
1
] |
Mathlib/Analysis/Calculus/Deriv/Slope.lean | hasDerivAtFilter_iff_tendsto_slope | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u\ninst✝⁴ : NontriviallyNormedField 𝕜\nF : Type v\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nE : Type w\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace 𝕜 E\nf f₀ f₁ g : 𝕜 → F\nf' f₀' f₁' g' : F\nx✝ : 𝕜\ns t : Set 𝕜\nL✝ L₁ L₂ : ... | [
73,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
61,
1
] |
Mathlib/Data/TypeVec.lean | TypeVec.eq_nilFun | [
{
"state_after": "case a.h\nn : ℕ\nα : TypeVec 0\nβ : TypeVec 0\nf : α ⟹ β\nx : Fin2 0\nx✝ : α x\n⊢ f x x✝ = nilFun x x✝",
"state_before": "n : ℕ\nα : TypeVec 0\nβ : TypeVec 0\nf : α ⟹ β\n⊢ f = nilFun",
"tactic": "ext x"
},
{
"state_after": "no goals",
"state_before": "case a.h\nn : ℕ\nα : T... | [
447,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
446,
1
] |
Mathlib/Algebra/Hom/Equiv/Units/Basic.lean | coe_toUnits | [] | [
34,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
33,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.tendsto_iff_eventually | [] | [
2834,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2832,
1
] |
Mathlib/Logic/Equiv/Defs.lean | Equiv.arrowCongr'_refl | [] | [
554,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
553,
9
] |
Mathlib/GroupTheory/Index.lean | Subgroup.index_map_eq | [] | [
353,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
351,
1
] |
Mathlib/Logic/Nonempty.lean | Nonempty.elim_to_inhabited | [] | [
156,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Tactic/Linarith/Lemmas.lean | Linarith.le_of_le_of_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : OrderedSemiring α\na b : α\nha : a ≤ 0\nhb : b = 0\n⊢ a + b ≤ 0",
"tactic": "simp [*]"
}
] | [
37,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
36,
1
] |
Mathlib/Data/Real/CauSeq.lean | CauSeq.sup_lt | [
{
"state_after": "case intro.intro.intro.intro.intro.intro\nα : Type u_1\ninst✝ : LinearOrderedField α\na b c : CauSeq α abs\nεa : α\nεa0 : εa > 0\nia : ℕ\nha : ∀ (j : ℕ), j ≥ ia → εa ≤ ↑(c - a) j\nεb : α\nεb0 : εb > 0\nib : ℕ\nhb : ∀ (j : ℕ), j ≥ ib → εb ≤ ↑(c - b) j\n⊢ a ⊔ b < c",
"state_before": "α : Typ... | [
890,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
886,
11
] |
Mathlib/Data/List/Basic.lean | List.take_all_of_le | [
{
"state_after": "ι : Type ?u.157660\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nn : ℕ\na : α\nl : List α\nh : length (a :: l) ≤ n + 1\n⊢ a :: take n l = a :: l",
"state_before": "ι : Type ?u.157660\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nn : ℕ\na : α\nl : List ... | [
1937,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1931,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.mul_meas_ge_le_lintegral | [] | [
836,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
834,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsLittleO.prod_rightl | [] | [
962,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
961,
1
] |
Mathlib/Analysis/NormedSpace/OperatorNorm.lean | ContinuousLinearMap.exists_lt_apply_of_lt_op_norm | [
{
"state_after": "case pos\n𝕜✝ : Type ?u.795717\n𝕜₂✝ : Type ?u.795720\n𝕜₃ : Type ?u.795723\nE✝ : Type ?u.795726\nEₗ : Type ?u.795729\nF✝ : Type ?u.795732\nFₗ : Type ?u.795735\nG : Type ?u.795738\nGₗ : Type ?u.795741\n𝓕 : Type ?u.795744\ninst✝²³ : SeminormedAddCommGroup E✝\ninst✝²² : SeminormedAddCommGroup E... | [
543,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
536,
1
] |
Mathlib/GroupTheory/Submonoid/Basic.lean | MonoidHom.coe_ofClosureMEqTopRight | [] | [
703,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
701,
1
] |
Mathlib/Order/Heyting/Regular.lean | Heyting.Regular.coe_lt_coe | [] | [
189,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
188,
1
] |
Mathlib/Algebra/GroupPower/Ring.lean | neg_one_pow_eq_or | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nS : Type ?u.92208\nM : Type ?u.92211\ninst✝¹ : Monoid R\ninst✝ : HasDistribNeg R\nn : ℕ\nh : (-1) ^ n = -1\n⊢ (-1) ^ (n + 1) = 1",
"tactic": "rw [pow_succ, h, neg_one_mul, neg_neg]"
},
{
"state_after": "no goals",
"state_before": "R... | [
196,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/Algebra/Homology/ImageToKernel.lean | imageToKernel'_kernelSubobjectIso | [
{
"state_after": "case h\nι : Type ?u.277955\nV : Type u\ninst✝³ : Category V\ninst✝² : HasZeroMorphisms V\nA B C : V\nf : A ⟶ B\ng : B ⟶ C\nw✝ : f ≫ g = 0\ninst✝¹ : HasKernels V\ninst✝ : HasImages V\nw : f ≫ g = 0\n⊢ (imageToKernel' f g w ≫ (kernelSubobjectIso g).inv) ≫ Subobject.arrow (kernelSubobject g) =\n ... | [
412,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
408,
1
] |
Mathlib/Topology/Order/Basic.lean | frontier_Ici' | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝³ : TopologicalSpace α\ninst✝² : LinearOrder α\ninst✝¹ : OrderTopology α\ninst✝ : DenselyOrdered α\na✝ b : α\ns : Set α\na : α\nha : Set.Nonempty (Iio a)\n⊢ frontier (Ici a) = {a}",
"tactic": "simp [frontier, ha]"
}... | [
2328,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2327,
1
] |
Mathlib/Data/Set/Basic.lean | Set.mem_singleton_iff | [] | [
1257,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1256,
1
] |
Mathlib/GroupTheory/OrderOfElement.lean | mem_powers_iff_mem_range_orderOf | [] | [
723,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
721,
1
] |
Mathlib/Analysis/PSeries.lean | NNReal.summable_condensed_iff | [
{
"state_after": "f : ℕ → ℝ≥0\nhf : ∀ ⦃m n : ℕ⦄, 0 < m → m ≤ n → f n ≤ f m\n⊢ (∑' (b : ℕ), 2 ^ b * ↑(f (2 ^ b))) = ⊤ ↔ (∑' (b : ℕ), ↑(f b)) = ⊤",
"state_before": "f : ℕ → ℝ≥0\nhf : ∀ ⦃m n : ℕ⦄, 0 < m → m ≤ n → f n ≤ f m\n⊢ (Summable fun k => 2 ^ k * f (2 ^ k)) ↔ Summable f",
"tactic": "simp only [← ENNR... | [
134,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Algebra/FreeMonoid/Basic.lean | FreeMonoid.of_smul | [] | [
310,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
308,
1
] |
Mathlib/Data/List/Permutation.lean | List.permutationsAux2_snd_nil | [] | [
66,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/Data/Set/Opposite.lean | Set.singleton_op_unop | [
{
"state_after": "case h\nα : Type u_1\nx x✝ : α\n⊢ x✝ ∈ Set.unop {op x} ↔ x✝ ∈ {x}",
"state_before": "α : Type u_1\nx : α\n⊢ Set.unop {op x} = {x}",
"tactic": "ext"
},
{
"state_after": "case h.mp\nα : Type u_1\nx x✝ : α\n⊢ x✝ ∈ Set.unop {op x} → x✝ ∈ {x}\n\ncase h.mpr\nα : Type u_1\nx x✝ : α\n⊢... | [
100,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
1
] |
Mathlib/CategoryTheory/Iso.lean | CategoryTheory.Iso.refl_symm | [] | [
153,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/Order/SuccPred/Basic.lean | Order.Ico_succ_left | [] | [
392,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/Data/List/Forall2.lean | List.rel_prod | [] | [
318,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
316,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.norm_setToFun_le_mul_norm' | [
{
"state_after": "α : Type u_1\nE : Type u_2\nF : Type u_3\nF' : Type ?u.1690915\nG : Type ?u.1690918\n𝕜 : Type ?u.1690921\np : ℝ≥0∞\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace ℝ E\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace ℝ F\ninst✝³ : NormedAddCommGroup F'\ninst✝² : NormedSpace ℝ F'\ninst... | [
1701,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1699,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.neighborSet_subset | [] | [
214,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/Init/CcLemmas.lean | not_imp_eq_of_eq_false_right | [] | [
67,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/Analysis/Normed/Group/AddTorsor.lean | LipschitzWith.vadd | [] | [
248,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
241,
1
] |
Mathlib/Data/List/BigOperators/Basic.lean | List.prod_hom₂ | [
{
"state_after": "ι : Type u_1\nα : Type ?u.28780\nM : Type u_3\nN : Type u_4\nP : Type u_2\nM₀ : Type ?u.28792\nG : Type ?u.28795\nR : Type ?u.28798\ninst✝² : Monoid M\ninst✝¹ : Monoid N\ninst✝ : Monoid P\nl✝ l₁ l₂ : List M\na : M\nl : List ι\nf : M → N → P\nhf : ∀ (a b : M) (c d : N), f (a * b) (c * d) = f a ... | [
120,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/CategoryTheory/Subobject/Limits.lean | CategoryTheory.Limits.equalizerSubobject_arrow' | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝¹ : Category C\nX Y Z : C\nf g : X ⟶ Y\ninst✝ : HasEqualizer f g\n⊢ (equalizerSubobjectIso f g).inv ≫ arrow (equalizerSubobject f g) = equalizer.ι f g",
"tactic": "simp [equalizerSubobjectIso]"
}
] | [
61,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/Analysis/Normed/Group/Hom.lean | NormedAddGroupHom.opNorm_le_of_lipschitz | [
{
"state_after": "no goals",
"state_before": "V : Type ?u.236326\nV₁ : Type u_1\nV₂ : Type u_2\nV₃ : Type ?u.236335\ninst✝³ : SeminormedAddCommGroup V\ninst✝² : SeminormedAddCommGroup V₁\ninst✝¹ : SeminormedAddCommGroup V₂\ninst✝ : SeminormedAddCommGroup V₃\nf✝ g f : NormedAddGroupHom V₁ V₂\nK : ℝ≥0\nhf : L... | [
295,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
293,
1
] |
Mathlib/Data/Set/Basic.lean | Set.union_diff_distrib | [] | [
1852,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1851,
1
] |
Mathlib/Topology/MetricSpace/Lipschitz.lean | LipschitzWith.nndist_le | [] | [
352,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
351,
1
] |
Mathlib/Order/SymmDiff.lean | bihimp_left_surjective | [] | [
673,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
672,
1
] |
Mathlib/Topology/Sheaves/SheafCondition/PairwiseIntersections.lean | TopCat.Sheaf.interUnionPullbackCone_snd | [] | [
341,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
339,
1
] |
Std/Data/List/Lemmas.lean | List.filterMap_filterMap | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type u_3\nf : α → Option β\ng : β → Option γ\nl : List α\n⊢ filterMap g (filterMap f l) = filterMap (fun x => Option.bind (f x) g) l",
"tactic": "induction l with\n| nil => rfl\n| cons a l IH => cases h : f a <;> simp [*]"
}... | [
1180,
46
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1176,
1
] |
Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean | ProjectiveSpectrum.subset_zeroLocus_iff_subset_vanishingIdeal | [] | [
158,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/MeasureTheory/Function/LocallyIntegrable.lean | MonotoneOn.integrableOn_isCompact | [
{
"state_after": "case inl\nX : Type u_1\nY : Type ?u.1878962\nE : Type u_2\nR : Type ?u.1878968\ninst✝¹¹ : MeasurableSpace X\ninst✝¹⁰ : TopologicalSpace X\ninst✝⁹ : MeasurableSpace Y\ninst✝⁸ : TopologicalSpace Y\ninst✝⁷ : NormedAddCommGroup E\nf : X → E\nμ : MeasureTheory.Measure X\ninst✝⁶ : BorelSpace X\ninst... | [
343,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
337,
1
] |
src/lean/Lean/Data/PersistentHashMap.lean | Lean.PersistentHashMap.size_set | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nks : Array α\nvs : Array β\nh : Array.size ks = Array.size vs\ni : Fin (Array.size ks)\nj : Fin (Array.size vs)\nk : α\nv : β\n⊢ Array.size (Array.set ks i k) = Array.size (Array.set vs j v)",
"tactic": "simp [h]"
}
] | [
68,
11
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
66,
9
] |
Mathlib/Analysis/NormedSpace/AddTorsor.lean | dist_center_homothety | [
{
"state_after": "α : Type ?u.5505\nV : Type u_2\nP : Type u_1\nW : Type ?u.5514\nQ : Type ?u.5517\ninst✝⁸ : SeminormedAddCommGroup V\ninst✝⁷ : PseudoMetricSpace P\ninst✝⁶ : NormedAddTorsor V P\ninst✝⁵ : NormedAddCommGroup W\ninst✝⁴ : MetricSpace Q\ninst✝³ : NormedAddTorsor W Q\n𝕜 : Type u_3\ninst✝² : NormedFi... | [
52,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
48,
1
] |
Mathlib/Tactic/LinearCombination.lean | Mathlib.Tactic.LinearCombination.mul_pf | [] | [
46,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
46,
1
] |
Mathlib/Data/Vector/Basic.lean | Vector.map_id | [
{
"state_after": "no goals",
"state_before": "n✝ : ℕ\nα : Type u_1\nn : ℕ\nv : Vector α n\n⊢ toList (map id v) = toList v",
"tactic": "simp only [List.map_id, Vector.toList_map]"
}
] | [
226,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.ncard_le_one_of_subsingleton | [
{
"state_after": "α : Type u_1\nβ : Type ?u.155682\ns✝ t : Set α\na b x y : α\nf : α → β\ninst✝ : Subsingleton α\ns : Set α\n⊢ Finset.card (Finite.toFinset (_ : Set.Finite s)) ≤ 1",
"state_before": "α : Type u_1\nβ : Type ?u.155682\ns✝ t : Set α\na b x y : α\nf : α → β\ninst✝ : Subsingleton α\ns : Set α\n⊢ ... | [
694,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
692,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.inter_div_union_subset_union | [] | [
732,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
731,
1
] |
Mathlib/Algebra/Lie/Basic.lean | LieEquiv.symm_symm | [
{
"state_after": "case h\nR : Type u\nL₁ : Type v\nL₂ : Type w\nL₃ : Type w₁\ninst✝⁶ : CommRing R\ninst✝⁵ : LieRing L₁\ninst✝⁴ : LieRing L₂\ninst✝³ : LieRing L₃\ninst✝² : LieAlgebra R L₁\ninst✝¹ : LieAlgebra R L₂\ninst✝ : LieAlgebra R L₃\ne : L₁ ≃ₗ⁅R⁆ L₂\nx✝ : L₁\n⊢ ↑(symm (symm e)) x✝ = ↑e x✝",
"state_befo... | [
616,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
614,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.map_eval₂ | [
{
"state_after": "case h_C\nR : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type ?u.3339071\na a' a₁ a₂ : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\ninst✝ : CommSemiring S₁\np✝ q : MvPolynomial σ R\nf✝ f : R →+* S₁\ng : S₂ → MvPolynomial S₃ R\np : MvPolynomial S₂ R\n⊢ ∀ (a : R), ↑(map f) (ev... | [
1266,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1257,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Path.mk'_mem_edges_singleton | [
{
"state_after": "no goals",
"state_before": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nu v : V\nh : Adj G u v\n⊢ Quotient.mk (Sym2.Rel.setoid V) (u, v) ∈ Walk.edges ↑(singleton h)",
"tactic": "simp [singleton]"
}
] | [
1300,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1299,
1
] |
Mathlib/RepresentationTheory/Basic.lean | Representation.ofMulAction_single | [] | [
281,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.