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/LinearAlgebra/Prod.lean | LinearMap.coprod_zero_left | [] | [
240,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
239,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.FinMeasAdditive.smul_measure_iff | [] | [
144,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Mathlib/Computability/Halting.lean | Nat.Partrec'.tail | [
{
"state_after": "n : ℕ\nf : Vector ℕ n →. ℕ\nhf : Partrec' f\nv : Vector ℕ (succ n)\n⊢ f (ofFn fun i => Vector.get v (Fin.succ i)) = f (Vector.tail v)",
"state_before": "n : ℕ\nf : Vector ℕ n →. ℕ\nhf : Partrec' f\nv : Vector ℕ (succ n)\n⊢ (mOfFn fun i => (↑fun v => Vector.get v (Fin.succ i)) v) >>= f = f ... | [
323,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
321,
1
] |
Mathlib/Analysis/InnerProductSpace/Orthogonal.lean | Submodule.inf_orthogonal | [] | [
176,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
175,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | HasFDerivWithinAt.cosh | [] | [
1067,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1065,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.Prime.not_dvd_mul | [
{
"state_after": "no goals",
"state_before": "p m n : ℕ\npp : Prime p\nHm : ¬p ∣ m\nHn : ¬p ∣ n\n⊢ ¬(p ∣ m ∨ p ∣ n)",
"tactic": "simp [Hm, Hn]"
}
] | [
570,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
569,
1
] |
Mathlib/Topology/MetricSpace/EMetricSpace.lean | edist_congr_right | [
{
"state_after": "case a\nα : Type u\nβ : Type v\nX : Type ?u.5599\ninst✝ : PseudoEMetricSpace α\nx y z : α\nh : edist x y = 0\n⊢ edist x z ≤ edist y z\n\ncase a\nα : Type u\nβ : Type v\nX : Type ?u.5599\ninst✝ : PseudoEMetricSpace α\nx y z : α\nh : edist x y = 0\n⊢ edist y z ≤ edist x z",
"state_before": "... | [
114,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/Data/PFunctor/Univariate/M.lean | PFunctor.M.ichildren_mk | [
{
"state_after": "F : PFunctor\nX : Type ?u.26833\nf : X → Obj F X\ninst✝¹ : DecidableEq F.A\ninst✝ : Inhabited (M F)\nx : Obj F (M F)\ni : IdxCat F\n⊢ (if H' : i.fst = head (M.mk x) then children (M.mk x) (cast (_ : B F i.fst = B F (head (M.mk x))) i.snd)\n else default) =\n if h : i.fst = x.fst then Sig... | [
555,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
552,
1
] |
Mathlib/CategoryTheory/Simple.lean | CategoryTheory.epi_from_simple_zero_of_not_iso | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝³ : Category C\ninst✝² : Abelian C\nX Y : C\ninst✝¹ : Simple X\nf : X ⟶ Y\ninst✝ : Epi f\nw : IsIso f → False\n⊢ f = 0",
"tactic": "classical\n by_contra h\n exact w (isIso_of_epi_of_nonzero h)"
},
{
"state_after": "C : Type u\nins... | [
186,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Algebra/Ring/Idempotents.lean | IsIdempotentElem.one | [] | [
65,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/Topology/Connected.lean | Continuous.connectedComponentsMap_continuous | [] | [
1562,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1560,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Icc_erase_left | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.72862\nα : Type u_1\ninst✝² : PartialOrder α\ninst✝¹ : LocallyFiniteOrder α\na✝ b✝ c : α\ninst✝ : DecidableEq α\na b : α\n⊢ erase (Icc a b) a = Ioc a b",
"tactic": "simp [← coe_inj]"
}
] | [
545,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
545,
1
] |
Mathlib/Init/Propext.lean | imp_congr_eq | [] | [
20,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
19,
1
] |
Mathlib/Order/FixedPoints.lean | OrderHom.le_gfp | [] | [
115,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/Order/Monotone/Basic.lean | Monotone.imp | [] | [
364,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
363,
1
] |
Mathlib/Algebra/Algebra/Basic.lean | algebraMap.coe_pow | [] | [
169,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.cycleFactorsFinset_eq_empty_iff | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.2748424\nα : Type u_1\nβ : Type ?u.2748430\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf✝ f : Perm α\n⊢ cycleFactorsFinset f = ∅ ↔ f = 1",
"tactic": "simpa [cycleFactorsFinset_eq_finset] using eq_comm"
}
] | [
1443,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1442,
1
] |
Mathlib/Algebra/Order/Pointwise.lean | csSup_one | [] | [
115,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/Topology/Algebra/Group/Basic.lean | subset_interior_mul_right | [] | [
1267,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1266,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | Algebra.surjective_algebraMap_iff | [] | [
952,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
946,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | LinearMap.isUnit_iff_range_eq_top | [
{
"state_after": "no goals",
"state_before": "K : Type u\nV : Type v\ninst✝³ : DivisionRing K\ninst✝² : AddCommGroup V\ninst✝¹ : Module K V\ninst✝ : FiniteDimensional K V\nf : V →ₗ[K] V\n⊢ IsUnit f ↔ range f = ⊤",
"tactic": "rw [isUnit_iff_ker_eq_bot, ker_eq_bot_iff_range_eq_top]"
}
] | [
1016,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1014,
1
] |
Mathlib/LinearAlgebra/SesquilinearForm.lean | LinearMap.ortho_smul_left | [
{
"state_after": "R : Type ?u.36929\nR₁ : Type ?u.36932\nR₂ : Type ?u.36935\nR₃ : Type ?u.36938\nM : Type ?u.36941\nM₁ : Type ?u.36944\nM₂ : Type ?u.36947\nMₗ₁ : Type ?u.36950\nMₗ₁' : Type ?u.36953\nMₗ₂ : Type ?u.36956\nMₗ₂' : Type ?u.36959\nK : Type u_2\nK₁ : Type u_1\nK₂ : Type u_5\nV : Type ?u.36971\nV₁ : Ty... | [
124,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Analysis/NormedSpace/Pointwise.lean | exists_dist_lt_le | [
{
"state_after": "case intro.intro\n𝕜 : Type ?u.212520\nE : Type u_1\ninst✝³ : NormedField 𝕜\ninst✝² : SeminormedAddCommGroup E\ninst✝¹ : NormedSpace 𝕜 E\ninst✝ : NormedSpace ℝ E\nx y✝ z : E\nδ ε : ℝ\nhδ : 0 < δ\nhε : 0 ≤ ε\nh : dist x z < ε + δ\ny : E\nyz : dist z y ≤ ε\nxy : dist y x < δ\n⊢ ∃ y, dist x y <... | [
195,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
191,
1
] |
Mathlib/Data/Set/Pointwise/Interval.lean | Set.preimage_sub_const_Ici | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : OrderedAddCommGroup α\na b c : α\n⊢ (fun x => x - a) ⁻¹' Ici b = Ici (b + a)",
"tactic": "simp [sub_eq_add_neg]"
}
] | [
177,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/ZeroMorphisms.lean | CategoryTheory.Limits.comp_factorThruImage_eq_zero | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝³ : Category C\nD : Type u'\ninst✝² : Category D\ninst✝¹ : HasZeroMorphisms C\nX Y Z : C\nf : X ⟶ Y\ng : Y ⟶ Z\ninst✝ : HasImage g\nh : f ≫ g = 0\n⊢ (f ≫ factorThruImage g) ≫ image.ι g = 0",
"tactic": "simp [h]"
}
] | [
576,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
574,
1
] |
Mathlib/Topology/ContinuousFunction/Weierstrass.lean | polynomialFunctions_closure_eq_top | [
{
"state_after": "case pos\na b : ℝ\nh : a < b\n⊢ Subalgebra.topologicalClosure (polynomialFunctions (Set.Icc a b)) = ⊤\n\ncase neg\na b : ℝ\nh : ¬a < b\n⊢ Subalgebra.topologicalClosure (polynomialFunctions (Set.Icc a b)) = ⊤",
"state_before": "a b : ℝ\n⊢ Subalgebra.topologicalClosure (polynomialFunctions (... | [
86,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/Algebra/Homology/HomologicalComplex.lean | CochainComplex.of_d | [
{
"state_after": "ι : Type ?u.215700\nV : Type u\ninst✝⁴ : Category V\ninst✝³ : HasZeroMorphisms V\nα : Type u_1\ninst✝² : AddRightCancelSemigroup α\ninst✝¹ : One α\ninst✝ : DecidableEq α\nX : α → V\nd : (n : α) → X n ⟶ X (n + 1)\nsq : ∀ (n : α), d n ≫ d (n + 1) = 0\nj : α\n⊢ (if j + 1 = j + 1 then d j ≫ 𝟙 (X ... | [
907,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
905,
1
] |
Mathlib/Data/Nat/Parity.lean | Nat.bit1_div_two | [
{
"state_after": "no goals",
"state_before": "m n : ℕ\n⊢ bit1 n / 2 = n",
"tactic": "rw [← Nat.bit1_eq_bit1, bit1, bit0_eq_two_mul, Nat.two_mul_div_two_add_one_of_odd (odd_bit1 n)]"
}
] | [
250,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
249,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.lintegral_trim_ae | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.1823472\nγ : Type ?u.1823475\nδ : Type ?u.1823478\nm m0 : MeasurableSpace α\nμ : Measure α\nhm : m ≤ m0\nf : α → ℝ≥0∞\nhf : AEMeasurable f\n⊢ (∫⁻ (a : α), f a ∂Measure.trim μ hm) = ∫⁻ (a : α), f a ∂μ",
"tactic": "rw [lintegral_congr... | [
1945,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1942,
1
] |
Mathlib/Topology/Algebra/Module/StrongTopology.lean | ContinuousLinearMap.strongTopology.topologicalAddGroup | [
{
"state_after": "𝕜₁ : Type u_3\n𝕜₂ : Type u_4\ninst✝¹³ : NormedField 𝕜₁\ninst✝¹² : NormedField 𝕜₂\nσ : 𝕜₁ →+* 𝕜₂\nE : Type u_2\nE' : Type ?u.40995\nF : Type u_1\nF' : Type ?u.41001\ninst✝¹¹ : AddCommGroup E\ninst✝¹⁰ : Module 𝕜₁ E\ninst✝⁹ : AddCommGroup E'\ninst✝⁸ : Module ℝ E'\ninst✝⁷ : AddCommGroup F\n... | [
128,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/CategoryTheory/Bicategory/Free.lean | CategoryTheory.FreeBicategory.mk_left_unitor_hom | [] | [
290,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
289,
1
] |
Mathlib/RingTheory/Subsemiring/Basic.lean | RingHom.rangeS_top_of_surjective | [] | [
1188,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1186,
1
] |
Mathlib/Analysis/Convex/Join.lean | convexJoin_assoc | [
{
"state_after": "ι : Sort ?u.66107\n𝕜 : Type u_2\nE : Type u_1\ninst✝² : LinearOrderedField 𝕜\ninst✝¹ : AddCommGroup E\ninst✝ : Module 𝕜 E\ns✝ t✝ u✝ : Set E\nx y : E\ns t u : Set E\n⊢ convexJoin 𝕜 s (convexJoin 𝕜 t u) ⊆ convexJoin 𝕜 (convexJoin 𝕜 s t) u",
"state_before": "ι : Sort ?u.66107\n𝕜 : Typ... | [
161,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/Data/Nat/Bitwise.lean | Nat.lor'_assoc | [
{
"state_after": "no goals",
"state_before": "n m k : ℕ\n⊢ lor' (lor' n m) k = lor' n (lor' m k)",
"tactic": "bitwise_assoc_tac"
}
] | [
234,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
234,
1
] |
Mathlib/ModelTheory/Substructures.lean | FirstOrder.Language.Substructure.comap_iInf_map_of_injective | [] | [
585,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
583,
1
] |
Mathlib/Algebra/Group/Opposite.lean | MulOpposite.op_div | [
{
"state_after": "no goals",
"state_before": "α : Type u\ninst✝ : DivInvMonoid α\nx y : α\n⊢ op (x / y) = (op y)⁻¹ * op x",
"tactic": "simp [div_eq_mul_inv]"
}
] | [
212,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Topology/FiberBundle/Basic.lean | FiberBundleCore.localTrivAsLocalEquiv_symm | [] | [
676,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
674,
1
] |
Mathlib/Topology/Separation.lean | Bornology.relativelyCompact.isBounded_iff | [
{
"state_after": "α : Type u\nβ : Type v\ninst✝¹ : TopologicalSpace α\ninst✝ : T1Space α\ns : Set α\n⊢ sᶜ ∈ coclosedCompact α ↔ IsCompact (closure s)",
"state_before": "α : Type u\nβ : Type v\ninst✝¹ : TopologicalSpace α\ninst✝ : T1Space α\ns : Set α\n⊢ IsBounded s ↔ IsCompact (closure s)",
"tactic": "c... | [
451,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
442,
1
] |
Mathlib/Analysis/BoxIntegral/Basic.lean | BoxIntegral.integral_smul | [
{
"state_after": "case inl\nι : Type u\nE : Type v\nF : Type w\ninst✝⁴ : NormedAddCommGroup E\ninst✝³ : NormedSpace ℝ E\ninst✝² : NormedAddCommGroup F\ninst✝¹ : NormedSpace ℝ F\nI J : Box ι\nπ : TaggedPrepartition I\ninst✝ : Fintype ι\nl : IntegrationParams\nf g : (ι → ℝ) → E\nvol : ι →ᵇᵃ[⊤] E →L[ℝ] F\ny y' : F... | [
371,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
366,
1
] |
Mathlib/Data/Multiset/Fintype.lean | Multiset.toEmbedding_coeEquiv_trans | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : DecidableEq α\nm✝ m : Multiset α\n⊢ Function.Embedding.trans (Equiv.toEmbedding (coeEquiv m)) (Function.Embedding.subtype fun x => x ∈ toEnumFinset m) =\n coeEmbedding m",
"tactic": "ext <;> rfl"
}
] | [
192,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
191,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_insert_one | [] | [
341,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
340,
1
] |
Mathlib/CategoryTheory/Adjunction/Opposites.lean | CategoryTheory.Adjunction.leftAdjointUniq_hom_app_counit | [
{
"state_after": "C : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nF F' : C ⥤ D\nG : D ⥤ C\nadj1 : F ⊣ G\nadj2 : F' ⊣ G\nx : D\n⊢ (leftAdjointUniq adj1 adj2).hom.app (G.obj x) ≫ adj2.counit.app x =\n (whiskerLeft G (leftAdjointUniq adj1 adj2).hom ≫ adj2.counit).app x",
"state_before": "... | [
174,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | gcd_eq_right_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : CancelCommMonoidWithZero α\ninst✝ : NormalizedGCDMonoid α\na b : α\nh : ↑normalize b = b\n⊢ gcd a b = b ↔ b ∣ a",
"tactic": "simpa only [gcd_comm a b] using gcd_eq_left_iff b a h"
}
] | [
480,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
479,
1
] |
Mathlib/Data/Vector/Basic.lean | Vector.toList_map | [
{
"state_after": "case mk\nn : ℕ\nα : Type u_2\nβ : Type u_1\nf : α → β\nval✝ : List α\nproperty✝ : List.length val✝ = n\n⊢ toList (map f { val := val✝, property := property✝ }) = List.map f (toList { val := val✝, property := property✝ })",
"state_before": "n : ℕ\nα : Type u_2\nβ : Type u_1\nv : Vector α n\... | [
101,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Topology/FiberBundle/Trivialization.lean | Trivialization.apply_mk_symm | [] | [
627,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
625,
1
] |
Mathlib/LinearAlgebra/Determinant.lean | LinearMap.det_zero' | [
{
"state_after": "R : Type ?u.871535\ninst✝¹¹ : CommRing R\nM : Type u_3\ninst✝¹⁰ : AddCommGroup M\ninst✝⁹ : Module R M\nM' : Type ?u.872126\ninst✝⁸ : AddCommGroup M'\ninst✝⁷ : Module R M'\nι✝ : Type ?u.872668\ninst✝⁶ : DecidableEq ι✝\ninst✝⁵ : Fintype ι✝\ne : Basis ι✝ R M\nA : Type u_2\ninst✝⁴ : CommRing A\nin... | [
280,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | real_inner_self_eq_norm_sq | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.2330841\nE : Type ?u.2330844\nF : Type u_1\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nx : F\n⊢ inner x x = ‖x‖ ^ 2",
"... | [
1023,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1022,
1
] |
Mathlib/Data/Option/Basic.lean | Option.map_coe | [] | [
108,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.comp_equiv_dotProduct_comp_equiv | [
{
"state_after": "l : Type ?u.148579\nm : Type u_1\nn : Type u_2\no : Type ?u.148588\nm' : o → Type ?u.148593\nn' : o → Type ?u.148598\nR : Type ?u.148601\nS : Type ?u.148604\nα : Type v\nβ : Type w\nγ : Type ?u.148611\ninst✝² : Fintype m\ninst✝¹ : Fintype n\ninst✝ : NonUnitalNonAssocSemiring α\nu v w : m → α\n... | [
798,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
796,
1
] |
Mathlib/Analysis/Complex/Basic.lean | IsROrC.hasSum_conj' | [] | [
490,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
489,
1
] |
Mathlib/Algebra/CovariantAndContravariant.lean | Contravariant.flip | [] | [
144,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineSubspace.isometryEquivMap.toAffineMap_eq | [] | [
919,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
917,
1
] |
Mathlib/Data/Matrix/Block.lean | Matrix.blockDiag_apply | [] | [
509,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
507,
1
] |
Mathlib/Topology/LocalHomeomorph.lean | LocalHomeomorph.eventually_nhdsWithin' | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.34648\nδ : Type ?u.34651\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\ne✝ : LocalHomeomorph α β\ne' : LocalHomeomorph β γ\ne : LocalHomeomorph α β\nx : α\np : α → Prop\ns : Set α\nhx :... | [
421,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
414,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean | CategoryTheory.Limits.coprod.map_comp_id | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝³ : Category C\nX✝ Y✝ X Y Z W : C\nf : X ⟶ Y\ng : Y ⟶ Z\ninst✝² : HasBinaryCoproduct Z W\ninst✝¹ : HasBinaryCoproduct Y W\ninst✝ : HasBinaryCoproduct X W\n⊢ map (f ≫ g) (𝟙 W) = map f (𝟙 W) ≫ map g (𝟙 W)",
"tactic": "simp"
}
] | [
898,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
896,
1
] |
Mathlib/RingTheory/IntegralClosure.lean | RingHom.is_integral_one | [] | [
485,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
484,
1
] |
Mathlib/Logic/Equiv/Defs.lean | Equiv.eq_symm_comp | [] | [
598,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
597,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearEquiv.ker_comp | [] | [
2166,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2163,
1
] |
Mathlib/Algebra/Category/Ring/Instances.lean | IsLocalization.epi | [] | [
35,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
33,
1
] |
Mathlib/Topology/Sets/Compacts.lean | TopologicalSpace.Compacts.ext | [] | [
66,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
11
] |
Mathlib/Topology/UniformSpace/CompactConvergence.lean | ContinuousMap.compactConvNhd_compact_entourage_nonempty | [] | [
139,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/Data/Multiset/Range.lean | Multiset.range_subset | [] | [
48,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
47,
1
] |
Mathlib/Topology/ContinuousOn.lean | eventually_nhdsWithin_iff | [] | [
54,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
52,
1
] |
Mathlib/GroupTheory/Perm/Basic.lean | Equiv.Perm.inv_aux | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\np : α → Prop\nf : Perm α\n⊢ (∀ (x : α), p (↑f⁻¹ x) ↔ p (↑f (↑f⁻¹ x))) ↔ ∀ (x : α), p x ↔ p (↑f⁻¹ x)",
"tactic": "simp_rw [f.apply_inv_self, Iff.comm]"
}
] | [
386,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
385,
9
] |
Mathlib/MeasureTheory/Constructions/Prod/Integral.lean | MeasureTheory.integral_fn_integral_sub | [
{
"state_after": "α : Type u_1\nα' : Type ?u.2419590\nβ : Type u_2\nβ' : Type ?u.2419596\nγ : Type ?u.2419599\nE : Type u_3\ninst✝¹² : MeasurableSpace α\ninst✝¹¹ : MeasurableSpace α'\ninst✝¹⁰ : MeasurableSpace β\ninst✝⁹ : MeasurableSpace β'\ninst✝⁸ : MeasurableSpace γ\nμ μ' : Measure α\nν ν' : Measure β\nτ : Me... | [
375,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
369,
1
] |
Mathlib/Data/List/Rotate.lean | List.Nodup.cyclicPermutations | [
{
"state_after": "case nil\nα : Type u\nl l' : List α\nhn : Nodup []\n⊢ Nodup (List.cyclicPermutations [])\n\ncase cons\nα : Type u\nl✝ l' : List α\nx : α\nl : List α\nhn : Nodup (x :: l)\n⊢ Nodup (List.cyclicPermutations (x :: l))",
"state_before": "α : Type u\nl✝ l' l : List α\nhn : Nodup l\n⊢ Nodup (List... | [
667,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
658,
1
] |
Mathlib/Data/List/Basic.lean | List.set_of_mem_cons | [] | [
79,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
78,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | coe_setBasisOfLinearIndependentOfCardEqFinrank | [
{
"state_after": "K : Type u\nV : Type v\ninst✝⁴ : DivisionRing K\ninst✝³ : AddCommGroup V\ninst✝² : Module K V\ns : Set V\ninst✝¹ : Nonempty ↑s\ninst✝ : Fintype ↑s\nlin_ind : LinearIndependent K Subtype.val\ncard_eq : Finset.card (Set.toFinset s) = finrank K V\n⊢ ↑(basisOfLinearIndependentOfCardEqFinrank lin_i... | [
1234,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1229,
1
] |
Mathlib/LinearAlgebra/Alternating.lean | AlternatingMap.coe_zero | [] | [
358,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
357,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/RightAngle.lean | InnerProductGeometry.norm_sub_sq_eq_norm_sq_add_norm_sq' | [] | [
72,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/Data/Set/Finite.lean | Set.univ_finite_iff_nonempty_fintype | [] | [
1049,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1048,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.boundedBy_apply | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nm : Set α → ℝ≥0∞\ns : Set α\n⊢ ↑(boundedBy m) s = ⨅ (t : ℕ → Set α) (_ : s ⊆ iUnion t), ∑' (n : ℕ), ⨆ (_ : Set.Nonempty (t n)), m (t n)",
"tactic": "simp [boundedBy, ofFunction_apply]"
}
] | [
860,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
857,
1
] |
Mathlib/Algebra/Module/LocalizedModule.lean | LocalizedModule.smul'_mk | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝² : CommSemiring R\nS : Submonoid R\nM : Type v\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\nr : R\ns : { x // x ∈ S }\nm : M\n⊢ r • mk m s = mk (r • m) s",
"tactic": "erw [mk_smul_mk r m 1 s, one_mul]"
}
] | [
420,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
419,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Submonoid.LocalizationMap.ofMulEquivOfDom_comp_symm | [] | [
1528,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1526,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.singleton_smul | [] | [
1645,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1644,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.dist_le | [] | [
184,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/CategoryTheory/MorphismProperty.lean | CategoryTheory.MorphismProperty.StableUnderComposition.epimorphisms | [
{
"state_after": "C : Type u\ninst✝¹ : Category C\nD : Type ?u.64328\ninst✝ : Category D\nX Y Z : C\nf : X ⟶ Y\ng : Y ⟶ Z\nhf : Epi f\nhg : Epi g\n⊢ Epi (f ≫ g)",
"state_before": "C : Type u\ninst✝¹ : Category C\nD : Type ?u.64328\ninst✝ : Category D\nX Y Z : C\nf : X ⟶ Y\ng : Y ⟶ Z\nhf : MorphismProperty.e... | [
474,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
469,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | LinearMap.toMatrix_basis_equiv | [
{
"state_after": "case a.h\nR : Type u_2\ninst✝¹¹ : CommSemiring R\nl : Type u_1\nm : Type ?u.2073940\nn : Type ?u.2073943\ninst✝¹⁰ : Fintype n\ninst✝⁹ : Fintype m\ninst✝⁸ : DecidableEq n\nM₁ : Type u_3\nM₂ : Type u_4\ninst✝⁷ : AddCommMonoid M₁\ninst✝⁶ : AddCommMonoid M₂\ninst✝⁵ : Module R M₁\ninst✝⁴ : Module R... | [
678,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
674,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.sUnion_pair | [] | [
1159,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1158,
1
] |
Mathlib/Data/Finmap.lean | Finmap.mem_replace | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : α → Type v\ninst✝ : DecidableEq α\na a' : α\nb : β a\ns✝ : Finmap β\ns : AList β\n⊢ a' ∈ replace a b ⟦s⟧ ↔ a' ∈ ⟦s⟧",
"tactic": "simp"
}
] | [
385,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
384,
1
] |
Mathlib/Data/List/Basic.lean | List.zipWith_nil | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.144456\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nf : α → β → γ\nl : List α\n⊢ zipWith f l [] = []",
"tactic": "cases l <;> rfl"
}
] | [
1900,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1900,
1
] |
Mathlib/MeasureTheory/Function/UniformIntegrable.lean | MeasureTheory.UnifIntegrable.ae_eq | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nι : Type u_3\nm : MeasurableSpace α\nμ : Measure α\ninst✝ : NormedAddCommGroup β\nf g : ι → α → β\np : ℝ≥0∞\nhf : UnifIntegrable f p μ\nhfg : ∀ (n : ι), f n =ᵐ[μ] g n\nε : ℝ\nhε : 0 < ε\n⊢ ∃ δ x,\n ∀ (i : ι) (s : Set α),\n MeasurableSet s → ↑↑μ s ≤ ENNReal.o... | [
146,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
11
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | HasStrictFDerivAt.sub | [
{
"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.441700\ninst✝³ : NormedAddCommGroup G\ninst✝² : Normed... | [
478,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
476,
1
] |
Std/Data/Int/Lemmas.lean | Int.add_nonpos | [] | [
832,
40
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
831,
11
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.vsub_singleton | [] | [
1505,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1504,
1
] |
Mathlib/Topology/MetricSpace/Infsep.lean | Set.infsep_le_dist_of_mem | [] | [
426,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
425,
1
] |
Mathlib/ModelTheory/Substructures.lean | FirstOrder.Language.Embedding.domRestrict_apply | [] | [
912,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
911,
1
] |
Mathlib/Order/LocallyFinite.lean | Multiset.mem_Ioo | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.33022\ninst✝¹ : Preorder α\ninst✝ : LocallyFiniteOrder α\na b x : α\n⊢ x ∈ Ioo a b ↔ a < x ∧ x < b",
"tactic": "rw [Ioo, ← Finset.mem_def, Finset.mem_Ioo]"
}
] | [
568,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
567,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Basic.lean | BoxIntegral.Prepartition.le_iff_nonempty_imp_le_and_iUnion_subset | [
{
"state_after": "case mp\nι : Type u_1\nI J J₁ J₂ : Box ι\nπ π₁ π₂ : Prepartition I\nx : ι → ℝ\n⊢ π₁ ≤ π₂ →\n (∀ (J : Box ι), J ∈ π₁ → ∀ (J' : Box ι), J' ∈ π₂ → Set.Nonempty (↑J ∩ ↑J') → J ≤ J') ∧\n Prepartition.iUnion π₁ ⊆ Prepartition.iUnion π₂\n\ncase mpr\nι : Type u_1\nI J J₁ J₂ : Box ι\nπ π₁ π₂ : ... | [
279,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Mathlib/Algebra/Hom/Equiv/Basic.lean | MulEquiv.bijective | [] | [
238,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
11
] |
Mathlib/Topology/Category/TopCat/Limits/Pullbacks.lean | TopCat.inducing_pullback_to_prod | [
{
"state_after": "no goals",
"state_before": "J : Type v\ninst✝ : SmallCategory J\nX✝ Y✝ Z✝ X Y Z : TopCat\nf : X ⟶ Z\ng : Y ⟶ Z\n⊢ topologicalSpace_forget (pullback f g) =\n induced ((forget TopCat).map (prod.lift pullback.fst pullback.snd)) (topologicalSpace_forget (X ⨯ Y))",
"tactic": "simp [prod_... | [
180,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
178,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.toReal_eq_one_iff | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.24050\nβ : Type ?u.24053\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nx : ℝ≥0∞\n⊢ ENNReal.toReal x = 1 ↔ x = 1",
"tactic": "rw [ENNReal.toReal, NNReal.coe_eq_one, ENNReal.toNNReal_eq_one_iff]"
}
] | [
280,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Basic.lean | Real.strictAntiOn_log | [
{
"state_after": "x✝ y✝ x : ℝ\nhx : x < 0\ny : ℝ\nhy : y < 0\nhxy : x < y\n⊢ log y < log x",
"state_before": "x y : ℝ\n⊢ StrictAntiOn log (Iio 0)",
"tactic": "rintro x (hx : x < 0) y (hy : y < 0) hxy"
},
{
"state_after": "x✝ y✝ x : ℝ\nhx : x < 0\ny : ℝ\nhy : y < 0\nhxy : x < y\n⊢ log (abs y) < l... | [
215,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
211,
1
] |
Mathlib/Data/List/Rdrop.lean | List.rtakeWhile_idempotent | [] | [
249,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
248,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.inr_comp_pushoutComparison | [] | [
1487,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1485,
1
] |
Mathlib/Analysis/NormedSpace/BoundedLinearMaps.lean | IsBoundedLinearMap.fst | [
{
"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.27451\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSpace 𝕜 G\nx : E × F\n⊢ ‖↑(Linear... | [
118,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/MeasureTheory/Function/EssSup.lean | essSup_congr_ae | [] | [
58,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/GroupTheory/Submonoid/Membership.lean | IsScalarTower.of_mclosure_eq_top | [
{
"state_after": "case refine'_1\nM : Type u_3\nA : Type ?u.235426\nB : Type ?u.235429\nN : Type u_1\nα : Type u_2\ninst✝³ : Monoid M\ninst✝² : MulAction M N\ninst✝¹ : SMul N α\ninst✝ : MulAction M α\ns : Set M\nhtop : Submonoid.closure s = ⊤\nhs : ∀ (x : M), x ∈ s → ∀ (y : N) (z : α), (x • y) • z = x • y • z\n... | [
546,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
538,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean | CategoryTheory.Limits.coprod.triangle | [
{
"state_after": "C : Type u\ninst✝³ : Category C\nX✝ Y✝ : C\ninst✝² : Category C\ninst✝¹ : HasBinaryCoproducts C\ninst✝ : HasInitial C\nX Y : C\n⊢ desc (desc inl (inl ≫ inr)) (inr ≫ inr) ≫ map (𝟙 X) (desc (initial.to Y) (𝟙 Y)) =\n map (desc (𝟙 X) (initial.to X)) (𝟙 Y)",
"state_before": "C : Type u\n... | [
1187,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1184,
1
] |
Mathlib/LinearAlgebra/Projection.lean | LinearMap.ofIsComplProd_apply | [] | [
290,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
288,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.