file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/Order/UpperLower/Basic.lean | UpperSet.prod_sup_prod | [] | [
1596,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1595,
1
] |
Mathlib/Data/List/Basic.lean | List.map₂Left_eq_map₂Left' | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.465338\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nf : α → Option β → γ\nas : List α\nx✝ : List β\n⊢ map₂Left f [] x✝ = (map₂Left' f [] x✝).fst",
"tactic": "simp"
},
{
"state_after": "no goals",
"state_before": "ι... | [
4113,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
4110,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | UniformSpace.SeparationQuotient.dist_mk | [] | [
3162,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3160,
1
] |
Mathlib/GroupTheory/Coset.lean | QuotientGroup.forall_mk | [] | [
501,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
500,
1
] |
Mathlib/NumberTheory/Padics/RingHoms.lean | PadicInt.modPart_lt_p | [
{
"state_after": "case h.e'_4\np : ℕ\nhp_prime : Fact (Nat.Prime p)\nr : ℚ\n⊢ ↑p = abs ↑p\n\ncase convert_3\np : ℕ\nhp_prime : Fact (Nat.Prime p)\nr : ℚ\n⊢ ↑p ≠ 0",
"state_before": "p : ℕ\nhp_prime : Fact (Nat.Prime p)\nr : ℚ\n⊢ modPart p r < ↑p",
"tactic": "convert Int.emod_lt _ _"
},
{
"state_... | [
77,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/CategoryTheory/Abelian/Opposite.lean | CategoryTheory.imageUnopOp_inv_comp_op_factorThruImage | [
{
"state_after": "no goals",
"state_before": "C : Type u_2\ninst✝¹ : Category C\ninst✝ : Abelian C\nX Y : C\nf : X ⟶ Y\nA B : Cᵒᵖ\ng : A ⟶ B\n⊢ (imageUnopOp g).inv ≫ (factorThruImage g.unop).op = image.ι g",
"tactic": "rw [Iso.inv_comp_eq, imageUnopOp_hom_comp_image_ι]"
}
] | [
195,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | Subalgebra.zero_mem | [] | [
141,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
11
] |
Mathlib/Analysis/NormedSpace/Multilinear.lean | ContinuousMultilinearMap.norm_restr | [
{
"state_after": "case hC\n𝕜 : Type u\nι : Type v\nι' : Type v'\nn✝ : ℕ\nE : ι → Type wE\nE₁ : ι → Type wE₁\nE' : ι' → Type wE'\nEi : Fin (Nat.succ n✝) → Type wEi\nG : Type wG\nG' : Type wG'\ninst✝¹⁴ : Fintype ι\ninst✝¹³ : Fintype ι'\ninst✝¹² : NontriviallyNormedField 𝕜\ninst✝¹¹ : (i : ι) → NormedAddCommGroup... | [
797,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
794,
1
] |
Mathlib/Algebra/BigOperators/Fin.lean | Fin.inv_partialProd_mul_eq_contractNth | [
{
"state_after": "case inl\nα : Type ?u.123864\nβ : Type ?u.123867\ninst✝¹ : Monoid α\nn : ℕ\nG : Type u_1\ninst✝ : Group G\ng : Fin (n + 1) → G\nj : Fin (n + 1)\nk : Fin n\nh : ↑k < ↑j\n⊢ (partialProd g (↑(succAbove (succ j)) (↑castSucc k)))⁻¹ * partialProd g (succ (↑(succAbove j) k)) =\n contractNth j (fun... | [
303,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
285,
1
] |
Mathlib/Logic/Equiv/List.lean | Encodable.sortedUniv_toFinset | [] | [
224,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
222,
1
] |
Mathlib/RingTheory/JacobsonIdeal.lean | Ideal.jacobson_eq_top_iff | [] | [
87,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
81,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | InnerProductSpace.Core.inner_zero_right | [
{
"state_after": "𝕜 : Type u_1\nE : Type ?u.536125\nF : Type u_2\ninst✝² : IsROrC 𝕜\ninst✝¹ : AddCommGroup F\ninst✝ : Module 𝕜 F\nc : Core 𝕜 F\nx : F\n⊢ ↑(starRingEnd 𝕜) 0 = 0",
"state_before": "𝕜 : Type u_1\nE : Type ?u.536125\nF : Type u_2\ninst✝² : IsROrC 𝕜\ninst✝¹ : AddCommGroup F\ninst✝ : Module... | [
255,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Mathlib/Order/RelIso/Basic.lean | RelHom.ext_iff | [] | [
136,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
135,
1
] |
Mathlib/Data/Nat/Choose/Basic.lean | Nat.factorial_dvd_descFactorial | [] | [
267,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
266,
1
] |
Mathlib/Probability/Kernel/Basic.lean | ProbabilityTheory.kernel.sum_add | [
{
"state_after": "case h.h\nα : Type u_2\nβ : Type u_3\nι : Type u_1\nmα : MeasurableSpace α\nmβ : MeasurableSpace β\nκ✝ : { x // x ∈ kernel α β }\ninst✝ : Countable ι\nκ η : ι → { x // x ∈ kernel α β }\na : α\ns : Set β\n⊢ MeasurableSet s → ↑↑(↑(kernel.sum fun n => κ n + η n) a) s = ↑↑(↑(kernel.sum κ + kernel.... | [
259,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
255,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | IsCompl.prod_mul_prod | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.302040\nβ : Type u\nα : Type v\nγ : Type w\ns✝ s₁ s₂ : Finset α\na : α\nf✝ g : α → β\ninst✝¹ : Fintype α\ninst✝ : CommMonoid β\ns t : Finset α\nh : IsCompl s t\nf : α → β\n⊢ ∏ x in disjUnion s t (_ : Disjoint s t), f x = ∏ i : α, f i",
"tactic": ... | [
466,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
463,
1
] |
Mathlib/Order/Category/NonemptyFinLinOrdCat.lean | NonemptyFinLinOrdCat.coe_of | [] | [
86,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Data/List/Basic.lean | List.all₂_iff_forall | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.480230\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\np q : α → Prop\nl✝ : List α\nx : α\nl : List α\n⊢ All₂ p (x :: l) ↔ ∀ (x_1 : α), x_1 ∈ x :: l → p x_1",
"tactic": "rw [forall_mem_cons, all₂_cons, all₂_iff_forall]"
}
] | [
4272,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
4270,
1
] |
Mathlib/Data/Complex/Exponential.lean | Real.cosh_sq' | [] | [
1438,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1437,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.isCycleOn_singleton | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.1641196\nα : Type u_1\nβ : Type ?u.1641202\nf g : Perm α\ns t : Set α\na b x y : α\n⊢ IsCycleOn f {a} ↔ ↑f a = a",
"tactic": "simp [IsCycleOn, SameCycle.rfl]"
}
] | [
772,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
772,
1
] |
Mathlib/Dynamics/PeriodicPts.lean | Function.IsPeriodicPt.minimalPeriod_pos | [] | [
311,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
309,
1
] |
Mathlib/LinearAlgebra/PiTensorProduct.lean | PiTensorProduct.liftAux.smul | [
{
"state_after": "case refine'_1\nι : Type u_4\nι₂ : Type ?u.286625\nι₃ : Type ?u.286628\nR : Type u_1\ninst✝⁷ : CommSemiring R\nR₁ : Type ?u.286637\nR₂ : Type ?u.286640\ns : ι → Type u_2\ninst✝⁶ : (i : ι) → AddCommMonoid (s i)\ninst✝⁵ : (i : ι) → Module R (s i)\nM : Type ?u.286830\ninst✝⁴ : AddCommMonoid M\nin... | [
389,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
383,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.add_sub_cancel_left | [
{
"state_after": "no goals",
"state_before": "n m : Nat\n⊢ n + m - (n + 0) = m",
"tactic": "rw [Nat.add_sub_add_left, Nat.sub_zero]"
}
] | [
600,
45
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
598,
11
] |
Mathlib/Algebra/Order/UpperLower.lean | LowerSet.Iic_one | [] | [
230,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
1
] |
Mathlib/Data/Int/Interval.lean | Int.card_fintype_Icc | [
{
"state_after": "no goals",
"state_before": "a b : ℤ\n⊢ Fintype.card ↑(Set.Icc a b) = toNat (b + 1 - a)",
"tactic": "rw [← card_Icc, Fintype.card_ofFinset]"
}
] | [
148,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/Analysis/InnerProductSpace/ConformalLinearMap.lean | isConformalMap_iff | [
{
"state_after": "case mp\nE : Type u_1\nF : Type u_2\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedAddCommGroup F\ninst✝¹ : InnerProductSpace ℝ E\ninst✝ : InnerProductSpace ℝ F\nf : E →L[ℝ] F\n⊢ IsConformalMap f → ∃ c, 0 < c ∧ ∀ (u v : E), inner (↑f u) (↑f v) = c * inner u v\n\ncase mpr\nE : Type u_1\nF : Typ... | [
48,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
34,
1
] |
Mathlib/MeasureTheory/Measure/Haar/Basic.lean | MeasureTheory.Measure.haar.index_mono | [
{
"state_after": "case intro.intro\nG : Type u_1\ninst✝² : Group G\ninst✝¹ : TopologicalSpace G\ninst✝ : TopologicalGroup G\nK K' V : Set G\nhK' : IsCompact K'\nh : K ⊆ K'\nhV : Set.Nonempty (interior V)\ns : Finset G\nh1s : K' ⊆ ⋃ (g : G) (_ : g ∈ s), (fun h => g * h) ⁻¹' V\nh2s : Finset.card s = index K' V\n⊢... | [
220,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
217,
1
] |
Mathlib/RingTheory/TensorProduct.lean | Algebra.TensorProduct.lid_tmul | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝⁸ : CommSemiring R\nA : Type v₁\ninst✝⁷ : Semiring A\ninst✝⁶ : Algebra R A\nB : Type v₂\ninst✝⁵ : Semiring B\ninst✝⁴ : Algebra R B\nC : Type v₃\ninst✝³ : Semiring C\ninst✝² : Algebra R C\nD : Type v₄\ninst✝¹ : Semiring D\ninst✝ : Algebra R D\nr ... | [
775,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
774,
1
] |
Mathlib/GroupTheory/Perm/Sign.lean | Equiv.Perm.Disjoint.extendDomain | [
{
"state_after": "α✝ : Type u\nβ : Type v\nα : Type u_1\np : β → Prop\ninst✝ : DecidablePred p\nf : α ≃ Subtype p\nσ τ : Perm α\nh : Disjoint σ τ\nb : β\n⊢ ↑(Perm.extendDomain σ f) b = b ∨ ↑(Perm.extendDomain τ f) b = b",
"state_before": "α✝ : Type u\nβ : Type v\nα : Type u_1\np : β → Prop\ninst✝ : Decidabl... | [
192,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/Order/GaloisConnection.lean | GaloisConnection.l_eq | [
{
"state_after": "case mp\nα : Type u\nβ : Type v\nγ : Type w\nι : Sort x\nκ : ι → Sort ?u.14243\na a₁ a₂ : α\nb b₁ b₂ : β\ninst✝¹ : Preorder α\ninst✝ : PartialOrder β\nl : α → β\nu : β → α\ngc : GaloisConnection l u\nx : α\nz : β\n⊢ l x = z → ∀ (y : β), z ≤ y ↔ x ≤ u y\n\ncase mpr\nα : Type u\nβ : Type v\nγ : ... | [
231,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
226,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Submodule.mem_annihilator' | [] | [
60,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/Data/List/Cycle.lean | Cycle.map_eq_nil | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nf : α → β\ns : Cycle α\n⊢ ∀ (a : List α), map f (Quotient.mk'' a) = nil ↔ Quotient.mk'' a = nil",
"tactic": "simp"
}
] | [
729,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
728,
1
] |
Mathlib/RingTheory/MvPolynomial/WeightedHomogeneous.lean | MvPolynomial.weightedTotalDegree_zero | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nM : Type u_1\ninst✝³ : CommSemiring R\nσ : Type u_3\ninst✝² : AddCommMonoid M\ninst✝¹ : SemilatticeSup M\ninst✝ : OrderBot M\nw : σ → M\n⊢ weightedTotalDegree w 0 = ⊥",
"tactic": "simp only [weightedTotalDegree, support_zero, Finset.sup_empty]"... | [
121,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
120,
1
] |
Mathlib/RingTheory/Polynomial/Bernstein.lean | bernsteinPolynomial.iterate_derivative_succ_at_0_eq_zero | [] | [
173,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Analysis/Quaternion.lean | Quaternion.coe_real_complex_mul | [
{
"state_after": "no goals",
"state_before": "r : ℝ\nz : ℂ\n⊢ ↑(r • z) = ↑r * ↑z",
"tactic": "ext <;> simp"
}
] | [
154,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Logic/Denumerable.lean | Nat.Subtype.le_succ_of_forall_lt_le | [] | [
261,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Mathlib/Algebra/Category/GroupCat/EpiMono.lean | GroupCat.surjective_of_epi | [
{
"state_after": "A B : GroupCat\nf : A ⟶ B\ninst✝ : Epi f\nr : ¬Function.Surjective ↑f\n⊢ False",
"state_before": "A B : GroupCat\nf : A ⟶ B\ninst✝ : Epi f\n⊢ Function.Surjective ↑f",
"tactic": "by_contra r"
},
{
"state_after": "A B : GroupCat\nf : A ⟶ B\ninst✝ : Epi f\nr : ¬∀ (b : ↑B), ∃ a, ↑f... | [
350,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
343,
1
] |
Mathlib/MeasureTheory/Group/Prod.lean | MeasureTheory.measurable_measure_mul_right | [
{
"state_after": "G : Type u_1\ninst✝⁴ : MeasurableSpace G\ninst✝³ : Group G\ninst✝² : MeasurableMul₂ G\nμ ν : Measure G\ninst✝¹ : SigmaFinite ν\ninst✝ : SigmaFinite μ\ns : Set G\nhs : MeasurableSet s\n⊢ Measurable fun y => ↑↑μ ((fun x => (x, y)) ⁻¹' ((fun z => (1, z.fst * z.snd)) ⁻¹' univ ×ˢ s))",
"state_b... | [
116,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.coeff_comp_monomial | [] | [
1364,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1363,
1
] |
Mathlib/Analysis/SpecialFunctions/ExpDeriv.lean | ContDiff.exp | [] | [
261,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
260,
1
] |
Mathlib/FieldTheory/Adjoin.lean | IntermediateField.subset_adjoin_of_subset_left | [] | [
337,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
336,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.ae_smul_measure_iff | [
{
"state_after": "α : Type u_1\nβ : Type ?u.134378\nγ : Type ?u.134381\nδ : Type ?u.134384\nι : Type ?u.134387\nR : Type ?u.134390\nR' : Type ?u.134393\nm0 : MeasurableSpace α\ninst✝¹ : MeasurableSpace β\ninst✝ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set α\np : α → Prop\nc : ℝ≥0∞\nhc : ... | [
913,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
910,
1
] |
Mathlib/Data/Nat/Bitwise.lean | Nat.eq_of_testBit_eq | [
{
"state_after": "case z\nn m✝ : ℕ\nh✝ : ∀ (i : ℕ), testBit n i = testBit m✝ i\nm : ℕ\nh : ∀ (i : ℕ), testBit 0 i = testBit m i\n⊢ 0 = m\n\ncase f\nn✝ m✝ : ℕ\nh✝ : ∀ (i : ℕ), testBit n✝ i = testBit m✝ i\nb : Bool\nn : ℕ\nhn : ∀ {m : ℕ}, (∀ (i : ℕ), testBit n i = testBit m i) → n = m\nm : ℕ\nh : ∀ (i : ℕ), testB... | [
95,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/Topology/Order/Basic.lean | Filter.Tendsto.atTop_add | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² : TopologicalSpace α\ninst✝¹ : LinearOrderedAddCommGroup α\ninst✝ : OrderTopology α\nl : Filter β\nf g : β → α\nC : α\nhf : Tendsto f l atTop\nhg : Tendsto g l (𝓝 C)\n⊢ Tendsto (fun x => g x + f x) l atTop",
"state_before": "α : Type u\nβ : Type ... | [
1899,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1896,
1
] |
Mathlib/Analysis/Calculus/Deriv/Basic.lean | hasDerivAt_iff_isLittleO_nhds_zero | [] | [
357,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
355,
1
] |
Mathlib/MeasureTheory/Group/Arithmetic.lean | Measurable.inv | [] | [
459,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
458,
1
] |
Mathlib/Data/Rat/Lemmas.lean | Rat.mul_num | [
{
"state_after": "no goals",
"state_before": "q₁ q₂ : ℚ\n⊢ (q₁ * q₂).num = q₁.num * q₂.num / ↑(Nat.gcd (Int.natAbs (q₁.num * q₂.num)) (q₁.den * q₂.den))",
"tactic": "rw [mul_def, normalize_eq]"
}
] | [
91,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/CommSq.lean | CategoryTheory.IsPullback.isoPullback_inv_fst | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nP X Y Z : C\nfst : P ⟶ X\nsnd : P ⟶ Y\nf : X ⟶ Z\ng : Y ⟶ Z\nh : IsPullback fst snd f g\ninst✝ : HasPullback f g\n⊢ (isoPullback h).inv ≫ fst = pullback.fst",
"tactic": "simp [Iso.inv_comp_eq]"
}
] | [
303,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
302,
1
] |
Mathlib/GroupTheory/QuotientGroup.lean | QuotientGroup.subsingleton_quotient_top | [
{
"state_after": "G : Type u\ninst✝¹ : Group G\nN : Subgroup G\nnN : Subgroup.Normal N\nH : Type v\ninst✝ : Group H\nφ : G →* H\n⊢ Subsingleton (Quot Setoid.r)",
"state_before": "G : Type u\ninst✝¹ : Group G\nN : Subgroup G\nnN : Subgroup.Normal N\nH : Type v\ninst✝ : Group H\nφ : G →* H\n⊢ Subsingleton (G ... | [
663,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
660,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | isOpen_iff_open_ball_subset | [
{
"state_after": "α : Type ua\nβ : Type ub\nγ : Type uc\nδ : Type ud\nι : Sort ?u.91712\ninst✝ : UniformSpace α\ns : Set α\n⊢ (∀ (x : α), x ∈ s → ∃ V, V ∈ 𝓤 α ∧ ball x V ⊆ s) ↔ ∀ (x : α), x ∈ s → ∃ V, V ∈ 𝓤 α ∧ IsOpen V ∧ ball x V ⊆ s",
"state_before": "α : Type ua\nβ : Type ub\nγ : Type uc\nδ : Type ud\n... | [
1017,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1008,
1
] |
Mathlib/CategoryTheory/Opposites.lean | CategoryTheory.unop_id | [] | [
96,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.isOpen_ball | [] | [
1009,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1008,
1
] |
Mathlib/CategoryTheory/EpiMono.lean | CategoryTheory.isIso_of_mono_of_isSplitEpi | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝² : Category C\nX Y : C\nf : X ⟶ Y\ninst✝¹ : Mono f\ninst✝ : IsSplitEpi f\n⊢ f ≫ section_ f = 𝟙 X",
"tactic": "simp [← cancel_mono f]"
},
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝² : Category C\nX Y : C\n... | [
153,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/Topology/Constructions.lean | nhds_ne_subtype_eq_bot_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type ?u.12421\nδ : Type ?u.12424\nε : Type ?u.12427\nζ : Type ?u.12430\ninst✝ : TopologicalSpace α\nS : Set α\nx : ↑S\n⊢ 𝓝[{x}ᶜ] x = ⊥ ↔ 𝓝[{↑x}ᶜ] ↑x ⊓ 𝓟 S = ⊥",
"tactic": "rw [← nhdsWithin_subtype_eq_bot_iff, preimage_compl, ← ... | [
241,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
238,
1
] |
Mathlib/Data/Stream/Init.lean | Stream'.drop_zip | [] | [
203,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/LinearAlgebra/Dual.lean | LinearMap.dualMap_injective_of_surjective | [
{
"state_after": "R : Type u\ninst✝⁴ : CommSemiring R\nM₁ : Type v\nM₂ : Type v'\ninst✝³ : AddCommMonoid M₁\ninst✝² : Module R M₁\ninst✝¹ : AddCommMonoid M₂\ninst✝ : Module R M₂\nf : M₁ →ₗ[R] M₂\nhf : Function.Surjective ↑f\nφ ψ : Dual R M₂\nh : ↑(dualMap f) φ = ↑(dualMap f) ψ\n⊢ φ = ψ",
"state_before": "R ... | [
232,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
227,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.order_eq_nat | [
{
"state_after": "case inl\nR : Type u_1\ninst✝ : Semiring R\nφ : PowerSeries R\nn : ℕ\n⊢ order 0 = ↑n ↔ ↑(coeff R n) 0 ≠ 0 ∧ ∀ (i : ℕ), i < n → ↑(coeff R i) 0 = 0\n\ncase inr\nR : Type u_1\ninst✝ : Semiring R\nφ✝ φ : PowerSeries R\nn : ℕ\nhφ : φ ≠ 0\n⊢ order φ = ↑n ↔ ↑(coeff R n) φ ≠ 0 ∧ ∀ (i : ℕ), i < n → ↑(c... | [
2318,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2314,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.iSup_div | [] | [
672,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
671,
1
] |
Mathlib/Analysis/Calculus/MeanValue.lean | norm_image_sub_le_of_norm_deriv_le_segment' | [
{
"state_after": "E : Type u_1\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedSpace ℝ E\nF : Type ?u.39172\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedSpace ℝ F\nf : ℝ → E\na b : ℝ\nf' : ℝ → E\nC : ℝ\nhf : ∀ (x : ℝ), x ∈ Icc a b → HasDerivWithinAt f (f' x) (Icc a b) x\nbound : ∀ (x : ℝ), x ∈ Ico a b → ‖f' x‖ ... | [
365,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
359,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.toReal_le_of_le_ofReal | [] | [
2158,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2155,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snorm_trim_ae | [
{
"state_after": "α : Type u_1\nE : Type u_2\nF : Type ?u.3174269\nG : Type ?u.3174272\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\nhm : m ≤ m0\nf : α → E\nhf : AEStronglyMeasurable f (Measure.trim ν hm)\... | [
1001,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
998,
1
] |
Mathlib/Data/Multiset/Nodup.lean | Multiset.Nodup.filter | [] | [
154,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Std/Data/Int/Lemmas.lean | Int.sub_le_sub_left | [] | [
1031,
43
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1030,
11
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | Measurable.coe_real_ereal | [] | [
1973,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1971,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean | AffineEquiv.linear_toAffineMap | [] | [
78,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Basic.lean | Real.log_eq_zero | [
{
"state_after": "case mp\nx✝ y x : ℝ\n⊢ log x = 0 → x = 0 ∨ x = 1 ∨ x = -1\n\ncase mpr\nx✝ y x : ℝ\n⊢ x = 0 ∨ x = 1 ∨ x = -1 → log x = 0",
"state_before": "x✝ y x : ℝ\n⊢ log x = 0 ↔ x = 0 ∨ x = 1 ∨ x = -1",
"tactic": "constructor"
},
{
"state_after": "case mp\nx✝ y x : ℝ\nh : log x = 0\n⊢ x = 0... | [
247,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
238,
1
] |
Mathlib/Algebra/Star/Subalgebra.lean | StarSubalgebra.mul_mem_sup | [] | [
645,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
643,
1
] |
Mathlib/Analysis/Convex/Strict.lean | strictConvex_empty | [] | [
66,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/Analysis/NormedSpace/OperatorNorm.lean | ContinuousLinearMap.coe_restrictScalarsL | [] | [
1284,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1282,
1
] |
Mathlib/Algebra/DualQuaternion.lean | Quaternion.snd_imI_dualNumberEquiv_symm | [] | [
145,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Topology/Basic.lean | Filter.HasBasis.clusterPt_iff | [] | [
1090,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1087,
1
] |
Mathlib/Topology/FiberBundle/Basic.lean | FiberBundleCore.localTrivAt_snd | [] | [
635,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
633,
1
] |
Mathlib/Algebra/Order/Group/Defs.lean | Right.inv_le_self | [] | [
486,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
485,
1
] |
Mathlib/Computability/TuringMachine.lean | Turing.BlankExtends.refl | [
{
"state_after": "no goals",
"state_before": "Γ : Type u_1\ninst✝ : Inhabited Γ\nl : List Γ\n⊢ l = l ++ List.replicate 0 default",
"tactic": "simp"
}
] | [
83,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/Analysis/Calculus/Deriv/Basic.lean | hasDerivWithinAt_id | [] | [
637,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
636,
1
] |
Mathlib/AlgebraicTopology/SimplicialObject.lean | CategoryTheory.SimplicialObject.δ_comp_δ_self' | [
{
"state_after": "C : Type u\ninst✝ : Category C\nX : SimplicialObject C\nn : ℕ\ni : Fin (n + 2)\n⊢ δ X (↑Fin.castSucc i) ≫ δ X i = δ X (Fin.succ i) ≫ δ X i",
"state_before": "C : Type u\ninst✝ : Category C\nX : SimplicialObject C\nn : ℕ\nj : Fin (n + 3)\ni : Fin (n + 2)\nH : j = ↑Fin.castSucc i\n⊢ δ X j ≫ ... | [
144,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.op_smul_finset_mul_eq_mul_smul_finset | [] | [
1869,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1867,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | open_of_uniformity_sum_aux | [
{
"state_after": "case left\nα : Type ua\nβ : Type ub\nγ : Type uc\nδ : Type ud\nι : Sort ?u.179763\ninst✝¹ : UniformSpace α\ninst✝ : UniformSpace β\ns : Set (α ⊕ β)\nhs : ∀ (x : α ⊕ β), x ∈ s → {p | p.fst = x → p.snd ∈ s} ∈ UniformSpace.Core.sum.uniformity\n⊢ s ∈\n (↑OrderDual.toDual ∘ (fun t => ↑OrderDual.... | [
1809,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1795,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.mem_iInf' | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.71658\nι✝ : Sort x\nf g : Filter α\ns✝ t : Set α\nι : Type u_1\ns : ι → Filter α\nU : Set α\n⊢ (∃ I, Set.Finite I ∧ ∃ V, (∀ (i : ↑I), V i ∈ s ↑i) ∧ U = ⋂ (i : ↑I), V i) ↔\n ∃ I,\n Set.Finite I ∧\n ∃ V, (∀ (i : ι), V i ∈ s i) ∧ (∀ (... | [
629,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
616,
1
] |
Mathlib/Topology/Filter.lean | Filter.nhds_inf | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.12737\nα : Type u_1\nβ : Type ?u.12743\nX : Type ?u.12746\nY : Type ?u.12749\nl₁ l₂ : Filter α\n⊢ 𝓝 (l₁ ⊓ l₂) = 𝓝 l₁ ⊓ 𝓝 l₂",
"tactic": "simpa only [iInf_bool_eq] using nhds_iInf fun b => cond b l₁ l₂"
}
] | [
143,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Std/Logic.lean | exists₅_congr | [] | [
415,
45
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
412,
1
] |
Mathlib/Data/Set/Intervals/OrderIso.lean | OrderIso.preimage_Ioo | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\ninst✝¹ : Preorder α\ninst✝ : Preorder β\ne : α ≃o β\na b : β\n⊢ ↑e ⁻¹' Ioo a b = Ioo (↑(symm e) a) (↑(symm e) b)",
"tactic": "simp [← Ioi_inter_Iio]"
}
] | [
66,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/Algebra/Order/Group/Abs.lean | abs_le_abs | [] | [
73,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.eventually_nhds_prod_iff | [
{
"state_after": "α✝ : Type u\nβ : Type v\nX : Type ?u.91426\nι✝ : Type ?u.91429\ninst✝¹ : PseudoMetricSpace α✝\nx y z : α✝\nδ ε ε₁ ε₂ : ℝ\ns : Set α✝\nι : Type u_1\nα : Type u_2\ninst✝ : PseudoMetricSpace α\nf : Filter ι\nx₀ : α\np : α × ι → Prop\n⊢ (∃ i, (0 < i.fst ∧ i.snd ∈ f) ∧ ∀ ⦃x : α × ι⦄, x ∈ ball x₀ i.... | [
966,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
960,
1
] |
Mathlib/Analysis/Normed/Ring/Seminorm.lean | RingSeminorm.eq_zero_iff | [] | [
117,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
116,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Submodule.map_sup | [] | [
842,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
841,
1
] |
Mathlib/Topology/Algebra/Valuation.lean | Valued.toUniformSpace_eq | [] | [
135,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
132,
1
] |
Mathlib/Order/Hom/CompleteLattice.lean | FrameHom.ext | [] | [
568,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
567,
1
] |
Mathlib/Data/Multiset/Nodup.lean | Multiset.count_eq_of_nodup | [
{
"state_after": "case inl\nα : Type u_1\nβ : Type ?u.3481\nγ : Type ?u.3484\nr : α → α → Prop\ns✝ t : Multiset α\na✝ : α\ninst✝ : DecidableEq α\na : α\ns : Multiset α\nd : Nodup s\nh : a ∈ s\n⊢ count a s = 1\n\ncase inr\nα : Type u_1\nβ : Type ?u.3481\nγ : Type ?u.3484\nr : α → α → Prop\ns✝ t : Multiset α\na✝ ... | [
101,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
97,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | MultilinearMap.map_zero | [
{
"state_after": "case intro\nR : Type u\nι : Type u'\nn : ℕ\nM : Fin (Nat.succ n) → Type v\nM₁ : ι → Type v₁\nM₂ : Type v₂\nM₃ : Type v₃\nM' : Type v'\ninst✝¹¹ : Semiring R\ninst✝¹⁰ : (i : Fin (Nat.succ n)) → AddCommMonoid (M i)\ninst✝⁹ : (i : ι) → AddCommMonoid (M₁ i)\ninst✝⁸ : AddCommMonoid M₂\ninst✝⁷ : AddC... | [
195,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | hasStrictFDerivAt_id | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type ?u.564139\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type ?u.564234\ninst✝³ : NormedAddCommGroup G\ninst✝² : ... | [
991,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
990,
1
] |
Mathlib/Data/List/Basic.lean | List.filter_eq_foldr | [
{
"state_after": "case cons\nι : Type ?u.369991\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\np✝ p : α → Bool\nhead✝ : α\ntail✝ : List α\ntail_ih✝ : filter p tail✝ = foldr (fun a out => bif p a then a :: out else out) [] tail✝\n⊢ (match p head✝ with\n | true => head✝ :: foldr (fun a out =>... | [
3520,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3518,
1
] |
Mathlib/Analysis/NormedSpace/Extr.lean | IsMaxOn.norm_add_sameRay | [] | [
60,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
58,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.biUnion_val | [] | [
3531,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3529,
1
] |
Mathlib/MeasureTheory/Measure/AEMeasurable.lean | aemeasurable_add_measure_iff | [
{
"state_after": "ι : Type ?u.1320516\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.1320525\nδ : Type ?u.1320528\nR : Type ?u.1320531\nm0 : MeasurableSpace α\ninst✝² : MeasurableSpace β\ninst✝¹ : MeasurableSpace γ\ninst✝ : MeasurableSpace δ\nf g : α → β\nμ ν : MeasureTheory.Measure α\n⊢ AEMeasurable f ∧ AEMeasurable... | [
124,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Ico_subset_Ico_iff | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.121361\nα : Type u_1\ninst✝¹ : LinearOrder α\ninst✝ : LocallyFiniteOrder α\na b a₁ b₁ a₂ b₂ : α\nh : a₁ < b₁\n⊢ Ico a₁ b₁ ⊆ Ico a₂ b₂ ↔ a₂ ≤ a₁ ∧ b₁ ≤ b₂",
"tactic": "rw [← coe_subset, coe_Ico, coe_Ico, Set.Ico_subset_Ico_iff h]"
}
] | [
753,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
751,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.HasFiniteIntegral.neg | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.724403\nδ : Type ?u.724406\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝² : MeasurableSpace δ\ninst✝¹ : NormedAddCommGroup β\ninst✝ : NormedAddCommGroup γ\nf : α → β\nhfi : HasFiniteIntegral f\n⊢ HasFiniteIntegral (-f)",
... | [
239,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
238,
1
] |
Mathlib/Order/Heyting/Basic.lean | top_sdiff' | [] | [
984,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
983,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | AffineSubspace.coe_eq_bot_iff | [] | [
837,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
836,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.prod_top | [
{
"state_after": "case h\nR : Type u_3\nR₂ : Type ?u.249983\nK : Type ?u.249986\nM : Type u_1\nM₂ : Type ?u.249992\nV : Type ?u.249995\nS : Type ?u.249998\ninst✝⁷ : Semiring R\ninst✝⁶ : AddCommMonoid M\ninst✝⁵ : Module R M\nx : M\np p' : Submodule R M\ninst✝⁴ : Semiring R₂\nσ₁₂ : R →+* R₂\ninst✝³ : AddCommMonoi... | [
786,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
786,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.