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/RingTheory/Polynomial/Pochhammer.lean | pochhammer_eval_succ | [
{
"state_after": "no goals",
"state_before": "S : Type u_1\ninst✝ : Semiring S\nr✝ n✝ r n : ℕ\n⊢ ↑n * eval (↑n + 1) (pochhammer S r) = (↑n + ↑r) * eval (↑n) (pochhammer S r)",
"tactic": "exact_mod_cast congr_arg Nat.cast (pochhammer_nat_eval_succ r n)"
}
] | [
212,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
210,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | differentiableWithinAt_add_const_iff | [
{
"state_after": "no goals",
"state_before": "𝕜 : 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.199798\ninst✝³ : NormedAddCommGroup G\ninst✝² : Normed... | [
205,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/Order/UpperLower/Basic.lean | UpperSet.upper | [] | [
436,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
435,
11
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.coeff_mul_one_sub_of_lt_order | [
{
"state_after": "no goals",
"state_before": "R✝ : Type ?u.4217836\ninst✝¹ : Semiring R✝\nφ✝ : PowerSeries R✝\nR : Type u_1\ninst✝ : CommRing R\nφ ψ : PowerSeries R\nn : ℕ\nh : ↑n < order ψ\n⊢ ↑(coeff R n) (φ * (1 - ψ)) = ↑(coeff R n) φ",
"tactic": "simp [coeff_mul_of_lt_order h, mul_sub]"
}
] | [
2426,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2424,
1
] |
Mathlib/Analysis/InnerProductSpace/Calculus.lean | contDiffOn_euclidean | [
{
"state_after": "𝕜 : Type u_1\nι : Type u_3\nH : Type u_2\ninst✝³ : IsROrC 𝕜\ninst✝² : NormedAddCommGroup H\ninst✝¹ : NormedSpace 𝕜 H\ninst✝ : Fintype ι\nf : H → EuclideanSpace 𝕜 ι\nf' : H →L[𝕜] EuclideanSpace 𝕜 ι\nt : Set H\ny : H\nn : ℕ∞\n⊢ (∀ (i : ι), ContDiffOn 𝕜 n (fun x => (↑(EuclideanSpace.equiv ... | [
351,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
348,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.tendsto_Ici_atTop | [
{
"state_after": "ι : Type ?u.335766\nι' : Type ?u.335769\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.335778\ninst✝ : SemilatticeSup α\na : α\nf : β → ↑(Ici a)\nl : Filter β\n⊢ Tendsto (Subtype.val ∘ f) l atTop ↔ Tendsto (fun x => ↑(f x)) l atTop",
"state_before": "ι : Type ?u.335766\nι' : Type ?u.335769\nα : ... | [
1607,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1605,
1
] |
Mathlib/Data/Real/Irrational.lean | Irrational.of_nat_sub | [] | [
324,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/MeasureTheory/Decomposition/Lebesgue.lean | MeasureTheory.Measure.eq_rnDeriv | [
{
"state_after": "α : Type u_1\nβ : Type ?u.60618\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝ : SigmaFinite ν\ns : Measure α\nf : α → ℝ≥0∞\nhf : Measurable f\nhs : s ⟂ₘ ν\nhadd : μ = s + withDensity ν f\n⊢ ∀ (s : Set α), MeasurableSet s → ↑↑ν s < ⊤ → (∫⁻ (x : α) in s, f x ∂ν) = ∫⁻ (x : α) in s, rnDeriv μ ν x... | [
368,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.InfinitePos.neg | [] | [
459,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
458,
1
] |
Mathlib/RingTheory/AdjoinRoot.lean | AdjoinRoot.quotAdjoinRootEquivQuotPolynomialQuot_symm_mk_mk | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nK : Type w\ninst✝ : CommRing R\nI : Ideal R\nf p : R[X]\n⊢ ↑(RingEquiv.symm (quotAdjoinRootEquivQuotPolynomialQuot I f))\n (↑(Ideal.Quotient.mk (span {Polynomial.map (Ideal.Quotient.mk I) f})) (Polynomial.map (Ideal.Quotient.mk I) p)... | [
845,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
835,
1
] |
Mathlib/NumberTheory/Padics/PadicNorm.lean | padicNorm.nat_eq_one_iff | [
{
"state_after": "no goals",
"state_before": "p : ℕ\nhp : Fact (Nat.Prime p)\nm : ℕ\n⊢ padicNorm p ↑m = 1 ↔ ¬p ∣ m",
"tactic": "rw [← Int.coe_nat_dvd, ← int_eq_one_iff, Int.cast_ofNat]"
}
] | [
308,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
307,
1
] |
Mathlib/Data/Real/EReal.lean | EReal.top_mul_top | [] | [
894,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
894,
9
] |
Mathlib/Order/Filter/Prod.lean | Filter.coprod_neBot_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.60908\nδ : Type ?u.60911\nι : Sort ?u.60914\nf : Filter α\ng : Filter β\n⊢ NeBot (Filter.coprod f g) ↔ NeBot f ∧ Nonempty β ∨ Nonempty α ∧ NeBot g",
"tactic": "simp [Filter.coprod]"
}
] | [
504,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
503,
1
] |
Mathlib/Data/Real/Basic.lean | Real.fact_zero_lt_one | [] | [
409,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
408,
11
] |
Mathlib/Algebra/Order/Sub/Canonical.lean | add_tsub_eq_max | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝² : CanonicallyLinearOrderedAddMonoid α\ninst✝¹ : Sub α\ninst✝ : OrderedSub α\na b c d : α\n⊢ a + (b - a) = max a b",
"tactic": "rw [add_comm, max_comm, tsub_add_eq_max]"
}
] | [
501,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
501,
1
] |
Mathlib/Order/Lattice.lean | inf_le_sup | [] | [
675,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
674,
1
] |
Mathlib/Algebra/Support.lean | Function.mulSupport_iInf | [] | [
197,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
1
] |
Mathlib/Init/Data/Nat/Lemmas.lean | Nat.bit0_lt_bit1 | [] | [
186,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
185,
11
] |
Mathlib/RingTheory/AlgebraicIndependent.lean | AlgebraicIndependent.coe_range | [
{
"state_after": "no goals",
"state_before": "ι : Type u_3\nι' : Type ?u.208082\nR : Type u_2\nK : Type ?u.208088\nA : Type u_1\nA' : Type ?u.208094\nA'' : Type ?u.208097\nV : Type u\nV' : Type ?u.208102\nx : ι → A\ninst✝⁶ : CommRing R\ninst✝⁵ : CommRing A\ninst✝⁴ : CommRing A'\ninst✝³ : CommRing A''\ninst✝... | [
142,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/RingTheory/Subring/Basic.lean | RingHom.closure_preimage_le | [] | [
1250,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1249,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.mem_principal_self | [] | [
298,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
298,
1
] |
Mathlib/NumberTheory/LucasLehmer.lean | LucasLehmer.X.card_units_lt | [
{
"state_after": "q : ℕ+\nw : 1 < q\nthis : Fact (1 < ↑q)\n⊢ Fintype.card (X q)ˣ < ↑q ^ 2",
"state_before": "q : ℕ+\nw : 1 < q\n⊢ Fintype.card (X q)ˣ < ↑q ^ 2",
"tactic": "have : Fact (1 < (q : ℕ)) := ⟨w⟩"
},
{
"state_after": "case h.e'_4\nq : ℕ+\nw : 1 < q\nthis : Fact (1 < ↑q)\n⊢ ↑q ^ 2 = Fint... | [
354,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
351,
8
] |
Mathlib/Analysis/Convex/Side.lean | AffineSubspace.wOppSide_vadd_left_iff | [
{
"state_after": "case mp\nR : Type u_1\nV : Type u_2\nV' : Type ?u.142748\nP : Type u_3\nP' : Type ?u.142754\ninst✝⁶ : StrictOrderedCommRing R\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P'\ns : AffineSubspace R P\n... | [
312,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
303,
1
] |
Mathlib/Algebra/Order/Hom/Monoid.lean | OrderMonoidHom.coe_comp | [] | [
417,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
416,
1
] |
Mathlib/CategoryTheory/Sites/CompatiblePlus.lean | CategoryTheory.GrothendieckTopology.ι_plusCompIso_hom | [
{
"state_after": "C : Type u\ninst✝⁸ : Category C\nJ : GrothendieckTopology C\nD : Type w₁\ninst✝⁷ : Category D\nE : Type w₂\ninst✝⁶ : Category E\nF : D ⥤ E\ninst✝⁵ : ∀ (α β : Type (max v u)) (fst snd : β → α), HasLimitsOfShape (WalkingMulticospan fst snd) D\ninst✝⁴ : ∀ (α β : Type (max v u)) (fst snd : β → α),... | [
131,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Mathlib/Data/Fin/VecNotation.lean | Matrix.cons_vecAlt0 | [
{
"state_after": "no goals",
"state_before": "α : Type u\nm n o : ℕ\nm' : Type ?u.50198\nn' : Type ?u.50201\no' : Type ?u.50204\nh : m + 1 + 1 = n + 1 + (n + 1)\nx y : α\nu : Fin m → α\n⊢ m = n + n",
"tactic": "rwa [add_assoc n, add_comm 1, ← add_assoc, ← add_assoc, add_right_cancel_iff,\n add_right_ca... | [
397,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
385,
1
] |
Mathlib/Algebra/Homology/Exact.lean | CategoryTheory.Preadditive.exact_iff_exact_of_iso | [
{
"state_after": "V : Type u\ninst✝⁵ : Category V\ninst✝⁴ : HasImages V\ninst✝³ : HasZeroObject V\ninst✝² : Preadditive V\ninst✝¹ : HasKernels V\ninst✝ : HasCokernels V\nA₁ B₁ C₁ A₂ B₂ C₂ : V\nf₁ : A₁ ⟶ B₁\ng₁ : B₁ ⟶ C₁\nf₂ : A₂ ⟶ B₂\ng₂ : B₂ ⟶ C₂\nα : Arrow.mk f₁ ≅ Arrow.mk f₂\nβ : Arrow.mk g₁ ≅ Arrow.mk g₂\np... | [
132,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/Data/List/Perm.lean | List.perm_induction_on | [] | [
235,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/LinearAlgebra/Dimension.lean | Basis.nonempty_fintype_index_of_rank_lt_aleph0 | [
{
"state_after": "no goals",
"state_before": "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.413475\nR : Type u\ninst✝³ : Ring R\ninst✝² : StrongRankCondition R\nM : Type v\ninst✝¹ : AddCommGroup M\ninst✝ : Module R M\nι : Type u_1... | [
844,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
841,
1
] |
Mathlib/CategoryTheory/Limits/Preserves/Shapes/Equalizers.lean | CategoryTheory.Limits.PreservesCoequalizer.iso_hom | [] | [
189,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsBigO.prod_left_snd | [] | [
1017,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1016,
1
] |
Mathlib/Topology/Order/Basic.lean | nhdsWithin_Ioi_neBot' | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝³ : TopologicalSpace α\ninst✝² : LinearOrder α\ninst✝¹ : OrderTopology α\ninst✝ : DenselyOrdered α\na✝ b✝ : α\ns : Set α\na b : α\nH₁ : Set.Nonempty (Ioi a)\nH₂ : a ≤ b\n⊢ b ∈ closure (Ioi a)",
"tactic": "rwa [closure... | [
2384,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2382,
1
] |
Mathlib/LinearAlgebra/Matrix/Determinant.lean | Matrix.det_one | [
{
"state_after": "m : Type ?u.167139\nn : Type u_1\ninst✝⁴ : DecidableEq n\ninst✝³ : Fintype n\ninst✝² : DecidableEq m\ninst✝¹ : Fintype m\nR : Type v\ninst✝ : CommRing R\n⊢ det (diagonal fun x => 1) = 1",
"state_before": "m : Type ?u.167139\nn : Type u_1\ninst✝⁴ : DecidableEq n\ninst✝³ : Fintype n\ninst✝² ... | [
100,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Data/Matrix/Block.lean | Matrix.blockDiag_zero | [] | [
535,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
534,
1
] |
Mathlib/Algebra/Order/Ring/Canonical.lean | AddLECancellable.mul_tsub | [
{
"state_after": "no goals",
"state_before": "case inl\nα : Type u\nβ : Type ?u.23190\ninst✝³ : CanonicallyOrderedCommSemiring α\na b c : α\ninst✝² : Sub α\ninst✝¹ : OrderedSub α\ninst✝ : IsTotal α fun x x_1 => x ≤ x_1\nh : AddLECancellable (a * c)\nhbc : b ≤ c\n⊢ a * (b - c) = a * b - a * c",
"tactic":... | [
139,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
135,
11
] |
Mathlib/Topology/MetricSpace/Isometry.lean | isometry_subsingleton | [
{
"state_after": "ι : Type ?u.1994\nα : Type u\nβ : Type v\nγ : Type w\ninst✝³ : PseudoEMetricSpace α\ninst✝² : PseudoEMetricSpace β\ninst✝¹ : PseudoEMetricSpace γ\nf : α → β\nx✝ y✝ z : α\ns : Set α\ninst✝ : Subsingleton α\nx y : α\n⊢ edist (f y) (f y) = edist y y",
"state_before": "ι : Type ?u.1994\nα : Ty... | [
95,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/Data/Finsupp/NeLocus.lean | Finsupp.neLocus_neg | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nM : Type ?u.23059\nN : Type u_2\nP : Type ?u.23065\ninst✝² : DecidableEq α\ninst✝¹ : DecidableEq N\ninst✝ : AddGroup N\nf f₁ f₂ g g₁ g₂ : α →₀ N\n⊢ neLocus (-f) g = neLocus f (-g)",
"tactic": "rw [← neLocus_neg_neg, neg_neg]"
}
] | [
144,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.coe_compContinuous | [] | [
379,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean | HomogeneousLocalization.val_injective | [] | [
325,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
324,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.Memℒp.aestronglyMeasurable | [] | [
125,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.top_ne_one | [] | [
324,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
324,
9
] |
Mathlib/MeasureTheory/MeasurableSpaceDef.lean | MeasurableSet.union | [
{
"state_after": "α : Type u_1\nβ : Type ?u.8432\nγ : Type ?u.8435\nδ : Type ?u.8438\nδ' : Type ?u.8441\nι : Sort ?u.8444\ns t u : Set α\nm : MeasurableSpace α\ns₁ s₂ : Set α\nh₁ : MeasurableSet s₁\nh₂ : MeasurableSet s₂\n⊢ MeasurableSet (⋃ (b : Bool), bif b then s₁ else s₂)",
"state_before": "α : Type u_1\... | [
197,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
11
] |
Mathlib/Order/SymmDiff.lean | symmDiff_right_involutive | [] | [
514,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
513,
1
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | LocalEquiv.mem_symm_trans_source | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_3\nγ : Type u_2\nδ : Type ?u.49747\ne : LocalEquiv α β\ne'✝ : LocalEquiv β γ\ne' : LocalEquiv α γ\nx : α\nhe : x ∈ e.source\nhe' : x ∈ e'.source\n⊢ ↑e x ∈ ↑(LocalEquiv.symm (LocalEquiv.symm (LocalEquiv.symm e))) ⁻¹' e'.source",
"tact... | [
779,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
777,
1
] |
Mathlib/Algebra/Module/Submodule/Lattice.lean | Submodule.nonzero_mem_of_bot_lt | [] | [
111,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
1
] |
Mathlib/GroupTheory/Perm/Fin.lean | Fin.cycleRange_symm_succ | [
{
"state_after": "no goals",
"state_before": "n : ℕ\ni : Fin (n + 1)\nj : Fin n\n⊢ ↑(cycleRange i) (↑(cycleRange i).symm (succ j)) = ↑(cycleRange i) (↑(succAbove i) j)",
"tactic": "simp"
}
] | [
292,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
290,
1
] |
Mathlib/LinearAlgebra/Matrix/Circulant.lean | Matrix.map_circulant | [] | [
104,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/Order/Bounds/Basic.lean | Antitone.image_upperBounds_subset_lowerBounds_image | [] | [
1322,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1321,
1
] |
Mathlib/Data/Set/Finite.lean | Set.Finite.toFinset_ssubset_toFinset | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\nγ : Type x\ns t : Set α\na : α\nhs : Set.Finite s\nht : Set.Finite t\n⊢ Finite.toFinset hs ⊂ Finite.toFinset ht ↔ s ⊂ t",
"tactic": "simp only [← Finset.coe_ssubset, Finite.coe_toFinset]"
}
] | [
214,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
11
] |
Mathlib/FieldTheory/Finite/Polynomial.lean | MvPolynomial.expand_zmod | [] | [
47,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
46,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.blsub_pos | [] | [
1894,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1893,
1
] |
Std/Data/Int/Lemmas.lean | Int.sub_eq_zero_of_eq | [
{
"state_after": "no goals",
"state_before": "a b : Int\nh : a = b\n⊢ a - b = 0",
"tactic": "rw [h, Int.sub_self]"
}
] | [
350,
23
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
349,
11
] |
Mathlib/LinearAlgebra/Matrix/Orthogonal.lean | Matrix.HasOrthogonalRows.transpose_hasOrthogonalCols | [] | [
86,
4
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/ModelTheory/Satisfiability.lean | FirstOrder.Language.Theory.isSatisfiable_iff_isFinitelySatisfiable | [
{
"state_after": "no goals",
"state_before": "L : Language\nT✝ : Theory L\nα : Type w\nn : ℕ\nT' T : Theory L\nh : IsFinitelySatisfiable T\n⊢ IsSatisfiable T",
"tactic": "classical\n set M : Finset T → Type max u v := fun T0 : Finset T =>\n (h (T0.map (Function.Embedding.subtype fun x => x ∈ T)) T0.... | [
129,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/Analysis/SpecialFunctions/Bernstein.lean | bernsteinApproximation.δ_pos | [] | [
185,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/CategoryTheory/Limits/HasLimits.lean | CategoryTheory.Limits.limit.cone_π | [] | [
168,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/Analysis/Calculus/Deriv/Mul.lean | HasDerivWithinAt.div_const | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u\ninst✝⁶ : NontriviallyNormedField 𝕜\nF : Type v\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nE : Type w\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedSpace 𝕜 E\nf f₀ f₁ g : 𝕜 → F\nf' f₀' f₁' g' : F\nx : 𝕜\ns t : Set 𝕜\nL L₁ L₂ : F... | [
300,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
298,
1
] |
Mathlib/Order/ModularLattice.lean | covby_sup_of_inf_covby_right | [
{
"state_after": "α : Type u_1\ninst✝¹ : Lattice α\ninst✝ : IsUpperModularLattice α\na b : α\n⊢ b ⊓ a ⋖ b → a ⋖ b ⊔ a",
"state_before": "α : Type u_1\ninst✝¹ : Lattice α\ninst✝ : IsUpperModularLattice α\na b : α\n⊢ a ⊓ b ⋖ b → a ⋖ a ⊔ b",
"tactic": "rw [sup_comm, inf_comm]"
},
{
"state_after": "... | [
155,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/Data/PNat/Basic.lean | Nat.succPNat_lt_succPNat | [] | [
90,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Std/Data/Rat/Lemmas.lean | Rat.inv_def | [
{
"state_after": "a : Rat\n⊢ (if h : a.num < 0 then mk' (-↑a.den) (Int.natAbs a.num)\n else if h : a.num > 0 then mk' (↑a.den) (Int.natAbs a.num) else a) =\n ↑a.den /. a.num",
"state_before": "a : Rat\n⊢ Rat.inv a = ↑a.den /. a.num",
"tactic": "unfold Rat.inv"
},
{
"state_after": "case inl... | [
293,
63
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
285,
1
] |
Mathlib/Data/Set/Enumerate.lean | Set.enumerate_mem | [
{
"state_after": "case none\nα : Type u_1\nsel : Set α → Option α\nh_sel : ∀ (s : Set α) (a : α), sel s = some a → a ∈ s\ns : Set α\nn : ℕ\na : α\nh : sel s = none\n⊢ enumerate sel s (n + 1) = some a → a ∈ s\n\ncase some\nα : Type u_1\nsel : Set α → Option α\nh_sel : ∀ (s : Set α) (a : α), sel s = some a → a ∈ ... | [
73,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Combinatorics/SimpleGraph/StronglyRegular.lean | SimpleGraph.IsSRGWith.card_neighborFinset_union_of_adj | [
{
"state_after": "V : Type u\ninst✝² : Fintype V\ninst✝¹ : DecidableEq V\nG : SimpleGraph V\ninst✝ : DecidableRel G.Adj\nn k ℓ μ : ℕ\nv w : V\nh : IsSRGWith G n k ℓ μ\nha : Adj G v w\n⊢ Finset.card (neighborFinset G v ∪ neighborFinset G w) = 2 * k - Fintype.card ↑(commonNeighbors G v w)",
"state_before": "V... | [
113,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/Order/Directed.lean | exists_lt_of_directed_le | [] | [
308,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
306,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.fract_add_floor | [] | [
817,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
816,
1
] |
Std/Data/Nat/Gcd.lean | Nat.gcd_pos_of_pos_left | [] | [
92,
44
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
91,
1
] |
Mathlib/GroupTheory/Nilpotent.lean | upperCentralSeries_one | [
{
"state_after": "case h\nG : Type u_1\ninst✝¹ : Group G\nH : Subgroup G\ninst✝ : Normal H\nx✝ : G\n⊢ x✝ ∈ upperCentralSeries G 1 ↔ x✝ ∈ center G",
"state_before": "G : Type u_1\ninst✝¹ : Group G\nH : Subgroup G\ninst✝ : Normal H\n⊢ upperCentralSeries G 1 = center G",
"tactic": "ext"
},
{
"state... | [
158,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Algebra/DirectSum/Module.lean | DirectSum.toModule.unique | [] | [
131,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.tendsto_atBot_of_monotone_of_filter | [] | [
1727,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1725,
1
] |
Mathlib/Tactic/Positivity/Basic.lean | Mathlib.Meta.Positivity.mul_nonneg_of_nonneg_of_pos | [] | [
118,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
116,
9
] |
Mathlib/Order/Monotone/Basic.lean | Monotone.ne_of_lt_of_lt_int | [
{
"state_after": "ι : Type ?u.45732\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.45741\nπ : ι → Type ?u.45746\nr : α → α → Prop\ninst✝ : Preorder α\nf : ℤ → α\nhf : Monotone f\nn a : ℤ\nh1 : f n < f a\nh2 : f a < f (n + 1)\n⊢ False",
"state_before": "ι : Type ?u.45732\nα : Type u\nβ : Type v\nγ : Type w... | [
1120,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1117,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | nndist_le_pi_nndist | [
{
"state_after": "α : Type u\nβ : Type v\nX : Type ?u.397955\nι : Type ?u.397958\ninst✝² : PseudoMetricSpace α\nπ : β → Type u_1\ninst✝¹ : Fintype β\ninst✝ : (b : β) → PseudoMetricSpace (π b)\nf g : (b : β) → π b\nb : β\n⊢ edist (f b) (g b) ≤ edist f g",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.... | [
2040,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2038,
1
] |
Mathlib/Topology/ContinuousFunction/Algebra.lean | ContinuousMap.div_apply | [] | [
210,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/Data/Num/Lemmas.lean | Num.lt_to_nat | [
{
"state_after": "α : Type ?u.232833\nm n : Num\nh : ↑m < ↑n\n⊢ ↑m < ↑n ↔ Ordering.lt = Ordering.lt",
"state_before": "α : Type ?u.232833\nm n : Num\nh : Ordering.casesOn Ordering.lt (↑m < ↑n) (m = n) (↑n < ↑m)\n⊢ ↑m < ↑n ↔ Ordering.lt = Ordering.lt",
"tactic": "simp at h"
},
{
"state_after": "n... | [
339,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
334,
1
] |
Mathlib/SetTheory/Ordinal/Basic.lean | Ordinal.typein_one_out | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.187136\nβ : Type ?u.187139\nγ : Type ?u.187142\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nx : (Quotient.out 1).α\n⊢ typein (fun x x_1 => x < x_1) x = 0",
"tactic": "rw [one_out_eq x, typein_enum]"
}
] | [
1136,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1134,
1
] |
Mathlib/Algebra/Order/LatticeGroup.lean | LatticeOrderedCommGroup.pos_eq_self_of_one_lt_pos | [
{
"state_after": "α✝ : Type u\ninst✝³ : Lattice α✝\ninst✝² : CommGroup α✝\nα : Type u_1\ninst✝¹ : LinearOrder α\ninst✝ : CommGroup α\nx : α\nhx : 1 < x\n⊢ x⁺ = x",
"state_before": "α✝ : Type u\ninst✝³ : Lattice α✝\ninst✝² : CommGroup α✝\nα : Type u_1\ninst✝¹ : LinearOrder α\ninst✝ : CommGroup α\nx : α\nhx :... | [
478,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
474,
1
] |
Mathlib/Data/List/Basic.lean | List.map₂Right_nil_right | [] | [
4141,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
4140,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | indicator_ae_eq_of_restrict_compl_ae_eq_zero | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.4814398\nδ : Type ?u.4814401\nι : Type ?u.4814404\nR : Type ?u.4814407\nR' : Type ?u.4814410\ninst✝¹ : MeasurableSpace α\nμ : MeasureTheory.Measure α\ns t : Set α\nf : α → β\ninst✝ : Zero β\nhs : MeasurableSet s\nhf : ∀ᵐ (x : α) ∂μ, x ∈ sᶜ → f x = OfNat.... | [
4678,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
4672,
1
] |
Mathlib/Data/Real/NNReal.lean | Mathlib.Meta.Positivity.nnreal_coe_pos | [] | [
1090,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1089,
9
] |
Mathlib/RingTheory/Polynomial/Cyclotomic/Basic.lean | Polynomial.cyclotomic'_two | [
{
"state_after": "R✝ : Type ?u.35090\ninst✝⁴ : CommRing R✝\ninst✝³ : IsDomain R✝\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : IsDomain R\np : ℕ\ninst✝ : CharP R p\nhp : p ≠ 2\n⊢ ∏ μ in primitiveRoots 2 R, (X - ↑C μ) = X + 1",
"state_before": "R✝ : Type ?u.35090\ninst✝⁴ : CommRing R✝\ninst✝³ : IsDomain R✝\nR... | [
96,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/Data/Set/Basic.lean | Set.subset_empty_iff | [] | [
577,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
576,
1
] |
Mathlib/Data/Finset/NoncommProd.lean | Multiset.noncommProd_eq_pow_card | [
{
"state_after": "case h\nF : Type ?u.111005\nι : Type ?u.111008\nα : Type u_1\nβ : Type ?u.111014\nγ : Type ?u.111017\nf : α → β → β\nop : α → α → α\ninst✝¹ : Monoid α\ninst✝ : Monoid β\nm : α\na✝ : List α\ncomm : Set.Pairwise {x | x ∈ Quotient.mk (List.isSetoid α) a✝} Commute\nh : ∀ (x : α), x ∈ Quotient.mk (... | [
203,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
199,
1
] |
Mathlib/Data/List/Basic.lean | List.modifyLast_append | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.319860\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁✝ l₂✝ : List α\nf : α → α\nl₁ l₂ : List α\nx✝ : l₂ ≠ []\n⊢ modifyLast f (l₁ ++ l₂) = l₁ ++ modifyLast f l₂",
"tactic": "cases l₂ with\n| nil => contradiction\n| cons hd tl =>\n cases tl w... | [
3070,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3059,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.update_eq_erase | [
{
"state_after": "case h\nι : Type u\nγ : Type w\nβ : ι → Type v\nβ₁ : ι → Type v₁\nβ₂ : ι → Type v₂\ndec : DecidableEq ι\ninst✝ : (i : ι) → Zero (β i)\ns : Finset ι\nx : (i : ↑↑s) → β ↑i\ni : ι\nf : Π₀ (i : ι), β i\nb : β i\nj✝ j : ι\n⊢ ↑(update i f 0) j = ↑(erase i f) j",
"state_before": "ι : Type u\nγ : ... | [
846,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
842,
1
] |
Mathlib/Algebra/Module/Submodule/Basic.lean | Submodule.restrictScalars_mem | [] | [
446,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
445,
1
] |
Mathlib/Data/Option/Basic.lean | Option.seq_some | [] | [
266,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
265,
1
] |
Mathlib/ModelTheory/Syntax.lean | FirstOrder.Language.Term.constantsVarsEquivLeft_apply | [] | [
232,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/Topology/ContinuousOn.lean | continuous_if | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.380506\nδ : Type ?u.380509\ninst✝⁴ : TopologicalSpace α\ninst✝³ : TopologicalSpace β\ninst✝² : TopologicalSpace γ\ninst✝¹ : TopologicalSpace δ\np : α → Prop\nf g : α → β\ninst✝ : (a : α) → Decidable (p a)\nhp : ∀ (a : α), a ∈ frontier {x | p x} → f a = g... | [
1182,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1177,
1
] |
Mathlib/LinearAlgebra/Prod.lean | LinearMap.sup_range_inl_inr | [] | [
461,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
460,
1
] |
Mathlib/Geometry/Manifold/LocalInvariantProperties.lean | StructureGroupoid.LocalInvariantProp.liftPropAt_of_mem_maximalAtlas | [
{
"state_after": "H : Type u_1\nM : Type u_2\nH' : Type ?u.53706\nM' : Type ?u.53709\nX : Type ?u.53712\ninst✝⁷ : TopologicalSpace H\ninst✝⁶ : TopologicalSpace M\ninst✝⁵ : ChartedSpace H M\ninst✝⁴ : TopologicalSpace H'\ninst✝³ : TopologicalSpace M'\ninst✝² : ChartedSpace H' M'\ninst✝¹ : TopologicalSpace X\nG : ... | [
483,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
479,
1
] |
Mathlib/Logic/Basic.lean | BEx.imp_right | [] | [
1051,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1050,
1
] |
Mathlib/Data/Nat/GCD/Basic.lean | Nat.not_coprime_zero_zero | [
{
"state_after": "no goals",
"state_before": "⊢ ¬coprime 0 0",
"tactic": "simp"
}
] | [
206,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
206,
1
] |
Mathlib/GroupTheory/FreeAbelianGroupFinsupp.lean | FreeAbelianGroup.support_zsmul | [
{
"state_after": "case a\nX : Type u_1\nk : ℤ\nh : k ≠ 0\na : FreeAbelianGroup X\nx : X\n⊢ x ∈ support (k • a) ↔ x ∈ support a",
"state_before": "X : Type u_1\nk : ℤ\nh : k ≠ 0\na : FreeAbelianGroup X\n⊢ support (k • a) = support a",
"tactic": "ext x"
},
{
"state_after": "case a\nX : Type u_1\nk... | [
186,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Data/Set/Function.lean | Set.bijOn_empty | [] | [
924,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
923,
1
] |
Mathlib/AlgebraicTopology/DoldKan/Projections.lean | AlgebraicTopology.DoldKan.P_f_0_eq | [
{
"state_after": "case zero\nC : Type u_2\ninst✝¹ : Category C\ninst✝ : Preadditive C\nX : SimplicialObject C\n⊢ HomologicalComplex.Hom.f (P Nat.zero) 0 = 𝟙 (HomologicalComplex.X K[X] 0)\n\ncase succ\nC : Type u_2\ninst✝¹ : Category C\ninst✝ : Preadditive C\nX : SimplicialObject C\nq : ℕ\nhq : HomologicalCompl... | [
67,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean | MeasureTheory.ProbabilityMeasure.val_eq_to_measure | [] | [
135,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.iInf_biUnion | [] | [
1993,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1991,
1
] |
Mathlib/Order/PrimeIdeal.lean | Order.Ideal.IsPrime.mem_compl_of_not_mem | [] | [
185,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Data/Finset/Pointwise.lean | IsUnit.finset | [] | [
960,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
959,
11
] |
Mathlib/Order/WithBot.lean | WithTop.wellFounded_lt | [] | [
1262,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1249,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.eventually_forall_ge_atTop | [
{
"state_after": "ι : Type ?u.17904\nι' : Type ?u.17907\nα : Type u_1\nβ : Type ?u.17913\nγ : Type ?u.17916\ninst✝ : Preorder α\np : α → Prop\nh : ∀ᶠ (x : α) in atTop, p x\n⊢ ∀ᶠ (x : α) in atTop, ∀ (y : α), x ≤ y → p y",
"state_before": "ι : Type ?u.17904\nι' : Type ?u.17907\nα : Type u_1\nβ : Type ?u.17913... | [
250,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
244,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.