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/List/Forall2.lean | List.forall₂_map_left_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_3\nβ : Type u_2\nγ : Type u_1\nδ : Type ?u.20275\nR S : α → β → Prop\nP : γ → δ → Prop\nRₐ : α → α → Prop\nf : γ → α\nx✝ : List β\n⊢ Forall₂ R (map f []) x✝ ↔ Forall₂ (fun c b => R (f c) b) [] x✝",
"tactic": "simp only [map, forall₂_nil_left_iff]"... | [
127,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/LinearAlgebra/Eigenspace/Basic.lean | Module.End.HasEigenvector.apply_eq_smul | [] | [
105,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
1
] |
Mathlib/Algebra/Hom/Ring.lean | RingHom.coe_comp | [] | [
704,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
703,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Real.lean | Real.rpow_int_cast | [
{
"state_after": "no goals",
"state_before": "x✝ y z x : ℝ\nn : ℤ\n⊢ x ^ ↑n = x ^ n",
"tactic": "simp only [rpow_def, ← Complex.ofReal_zpow, Complex.cpow_int_cast, Complex.ofReal_int_cast,\n Complex.ofReal_re]"
}
] | [
356,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
354,
1
] |
src/lean/Init/Prelude.lean | eq_false_of_ne_true | [] | [
645,
20
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
643,
1
] |
Mathlib/Order/CompleteLattice.lean | sInf_image' | [] | [
740,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
739,
1
] |
Mathlib/Topology/Separation.lean | T0Space.of_open_cover | [] | [
364,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/AlgebraicGeometry/StructureSheaf.lean | AlgebraicGeometry.StructureSheaf.localizationToStalk_of | [] | [
486,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
484,
1
] |
Mathlib/Order/Heyting/Basic.lean | sdiff_le_sdiff_of_sup_le_sup_left | [
{
"state_after": "ι : Type ?u.142359\nα : Type u_1\nβ : Type ?u.142365\ninst✝ : GeneralizedCoheytingAlgebra α\na b c d : α\nh : c ⊔ a ≤ c ⊔ b\n⊢ (c ⊔ a) \\ c ≤ (c ⊔ b) \\ c",
"state_before": "ι : Type ?u.142359\nα : Type u_1\nβ : Type ?u.142365\ninst✝ : GeneralizedCoheytingAlgebra α\na b c d : α\nh : c ⊔ a ... | [
729,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
727,
1
] |
Mathlib/GroupTheory/Coset.lean | Subgroup.quotientMapOfLe_apply_mk | [] | [
736,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
734,
1
] |
Mathlib/Data/Real/NNReal.lean | NNReal.coe_zero | [] | [
175,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
11
] |
Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean | CategoryTheory.Limits.parallelPairHom_app_one | [] | [
278,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
275,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.comap_sup_comap_le | [] | [
1524,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1522,
1
] |
Mathlib/Topology/MetricSpace/Gluing.lean | Metric.Sum.dist_eq | [] | [
278,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
278,
1
] |
Mathlib/Topology/ContinuousOn.lean | ContinuousWithinAt.prod | [] | [
1062,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1059,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | HasSum.hasSum_iff_compl | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.426874\nδ : Type ?u.426877\ninst✝² : AddCommGroup α\ninst✝¹ : TopologicalSpace α\ninst✝ : TopologicalAddGroup α\nf g : β → α\na a₁ a₂ : α\ns : Set β\nhf : HasSum (f ∘ Subtype.val) a₁\n⊢ HasSum f (a₁ + (a₂ - a₁)) ↔ HasSum f... | [
863,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
861,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Basic.lean | BoxIntegral.Prepartition.eq_of_boxes_subset_iUnion_superset | [] | [
287,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | nnnorm_le_mul_nnnorm_add | [] | [
971,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
970,
1
] |
Mathlib/Data/Real/NNReal.lean | Real.le_coe_toNNReal | [] | [
134,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
133,
1
] |
src/lean/Init/Control/StateCps.lean | StateCpsT.runK_monadLift | [] | [
62,
88
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
61,
9
] |
Mathlib/Analysis/BoxIntegral/Partition/Tagged.lean | BoxIntegral.TaggedPrepartition.iUnion_disjUnion | [] | [
370,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
368,
1
] |
Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | intervalIntegral.integral_deriv_comp_mul_deriv' | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.1953788\n𝕜 : Type ?u.1953791\nE : Type ?u.1953794\nF : Type ?u.1953797\nA : Type ?u.1953800\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\ninst✝ : NormedSpace ℝ E\nf✝¹ : ℝ → E\ng'✝ g✝ φ : ℝ → ℝ\nf✝ f'✝ : ℝ → E\na b : ℝ\nf f' g g' : ℝ → ℝ\... | [
1511,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1505,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | dvd_gcd_iff | [] | [
331,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
329,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Submonoid.LocalizationMap.mul_inv_right | [
{
"state_after": "no goals",
"state_before": "M : Type u_1\ninst✝² : CommMonoid M\nS : Submonoid M\nN : Type u_2\ninst✝¹ : CommMonoid N\nP : Type ?u.375683\ninst✝ : CommMonoid P\nf : M →* N\nh : ∀ (y : { x // x ∈ S }), IsUnit (↑f ↑y)\ny : { x // x ∈ S }\nw z : N\n⊢ z = w * ↑(↑(IsUnit.liftRight (MonoidHom.re... | [
633,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
631,
1
] |
Mathlib/LinearAlgebra/Ray.lean | equiv_iff_sameRay | [] | [
249,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
248,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.pullback.hom_ext | [] | [
1275,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1272,
1
] |
Mathlib/MeasureTheory/Group/FundamentalDomain.lean | MeasureTheory.IsFundamentalDomain.measure_eq_tsum | [
{
"state_after": "no goals",
"state_before": "G : Type u_1\nH : Type ?u.237333\nα : Type u_2\nβ : Type ?u.237339\nE : Type ?u.237342\ninst✝¹⁰ : Group G\ninst✝⁹ : Group H\ninst✝⁸ : MulAction G α\ninst✝⁷ : MeasurableSpace α\ninst✝⁶ : MulAction H β\ninst✝⁵ : MeasurableSpace β\ninst✝⁴ : NormedAddCommGroup E\ns ... | [
301,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
299,
1
] |
Std/Data/Int/DivMod.lean | Int.neg_ediv_of_dvd | [
{
"state_after": "no goals",
"state_before": "b c : Int\n⊢ -(b * c) / b = -(b * c / b)",
"tactic": "if bz : b = 0 then simp [bz] else\nrw [Int.neg_mul_eq_mul_neg, Int.mul_ediv_cancel_left _ bz, Int.mul_ediv_cancel_left _ bz]"
},
{
"state_after": "no goals",
"state_before": "b c : Int\nbz : b... | [
803,
94
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
801,
1
] |
Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean | HomogeneousLocalization.NumDenSameDeg.num_neg | [] | [
218,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
217,
1
] |
Mathlib/Data/PNat/Prime.lean | PNat.prime_two | [] | [
126,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.IsNormal.limit_lt | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.106843\nβ : Type ?u.106846\nγ : Type ?u.106849\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nf : Ordinal → Ordinal\nH : IsNormal f\no : Ordinal\nh : IsLimit o\na : Ordinal\n⊢ ¬a < f o ↔ ¬∃ b, b < o ∧ a < f b",
"tactic": "simpa only [exis... | [
410,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
408,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.splitMax_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nx✝ : ℕ\nl : Ordnode α\nx : α\nls : ℕ\nll : Ordnode α\nlx : α\nlr : Ordnode α\n⊢ splitMax' l x (node ls ll lx lr) = (eraseMax (node x✝ l x (node ls ll lx lr)), findMax' x (node ls ll lx lr))",
"tactic": "rw [splitMax', splitMax_eq ls ll lx lr, f... | [
618,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
615,
1
] |
Mathlib/Data/Matrix/Notation.lean | Matrix.submatrix_updateColumn_succAbove | [] | [
400,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
398,
1
] |
Mathlib/Init/Logic.lean | left_comm | [] | [
536,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
531,
1
] |
Mathlib/Order/Hom/Basic.lean | OrderIso.bijective | [] | [
814,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
813,
11
] |
Mathlib/Analysis/Convex/Between.lean | Function.Injective.sbtw_map_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nV : Type u_2\nV' : Type u_4\nP : Type u_3\nP' : Type u_5\ninst✝⁶ : OrderedRing R\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P'\nx y z : P\nf : P →ᵃ[R] ... | [
169,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/Analysis/NormedSpace/IsROrC.lean | norm_smul_inv_norm' | [
{
"state_after": "𝕜 : Type u_2\ninst✝² : IsROrC 𝕜\nE : Type u_1\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace 𝕜 E\nr : ℝ\nr_nonneg : 0 ≤ r\nx : E\nhx : x ≠ 0\nthis : ‖x‖ ≠ 0\n⊢ ‖(↑r * (↑‖x‖)⁻¹) • x‖ = r",
"state_before": "𝕜 : Type u_2\ninst✝² : IsROrC 𝕜\nE : Type u_1\ninst✝¹ : NormedAddCommGroup ... | [
55,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
52,
1
] |
Mathlib/Data/Complex/Exponential.lean | Complex.exp_ofReal_mul_I_im | [
{
"state_after": "no goals",
"state_before": "x✝ y : ℂ\nx : ℝ\n⊢ (exp (↑x * I)).im = Real.sin x",
"tactic": "simp [exp_mul_I, sin_ofReal_re]"
}
] | [
1111,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1110,
1
] |
Mathlib/RingTheory/Localization/LocalizationLocalization.lean | IsLocalization.mem_localizationLocalizationSubmodule | [
{
"state_after": "R : Type u_1\ninst✝⁷ : CommRing R\nM : Submonoid R\nS : Type u_2\ninst✝⁶ : CommRing S\ninst✝⁵ : Algebra R S\nP : Type ?u.8605\ninst✝⁴ : CommRing P\nN : Submonoid S\nT : Type ?u.8769\ninst✝³ : CommRing T\ninst✝² : Algebra R T\ninst✝¹ : Algebra S T\ninst✝ : IsScalarTower R S T\nx : R\n⊢ (∃ y, y ... | [
64,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
56,
1
] |
Mathlib/CategoryTheory/CommSq.lean | CategoryTheory.CommSq.unop | [
{
"state_after": "no goals",
"state_before": "C : Type u_1\ninst✝ : Category C\nW✝ X✝ Y✝ Z✝ : C\nf✝ : W✝ ⟶ X✝\ng✝ : W✝ ⟶ Y✝\nh✝ : X✝ ⟶ Z✝\ni✝ : Y✝ ⟶ Z✝\nW X Y Z : Cᵒᵖ\nf : W ⟶ X\ng : W ⟶ Y\nh : X ⟶ Z\ni : Y ⟶ Z\np : CommSq f g h i\n⊢ i.unop ≫ g.unop = h.unop ≫ f.unop",
"tactic": "simp only [← unop_comp,... | [
74,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.subtypeEquivCodomain_symm_apply_ne | [] | [
1396,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1393,
1
] |
Mathlib/Algebra/AddTorsor.lean | Equiv.constVAdd_add | [] | [
426,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
425,
1
] |
Mathlib/Data/Polynomial/FieldDivision.lean | Polynomial.div_eq_zero_iff | [
{
"state_after": "R : Type u\nS : Type v\nk : Type y\nA : Type z\na b : R\nn : ℕ\ninst✝ : Field R\np q : R[X]\nhq0 : q ≠ 0\nh : p / q = 0\nthis : q * (p / q) + p % q = p\n⊢ degree p < degree q",
"state_before": "R : Type u\nS : Type v\nk : Type y\nA : Type z\na b : R\nn : ℕ\ninst✝ : Field R\np q : R[X]\nhq0... | [
249,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
241,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.ofNat_iff | [] | [
281,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
279,
1
] |
Mathlib/Data/Finsupp/AList.lean | Finsupp.toAList_lookupFinsupp | [
{
"state_after": "case h\nα : Type u_1\nM : Type u_2\ninst✝ : Zero M\nf : α →₀ M\na : α\n⊢ ↑(lookupFinsupp (Finsupp.toAList f)) a = ↑f a",
"state_before": "α : Type u_1\nM : Type u_2\ninst✝ : Zero M\nf : α →₀ M\n⊢ lookupFinsupp (Finsupp.toAList f) = f",
"tactic": "ext a"
},
{
"state_after": "cas... | [
138,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/RingTheory/Congruence.lean | RingCon.coe_add | [] | [
197,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
1
] |
Mathlib/Data/List/Basic.lean | List.sublist_of_cons_sublist_cons | [] | [
1057,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1055,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.sup_nat_cast | [] | [
2438,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2437,
1
] |
Mathlib/Init/CcLemmas.lean | or_eq_of_eq | [] | [
49,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
48,
1
] |
Mathlib/NumberTheory/Divisors.lean | Nat.fst_mem_divisors_of_mem_antidiagonal | [
{
"state_after": "n : ℕ\nx : ℕ × ℕ\nh : x.fst * x.snd = n ∧ n ≠ 0\n⊢ x.fst ∈ divisors n",
"state_before": "n : ℕ\nx : ℕ × ℕ\nh : x ∈ divisorsAntidiagonal n\n⊢ x.fst ∈ divisors n",
"tactic": "rw [mem_divisorsAntidiagonal] at h"
},
{
"state_after": "no goals",
"state_before": "n : ℕ\nx : ℕ × ℕ... | [
233,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/GroupTheory/OrderOfElement.lean | mem_powers_iff_mem_zpowers | [
{
"state_after": "no goals",
"state_before": "G : Type u\nA : Type v\nx y : G\na b : A\nn✝ m : ℕ\ninst✝² : Group G\ninst✝¹ : AddGroup A\ninst✝ : Finite G\nx✝ : y ∈ Submonoid.powers x\nn : ℕ\nhn : (fun x x_1 => x ^ x_1) x n = y\n⊢ (fun x x_1 => x ^ x_1) x ↑n = y",
"tactic": "simp_all"
},
{
"state... | [
819,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
813,
1
] |
Mathlib/Order/Filter/CountableInter.lean | countable_bInter_mem | [
{
"state_after": "ι✝ : Sort ?u.642\nα : Type u_2\nβ : Type ?u.648\nl : Filter α\ninst✝ : CountableInterFilter l\nι : Type u_1\nS : Set ι\nhS : Set.Countable S\ns : (i : ι) → i ∈ S → Set α\n⊢ (⋂ (x : ↑S), s ↑x (_ : ↑x ∈ S)) ∈ l ↔ ∀ (i : ι) (hi : i ∈ S), s i hi ∈ l",
"state_before": "ι✝ : Sort ?u.642\nα : Typ... | [
61,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/LinearAlgebra/Matrix/BilinearForm.lean | mem_skewAdjointMatricesSubmodule' | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.2705615\nM : Type ?u.2705618\ninst✝¹⁶ : Semiring R\ninst✝¹⁵ : AddCommMonoid M\ninst✝¹⁴ : Module R M\nR₁ : Type ?u.2705654\nM₁ : Type ?u.2705657\ninst✝¹³ : Ring R₁\ninst✝¹² : AddCommGroup M₁\ninst✝¹¹ : Module R₁ M₁\nR₂ : Type ?u.2706266\nM₂ : Type ?u.... | [
531,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
529,
1
] |
Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean | MeasureTheory.addHaarMeasure_eq_volume_pi | [
{
"state_after": "case h.e'_2\nι : Type u_1\ninst✝ : Fintype ι\n⊢ addHaarMeasure (piIcc01 ι) = ↑↑volume ↑(piIcc01 ι) • addHaarMeasure (piIcc01 ι)",
"state_before": "ι : Type u_1\ninst✝ : Fintype ι\n⊢ addHaarMeasure (piIcc01 ι) = volume",
"tactic": "convert (addHaarMeasure_unique volume (piIcc01 ι)).symm... | [
103,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
99,
1
] |
Mathlib/Data/List/Perm.lean | List.subperm_append_right | [] | [
717,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
716,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.support_bypass_subset | [
{
"state_after": "no goals",
"state_before": "case nil\nV : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\ninst✝ : DecidableEq V\nu v u✝ : V\n⊢ support (bypass nil) ⊆ support nil",
"tactic": "simp!"
},
{
"state_after": "case cons\nV : Type u\nV'... | [
1408,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1397,
1
] |
Mathlib/Order/Directed.lean | Directed.mono | [] | [
101,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Ioc_diff_Ioi | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.197772\ninst✝¹ : LinearOrder α\ninst✝ : LinearOrder β\nf : α → β\na a₁ a₂ b b₁ b₂ c d : α\n⊢ ∀ (x : α), x ∈ Ioc a b \\ Ioi c ↔ x ∈ Ioc a (min b c)",
"tactic": "simp (config := { contextual := true }) [iff_def]"
}
] | [
1821,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1820,
1
] |
Mathlib/CategoryTheory/Subobject/Basic.lean | CategoryTheory.Subobject.mk_le_of_comm | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝² : Category C\nX✝ Y Z : C\nD : Type u₂\ninst✝¹ : Category D\nB A : C\nX : Subobject B\nf : A ⟶ B\ninst✝ : Mono f\ng : A ⟶ underlying.obj X\nw : g ≫ arrow X = f\n⊢ ((underlyingIso f).hom ≫ g) ≫ arrow X = arrow (mk f)",
"tactic": "simp [w]"
... | [
280,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
278,
1
] |
Mathlib/Data/Stream/Init.lean | Stream'.mem_interleave_right | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nδ : Type w\na : α\ns₁ s₂ : Stream' α\nx✝ : a ∈ s₂\nn : ℕ\nh : (fun b => a = b) (nth s₂ n)\n⊢ (fun b => a = b) (nth (s₁ ⋈ s₂) (2 * n + 1))",
"tactic": "rw [h, nth_interleave_right]"
}
] | [
457,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
456,
1
] |
Mathlib/Topology/Semicontinuous.lean | IsOpen.upperSemicontinuousWithinAt_indicator | [] | [
755,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
753,
1
] |
Mathlib/Order/Closure.lean | LowerAdjoint.closure_union_closure_subset | [] | [
502,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
501,
1
] |
Mathlib/Analysis/SpecialFunctions/ExpDeriv.lean | Complex.hasStrictFDerivAt_exp_real | [] | [
80,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.some_add | [
{
"state_after": "case h\nα : Type u_2\nβ : Type ?u.319969\nγ : Type ?u.319972\nι : Type ?u.319975\nM : Type u_1\nM' : Type ?u.319981\nN : Type ?u.319984\nP : Type ?u.319987\nG : Type ?u.319990\nH : Type ?u.319993\nR : Type ?u.319996\nS : Type ?u.319999\ninst✝ : AddCommMonoid M\nf g : Option α →₀ M\na✝ : α\n⊢ ↑... | [
825,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
823,
1
] |
Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean | AffineIndependent.finrank_vectorSpan_image_finset | [
{
"state_after": "k : Type u_1\nV : Type u_2\nP : Type u_3\nι : Type u_4\ninst✝³ : DivisionRing k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\np : ι → P\nhi : AffineIndependent k p\ns : Finset ι\nn : ℕ\nhc : Finset.card s = n + 1\nhi' : AffineIndependent k fun x => ↑x\n⊢ finrank k { x... | [
119,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
105,
1
] |
Mathlib/Data/List/Basic.lean | List.head!_mem_head? | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.44039\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\ninst✝ : Inhabited α\nh : [] ≠ []\n⊢ head! [] ∈ head? []",
"tactic": "contradiction"
}
] | [
920,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
918,
1
] |
Mathlib/RingTheory/PolynomialAlgebra.lean | PolyEquivTensor.toFunLinear_mul_tmul_mul_aux_2 | [
{
"state_after": "R : Type u_1\nA : Type u_2\ninst✝² : CommSemiring R\ninst✝¹ : Semiring A\ninst✝ : Algebra R A\nk : ℕ\na₁ a₂ : A\np₁ p₂ : R[X]\n⊢ a₁ * (a₂ * ↑(algebraMap R A) (coeff (p₁ * p₂) k)) =\n a₁ *\n (a₂ *\n Finset.sum (Finset.Nat.antidiagonal k) fun x =>\n ↑(algebraMap R A) (coe... | [
96,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/GroupTheory/Perm/Basic.lean | Equiv.Perm.one_trans | [] | [
157,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Std/Data/Int/Lemmas.lean | Int.add_zero | [] | [
226,
19
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
224,
25
] |
Mathlib/LinearAlgebra/Matrix/Circulant.lean | Matrix.circulant_add | [] | [
118,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
116,
1
] |
Mathlib/Data/Sign.lean | SignType.neg_eq_self_iff | [
{
"state_after": "no goals",
"state_before": "a : SignType\n⊢ -a = a ↔ a = 0",
"tactic": "cases a <;> decide"
}
] | [
229,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
229,
1
] |
Mathlib/NumberTheory/PellMatiyasevic.lean | Pell.eq_pell_lem | [
{
"state_after": "a : ℕ\na1 : 1 < a\nn : ℕ\nb : ℤ√↑(Pell.d a1)\nh1 : 1 ≤ b\nhp : IsPell b\nh : b ≤ pellZd a1 (n + 1)\na1p : 0 ≤ { re := ↑a, im := 1 }\n⊢ Pell.d a1 ≤ a * a",
"state_before": "a : ℕ\na1 : 1 < a\nn : ℕ\nb : ℤ√↑(Pell.d a1)\nh1 : 1 ≤ b\nhp : IsPell b\nh : b ≤ pellZd a1 (n + 1)\na1p : 0 ≤ { re := ... | [
334,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
290,
1
] |
Mathlib/CategoryTheory/Monoidal/Category.lean | CategoryTheory.MonoidalCategory.tensorRightTensor_hom_app | [] | [
592,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
590,
1
] |
Std/Logic.lean | Or.neg_resolve_right | [] | [
274,
80
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
274,
1
] |
Mathlib/NumberTheory/Zsqrtd/Basic.lean | Zsqrtd.nonneg_mul | [
{
"state_after": "d : ℕ\na b : ℤ√↑d\nha✝ : Nonneg a\nhb : Nonneg b\nx y z w : ℕ\nha : Nonneg { re := -↑x, im := ↑y }\nx✝ : Nonneg { re := ↑z, im := ↑w }\n⊢ Nonneg ({ re := ↑z, im := ↑w } * { re := -↑x, im := ↑y })",
"state_before": "d : ℕ\na b : ℤ√↑d\nha✝ : Nonneg a\nhb : Nonneg b\nx y z w : ℕ\nha : Nonneg ... | [
863,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
828,
1
] |
Mathlib/CategoryTheory/Subobject/FactorThru.lean | CategoryTheory.Subobject.factors_add | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝² : Category C\nX✝ Y✝ Z : C\nD : Type u₂\ninst✝¹ : Category D\ninst✝ : Preadditive C\nX Y : C\nP : Subobject Y\nf g : X ⟶ Y\nwf : Factors P f\nwg : Factors P g\n⊢ (factorThru P f wf + factorThru P g wg) ≫ MonoOver.arrow (representative.obj P) =... | [
187,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
185,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Submonoid.LocalizationMap.map_id | [] | [
1204,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1203,
1
] |
Mathlib/Combinatorics/Hall/Finite.lean | Finset.all_card_le_biUnion_card_iff_existsInjective' | [
{
"state_after": "case mp\nι : Type u_1\nα : Type u_2\ninst✝¹ : Finite ι\ninst✝ : DecidableEq α\nt : ι → Finset α\n⊢ (∀ (s : Finset ι), card s ≤ card (Finset.biUnion s t)) → ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x\n\ncase mpr\nι : Type u_1\nα : Type u_2\ninst✝¹ : Finite ι\ninst✝ : DecidableEq α\nt : ι ... | [
272,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
260,
1
] |
Mathlib/Algebra/Order/Module.lean | strict_anti_smul_left | [] | [
115,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.erase_eq_self | [] | [
1903,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1902,
1
] |
Mathlib/Algebra/GeomSum.lean | geom_sum_zero | [] | [
60,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/Analysis/NormedSpace/Multilinear.lean | ContinuousMultilinearMap.norm_compContinuousLinearMapL_le | [] | [
1200,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1198,
1
] |
Mathlib/Algebra/Order/Ring/Defs.lean | zero_le_mul_right | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type ?u.104443\ninst✝ : LinearOrderedSemiring α\na b c d : α\nh : 0 < c\n⊢ 0 ≤ b * c ↔ 0 ≤ b",
"tactic": "simpa using (mul_le_mul_right h : 0 * c ≤ b * c ↔ 0 ≤ b)"
}
] | [
847,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
846,
1
] |
Mathlib/Order/SupIndep.lean | CompleteLattice.SetIndependent.disjoint_sSup | [
{
"state_after": "α : Type u_1\nβ : Type ?u.26451\nι : Type ?u.26454\nι' : Type ?u.26457\ninst✝ : CompleteLattice α\ns : Set α\nhs : SetIndependent s\nx : α\ny : Set α\nhx : x ∈ s\nhy : y ⊆ s\nhxy : ¬x ∈ y\nthis : Disjoint x (sSup (insert x y \\ {x}))\n⊢ Disjoint x (sSup y)",
"state_before": "α : Type u_1\n... | [
229,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
1
] |
Mathlib/ModelTheory/Semantics.lean | FirstOrder.Language.Term.realize_func | [] | [
89,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | Matrix.toLin'_toMatrix' | [] | [
336,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
334,
1
] |
Mathlib/Topology/SubsetProperties.lean | exists_compact_mem_nhds | [] | [
1162,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1160,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | AffineSubspace.eq_univ_of_subsingleton_span_eq_top | [
{
"state_after": "case intro\nk : Type u_2\nV : Type u_3\nP : Type u_1\ninst✝² : Ring k\ninst✝¹ : AddCommGroup V\ninst✝ : Module k V\nS : AffineSpace V P\np₁ p₂ : P\ns : Set P\nh₁ : Set.Subsingleton s\nh₂ : affineSpan k s = ⊤\np : P\nhp : p ∈ s\n⊢ s = univ",
"state_before": "k : Type u_2\nV : Type u_3\nP : ... | [
869,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
864,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Series.lean | Real.cos_eq_tsum | [] | [
117,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
116,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.productive_congr | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ns t : WSeq α\nh : s ~ʷ t\n⊢ (∀ (n : ℕ), Terminates (get? s n)) ↔ ∀ (n : ℕ), Terminates (get? t n)",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ns t : WSeq α\nh : s ~ʷ t\n⊢ Productive s ↔ Productive t",
"tactic": "simp only [productive_iff]"
... | [
1208,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1207,
1
] |
Mathlib/MeasureTheory/Integral/Bochner.lean | MeasureTheory.nndist_integral_add_measure_le_lintegral | [
{
"state_after": "α : Type u_2\nE : Type u_1\nF : Type ?u.1315198\n𝕜 : Type ?u.1315201\ninst✝¹⁰ : NormedAddCommGroup E\ninst✝⁹ : NormedSpace ℝ E\ninst✝⁸ : CompleteSpace E\ninst✝⁷ : NontriviallyNormedField 𝕜\ninst✝⁶ : NormedSpace 𝕜 E\ninst✝⁵ : SMulCommClass ℝ 𝕜 E\ninst✝⁴ : NormedAddCommGroup F\ninst✝³ : Norm... | [
1442,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1439,
1
] |
Mathlib/Data/Set/Intervals/Pi.lean | Set.image_update_Ioo_right | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nα : ι → Type u_2\ninst✝¹ : DecidableEq ι\ninst✝ : (i : ι) → PartialOrder (α i)\nf : (i : ι) → α i\ni : ι\nb : α i\n⊢ update f i '' Ioo (f i) b = Ioo f (update f i b)",
"tactic": "simpa using image_update_Ioo f i (f i) b"
}
] | [
192,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
191,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | HasSum.unique | [] | [
293,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
292,
1
] |
Mathlib/Analysis/Normed/Group/Seminorm.lean | GroupSeminorm.inf_apply | [] | [
426,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
425,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | gcd_greatest | [] | [
669,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
665,
1
] |
Mathlib/GroupTheory/GroupAction/SubMulAction.lean | SubMulAction.smul_of_tower_mem | [
{
"state_after": "S : Type u'\nT : Type u''\nR : Type u\nM : Type v\ninst✝⁴ : Monoid R\ninst✝³ : MulAction R M\ninst✝² : SMul S R\ninst✝¹ : SMul S M\ninst✝ : IsScalarTower S R M\np : SubMulAction R M\ns : S\nx : M\nh : x ∈ p\n⊢ (s • 1) • x ∈ p",
"state_before": "S : Type u'\nT : Type u''\nR : Type u\nM : Ty... | [
244,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
242,
1
] |
Mathlib/Algebra/Hom/Equiv/Units/Basic.lean | Units.mulLeft_symm | [] | [
76,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/Order/Atoms.lean | isAtomistic_dual_iff_isCoatomistic | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.18041\ninst✝ : CompleteLattice α\nh : IsAtomistic αᵒᵈ\nb : α\n⊢ ∃ s, b = sInf s ∧ ∀ (a : α), a ∈ s → IsCoatom a",
"tactic": "apply h.eq_sSup_atoms"
},
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ... | [
363,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
362,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.toList'_map | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nl : List α\ns : WSeq α\ns1 s2 : Computation (List α)\nh :\n ∃ l' s,\n s1 =\n Computation.corec\n (fun x =>\n match x with\n | (l, s) =>\n match Seq.destruct s with\n | none => Sum.inl (List.... | [
1330,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1306,
1
] |
Mathlib/AlgebraicGeometry/SheafedSpace.lean | AlgebraicGeometry.SheafedSpace.Γ_map | [] | [
216,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.