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/Finite.lean | Set.Finite.mem_toFinset | [] | [
164,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
11
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.span_sup | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nR₂ : Type ?u.49517\nK : Type ?u.49520\nM : Type u_1\nM₂ : Type ?u.49526\nV : Type ?u.49529\nS : Type ?u.49532\ninst✝⁵ : Semiring R\ninst✝⁴ : AddCommMonoid M\ninst✝³ : Module R M\nx : M\np p' : Submodule R M\ninst✝² : Semiring R₂\nσ₁₂ : R →+* R₂\nin... | [
257,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
257,
1
] |
Mathlib/Data/Fintype/Card.lean | Finset.card_lt_univ_of_not_mem | [] | [
272,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Mathlib/Order/PartialSups.lean | le_partialSups_of_le | [
{
"state_after": "case zero\nα : Type u_1\ninst✝ : SemilatticeSup α\nf : ℕ → α\nm n : ℕ\nh✝ : m ≤ n\nh : m ≤ Nat.zero\n⊢ f m ≤ ↑(partialSups f) Nat.zero\n\ncase succ\nα : Type u_1\ninst✝ : SemilatticeSup α\nf : ℕ → α\nm n✝ : ℕ\nh✝ : m ≤ n✝\nn : ℕ\nih : m ≤ n → f m ≤ ↑(partialSups f) n\nh : m ≤ Nat.succ n\n⊢ f m... | [
70,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/Order/Interval.lean | NonemptyInterval.mem_pure_self | [] | [
158,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.prod_sup_prod | [
{
"state_after": "R : Type u_3\nR₂ : Type ?u.256035\nK : Type ?u.256038\nM : Type u_1\nM₂ : Type ?u.256044\nV : Type ?u.256047\nS : Type ?u.256050\ninst✝⁷ : Semiring R\ninst✝⁶ : AddCommMonoid M\ninst✝⁵ : Module R M\nx : M\np p' : Submodule R M\ninst✝⁴ : Semiring R₂\nσ₁₂ : R →+* R₂\ninst✝³ : AddCommMonoid M₂\nin... | [
811,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
805,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.mk_zero | [] | [
562,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
561,
1
] |
Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean | LinearMap.toMatrix₂Aux_apply | [] | [
109,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.inv_lt_top | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.255378\nβ : Type ?u.255381\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nx : ℝ≥0∞\n⊢ x⁻¹ < ⊤ ↔ 0 < x",
"tactic": "simp only [lt_top_iff_ne_top, inv_ne_top, pos_iff_ne_zero]"
}
] | [
1411,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1410,
1
] |
src/lean/Init/SizeOfLemmas.lean | UInt64.sizeOf | [
{
"state_after": "case mk\nval✝ : Fin size\n⊢ SizeOf.sizeOf { val := val✝ } = toNat { val := val✝ } + 2",
"state_before": "a : UInt64\n⊢ SizeOf.sizeOf a = toNat a + 2",
"tactic": "cases a"
},
{
"state_after": "no goals",
"state_before": "case mk\nval✝ : Fin size\n⊢ SizeOf.sizeOf { val := val... | [
24,
37
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
23,
9
] |
Mathlib/RingTheory/Polynomial/Dickson.lean | Polynomial.dickson_one_one_eval_add_inv | [
{
"state_after": "R : Type u_1\nS : Type ?u.117133\ninst✝¹ : CommRing R\ninst✝ : CommRing S\nk : ℕ\na x y : R\nh : x * y = 1\n⊢ eval (x + y) 2 = 2",
"state_before": "R : Type u_1\nS : Type ?u.117133\ninst✝¹ : CommRing R\ninst✝ : CommRing S\nk : ℕ\na x y : R\nh : x * y = 1\n⊢ eval (x + y) (dickson 1 1 0) = x... | [
144,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
132,
1
] |
Mathlib/CategoryTheory/Adjunction/Opposites.lean | CategoryTheory.Adjunction.unit_leftAdjointUniq_hom_app | [
{
"state_after": "C : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nF F' : C ⥤ D\nG : D ⥤ C\nadj1 : F ⊣ G\nadj2 : F' ⊣ G\nx : C\n⊢ adj1.unit.app x ≫ G.map ((leftAdjointUniq adj1 adj2).hom.app x) =\n (adj1.unit ≫ whiskerRight (leftAdjointUniq adj1 adj2).hom G).app x",
"state_before": "C :... | [
155,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearMap.coe_id | [] | [
682,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
681,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | Algebra.smul_leftMulMatrix_algebraMap | [
{
"state_after": "case a.mk.h.mk\nR : Type u_1\nS : Type u_5\nT : Type u_4\ninst✝¹⁰ : CommRing R\ninst✝⁹ : CommRing S\ninst✝⁸ : Ring T\ninst✝⁷ : Algebra R S\ninst✝⁶ : Algebra S T\ninst✝⁵ : Algebra R T\ninst✝⁴ : IsScalarTower R S T\nm : Type u_2\nn : Type u_3\ninst✝³ : Fintype m\ninst✝² : Fintype n\ninst✝¹ : Dec... | [
939,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
935,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | gcd_mul_lcm | [] | [
324,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/Algebra/Group/UniqueProds.lean | UniqueMul.exists_iff_exists_existsUnique | [
{
"state_after": "G : Type u_1\nH : Type ?u.9715\ninst✝¹ : Mul G\ninst✝ : Mul H\nA B : Finset G\na0 b0 : G\nx✝ : ∃ g, ∃! ab x, ab.fst * ab.snd = g\ng : G\nh h' : ∃! ab x, ab.fst * ab.snd = g\n⊢ ∃ a0 b0, a0 ∈ A ∧ b0 ∈ B ∧ UniqueMul A B a0 b0",
"state_before": "G : Type u_1\nH : Type ?u.9715\ninst✝¹ : Mul G\n... | [
107,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Data/Prod/Basic.lean | Prod.swap_bijective | [] | [
205,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.degree_mul_X_pow | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\na b c d : R\nn m : ℕ\ninst✝¹ : Semiring R\ninst✝ : Nontrivial R\np q : R[X]\n⊢ degree (p * X ^ n) = degree p + ↑n",
"tactic": "simp [(monic_X_pow n).degree_mul]"
}
] | [
1284,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1284,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | DifferentiableAt.const_add | [] | [
285,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
283,
1
] |
Mathlib/Topology/Algebra/Module/LocallyConvex.lean | locallyConvexSpace_sInf | [
{
"state_after": "ι : Sort ?u.41463\n𝕜 : Type u_2\nE : Type u_1\nF : Type ?u.41472\ninst✝⁴ : OrderedSemiring 𝕜\ninst✝³ : AddCommMonoid E\ninst✝² : Module 𝕜 E\ninst✝¹ : AddCommMonoid F\ninst✝ : Module 𝕜 F\nts : Set (TopologicalSpace E)\nh : ∀ (t : TopologicalSpace E), t ∈ ts → LocallyConvexSpace 𝕜 E\nthis :... | [
164,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.Integrable.im | [
{
"state_after": "α : Type u_2\nβ : Type ?u.1226518\nγ : Type ?u.1226521\nδ : Type ?u.1226524\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝³ : MeasurableSpace δ\ninst✝² : NormedAddCommGroup β\ninst✝¹ : NormedAddCommGroup γ\n𝕜 : Type u_1\ninst✝ : IsROrC 𝕜\nf : α → 𝕜\nhf : Memℒp f 1\n⊢ Memℒp (fun x => ↑IsROrC... | [
1152,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1150,
1
] |
Mathlib/Algebra/Algebra/Equiv.lean | AlgEquiv.bijective | [] | [
286,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
285,
11
] |
Mathlib/Algebra/Order/Ring/WithTop.lean | WithTop.untop'_zero_mul | [
{
"state_after": "case pos\nα : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : MulZeroClass α\na b : WithTop α\nha : a = 0\n⊢ untop' 0 (a * b) = untop' 0 a * untop' 0 b\n\ncase neg\nα : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : MulZeroClass α\na b : WithTop α\nha : ¬a = 0\n⊢ untop' 0 (a * b) = untop' 0 a * untop' 0 ... | [
116,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
111,
1
] |
Mathlib/Data/Int/Lemmas.lean | Int.succ_coe_nat_pos | [
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ 0 ≤ ↑n",
"tactic": "simp"
}
] | [
41,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
40,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearEquiv.unitsEquivAut_apply_symm | [] | [
2378,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2377,
1
] |
Mathlib/Data/Nat/PartENat.lean | PartENat.top_eq_none | [] | [
348,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
347,
1
] |
Mathlib/CategoryTheory/Bicategory/Coherence.lean | CategoryTheory.FreeBicategory.normalizeAux_congr | [
{
"state_after": "case mk\nB : Type u\ninst✝ : Quiver B\na b c : B\np : Path a b\nf g : Hom b c\nη : f ⟶ g\nη' : Hom₂ f g\n⊢ normalizeAux p f = normalizeAux p g",
"state_before": "B : Type u\ninst✝ : Quiver B\na b c : B\np : Path a b\nf g : Hom b c\nη : f ⟶ g\n⊢ normalizeAux p f = normalizeAux p g",
"ta... | [
160,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.self_add_star | [] | [
1113,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1112,
8
] |
Mathlib/Data/Bitvec/Lemmas.lean | Bitvec.toNat_eq_foldr_reverse | [
{
"state_after": "n : ℕ\nv : Bitvec n\n⊢ Bitvec.toNat v = List.foldl (fun x y => flip addLsb y x) 0 (Vector.toList v)",
"state_before": "n : ℕ\nv : Bitvec n\n⊢ Bitvec.toNat v = List.foldr (flip addLsb) 0 (List.reverse (Vector.toList v))",
"tactic": "rw [List.foldr_reverse]"
},
{
"state_after": "... | [
90,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Order/Heyting/Boundary.lean | Coheyting.hnot_eq_top_iff_exists_boundary | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : CoheytingAlgebra α\na b : α\nh : ￢a = ⊤\n⊢ ∂ a = a",
"tactic": "rw [boundary, h, inf_top_eq]"
},
{
"state_after": "case intro\nα : Type u_1\ninst✝ : CoheytingAlgebra α\nb✝ b : α\n⊢ ￢∂ b = ⊤",
"state_before": "α : Type u_1\ni... | [
146,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Data/Complex/Exponential.lean | Real.cosh_two_mul | [
{
"state_after": "x y : ℝ\n⊢ ↑(cosh (2 * x)) = ↑(cosh x ^ 2 + sinh x ^ 2)",
"state_before": "x y : ℝ\n⊢ cosh (2 * x) = cosh x ^ 2 + sinh x ^ 2",
"tactic": "rw [← ofReal_inj]"
},
{
"state_after": "no goals",
"state_before": "x y : ℝ\n⊢ ↑(cosh (2 * x)) = ↑(cosh x ^ 2 + sinh x ^ 2)",
"tacti... | [
1445,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1444,
8
] |
Mathlib/Data/Bool/Basic.lean | Bool.exists_bool | [
{
"state_after": "case false\np : Bool → Prop\nx✝ : ∃ b, p b\nh : p false\n⊢ p false ∨ p true\n\ncase true\np : Bool → Prop\nx✝ : ∃ b, p b\nh : p true\n⊢ p false ∨ p true",
"state_before": "p : Bool → Prop\nx✝ : ∃ b, p b\nb : Bool\nh : p b\n⊢ p false ∨ p true",
"tactic": "cases b"
},
{
"state_af... | [
112,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/Data/MvPolynomial/Monad.lean | MvPolynomial.bind₂_monomial | [
{
"state_after": "no goals",
"state_before": "σ : Type u_3\nτ : Type ?u.1251650\nR : Type u_1\nS : Type u_2\nT : Type ?u.1251659\ninst✝² : CommSemiring R\ninst✝¹ : CommSemiring S\ninst✝ : CommSemiring T\nf✝ : σ → MvPolynomial τ R\nf : R →+* MvPolynomial σ S\nd : σ →₀ ℕ\nr : R\n⊢ ↑(bind₂ f) (↑(monomial d) r)... | [
350,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
347,
1
] |
Mathlib/Topology/Sober.lean | genericPoint_closure | [] | [
158,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/Order/Filter/NAry.lean | Filter.NeBot.of_map₂_left | [] | [
139,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean | MeasureTheory.ProbabilityMeasure.eq_of_forall_apply_eq | [
{
"state_after": "case h\nΩ : Type u_1\ninst✝ : MeasurableSpace Ω\nμ ν : ProbabilityMeasure Ω\nh : ∀ (s : Set Ω), MeasurableSet s → (fun s => ENNReal.toNNReal (↑↑↑μ s)) s = (fun s => ENNReal.toNNReal (↑↑↑ν s)) s\ns : Set Ω\ns_mble : MeasurableSet s\n⊢ ↑↑↑μ s = ↑↑↑ν s",
"state_before": "Ω : Type u_1\ninst✝ :... | [
199,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
1
] |
Mathlib/Data/MvPolynomial/Variables.lean | MvPolynomial.degrees_rename_of_injective | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nσ : Type u_1\nτ : Type u_2\nr : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝ : CommSemiring R\np✝ q p : MvPolynomial σ R\nf : σ → τ\nh : Injective f\n⊢ degrees (↑(rename f) p) = Multiset.map f (degrees p)",
"tactic": "classical\nsimp only [de... | [
265,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
259,
1
] |
Mathlib/Analysis/Complex/Basic.lean | Complex.hasSum_conj | [] | [
575,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
574,
1
] |
Mathlib/RingTheory/Ideal/QuotientOperations.lean | DoubleQuot.quotQuotEquivQuotSup_quotQuotMk | [] | [
571,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
569,
1
] |
Mathlib/Init/Data/Nat/Lemmas.lean | Nat.bit1_ne_bit0 | [] | [
110,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
11
] |
Mathlib/Data/Polynomial/Expand.lean | Polynomial.expand_monomial | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝¹ : CommSemiring R\nS : Type v\ninst✝ : CommSemiring S\np q : ℕ\nr : R\n⊢ ↑(expand R p) (↑(monomial q) r) = ↑(monomial (q * p)) r",
"tactic": "simp_rw [← smul_X_eq_monomial, AlgHom.map_smul, AlgHom.map_pow, expand_X, mul_comm, pow_mul]"
}
... | [
67,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean | EuclideanGeometry.angle_right_midpoint_eq_pi_div_two_of_dist_eq | [
{
"state_after": "no goals",
"state_before": "V : Type u_2\nP : Type u_1\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerProductSpace ℝ V\ninst✝¹ : MetricSpace P\ninst✝ : NormedAddTorsor V P\np1 p2 p3 : P\nh : dist p3 p1 = dist p3 p2\n⊢ ∠ p3 (midpoint ℝ p1 p2) p2 = π / 2",
"tactic": "rw [midpoint_comm p1 ... | [
276,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
274,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | Orthonormal.inner_left_finsupp | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.1927200\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nι : Type u_3\ndec_ι : DecidableEq ι\nv : ι ... | [
815,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
814,
1
] |
Mathlib/Analysis/InnerProductSpace/Calculus.lean | DifferentiableWithinAt.dist | [
{
"state_after": "𝕜 : Type ?u.393829\nE : Type u_2\nF : Type ?u.393835\ninst✝⁷ : IsROrC 𝕜\ninst✝⁶ : NormedAddCommGroup E\ninst✝⁵ : InnerProductSpace 𝕜 E\ninst✝⁴ : NormedAddCommGroup F\ninst✝³ : InnerProductSpace ℝ F\ninst✝² : NormedSpace ℝ E\nG : Type u_1\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace ℝ... | [
274,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Mathlib/LinearAlgebra/Dimension.lean | LinearMap.lift_rank_le_of_injective | [
{
"state_after": "K : Type u\nV V₁ V₂ V₃ : Type v\nV' V'₁ : Type v'\nV'' : Type v''\nι : Type w\nι' : Type w'\nη : Type u₁'\nφ : η → Type ?u.4903\nR : Type u\ninst✝⁶ : Ring R\nM : Type v\ninst✝⁵ : AddCommGroup M\ninst✝⁴ : Module R M\nM' : Type v'\ninst✝³ : AddCommGroup M'\ninst✝² : Module R M'\nM₁ : Type v\nins... | [
134,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.comap_mono | [] | [
1375,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1374,
1
] |
Mathlib/Algebra/DirectSum/Ring.lean | DirectSum.ofList_dProd | [
{
"state_after": "case nil\nι : Type u_2\ninst✝³ : DecidableEq ι\nA : ι → Type u_3\ninst✝² : (i : ι) → AddCommMonoid (A i)\ninst✝¹ : AddMonoid ι\ninst✝ : GSemiring A\nα : Type u_1\nfι : α → ι\nfA : (a : α) → A (fι a)\n⊢ ↑(of A (List.dProdIndex [] fι)) (List.dProd [] fι fA) = List.prod (List.map (fun a => ↑(of A... | [
302,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
294,
1
] |
Mathlib/Data/List/Basic.lean | List.reverse_involutive | [] | [
611,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
610,
1
] |
Mathlib/Combinatorics/Composition.lean | List.map_length_splitWrtComposition | [] | [
708,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
706,
1
] |
Mathlib/ModelTheory/Satisfiability.lean | FirstOrder.Language.Theory.isSatisfiable_onTheory_iff | [
{
"state_after": "no goals",
"state_before": "L : Language\nT : Theory L\nα : Type w\nn : ℕ\nT' : Theory L\nL' : Language\nφ : L →ᴸ L'\nh : LHom.Injective φ\n⊢ IsSatisfiable (LHom.onTheory φ T) ↔ IsSatisfiable T",
"tactic": "classical\n refine' ⟨isSatisfiable_of_isSatisfiable_onTheory φ, fun h' => _⟩\n... | [
101,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
1
] |
Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean | MeasureTheory.AEStronglyMeasurable.ae_eq_mk | [] | [
1210,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1209,
1
] |
Mathlib/Topology/MetricSpace/Contracting.lean | ContractingWith.dist_fixedPoint_le | [] | [
324,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.measure_compl_le_add_of_le_add | [
{
"state_after": "α : Type u_1\nβ : Type ?u.607532\nγ : Type ?u.607535\nδ : Type ?u.607538\nι : Type ?u.607541\nR : Type ?u.607544\nR' : Type ?u.607547\nm0 : MeasurableSpace α\ninst✝² : MeasurableSpace β\ninst✝¹ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set α\ninst✝ : IsFiniteMeasure μ\nh... | [
3070,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3063,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.le_def | [
{
"state_after": "x y : PGame\n⊢ ((∀ (i : LeftMoves x), moveLeft x i ⧏ y) ∧ ∀ (j : RightMoves y), x ⧏ moveRight y j) ↔\n (∀ (i : LeftMoves x), (∃ i', moveLeft x i ≤ moveLeft y i') ∨ ∃ j, moveRight (moveLeft x i) j ≤ y) ∧\n ∀ (j : RightMoves y), (∃ i, x ≤ moveLeft (moveRight y j) i) ∨ ∃ j', moveRight x j... | [
628,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
621,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | continuous_dist | [] | [
1803,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1802,
1
] |
Mathlib/MeasureTheory/PiSystem.lean | generatePiSystem_subset_self | [
{
"state_after": "case base\nα : Type u_1\nS : Set (Set α)\nh_S : IsPiSystem S\nx s✝ : Set α\nh_s : s✝ ∈ S\n⊢ s✝ ∈ S\n\ncase inter\nα : Type u_1\nS : Set (Set α)\nh_S : IsPiSystem S\nx s u : Set α\nh_s✝ : generatePiSystem S s\nh_t✝ : generatePiSystem S u\nh_nonempty : Set.Nonempty (s ∩ u)\nh_s : s ∈ S\nh_u : u ... | [
243,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
239,
1
] |
Mathlib/Order/Monotone/Monovary.lean | Monovary.comp_antitone_left | [] | [
168,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/GroupTheory/Index.lean | Subgroup.index_ker | [
{
"state_after": "G : Type u_2\ninst✝¹ : Group G\nH✝ K L : Subgroup G\nH : Type u_1\ninst✝ : Group H\nf : G →* H\n⊢ Nat.card { x // x ∈ MonoidHom.range f } = Nat.card ↑(Set.range ↑f)",
"state_before": "G : Type u_2\ninst✝¹ : Group G\nH✝ K L : Subgroup G\nH : Type u_1\ninst✝ : Group H\nf : G →* H\n⊢ index (M... | [
279,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Mathlib/Analysis/SpecialFunctions/Integrals.lean | intervalIntegral.intervalIntegrable_cpow' | [
{
"state_after": "a b : ℝ\nn : ℕ\nf : ℝ → ℝ\nμ ν : MeasureTheory.Measure ℝ\ninst✝ : IsLocallyFiniteMeasure μ\nc d : ℝ\nr : ℂ\nh : -1 < r.re\n⊢ ∀ (c : ℝ), IntervalIntegrable (fun x => ↑x ^ r) volume 0 c",
"state_before": "a b : ℝ\nn : ℕ\nf : ℝ → ℝ\nμ ν : MeasureTheory.Measure ℝ\ninst✝ : IsLocallyFiniteMeasur... | [
182,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/Computability/Reduce.lean | OneOneEquiv.symm | [] | [
191,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/Algebra/Lie/Subalgebra.lean | LieSubalgebra.mem_mk_iff | [] | [
159,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/RingTheory/Ideal/Prod.lean | Ideal.isPrime_ideal_prod_top' | [
{
"state_after": "R : Type u\nS : Type v\ninst✝¹ : Ring R\ninst✝ : Ring S\nI✝ I' : Ideal R\nJ J' I : Ideal S\nh : IsPrime I\nthis : IsPrime (prod I ⊤) := isPrime_ideal_prod_top\n⊢ IsPrime (prod ⊤ I)",
"state_before": "R : Type u\nS : Type v\ninst✝¹ : Ring R\ninst✝ : Ring S\nI✝ I' : Ideal R\nJ J' I : Ideal S... | [
147,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.mul_imI | [
{
"state_after": "no goals",
"state_before": "S : Type ?u.418739\nT : Type ?u.418742\nR : Type u_1\ninst✝ : CommRing R\nr x y z : R\na b c : ℍ[R]\n⊢ a.re * b.imI + a.imI * b.re - -1 * a.imJ * b.imK + -1 * a.imK * b.imJ =\n a.re * b.imI + a.imI * b.re + a.imJ * b.imK - a.imK * b.imJ",
"tactic": "simp ... | [
954,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
953,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.range_add_one | [] | [
3008,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3007,
1
] |
Mathlib/Analysis/Asymptotics/Theta.lean | Asymptotics.IsTheta.isBigO_congr_right | [] | [
187,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
186,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.map_smul' | [] | [
372,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
370,
1
] |
Mathlib/Algebra/BigOperators/Multiset/Basic.lean | Multiset.prod_map_erase | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nα : Type u_2\nβ : Type ?u.10071\nγ : Type ?u.10074\ninst✝¹ : CommMonoid α\ns t : Multiset α\na✝ : α\nm : Multiset ι\nf g : ι → α\ninst✝ : DecidableEq ι\na : ι\nh : a ∈ m\n⊢ f a * prod (map f (erase m a)) = prod (map f m)",
"tactic": "rw [← m.co... | [
101,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/InformationTheory/Hamming.lean | hammingDist_self | [
{
"state_after": "α : Type ?u.489\nι : Type u_1\nβ : ι → Type u_2\ninst✝² : Fintype ι\ninst✝¹ : (i : ι) → DecidableEq (β i)\nγ : ι → Type ?u.521\ninst✝ : (i : ι) → DecidableEq (γ i)\nx : (i : ι) → β i\n⊢ ∀ (x_1 : ι), x_1 ∈ univ → ¬x x_1 ≠ x x_1",
"state_before": "α : Type ?u.489\nι : Type u_1\nβ : ι → Type ... | [
51,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
49,
1
] |
Mathlib/Algebra/GroupWithZero/Power.lean | map_zpow₀ | [] | [
208,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
206,
1
] |
Mathlib/Data/Finset/Image.lean | Finset.map_val | [] | [
58,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/Analysis/ODE/Gronwall.lean | gronwallBound_ε0 | [
{
"state_after": "case pos\nE : Type ?u.30194\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedSpace ℝ E\nF : Type ?u.30290\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedSpace ℝ F\nδ K x : ℝ\nhK : K = 0\n⊢ gronwallBound δ K 0 x = δ * exp (K * x)\n\ncase neg\nE : Type ?u.30194\ninst✝³ : NormedAddCommGroup E\ninst✝... | [
92,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/Analysis/PSeries.lean | Real.summable_one_div_nat_rpow | [
{
"state_after": "no goals",
"state_before": "p : ℝ\n⊢ (Summable fun n => 1 / ↑n ^ p) ↔ 1 < p",
"tactic": "simp"
}
] | [
204,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/Logic/Basic.lean | exists_prop_of_false | [] | [
891,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
890,
1
] |
Mathlib/Analysis/Convex/Segment.lean | Prod.image_mk_segment_left | [
{
"state_after": "case h.mk\n𝕜 : Type u_3\nE : Type u_1\nF : Type u_2\nG : Type ?u.309296\nι : Type ?u.309299\nπ : ι → Type ?u.309304\ninst✝⁴ : OrderedSemiring 𝕜\ninst✝³ : AddCommMonoid E\ninst✝² : AddCommMonoid F\ninst✝¹ : Module 𝕜 E\ninst✝ : Module 𝕜 F\nx₁ x₂ : E\ny : F\nx' : E\ny' : F\n⊢ (x', y') ∈ (fun ... | [
609,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
603,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearEquiv.comp_coe | [] | [
2064,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2062,
1
] |
Mathlib/CategoryTheory/PathCategory.lean | CategoryTheory.Paths.lift_toPath | [
{
"state_after": "V : Type u₁\ninst✝¹ : Quiver V\nC : Type u_1\ninst✝ : Category C\nφ : V ⥤q C\nX Y : V\nf : X ⟶ Y\n⊢ 𝟙 (φ.obj X) ≫ φ.map f = φ.map f",
"state_before": "V : Type u₁\ninst✝¹ : Quiver V\nC : Type u_1\ninst✝ : Category C\nφ : V ⥤q C\nX Y : V\nf : X ⟶ Y\n⊢ (lift φ).map (Quiver.Hom.toPath f) = φ... | [
93,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/Analysis/Convex/Function.lean | ConvexOn.convex_strict_epigraph | [] | [
581,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
578,
1
] |
Mathlib/Algebra/Group/Prod.lean | Prod.swap_div | [] | [
189,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
188,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.swap_comm | [] | [
1555,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1554,
1
] |
Mathlib/Order/Hom/Basic.lean | OrderIso.ofRelIsoLT_symm | [] | [
1045,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1042,
1
] |
Mathlib/LinearAlgebra/SesquilinearForm.lean | LinearMap.linearIndependent_of_isOrthoᵢ | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.57477\nR₁ : Type ?u.57480\nR₂ : Type ?u.57483\nR₃ : Type ?u.57486\nM : Type ?u.57489\nM₁ : Type ?u.57492\nM₂ : Type ?u.57495\nMₗ₁ : Type ?u.57498\nMₗ₁' : Type ?u.57501\nMₗ₂ : Type ?u.57504\nMₗ₂' : Type ?u.57507\nK : Type u_2\nK₁ : Type u_1\nK₂ : Type... | [
155,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Analysis/NormedSpace/Multilinear.lean | ContinuousMultilinearMap.uncurryRight_norm | [] | [
1601,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1598,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.union_smul_inter_subset_union | [] | [
1413,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1412,
1
] |
Mathlib/Algebra/Lie/Submodule.lean | LieIdeal.bot_of_map_eq_bot | [
{
"state_after": "R : Type u\nL : Type v\nL' : Type w₂\nM : Type w\nM' : Type w₁\ninst✝¹² : CommRing R\ninst✝¹¹ : LieRing L\ninst✝¹⁰ : LieAlgebra R L\ninst✝⁹ : LieRing L'\ninst✝⁸ : LieAlgebra R L'\ninst✝⁷ : AddCommGroup M\ninst✝⁶ : Module R M\ninst✝⁵ : LieRingModule L M\ninst✝⁴ : LieModule R L M\ninst✝³ : AddCo... | [
1049,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1045,
1
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | intervalIntegrable_iff_integrable_Icc_of_le | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.695028\n𝕜 : Type ?u.695031\nE : Type u_1\nF : Type ?u.695037\nA : Type ?u.695040\ninst✝¹ : NormedAddCommGroup E\nf✝ : ℝ → E\na✝ b✝ : ℝ\nμ✝ : MeasureTheory.Measure ℝ\nf : ℝ → E\na b : ℝ\nhab : a ≤ b\nμ : MeasureTheory.Measure ℝ\ninst✝ : NoAtoms μ\n⊢ ... | [
106,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/CategoryTheory/Limits/HasLimits.lean | CategoryTheory.Limits.limit.post_π | [
{
"state_after": "J : Type u₁\ninst✝⁵ : Category J\nK : Type u₂\ninst✝⁴ : Category K\nC : Type u\ninst✝³ : Category C\nF : J ⥤ C\nD : Type u'\ninst✝² : Category D\ninst✝¹ : HasLimit F\nG : C ⥤ D\ninst✝ : HasLimit (F ⋙ G)\nj : J\n⊢ (G.mapCone (cone F)).π.app j = G.map (π F j)",
"state_before": "J : Type u₁\n... | [
466,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
464,
1
] |
Mathlib/Data/Real/Cardinality.lean | Cardinal.mk_Ioi_real | [
{
"state_after": "c : ℝ\nf g : ℕ → Bool\nn : ℕ\na : ℝ\n⊢ 𝔠 ≤ (#↑(Ioi a))",
"state_before": "c : ℝ\nf g : ℕ → Bool\nn : ℕ\na : ℝ\n⊢ (#↑(Ioi a)) = 𝔠",
"tactic": "refine' le_antisymm (mk_real ▸ mk_set_le _) _"
},
{
"state_after": "c : ℝ\nf g : ℕ → Bool\nn : ℕ\na : ℝ\n⊢ ¬(#↑(Ioi a)) < 𝔠",
"st... | [
245,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
227,
1
] |
Mathlib/SetTheory/Ordinal/Exponential.lean | Ordinal.left_le_opow | [
{
"state_after": "a b : Ordinal\nb1 : 0 < b\n⊢ a ^ 1 ≤ a ^ b",
"state_before": "a b : Ordinal\nb1 : 0 < b\n⊢ a ≤ a ^ b",
"tactic": "nth_rw 1 [← opow_one a]"
},
{
"state_after": "case inl\na b : Ordinal\nb1 : 0 < b\na1 : a ≤ 1\n⊢ a ^ 1 ≤ a ^ b\n\ncase inr\na b : Ordinal\nb1 : 0 < b\na1 : a > 1\n⊢... | [
173,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
165,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.Nonempty.of_div_right | [] | [
613,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
612,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.mul_subset_mul_left | [] | [
424,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
1
] |
Mathlib/Data/List/Pairwise.lean | List.pairwise_middle | [
{
"state_after": "α : Type u_1\nβ : Type ?u.10097\nR S T : α → α → Prop\na✝ : α\nl : List α\ns : Symmetric R\na : α\nl₁ l₂ : List α\n⊢ (Pairwise R ([a] ++ l₁) ∧ Pairwise R l₂ ∧ ∀ (a_1 : α), a_1 ∈ l₁ ++ [a] → ∀ (b : α), b ∈ l₂ → R a_1 b) ↔\n Pairwise R ([a] ++ l₁) ∧ Pairwise R l₂ ∧ ∀ (a_1 : α), a_1 ∈ [a] ++ l... | [
177,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/Topology/Order/Basic.lean | Filter.Tendsto.eventually_lt | [] | [
670,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
666,
1
] |
Mathlib/Combinatorics/Hindman.lean | Hindman.exists_FP_of_large | [
{
"state_after": "M : Type u_1\ninst✝ : Semigroup M\nU : Ultrafilter M\nU_idem : U * U = U\ns₀ : Set M\nsU : s₀ ∈ U\nexists_elem : ∀ {s : Set M}, s ∈ U → Set.Nonempty (s ∩ {m | ∀ᶠ (m' : M) in ↑U, m * m' ∈ s})\n⊢ ∃ a, FP a ⊆ s₀",
"state_before": "M : Type u_1\ninst✝ : Semigroup M\nU : Ultrafilter M\nU_idem :... | [
209,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
177,
1
] |
Mathlib/Init/Data/Nat/Bitwise.lean | Nat.mod_two_of_bodd | [
{
"state_after": "n : ℕ\nthis : bodd (n % 2 + 2 * (n / 2)) = bodd n\n⊢ n % 2 = bif bodd n then 1 else 0",
"state_before": "n : ℕ\n⊢ n % 2 = bif bodd n then 1 else 0",
"tactic": "have := congr_arg bodd (mod_add_div n 2)"
},
{
"state_after": "n : ℕ\nthis : bodd (n % 2) = bodd n\n⊢ n % 2 = bif bodd... | [
101,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/Order/CompleteLattice.lean | iInf_iSup_ge_nat_add | [] | [
1662,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1660,
1
] |
Mathlib/NumberTheory/Zsqrtd/Basic.lean | Zsqrtd.hom_ext | [
{
"state_after": "case a.mk\nR : Type\ninst✝ : Ring R\nd : ℤ\nf g : ℤ√d →+* R\nh : ↑f sqrtd = ↑g sqrtd\nx_re x_im : ℤ\n⊢ ↑f { re := x_re, im := x_im } = ↑g { re := x_re, im := x_im }",
"state_before": "R : Type\ninst✝ : Ring R\nd : ℤ\nf g : ℤ√d →+* R\nh : ↑f sqrtd = ↑g sqrtd\n⊢ f = g",
"tactic": "ext ⟨x... | [
1034,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1032,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.sub_apply | [] | [
311,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
310,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Metric.cthickening_empty | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.100122\nα : Type u\nβ : Type v\ninst✝ : PseudoEMetricSpace α\nδ✝ ε : ℝ\ns t : Set α\nx : α\nδ : ℝ\n⊢ cthickening δ ∅ = ∅",
"tactic": "simp only [cthickening, ENNReal.ofReal_ne_top, setOf_false, infEdist_empty, top_le_iff]"
}
] | [
1057,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1056,
1
] |
Mathlib/Algebra/Ring/Equiv.lean | RingEquiv.symm_trans_self | [] | [
861,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
860,
1
] |
Mathlib/Topology/Algebra/ContinuousAffineMap.lean | ContinuousAffineMap.coe_add | [] | [
223,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.