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/Data/Real/CauSeqCompletion.lean | CauSeq.lim_lt | [] | [
462,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
461,
1
] |
Mathlib/Topology/Homeomorph.lean | Homeomorph.coe_symm_toEquiv | [] | [
99,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/Analysis/Quaternion.lean | Quaternion.norm_piLp_equiv_symm_equivTuple | [
{
"state_after": "x : ℍ\n⊢ Real.sqrt\n (inner (↑(PiLp.equiv 2 fun x => ℝ).symm (↑(equivTuple ℝ) x) 0)\n (↑(PiLp.equiv 2 fun x => ℝ).symm (↑(equivTuple ℝ) x) 0) +\n inner (↑(PiLp.equiv 2 fun x => ℝ).symm (↑(equivTuple ℝ) x) 1)\n (↑(PiLp.equiv 2 fun x => ℝ).symm (↑(equivT... | [
182,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
177,
1
] |
Mathlib/CategoryTheory/Limits/HasLimits.lean | CategoryTheory.Limits.ι_colimMap | [] | [
777,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
775,
1
] |
Mathlib/MeasureTheory/Measure/VectorMeasure.lean | MeasureTheory.VectorMeasure.mapRange_zero | [
{
"state_after": "case h\nα : Type u_3\nβ : Type ?u.297551\nm inst✝⁵ : MeasurableSpace α\ninst✝⁴ : MeasurableSpace β\nM : Type u_1\ninst✝³ : AddCommMonoid M\ninst✝² : TopologicalSpace M\nv : VectorMeasure α M\nN : Type u_2\ninst✝¹ : AddCommMonoid N\ninst✝ : TopologicalSpace N\nf : M →+ N\nhf : Continuous ↑f\ni✝... | [
634,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
631,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.val_strictMono | [] | [
338,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.image_smul_comm | [] | [
1935,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1933,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_dite_of_true | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.428568\nβ : Type u\nα : Type v\nγ : Type w\ns s₁ s₂ : Finset α\na : α\nf✝ g✝ : α → β\ninst✝ : CommMonoid β\np : α → Prop\nhp : DecidablePred p\nh : ∀ (x : α), x ∈ s → p x\nf : (x : α) → p x → β\ng : (x : α) → ¬p x → β\nx : α\nhx : x ∈ s\n⊢ (fun x hx ... | [
1191,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1184,
1
] |
Mathlib/Data/PFun.lean | PFun.mem_image | [] | [
409,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
408,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.unbounded_of_unbounded_sUnion | [
{
"state_after": "α : Type u_1\nr✝ r : α → α → Prop\nwo : IsWellOrder α r\ns : Set (Set α)\nh₁ : Unbounded r (⋃₀ s)\nh₂ : (#↑s) < StrictOrder.cof r\nh : ∀ (x : Set α), x ∈ s → ¬Unbounded r x\n⊢ False",
"state_before": "α : Type u_1\nr✝ r : α → α → Prop\nwo : IsWellOrder α r\ns : Set (Set α)\nh₁ : Unbounded ... | [
790,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
783,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | ENNReal.tsum_const_smul | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type ?u.256888\nγ : Type ?u.256891\na✝ b c d : ℝ≥0∞\nr p q : ℝ≥0\nx y z ε ε₁ ε₂ : ℝ≥0∞\ns : Set ℝ≥0∞\nf g : α → ℝ≥0∞\nR : Type u_1\ninst✝¹ : SMul R ℝ≥0∞\ninst✝ : IsScalarTower R ℝ≥0∞ ℝ≥0∞\na : R\n⊢ (∑' (i : α), a • f i) = a • ∑' (i : α), f i",
... | [
916,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
914,
11
] |
Mathlib/Analysis/NormedSpace/Exponential.lean | expSeries_sum_eq | [] | [
108,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Order/GaloisConnection.lean | GaloisConnection.l_u_l_eq_l' | [] | [
213,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/Data/Nat/Log.lean | Nat.clog_of_two_le | [
{
"state_after": "no goals",
"state_before": "b n : ℕ\nhb : 1 < b\nhn : 2 ≤ n\n⊢ clog b n = clog b ((n + b - 1) / b) + 1",
"tactic": "rw [clog, dif_pos (⟨hb, hn⟩ : 1 < b ∧ 1 < n)]"
}
] | [
279,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
278,
1
] |
Mathlib/Order/UpperLower/Basic.lean | LowerSet.symm_map | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.101991\nι : Sort ?u.101994\nκ : ι → Sort ?u.101999\ninst✝² : Preorder α\ninst✝¹ : Preorder β\ninst✝ : Preorder γ\nf✝ : α ≃o β\ns✝ t : LowerSet α\na : α\nb : β\nf : α ≃o β\ns : LowerSet β\n⊢ ↑(↑(OrderIso.symm (map f)) s) = ... | [
1016,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1015,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Base.lean | Real.logb_le_logb_of_base_lt_one | [
{
"state_after": "no goals",
"state_before": "b x y : ℝ\nb_pos : 0 < b\nb_lt_one : b < 1\nh : 0 < x\nh₁ : 0 < y\n⊢ logb b x ≤ logb b y ↔ y ≤ x",
"tactic": "rw [logb, logb, div_le_div_right_of_neg (log_neg b_pos b_lt_one), log_le_log h₁ h]"
}
] | [
257,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
256,
1
] |
Mathlib/Analysis/Normed/Group/Quotient.lean | AddSubgroup.norm_normedMk_le | [
{
"state_after": "no goals",
"state_before": "M : Type u_1\nN : Type ?u.424521\ninst✝¹ : SeminormedAddCommGroup M\ninst✝ : SeminormedAddCommGroup N\nS : AddSubgroup M\nm : M\n⊢ ‖↑(normedMk S) m‖ ≤ 1 * ‖m‖",
"tactic": "simp [quotient_norm_mk_le']"
}
] | [
305,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
304,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | tsum_dite_right | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.326054\nδ : Type ?u.326057\ninst✝³ : AddCommMonoid α\ninst✝² : TopologicalSpace α\ninst✝¹ : T2Space α\nf g : β → α\na a₁ a₂ : α\nP : Prop\ninst✝ : Decidable P\nx : β → ¬P → α\n⊢ (∑' (b : β), if h : P then 0 else x b h) = i... | [
547,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
545,
1
] |
Mathlib/Data/Sigma/Order.lean | Sigma.le_def | [
{
"state_after": "case mp\nι : Type u_2\nα : ι → Type u_1\ninst✝ : (i : ι) → LE (α i)\na b : (i : ι) × α i\n⊢ a ≤ b → ∃ h, h ▸ a.snd ≤ b.snd\n\ncase mpr\nι : Type u_2\nα : ι → Type u_1\ninst✝ : (i : ι) → LE (α i)\na b : (i : ι) × α i\n⊢ (∃ h, h ▸ a.snd ≤ b.snd) → a ≤ b",
"state_before": "ι : Type u_2\nα : ι... | [
88,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
81,
1
] |
Mathlib/CategoryTheory/Functor/Category.lean | CategoryTheory.NatTrans.comp_app | [] | [
80,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/Data/Set/Intervals/WithBotTop.lean | WithTop.preimage_coe_Ioo_top | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : PartialOrder α\na b : α\n⊢ some ⁻¹' Ioo ↑a ⊤ = Ioi a",
"tactic": "simp [← Ioi_inter_Iio]"
}
] | [
87,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.spanCompIso_inv_app_left | [] | [
368,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
368,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | uniformContinuous_id | [] | [
1127,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1127,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.eventually_constant_prod | [
{
"state_after": "case intro\nι : Type ?u.436010\nβ : Type u\nα : Type v\nγ : Type w\ns s₁ s₂ : Finset α\na : α\nf g : α → β\ninst✝ : CommMonoid β\nu : ℕ → β\nN : ℕ\nhu : ∀ (n : ℕ), n ≥ N → u n = 1\nm : ℕ\nhn : N ≤ N + m\n⊢ ∏ k in range (N + m + 1), u k = ∏ k in range (N + 1), u k",
"state_before": "ι : Typ... | [
1240,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1233,
1
] |
Mathlib/NumberTheory/ClassNumber/AdmissibleCardPowDegree.lean | Polynomial.exists_eq_polynomial | [
{
"state_after": "Fq : Type u_1\ninst✝¹ : Fintype Fq\ninst✝ : Semiring Fq\nd m : ℕ\nhm : Fintype.card Fq ^ d ≤ m\nb : Fq[X]\nhb : natDegree b ≤ d\nA : Fin (Nat.succ m) → Fq[X]\nhA : ∀ (i : Fin (Nat.succ m)), degree (A i) < degree b\nf : Fin (Nat.succ m) → Fin d → Fq := fun i j => coeff (A i) ↑j\n⊢ ∃ i₀ i₁, i₀ ≠... | [
60,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
39,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Types.lean | CategoryTheory.Limits.Types.binaryProductIso_hom_comp_fst | [] | [
157,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/LinearAlgebra/Matrix/Charpoly/Minpoly.lean | LinearMap.minpoly_toMatrix' | [] | [
67,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/Data/Finset/Sum.lean | Finset.inl_mem_disjSum | [] | [
77,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/Data/Rat/NNRat.lean | NNRat.coe_sub | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.13919\np q : ℚ≥0\nh : q ≤ p\n⊢ ↑q ≤ ↑p - 0",
"tactic": "rwa [sub_zero]"
}
] | [
154,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/CategoryTheory/Sites/Sieves.lean | CategoryTheory.Sieve.inter_apply | [] | [
369,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
368,
1
] |
Mathlib/Topology/Order/Priestley.lean | exists_clopen_upper_of_not_le | [] | [
55,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Order/Hom/Lattice.lean | SupBotHom.ext | [] | [
746,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
745,
1
] |
Mathlib/Combinatorics/Partition.lean | Nat.Partition.count_ofSums_of_ne_zero | [] | [
126,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Order/OmegaCompletePartialOrder.lean | OmegaCompletePartialOrder.const_continuous' | [] | [
301,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
300,
1
] |
Mathlib/Topology/Order/Basic.lean | eventually_ge_nhds | [] | [
1197,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1197,
1
] |
Mathlib/Topology/Separation.lean | t1Space_of_injective_of_continuous | [] | [
591,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
589,
1
] |
Mathlib/Topology/Algebra/Ring/Basic.lean | Subsemiring.isClosed_topologicalClosure | [] | [
122,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/Algebra/GradedMonoid.lean | SetLike.list_dProd_eq | [] | [
668,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
662,
1
] |
Mathlib/Topology/TietzeExtension.lean | BoundedContinuousFunction.exists_extension_forall_mem_of_closedEmbedding | [
{
"state_after": "case inl\nX : Type u_1\nY : Type u_2\ninst✝² : TopologicalSpace X\ninst✝¹ : TopologicalSpace Y\ninst✝ : NormalSpace Y\nf : X →ᵇ ℝ\nt : Set ℝ\ne : X → Y\nhs : OrdConnected t\nhf : ∀ (x : X), ↑f x ∈ t\nhne : Set.Nonempty t\nhe : ClosedEmbedding e\nh✝ : IsEmpty X\n⊢ ∃ g, (∀ (y : Y), ↑g y ∈ t) ∧ ↑... | [
324,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
315,
1
] |
Mathlib/MeasureTheory/Measure/FiniteMeasure.lean | MeasureTheory.FiniteMeasure.tendsto_zero_testAgainstNN_of_tendsto_zero_mass | [
{
"state_after": "Ω : Type u_2\ninst✝⁶ : MeasurableSpace Ω\nR : Type ?u.143739\ninst✝⁵ : SMul R ℝ≥0\ninst✝⁴ : SMul R ℝ≥0∞\ninst✝³ : IsScalarTower R ℝ≥0 ℝ≥0∞\ninst✝² : IsScalarTower R ℝ≥0∞ ℝ≥0∞\ninst✝¹ : TopologicalSpace Ω\ninst✝ : OpensMeasurableSpace Ω\nγ : Type u_1\nF : Filter γ\nμs : γ → FiniteMeasure Ω\nmas... | [
531,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
517,
1
] |
Mathlib/Topology/Connected.lean | IsConnected.image | [] | [
340,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
11
] |
Mathlib/Data/Polynomial/RingDivision.lean | Polynomial.natDegree_mul | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nT : Type w\na b : R\nn : ℕ\ninst✝¹ : Semiring R\ninst✝ : NoZeroDivisors R\np q : R[X]\nhp : p ≠ 0\nhq : q ≠ 0\n⊢ natDegree (p * q) = natDegree p + natDegree q",
"tactic": "rw [← WithBot.coe_eq_coe, ← Nat.cast_withBot, ←degree_eq_natDe... | [
139,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
136,
1
] |
Std/Data/List/Lemmas.lean | List.pair_mem_product | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nxs : List α\nys : List β\nx : α\ny : β\n⊢ (x, y) ∈ product xs ys ↔ x ∈ xs ∧ y ∈ ys",
"tactic": "simp only [product, and_imp, exists_prop, mem_map, Prod.mk.injEq,\n exists_eq_right_right, mem_bind, iff_self]"
}
] | [
1453,
47
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1450,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | powersMulHom_apply | [] | [
975,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
973,
1
] |
Mathlib/Data/Nat/Choose/Cast.lean | Nat.cast_choose_two | [
{
"state_after": "no goals",
"state_before": "K : Type u_1\ninst✝¹ : DivisionRing K\ninst✝ : CharZero K\na : ℕ\n⊢ ↑(choose a 2) = ↑a * (↑a - 1) / 2",
"tactic": "rw [← cast_descFactorial_two, descFactorial_eq_factorial_mul_choose, factorial_two, mul_comm,\n cast_mul, cast_two, eq_div_iff_mul_eq (two_ne_... | [
46,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Mathlib/RingTheory/Subring/Basic.lean | Subring.range_subtype | [] | [
1275,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1274,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean | ENNReal.le_rpow_self_of_one_le | [
{
"state_after": "x : ℝ≥0∞\nz : ℝ\nhx : 1 ≤ x\nh_one_le : 1 ≤ z\n⊢ x ^ 1 ≤ x ^ z",
"state_before": "x : ℝ≥0∞\nz : ℝ\nhx : 1 ≤ x\nh_one_le : 1 ≤ z\n⊢ x ≤ x ^ z",
"tactic": "nth_rw 1 [← ENNReal.rpow_one x]"
},
{
"state_after": "no goals",
"state_before": "x : ℝ≥0∞\nz : ℝ\nhx : 1 ≤ x\nh_one_le ... | [
646,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
644,
1
] |
Mathlib/Logic/Basic.lean | exists_eq_right' | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.20626\nα : Sort u_1\nκ : ι → Sort ?u.20628\np q : α → Prop\na' : α\n⊢ (∃ a, p a ∧ a' = a) ↔ p a'",
"tactic": "simp [@eq_comm _ a']"
}
] | [
823,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
823,
9
] |
Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean | mul_div_cancel_left | [] | [
168,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean | Finpartition.mk_mem_nonUniforms_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\n𝕜 : Type u_2\ninst✝² : LinearOrderedField 𝕜\ninst✝¹ : DecidableEq α\nA : Finset α\nP : Finpartition A\nG : SimpleGraph α\ninst✝ : DecidableRel G.Adj\nε✝ : 𝕜\nu v : Finset α\nε : 𝕜\n⊢ (u, v) ∈ nonUniforms P G ε ↔ u ∈ P.parts ∧ v ∈ P.parts ∧ u ≠ ... | [
213,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
211,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Basic.lean | Real.exp_log_eq_abs | [
{
"state_after": "no goals",
"state_before": "x y : ℝ\nhx : x ≠ 0\n⊢ exp (log x) = abs x",
"tactic": "rw [log_of_ne_zero hx, ← coe_expOrderIso_apply, OrderIso.apply_symm_apply, Subtype.coe_mk]"
}
] | [
59,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
58,
1
] |
Mathlib/Order/Filter/Ultrafilter.lean | Filter.mem_hyperfilter_of_finite_compl | [] | [
506,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
505,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.count_filter_of_pos | [
{
"state_after": "α : Type u_1\nβ : Type ?u.396498\nγ : Type ?u.396501\ninst✝¹ : DecidableEq α\np : α → Prop\ninst✝ : DecidablePred p\na : α\ns : Multiset α\nh : p a\n_l : List α\n⊢ List.count a (List.filter (fun b => decide (p b)) _l) = List.count a _l",
"state_before": "α : Type u_1\nβ : Type ?u.396498\nγ... | [
2489,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2484,
1
] |
Mathlib/Algebra/Group/Units.lean | Units.inv_eq_of_mul_eq_one_right | [
{
"state_after": "no goals",
"state_before": "α : Type u\ninst✝ : Monoid α\na✝ b c u : αˣ\na : α\nh : ↑u * a = 1\n⊢ ↑u⁻¹ = ↑u⁻¹ * 1",
"tactic": "rw [mul_one]"
},
{
"state_after": "no goals",
"state_before": "α : Type u\ninst✝ : Monoid α\na✝ b c u : αˣ\na : α\nh : ↑u * a = 1\n⊢ ↑u⁻¹ * 1 = a",... | [
360,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
357,
11
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.toList'_cons | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nl : List α\ns : WSeq α\na : α\n⊢ Computation.destruct\n (Computation.corec\n (fun x =>\n match x with\n | (l, s) =>\n match Seq.destruct s with\n | none => Sum.inl (List.reve... | [
1288,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1277,
1
] |
Mathlib/SetTheory/Ordinal/Topology.lean | Ordinal.isClosed_iff_sup | [
{
"state_after": "s : Set Ordinal\na : Ordinal\n⊢ (∀ {ι : Type u}, Nonempty ι → ∀ (f : ι → Ordinal), (∀ (i : ι), f i ∈ s) → sup f ∈ s) → IsClosed s",
"state_before": "s : Set Ordinal\na : Ordinal\n⊢ IsClosed s ↔ ∀ {ι : Type u}, Nonempty ι → ∀ (f : ι → Ordinal), (∀ (i : ι), f i ∈ s) → sup f ∈ s",
"tactic... | [
162,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/Topology/MetricSpace/Isometry.lean | IsometryEquiv.symm_symm | [] | [
423,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
1
] |
Mathlib/Algebra/Category/GroupCat/FilteredColimits.lean | GroupCat.FilteredColimits.colimitInvAux_eq_of_rel | [
{
"state_after": "case h\nJ : Type v\ninst✝¹ : SmallCategory J\ninst✝ : IsFiltered J\nF : J ⥤ GroupCat\nx y : (j : J) × ↑(F.obj j)\nh : Types.FilteredColimit.Rel (F ⋙ forget GroupCat) x y\n⊢ ∃ k f g, ↑(F.map f) { fst := x.fst, snd := x.snd⁻¹ }.snd = ↑(F.map g) { fst := y.fst, snd := y.snd⁻¹ }.snd",
"state_b... | [
101,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/Algebra/BigOperators/Finprod.lean | finprod_mem_insert_of_eq_one_if_not_mem | [
{
"state_after": "α : Type u_1\nβ : Type ?u.345276\nι : Type ?u.345279\nG : Type ?u.345282\nM : Type u_2\nN : Type ?u.345288\ninst✝¹ : CommMonoid M\ninst✝ : CommMonoid N\nf g : α → M\na b : α\ns t : Set α\nh : ¬a ∈ s → f a = 1\nx : α\nhx : x ∈ mulSupport fun i => f i\n⊢ x ∈ insert a s → x ∈ s",
"state_befor... | [
878,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
874,
1
] |
Mathlib/RingTheory/MvPolynomial/Homogeneous.lean | MvPolynomial.coeff_homogeneousComponent | [] | [
258,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
256,
1
] |
Mathlib/Analysis/Convex/Function.lean | ConcaveOn.translate_right | [] | [
292,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
290,
1
] |
Mathlib/Analysis/ODE/PicardLindelof.lean | PicardLindelof.nonempty_Icc | [] | [
102,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
11
] |
Mathlib/Order/Monotone/Basic.lean | strictAntiOn_comp_ofDual_iff | [] | [
207,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
206,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/CommSq.lean | CategoryTheory.IsPushout.of_horiz_isIso | [
{
"state_after": "C : Type u₁\ninst✝² : Category C\nZ X Y P : C\nf : Z ⟶ X\ng : Z ⟶ Y\ninl : X ⟶ P\ninr : Y ⟶ P\ninst✝¹ : IsIso f\ninst✝ : IsIso inr\nsq : CommSq f g inl inr\ns : PushoutCocone f g\n⊢ inl ≫ (fun s => inv inr ≫ PushoutCocone.inr s) s = PushoutCocone.inl s",
"state_before": "C : Type u₁\ninst✝... | [
873,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
867,
1
] |
Mathlib/Computability/TMToPartrec.lean | Turing.PartrecToTM2.codeSupp_case | [
{
"state_after": "no goals",
"state_before": "f g : Code\nk : Cont'\n⊢ codeSupp (Code.case f g) k = trStmts₁ (trNormal (Code.case f g) k) ∪ (codeSupp f k ∪ codeSupp g k)",
"tactic": "simp [codeSupp, codeSupp', contSupp, Finset.union_assoc, Finset.union_left_comm]"
}
] | [
1852,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1849,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | MultilinearMap.sum_apply | [
{
"state_after": "case empty\nR : Type u\nι : Type u'\nn : ℕ\nM : Fin (Nat.succ n) → Type v\nM₁ : ι → Type v₁\nM₂ : Type v₂\nM₃ : Type v₃\nM' : Type v'\ninst✝¹⁰ : Semiring R\ninst✝⁹ : (i : Fin (Nat.succ n)) → AddCommMonoid (M i)\ninst✝⁸ : (i : ι) → AddCommMonoid (M₁ i)\ninst✝⁷ : AddCommMonoid M₂\ninst✝⁶ : AddCo... | [
253,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/Geometry/Manifold/LocalInvariantProperties.lean | StructureGroupoid.LocalInvariantProp.liftPropWithinAt_congr_of_eventuallyEq | [
{
"state_after": "H : Type u_1\nM : Type u_2\nH' : Type u_3\nM' : Type u_4\nX : Type ?u.41226\ninst✝⁶ : TopologicalSpace H\ninst✝⁵ : TopologicalSpace M\ninst✝⁴ : ChartedSpace H M\ninst✝³ : TopologicalSpace H'\ninst✝² : TopologicalSpace M'\ninst✝¹ : ChartedSpace H' M'\ninst✝ : TopologicalSpace X\nG : StructureGr... | [
410,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
402,
1
] |
Mathlib/Data/Bool/Basic.lean | Bool.and_elim_left | [
{
"state_after": "no goals",
"state_before": "⊢ ∀ {a b : Bool}, (a && b) = true → a = true",
"tactic": "decide"
}
] | [
173,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/Algebra/Order/Floor.lean | round_add_nat | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.256390\nα : Type u_1\nβ : Type ?u.256396\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nx : α\ny : ℕ\n⊢ round (x + ↑y) = round x + ↑y",
"tactic": "rw [round, round, fract_add_nat, Int.floor_add_nat, Int.ceil_add_nat, ← apply_ite₂, ite_self]"... | [
1380,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1379,
1
] |
Mathlib/Algebra/Hom/Group.lean | MonoidHom.coe_inj | [] | [
738,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
737,
1
] |
Mathlib/Algebra/Algebra/Basic.lean | Algebra.mul_sub_algebraMap_commutes | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nA : Type w\nB : Type ?u.536240\ninst✝² : CommSemiring R\ninst✝¹ : Ring A\ninst✝ : Algebra R A\nx : A\nr : R\n⊢ x * (x - ↑(algebraMap R A) r) = (x - ↑(algebraMap R A) r) * x",
"tactic": "rw [mul_sub, ← commutes, sub_mul]"
}
] | [
568,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
567,
1
] |
Mathlib/AlgebraicTopology/DoldKan/PInfty.lean | AlgebraicTopology.DoldKan.PInfty_f_naturality | [] | [
94,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.map_coe_ennreal_restrict | [] | [
775,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
773,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Type.lean | Equiv.Perm.IsCycle.cycleType | [] | [
109,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Data/Polynomial/Splits.lean | Polynomial.degree_eq_one_of_irreducible_of_splits | [
{
"state_after": "case inl\nF : Type u\nK : Type v\nL : Type w\ninst✝² : Field K\ninst✝¹ : Field L\ninst✝ : Field F\ni : K →+* L\np : K[X]\nhp : Irreducible p\nh✝ : map (RingHom.id K) p = 0\n⊢ degree p = 1\n\ncase inr\nF : Type u\nK : Type v\nL : Type w\ninst✝² : Field K\ninst✝¹ : Field L\ninst✝ : Field F\ni : ... | [
290,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
1
] |
Mathlib/Algebra/Algebra/Equiv.lean | AlgEquiv.mk_coe' | [] | [
360,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
358,
1
] |
Std/Data/List/Lemmas.lean | List.append_ne_nil_of_ne_nil_right | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ns t : List α\n⊢ t ≠ [] → s ++ t ≠ []",
"tactic": "simp_all"
}
] | [
115,
91
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
115,
1
] |
Mathlib/Analysis/NormedSpace/BoundedLinearMaps.lean | IsBoundedLinearMap.comp | [] | [
161,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
159,
1
] |
Mathlib/Algebra/Order/Sub/Canonical.lean | tsub_lt_tsub_iff_left_of_le_of_le | [] | [
289,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
286,
1
] |
Mathlib/Algebra/CharP/Basic.lean | NeZero.of_not_dvd | [] | [
746,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
745,
1
] |
Mathlib/LinearAlgebra/Determinant.lean | LinearMap.det_eq_det_toMatrix_of_finset | [
{
"state_after": "R : Type ?u.374035\ninst✝¹⁰ : CommRing R\nM : Type u_1\ninst✝⁹ : AddCommGroup M\ninst✝⁸ : Module R M\nM' : Type ?u.374626\ninst✝⁷ : AddCommGroup M'\ninst✝⁶ : Module R M'\nι : Type ?u.375168\ninst✝⁵ : DecidableEq ι\ninst✝⁴ : Fintype ι\ne : Basis ι R M\nA : Type u_2\ninst✝³ : CommRing A\ninst✝² ... | [
206,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Mul.lean | Differentiable.pow | [] | [
360,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
359,
1
] |
Mathlib/LinearAlgebra/Matrix/Transvection.lean | Matrix.Pivot.mul_listTransvecRow_last_col_take | [
{
"state_after": "case zero\nn : Type ?u.175750\np : Type ?u.175753\nR : Type u₂\n𝕜 : Type u_1\ninst✝³ : Field 𝕜\ninst✝² : DecidableEq n\ninst✝¹ : DecidableEq p\ninst✝ : CommRing R\nr : ℕ\nM : Matrix (Fin r ⊕ Unit) (Fin r ⊕ Unit) 𝕜\ni : Fin r ⊕ Unit\nk : ℕ\nhk✝ : k ≤ r\nhk : Nat.zero ≤ r\n⊢ (M ⬝ List.prod (L... | [
441,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
427,
1
] |
Mathlib/Data/MvPolynomial/Equiv.lean | MvPolynomial.support_finSuccEquiv_nonempty | [
{
"state_after": "R : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type ?u.1276068\na a' a₁ a₂ : R\ne : ℕ\ns : σ →₀ ℕ\ninst✝ : CommSemiring R\nn : ℕ\nf : MvPolynomial (Fin (n + 1)) R\nh : f ≠ 0\n⊢ ¬↑(finSuccEquiv R n) f = 0",
"state_before": "R : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type... | [
472,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
463,
1
] |
Mathlib/Data/Complex/Exponential.lean | Complex.ofReal_sin | [] | [
939,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
938,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Icc_self | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.71479\nα : Type u_1\ninst✝¹ : PartialOrder α\ninst✝ : LocallyFiniteOrder α\na✝ b c a : α\n⊢ Icc a a = {a}",
"tactic": "rw [← coe_eq_singleton, coe_Icc, Set.Icc_self]"
}
] | [
528,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
528,
1
] |
Mathlib/LinearAlgebra/Matrix/Reindex.lean | Matrix.det_reindexAlgEquiv | [] | [
172,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/RingTheory/Polynomial/Content.lean | Polynomial.isPrimitive_one | [] | [
56,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
1
] |
Mathlib/Probability/ProbabilityMassFunction/Constructions.lean | Pmf.bernoulli_apply | [] | [
312,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
312,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | NNReal.tsum_lt_tsum | [] | [
1216,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1214,
1
] |
Mathlib/Order/Filter/NAry.lean | Filter.image2_mem_map₂ | [] | [
64,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | IsMin.Iic_eq | [] | [
957,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
956,
1
] |
Mathlib/Algebra/Group/Units.lean | Units.mul_inv_eq_one | [] | [
379,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/Algebra/Ring/Equiv.lean | RingEquiv.toRingHom_trans | [] | [
762,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
760,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_bij_ne_one | [
{
"state_after": "case calc_1\nι : Type ?u.422672\nβ : Type u\nα : Type v\nγ : Type w\ns✝ s₁ s₂ : Finset α\na : α\nf✝ g✝ : α → β\ninst✝ : CommMonoid β\ns : Finset α\nt : Finset γ\nf : α → β\ng : γ → β\ni : (a : α) → a ∈ s → f a ≠ 1 → γ\nhi : ∀ (a : α) (h₁ : a ∈ s) (h₂ : f a ≠ 1), i a h₁ h₂ ∈ t\ni_inj :\n ∀ (a₁... | [
1167,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1140,
1
] |
Mathlib/LinearAlgebra/SesquilinearForm.lean | LinearMap.isSymm_iff_eq_flip | [
{
"state_after": "case mp\nR : Type u_1\nR₁ : Type ?u.168800\nR₂ : Type ?u.168803\nR₃ : Type ?u.168806\nM : Type u_2\nM₁ : Type ?u.168812\nM₂ : Type ?u.168815\nMₗ₁ : Type ?u.168818\nMₗ₁' : Type ?u.168821\nMₗ₂ : Type ?u.168824\nMₗ₂' : Type ?u.168827\nK : Type ?u.168830\nK₁ : Type ?u.168833\nK₂ : Type ?u.168836\n... | [
252,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
247,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Basis.lean | AffineBasis.affineCombination_coord_eq_self | [
{
"state_after": "ι : Type u_1\nι' : Type ?u.118805\nk : Type u_4\nV : Type u_3\nP : Type u_2\ninst✝⁴ : AddCommGroup V\ninst✝³ : AffineSpace V P\ninst✝² : Ring k\ninst✝¹ : Module k V\nb : AffineBasis ι k P\ns : Finset ι\ni j : ι\ne : ι ≃ ι'\ninst✝ : Fintype ι\nq : P\nhq : q ∈ affineSpan k (range ↑b)\n⊢ (↑(Finse... | [
224,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
216,
1
] |
Mathlib/Order/Bounds/Basic.lean | bot_mem_lowerBounds | [] | [
102,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/Algebra/Module/Basic.lean | int_smul_eq_zsmul | [
{
"state_after": "α : Type ?u.158540\nR : Type ?u.158543\nk : Type ?u.158546\nS : Type ?u.158549\nM : Type u_1\nM₂ : Type ?u.158555\nM₃ : Type ?u.158558\nι : Type ?u.158561\ninst✝⁴ : Semiring S\ninst✝³ : Ring R\ninst✝² : AddCommGroup M\ninst✝¹ : Module S M\ninst✝ : Module R M\nh : Module ℤ M\nn : ℤ\nx : M\n⊢ SM... | [
443,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
442,
1
] |
Std/Data/Rat/Lemmas.lean | Rat.neg_mkRat | [
{
"state_after": "no goals",
"state_before": "n : Int\nd : Nat\n⊢ -mkRat n d = mkRat (-n) d",
"tactic": "if z : d = 0 then simp [z] else simp [← normalize_eq_mkRat z, neg_normalize]"
},
{
"state_after": "no goals",
"state_before": "n : Int\nd : Nat\nz : d = 0\n⊢ -mkRat n d = mkRat (-n) d",
... | [
213,
79
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
212,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.