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/Topology/UniformSpace/Basic.lean | subset_comp_self_of_mem_uniformity | [] | [
590,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
589,
1
] |
Mathlib/LinearAlgebra/Matrix/Trace.lean | Matrix.trace_transpose_mul | [] | [
148,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/MeasureTheory/Lattice.lean | AEMeasurable.inf_const | [] | [
199,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/Order/Disjointed.lean | partialSups_disjointed | [
{
"state_after": "case h.h\nα : Type u_1\nβ : Type ?u.6810\ninst✝ : GeneralizedBooleanAlgebra α\nf : ℕ → α\nn : ℕ\n⊢ ↑(partialSups (disjointed f)) n = ↑(partialSups f) n",
"state_before": "α : Type u_1\nβ : Type ?u.6810\ninst✝ : GeneralizedBooleanAlgebra α\nf : ℕ → α\n⊢ partialSups (disjointed f) = partialS... | [
118,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/MeasureTheory/Integral/SetToL1.lean | MeasureTheory.continuous_L1_toL1 | [
{
"state_after": "case pos\nα : Type u_1\nE : Type ?u.1624064\nF : Type ?u.1624067\nF' : Type ?u.1624070\nG : Type u_2\n𝕜 : Type ?u.1624076\np : ℝ≥0∞\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace ℝ E\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace ℝ F\ninst✝³ : NormedAddCommGroup F'\ninst✝² : Norme... | [
1608,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1566,
1
] |
Mathlib/Data/Set/Finite.lean | Set.Finite.of_preimage | [] | [
887,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
885,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalSubsemiring.coe_sSup_of_directedOn | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS✝ : Type v\nT : Type w\ninst✝³ : NonUnitalNonAssocSemiring R\nM : Subsemigroup R\ninst✝² : NonUnitalNonAssocSemiring S✝\ninst✝¹ : NonUnitalNonAssocSemiring T\nF : Type ?u.284510\ninst✝ : NonUnitalRingHomClass F R S✝\nS : Set (NonUnitalSubsemiring R)... | [
850,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
848,
1
] |
Mathlib/Topology/Algebra/Order/UpperLower.lean | IsOpen.lowerClosure | [] | [
80,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
11
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearEquiv.image_closure | [] | [
1838,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1837,
1
] |
Mathlib/Data/PEquiv.lean | PEquiv.injective_of_forall_ne_isSome | [
{
"state_after": "case none\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nf : α ≃. β\na₂ : α\nh : ∀ (a₁ : α), a₁ ≠ a₂ → isSome (↑f a₁) = true\nx : α\nhfx : ↑f x = none\n⊢ (fun b => Option.recOn b a₂ fun b' => Option.recOn (↑(PEquiv.symm f) b') a₂ id) none = x\n\ncase some\nα : Type u\nβ : Type v\nγ : Type w\... | [
192,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/GroupTheory/Congruence.lean | Con.lift_unique | [
{
"state_after": "M : Type u_1\nN : Type ?u.64181\nP : Type u_2\ninst✝² : MulOneClass M\ninst✝¹ : MulOneClass N\ninst✝ : MulOneClass P\nc : Con M\nx✝ y : M\ng : Con.Quotient c →* P\nx : M\nH : c ≤ ker (MonoidHom.comp g (mk' c))\n⊢ ↑g ↑x = ↑(lift c (MonoidHom.comp g (mk' c)) H) ↑x",
"state_before": "M : Type... | [
977,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
973,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Mul.lean | HasFDerivAt.mul | [
{
"state_after": "case h.e'_10.h.e'_6\n𝕜 : Type u_1\ninst✝¹² : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝¹¹ : NormedAddCommGroup E\ninst✝¹⁰ : NormedSpace 𝕜 E\nF : Type ?u.748817\ninst✝⁹ : NormedAddCommGroup F\ninst✝⁸ : NormedSpace 𝕜 F\nG : Type ?u.748912\ninst✝⁷ : NormedAddCommGroup G\ninst✝⁶ : NormedSp... | [
319,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
315,
1
] |
Mathlib/Data/Finsupp/Order.lean | Finsupp.monotone_toFun | [] | [
85,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.iUnion | [] | [
115,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
11
] |
Mathlib/Algebra/Order/Interval.lean | NonemptyInterval.pure_sub_pure | [] | [
377,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
376,
1
] |
Mathlib/NumberTheory/RamificationInertia.lean | Ideal.powQuotSuccInclusion_injective | [
{
"state_after": "R : Type u\ninst✝¹ : CommRing R\nS : Type v\ninst✝ : CommRing S\nf : R →+* S\np : Ideal R\nP : Ideal S\nhfp : NeZero e\ni : ℕ\n⊢ ∀ (m : { x // x ∈ map (Quotient.mk (P ^ e)) (P ^ (i + 1)) }), ↑(powQuotSuccInclusion f p P i) m = 0 → m = 0",
"state_before": "R : Type u\ninst✝¹ : CommRing R\nS... | [
502,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
497,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.updateRow_apply | [
{
"state_after": "case pos\nl : Type ?u.1220174\nm : Type u_1\nn : Type u_2\no : Type ?u.1220183\nm' : o → Type ?u.1220188\nn' : o → Type ?u.1220193\nR : Type ?u.1220196\nS : Type ?u.1220199\nα : Type v\nβ : Type w\nγ : Type ?u.1220206\nM : Matrix m n α\ni : m\nj : n\nb : n → α\nc : m → α\ninst✝ : DecidableEq m... | [
2777,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2773,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Iic_inter_Iic | [
{
"state_after": "case h\nα : Type u_1\nβ : Type ?u.177459\ninst✝ : SemilatticeInf α\na b x : α\n⊢ x ∈ Iic a ∩ Iic b ↔ x ∈ Iic (a ⊓ b)",
"state_before": "α : Type u_1\nβ : Type ?u.177459\ninst✝ : SemilatticeInf α\na b : α\n⊢ Iic a ∩ Iic b = Iic (a ⊓ b)",
"tactic": "ext x"
},
{
"state_after": "no... | [
1725,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1723,
1
] |
Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean | SmoothManifoldWithCorners.compatible_of_mem_maximalAtlas | [] | [
708,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
706,
1
] |
Mathlib/Analysis/InnerProductSpace/Orthogonal.lean | Submodule.isOrtho_sSup_right | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.141088\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace 𝕜 F\nU : Submodule 𝕜 E\nV : Set (Submodule 𝕜 E)\n⊢ (∀ (Uᵢ : Submodule... | [
362,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
360,
1
] |
Mathlib/Topology/ContinuousOn.lean | continuous_iff_continuousOn_univ | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.319567\nδ : Type ?u.319570\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\nf : α → β\n⊢ Continuous f ↔ ContinuousOn f univ",
"tactic": "simp [continuo... | [
693,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
691,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Linear.lean | IsBoundedLinearMap.differentiableOn | [] | [
150,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
1
] |
Mathlib/Data/Set/Finite.lean | Set.card_le_of_subset | [] | [
1242,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1240,
1
] |
Std/Data/List/Lemmas.lean | List.chain_succ_range' | [] | [
1841,
69
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1838,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.atTop_Ici_eq | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.328153\nι' : Type ?u.328156\nα : Type u_1\nβ : Type ?u.328162\nγ : Type ?u.328165\ninst✝ : SemilatticeSup α\na : α\n⊢ atTop = comap Subtype.val atTop",
"tactic": "rw [← map_val_Ici_atTop a, comap_map Subtype.coe_injective]"
}
] | [
1565,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1564,
1
] |
Mathlib/Data/Analysis/Topology.lean | Ctop.Realizer.mem_nhds | [
{
"state_after": "α : Type u_1\nβ : Type ?u.8047\nσ : Type ?u.8050\nτ : Type ?u.8053\nT : TopologicalSpace α\nF : Realizer α\ns : Set α\na : α\nthis : s ∈ 𝓝 a ↔ ∃ b, a ∈ f F.F b ∧ f F.F b ⊆ s\n⊢ s ∈ 𝓝 a ↔ ∃ b, a ∈ f F.F b ∧ f F.F b ⊆ s",
"state_before": "α : Type u_1\nβ : Type ?u.8047\nσ : Type ?u.8050\nτ... | [
137,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
135,
11
] |
Mathlib/Analysis/Convex/Function.lean | ConvexOn.comp | [] | [
132,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/RingTheory/PowerSeries/WellKnown.lean | PowerSeries.coeff_exp | [] | [
97,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
1
] |
Std/Data/List/Lemmas.lean | List.get?_set_of_lt | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\na : α\nm n : Nat\nl : List α\nh : n < length l\n⊢ get? (set l m a) n = if m = n then some a else get? l n",
"tactic": "simp [get?_set, get?_eq_get h]"
}
] | [
811,
33
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
809,
1
] |
Mathlib/RingTheory/Multiplicity.lean | multiplicity.pow | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : CancelCommMonoidWithZero α\ninst✝ : DecidableRel fun x x_1 => x ∣ x_1\np a : α\nhp : Prime p\n⊢ multiplicity p (a ^ 0) = 0 • multiplicity p a",
"tactic": "simp [one_right hp.not_unit]"
},
{
"state_after": "no goals",
"state... | [
611,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
609,
1
] |
Mathlib/GroupTheory/GroupAction/Opposite.lean | MulOpposite.unop_smul_eq_unop_smul_unop | [] | [
71,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/AlgebraicTopology/DoldKan/Faces.lean | AlgebraicTopology.DoldKan.HigherFacesVanish.induction | [
{
"state_after": "C : Type u_2\ninst✝¹ : Category C\ninst✝ : Preadditive C\nX : SimplicialObject C\nY : C\nn q : ℕ\nφ : Y ⟶ X.obj [n + 1].op\nv : HigherFacesVanish q φ\nj : Fin (n + 1)\nhj₁ : n + 1 ≤ ↑j + (q + 1)\n⊢ (φ ≫ HomologicalComplex.Hom.f (𝟙 (AlternatingFaceMapComplex.obj X) + Hσ q) (n + 1)) ≫ δ X (Fin.... | [
219,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Std/Data/Option/Lemmas.lean | Option.mem_of_mem_join | [] | [
166,
28
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
165,
1
] |
Mathlib/Analysis/Normed/Group/Seminorm.lean | GroupNorm.coe_add | [] | [
817,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
816,
1
] |
Mathlib/Data/List/Card.lean | List.card_map_eq_of_inj_on | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\ninst✝¹ : DecidableEq α\ninst✝ : DecidableEq β\nf : α → β\nas : List α\n⊢ inj_on f as → card (map f as) = card as",
"tactic": "induction as with\n| nil => simp\n| cons a as ih =>\n cases Decidable.em (f a ∈ map f as) with\n | inl... | [
169,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Mathlib/Data/Set/Finite.lean | Set.Finite.sInter | [] | [
805,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
803,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.tsum_eq_zero | [] | [
866,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
865,
11
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.isFractional_of_le | [
{
"state_after": "case intro.intro\nR : Type u_1\ninst✝² : CommRing R\nS : Submonoid R\nP : Type u_2\ninst✝¹ : CommRing P\ninst✝ : Algebra R P\nloc : IsLocalization S P\nI : Submodule R P\nJ : FractionalIdeal S P\nhIJ : I ≤ ↑J\na : R\na_mem : a ∈ S\nha : ∀ (b : P), b ∈ ↑J → IsInteger R (a • b)\n⊢ IsFractional S... | [
225,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
220,
1
] |
Mathlib/RingTheory/DedekindDomain/Ideal.lean | Ideal.isPrime_iff_bot_or_prime | [] | [
730,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
728,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.sub_le_iff_le_add | [
{
"state_after": "α : Type u_1\nβ : Type ?u.156876\nγ : Type ?u.156879\ninst✝ : DecidableEq α\nt u : Multiset α\na b : α\n⊢ ∀ {s : Multiset α}, s - t ≤ u ↔ s ≤ u + t",
"state_before": "α : Type u_1\nβ : Type ?u.156876\nγ : Type ?u.156879\ninst✝ : DecidableEq α\ns t u : Multiset α\na b : α\n⊢ s - t ≤ u ↔ s ≤... | [
1658,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1655,
11
] |
Mathlib/Combinatorics/SimpleGraph/Ends/Defs.lean | SimpleGraph.ComponentCompl.disjoint_right | [
{
"state_after": "V : Type u\nG : SimpleGraph V\nK L L' M : Set V\nC : ComponentCompl G K\n⊢ K ∩ ↑C ⊆ ∅",
"state_before": "V : Type u\nG : SimpleGraph V\nK L L' M : Set V\nC : ComponentCompl G K\n⊢ Disjoint K ↑C",
"tactic": "rw [Set.disjoint_iff]"
},
{
"state_after": "no goals",
"state_befor... | [
127,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
11
] |
Mathlib/LinearAlgebra/Matrix/Determinant.lean | Matrix.det_mul | [
{
"state_after": "m : Type ?u.320844\nn : Type u_1\ninst✝⁴ : DecidableEq n\ninst✝³ : Fintype n\ninst✝² : DecidableEq m\ninst✝¹ : Fintype m\nR : Type v\ninst✝ : CommRing R\nM N : Matrix n n R\n⊢ ∑ x : Perm n, ∑ x_1 : n → n, ↑↑(↑sign x) * ∏ x_2 : n, M (↑x x_2) (x_1 x_2) * N (x_1 x_2) x_2 =\n ∑ x : n → n, ∑ x_1... | [
189,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/LinearAlgebra/UnitaryGroup.lean | Matrix.mem_unitaryGroup_iff | [
{
"state_after": "n : Type u\ninst✝³ : DecidableEq n\ninst✝² : Fintype n\nα : Type v\ninst✝¹ : CommRing α\ninst✝ : StarRing α\nA : Matrix n n α\nhA : A * star A = 1\n⊢ star A * A = 1",
"state_before": "n : Type u\ninst✝³ : DecidableEq n\ninst✝² : Fintype n\nα : Type v\ninst✝¹ : CommRing α\ninst✝ : StarRing ... | [
71,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/Data/Polynomial/Monic.lean | Polynomial.Monic.isUnit_iff | [] | [
256,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
255,
1
] |
Mathlib/Topology/CompactOpen.lean | ContinuousMap.gen_union | [] | [
77,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | Real.one_lt_cosh | [
{
"state_after": "no goals",
"state_before": "x y z : ℝ\n⊢ abs 0 < abs x ↔ x ≠ 0",
"tactic": "simp only [_root_.abs_zero, abs_pos]"
}
] | [
746,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
745,
1
] |
Mathlib/Data/FunLike/Equiv.lean | EquivLike.comp_injective | [] | [
219,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
218,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.sSup_adj | [] | [
310,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
309,
1
] |
Mathlib/Topology/Instances/Complex.lean | Complex.subfield_eq_of_closed | [
{
"state_after": "K : Subfield ℂ\nhc : IsClosed ↑K\n⊢ range ofReal' ⊆ ↑K",
"state_before": "K : Subfield ℂ\nhc : IsClosed ↑K\n⊢ K = RingHom.fieldRange ofReal ∨ K = ⊤",
"tactic": "suffices range (ofReal' : ℝ → ℂ) ⊆ K by\n rw [range_subset_iff, ← coe_algebraMap] at this\n have :=\n (Subalgebra.isSimp... | [
48,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
27,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean | CategoryTheory.Limits.BinaryFan.mk_fst | [] | [
321,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
320,
1
] |
Mathlib/GroupTheory/Perm/List.lean | List.support_formPerm_le' | [
{
"state_after": "α : Type u_1\nβ : Type ?u.733602\ninst✝ : DecidableEq α\nl : List α\nx : α\n⊢ ↑(toFinset l ⊔ toFinset (tail l)) ≤ ↑(toFinset l)",
"state_before": "α : Type u_1\nβ : Type ?u.733602\ninst✝ : DecidableEq α\nl : List α\nx : α\n⊢ {x | ↑(formPerm l) x ≠ x} ≤ ↑(toFinset l)",
"tactic": "refine... | [
202,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
200,
1
] |
Mathlib/NumberTheory/Padics/PadicIntegers.lean | PadicInt.algebraMap_apply | [] | [
664,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
663,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.nat_cast_imI | [] | [
981,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
981,
1
] |
Mathlib/Data/List/Zip.lean | List.zipWith_distrib_reverse | [
{
"state_after": "case nil\nα : Type u\nβ : Type u_1\nγ : Type u_2\nδ : Type ?u.262855\nε : Type ?u.262858\nf : α → β → γ\nl : List α\nl'✝ : List β\nn : ℕ\nh✝ : length l = length l'✝\nl' : List β\nh : length [] = length l'\n⊢ reverse (zipWith f [] l') = zipWith f (reverse []) (reverse l')\n\ncase cons\nα : Type... | [
518,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
510,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.neighborSet_union_compl_neighborSet_eq | [
{
"state_after": "case h\nι : Sort ?u.140009\n𝕜 : Type ?u.140012\nV : Type u\nW : Type v\nX : Type w\nG✝ : SimpleGraph V\nG' : SimpleGraph W\na b c u v✝ w✝ : V\ne : Sym2 V\nG : SimpleGraph V\nv w : V\n⊢ w ∈ neighborSet G v ∪ neighborSet (Gᶜ) v ↔ w ∈ {v}ᶜ",
"state_before": "ι : Sort ?u.140009\n𝕜 : Type ?u.... | [
990,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
985,
1
] |
Mathlib/Computability/PartrecCode.lean | Nat.Partrec.Code.rfind_prim | [] | [
276,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Mathlib/Algebra/Algebra/Equiv.lean | AlgEquiv.arrowCongr_comp | [
{
"state_after": "case H\nR : Type u\nA₁ : Type v\nA₂ : Type w\nA₃ : Type u₁\ninst✝¹² : CommSemiring R\ninst✝¹¹ : Semiring A₁\ninst✝¹⁰ : Semiring A₂\ninst✝⁹ : Semiring A₃\ninst✝⁸ : Algebra R A₁\ninst✝⁷ : Algebra R A₂\ninst✝⁶ : Algebra R A₃\ne : A₁ ≃ₐ[R] A₂\nA₁' : Type u_1\nA₂' : Type u_2\nA₃' : Type u_3\ninst✝⁵... | [
462,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
455,
1
] |
Mathlib/CategoryTheory/IsConnected.lean | CategoryTheory.isConnected_of_equivalent | [
{
"state_after": "no goals",
"state_before": "J : Type u₁\ninst✝³ : Category J\nK✝ : Type u₂\ninst✝² : Category K✝\nK : Type u₁\ninst✝¹ : Category K\ne : J ≌ K\ninst✝ : IsConnected J\n⊢ Nonempty J",
"tactic": "infer_instance"
}
] | [
226,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | ContDiffAt.csin | [] | [
424,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
422,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.cof_eq_one_iff_is_succ | [
{
"state_after": "α✝ : Type ?u.46575\nr✝ : α✝ → α✝ → Prop\no : Ordinal\nα : Type u\nr : α → α → Prop\nx✝ : IsWellOrder α r\nz : cof (type r) = 1\n⊢ ∃ a, type r = succ a",
"state_before": "α✝ : Type ?u.46575\nr✝ : α✝ → α✝ → Prop\no : Ordinal\nα : Type u\nr : α → α → Prop\nx✝ : IsWellOrder α r\nz : cof (type ... | [
543,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
517,
1
] |
Mathlib/Algebra/Parity.lean | Odd.pow_neg | [
{
"state_after": "case intro\nF : Type ?u.108547\nα : Type ?u.108550\nβ : Type ?u.108553\nR : Type u_1\ninst✝ : LinearOrderedRing R\na : R\nn : ℕ\nha : a < 0\nk : ℕ\nhk : n = 2 * k + 1\n⊢ a ^ n < 0",
"state_before": "F : Type ?u.108547\nα : Type ?u.108550\nβ : Type ?u.108553\nR : Type u_1\ninst✝ : LinearOrd... | [
483,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
482,
1
] |
Mathlib/LinearAlgebra/Matrix/Circulant.lean | Matrix.Fin.circulant_ite | [
{
"state_after": "no goals",
"state_before": "α✝ : Type ?u.59587\nβ : Type ?u.59590\nm : Type ?u.59593\nn : Type ?u.59596\nR : Type ?u.59599\nα : Type u_1\ninst✝¹ : Zero α\ninst✝ : One α\n⊢ (circulant fun i => if ↑i = 0 then 1 else 0) = 1",
"tactic": "simp [Injective]"
},
{
"state_after": "α✝ : ... | [
188,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Images.lean | CategoryTheory.Limits.HasImage.mk | [] | [
283,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/Data/Int/Interval.lean | Int.card_Ioc_of_le | [
{
"state_after": "no goals",
"state_before": "a b : ℤ\nh : a ≤ b\n⊢ ↑(card (Ioc a b)) = b - a",
"tactic": "rw [card_Ioc, toNat_sub_of_le h]"
}
] | [
139,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/Algebra/Bounds.lean | bddAbove_inv | [] | [
36,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
35,
1
] |
Mathlib/Data/List/Perm.lean | List.perm_inv_core | [
{
"state_after": "α : Type uu\nβ : Type vv\nl₁✝ l₂✝ : List α\na : α\nl₁ l₂ r₁ r₂ s₁ : List α\ne₁ : l₁ ++ a :: r₁ = s₁\n⊢ s₁ ~ l₂ ++ a :: r₂ → l₁ ++ r₁ ~ l₂ ++ r₂",
"state_before": "α : Type uu\nβ : Type vv\nl₁✝ l₂✝ : List α\na : α\nl₁ l₂ r₁ r₂ : List α\n⊢ l₁ ++ a :: r₁ ~ l₂ ++ a :: r₂ → l₁ ++ r₁ ~ l₂ ++ r₂"... | [
641,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
596,
1
] |
Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | intervalIntegral.integral_deriv_eq_sub | [] | [
1237,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1235,
1
] |
Mathlib/CategoryTheory/Category/Basic.lean | CategoryTheory.cancel_epi | [] | [
287,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
286,
1
] |
Mathlib/RingTheory/Subring/Basic.lean | RingEquiv.ofLeftInverse_apply | [] | [
1327,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1325,
1
] |
Mathlib/Algebra/Module/Basic.lean | neg_smul | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.98570\nR : Type u_2\nk : Type ?u.98576\nS : Type ?u.98579\nM : Type u_1\nM₂ : Type ?u.98585\nM₃ : Type ?u.98588\nι : Type ?u.98591\ninst✝² : Ring R\ninst✝¹ : AddCommGroup M\ninst✝ : Module R M\nr s : R\nx y : M\n⊢ -r • x + r • x = 0",
"tactic": "... | [
302,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.Prime.pow_eq_iff | [
{
"state_after": "p a k : ℕ\nhp : Prime p\nh : a ^ k = p\n⊢ a = p ∧ k = 1",
"state_before": "p a k : ℕ\nhp : Prime p\n⊢ a ^ k = p ↔ a = p ∧ k = 1",
"tactic": "refine' ⟨fun h => _, fun h => by rw [h.1, h.2, pow_one]⟩"
},
{
"state_after": "p a k : ℕ\nhp : Prime (a ^ k)\nh : a ^ k = p\n⊢ a = p ∧ k ... | [
617,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
614,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.dvd_prime_two_le | [] | [
208,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
207,
1
] |
Mathlib/NumberTheory/Padics/RingHoms.lean | PadicInt.nthHomSeq_one | [
{
"state_after": "p : ℕ\nhp_prime : Fact (Nat.Prime p)\nR : Type u_1\ninst✝ : NonAssocSemiring R\nf : (k : ℕ) → R →+* ZMod (p ^ k)\nf_compat : ∀ (k1 k2 : ℕ) (hk : k1 ≤ k2), RingHom.comp (ZMod.castHom (_ : p ^ k1 ∣ p ^ k2) (ZMod (p ^ k1))) (f k2) = f k1\nε : ℚ\nhε : ε > 0\n⊢ ∃ i, ∀ (j : ℕ), j ≥ i → padicNorm p (... | [
536,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
529,
1
] |
Mathlib/Topology/UniformSpace/Equicontinuity.lean | equicontinuousAt_iff_range | [
{
"state_after": "ι : Type u_1\nκ : Type ?u.31450\nX : Type u_2\nY : Type ?u.31456\nZ : Type ?u.31459\nα : Type u_3\nβ : Type ?u.31465\nγ : Type ?u.31468\n𝓕 : Type ?u.31471\ninst✝⁵ : TopologicalSpace X\ninst✝⁴ : TopologicalSpace Y\ninst✝³ : TopologicalSpace Z\ninst✝² : UniformSpace α\ninst✝¹ : UniformSpace β\n... | [
222,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
219,
1
] |
Mathlib/Data/Nat/Bits.lean | Nat.bit0_eq_zero | [
{
"state_after": "no goals",
"state_before": "n✝ n : ℕ\nh : n = 0\n⊢ bit0 n = 0",
"tactic": "simp [h]"
}
] | [
154,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
11
] |
Mathlib/Algebra/ContinuedFractions/Translations.lean | GeneralizedContinuedFraction.exists_conts_a_of_num | [
{
"state_after": "no goals",
"state_before": "K : Type u_1\ng : GeneralizedContinuedFraction K\nn : ℕ\ninst✝ : DivisionRing K\nA : K\nnth_num_eq : numerators g n = A\n⊢ ∃ conts, continuants g n = conts ∧ conts.a = A",
"tactic": "simpa"
}
] | [
114,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Mathlib/Order/CompleteLattice.lean | inf_iInf_nat_succ | [] | [
1673,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1672,
1
] |
Mathlib/Analysis/SpecialFunctions/Exp.lean | Complex.tendsto_exp_comap_re_atBot_nhdsWithin | [] | [
464,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
463,
1
] |
Mathlib/Data/Polynomial/Coeff.lean | Polynomial.coeff_X_pow | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\na b : R\nn✝ m : ℕ\ninst✝ : Semiring R\np q r : R[X]\nk n : ℕ\n⊢ coeff (X ^ k) n = if n = k then 1 else 0",
"tactic": "simp only [one_mul, RingHom.map_one, ← coeff_C_mul_X_pow]"
}
] | [
186,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
185,
1
] |
Mathlib/Data/Polynomial/Monic.lean | Polynomial.Monic.nextCoeff_mul | [
{
"state_after": "R : Type u\nS : Type v\na b : R\nm n : ℕ\nι : Type y\ninst✝ : Semiring R\np q r : R[X]\nhp : Monic p\nhq : Monic q\n✝ : Nontrivial R\n⊢ nextCoeff (p * q) = nextCoeff p + nextCoeff q",
"state_before": "R : Type u\nS : Type v\na b : R\nm n : ℕ\nι : Type y\ninst✝ : Semiring R\np q r : R[X]\nh... | [
217,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
211,
1
] |
Mathlib/Data/Complex/Exponential.lean | Complex.sinh_ofReal_im | [
{
"state_after": "no goals",
"state_before": "x✝ y : ℂ\nx : ℝ\n⊢ (sinh ↑x).im = 0",
"tactic": "rw [← ofReal_sinh_ofReal_re, ofReal_im]"
}
] | [
661,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
661,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Ioo_subset_Iio_self | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.57885\nα : Type u_1\ninst✝² : Preorder α\ninst✝¹ : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\ninst✝ : LocallyFiniteOrderBot α\n⊢ Ioo a b ⊆ Iio b",
"tactic": "simpa [← coe_subset] using Set.Ioo_subset_Iio_self"
}
] | [
439,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
438,
1
] |
Mathlib/Analysis/Convex/Side.lean | Wbtw.wOppSide₃₁ | [] | [
411,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
409,
1
] |
Mathlib/Topology/UniformSpace/UniformEmbedding.lean | completeSpace_iff_isComplete_range | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² : UniformSpace α\ninst✝¹ : UniformSpace β\ninst✝ : UniformSpace γ\nf : α → β\nhf : UniformInducing f\n⊢ CompleteSpace α ↔ IsComplete (range f)",
"tactic": "rw [completeSpace_iff_isComplete_univ, ← isComplete_image_i... | [
309,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
307,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.swap_apply_self | [
{
"state_after": "no goals",
"state_before": "α : Sort u_1\ninst✝ : DecidableEq α\ni j a : α\n⊢ ↑(swap i j) (↑(swap i j) a) = a",
"tactic": "rw [← Equiv.trans_apply, Equiv.swap_swap, Equiv.refl_apply]"
}
] | [
1626,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1625,
1
] |
Std/Data/Int/DivMod.lean | Int.add_emod_eq_add_emod_right | [
{
"state_after": "no goals",
"state_before": "m n k i : Int\nH : m % n = k % n\n⊢ (m + i) % n = (k + i) % n",
"tactic": "rw [← emod_add_emod, ← emod_add_emod k, H]"
}
] | [
432,
45
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
430,
1
] |
src/lean/Init/Data/Nat/Div.lean | Nat.mod_le | [
{
"state_after": "no goals",
"state_before": "x y : Nat\n⊢ x % y ≤ x",
"tactic": "match Nat.lt_or_ge x y with\n| Or.inl h₁ => rw [mod_eq_of_lt h₁]; apply Nat.le_refl\n| Or.inr h₁ => match eq_zero_or_pos y with\n | Or.inl h₂ => rw [h₂, Nat.mod_zero x]; apply Nat.le_refl\n | Or.inr h₂ => exact Nat.le_tr... | [
145,
70
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
140,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snormEssSup_map_measure | [] | [
904,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
902,
1
] |
Mathlib/Topology/Order/Basic.lean | closure_Ioi' | [
{
"state_after": "case h₁\nα : Type u\nβ : Type v\nγ : Type w\ninst✝³ : TopologicalSpace α\ninst✝² : LinearOrder α\ninst✝¹ : OrderTopology α\ninst✝ : DenselyOrdered α\na✝ b : α\ns : Set α\na : α\nh : Set.Nonempty (Ioi a)\n⊢ closure (Ioi a) ⊆ Ici a\n\ncase h₂\nα : Type u\nβ : Type v\nγ : Type w\ninst✝³ : Topolog... | [
2218,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2214,
1
] |
Mathlib/Topology/Algebra/Monoid.lean | ContinuousMap.coe_mulRight | [] | [
881,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
880,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/ArctanDeriv.lean | Differentiable.arctan | [] | [
210,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/RingTheory/AlgebraicIndependent.lean | AlgebraicIndependent.eq_zero_of_aeval_eq_zero | [] | [
88,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | cardinal_lt_aleph0_of_finiteDimensional | [
{
"state_after": "K✝ : Type u\nV✝ : Type v\nK V : Type u\ninst✝⁴ : DivisionRing K\ninst✝³ : AddCommGroup V\ninst✝² : Module K V\ninst✝¹ : _root_.Finite K\ninst✝ : FiniteDimensional K V\nthis : IsNoetherian K V := Iff.mpr IsNoetherian.iff_fg inferInstance\n⊢ (#V) < ℵ₀",
"state_before": "K✝ : Type u\nV✝ : Typ... | [
1553,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1549,
1
] |
Mathlib/Analysis/Calculus/Deriv/Inv.lean | HasDerivAt.inv | [
{
"state_after": "𝕜 : 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 : Filter 𝕜\nc : 𝕜 → 𝕜\nh : E → 𝕜\nc' :... | [
144,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/Combinatorics/SetFamily/Compression/Down.lean | Finset.mem_nonMemberSubfamily | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : DecidableEq α\n𝒜 ℬ : Finset (Finset α)\ns : Finset α\na : α\n⊢ s ∈ nonMemberSubfamily a 𝒜 ↔ s ∈ 𝒜 ∧ ¬a ∈ s",
"tactic": "simp [nonMemberSubfamily]"
}
] | [
60,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.push_pull' | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.287461\nι : Sort x\nf : α → β\nF : Filter α\nG : Filter β\n⊢ map f (comap f G ⊓ F) = G ⊓ map f F",
"tactic": "simp only [Filter.push_pull, inf_comm]"
}
] | [
2581,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2580,
11
] |
Mathlib/Algebra/Lie/CartanSubalgebra.lean | LieSubalgebra.isCartanSubalgebra_iff_isUcsLimit | [
{
"state_after": "case mp\nR : Type u\nL : Type v\ninst✝² : CommRing R\ninst✝¹ : LieRing L\ninst✝ : LieAlgebra R L\nH : LieSubalgebra R L\n⊢ IsCartanSubalgebra H → LieSubmodule.IsUcsLimit (toLieSubmodule H)\n\ncase mpr\nR : Type u\nL : Type v\ninst✝² : CommRing R\ninst✝¹ : LieRing L\ninst✝ : LieAlgebra R L\nH :... | [
96,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/Data/Finsupp/ToDfinsupp.lean | Dfinsupp.toFinsupp_sub | [] | [
207,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
205,
1
] |
Mathlib/Order/Bounds/Basic.lean | IsLUB.union | [] | [
447,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
442,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.ae_eventually_not_mem | [] | [
2950,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2948,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.