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/ModelTheory/Definability.lean | FirstOrder.Language.DefinableSet.coe_inf | [] | [
361,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
359,
1
] |
Mathlib/LinearAlgebra/Finsupp.lean | Finsupp.domLCongr_apply | [] | [
778,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
776,
1
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineIsometryEquiv.coe_vaddConst | [] | [
702,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
701,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.ball_eq_ball' | [
{
"state_after": "case h\nα : Type u\nβ : Type v\nX : Type ?u.28557\nι : Type ?u.28560\ninst✝ : PseudoMetricSpace α\nx✝¹ y z : α\nδ ε✝ ε₁ ε₂ : ℝ\ns : Set α\nε : ℝ\nx x✝ : α\n⊢ x✝ ∈ UniformSpace.ball x {p | dist p.fst p.snd < ε} ↔ x✝ ∈ ball x ε",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.28557\nι ... | [
463,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
460,
1
] |
Mathlib/Analysis/LocallyConvex/BalancedCoreHull.lean | subset_balancedHull | [] | [
144,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | UniformSpace.comap_inf | [] | [
1285,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1283,
1
] |
Std/Data/Int/DivMod.lean | Int.emod_add_emod | [
{
"state_after": "m n k : Int\nthis : (m % n + k) % n = (m % n + k + n * (m / n)) % n\n⊢ (m % n + k) % n = (m + k) % n",
"state_before": "m n k : Int\n⊢ (m % n + k) % n = (m + k) % n",
"tactic": "have := (add_mul_emod_self_left (m % n + k) n (m / n)).symm"
},
{
"state_after": "no goals",
"st... | [
422,
50
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
420,
9
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.ediam_eq_top_iff_unbounded | [] | [
2657,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2656,
1
] |
Mathlib/MeasureTheory/Integral/SetIntegral.lean | MeasureTheory.norm_Lp_toLp_restrict_le | [
{
"state_after": "α : Type u_1\nβ : Type ?u.334371\nE : Type u_2\nF : Type ?u.334377\ninst✝⁴ : MeasurableSpace α\ninst✝³ : NormedAddCommGroup E\n𝕜 : Type ?u.334386\ninst✝² : NormedField 𝕜\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedSpace 𝕜 F\np : ℝ≥0∞\nμ : Measure α\ns : Set α\nf : { x // x ∈ Lp E p }\n⊢ s... | [
906,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
902,
1
] |
Mathlib/Data/Fin/Tuple/Basic.lean | Fin.append_assoc | [
{
"state_after": "case h\nm n : ℕ\nα✝ : Fin (n + 1) → Type u\nx : α✝ 0\nq : (i : Fin (n + 1)) → α✝ i\np✝ : (i : Fin n) → α✝ (succ i)\ni✝ : Fin n\ny : α✝ (succ i✝)\nz : α✝ 0\np : ℕ\nα : Type u_1\na : Fin m → α\nb : Fin n → α\nc : Fin p → α\ni : Fin (m + n + p)\n⊢ append (append a b) c i = (append a (append b c) ... | [
349,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
337,
1
] |
Mathlib/Topology/Bases.lean | TopologicalSpace.isOpen_of_mem_countableBasis | [] | [
651,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
649,
1
] |
Mathlib/Order/SuccPred/Limit.lean | Order.IsSuccLimit.succ_lt_iff | [] | [
157,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/Algebra/EuclideanDomain/Defs.lean | EuclideanDomain.gcd_zero_left | [
{
"state_after": "R : Type u\ninst✝¹ : EuclideanDomain R\ninst✝ : DecidableEq R\na : R\n⊢ (fun b =>\n if a0 : 0 = 0 then b\n else\n let_fun x := (_ : b % 0 ≺ 0);\n gcd (b % 0) 0)\n a =\n a",
"state_before": "R : Type u\ninst✝¹ : EuclideanDomain R\ninst✝ : DecidableEq ... | [
214,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Analysis/NormedSpace/Extr.lean | IsLocalMax.norm_add_sameRay | [] | [
93,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/Order/CompleteBooleanAlgebra.lean | PUnit.sSup_eq | [] | [
401,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
400,
1
] |
Mathlib/Algebra/Hom/Centroid.lean | CentroidHom.coe_toAddMonoidHom_injective | [] | [
134,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Mathlib/Order/Circular.lean | sbtw_trans_right | [] | [
244,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.coe_deleteEdges_eq | [
{
"state_after": "case Adj.h.mk.h.mk.a\nι : Sort ?u.246328\nV : Type u\nW : Type v\nG : SimpleGraph V\nG' : Subgraph G\ns✝ s : Set (Sym2 V)\nv : V\nhv : v ∈ (deleteEdges G' s).verts\nw : V\nhw : w ∈ (deleteEdges G' s).verts\n⊢ SimpleGraph.Adj (Subgraph.coe (deleteEdges G' s)) { val := v, property := hv } { val ... | [
1084,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1081,
1
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.Red.cons_cons_iff | [
{
"state_after": "α : Type u\nL L₁ L₂ L₃ L₄ : List (α × Bool)\np : α × Bool\nLL₁ : List (α × Bool)\neq₁ : p :: L₁ = LL₁\n⊢ Red LL₁ (p :: L₂) → Red L₁ L₂",
"state_before": "α : Type u\nL L₁ L₂ L₃ L₄ : List (α × Bool)\np : α × Bool\n⊢ Red (p :: L₁) (p :: L₂) → Red L₁ L₂",
"tactic": "generalize eq₁ : (p ::... | [
275,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
255,
1
] |
Mathlib/Algebra/Symmetrized.lean | SymAlg.sym_injective | [] | [
103,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/GroupTheory/Commutator.lean | Subgroup.commutator_le | [] | [
94,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Algebra/Module/Projective.lean | Module.Projective.of_basis | [
{
"state_after": "R : Type u_2\ninst✝² : Ring R\nP : Type u_3\ninst✝¹ : AddCommGroup P\ninst✝ : Module R P\nι : Type u_1\nb : Basis ι R P\n⊢ Function.LeftInverse ↑(Finsupp.total P P R id) ↑(↑(Basis.constr b ℕ) fun i => Finsupp.single (↑b i) 1)",
"state_before": "R : Type u_2\ninst✝² : Ring R\nP : Type u_3\n... | [
165,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/CategoryTheory/Limits/HasLimits.lean | CategoryTheory.Limits.colimit.pre_eq | [
{
"state_after": "no goals",
"state_before": "J : Type u₁\ninst✝⁶ : Category J\nK : Type u₂\ninst✝⁵ : Category K\nC : Type u\ninst✝⁴ : Category C\nF : J ⥤ C\ninst✝³ : HasColimit F\nE : K ⥤ J\ninst✝² : HasColimit (E ⋙ F)\nL : Type u₃\ninst✝¹ : Category L\nD : L ⥤ K\ninst✝ : HasColimit (D ⋙ E ⋙ F)\ns : Colimi... | [
1009,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1005,
1
] |
Mathlib/Algebra/Module/Torsion.lean | Submodule.torsionBy_le_torsionBy_of_dvd | [
{
"state_after": "R : Type u_1\nM : Type u_2\ninst✝² : CommSemiring R\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\ns : Set R\na✝ a b : R\ndvd : a ∣ b\n⊢ torsionBySet R M ↑(span R {a}) ≤ torsionBySet R M {b}",
"state_before": "R : Type u_1\nM : Type u_2\ninst✝² : CommSemiring R\ninst✝¹ : AddCommMonoid M\ni... | [
300,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | UniformContinuous.comp_tendstoUniformly | [] | [
272,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Mathlib/Analysis/Normed/Group/HomCompletion.lean | NormedAddGroupHom.completion_coe | [] | [
83,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
81,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.comap_neBot_iff_compl_range | [] | [
2352,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2351,
1
] |
Mathlib/Logic/Equiv/Defs.lean | Equiv.conj_comp | [
{
"state_after": "no goals",
"state_before": "α : Sort u\nβ : Sort v\nγ : Sort w\ne : α ≃ β\nf₁ f₂ : α → α\n⊢ ↑(conj e) (f₁ ∘ f₂) = ↑(conj e) f₁ ∘ ↑(conj e) f₂",
"tactic": "apply arrowCongr_comp"
}
] | [
586,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
585,
1
] |
src/lean/Init/SizeOfLemmas.lean | Fin.sizeOf | [
{
"state_after": "case mk\nn val✝ : Nat\nisLt✝ : val✝ < n\n⊢ SizeOf.sizeOf { val := val✝, isLt := isLt✝ } = { val := val✝, isLt := isLt✝ }.val + 1",
"state_before": "n : Nat\na : Fin n\n⊢ SizeOf.sizeOf a = a.val + 1",
"tactic": "cases a"
},
{
"state_after": "no goals",
"state_before": "case ... | [
12,
22
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
11,
9
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | TendstoUniformly.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✝ : ι → α\nh : TendstoUniformlyOnFilter F f p ⊤\ng : γ → α\n⊢ TendstoUniformlyOnFilter (fun n => F n ∘ g) (f ∘ g) p ⊤",
"state_before": "α : ... | [
252,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
249,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.IsCycle.ne_one | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.306885\nα : Type u_1\nβ : Type ?u.306891\nf g : Perm α\nx y : α\nh : IsCycle f\nhf : f = 1\n⊢ False",
"tactic": "simp [hf, IsCycle] at h"
}
] | [
291,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
291,
1
] |
Mathlib/CategoryTheory/MorphismProperty.lean | CategoryTheory.MorphismProperty.monomorphisms.iff | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝¹ : Category C\nD : Type ?u.59403\ninst✝ : Category D\nX Y : C\nf : X ⟶ Y\n⊢ monomorphisms C f ↔ Mono f",
"tactic": "rfl"
}
] | [
408,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
408,
1
] |
Mathlib/RingTheory/OreLocalization/Basic.lean | OreLocalization.div_eq_one' | [
{
"state_after": "R : Type u_1\ninst✝¹ : Monoid R\nS : Submonoid R\ninst✝ : OreSet S\nr : R\nhr : r ∈ S\n⊢ ∃ u v, 1 * ↑u = r * v ∧ ↑1 * ↑u = ↑{ val := r, property := hr } * v",
"state_before": "R : Type u_1\ninst✝¹ : Monoid R\nS : Submonoid R\ninst✝ : OreSet S\nr : R\nhr : r ∈ S\n⊢ r /ₒ { val := r, property... | [
287,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
285,
11
] |
Mathlib/Analysis/Normed/Field/Basic.lean | Filter.tendsto_mul_left_cobounded | [] | [
611,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
608,
1
] |
Mathlib/Data/Polynomial/Inductions.lean | Polynomial.divX_C | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nT : Type w\nA : Type z\na✝ b : R\nn✝ : ℕ\ninst✝ : Semiring R\np q : R[X]\na : R\nn : ℕ\n⊢ coeff (divX (↑C a)) n = coeff 0 n",
"tactic": "simp [coeff_divX, coeff_C, Finsupp.single_eq_of_ne _]"
}
] | [
59,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
58,
1
] |
Mathlib/Order/SymmDiff.lean | inf_symmDiff_symmDiff | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.34523\nα : Type u_1\nβ : Type ?u.34529\nπ : ι → Type ?u.34534\ninst✝ : GeneralizedCoheytingAlgebra α\na b c d : α\n⊢ (a ⊓ b) ∆ (a ∆ b) = a ⊔ b",
"tactic": "rw [symmDiff_comm, symmDiff_symmDiff_inf]"
}
] | [
214,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/Data/List/Pairwise.lean | List.pwFilter_map | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nR S T : α → α → Prop\na : α\nl : List α\ninst✝ : DecidableRel R\nf : β → α\nx : β\nxs : List β\nh : ∀ (b : α), b ∈ pwFilter R (map f xs) → R (f x) b\nh' : ∀ (b : β), b ∈ pwFilter (fun x y => R (f x) (f y)) xs → R (f x) (f b)\n⊢ pwFilter R (map f (x :: xs)) = map f (... | [
388,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
372,
1
] |
Mathlib/Data/Real/Sqrt.lean | Real.sqrt_inj | [
{
"state_after": "no goals",
"state_before": "x y : ℝ\nhx : 0 ≤ x\nhy : 0 ≤ y\n⊢ sqrt x = sqrt y ↔ x = y",
"tactic": "simp [le_antisymm_iff, hx, hy]"
}
] | [
333,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
332,
1
] |
Mathlib/Topology/Maps.lean | IsOpenMap.preimage_frontier_eq_frontier_preimage | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.196791\nδ : Type ?u.196794\ninst✝² : TopologicalSpace α\ninst✝¹ : TopologicalSpace β\ninst✝ : TopologicalSpace γ\nf : α → β\nhf : IsOpenMap f\nhfc : Continuous f\ns : Set β\n⊢ f ⁻¹' frontier s = frontier (f ⁻¹' s)",
"t... | [
440,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
437,
1
] |
Mathlib/Tactic/NormNum/Core.lean | Mathlib.Meta.NormNum.IsNat.of_raw | [] | [
54,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | BddBelow.finite | [] | [
464,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
462,
1
] |
Mathlib/Order/Height.lean | Set.le_chainHeight_TFAE | [
{
"state_after": "case tfae_1_to_2\nα : Type u_1\nβ : Type ?u.5660\ninst✝¹ : LT α\ninst✝ : LT β\ns t : Set α\nl : List α\na : α\nn : ℕ\n⊢ ↑n ≤ chainHeight s → ∃ l, l ∈ subchain s ∧ length l = n\n\nα : Type u_1\nβ : Type ?u.5660\ninst✝¹ : LT α\ninst✝ : LT β\ns t : Set α\nl : List α\na : α\nn : ℕ\ntfae_1_to_2 : ↑... | [
117,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
1
] |
Mathlib/CategoryTheory/Bicategory/Basic.lean | CategoryTheory.Bicategory.pentagon_hom_hom_inv_inv_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).inv ▷ i ≫ (α_ (f ≫ g) h i).hom)",
"tactic": "simp"
}
] | [
304,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.sum_curry_index | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.536703\nι : Type ?u.536706\nM : Type u_3\nM' : Type ?u.536712\nN : Type u_4\nP : Type ?u.536718\nG : Type ?u.536721\nH : Type ?u.536724\nR : Type ?u.536727\nS : Type ?u.536730\ninst✝¹ : AddCommMonoid M\ninst✝ : AddCommMonoid N\nf : α × β →₀ M\ng : α → β ... | [
1240,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1228,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | MvPowerSeries.constantCoeff_invOfUnit | [
{
"state_after": "no goals",
"state_before": "σ : Type u_1\nR : Type u_2\ninst✝ : Ring R\nφ : MvPowerSeries σ R\nu : Rˣ\n⊢ ↑(constantCoeff σ R) (invOfUnit φ u) = ↑u⁻¹",
"tactic": "rw [← coeff_zero_eq_constantCoeff_apply, coeff_invOfUnit, if_pos rfl]"
}
] | [
856,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
854,
1
] |
Mathlib/Data/Finset/Sigma.lean | Finset.not_mem_sigmaLift_of_ne_right | [
{
"state_after": "ι : Type u_2\nα : ι → Type u_3\nβ : ι → Type u_4\nγ : ι → Type u_1\ninst✝ : DecidableEq ι\nf : ⦃i : ι⦄ → α i → β i → Finset (γ i)\na : Sigma α\nb : Sigma β\nx : Sigma γ\nh : b.fst ≠ x.fst\n⊢ ¬∃ ha hb, x.snd ∈ f (ha ▸ a.snd) (hb ▸ b.snd)",
"state_before": "ι : Type u_2\nα : ι → Type u_3\nβ ... | [
164,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/AlgebraicTopology/SplitSimplicialObject.lean | SimplicialObject.Splitting.IndexSet.eqId_iff_len_le | [
{
"state_after": "C : Type ?u.4924\ninst✝ : Category C\nΔ : SimplexCategoryᵒᵖ\nA : IndexSet Δ\n⊢ len A.fst.unop = len Δ.unop ↔ len Δ.unop ≤ len A.fst.unop",
"state_before": "C : Type ?u.4924\ninst✝ : Category C\nΔ : SimplexCategoryᵒᵖ\nA : IndexSet Δ\n⊢ EqId A ↔ len Δ.unop ≤ len A.fst.unop",
"tactic": "r... | [
163,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Basic.lean | BoxIntegral.Prepartition.eq_of_le | [] | [
91,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.pullbackComparison_comp_snd | [] | [
1457,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1454,
1
] |
Mathlib/Topology/Order/Basic.lean | exists_Icc_mem_subset_of_mem_nhds | [
{
"state_after": "case intro.intro.intro\nα : Type u\nβ : Type v\nγ : Type w\ninst✝² : TopologicalSpace α\ninst✝¹ : LinearOrder α\ninst✝ : OrderTopology α\na : α\ns : Set α\nhs : s ∈ 𝓝 a\nb : α\nhba : b ≤ a\nhb_nhds : Icc b a ∈ 𝓝[Iic a] a\nhbs : Icc b a ⊆ s\n⊢ ∃ b c, a ∈ Icc b c ∧ Icc b c ∈ 𝓝 a ∧ Icc b c ⊆ s... | [
1275,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1267,
1
] |
Mathlib/RingTheory/Multiplicity.lean | multiplicity.one_left | [] | [
190,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/Tactic/NormNum/Basic.lean | Mathlib.Meta.NormNum.isRat_pow | [
{
"state_after": "case mk.mk\nα : Type u_1\ninst✝ : Ring α\nan : ℤ\nad b : ℕ\ninv✝ : Invertible ↑ad\n⊢ IsRat ((↑an * ⅟↑ad) ^ b) (an ^ b) (ad ^ b)",
"state_before": "α : Type u_1\ninst✝ : Ring α\nf : α → ℕ → α\na : α\nan cn : ℤ\nad b b' cd : ℕ\n⊢ f = HPow.hPow → IsRat a an ad → IsNat b b' → Int.pow an b' = c... | [
442,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
435,
1
] |
Mathlib/Algebra/Hom/Group.lean | MonoidHom.comp_mul | [
{
"state_after": "case h\nα : Type ?u.215866\nβ : Type ?u.215869\nM : Type u_1\nN : Type u_2\nP : Type u_3\nG : Type ?u.215881\nH : Type ?u.215884\nF : Type ?u.215887\ninst✝⁴ : Group G\ninst✝³ : CommGroup H\ninst✝² : MulOneClass M\ninst✝¹ : CommMonoid N\ninst✝ : CommMonoid P\ng : N →* P\nf₁ f₂ : M →* N\nx✝ : M\... | [
1531,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1528,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearEquiv.coe_curry_symm | [] | [
1992,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1991,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | OrthogonalFamily.comp | [] | [
2065,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2063,
1
] |
Mathlib/Algebra/GroupWithZero/Power.lean | Commute.zpow_right₀ | [] | [
124,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/Analysis/NormedSpace/PiLp.lean | PiLp.dist_eq_iSup | [
{
"state_after": "p : ℝ≥0∞\n𝕜 : Type ?u.22498\n𝕜' : Type ?u.22501\nι : Type u_1\nα : ι → Type u_2\nβ : ι → Type ?u.22514\ninst✝¹ : Fintype ι\ninst✝ : (i : ι) → Dist (α i)\nf g : PiLp ⊤ α\n⊢ (if ⊤ = 0 then ↑(Finset.card (Finite.toFinset (_ : Set.Finite {i | f i ≠ g i})))\n else if ⊤ = ⊤ then ⨆ (i : ι), dist... | [
221,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
219,
1
] |
Mathlib/Analysis/Normed/Group/AddCircle.lean | AddCircle.norm_coe_mul | [
{
"state_after": "p x t : ℝ\naux : ∀ {a b c : ℝ}, a ∈ zmultiples b → c * a ∈ zmultiples (c * b)\n⊢ ‖↑(t * x)‖ = abs t * ‖↑x‖",
"state_before": "p x t : ℝ\n⊢ ‖↑(t * x)‖ = abs t * ‖↑x‖",
"tactic": "have aux : ∀ {a b c : ℝ}, a ∈ zmultiples b → c * a ∈ zmultiples (c * b) := fun {a b c} h => by\n simp only ... | [
71,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
47,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.mk_of_mem | [] | [
588,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
587,
1
] |
Mathlib/Computability/TuringMachine.lean | Turing.TM1to1.supportsStmt_write | [
{
"state_after": "no goals",
"state_before": "Γ : Type u_3\ninst✝² : Inhabited Γ\nΛ : Type u_2\ninst✝¹ : Inhabited Λ\nσ : Type u_1\ninst✝ : Inhabited σ\nn : ℕ\nenc : Γ → Vector Bool n\ndec : Vector Bool n → Γ\nS : Finset Λ'\nl : List Bool\nq : Stmt Bool Λ' σ\n⊢ SupportsStmt S (write l q) = SupportsStmt S q"... | [
1718,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1716,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.extend_mono | [
{
"state_after": "α : Type u_1\ninst✝ : MeasurableSpace α\nm : (s : Set α) → MeasurableSet s → ℝ≥0∞\nm0 : m ∅ (_ : MeasurableSet ∅) = 0\nmU :\n ∀ ⦃f : ℕ → Set α⦄ (hm : ∀ (i : ℕ), MeasurableSet (f i)),\n Pairwise (Disjoint on f) →\n m (⋃ (i : ℕ), f i) (_ : MeasurableSet (⋃ (b : ℕ), f b)) = ∑' (i : ℕ), m... | [
1571,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1563,
1
] |
Mathlib/Data/Set/Prod.lean | Set.prod_inter_prod | [
{
"state_after": "case h.mk\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.13537\nδ : Type ?u.13540\ns s₁ s₂ : Set α\nt t₁ t₂ : Set β\na : α\nb : β\nx : α\ny : β\n⊢ (x, y) ∈ s₁ ×ˢ t₁ ∩ s₂ ×ˢ t₂ ↔ (x, y) ∈ (s₁ ∩ s₂) ×ˢ (t₁ ∩ t₂)",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.13537\nδ : Type ?u.13540\ns... | [
173,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Order/Hom/Bounded.lean | BotHom.coe_comp | [] | [
452,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
451,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.int_cast_zmod_eq_zero_iff_dvd | [
{
"state_after": "no goals",
"state_before": "a : ℤ\nb : ℕ\n⊢ ↑a = 0 ↔ ↑b ∣ a",
"tactic": "rw [← Int.cast_zero, ZMod.int_cast_eq_int_cast_iff, Int.modEq_zero_iff_dvd]"
}
] | [
475,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
474,
1
] |
Mathlib/CategoryTheory/Abelian/NonPreadditive.lean | CategoryTheory.NonPreadditiveAbelian.sub_add | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝¹ : Category C\ninst✝ : NonPreadditiveAbelian C\nX Y : C\na b c : X ⟶ Y\n⊢ a - b + c = a - (b - c)",
"tactic": "rw [add_def, neg_def, sub_sub_sub, sub_zero]"
}
] | [
419,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
418,
1
] |
Mathlib/Topology/Basic.lean | AccPt.mono | [] | [
1197,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1196,
1
] |
Mathlib/Data/Option/Basic.lean | Option.map_comp_some | [] | [
76,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/Order/BooleanAlgebra.lean | inf_sdiff_eq_bot_iff | [
{
"state_after": "α : Type u\nβ : Type ?u.14724\nw x y z : α\ninst✝ : GeneralizedBooleanAlgebra α\nhz : z ≤ y\nhx : x ≤ y\n⊢ Disjoint z (y \\ x) ↔ z ≤ x",
"state_before": "α : Type u\nβ : Type ?u.14724\nw x y z : α\ninst✝ : GeneralizedBooleanAlgebra α\nhz : z ≤ y\nhx : x ≤ y\n⊢ z ⊓ y \\ x = ⊥ ↔ z ≤ x",
... | [
265,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
263,
1
] |
Mathlib/Data/Fintype/Card.lean | Finite.of_surjective | [] | [
444,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
443,
1
] |
Mathlib/Analysis/Calculus/Deriv/Star.lean | deriv.star | [] | [
63,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
11
] |
Mathlib/MeasureTheory/Group/Integration.lean | MeasureTheory.Integrable.comp_inv | [] | [
42,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
40,
1
] |
Mathlib/Data/Finset/Pi.lean | Finset.pi_empty | [] | [
91,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.integrable_smul_const | [
{
"state_after": "α : Type u_2\nβ : Type ?u.1111558\nγ : Type ?u.1111561\nδ : Type ?u.1111564\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝⁶ : MeasurableSpace δ\ninst✝⁵ : NormedAddCommGroup β\ninst✝⁴ : NormedAddCommGroup γ\n𝕜 : Type u_3\ninst✝³ : NontriviallyNormedField 𝕜\ninst✝² : CompleteSpace 𝕜\nE : Type... | [
1068,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1062,
1
] |
Mathlib/Order/GaloisConnection.lean | sSup_image2_eq_sSup_sInf | [] | [
389,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
386,
1
] |
Mathlib/Analysis/Normed/Group/HomCompletion.lean | NormedAddGroupHom.extension_coe | [] | [
222,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
221,
1
] |
Mathlib/Data/Complex/Exponential.lean | Complex.sin_add | [
{
"state_after": "no goals",
"state_before": "x y : ℂ\n⊢ sin (x + y) = sin x * cos y + cos x * sin y",
"tactic": "rw [← mul_left_inj' I_ne_zero, ← sinh_mul_I, add_mul, add_mul, mul_right_comm, ← sinh_mul_I,\n mul_assoc, ← sinh_mul_I, ← cosh_mul_I, ← cosh_mul_I, sinh_add]"
}
] | [
849,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
847,
1
] |
Mathlib/Data/Complex/Exponential.lean | Complex.isCauSeq_abs_exp | [
{
"state_after": "no goals",
"state_before": "z : ℂ\nn : ℕ\nhn : ↑abs z < ↑n\nhn0 : 0 < ↑n\n⊢ ↑abs z / ↑n < 1",
"tactic": "rwa [div_lt_iff hn0, one_mul]"
},
{
"state_after": "z : ℂ\nn : ℕ\nhn : ↑abs z < ↑n\nhn0 : 0 < ↑n\nm : ℕ\nhm : n ≤ m\n⊢ ↑abs z / ↑(Nat.succ m) * ↑abs (z ^ m / ↑(Nat.factorial... | [
363,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
354,
1
] |
Mathlib/Topology/Homeomorph.lean | Homeomorph.trans_apply | [] | [
124,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/Data/List/Rotate.lean | List.rotate_append_length_eq | [
{
"state_after": "α : Type u\nl l' : List α\n⊢ rotate' (l ++ l') (length l) = l' ++ l",
"state_before": "α : Type u\nl l' : List α\n⊢ rotate (l ++ l') (length l) = l' ++ l",
"tactic": "rw [rotate_eq_rotate']"
},
{
"state_after": "case nil\nα : Type u\nl' : List α\n⊢ rotate' ([] ++ l') (length []... | [
159,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/Algebra/Star/Pointwise.lean | Set.mem_star | [] | [
62,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/Data/List/Card.lean | List.card_le_card_cons | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Sort ?u.22986\ninst✝¹ : DecidableEq α\ninst✝ : DecidableEq β\na : α\nas : List α\n⊢ card as ≤ card (a :: as)",
"tactic": "cases Decidable.em (a ∈ as) with\n| inl h => simp [h, Nat.le_refl]\n| inr h => simp [h, Nat.le_succ]"
},
{
"st... | [
90,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Analysis/Convex/Jensen.lean | ConcaveOn.exists_le_of_centerMass | [] | [
125,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/Analysis/Complex/Arg.lean | Complex.abs_sub_eq_iff | [] | [
57,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
56,
1
] |
Mathlib/LinearAlgebra/TensorProduct.lean | LinearMap.lTensor_id | [] | [
1096,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1095,
1
] |
Mathlib/Topology/Algebra/Group/Basic.lean | QuotientGroup.isOpenMap_coe | [
{
"state_after": "α : Type u\nβ : Type v\nG : Type w\nH : Type x\ninst✝² : TopologicalSpace G\ninst✝¹ : Group G\ninst✝ : TopologicalGroup G\nN : Subgroup G\nn : Subgroup.Normal N\ns : Set G\ns_op : IsOpen s\n⊢ IsOpen (mk '' s)",
"state_before": "α : Type u\nβ : Type v\nG : Type w\nH : Type x\ninst✝² : Topol... | [
980,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
976,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | zmultiplesAddHom_symm_apply | [] | [
1016,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1014,
1
] |
Mathlib/Init/Algebra/Order.lean | lt_or_eq_of_le | [] | [
233,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
232,
1
] |
Mathlib/Topology/Order.lean | TopologicalSpace.gc_generateFrom | [] | [
191,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
188,
1
] |
Mathlib/Data/MvPolynomial/Supported.lean | MvPolynomial.supported_le_supported_iff | [
{
"state_after": "case mp\nσ : Type u_1\nτ : Type ?u.129141\nR : Type u\nS : Type v\nr : R\ne : ℕ\nn m : σ\ninst✝¹ : CommSemiring R\np q : MvPolynomial σ R\ns t : Set σ\ninst✝ : Nontrivial R\n⊢ supported R s ≤ supported R t → s ⊆ t\n\ncase mpr\nσ : Type u_1\nτ : Type ?u.129141\nR : Type u\nS : Type v\nr : R\ne ... | [
130,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/Algebra/Group/Basic.lean | div_mul | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.36695\nG : Type ?u.36698\ninst✝ : DivisionCommMonoid α\na b c d : α\n⊢ a / b * c = a / (b / c)",
"tactic": "simp"
}
] | [
545,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
545,
1
] |
Mathlib/Order/PartialSups.lean | partialSups_mono | [
{
"state_after": "α : Type u_1\ninst✝ : SemilatticeSup α\nf g : ℕ → α\nh : f ≤ g\nn : ℕ\n⊢ ↑(partialSups f) n ≤ ↑(partialSups g) n",
"state_before": "α : Type u_1\ninst✝ : SemilatticeSup α\n⊢ Monotone partialSups",
"tactic": "rintro f g h n"
},
{
"state_after": "case zero\nα : Type u_1\ninst✝ : ... | [
106,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Std/Data/Option/Lemmas.lean | Option.join_map_eq_map_join | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nf : α → β\nx : Option (Option α)\n⊢ join (Option.map (Option.map f) x) = Option.map f (join x)",
"tactic": "cases x <;> simp"
}
] | [
160,
70
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
159,
1
] |
Mathlib/Data/PNat/Prime.lean | PNat.coprime_one | [] | [
255,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Mathlib/CategoryTheory/Iso.lean | CategoryTheory.Iso.eq_inv_comp | [] | [
226,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
1
] |
Mathlib/Algebra/Quaternion.lean | QuaternionAlgebra.mul_imJ | [] | [
337,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
337,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.option_orElse | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.139430\nγ : Type ?u.139433\nδ : Type ?u.139436\nσ : Type ?u.139439\ninst✝⁴ : Primcodable α\ninst✝³ : Primcodable β\ninst✝² : Primcodable γ\ninst✝¹ : Primcodable δ\ninst✝ : Primcodable σ\nx✝ : Option α × Option α\no₁ o₂ : Option α\n⊢ (Op... | [
765,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
764,
1
] |
Mathlib/LinearAlgebra/Basis.lean | Basis.repr_sum_self | [
{
"state_after": "case h\nι : Type u_1\nι' : Type ?u.673229\nR : Type u_2\nR₂ : Type ?u.673235\nK : Type ?u.673238\nM : Type u_3\nM' : Type ?u.673244\nM'' : Type ?u.673247\nV : Type u\nV' : Type ?u.673252\ninst✝⁵ : Semiring R\ninst✝⁴ : AddCommMonoid M\ninst✝³ : Module R M\ninst✝² : AddCommMonoid M'\ninst✝¹ : Mo... | [
950,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
941,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean | CategoryTheory.Limits.biproduct.components_matrix | [
{
"state_after": "case w.w\nJ : Type\ninst✝⁴ : Fintype J\nK : Type\ninst✝³ : Fintype K\nC : Type u\ninst✝² : Category C\ninst✝¹ : HasZeroMorphisms C\ninst✝ : HasFiniteBiproducts C\nf : J → C\ng : K → C\nm : ⨁ f ⟶ ⨁ g\nj✝¹ : J\nj✝ : K\n⊢ (ι (fun j => f j) j✝¹ ≫ matrix fun j k => components m j k) ≫ π (fun k => g... | [
858,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
855,
1
] |
Mathlib/MeasureTheory/MeasurableSpace.lean | measurable_of_subsingleton_codomain | [] | [
254,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
253,
1
] |
Mathlib/GroupTheory/Subgroup/Pointwise.lean | Subgroup.smul_inf | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nG : Type u_1\nA : Type ?u.151816\nS✝ : Type ?u.151819\ninst✝³ : Group G\ninst✝² : AddGroup A\ns : Set G\ninst✝¹ : Group α\ninst✝ : MulDistribMulAction α G\na : α\nS T : Subgroup G\n⊢ a • (S ⊓ T) = a • S ⊓ a • T",
"tactic": "simp [SetLike.ext_if... | [
367,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
366,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.