file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/Data/Set/Pointwise/Basic.lean | Set.Nonempty.one_mem_div | [] | [
1182,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1180,
1
] |
Mathlib/LinearAlgebra/Matrix/Determinant.lean | Matrix.det_permutation | [
{
"state_after": "no goals",
"state_before": "m : Type ?u.1185437\nn : Type u_1\ninst✝⁴ : DecidableEq n\ninst✝³ : Fintype n\ninst✝² : DecidableEq m\ninst✝¹ : Fintype m\nR : Type v\ninst✝ : CommRing R\nσ : Perm n\n⊢ det (PEquiv.toMatrix (toPEquiv σ)) = ↑↑(↑sign σ)",
"tactic": "rw [← Matrix.mul_one (σ.toP... | [
276,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
1
] |
Std/Data/List/Lemmas.lean | List.iota_eq_reverse_range' | [
{
"state_after": "no goals",
"state_before": "n : Nat\n⊢ iota (n + 1) = reverse (range' 1 (n + 1))",
"tactic": "simp [iota, range'_concat, iota_eq_reverse_range' n, reverse_append, Nat.add_comm]"
}
] | [
1934,
99
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1932,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.mem_coe | [] | [
212,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
211,
1
] |
Mathlib/Computability/Reduce.lean | ManyOneDegree.ind_on | [] | [
380,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
11
] |
Mathlib/Order/Partition/Equipartition.lean | Finpartition.bot_isEquipartition | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : DecidableEq α\ns t : Finset α\nP : Finpartition s\n⊢ ∀ (a : Finset α), a ∈ ↑⊥.parts → Finset.card a = 1 ∨ Finset.card a = 1 + 1",
"tactic": "simp"
}
] | [
74,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Independent.lean | affineIndependent_iff_indicator_eq_of_affineCombination_eq | [
{
"state_after": "case mp\nk : Type u_1\nV : Type u_2\nP : Type u_3\ninst✝³ : Ring k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\nι : Type u_4\np : ι → P\n⊢ AffineIndependent k p →\n ∀ (s1 s2 : Finset ι) (w1 w2 : ι → k),\n ∑ i in s1, w1 i = 1 →\n ∑ i in s2, w2 i = 1 →\n... | [
234,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Analysis/Convex/Between.lean | affineSegment_eq_segment | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nV : Type u_1\nV' : Type ?u.5184\nP : Type ?u.5187\nP' : Type ?u.5190\ninst✝⁶ : OrderedRing R\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P'\nx y : V\n⊢ ... | [
52,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
51,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.map_sup | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ✝ : Type ?u.78827\nR : Type ?u.78830\nR' : Type ?u.78833\nms : Set (OuterMeasure α)\nm✝ : OuterMeasure α\nβ : Type u_1\nf : α → β\nm m' : OuterMeasure α\ns : Set β\n⊢ ↑(↑(map f) (m ⊔ m')) s = ↑(↑(map f) m ⊔ ↑(map f) m') s",
"tactic": "simp onl... | [
478,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
477,
1
] |
Mathlib/NumberTheory/Padics/Hensel.lean | T_lt_one | [
{
"state_after": "p : ℕ\ninst✝ : Fact (Nat.Prime p)\nF : Polynomial ℤ_[p]\na : ℤ_[p]\nhnorm : ‖Polynomial.eval a F‖ < ‖Polynomial.eval a (↑Polynomial.derivative F)‖ ^ 2\nhnsol : Polynomial.eval a F ≠ 0\nh : ‖Polynomial.eval a F‖ / ‖Polynomial.eval a (↑Polynomial.derivative F)‖ ^ 2 < 1\n⊢ T_gen p F a < 1",
"... | [
131,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
9
] |
Mathlib/Data/Set/Prod.lean | Set.mk_preimage_prod | [] | [
221,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
219,
1
] |
Mathlib/Analysis/Normed/Group/Pointwise.lean | singleton_div_ball_one | [
{
"state_after": "no goals",
"state_before": "E : Type u_1\ninst✝ : SeminormedCommGroup E\nε δ : ℝ\ns t : Set E\nx y : E\n⊢ {x} / ball 1 δ = ball x δ",
"tactic": "rw [singleton_div_ball, div_one]"
}
] | [
135,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/Data/Nat/Factorization/Basic.lean | Nat.ord_compl_dvd | [] | [
379,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/Data/List/Destutter.lean | List.mem_destutter' | [
{
"state_after": "case nil\nα : Type u_1\nl : List α\nR : α → α → Prop\ninst✝ : DecidableRel R\na✝ b a : α\n⊢ a ∈ destutter' R a []\n\ncase cons\nα : Type u_1\nl✝ : List α\nR : α → α → Prop\ninst✝ : DecidableRel R\na✝ b✝ a b : α\nl : List α\nhl : a ∈ destutter' R a l\n⊢ a ∈ destutter' R a (b :: l)",
"state_... | [
82,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/Algebra/GroupPower/Order.lean | MonoidHom.map_neg_one | [
{
"state_after": "no goals",
"state_before": "β : Type ?u.293119\nA : Type ?u.293122\nG : Type ?u.293125\nM : Type u_1\nR : Type u_2\ninst✝³ : Ring R\ninst✝² : Monoid M\ninst✝¹ : LinearOrder M\ninst✝ : CovariantClass M M (fun x x_1 => x * x_1) fun x x_1 => x ≤ x_1\nf : R →* M\n⊢ ↑f (-1) ^ Nat.succ 1 = 1",
... | [
801,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
800,
1
] |
Mathlib/RingTheory/Ideal/QuotientOperations.lean | Ideal.kerLiftAlg_toRingHom | [] | [
300,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
298,
1
] |
Mathlib/CategoryTheory/Sites/Grothendieck.lean | CategoryTheory.GrothendieckTopology.pullback_stable | [] | [
131,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/LinearAlgebra/Prod.lean | LinearMap.tailings_zero | [
{
"state_after": "no goals",
"state_before": "R : Type u\nK : Type u'\nM : Type v\nV : Type v'\nM₂ : Type w\nV₂ : Type w'\nM₃ : Type y\nV₃ : Type y'\nM₄ : Type z\nι : Type x\nM₅ : Type ?u.564691\nM₆ : Type ?u.564694\ninst✝⁴ : Ring R\nN : Type u_1\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\ninst✝¹ : AddCo... | [
965,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
964,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.end_mem_support | [
{
"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\np : Walk G u v\n⊢ v ∈ support p",
"tactic": "induction p <;> simp [*]"
}
] | [
579,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
579,
1
] |
Mathlib/Data/Finsupp/Basic.lean | IsSMulRegular.finsupp | [] | [
1508,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1506,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | Commute.self_cast_int_mul_cast_int_mul | [] | [
1197,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1196,
1
] |
Mathlib/Data/Complex/Module.lean | AlgHom.map_coe_real_complex | [] | [
123,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/CategoryTheory/Adjunction/Opposites.lean | CategoryTheory.Adjunction.leftAdjointUniq_trans | [
{
"state_after": "case w.h\nC : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nF F' F'' : C ⥤ D\nG : D ⥤ C\nadj1 : F ⊣ G\nadj2 : F' ⊣ G\nadj3 : F'' ⊣ G\nx✝ : C\n⊢ ((leftAdjointUniq adj1 adj2).hom ≫ (leftAdjointUniq adj2 adj3).hom).app x✝ = (leftAdjointUniq adj1 adj3).hom.app x✝",
"state_befo... | [
193,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.darts_cons | [] | [
690,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
689,
1
] |
Mathlib/Analysis/Complex/Basic.lean | Complex.restrictScalars_one_smulRight | [
{
"state_after": "case h\nE : Type ?u.361704\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℂ E\nx z : ℂ\n⊢ ↑(restrictScalars ℝ (smulRight 1 x)) z = ↑(x • 1) z",
"state_before": "E : Type ?u.361704\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℂ E\nx : ℂ\n⊢ restrictScalars ℝ (smulRight 1 x) = x •... | [
307,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
302,
1
] |
Mathlib/Topology/IsLocallyHomeomorph.lean | IsLocallyHomeomorphOn.continuousOn | [] | [
72,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
11
] |
Mathlib/RingTheory/AdjoinRoot.lean | AdjoinRoot.coe_injective' | [] | [
421,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
420,
1
] |
Mathlib/Analysis/Calculus/Deriv/Add.lean | HasDerivWithinAt.sum | [] | [
177,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
175,
1
] |
Mathlib/Topology/Algebra/StarSubalgebra.lean | StarAlgHomClass.ext_topologicalClosure | [
{
"state_after": "R : Type u_3\nA : Type u_4\nB : Type u_1\ninst✝¹⁴ : CommSemiring R\ninst✝¹³ : StarRing R\ninst✝¹² : TopologicalSpace A\ninst✝¹¹ : Semiring A\ninst✝¹⁰ : Algebra R A\ninst✝⁹ : StarRing A\ninst✝⁸ : StarModule R A\ninst✝⁷ : TopologicalSemiring A\ninst✝⁶ : ContinuousStar A\ninst✝⁵ : TopologicalSpac... | [
159,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.le_eq_subset | [] | [
397,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
396,
1
] |
Mathlib/Geometry/Euclidean/Basic.lean | EuclideanGeometry.inter_eq_singleton_orthogonalProjection | [
{
"state_after": "V : Type u_1\nP : Type u_2\ninst✝⁵ : NormedAddCommGroup V\ninst✝⁴ : InnerProductSpace ℝ V\ninst✝³ : MetricSpace P\ninst✝² : NormedAddTorsor V P\ns : AffineSubspace ℝ P\ninst✝¹ : Nonempty { x // x ∈ s }\ninst✝ : CompleteSpace { x // x ∈ direction s }\np : P\n⊢ ↑s ∩ ↑(mk' p (direction s)ᗮ) = {or... | [
345,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
341,
1
] |
Mathlib/GroupTheory/Submonoid/Inverses.lean | Submonoid.leftInvEquiv_symm_mul | [
{
"state_after": "case h.e'_2.h.e'_6.h.e'_3\nM : Type u_1\ninst✝ : CommMonoid M\nS : Submonoid M\nhS : S ≤ IsUnit.submonoid M\nx : { x // x ∈ S }\n⊢ x = ↑(leftInvEquiv S hS) (↑(MulEquiv.symm (leftInvEquiv S hS)) x)",
"state_before": "M : Type u_1\ninst✝ : CommMonoid M\nS : Submonoid M\nhS : S ≤ IsUnit.submo... | [
211,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Ioc_eq_empty_of_le | [] | [
114,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Mathlib/NumberTheory/ArithmeticFunction.lean | Nat.ArithmeticFunction.zero_apply | [] | [
107,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
106,
1
] |
Mathlib/Order/SuccPred/Basic.lean | Order.Iio_succ | [] | [
367,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
366,
1
] |
Mathlib/GroupTheory/Commensurable.lean | Commensurable.commensurator_mem_iff | [] | [
112,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
111,
1
] |
Mathlib/Algebra/Algebra/Tower.lean | AlgHom.restrictScalars_apply | [] | [
194,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/Combinatorics/SimpleGraph/Coloring.lean | SimpleGraph.colorable_set_nonempty_of_colorable | [] | [
246,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
244,
1
] |
Mathlib/Order/Iterate.lean | Monotone.iterate_comp_le_of_le | [] | [
105,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
1
] |
Mathlib/Analysis/Calculus/Series.lean | tendstoUniformly_tsum_nat | [] | [
78,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.sumAddHom_singleAddHom | [] | [
2068,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2066,
1
] |
Mathlib/Order/Lattice.lean | SemilatticeInf.ext | [
{
"state_after": "α✝ : Type u\nβ : Type v\ninst✝ : SemilatticeInf α✝\na b c d : α✝\nα : Type u_1\nA B : SemilatticeInf α\nH : ∀ (x y : α), x ≤ y ↔ x ≤ y\nss : toInf = toInf\n⊢ A = B",
"state_before": "α✝ : Type u\nβ : Type v\ninst✝ : SemilatticeInf α✝\na b c d : α✝\nα : Type u_1\nA B : SemilatticeInf α\nH :... | [
577,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
570,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | preimage_mul_ball | [
{
"state_after": "case h\n𝓕 : Type ?u.743408\n𝕜 : Type ?u.743411\nα : Type ?u.743414\nι : Type ?u.743417\nκ : Type ?u.743420\nE : Type u_1\nF : Type ?u.743426\nG : Type ?u.743429\ninst✝¹ : SeminormedCommGroup E\ninst✝ : SeminormedCommGroup F\na✝ a₁ a₂ b✝ b₁ b₂ : E\nr✝ r₁ r₂ : ℝ\na b : E\nr : ℝ\nc : E\n⊢ c ∈ (... | [
1528,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1526,
1
] |
Std/Data/Nat/Lemmas.lean | Nat.sub_mul_div | [
{
"state_after": "no goals",
"state_before": "x n p : Nat\nh₁ : n * p ≤ x\n⊢ (x - n * p) / n = x / n - p",
"tactic": "match eq_zero_or_pos n with\n| .inl h₀ => rw [h₀, Nat.div_zero, Nat.div_zero, Nat.zero_sub]\n| .inr h₀ => induction p with\n | zero => rw [Nat.mul_zero, Nat.sub_zero, Nat.sub_zero]\n |... | [
558,
59
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
545,
1
] |
Mathlib/Topology/Spectral/Hom.lean | SpectralMap.coe_comp_continuousMap | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.8928\nα : Type u_3\nβ : Type u_1\nγ : Type u_2\nδ : Type ?u.8940\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\nf : SpectralMap β γ\ng : SpectralMap α β\n⊢ ↑f ∘ ↑g = ↑(ContinuousMap... | [
192,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/Data/Polynomial/RingDivision.lean | Polynomial.mem_roots_sub_C | [] | [
643,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
641,
1
] |
Mathlib/Probability/ProbabilityMassFunction/Constructions.lean | Pmf.monad_map_eq_map | [] | [
49,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
49,
1
] |
Mathlib/Probability/Kernel/Basic.lean | ProbabilityTheory.kernel.set_lintegral_piecewise | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nι : Type ?u.1469486\nmα : MeasurableSpace α\nmβ : MeasurableSpace β\nκ η : { x // x ∈ kernel α β }\ns : Set α\nhs : MeasurableSet s\ninst✝ : DecidablePred fun x => x ∈ s\na : α\ng : β → ℝ≥0∞\nt : Set β\n⊢ (∫⁻ (b : β) in t, g b ∂if a ∈ s then ↑κ a else ↑η a) =\n i... | [
656,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
653,
1
] |
Mathlib/Data/Finset/PImage.lean | Finset.pimage_mono | [] | [
120,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/Analysis/NormedSpace/FiniteDimension.lean | summable_of_isBigO' | [] | [
686,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
683,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.mapDomain_notin_range | [
{
"state_after": "α : Type u_1\nβ : Type u_3\nγ : Type ?u.158167\nι : Type ?u.158170\nM : Type u_2\nM' : Type ?u.158176\nN : Type ?u.158179\nP : Type ?u.158182\nG : Type ?u.158185\nH : Type ?u.158188\nR : Type ?u.158191\nS : Type ?u.158194\ninst✝ : AddCommMonoid M\nv v₁ v₂ : α →₀ M\nf : α → β\nx : α →₀ M\na : β... | [
464,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
461,
1
] |
Mathlib/GroupTheory/Submonoid/Operations.lean | Submonoid.closure_closure_coe_preimage | [
{
"state_after": "case refine'_1\nM : Type u_1\nN : Type ?u.95294\nP : Type ?u.95297\ninst✝³ : MulOneClass M\ninst✝² : MulOneClass N\ninst✝¹ : MulOneClass P\nS : Submonoid M\nA : Type ?u.95318\ninst✝ : SetLike A M\nhA : SubmonoidClass A M\nS' : A\ns : Set M\nx✝¹ : { x // x ∈ ↑(closure s) }\nx : M\nhx : x ∈ ↑(cl... | [
833,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
828,
1
] |
Mathlib/RingTheory/AdjoinRoot.lean | AdjoinRoot.Minpoly.toAdjoin_apply' | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nK : Type w\ninst✝² : CommRing R\ninst✝¹ : CommRing S\ninst✝ : Algebra R S\nx : S\na : AdjoinRoot (minpoly R x)\n⊢ ↑(aeval { val := x, property := (_ : x ∈ adjoin R {x}) }) (minpoly R x) = 0",
"tactic": "simp [← Subalgebra.coe_eq_zero,... | [
632,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
628,
1
] |
Mathlib/RingTheory/Subring/Basic.lean | Subring.map_id | [] | [
609,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
608,
1
] |
Mathlib/Algebra/Order/Monoid/WithTop.lean | WithBot.add_lt_add_left | [] | [
686,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
684,
11
] |
Mathlib/Algebra/Hom/Equiv/Basic.lean | MulEquiv.equivLike_inv_eq_symm | [] | [
281,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
281,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | lcm_dvd_lcm_mul_right_right | [] | [
861,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
860,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.ediam_univ_eq_top_iff_noncompact | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.534313\nι : Type ?u.534316\ninst✝¹ : PseudoMetricSpace α\ns : Set α\nx y z : α\ninst✝ : ProperSpace α\n⊢ EMetric.diam univ = ⊤ ↔ NoncompactSpace α",
"tactic": "rw [← not_compactSpace_iff, compactSpace_iff_bounded_univ, bou... | [
2662,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2659,
1
] |
Mathlib/Algebra/DirectSum/Internal.lean | DirectSum.coe_mul_apply | [
{
"state_after": "ι : Type u_1\nσ : Type u_3\nS : Type ?u.100155\nR : Type u_2\ninst✝⁶ : DecidableEq ι\ninst✝⁵ : Semiring R\ninst✝⁴ : SetLike σ R\ninst✝³ : AddSubmonoidClass σ R\nA : ι → σ\ninst✝² : AddMonoid ι\ninst✝¹ : SetLike.GradedMonoid A\ninst✝ : (i : ι) → (x : { x // x ∈ A i }) → Decidable (x ≠ 0)\nr r' ... | [
164,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/Analysis/NormedSpace/AddTorsor.lean | dist_midpoint_left | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.60686\nV : Type u_3\nP : Type u_1\nW : Type ?u.60695\nQ : Type ?u.60698\ninst✝⁹ : SeminormedAddCommGroup V\ninst✝⁸ : PseudoMetricSpace P\ninst✝⁷ : NormedAddTorsor V P\ninst✝⁶ : NormedAddCommGroup W\ninst✝⁵ : MetricSpace Q\ninst✝⁴ : NormedAddTorsor W ... | [
182,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
181,
1
] |
Mathlib/Data/Sym/Sym2.lean | Sym2.exists | [] | [
133,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
11
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.relabel_moveRight | [
{
"state_after": "no goals",
"state_before": "x : PGame\nxl' xr' : Type u_1\nel : xl' ≃ LeftMoves x\ner : xr' ≃ RightMoves x\nj : RightMoves x\n⊢ moveRight (relabel el er) (↑er.symm j) = moveRight x j",
"tactic": "simp"
}
] | [
1166,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1165,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.toSubgraph_append | [
{
"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 w : V\np : Walk G u v\nq : Walk G v w\n⊢ Walk.toSubgraph (append p q) = Walk.toSubgraph p ⊔ Walk.toSubgraph q",
"tactic": "induction p <;> simp [*, sup_... | [
2254,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2253,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.sInf_eq_boundedBy_sInfGen | [
{
"state_after": "case refine'_1\nα : Type u_1\nm : Set (OuterMeasure α)\n⊢ sInf m ≤ boundedBy (sInfGen m)\n\ncase refine'_2\nα : Type u_1\nm : Set (OuterMeasure α)\n⊢ boundedBy (sInfGen m) ≤ sInf m",
"state_before": "α : Type u_1\nm : Set (OuterMeasure α)\n⊢ sInf m = boundedBy (sInfGen m)",
"tactic": "... | [
1155,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1148,
1
] |
Mathlib/Data/Bool/Basic.lean | Bool.decide_coe | [
{
"state_after": "case false\nh : Decidable (false = true)\n⊢ decide (false = true) = false\n\ncase true\nh : Decidable (true = true)\n⊢ decide (true = true) = true",
"state_before": "b : Bool\nh : Decidable (b = true)\n⊢ decide (b = true) = b",
"tactic": "cases b"
},
{
"state_after": "no goals"... | [
40,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Mathlib/Topology/Algebra/ConstMulAction.lean | ContinuousOn.const_smul | [] | [
106,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
105,
1
] |
Std/WF.lean | WellFounded.fix_eq_fixC | [
{
"state_after": "case h.h.h.h.h.h\nα : Sort u_1\nC : α → Sort u_2\nr : α → α → Prop\nhwf : WellFounded r\nF : (x : α) → ((y : α) → r y x → C y) → C x\nx : α\n⊢ fix hwf F x = WellFounded.fixC hwf F x",
"state_before": "⊢ @fix = @WellFounded.fixC",
"tactic": "funext α C r hwf F x"
},
{
"state_aft... | [
111,
32
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
109,
18
] |
Mathlib/Data/List/Sublists.lean | List.mem_sublists' | [
{
"state_after": "case nil\nα : Type u\nβ : Type v\nγ : Type w\ns✝ s : List α\n⊢ s ∈ sublists' [] ↔ s <+ []\n\ncase cons\nα : Type u\nβ : Type v\nγ : Type w\ns✝ : List α\na : α\nt : List α\nIH : ∀ {s : List α}, s ∈ sublists' t ↔ s <+ t\ns : List α\n⊢ s ∈ sublists' (a :: t) ↔ s <+ a :: t",
"state_before": "α... | [
95,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Order/Filter/NAry.lean | Filter.NeBot.of_map₂_right | [] | [
143,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Mathlib/Algebra/Homology/HomologicalComplex.lean | HomologicalComplex.Hom.sqFrom_left | [] | [
563,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
562,
1
] |
Mathlib/Data/Bitvec/Lemmas.lean | Bitvec.bits_toNat_decide | [
{
"state_after": "n : ℕ\n⊢ bitsToNat [decide (n % 2 = 1)] = n % 2",
"state_before": "n : ℕ\n⊢ Bitvec.toNat (decide (n % 2 = 1) ::ᵥ Vector.nil) = n % 2",
"tactic": "simp [bitsToNat_toList]"
},
{
"state_after": "n : ℕ\n⊢ List.foldl (fun r b => r + r + bif b then 1 else 0) (0 + 0 + bif decide (n % ... | [
65,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/LinearAlgebra/Prod.lean | LinearEquiv.coe_prod | [] | [
793,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
791,
1
] |
Mathlib/LinearAlgebra/SesquilinearForm.lean | LinearMap.IsAlt.neg | [
{
"state_after": "R : Type u_1\nR₁ : Type u_3\nR₂ : Type ?u.184837\nR₃ : Type ?u.184840\nM : Type ?u.184843\nM₁ : Type u_2\nM₂ : Type ?u.184849\nMₗ₁ : Type ?u.184852\nMₗ₁' : Type ?u.184855\nMₗ₂ : Type ?u.184858\nMₗ₂' : Type ?u.184861\nK : Type ?u.184864\nK₁ : Type ?u.184867\nK₂ : Type ?u.184870\nV : Type ?u.184... | [
282,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
278,
1
] |
Mathlib/Order/RelIso/Basic.lean | RelIso.cast_trans | [
{
"state_after": "α✝ : Type ?u.81083\nβ : Type ?u.81086\nγ✝ : Type ?u.81089\nδ : Type ?u.81092\nr✝ : α✝ → α✝ → Prop\ns✝ : β → β → Prop\nt✝ : γ✝ → γ✝ → Prop\nu : δ → δ → Prop\nα γ : Type u\nr : α → α → Prop\nt : γ → γ → Prop\nx : α\ns : α → α → Prop\nh₁' : α = γ\nh₂ : HEq r s\nh₂' : HEq s t\n⊢ ↑(RelIso.trans (Re... | [
771,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
768,
11
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.exists_subset_measure_lt_top | [
{
"state_after": "α : Type u_1\nβ : Type ?u.731841\nγ : Type ?u.731844\nδ : Type ?u.731847\nι : Type ?u.731850\nR : Type ?u.731853\nR' : Type ?u.731856\nm0 : MeasurableSpace α\ninst✝² : MeasurableSpace β\ninst✝¹ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set α\ninst✝ : SigmaFinite μ\nr : ℝ... | [
3551,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3543,
1
] |
Mathlib/Analysis/InnerProductSpace/Orthogonal.lean | Submodule.orthogonal_orthogonal_monotone | [] | [
165,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/GroupTheory/SemidirectProduct.lean | SemidirectProduct.map_left | [] | [
284,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
1
] |
Mathlib/Algebra/Group/Units.lean | Units.ext | [
{
"state_after": "α : Type u\ninst✝ : Monoid α\nv i₁ : α\nvi₁ : v * i₁ = 1\niv₁ : i₁ * v = 1\nv' i₂ : α\nvi₂ : v' * i₂ = 1\niv₂ : i₂ * v' = 1\ne : v = v'\n⊢ { val := v, inv := i₁, val_inv := vi₁, inv_val := iv₁ } = { val := v', inv := i₂, val_inv := vi₂, inv_val := iv₂ }",
"state_before": "α : Type u\ninst✝... | [
138,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
135,
1
] |
Mathlib/LinearAlgebra/Matrix/Hermitian.lean | Matrix.IsHermitian.coe_re_diag | [] | [
270,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Mathlib/Data/Nat/Fib.lean | Nat.fib_add_two | [
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ fib (n + 2) = fib n + fib (n + 1)",
"tactic": "simp [fib, Function.iterate_succ_apply']"
}
] | [
94,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/LinearAlgebra/Matrix/ZPow.lean | Matrix.zpow_neg_one | [
{
"state_after": "case h.e'_3.h.e'_3\nn' : Type u_1\ninst✝² : DecidableEq n'\ninst✝¹ : Fintype n'\nR : Type u_2\ninst✝ : CommRing R\nA : M\n⊢ A = DivInvMonoid.zpow (↑(Nat.succ 0)) A",
"state_before": "n' : Type u_1\ninst✝² : DecidableEq n'\ninst✝¹ : Fintype n'\nR : Type u_2\ninst✝ : CommRing R\nA : M\n⊢ A ^... | [
109,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Analysis/MeanInequalities.lean | NNReal.isGreatest_Lp | [
{
"state_after": "case left\nι : Type u\ns : Finset ι\nf : ι → ℝ≥0\np q : ℝ\nhpq : Real.IsConjugateExponent p q\n⊢ (∑ i in s, f i ^ p) ^ (1 / p) ∈ (fun g => ∑ i in s, f i * g i) '' {g | ∑ i in s, g i ^ q ≤ 1}\n\ncase right\nι : Type u\ns : Finset ι\nf : ι → ℝ≥0\np q : ℝ\nhpq : Real.IsConjugateExponent p q\n⊢ (∑... | [
471,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
452,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.coe_scott_continuous | [] | [
333,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
331,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.diam_closedBall | [] | [
2725,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2724,
1
] |
Mathlib/Analysis/Normed/Group/Quotient.lean | Submodule.Quotient.norm_mk_le | [] | [
464,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
463,
1
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | SemilinearIsometryClass.ediam_range | [] | [
116,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/Data/Complex/Basic.lean | Complex.normSq_pos | [] | [
644,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
643,
1
] |
Mathlib/Data/Fin/Tuple/Sort.lean | Tuple.graph.card | [
{
"state_after": "n : ℕ\nα : Type u_1\ninst✝ : LinearOrder α\nf : Fin n → α\n⊢ Finset.card Finset.univ = n\n\ncase H\nn : ℕ\nα : Type u_1\ninst✝ : LinearOrder α\nf : Fin n → α\n⊢ Function.Injective fun i => (f i, i)",
"state_before": "n : ℕ\nα : Type u_1\ninst✝ : LinearOrder α\nf : Fin n → α\n⊢ Finset.card ... | [
60,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Algebra/MonoidAlgebra/Basic.lean | AddMonoidAlgebra.mapDomain_single | [] | [
1223,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1221,
1
] |
Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean | PrimeSpectrum.gc | [] | [
195,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/Data/Finset/Option.lean | Finset.mem_eraseNone | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.7248\ns : Finset (Option α)\nx : α\n⊢ x ∈ ↑eraseNone s ↔ some x ∈ s",
"tactic": "simp [eraseNone]"
}
] | [
94,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/Data/Seq/Computation.lean | Computation.destruct_empty | [] | [
156,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.Fuzzy.swap | [] | [
906,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
905,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.iInf_ne_top | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.38037\na b c d : ℝ≥0∞\nr p q : ℝ≥0\ninst✝ : CompleteLattice α\nf : ℝ≥0∞ → α\n⊢ (⨅ (x : ℝ≥0∞) (_ : x ≠ ⊤), f x) = ⨅ (x : ℝ≥0), f ↑x",
"tactic": "rw [iInf_subtype', cinfi_ne_top]"
}
] | [
434,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
433,
1
] |
Mathlib/GroupTheory/Perm/Support.lean | Equiv.Perm.coe_support_eq_set_support | [
{
"state_after": "case h\nα : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf✝ g f : Perm α\nx✝ : α\n⊢ x✝ ∈ ↑(support f) ↔ x✝ ∈ {x | ↑f x ≠ x}",
"state_before": "α : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf✝ g f : Perm α\n⊢ ↑(support f) = {x | ↑f x ≠ x}",
"tactic": "ext"
},
{
... | [
302,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
300,
1
] |
Mathlib/Order/BooleanAlgebra.lean | compl_compl | [] | [
637,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
636,
1
] |
Mathlib/Analysis/Calculus/Inverse.lean | HasStrictFDerivAt.approximates_deriv_on_nhds | [
{
"state_after": "case inl\n𝕜 : Type u_1\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type u_3\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type ?u.502454\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\nG' : Type ... | [
549,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
540,
1
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | intervalIntegral.integral_eq_zero_iff_of_nonneg_ae | [
{
"state_after": "case inl\nι : Type ?u.19452276\n𝕜 : Type ?u.19452279\nE : Type ?u.19452282\nF : Type ?u.19452285\nA : Type ?u.19452288\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\ninst✝ : NormedSpace ℝ E\nf g : ℝ → ℝ\na b : ℝ\nμ : MeasureTheory.Measure ℝ\nhfi : IntervalIntegrable f μ a b\nhab : ... | [
1273,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1267,
1
] |
Mathlib/Algebra/Order/Kleene.lean | kstar_mul_le_self | [] | [
219,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
218,
1
] |
Mathlib/GroupTheory/Subgroup/ZPowers.lean | AddSubgroup.range_zmultiplesHom | [] | [
94,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.