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/Filter/SmallSets.lean | Filter.hasBasis_smallSets | [] | [
55,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Analysis/NormedSpace/Basic.lean | algebraMap_isometry | [
{
"state_after": "α : Type ?u.578231\nβ : Type ?u.578234\nγ : Type ?u.578237\nι : Type ?u.578240\n𝕜 : Type u_2\n𝕜' : Type u_1\ninst✝³ : NormedField 𝕜\ninst✝² : SeminormedRing 𝕜'\ninst✝¹ : NormedAlgebra 𝕜 𝕜'\ninst✝ : NormOneClass 𝕜'\nx y : 𝕜\n⊢ dist (↑(algebraMap 𝕜 𝕜') x) (↑(algebraMap 𝕜 𝕜') y) = dis... | [
541,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
539,
1
] |
Mathlib/Data/List/Basic.lean | List.reduceOption_concat_of_some | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.369210\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nl : List (Option α)\nx : α\n⊢ reduceOption (concat l (some x)) = concat (reduceOption l) x",
"tactic": "simp only [reduceOption_nil, concat_eq_append, reduceOption_append, re... | [
3493,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3491,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Order.lean | tsum_ne_zero_iff | [
{
"state_after": "no goals",
"state_before": "ι : Type u_2\nκ : Type ?u.55666\nα : Type u_1\ninst✝² : CanonicallyOrderedAddMonoid α\ninst✝¹ : TopologicalSpace α\ninst✝ : OrderClosedTopology α\nf : ι → α\na : α\nhf : Summable f\n⊢ (∑' (i : ι), f i) ≠ 0 ↔ ∃ x, f x ≠ 0",
"tactic": "rw [Ne.def, tsum_eq_zero... | [
218,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
217,
1
] |
Mathlib/Topology/Algebra/Monoid.lean | continuousOn_finset_prod | [] | [
772,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
770,
1
] |
Mathlib/RingTheory/WittVector/Basic.lean | WittVector.mapFun.neg | [
{
"state_after": "no goals",
"state_before": "p : ℕ\nR : Type u_2\nS : Type u_1\nT : Type ?u.310095\nhp : Fact (Nat.Prime p)\ninst✝² : CommRing R\ninst✝¹ : CommRing S\ninst✝ : CommRing T\nα : Type ?u.310110\nβ : Type ?u.310113\nf : R →+* S\nx y : 𝕎 R\n⊢ mapFun (↑f) (-x) = -mapFun (↑f) x",
"tactic": "ma... | [
124,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.int_cast_comp_cast | [
{
"state_after": "case zero\nR : Type u_1\ninst✝ : Ring R\n⊢ Int.cast ∘ cast = cast\n\ncase succ\nR : Type u_1\ninst✝ : Ring R\nn✝ : ℕ\n⊢ Int.cast ∘ cast = cast",
"state_before": "n : ℕ\nR : Type u_1\ninst✝ : Ring R\n⊢ Int.cast ∘ cast = cast",
"tactic": "cases n"
},
{
"state_after": "case succ.h... | [
253,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
249,
1
] |
Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean | le_iff_exists_mul' | [
{
"state_after": "no goals",
"state_before": "α : Type u\ninst✝ : CanonicallyOrderedMonoid α\na b c d : α\n⊢ a ≤ b ↔ ∃ c, b = c * a",
"tactic": "simp only [mul_comm _ a, le_iff_exists_mul]"
}
] | [
214,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Type.lean | Equiv.Perm.filter_parts_partition_eq_cycleType | [
{
"state_after": "α : Type u_1\ninst✝¹ : Fintype α\ninst✝ : DecidableEq α\nσ : Perm α\na : ℕ\nh : a ∈ replicate (Fintype.card α - Finset.card (support σ)) 1\n⊢ ¬2 ≤ a",
"state_before": "α : Type u_1\ninst✝¹ : Fintype α\ninst✝ : DecidableEq α\nσ : Perm α\n⊢ filter (fun n => 2 ≤ n) (partition σ).parts = cycle... | [
540,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
535,
1
] |
Mathlib/Topology/MetricSpace/Completion.lean | LipschitzWith.completion_extension | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝² : PseudoMetricSpace α\ninst✝¹ : MetricSpace β\ninst✝ : CompleteSpace β\nf : α → β\nK : ℝ≥0\nh : LipschitzWith K f\nx y : Completion α\n⊢ Continuous fun x => dist (Completion.extension f x.fst) (Completion.extension f x.snd)",
"... | [
201,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | Continuous.measurable2 | [] | [
951,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
948,
1
] |
Mathlib/Data/Multiset/Functor.lean | Multiset.traverse_map | [
{
"state_after": "F : Type u → Type u\ninst✝³ : Applicative F\ninst✝² : CommApplicative F\nα' β' : Type u\nf : α' → F β'\nG : Type u_1 → Type u_1\ninst✝¹ : Applicative G\ninst✝ : CommApplicative G\nα β γ : Type u_1\ng : α → β\nh : β → G γ\nx : Multiset α\n⊢ ∀ (a : List α), traverse h (map g (Quotient.mk (isSeto... | [
135,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/Topology/Algebra/WithZeroTopology.lean | WithZeroTopology.Iio_mem_nhds | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.83617\nΓ₀ : Type u_1\ninst✝ : LinearOrderedCommGroupWithZero Γ₀\nγ γ₁ γ₂ : Γ₀\nl : Filter α\nf : α → Γ₀\nh : γ₁ < γ₂\n⊢ Iio γ₂ ∈ 𝓝 γ₁",
"tactic": "rcases eq_or_ne γ₁ 0 with (rfl | h₀) <;> simp [*, h.ne', Iio_mem_nhds_zero]"
}
] | [
132,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Mathlib/RingTheory/HahnSeries.lean | Polynomial.algebraMap_hahnSeries_apply | [] | [
1325,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1323,
1
] |
Mathlib/Data/Part.lean | Part.some_mul_some | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.57768\nγ : Type ?u.57771\ninst✝ : Mul α\na b : α\n⊢ some a * some b = some (a * b)",
"tactic": "simp [mul_def]"
}
] | [
740,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
740,
1
] |
Mathlib/LinearAlgebra/Pi.lean | LinearMap.pi_zero | [
{
"state_after": "case h.h\nR : 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\nι' : Type x'\ninst✝⁶ : Semiring R\ninst✝⁵ : AddCommMonoid M₂\ninst✝⁴ : Module R M₂\ninst✝³ : AddCommMonoid M₃\ninst✝² : Module R M₃\nφ : ι → Type i\ninst✝¹... | [
72,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Topology/Separation.lean | compl_singleton_mem_nhds | [] | [
622,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
621,
1
] |
Mathlib/Algebra/Group/Basic.lean | div_one | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.20357\nβ : Type ?u.20360\nG : Type u_1\ninst✝ : DivInvOneMonoid G\na : G\n⊢ a / 1 = a",
"tactic": "simp [div_eq_mul_inv]"
}
] | [
341,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
341,
1
] |
Mathlib/Data/Real/Sign.lean | Real.sign_mul_pos_of_ne_zero | [
{
"state_after": "r : ℝ\nhr : r ≠ 0\nh : 0 = sign r * r\n⊢ r = 0",
"state_before": "r : ℝ\nhr : r ≠ 0\n⊢ 0 < sign r * r",
"tactic": "refine' lt_of_le_of_ne (sign_mul_nonneg r) fun h => hr _"
},
{
"state_after": "r : ℝ\nhr : r ≠ 0\nh : 0 = sign r * r\nhs0 : sign r = 0\n⊢ r = 0",
"state_before... | [
104,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Mathlib/Topology/Algebra/Polynomial.lean | Polynomial.continuousAt | [] | [
64,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
11
] |
Mathlib/SetTheory/ZFC/Basic.lean | ZFSet.nonempty_of_mem | [] | [
754,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
753,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.uIcc_subset_uIcc_iff_mem | [] | [
944,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
943,
1
] |
Mathlib/RingTheory/Polynomial/ScaleRoots.lean | Polynomial.coeff_scaleRoots | [
{
"state_after": "no goals",
"state_before": "A : Type ?u.2391\nK : Type ?u.2394\nR : Type u_1\nS : Type ?u.2400\ninst✝⁴ : CommRing A\ninst✝³ : IsDomain A\ninst✝² : Field K\ninst✝¹ : CommRing R\ninst✝ : CommRing S\nM : Submonoid A\np : R[X]\ns : R\ni : ℕ\n⊢ coeff (scaleRoots p s) i = coeff p i * s ^ (natDeg... | [
38,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
36,
1
] |
Mathlib/CategoryTheory/Monoidal/Braided.lean | CategoryTheory.tensor_associativity | [
{
"state_after": "C : Type u₁\ninst✝⁸ : Category C\ninst✝⁷ : MonoidalCategory C\ninst✝⁶ : BraidedCategory C\nD : Type u₂\ninst✝⁵ : Category D\ninst✝⁴ : MonoidalCategory D\ninst✝³ : BraidedCategory D\nE : Type u₃\ninst✝² : Category E\ninst✝¹ : MonoidalCategory E\ninst✝ : BraidedCategory E\nX₁ X₂ Y₁ Y₂ Z₁ Z₂ : C\... | [
555,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
473,
1
] |
Mathlib/Data/Complex/ExponentialBounds.lean | Real.log_two_gt_d9 | [
{
"state_after": "no goals",
"state_before": "⊢ 0.6931471803 < 287209 / 414355 - 1 / 10 ^ 10",
"tactic": "norm_num1"
}
] | [
75,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/RingTheory/Algebraic.lean | Polynomial.algebraMap_pi_self_eq_eval | [] | [
477,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
475,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Real.lean | Real.rpow_neg_one | [
{
"state_after": "x✝ y z x : ℝ\nH : x ^ ↑(-1) = x⁻¹\n⊢ x ^ (-1) = x⁻¹\n\ncase H\nx✝ y z x : ℝ\n⊢ x ^ ↑(-1) = x⁻¹",
"state_before": "x✝ y z x : ℝ\n⊢ x ^ (-1) = x⁻¹",
"tactic": "suffices H : x ^ ((-1 : ℤ) : ℝ) = x⁻¹"
},
{
"state_after": "no goals",
"state_before": "case H\nx✝ y z x : ℝ\n⊢ x ^ ... | [
372,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
370,
1
] |
Mathlib/Data/IsROrC/Basic.lean | IsROrC.im_le_norm | [] | [
737,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
736,
1
] |
Mathlib/Algebra/Lie/Submodule.lean | LieSubmodule.nontrivial_iff | [] | [
539,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
536,
1
] |
Mathlib/GroupTheory/GroupAction/Defs.lean | MulDistribMulAction.toMonoidHom_apply | [] | [
1036,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1034,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean | MeasureTheory.measure_mono_null | [] | [
200,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
199,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.ext | [] | [
562,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
561,
1
] |
Mathlib/Data/Finset/Lattice.lean | Set.iUnion_eq_iUnion_finset | [] | [
1855,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1854,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.sum_sub_index | [
{
"state_after": "ι : Type u\nγ : Type w\nβ : ι → Type v\nβ₁ : ι → Type v₁\nβ₂ : ι → Type v₂\ndec : DecidableEq ι\ninst✝² : (i : ι) → AddGroup (β i)\ninst✝¹ : (i : ι) → (x : β i) → Decidable (x ≠ 0)\ninst✝ : AddCommGroup γ\nf g : Π₀ (i : ι), β i\nh : (i : ι) → β i → γ\nh_sub : ∀ (i : ι) (b₁ b₂ : β i), h i (b₁ -... | [
2081,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2076,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.sub_self_im | [] | [
823,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
823,
16
] |
Mathlib/GroupTheory/Sylow.lean | Sylow.pow_dvd_card_of_pow_dvd_card | [] | [
665,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
661,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean | CategoryTheory.Limits.Cofork.condition | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝ : Category C\nX Y : C\nf g : X ⟶ Y\nt : Cofork f g\n⊢ f ≫ π t = g ≫ π t",
"tactic": "rw [← t.app_zero_eq_comp_π_left, ← t.app_zero_eq_comp_π_right]"
}
] | [
398,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
397,
1
] |
Mathlib/Order/Basic.lean | eq_of_forall_le_iff | [] | [
525,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
524,
1
] |
Mathlib/Analysis/Convex/Between.lean | Wbtw.trans_right_ne | [
{
"state_after": "R : Type u_1\nV : Type u_2\nV' : Type ?u.323287\nP : Type u_3\nP' : Type ?u.323293\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'\ninst✝ : NoZeroSMulDivisors R V\nw x z : P\... | [
514,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
511,
1
] |
Mathlib/Analysis/Convex/Function.lean | ConvexOn.smul | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.724295\nα : Type ?u.724298\nβ : Type u_3\nι : Type ?u.724304\ninst✝⁵ : OrderedCommSemiring 𝕜\ninst✝⁴ : AddCommMonoid E\ninst✝³ : OrderedAddCommMonoid β\ninst✝² : SMul 𝕜 E\ninst✝¹ : Module 𝕜 β\ninst✝ : OrderedSMul 𝕜 β\... | [
983,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
978,
1
] |
Mathlib/GroupTheory/Subgroup/Finite.lean | Subgroup.list_prod_mem | [] | [
54,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
11
] |
Mathlib/GroupTheory/Submonoid/Operations.lean | Submonoid.bot_or_exists_ne_one | [] | [
1389,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1388,
1
] |
Mathlib/Algebra/Homology/Homotopy.lean | Homotopy.nullHomotopicMap'_f | [
{
"state_after": "ι : Type u_1\nV : Type u\ninst✝¹ : Category V\ninst✝ : Preadditive V\nc : ComplexShape ι\nC D E : HomologicalComplex V c\nf g : C ⟶ D\nh✝ k : D ⟶ E\ni k₂ k₁ k₀ : ι\nr₂₁ : ComplexShape.Rel c k₂ k₁\nr₁₀ : ComplexShape.Rel c k₁ k₀\nh : (i j : ι) → ComplexShape.Rel c j i → (X C i ⟶ X D j)\n⊢ Hom.f... | [
383,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
376,
1
] |
Mathlib/RingTheory/Valuation/Basic.lean | Valuation.coe_coe | [] | [
153,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/NumberTheory/Divisors.lean | Nat.mem_divisors_prime_pow | [
{
"state_after": "n p : ℕ\npp : Prime p\nk x : ℕ\n⊢ (∃ k_1, k_1 ≤ k ∧ x = p ^ k_1) ↔ ∃ j x_1, x = p ^ j",
"state_before": "n p : ℕ\npp : Prime p\nk x : ℕ\n⊢ x ∈ divisors (p ^ k) ↔ ∃ j x_1, x = p ^ j",
"tactic": "rw [mem_divisors, Nat.dvd_prime_pow pp, and_iff_left (ne_of_gt (pow_pos pp.pos k))]"
},
... | [
313,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
310,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.pure_injective | [] | [
2599,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2598,
1
] |
Mathlib/RingTheory/FinitePresentation.lean | AlgHom.FinitePresentation.of_finiteType | [] | [
526,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
525,
1
] |
Mathlib/MeasureTheory/Function/ConvergenceInMeasure.lean | MeasureTheory.TendstoInMeasure.congr_right | [] | [
99,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
97,
1
] |
Std/Data/List/Lemmas.lean | List.extractP_eq_find?_eraseP | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\np : α → Bool\nl : List α\n⊢ extractP p l = (find? p l, eraseP p l)",
"tactic": "exact go #[] _ rfl"
},
{
"state_after": "no goals",
"state_before": "α : Type u_1\np : α → Bool\nl : List α\nacc : Array α\nh : l = acc.data ++ []\n⊢ ex... | [
1021,
21
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1013,
9
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | LinearMap.toMatrix'_symm | [] | [
319,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
317,
1
] |
Mathlib/Data/Polynomial/FieldDivision.lean | Polynomial.degree_div_lt | [
{
"state_after": "R : Type u\nS : Type v\nk : Type y\nA : Type z\na b : R\nn : ℕ\ninst✝ : Field R\np q : R[X]\nhp : p ≠ 0\nhq : 0 < degree q\nhq0 : q ≠ 0\n⊢ degree (p / q) < degree p",
"state_before": "R : Type u\nS : Type v\nk : Type y\nA : Type z\na b : R\nn : ℕ\ninst✝ : Field R\np q : R[X]\nhp : p ≠ 0\nh... | [
274,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
269,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.ncard_eq_three | [
{
"state_after": "case refine'_1\nα : Type u_1\nβ : Type ?u.164615\ns t : Set α\na b x y : α\nf : α → β\nh : ncard s = 3\n⊢ ∃ x y z, x ≠ y ∧ x ≠ z ∧ y ≠ z ∧ s = {x, y, z}\n\ncase refine'_2\nα : Type u_1\nβ : Type ?u.164615\ns t : Set α\na b x y : α\nf : α → β\n⊢ (∃ x y z, x ≠ y ∧ x ≠ z ∧ y ≠ z ∧ s = {x, y, z}) ... | [
767,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
757,
1
] |
Mathlib/Control/Traversable/Basic.lean | ApplicativeTransformation.preserves_map' | [
{
"state_after": "case h\nF : Type u → Type v\ninst✝³ : Applicative F\ninst✝² : LawfulApplicative F\nG : Type u → Type w\ninst✝¹ : Applicative G\ninst✝ : LawfulApplicative G\nη : ApplicativeTransformation F G\nα β : Type u\nx : α → β\ny : F α\n⊢ ((fun {α} => app η α) ∘ Functor.map x) y = (Functor.map x ∘ fun {α... | [
159,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/Topology/MetricSpace/Lipschitz.lean | LipschitzWith.comp_lipschitzOnWith | [] | [
236,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
234,
1
] |
Mathlib/Order/Iterate.lean | Monotone.antitone_iterate_of_map_le | [] | [
244,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/CategoryTheory/Abelian/Exact.lean | CategoryTheory.Abelian.exact_iff_exact_coimage_π | [
{
"state_after": "C : Type u₁\ninst✝¹ : Category C\ninst✝ : Abelian C\nX Y Z : C\nf : X ⟶ Y\ng : Y ⟶ Z\n⊢ Exact f (coimage.π g ≫ Abelian.factorThruCoimage g) ↔ Exact f (coimage.π g)",
"state_before": "C : Type u₁\ninst✝¹ : Category C\ninst✝ : Abelian C\nX Y Z : C\nf : X ⟶ Y\ng : Y ⟶ Z\n⊢ Exact f g ↔ Exact f... | [
249,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
247,
1
] |
Mathlib/Combinatorics/SimpleGraph/Density.lean | Rel.interedges_disjoint_left | [
{
"state_after": "𝕜 : Type ?u.5508\nι : Type ?u.5511\nκ : Type ?u.5514\nα : Type u_1\nβ : Type u_2\ninst✝¹ : LinearOrderedField 𝕜\nr : α → β → Prop\ninst✝ : (a : α) → DecidablePred (r a)\ns✝ s₁ s₂ : Finset α\nt✝ t₁ t₂ : Finset β\na : α\nb : β\nδ : 𝕜\ns s' : Finset α\nhs : ∀ ⦃a : α⦄, a ∈ s → ¬a ∈ s'\nt : Fins... | [
93,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
1
] |
Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean | finrank_vectorSpan_le_iff_not_affineIndependent | [] | [
207,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/Order/CompleteLattice.lean | iSup_lt_iff | [] | [
921,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
920,
1
] |
Mathlib/RingTheory/Noetherian.lean | isNoetherianRing_iff | [] | [
493,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
492,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.countp_eq_card_filter | [] | [
2226,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2225,
1
] |
Mathlib/Analysis/Normed/Group/Hom.lean | NormedAddGroupHom.coe_ker | [] | [
771,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
770,
1
] |
Mathlib/Data/Set/Intervals/OrdConnected.lean | Set.ordConnected_Ico | [] | [
161,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
160,
1
] |
Mathlib/Algebra/BigOperators/NatAntidiagonal.lean | Finset.Nat.prod_antidiagonal_succ | [
{
"state_after": "M : Type u_1\nN : Type ?u.17\ninst✝¹ : CommMonoid M\ninst✝ : AddCommMonoid N\nn : ℕ\nf : ℕ × ℕ → M\n⊢ f (0, n + 1) *\n ∏ x in antidiagonal n,\n f\n (↑(Function.Embedding.prodMap { toFun := Nat.succ, inj' := Nat.succ_injective } (Function.Embedding.refl ℕ))\n x) ... | [
30,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
28,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.conjTranspose_list_prod | [] | [
2331,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2329,
1
] |
Mathlib/Order/Filter/Lift.lean | Filter.monotone_lift' | [] | [
341,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
340,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineMap.lean | AffineMap.linear_injective_iff | [
{
"state_after": "case intro\nk : Type u_1\nV1 : Type u_2\nP1 : Type u_3\nV2 : Type u_4\nP2 : Type u_5\nV3 : Type ?u.361436\nP3 : Type ?u.361439\nV4 : Type ?u.361442\nP4 : Type ?u.361445\ninst✝¹² : Ring k\ninst✝¹¹ : AddCommGroup V1\ninst✝¹⁰ : Module k V1\ninst✝⁹ : AffineSpace V1 P1\ninst✝⁸ : AddCommGroup V2\nin... | [
474,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
468,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | finrank_span_singleton | [
{
"state_after": "case a\nK : Type u\nV : Type v\ninst✝² : DivisionRing K\ninst✝¹ : AddCommGroup V\ninst✝ : Module K V\nv : V\nhv : v ≠ 0\n⊢ finrank K { x // x ∈ span K {v} } ≤ 1\n\ncase a\nK : Type u\nV : Type v\ninst✝² : DivisionRing K\ninst✝¹ : AddCommGroup V\ninst✝ : Module K V\nv : V\nhv : v ≠ 0\n⊢ 1 ≤ fin... | [
1155,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1150,
1
] |
Mathlib/Data/Set/Finite.lean | Set.eq_of_subset_of_card_le | [] | [
1247,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1245,
1
] |
Mathlib/Data/Int/Units.lean | Int.eq_of_mul_eq_one | [] | [
66,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/Data/Rat/Order.lean | Rat.le_refl | [
{
"state_after": "a b c : ℚ\n⊢ Rat.Nonneg (a - a)",
"state_before": "a b c : ℚ\n⊢ a ≤ a",
"tactic": "rw [Rat.le_iff_Nonneg]"
},
{
"state_after": "a b c : ℚ\n⊢ Rat.Nonneg (a - a)",
"state_before": "a b c : ℚ\n⊢ Rat.Nonneg (a - a)",
"tactic": "show Rat.Nonneg (a - a)"
},
{
"state_a... | [
165,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
11
] |
Mathlib/LinearAlgebra/LinearPMap.lean | LinearPMap.mkSpanSingleton'_apply_self | [
{
"state_after": "R : Type u_2\ninst✝⁶ : Ring R\nE : Type u_1\ninst✝⁵ : AddCommGroup E\ninst✝⁴ : Module R E\nF : Type u_3\ninst✝³ : AddCommGroup F\ninst✝² : Module R F\nG : Type ?u.87505\ninst✝¹ : AddCommGroup G\ninst✝ : Module R G\nx : E\ny : F\nH : ∀ (c : R), c • x = 0 → c • y = 0\nh : x ∈ (mkSpanSingleton' x... | [
171,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/Analysis/Calculus/Monotone.lean | StieltjesFunction.ae_hasDerivAt | [
{
"state_after": "case h\nf : StieltjesFunction\nx : ℝ\nhx :\n Tendsto (fun a => ↑↑(StieltjesFunction.measure f) a / ↑↑volume a) (VitaliFamily.filterAt (vitaliFamily volume 1) x)\n (𝓝 (rnDeriv (StieltjesFunction.measure f) volume x))\nh'x : rnDeriv (StieltjesFunction.measure f) volume x < ⊤\nh''x : ¬leftLi... | [
136,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.cases_succ' | [
{
"state_after": "no goals",
"state_before": "n✝ m n : ℕ\nC : Fin (n + 1) → Sort u_1\nH0 : C 0\nHs : (i : Fin n) → C (succ i)\ni : ℕ\nh : i + 1 < n + 1\n⊢ cases H0 Hs { val := Nat.succ i, isLt := h } = Hs { val := i, isLt := (_ : i < n) }",
"tactic": "cases i <;> rfl"
}
] | [
1747,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1746,
1
] |
Mathlib/LinearAlgebra/Matrix/NonsingularInverse.lean | Matrix.det_conj' | [
{
"state_after": "no goals",
"state_before": "l : Type ?u.411237\nm : Type u\nn : Type u'\nα : Type v\ninst✝⁴ : Fintype n\ninst✝³ : DecidableEq n\ninst✝² : CommRing α\nA B : Matrix n n α\ninst✝¹ : Fintype m\ninst✝ : DecidableEq m\nM : Matrix m m α\nh : IsUnit M\nN : Matrix m m α\n⊢ det (M⁻¹ ⬝ N ⬝ M) = det N... | [
710,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
709,
1
] |
Mathlib/Data/List/Perm.lean | List.perm_replicate | [] | [
199,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
1
] |
Mathlib/Data/Multiset/FinsetOps.lean | Multiset.attach_ndinsert | [
{
"state_after": "α : Type u_1\ninst✝ : DecidableEq α\ns✝ : Multiset α\na : α\ns : Multiset α\neq : ∀ (h : ∀ (p : { x // x ∈ s }), ↑p ∈ s), (fun p => { val := ↑p, property := (_ : ↑p ∈ s) }) = id\nt : Multiset α\nht : ndinsert a s = t\n⊢ attach t =\n ndinsert { val := a, property := (_ : a ∈ t) } (map (fun p... | [
120,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
1
] |
Mathlib/Data/QPF/Univariate/Basic.lean | Qpf.recF_eq | [
{
"state_after": "case mk\nF : Type u → Type u\ninst✝ : Functor F\nq : Qpf F\nα : Type u\ng : F α → α\na✝ : (P F).A\nf✝ : PFunctor.B (P F) a✝ → WType (P F).B\n⊢ recF g (WType.mk a✝ f✝) = g (abs (recF g <$> PFunctor.W.dest (WType.mk a✝ f✝)))",
"state_before": "F : Type u → Type u\ninst✝ : Functor F\nq : Qpf ... | [
175,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Mathlib/Algebra/Hom/Ring.lean | RingHom.id_comp | [] | [
719,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
718,
1
] |
Mathlib/Algebra/Order/Ring/WithTop.lean | WithTop.mul_top | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝² : DecidableEq α\ninst✝¹ : Zero α\ninst✝ : Mul α\na : WithTop α\nh : a ≠ 0\n⊢ a * ⊤ = ⊤",
"tactic": "rw [mul_top', if_neg h]"
}
] | [
53,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
9
] |
Mathlib/ModelTheory/Syntax.lean | FirstOrder.Language.LEquiv.onFormula_apply | [] | [
976,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
974,
1
] |
Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.restrict_lintegral_eq_lintegral_restrict | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.889169\nγ : Type ?u.889172\nδ : Type ?u.889175\nm : MeasurableSpace α\nμ ν : Measure α\nf : α →ₛ ℝ≥0∞\ns : Set α\nhs : MeasurableSet s\n⊢ lintegral (restrict f s) μ = lintegral f (Measure.restrict μ s)",
"tactic": "rw [f.restrict_li... | [
1087,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1085,
1
] |
Mathlib/Algebra/BigOperators/Multiset/Basic.lean | Multiset.le_prod_of_mem | [
{
"state_after": "case intro\nι : Type ?u.137543\nα : Type u_1\nβ : Type ?u.137549\nγ : Type ?u.137552\ninst✝ : CanonicallyOrderedMonoid α\na : α\nm' : Multiset α\nh : a ∈ a ::ₘ m'\n⊢ a ≤ prod (a ::ₘ m')",
"state_before": "ι : Type ?u.137543\nα : Type u_1\nβ : Type ?u.137549\nγ : Type ?u.137552\ninst✝ : Can... | [
458,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
454,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Basic.lean | BoxIntegral.Prepartition.isPartitionDisjUnionOfEqDiff | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nI J J₁ J₂ : Box ι\nπ π₁ π₂ : Prepartition I\nx : ι → ℝ\nπi πi₁ πi₂ : (J : Box ι) → Prepartition J\nh : Prepartition.iUnion π₂ = ↑I \\ Prepartition.iUnion π₁\n⊢ Prepartition.iUnion π₁ ∪ Prepartition.iUnion π₂ = ↑I",
"tactic": "simp [h, π₁.iUnion... | [
791,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
789,
1
] |
Mathlib/Analysis/InnerProductSpace/Projection.lean | orthogonalProjection_tendsto_self | [
{
"state_after": "𝕜 : Type u_3\nE : Type u_1\nF : Type ?u.871455\ninst✝⁷ : IsROrC 𝕜\ninst✝⁶ : NormedAddCommGroup E\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : InnerProductSpace 𝕜 E\ninst✝³ : InnerProductSpace ℝ F\nK : Submodule 𝕜 E\ninst✝² : CompleteSpace E\nι : Type u_2\ninst✝¹ : SemilatticeSup ι\nU : ι → Sub... | [
921,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
913,
1
] |
Mathlib/Algebra/Category/GroupCat/EpiMono.lean | GroupCat.SurjectiveOfEpiAuxs.agree | [
{
"state_after": "case refine'_1\nA B : GroupCat\nf : A ⟶ B\nb : ↑B\n⊢ b ∈ (MonoidHom.range f).toSubmonoid.toSubsemigroup.carrier → b ∈ {x | ↑h x = ↑g x}\n\ncase refine'_2\nA B : GroupCat\nf : A ⟶ B\nb : ↑B\nhb : ↑h b = ↑g b\nr : ¬b ∈ (MonoidHom.range f).toSubmonoid.toSubsemigroup.carrier\n⊢ False",
"state_... | [
317,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
294,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.span_univ | [] | [
232,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
231,
1
] |
Mathlib/SetTheory/ZFC/Basic.lean | ZFSet.eval_mk | [] | [
707,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
705,
1
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineIsometry.nndist_map | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_5\nV : Type u_2\nV₁ : Type ?u.47368\nV₂ : Type u_3\nV₃ : Type ?u.47374\nV₄ : Type ?u.47377\nP₁ : Type ?u.47380\nP : Type u_4\nP₂ : Type u_1\nP₃ : Type ?u.47389\nP₄ : Type ?u.47392\ninst✝²⁰ : NormedField 𝕜\ninst✝¹⁹ : SeminormedAddCommGroup V\ninst✝¹⁸... | [
151,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | derivWithin_cos | [] | [
814,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
812,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.Nat.card_coe_set_eq | [
{
"state_after": "case h.e'_2\nα : Type u_1\nβ : Type ?u.47787\ns✝ t : Set α\na b x y : α\nf : α → β\ns : Set α\n⊢ Nat.card ↑s = ncard univ\n\ncase h.e'_3\nα : Type u_1\nβ : Type ?u.47787\ns✝ t : Set α\na b x y : α\nf : α → β\ns : Set α\n⊢ ncard s = ncard ((fun a => ↑a) '' univ)\n\ncase convert_1\nα : Type u_1\... | [
301,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
298,
9
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.neg_apply | [] | [
315,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/RingTheory/Subring/Basic.lean | RingHom.eq_of_eqOn_set_dense | [] | [
1246,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1244,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/WideEqualizers.lean | CategoryTheory.Limits.Trident.ι_eq_app_zero | [] | [
213,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Data/Multiset/Powerset.lean | Multiset.revzip_powersetAux_perm | [
{
"state_after": "α : Type u_1\nl₁ l₂ : List α\np : l₁ ~ l₂\nthis : DecidableEq α\n⊢ revzip (powersetAux l₁) ~ revzip (powersetAux l₂)",
"state_before": "α : Type u_1\nl₁ l₂ : List α\np : l₁ ~ l₂\n⊢ revzip (powersetAux l₁) ~ revzip (powersetAux l₂)",
"tactic": "haveI := Classical.decEq α"
},
{
"... | [
168,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/Order/Antichain.lean | Set.Subsingleton.isWeakAntichain | [] | [
394,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
393,
1
] |
Mathlib/Analysis/Calculus/Inverse.lean | ApproximatesLinearOn.to_inv | [
{
"state_after": "𝕜 : 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.404204\ninst✝⁴ : NormedAddCommGroup G\ninst✝³ : NormedSpace 𝕜 G\nG' : Type ?u.404307\... | [
443,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
422,
1
] |
Mathlib/Algebra/Module/Equiv.lean | LinearEquiv.restrictScalars_inj | [] | [
636,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
634,
1
] |
Mathlib/Computability/Partrec.lean | Computable.snd | [] | [
309,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
308,
1
] |
Mathlib/Order/CompleteLattice.lean | iInf_neg | [] | [
1096,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1095,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.