file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/Order/Bounds/Basic.lean | lowerBounds_Icc | [] | [
708,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
707,
1
] |
Mathlib/RingTheory/GradedAlgebra/HomogeneousIdeal.lean | Ideal.IsHomogeneous.iSup₂ | [] | [
296,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
294,
1
] |
Mathlib/Topology/DiscreteQuotient.lean | DiscreteQuotient.comap_id | [] | [
192,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.get?_ofSeq | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ns : Seq α\nn : ℕ\n⊢ head (drop (↑s) n) = Computation.pure (Seq.get? s n)",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ns : Seq α\nn : ℕ\n⊢ get? (↑s) n = Computation.pure (Seq.get? s n)",
"tactic": "dsimp [get?]"
},
{
"state_after": "... | [
1380,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1379,
1
] |
Mathlib/RingTheory/Coprime/Basic.lean | isCoprime_group_smul_left | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nG : Type u_2\ninst✝⁴ : CommSemiring R\ninst✝³ : Group G\ninst✝² : MulAction G R\ninst✝¹ : SMulCommClass G R R\ninst✝ : IsScalarTower G R R\nx : G\ny z : R\nx✝ : IsCoprime (x • y) z\na b : R\nh : a * x • y + b * z = 1\n⊢ x • a * y + b * z = 1",
... | [
233,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
231,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.dotProduct_assoc | [
{
"state_after": "no goals",
"state_before": "l : Type ?u.108126\nm : Type u_1\nn : Type u_2\no : Type ?u.108135\nm' : o → Type ?u.108140\nn' : o → Type ?u.108145\nR : Type ?u.108148\nS : Type ?u.108151\nα : Type v\nβ : Type w\nγ : Type ?u.108158\ninst✝² : Fintype m\ninst✝¹ : Fintype n\ninst✝ : NonUnitalSem... | [
720,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
718,
1
] |
Mathlib/SetTheory/Ordinal/Basic.lean | WellOrder.eta | [
{
"state_after": "case mk\nα : Type ?u.19042\nβ : Type ?u.19045\nγ : Type ?u.19048\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nα✝ : Type u_1\nr✝ : α✝ → α✝ → Prop\nwo✝ : IsWellOrder α✝ r✝\n⊢ { α := { α := α✝, r := r✝, wo := wo✝ }.α, r := { α := α✝, r := r✝, wo := wo✝ }.r,\n wo := (_ : IsWellOrder... | [
137,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
135,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.option_map | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.114704\nδ : Type ?u.114707\nσ : Type u_3\ninst✝⁴ : Primcodable α\ninst✝³ : Primcodable β\ninst✝² : Primcodable γ\ninst✝¹ : Primcodable δ\ninst✝ : Primcodable σ\nf : α → Option β\ng : α → β → σ\nhf : Primrec f\nhg : Primrec... | [
635,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
633,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.sum_monomial_index | [
{
"state_after": "case pos\nR : Type u\na✝ b : R\nm n✝ : ℕ\ninst✝¹ : Semiring R\np q : R[X]\nS : Type u_1\ninst✝ : AddCommMonoid S\nn : ℕ\na : R\nf : ℕ → R → S\nhf : f n 0 = 0\nh : a = 0\n⊢ sum (↑(monomial n) a) f = f n a\n\ncase neg\nR : Type u\na✝ b : R\nm n✝ : ℕ\ninst✝¹ : Semiring R\np q : R[X]\nS : Type u_1... | [
969,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
965,
1
] |
Mathlib/Topology/TietzeExtension.lean | BoundedContinuousFunction.exists_extension_norm_eq_of_closedEmbedding | [
{
"state_after": "case intro.intro\nX : Type u_1\nY : Type u_2\ninst✝² : TopologicalSpace X\ninst✝¹ : TopologicalSpace Y\ninst✝ : NormalSpace Y\ne : X → Y\nhe : ClosedEmbedding e\ng : Y →ᵇ ℝ\nhg : ‖g‖ = ‖compContinuous g (ContinuousMap.mk e)‖\n⊢ ∃ g_1, ‖g_1‖ = ‖compContinuous g (ContinuousMap.mk e)‖ ∧ ↑g_1 ∘ e ... | [
158,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.ne_mex | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.373790\nβ : Type ?u.373793\nγ : Type ?u.373796\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nι : Type u\nf : ι → Ordinal\n⊢ ∀ (i : ι), f i ≠ mex f",
"tactic": "simpa using mex_not_mem_range.{_, v} f"
}
] | [
2022,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2021,
1
] |
Mathlib/Data/Set/Basic.lean | Set.union_inter_distrib_left | [] | [
1062,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1061,
1
] |
Mathlib/Algebra/Order/Group/Bounds.lean | IsGLB.exists_between_self_add' | [] | [
27,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
25,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | MultilinearMap.coe_mk | [] | [
129,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
src/lean/Init/Control/Lawful.lean | seqLeft_eq_bind | [
{
"state_after": "m : Type u_1 → Type u_2\nα β : Type u_1\ninst✝¹ : Monad m\ninst✝ : LawfulMonad m\nx : m α\ny : m β\n⊢ (Seq.seq (const β <$> x) fun x => y) = do\n let a ← x\n let _ ← y\n pure a",
"state_before": "m : Type u_1 → Type u_2\nα β : Type u_1\ninst✝¹ : Monad m\ninst✝ : LawfulMonad m\nx :... | [
85,
60
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
84,
1
] |
Mathlib/Algebra/Category/GroupCat/Basic.lean | AddCommGroupCat.asHom_injective | [
{
"state_after": "no goals",
"state_before": "G : AddCommGroupCat\nh k : ↑G\nw : asHom h = asHom k\n⊢ h = k",
"tactic": "convert congr_arg (fun k : AddCommGroupCat.of ℤ ⟶ G => (k : ℤ → G) (1 : ℤ)) w <;> simp"
}
] | [
351,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
350,
1
] |
Mathlib/Data/List/Forall2.lean | List.forall₂_reverse_iff | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.142594\nδ : Type ?u.142597\nR S : α → β → Prop\nP : γ → δ → Prop\nRₐ : α → α → Prop\nl₁ : List α\nl₂ : List β\nh : Forall₂ R (reverse l₁) (reverse l₂)\n⊢ Forall₂ R (reverse (reverse l₁)) (reverse (reverse l₂))",
"state_before": "α : Type u_1\nβ : Typ... | [
269,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
264,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | SemiconjBy.cast_int_mul_right | [] | [
1065,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1064,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.image_smul_distrib | [] | [
1942,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1940,
1
] |
Mathlib/Data/Rat/Defs.lean | Rat.divInt_div_divInt_cancel_left | [
{
"state_after": "no goals",
"state_before": "a b c : ℚ\nx : ℤ\nhx : x ≠ 0\nn d : ℤ\n⊢ n /. x / (d /. x) = n /. d",
"tactic": "rw [div_eq_mul_inv, inv_def', divInt_mul_divInt_cancel hx]"
}
] | [
495,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
493,
1
] |
Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean | MeasureTheory.AEStronglyMeasurable.sup | [] | [
1355,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1352,
11
] |
Std/Data/RBMap/Lemmas.lean | Std.RBNode.forIn_eq_forIn_toList | [
{
"state_after": "m : Type u_1 → Type u_2\nα : Type u_3\nα✝ : Type u_1\ninit : α✝\nf : α → α✝ → m (ForInStep α✝)\ninst✝¹ : Monad m\ninst✝ : LawfulMonad m\nt : RBNode α\n⊢ ForInStep.run <$> forIn.visit f t init = forIn (toList t) init f",
"state_before": "m : Type u_1 → Type u_2\nα : Type u_3\nα✝ : Type u_1\... | [
362,
83
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
360,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.uniformity_basis_dist | [
{
"state_after": "α : Type u\nβ : Type v\nX : Type ?u.49037\nι : Type ?u.49040\ninst✝ : PseudoMetricSpace α\nx y z : α\nδ ε ε₁ ε₂ : ℝ\ns : Set α\n⊢ HasBasis (𝓤 α) (fun ε => 0 < ε) fun ε => {p | dist p.fst p.snd < ε}",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.49037\nι : Type ?u.49040\ninst✝ : Ps... | [
724,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
721,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.dist_le_two_norm | [] | [
835,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
834,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.fiber_ncard_ne_zero_iff_mem_image | [
{
"state_after": "α : Type u_1\nβ : Type u_2\ns t : Set α\na b x y✝ : α\nf : α → β\ny : β\nhs : autoParam (Set.Finite s) _auto✝\n⊢ y ∈ f '' s → ncard {x | x ∈ s ∧ f x = y} ≠ 0",
"state_before": "α : Type u_1\nβ : Type u_2\ns t : Set α\na b x y✝ : α\nf : α → β\ny : β\nhs : autoParam (Set.Finite s) _auto✝\n⊢ ... | [
284,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.restrict_add_restrict_compl | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.298586\nγ : Type ?u.298589\nδ : Type ?u.298592\nι : Type ?u.298595\nR : Type ?u.298598\nR' : Type ?u.298601\nm0 : MeasurableSpace α\ninst✝¹ : MeasurableSpace β\ninst✝ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set ... | [
1741,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1738,
1
] |
Mathlib/RingTheory/WittVector/WittPolynomial.lean | bind₁_xInTermsOfW_wittPolynomial | [
{
"state_after": "p : ℕ\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : DecidableEq R\ninst✝ : Invertible ↑p\nk : ℕ\n⊢ ∑ x in range (k + 1), ↑(bind₁ (xInTermsOfW p R)) (↑C (↑p ^ x) * X x ^ p ^ (k - x)) = X k",
"state_before": "p : ℕ\nR : Type u_1\ninst✝² : CommRing R\ninst✝¹ : DecidableEq R\ninst✝ : Invertible... | [
309,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
303,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.nonempty_Iic | [] | [
291,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
290,
1
] |
Mathlib/Data/List/AList.lean | AList.union_empty | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : α → Type v\ninst✝ : DecidableEq α\ns : AList β\n⊢ (s ∪ ∅).entries = s.entries",
"tactic": "simp"
}
] | [
438,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
437,
1
] |
Mathlib/LinearAlgebra/Matrix/ZPow.lean | Matrix.zpow_bit1 | [
{
"state_after": "case a\nn' : Type u_1\ninst✝² : DecidableEq n'\ninst✝¹ : Fintype n'\nR : Type u_2\ninst✝ : CommRing R\nA : M\nn : ℤ\n⊢ bit0 n ≠ -1",
"state_before": "n' : Type u_1\ninst✝² : DecidableEq n'\ninst✝¹ : Fintype n'\nR : Type u_2\ninst✝ : CommRing R\nA : M\nn : ℤ\n⊢ A ^ bit1 n = A ^ n * A ^ n * ... | [
265,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
262,
1
] |
Mathlib/CategoryTheory/Conj.lean | CategoryTheory.Functor.map_conj | [] | [
186,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/Logic/Nonempty.lean | not_nonempty_iff_imp_false | [] | [
45,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.beth_succ | [] | [
423,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
422,
1
] |
Mathlib/RingTheory/Valuation/Basic.lean | Valuation.map_sum_lt | [
{
"state_after": "K : Type ?u.668108\nF : Type ?u.668111\nR : Type u_3\ninst✝⁴ : DivisionRing K\nΓ₀ : Type u_2\nΓ'₀ : Type ?u.668123\nΓ''₀ : Type ?u.668126\ninst✝³ : LinearOrderedCommMonoidWithZero Γ''₀\ninst✝² : Ring R\ninst✝¹ : LinearOrderedCommMonoidWithZero Γ₀\ninst✝ : LinearOrderedCommMonoidWithZero Γ'₀\nv... | [
205,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
199,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean | CategoryTheory.Limits.coequalizer.condition | [] | [
961,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
960,
1
] |
Mathlib/GroupTheory/Nilpotent.lean | upperCentralSeries.map | [
{
"state_after": "case zero\nG : Type u_2\ninst✝² : Group G\nH✝ : Subgroup G\ninst✝¹ : Normal H✝\nH : Type u_1\ninst✝ : Group H\nf : G →* H\nh : Function.Surjective ↑f\n⊢ Subgroup.map f (upperCentralSeries G Nat.zero) ≤ upperCentralSeries H Nat.zero\n\ncase succ\nG : Type u_2\ninst✝² : Group G\nH✝ : Subgroup G\... | [
493,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
487,
1
] |
Mathlib/Data/Matrix/Block.lean | Matrix.blockDiagonal'_diagonal | [
{
"state_after": "case a.mk.h.mk\nl : Type ?u.205390\nm : Type ?u.205393\nn : Type ?u.205396\no : Type u_2\np : Type ?u.205402\nq : Type ?u.205405\nm' : o → Type u_1\nn' : o → Type ?u.205415\np' : o → Type ?u.205420\nR : Type ?u.205423\nS : Type ?u.205426\nα : Type u_3\nβ : Type ?u.205432\ninst✝³ : DecidableEq ... | [
707,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
701,
1
] |
Mathlib/Algebra/DirectSum/Basic.lean | DirectSum.fromAddMonoid_of_apply | [
{
"state_after": "no goals",
"state_before": "ι : Type v\ndec_ι : DecidableEq ι\nβ : ι → Type w\ninst✝¹ : (i : ι) → AddCommMonoid (β i)\nγ : Type u₁\ninst✝ : AddCommMonoid γ\ni : ι\nf : γ →+ β i\nx : γ\n⊢ ↑(↑fromAddMonoid (↑(of (fun i => γ →+ β i) i) f)) x = ↑(of β i) (↑f x)",
"tactic": "rw [fromAddMono... | [
237,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/MeasureTheory/Constructions/Pi.lean | MeasureTheory.Measure.pi'_pi | [
{
"state_after": "ι : Type u_2\nι' : Type ?u.2392482\nα : ι → Type u_1\ninst✝³ : Fintype ι\nm : (i : ι) → OuterMeasure (α i)\ninst✝² : (i : ι) → MeasurableSpace (α i)\nμ : (i : ι) → Measure (α i)\ninst✝¹ : Encodable ι\ninst✝ : ∀ (i : ι), SigmaFinite (μ i)\ns : (i : ι) → Set (α i)\n⊢ ↑↑(map (TProd.elim' (_ : ∀ (... | [
284,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Mathlib/CategoryTheory/Yoneda.lean | CategoryTheory.yonedaEquiv_symm_app_apply | [] | [
394,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
392,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean | CategoryTheory.Limits.coequalizer.isoTargetOfSelf_inv | [] | [
1107,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1106,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.le_self_mul_self | [
{
"state_after": "case h.e'_3\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 : FractionalIdeal S P\nhI : 1 ≤ I\n⊢ I = (fun x x_1 => x * x_1) I 1",
"state_before": "R : Type u_1\ninst✝² : CommRing R\nS : Submonoid R\nP ... | [
645,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
643,
1
] |
Mathlib/Data/Set/Basic.lean | Set.mem_diff_singleton_empty | [] | [
2082,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2081,
1
] |
Mathlib/Topology/Instances/NNReal.lean | NNReal.map_coe_atTop | [] | [
114,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
9
] |
Mathlib/Data/List/Sublists.lean | List.revzip_sublists | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nl : List α\n⊢ ∀ (l₁ l₂ : List α), (l₁, l₂) ∈ zip (sublists l) (reverse (sublists l)) → l₁ ++ l₂ ~ l",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nl : List α\n⊢ ∀ (l₁ l₂ : List α), (l₁, l₂) ∈ revzip (sublists l) → l₁ ++ l₂ ~ l",
"tactic": "rw... | [
446,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
430,
1
] |
Mathlib/CategoryTheory/StructuredArrow.lean | CategoryTheory.CostructuredArrow.w | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nT T' T'' : D\nY Y' : C\nS : C ⥤ D\nA B : CostructuredArrow S T\nf : A ⟶ B\n⊢ S.map f.left ≫ B.hom = A.hom",
"tactic": "simp"
}
] | [
317,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
317,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.nhds_basis_closedBall | [] | [
981,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
980,
1
] |
Mathlib/Algebra/Periodic.lean | Function.Antiperiodic.const_inv_mul | [] | [
485,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
483,
1
] |
Mathlib/Algebra/Regular/SMul.lean | IsSMulRegular.mul | [] | [
102,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Std/Data/Nat/Gcd.lean | Nat.coprime.gcd_mul_right_cancel | [
{
"state_after": "no goals",
"state_before": "k n m : Nat\nH : coprime k n\n⊢ gcd (m * k) n = gcd m n",
"tactic": "rw [Nat.mul_comm m k, H.gcd_mul_left_cancel m]"
}
] | [
263,
49
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
262,
1
] |
Mathlib/Algebra/Ring/Prod.lean | NonUnitalRingHom.prod_apply | [] | [
140,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean | PrimeSpectrum.range_comap_of_surjective | [
{
"state_after": "R : Type u\nS : Type v\ninst✝² : CommRing R\ninst✝¹ : CommRing S\nS' : Type ?u.388826\ninst✝ : CommRing S'\nf : R →+* S\nhf : Surjective ↑f\n⊢ ↑(comap f) '' Set.univ = zeroLocus ↑(ker f)",
"state_before": "R : Type u\nS : Type v\ninst✝² : CommRing R\ninst✝¹ : CommRing S\nS' : Type ?u.38882... | [
743,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
739,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | Real.le_norm_self | [] | [
1723,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1722,
1
] |
Mathlib/Algebra/Order/Ring/Defs.lean | nonneg_of_mul_nonneg_left | [] | [
813,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
812,
1
] |
Mathlib/Data/Set/Finite.lean | Set.finite_empty | [] | [
827,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
826,
1
] |
Mathlib/Data/Set/Basic.lean | Set.insert_ne_self | [] | [
1152,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1151,
1
] |
Mathlib/Data/List/Infix.lean | List.tail_subset | [] | [
191,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/Analysis/Convex/Gauge.lean | gauge_smul_of_nonneg | [
{
"state_after": "case inl\n𝕜 : Type ?u.102151\nE : Type u_2\nF : Type ?u.102157\ninst✝⁶ : AddCommGroup E\ninst✝⁵ : Module ℝ E\ns✝ t : Set E\na : ℝ\nα : Type u_1\ninst✝⁴ : LinearOrderedField α\ninst✝³ : MulActionWithZero α ℝ\ninst✝² : OrderedSMul α ℝ\ninst✝¹ : MulActionWithZero α E\ninst✝ : IsScalarTower α ℝ (... | [
267,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | LocalEquiv.forall_mem_target | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.25263\nδ : Type ?u.25266\ne : LocalEquiv α β\ne' : LocalEquiv β γ\np : β → Prop\n⊢ (∀ (y : β), y ∈ e.target → p y) ↔ ∀ (x : α), x ∈ e.source → p (↑e x)",
"tactic": "rw [← image_source_eq_target, ball_image_iff]"
}
] | [
340,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
339,
1
] |
Mathlib/Data/PFun.lean | PFun.lift_graph | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.15079\nδ : Type ?u.15082\nε : Type ?u.15085\nι : Type ?u.15088\nf : α → β\na : α\nb : β\n⊢ (∃ x, f a = b) ↔ f a = b",
"tactic": "simp"
}
] | [
205,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/Data/Real/CauSeq.lean | CauSeq.rat_inf_continuous_lemma | [] | [
821,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
819,
1
] |
Mathlib/Analysis/Calculus/DiffContOnCl.lean | DiffContOnCl.mk_ball | [] | [
77,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/Analysis/Normed/MulAction.lean | dist_smul₀ | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\ninst✝³ : NormedDivisionRing α\ninst✝² : SeminormedAddCommGroup β\ninst✝¹ : Module α β\ninst✝ : BoundedSMul α β\ns : α\nx y : β\n⊢ dist (s • x) (s • y) = ‖s‖ * dist x y",
"tactic": "simp_rw [dist_eq_norm, (norm_smul s (x - y)).symm... | [
115,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/Combinatorics/Hindman.lean | Hindman.FP_drop_subset_FP | [
{
"state_after": "case zero\nM : Type u_1\ninst✝ : Semigroup M\na : Stream' M\n⊢ FP (Stream'.drop Nat.zero a) ⊆ FP a\n\ncase succ\nM : Type u_1\ninst✝ : Semigroup M\na : Stream' M\nn : ℕ\nih : FP (Stream'.drop n a) ⊆ FP a\n⊢ FP (Stream'.drop (Nat.succ n) a) ⊆ FP a",
"state_before": "M : Type u_1\ninst✝ : Se... | [
251,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
247,
1
] |
Mathlib/Analysis/Asymptotics/Theta.lean | Asymptotics.isTheta_of_norm_eventuallyEq' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.24296\nE : Type ?u.24299\nF : Type ?u.24302\nG : Type ?u.24305\nE' : Type u_2\nF' : Type ?u.24311\nG' : Type ?u.24314\nE'' : Type ?u.24317\nF'' : Type ?u.24320\nG'' : Type ?u.24323\nR : Type ?u.24326\nR' : Type ?u.24329\n𝕜 : Type ?u.24... | [
171,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean | MeasureTheory.integral_comp_rpow_Ioi | [
{
"state_after": "E : Type u_1\nf : ℝ → E\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℝ E\ninst✝ : CompleteSpace E\ng : ℝ → E\np : ℝ\nhp : p ≠ 0\nS : Set ℝ := Ioi 0\n⊢ (∫ (x : ℝ) in Ioi 0, (abs p * x ^ (p - 1)) • g (x ^ p)) = ∫ (y : ℝ) in Ioi 0, g y",
"state_before": "E : Type u_1\nf : ℝ → E\ninst✝... | [
869,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
847,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.vector_toList_iff | [] | [
1289,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1288,
1
] |
Mathlib/Analysis/NormedSpace/IsROrC.lean | NormedSpace.sphere_nonempty_isROrC | [] | [
104,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Mathlib/Algebra/Periodic.lean | Function.Antiperiodic.const_smul₀ | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type u_3\nf g : α → β\nc c₁ c₂ x✝ : α\ninst✝³ : AddCommMonoid α\ninst✝² : Neg β\ninst✝¹ : DivisionSemiring γ\ninst✝ : Module γ α\nh : Antiperiodic f c\na : γ\nha : a ≠ 0\nx : α\n⊢ (fun x => f (a • x)) (x + a⁻¹ • c) = -(fun x => f ... | [
465,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
463,
1
] |
Mathlib/CategoryTheory/Monoidal/Mon_.lean | Mon_.mul_leftUnitor | [
{
"state_after": "C : Type u₁\ninst✝² : Category C\ninst✝¹ : MonoidalCategory C\ninst✝ : BraidedCategory C\nM : Mon_ C\n⊢ (tensor_μ C (𝟙_ C, M.X) (𝟙_ C, M.X) ≫ ((λ_ (𝟙_ C)).hom ⊗ 𝟙 (M.X ⊗ M.X)) ≫ (𝟙 (𝟙_ C) ⊗ M.mul)) ≫ (λ_ M.X).hom =\n ((λ_ M.X).hom ⊗ (λ_ M.X).hom) ≫ 𝟙 (M.X ⊗ M.X) ≫ M.mul",
"state_... | [
469,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
463,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.lintegral_one | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.75222\nγ : Type ?u.75225\nδ : Type ?u.75228\nm : MeasurableSpace α\nμ ν : Measure α\n⊢ (∫⁻ (x : α), 1 ∂μ) = ↑↑μ univ",
"tactic": "rw [lintegral_const, one_mul]"
}
] | [
179,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
179,
1
] |
Mathlib/RingTheory/Valuation/Basic.lean | Valuation.IsEquiv.symm | [] | [
378,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
src/lean/Init/Data/Nat/Linear.lean | Nat.Linear.Poly.mul.go_denote | [
{
"state_after": "no goals",
"state_before": "ctx : Context\nk : Nat\np : Poly\n⊢ denote ctx (go k p) = k * denote ctx p",
"tactic": "match p with\n| [] => rfl\n| (k', v) :: p => simp [Poly.mul.go, go_denote]"
},
{
"state_after": "no goals",
"state_before": "ctx : Context\nk : Nat\np : Poly\... | [
580,
50
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
577,
1
] |
Mathlib/Order/CompleteLattice.lean | iInf_bool_eq | [] | [
1519,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1518,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.iUnion₂_prod_const | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.232320\nι : Sort u_3\nι' : Sort ?u.232326\nι₂ : Sort ?u.232329\nκ : ι → Sort u_4\nκ₁ : ι → Sort ?u.232339\nκ₂ : ι → Sort ?u.232344\nκ' : ι' → Sort ?u.232349\ns : (i : ι) → κ i → Set α\nt : Set β\n⊢ (⋃ (i : ι) (j : κ i), s ... | [
1791,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1790,
1
] |
Mathlib/Data/Finset/Preimage.lean | Finset.mem_preimage | [] | [
39,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Mathlib/Computability/RegularExpressions.lean | RegularExpression.deriv_zero | [] | [
183,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/RightAngle.lean | InnerProductGeometry.norm_div_tan_angle_sub_of_inner_eq_zero | [
{
"state_after": "V : Type u_1\ninst✝¹ : NormedAddCommGroup V\ninst✝ : InnerProductSpace ℝ V\nx y : V\nh : inner x (-y) = 0\nh0 : x = 0 ∨ y ≠ 0\n⊢ ‖y‖ / Real.tan (angle x (x - y)) = ‖x‖",
"state_before": "V : Type u_1\ninst✝¹ : NormedAddCommGroup V\ninst✝ : InnerProductSpace ℝ V\nx y : V\nh : inner x y = 0\... | [
354,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
350,
1
] |
Mathlib/Order/JordanHolder.lean | CompositionSeries.exists_top_eq_snoc_equivalant | [
{
"state_after": "case zero\nX : Type u\ninst✝¹ : Lattice X\ninst✝ : JordanHolderLattice X\ns✝ : CompositionSeries X\nx✝¹ : X\nhm✝ : IsMaximal x✝¹ (top s✝)\nhb✝ : bot s✝ ≤ x✝¹\nx✝ : ℕ\nhn✝ : s✝.length = x✝\ns : CompositionSeries X\nx : X\nhm : IsMaximal x (top s)\nhb : bot s ≤ x\nhn : s.length = Nat.zero\n⊢ ∃ t... | [
787,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
751,
1
] |
Mathlib/Topology/Category/TopCat/Basic.lean | TopCat.of_isoOfHomeo | [
{
"state_after": "X Y : TopCat\nf : ↑X ≃ₜ ↑Y\n⊢ Homeomorph.mk\n { toFun := (forget TopCat).map (Homeomorph.toContinuousMap f),\n invFun := (forget TopCat).map (Homeomorph.toContinuousMap (Homeomorph.symm f)),\n left_inv :=\n (_ :\n ∀ (x : ↑X),\n (forget TopCat... | [
149,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/Data/TypeVec.lean | TypeVec.fst_prod_mk | [
{
"state_after": "case h\nn : ℕ\nα α' β β' : TypeVec n\nf : α ⟹ β\ng : α' ⟹ β'\ni : Fin2 n\n⊢ (prod.fst ⊚ (f ⊗' g)) i = (f ⊚ prod.fst) i",
"state_before": "n : ℕ\nα α' β β' : TypeVec n\nf : α ⟹ β\ng : α' ⟹ β'\n⊢ prod.fst ⊚ (f ⊗' g) = f ⊚ prod.fst",
"tactic": "funext i"
},
{
"state_after": "case ... | [
574,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
570,
1
] |
Mathlib/RingTheory/Subring/Pointwise.lean | Subring.smul_mem_pointwise_smul_iff₀ | [] | [
153,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Mathlib/Data/Set/Basic.lean | Set.setOf_eq_eq_singleton' | [] | [
1267,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1266,
1
] |
Mathlib/Topology/PartitionOfUnity.lean | PartitionOfUnity.sum_le_one | [] | [
169,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | MultilinearMap.add_apply | [] | [
205,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/Topology/Maps.lean | ClosedEmbedding.tendsto_nhds_iff | [] | [
652,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
650,
1
] |
Mathlib/Topology/Instances/EReal.lean | EReal.continuous_neg | [] | [
255,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
11
] |
Mathlib/Algebra/Algebra/Unitization.lean | Unitization.snd_mul | [] | [
377,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
375,
1
] |
Mathlib/Logic/Equiv/Fin.lean | finAddFlip_apply_mk_left | [
{
"state_after": "no goals",
"state_before": "m n k : ℕ\nh : k < m\nhk : optParam (k < m + n) (_ : k < m + n)\nhnk : optParam (n + k < n + m) (_ : n + k < n + m)\n⊢ ↑finAddFlip { val := k, isLt := hk } = { val := n + k, isLt := hnk }",
"tactic": "convert finAddFlip_apply_castAdd ⟨k, h⟩ n"
}
] | [
377,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
374,
1
] |
Mathlib/MeasureTheory/Constructions/Prod/Integral.lean | MeasureTheory.integral_integral_add' | [] | [
402,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
399,
1
] |
Mathlib/MeasureTheory/Measure/Content.lean | MeasureTheory.Content.le_innerContent | [] | [
131,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/CategoryTheory/Monoidal/Category.lean | CategoryTheory.MonoidalCategory.associator_inv_conjugation | [
{
"state_after": "no goals",
"state_before": "C✝ : Type u\n𝒞 : Category C✝\ninst✝² : MonoidalCategory C✝\nC : Type u\ninst✝¹ : Category C\ninst✝ : MonoidalCategory C\nU V W X✝ Y✝ Z✝ X X' Y Y' Z Z' : C\nf : X ⟶ X'\ng : Y ⟶ Y'\nh : Z ⟶ Z'\n⊢ f ⊗ g ⊗ h = (α_ X Y Z).inv ≫ ((f ⊗ g) ⊗ h) ≫ (α_ X' Y' Z').hom",
... | [
336,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
334,
1
] |
Mathlib/NumberTheory/Fermat4.lean | Fermat42.coprime_of_minimal | [
{
"state_after": "a b c : ℤ\nh : Minimal a b c\n⊢ Int.gcd a b = 1",
"state_before": "a b c : ℤ\nh : Minimal a b c\n⊢ IsCoprime a b",
"tactic": "apply Int.gcd_eq_one_iff_coprime.mp"
},
{
"state_after": "a b c : ℤ\nh : Minimal a b c\nhab : ¬Int.gcd a b = 1\n⊢ False",
"state_before": "a b c : ℤ... | [
109,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/Algebra/Order/Sub/Defs.lean | tsub_zero | [] | [
451,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
450,
1
] |
Mathlib/Init/Logic.lean | not_of_eq_false | [] | [
48,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
48,
1
] |
Mathlib/CategoryTheory/Bicategory/Basic.lean | CategoryTheory.Bicategory.leftUnitor_inv_whiskerRight | [
{
"state_after": "no goals",
"state_before": "B : Type u\ninst✝ : Bicategory B\na b c d e : B\nf : a ⟶ b\ng : b ⟶ c\n⊢ inv ((λ_ f).inv ▷ g) = inv ((λ_ (f ≫ g)).inv ≫ (α_ (𝟙 a) f g).inv)",
"tactic": "simp"
}
] | [
437,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
435,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Submodule.equivSubtypeMap_symm_apply | [
{
"state_after": "case mk\nR : Type u_1\nR₁ : Type ?u.2231117\nR₂ : Type ?u.2231120\nR₃ : Type ?u.2231123\nR₄ : Type ?u.2231126\nS : Type ?u.2231129\nK : Type ?u.2231132\nK₂ : Type ?u.2231135\nM : Type u_2\nM' : Type ?u.2231141\nM₁ : Type ?u.2231144\nM₂ : Type ?u.2231147\nM₃ : Type ?u.2231150\nM₄ : Type ?u.2231... | [
2449,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2446,
1
] |
Mathlib/Algebra/Lie/Classical.lean | LieAlgebra.Orthogonal.indefiniteDiagonal_transform | [
{
"state_after": "case a.h\nn : Type ?u.52016\np : Type u_1\nq : Type u_2\nl : Type ?u.52025\nR : Type u₂\ninst✝⁶ : DecidableEq n\ninst✝⁵ : DecidableEq p\ninst✝⁴ : DecidableEq q\ninst✝³ : DecidableEq l\ninst✝² : CommRing R\ninst✝¹ : Fintype p\ninst✝ : Fintype q\ni : R\nhi : i * i = -1\nx y : p ⊕ q\n⊢ ((Pso p q ... | [
215,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.dual_Ioo | [] | [
266,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
265,
1
] |
Mathlib/MeasureTheory/Measure/VectorMeasure.lean | MeasureTheory.VectorMeasure.MutuallySingular.add_left | [
{
"state_after": "case intro.intro.intro\nα : Type u_3\nβ : Type ?u.661519\nm : MeasurableSpace α\nL : Type ?u.661525\nM : Type u_2\nN : Type u_1\ninst✝⁷ : AddCommMonoid L\ninst✝⁶ : TopologicalSpace L\ninst✝⁵ : AddCommMonoid M\ninst✝⁴ : TopologicalSpace M\ninst✝³ : AddCommMonoid N\ninst✝² : TopologicalSpace N\n... | [
1228,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1211,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.