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/Combinatorics/Young/YoungDiagram.lean | YoungDiagram.rowLen_eq_card | [
{
"state_after": "no goals",
"state_before": "μ : YoungDiagram\ni : ℕ\n⊢ rowLen μ i = Finset.card (row μ i)",
"tactic": "simp [row_eq_prod]"
}
] | [
326,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
325,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | NormedCommGroup.nhds_one_basis_norm_lt | [
{
"state_after": "case h.e'_5.h.h.e'_2.h.h.e'_3.h.e'_3\n𝓕 : Type ?u.129849\n𝕜 : Type ?u.129852\nα : Type ?u.129855\nι : Type ?u.129858\nκ : Type ?u.129861\nE : Type u_1\nF : Type ?u.129867\nG : Type ?u.129870\ninst✝² : SeminormedGroup E\ninst✝¹ : SeminormedGroup F\ninst✝ : SeminormedGroup G\ns : Set E\na a₁ a... | [
774,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
771,
1
] |
Mathlib/Algebra/Star/Pointwise.lean | Set.star_mem_star | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ns t : Set α\na : α\ninst✝ : InvolutiveStar α\n⊢ a⋆ ∈ s⋆ ↔ a ∈ s",
"tactic": "simp only [mem_star, star_star]"
}
] | [
65,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/RingTheory/Localization/Integral.lean | IsFractionRing.isAlgebraic_iff' | [
{
"state_after": "R : Type u_2\ninst✝¹³ : CommRing R\nM : Submonoid R\nS : Type u_3\ninst✝¹² : CommRing S\ninst✝¹¹ : Algebra R S\nP : Type ?u.599719\ninst✝¹⁰ : CommRing P\nA : Type ?u.599725\nK : Type u_1\ninst✝⁹ : CommRing A\ninst✝⁸ : IsDomain A\ninst✝⁷ : Field K\ninst✝⁶ : IsDomain R\ninst✝⁵ : IsDomain S\ninst... | [
428,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
389,
1
] |
Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean | LocalHomeomorph.extend_symm_continuousWithinAt_comp_right_iff | [
{
"state_after": "𝕜 : Type u_4\nE : Type u_3\nM : Type u_2\nH : Type u_5\nE' : Type ?u.146554\nM' : Type ?u.146557\nH' : Type ?u.146560\ninst✝⁹ : NontriviallyNormedField 𝕜\ninst✝⁸ : NormedAddCommGroup E\ninst✝⁷ : NormedSpace 𝕜 E\ninst✝⁶ : TopologicalSpace H\ninst✝⁵ : TopologicalSpace M\nf f' : LocalHomeomorp... | [
874,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
870,
1
] |
Mathlib/Algebra/Homology/Single.lean | HomologicalComplex.single_map_f_self | [
{
"state_after": "no goals",
"state_before": "V : Type u\ninst✝³ : Category V\ninst✝² : HasZeroMorphisms V\ninst✝¹ : HasZeroObject V\nι : Type u_1\ninst✝ : DecidableEq ι\nc : ComplexShape ι\nj : ι\nA B : V\nf : A ⟶ B\n⊢ Hom.f ((single V c j).map f) j = (singleObjXSelf V c j A).hom ≫ f ≫ (singleObjXSelf V c ... | [
88,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/Topology/Sheaves/Presheaf.lean | TopCat.Presheaf.pushforward_eq'_hom_app | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝ : Category C\nX Y : TopCat\nf g : X ⟶ Y\nh : f = g\nℱ : Presheaf C X\nU : (Opens ↑Y)ᵒᵖ\n⊢ (Functor.op (Opens.map f)).obj U = (Functor.op (Opens.map g)).obj U",
"tactic": "rw [h]"
},
{
"state_after": "no goals",
"state_before": "... | [
181,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
179,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Icc_prod_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\ninst✝¹ : Preorder α\ninst✝ : Preorder β\na b : α × β\n⊢ Icc a b = Icc a.fst b.fst ×ˢ Icc a.snd b.snd",
"tactic": "simp"
}
] | [
1905,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1905,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.adj_and_reachable_delete_edges_iff_exists_cycle | [
{
"state_after": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nv w : V\n⊢ (Adj G v w ∧ ∃ p, ¬Quotient.mk (Sym2.Rel.setoid V) (v, w) ∈ Walk.edges p) ↔\n ∃ u p, Walk.IsCycle p ∧ Quotient.mk (Sym2.Rel.setoid V) (v, w) ∈ Walk.edges p",
"state_before": ... | [
2521,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2499,
1
] |
Mathlib/Data/Sym/Sym2.lean | Sym2.rel_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.1901\nγ : Type ?u.1904\nx y z w : α\n⊢ Rel α (x, y) (z, w) ↔ x = z ∧ y = w ∨ x = w ∧ y = z",
"tactic": "aesop (rule_sets [Sym2])"
}
] | [
94,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/Data/Nat/Digits.lean | Nat.modEq_digits_sum | [
{
"state_after": "n✝ b b' : ℕ\nh : b' % b = 1\nn : ℕ\n⊢ n ≡ ofDigits 1 (digits b' n) [MOD b]",
"state_before": "n✝ b b' : ℕ\nh : b' % b = 1\nn : ℕ\n⊢ n ≡ List.sum (digits b' n) [MOD b]",
"tactic": "rw [← ofDigits_one]"
},
{
"state_after": "case h.e'_3.h.e'_3\nn✝ b b' : ℕ\nh : b' % b = 1\nn : ℕ\n... | [
548,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
541,
1
] |
Mathlib/RingTheory/Adjoin/FG.lean | is_noetherian_subring_closure | [] | [
217,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Order/CompactlyGenerated.lean | CompleteLattice.wellFounded_iff_isSupFiniteCompact | [] | [
281,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
Mathlib/Data/Polynomial/Mirror.lean | Polynomial.coeff_mirror | [
{
"state_after": "case pos\nR : Type u_1\ninst✝ : Semiring R\np q : R[X]\nn : ℕ\nh2 : natDegree p < n\n⊢ coeff (mirror p) n = coeff p (↑(revAt (natDegree p + natTrailingDegree p)) n)\n\ncase neg\nR : Type u_1\ninst✝ : Semiring R\np q : R[X]\nn : ℕ\nh2 : ¬natDegree p < n\n⊢ coeff (mirror p) n = coeff p (↑(revAt ... | [
100,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Std/Data/RBMap/WF.lean | Std.RBNode.Ordered.setRed | [
{
"state_after": "α : Type u_1\ncmp : α → α → Ordering\nt : RBNode α\n⊢ Ordered cmp\n (match t with\n | node c a v b => node red a v b\n | nil => nil) ↔\n Ordered cmp t",
"state_before": "α : Type u_1\ncmp : α → α → Ordering\nt : RBNode α\n⊢ Ordered cmp (setRed t) ↔ Ordered cmp t",
"ta... | [
233,
42
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
232,
11
] |
Mathlib/SetTheory/Ordinal/Exponential.lean | Ordinal.add_log_le_log_mul | [
{
"state_after": "case pos\nx y b : Ordinal\nhx : x ≠ 0\nhy : y ≠ 0\nhb : 1 < b\n⊢ log b x + log b y ≤ log b (x * y)\n\ncase neg\nx y b : Ordinal\nhx : x ≠ 0\nhy : y ≠ 0\nhb : ¬1 < b\n⊢ log b x + log b y ≤ log b (x * y)",
"state_before": "x y b : Ordinal\nhx : x ≠ 0\nhy : y ≠ 0\n⊢ log b x + log b y ≤ log b ... | [
449,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
443,
1
] |
Mathlib/GroupTheory/Subsemigroup/Basic.lean | MulHom.eq_of_eqOn_dense | [] | [
499,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
497,
1
] |
Mathlib/Order/OrdContinuous.lean | OrderIso.leftOrdContinuous | [] | [
278,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
275,
11
] |
Mathlib/LinearAlgebra/BilinearForm.lean | BilinForm.mem_selfAdjointSubmodule | [] | [
1149,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1147,
1
] |
Mathlib/LinearAlgebra/ProjectiveSpace/Basic.lean | Projectivization.mk''_submodule | [] | [
188,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | fderiv_add | [] | [
174,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | LinearIsometryEquiv.trans_assoc | [] | [
859,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
857,
1
] |
Mathlib/Algebra/Associated.lean | Associated.of_mul_right | [
{
"state_after": "α : Type u_1\nβ : Type ?u.231684\nγ : Type ?u.231687\nδ : Type ?u.231690\ninst✝ : CancelCommMonoidWithZero α\na b c d : α\n⊢ b * a ~ᵤ d * c → b ~ᵤ d → b ≠ 0 → a ~ᵤ c",
"state_before": "α : Type u_1\nβ : Type ?u.231684\nγ : Type ?u.231687\nδ : Type ?u.231690\ninst✝ : CancelCommMonoidWithZer... | [
667,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
665,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.coe_adj_sub | [] | [
144,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Std/Data/Rat/Lemmas.lean | Rat.mkRat_mul_left | [
{
"state_after": "no goals",
"state_before": "n : Int\nd a : Nat\na0 : a ≠ 0\n⊢ mkRat (↑a * n) (a * d) = mkRat n d",
"tactic": "if d0 : d = 0 then simp [d0] else\nrw [← normalize_eq_mkRat d0, ← normalize_mul_left d0 a0, normalize_eq_mkRat]"
},
{
"state_after": "no goals",
"state_before": "n ... | [
107,
79
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
105,
1
] |
src/lean/Init/Control/Lawful.lean | ExceptT.seqRight_eq | [
{
"state_after": "m : Type u_1 → Type u_2\nε α β : Type u_1\ninst✝¹ : Monad m\ninst✝ : LawfulMonad m\nx : ExceptT ε m α\ny : ExceptT ε m β\n⊢ (do\n let _ ← x\n y) =\n do\n let f ← const α id <$> x\n f <$> y",
"state_before": "m : Type u_1 → Type u_2\nε α β : Type u_1\ninst✝¹ : Monad m\nin... | [
161,
28
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
155,
11
] |
Mathlib/MeasureTheory/Integral/SetIntegral.lean | MeasureTheory.set_integral_le_nonneg | [
{
"state_after": "α : Type u_1\nβ : Type ?u.293768\nE : Type ?u.293771\nF : Type ?u.293774\ninst✝ : MeasurableSpace α\nμ : Measure α\nf : α → ℝ\ns✝ s : Set α\nhs : MeasurableSet s\nhf : StronglyMeasurable f\nhfi : Integrable f\n⊢ (∫ (x : α), indicator s (fun x => f x) x ∂μ) ≤ ∫ (x : α), indicator {a | 0 ≤ f a} ... | [
751,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
744,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.isBigOWith_top | [
{
"state_after": "α : Type u_1\nβ : Type ?u.284830\nE : Type u_2\nF : Type u_3\nG : Type ?u.284839\nE' : Type ?u.284842\nF' : Type ?u.284845\nG' : Type ?u.284848\nE'' : Type ?u.284851\nF'' : Type ?u.284854\nG'' : Type ?u.284857\nR : Type ?u.284860\nR' : Type ?u.284863\n𝕜 : Type ?u.284866\n𝕜' : Type ?u.284869\... | [
1274,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1274,
1
] |
Mathlib/Topology/PartitionOfUnity.lean | BumpCovering.toPartitionOfUnity_eq_mul_prod | [] | [
464,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
461,
1
] |
Mathlib/Data/List/Indexes.lean | List.mapIdxM_eq_mmap_enum | [
{
"state_after": "no goals",
"state_before": "α✝ : Type u\nβ✝ : Type v\nm : Type u → Type v\ninst✝¹ : Monad m\ninst✝ : LawfulMonad m\nα : Type u_1\nβ : Type u\nf : ℕ → α → m β\nas : List α\n⊢ mapIdxM as f = List.traverse (uncurry f) (enum as)",
"tactic": "simp only [mapIdxM, mapIdxMGo_eq_mapIdxMAuxSpec,... | [
336,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
333,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.cof_ne_zero | [] | [
497,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
496,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.vector_get | [
{
"state_after": "α : Type u_1\nβ : Type ?u.364270\nγ : Type ?u.364273\nσ : Type ?u.364276\ninst✝³ : Primcodable α\ninst✝² : Primcodable β\ninst✝¹ : Primcodable γ\ninst✝ : Primcodable σ\nn : ℕ\na : Vector α n × Fin n\n⊢ List.get? (Vector.toList a.fst) ↑a.snd =\n List.get? (Vector.toList a.fst) ↑(↑(Fin.cast (... | [
1312,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1308,
1
] |
Mathlib/Data/List/Basic.lean | List.indexOf_cons_eq | [
{
"state_after": "ι : Type ?u.77884\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\ninst✝ : DecidableEq α\na b : α\nl : List α\nx✝ : a = b\ne : a = b := x✝\n⊢ indexOf b (b :: l) = 0",
"state_before": "ι : Type ?u.77884\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\ninst✝ :... | [
1168,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1167,
1
] |
Mathlib/Analysis/Convex/Between.lean | Wbtw.map | [
{
"state_after": "R : Type u_1\nV : Type u_2\nV' : Type u_4\nP : Type u_3\nP' : Type u_5\ninst✝⁶ : OrderedRing R\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P'\nx y z : P\nh : Wbtw R x y z\nf : P →ᵃ[R] P'\n⊢ ↑f y ∈ ↑... | [
158,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/Topology/ContinuousOn.lean | continuousOn_congr | [] | [
839,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
837,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | Submodule.toSubalgebra_mk | [
{
"state_after": "R : Type ?u.480281\nA : Type ?u.480284\ninst✝² : CommSemiring R\ninst✝¹ : Semiring A\ninst✝ : Algebra R A\np s : Submodule R A\nh1 : 1 ∈ s\nhmul : ∀ (x y : A), x ∈ s → y ∈ s → x * y ∈ s\nr : R\n⊢ ↑(algebraMap R A) r ∈\n { toSubmonoid := { toSubsemigroup := { carrier := ↑s, mul_mem' := hmul ... | [
577,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
573,
1
] |
Mathlib/Data/Num/Lemmas.lean | ZNum.cast_bitm1 | [
{
"state_after": "α : Type u_1\ninst✝ : AddGroupWithOne α\nn : ZNum\n⊢ ↑(ZNum.bitm1 (- -n)) = _root_.bit0 ↑n - 1",
"state_before": "α : Type u_1\ninst✝ : AddGroupWithOne α\nn : ZNum\n⊢ ↑(ZNum.bitm1 n) = _root_.bit0 ↑n - 1",
"tactic": "conv =>\n lhs\n rw [← zneg_zneg n]"
},
{
"state_after": "α ... | [
1161,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1155,
1
] |
Mathlib/Topology/Algebra/Order/LeftRightLim.lean | Antitone.continuousAt_iff_leftLim_eq_rightLim | [] | [
370,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
369,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.filter_True | [
{
"state_after": "case a\nα : Type u_1\nβ : Type ?u.320628\nγ : Type ?u.320631\np q : α → Prop\ninst✝¹ : DecidablePred p\ninst✝ : DecidablePred q\ns : Finset α\na✝ : α\n⊢ a✝ ∈ filter (fun x => True) s ↔ a✝ ∈ s",
"state_before": "α : Type u_1\nβ : Type ?u.320628\nγ : Type ?u.320631\np q : α → Prop\ninst✝¹ : ... | [
2682,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2681,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.map_congr | [] | [
1513,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1512,
1
] |
Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean | MeasureTheory.ProbabilityMeasure.coe_toWeakDualBCNN | [] | [
239,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Cardinal.le_range_of_union_finset_eq_top | [
{
"state_after": "α✝ : Type ?u.149865\nr : α✝ → α✝ → Prop\nα : Type u_1\nβ : Type u_2\ninst✝ : Infinite β\nf : α → Finset β\nw : (⋃ (a : α), ↑(f a)) = ⊤\nk : Infinite ↑(range f)\n⊢ (#β) ≤ (#↑(range f))",
"state_before": "α✝ : Type ?u.149865\nr : α✝ → α✝ → Prop\nα : Type u_1\nβ : Type u_2\ninst✝ : Infinite β... | [
1058,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1041,
1
] |
Mathlib/Analysis/NormedSpace/Multilinear.lean | ContinuousMultilinearMap.le_op_norm | [
{
"state_after": "𝕜 : 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 (E i)\nins... | [
349,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
337,
1
] |
Mathlib/Topology/Instances/Real.lean | Int.tendsto_zmultiplesHom_cofinite | [
{
"state_after": "case h.e'_3\nα : Type u\nβ : Type v\nγ : Type w\na : ℝ\nha : a ≠ 0\n⊢ ↑(↑(zmultiplesHom ℝ) a) = (fun x => x * a) ∘ Int.cast",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\na : ℝ\nha : a ≠ 0\n⊢ Tendsto (↑(↑(zmultiplesHom ℝ) a)) cofinite (cocompact ℝ)",
"tactic": "convert (tendsto... | [
246,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
242,
1
] |
Mathlib/Algebra/Polynomial/BigOperators.lean | Polynomial.natDegree_prod_of_monic | [
{
"state_after": "no goals",
"state_before": "R : Type u\nι : Type w\ns : Finset ι\ninst✝ : CommSemiring R\nf : ι → R[X]\nt : Multiset R[X]\nh : ∀ (i : ι), i ∈ s → Monic (f i)\n⊢ natDegree (∏ i in s, f i) = ∑ i in s, natDegree (f i)",
"tactic": "simpa using natDegree_multiset_prod_of_monic (s.1.map f) (... | [
211,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Asymptotics.lean | Asymptotics.IsBigO.rpow | [] | [
232,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
1
] |
Mathlib/Analysis/SpecialFunctions/Integrals.lean | integral_cos | [
{
"state_after": "case hderiv\na b : ℝ\nn : ℕ\n⊢ deriv sin = fun x => cos x\n\ncase hdiff\na b : ℝ\nn : ℕ\n⊢ ∀ (x : ℝ), x ∈ [[a, b]] → DifferentiableAt ℝ sin x\n\ncase hcont\na b : ℝ\nn : ℕ\n⊢ ContinuousOn (fun x => cos x) [[a, b]]",
"state_before": "a b : ℝ\nn : ℕ\n⊢ (∫ (x : ℝ) in a..b, cos x) = sin b - si... | [
514,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
510,
1
] |
Mathlib/RingTheory/Subsemiring/Basic.lean | Subsemiring.toAddSubmonoid_injective | [] | [
252,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
250,
1
] |
Mathlib/MeasureTheory/MeasurableSpaceDef.lean | MeasurableSpace.generateFrom_measurableSet | [] | [
402,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
400,
1
] |
Mathlib/Algebra/Order/Ring/Defs.lean | add_le_mul | [] | [
878,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
876,
1
] |
Mathlib/Analysis/NormedSpace/ContinuousLinearMap.lean | ContinuousLinearMap.toSpanSingleton_smul | [] | [
263,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
1
] |
Mathlib/CategoryTheory/Functor/Category.lean | CategoryTheory.NatTrans.app_naturality | [] | [
85,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
83,
1
] |
Mathlib/Deprecated/Subgroup.lean | isSubgroup_iUnion_of_directed | [] | [
131,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Std/Data/Array/Lemmas.lean | Array.getElem?_eq_data_get? | [
{
"state_after": "case pos\nα : Type u_1\na : Array α\ni : Nat\nh✝¹ h✝ : i < size a\n⊢ List.get a.data { val := i, isLt := (_ : i < size a) } = a[i]",
"state_before": "α : Type u_1\na : Array α\ni : Nat\n⊢ a[i]? = List.get? a.data i",
"tactic": "by_cases i < a.size <;> simp_all [getElem?_pos, getElem?_n... | [
57,
96
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
56,
1
] |
Mathlib/Algebra/AlgebraicCard.lean | Algebraic.cardinal_mk_lift_of_infinite | [] | [
71,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
67,
1
] |
Std/Data/String/Lemmas.lean | String.firstDiffPos_eq | [
{
"state_after": "no goals",
"state_before": "a b : String\n⊢ firstDiffPos a b = { byteIdx := utf8Len (List.takeWhile₂ (fun x x_1 => decide (x = x_1)) a.data b.data).fst }",
"tactic": "simpa [firstDiffPos] using\n firstDiffPos_loop_eq [] [] a.1 b.1 ((utf8Len a.1).min (utf8Len b.1)) 0 rfl rfl (by simp)"... | [
385,
93
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
382,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.Subsequent.moveRight_mk_left | [
{
"state_after": "no goals",
"state_before": "xl : Type u_1\ni : xl\nxr : Type u_1\nxR : xr → PGame\nxL : xl → PGame\nj : RightMoves (xL i)\n⊢ Subsequent (PGame.moveRight (xL i) j) (mk xl xr xL xR)",
"tactic": "pgame_wf_tac"
}
] | [
309,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
307,
9
] |
Mathlib/Order/OmegaCompletePartialOrder.lean | OmegaCompletePartialOrder.ContinuousHom.map_continuous' | [
{
"state_after": "α : Type u\nα' : Type ?u.60176\nβ✝ : Type v\nβ' : Type ?u.60181\nγ✝ : Type ?u.60184\nφ : Type ?u.60187\ninst✝⁵ : OmegaCompletePartialOrder α\ninst✝⁴ : OmegaCompletePartialOrder β✝\ninst✝³ : OmegaCompletePartialOrder γ✝\ninst✝² : OmegaCompletePartialOrder φ\ninst✝¹ : OmegaCompletePartialOrder α... | [
664,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
662,
1
] |
Mathlib/Algebra/Hom/Group.lean | map_div | [] | [
443,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
442,
1
] |
Mathlib/Data/Set/Image.lean | Set.mem_image | [] | [
213,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Data/Set/Sigma.lean | Set.sigma_inter_sigma | [
{
"state_after": "case h.mk\nι : Type u_1\nι' : Type ?u.8988\nα : ι → Type u_2\nβ : ι → Type ?u.8998\ns s₁ s₂ : Set ι\nt t₁ t₂ : (i : ι) → Set (α i)\nu : Set ((i : ι) × α i)\nx✝ : (i : ι) × α i\ni j : ι\na : α i\nx : ι\ny : α x\n⊢ { fst := x, snd := y } ∈ Set.Sigma s₁ t₁ ∩ Set.Sigma s₂ t₂ ↔\n { fst := x, snd... | [
146,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/Data/Polynomial/RingDivision.lean | Polynomial.eq_of_monic_of_associated | [
{
"state_after": "case intro\nR : Type u\nS : Type v\nT : Type w\na b : R\nn : ℕ\ninst✝¹ : CommRing R\ninst✝ : IsDomain R\np q : R[X]\nhp : Monic p\nhq : Monic q\nu : R[X]ˣ\nhu : p * ↑u = q\n⊢ p = q",
"state_before": "R : Type u\nS : Type v\nT : Type w\na b : R\nn : ℕ\ninst✝¹ : CommRing R\ninst✝ : IsDomain ... | [
441,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
436,
1
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | LocalEquiv.transEquiv_eq_trans | [] | [
795,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
794,
1
] |
Std/Data/List/Lemmas.lean | List.filter_append | [
{
"state_after": "α : Type u_1\np : α → Bool\na : α\nl₁ l₂ : List α\n⊢ (match p a with\n | true => a :: filter p (l₁ ++ l₂)\n | false => filter p (l₁ ++ l₂)) =\n (match p a with\n | true => a :: filter p l₁\n | false => filter p l₁) ++\n filter p l₂",
"state_before": "α : Type u_1\np... | [
1117,
71
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1114,
9
] |
Mathlib/Topology/Constructions.lean | openEmbedding_sigma_map | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type ?u.553929\nδ : Type ?u.553932\nε : Type ?u.553935\nζ : Type ?u.553938\nι : Type u_1\nκ : Type u_2\nσ : ι → Type u_3\nτ : κ → Type u_4\ninst✝² : (i : ι) → TopologicalSpace (σ i)\ninst✝¹ : (k : κ) → TopologicalSpace (τ k)\ninst✝ : ... | [
1572,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1569,
1
] |
Mathlib/Data/Set/Basic.lean | Set.not_monotoneOn_not_antitoneOn_iff_exists_lt_lt | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\na b : α\ns s₁ s₂ t t₁ t₂ u : Set α\ninst✝¹ : LinearOrder α\ninst✝ : LinearOrder β\nf : α → β\n⊢ ¬MonotoneOn f s ∧ ¬AntitoneOn f s ↔ ∃ a x b x c x, a < b ∧ b < c ∧ (f a < f b ∧ f c < f b ∨ f b < f a ∧ f b < f c)",
... | [
2735,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2730,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Concrete.lean | Cycle.formPerm_apply_mem_eq_next | [
{
"state_after": "case h\nα : Type u_1\ninst✝ : DecidableEq α\ns s' : Cycle α\nx : α\na✝ : List α\nh : Nodup (Quot.mk Setoid.r a✝)\nhx : x ∈ Quot.mk Setoid.r a✝\n⊢ ↑(formPerm (Quot.mk Setoid.r a✝) h) x = next (Quot.mk Setoid.r a✝) h x hx",
"state_before": "α : Type u_1\ninst✝ : DecidableEq α\ns✝ s' s : Cycl... | [
186,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | contDiffOn_of_locally_contDiffOn | [
{
"state_after": "𝕜 : Type u\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\nX : Type uX\ninst✝¹ : NormedAdd... | [
731,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
726,
1
] |
Mathlib/Data/MvPolynomial/Rename.lean | MvPolynomial.renameEquiv_refl | [] | [
168,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/ModelTheory/LanguageMap.lean | FirstOrder.Language.LHom.comp_id | [
{
"state_after": "case mk\nL : Language\nL' : Language\nM : Type w\ninst✝ : Structure L M\nϕ : L →ᴸ L'\nL'' : Language\nonFunction✝ : ⦃n : ℕ⦄ → Functions L n → Functions L' n\nonRelation✝ : ⦃n : ℕ⦄ → Relations L n → Relations L' n\n⊢ { onFunction := onFunction✝, onRelation := onRelation✝ } ∘' LHom.id L =\n {... | [
165,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
1
] |
Mathlib/Algebra/Order/Ring/Lemmas.lean | Right.neg_of_mul_neg_right | [] | [
596,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
595,
1
] |
Mathlib/Algebra/BigOperators/Finsupp.lean | Finsupp.single_sum | [] | [
292,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
290,
1
] |
Mathlib/Topology/Instances/EReal.lean | EReal.continuousAt_add_top_top | [
{
"state_after": "α : Type ?u.21891\ninst✝ : TopologicalSpace α\n⊢ ∀ (x : ℝ), ∀ᶠ (a : EReal × EReal) in 𝓝 (⊤, ⊤), ↑x < a.fst + a.snd",
"state_before": "α : Type ?u.21891\ninst✝ : TopologicalSpace α\n⊢ ContinuousAt (fun p => p.fst + p.snd) (⊤, ⊤)",
"tactic": "simp only [ContinuousAt, tendsto_nhds_top_if... | [
202,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/GroupTheory/Sylow.lean | Sylow.coe_comapOfInjective | [] | [
127,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/Analysis/InnerProductSpace/Adjoint.lean | Submodule.adjoint_orthogonalProjection | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.878200\nG : Type ?u.878203\ninst✝¹⁰ : IsROrC 𝕜\ninst✝⁹ : NormedAddCommGroup E\ninst✝⁸ : NormedAddCommGroup F\ninst✝⁷ : NormedAddCommGroup G\ninst✝⁶ : InnerProductSpace 𝕜 E\ninst✝⁵ : InnerProductSpace 𝕜 F\ninst✝⁴ : Inne... | [
201,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
199,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean | CategoryTheory.Limits.coprod.associator_naturality | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝² : Category C\nX Y : C\ninst✝¹ : Category C\ninst✝ : HasBinaryCoproducts C\nX₁ X₂ X₃ Y₁ Y₂ Y₃ : C\nf₁ : X₁ ⟶ Y₁\nf₂ : X₂ ⟶ Y₂\nf₃ : X₃ ⟶ Y₃\n⊢ map (map f₁ f₂) f₃ ≫ (associator Y₁ Y₂ Y₃).hom = (associator X₁ X₂ X₃).hom ≫ map f₁ (map f₂ f₃)",
... | [
1155,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1151,
1
] |
Mathlib/CategoryTheory/Limits/ConcreteCategory.lean | CategoryTheory.Limits.Concrete.colimit_rep_eq_of_exists | [] | [
238,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/Logic/Encodable/Basic.lean | Encodable.encode_nat | [] | [
129,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/Topology/Algebra/Order/LiminfLimsup.lean | Filter.Tendsto.bddAbove_range | [] | [
55,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Data/Num/Lemmas.lean | PosNum.lt_iff_cmp | [] | [
826,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
825,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.inf_le_iff | [] | [
724,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
723,
11
] |
Std/Data/String/Lemmas.lean | String.posOf_eq | [] | [
315,
60
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
315,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.mod_mod | [] | [
1100,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1099,
1
] |
Mathlib/Combinatorics/SimpleGraph/Density.lean | SimpleGraph.interedges_biUnion_left | [] | [
363,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/Order/WithBot.lean | WithBot.ne_bot_iff_exists | [] | [
169,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/LinearAlgebra/FreeModule/Rank.lean | rank_tensorProduct' | [
{
"state_after": "no goals",
"state_before": "R : Type u\nM : Type v\nN✝ : Type w\ninst✝¹⁰ : CommRing R\ninst✝⁹ : StrongRankCondition R\ninst✝⁸ : AddCommGroup M\ninst✝⁷ : Module R M\ninst✝⁶ : Module.Free R M\ninst✝⁵ : AddCommGroup N✝\ninst✝⁴ : Module R N✝\ninst✝³ : Module.Free R N✝\nN : Type v\ninst✝² : Add... | [
125,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/LinearAlgebra/Matrix/Symmetric.lean | Matrix.isSymm_diagonal | [] | [
129,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.ne_insert_of_not_mem | [
{
"state_after": "α : Type u_1\nβ : Type ?u.112192\nγ : Type ?u.112195\ninst✝ : DecidableEq α\ns✝ t✝ u v : Finset α\na✝ b : α\ns t : Finset α\na : α\nh : s = insert a t\n⊢ a ∈ s",
"state_before": "α : Type u_1\nβ : Type ?u.112192\nγ : Type ?u.112195\ninst✝ : DecidableEq α\ns✝ t✝ u v : Finset α\na✝ b : α\ns ... | [
1157,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1155,
1
] |
Mathlib/RingTheory/Subring/Basic.lean | RingEquiv.ofLeftInverse_symm_apply | [] | [
1333,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1331,
1
] |
Mathlib/LinearAlgebra/Matrix/Charpoly/Minpoly.lean | LinearMap.minpoly_toMatrix | [] | [
73,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/Algebra/Hom/Equiv/Basic.lean | MulEquiv.map_one | [] | [
538,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
537,
11
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | ContDiffAt.contDiffWithinAt | [] | [
1331,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1330,
1
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | LocalEquiv.symm_source | [] | [
321,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
320,
1
] |
Mathlib/Topology/Algebra/GroupWithZero.lean | Continuous.div_const | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.5613\nG₀ : Type u_2\ninst✝³ : DivInvMonoid G₀\ninst✝² : TopologicalSpace G₀\ninst✝¹ : ContinuousMul G₀\nf : α → G₀\ns : Set α\nl : Filter α\ninst✝ : TopologicalSpace α\nhf : Continuous f\ny : G₀\n⊢ Continuous fun x => f x / y",
"tac... | [
79,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
78,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.lsub_lt_ord | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.29527\nr : α → α → Prop\nι : Type u\nf : ι → Ordinal\nc : Ordinal\nhι : (#ι) < cof c\n⊢ Cardinal.lift (#ι) < cof c",
"tactic": "rwa [(#ι).lift_id]"
}
] | [
340,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/Algebra/Hom/Group.lean | MulHom.coe_copy | [] | [
843,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
841,
1
] |
Mathlib/Control/Basic.lean | Functor.map_map | [] | [
28,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
27,
1
] |
Mathlib/Algebra/Order/Ring/Lemmas.lean | mul_lt_of_mul_lt_of_nonneg_right | [] | [
263,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
1
] |
Std/Data/List/Lemmas.lean | List.isSuffix.eq_of_length | [] | [
1657,
25
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1656,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.toDual_inf' | [] | [
1064,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1062,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.