file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean | GromovHausdorff.exists_minimizer | [] | [
426,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
425,
9
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | ContinuousLinearMap.intervalIntegral_comp_comm | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.14661329\n𝕜 : Type u_1\nE : Type u_2\nF : Type u_3\nA : Type ?u.14661341\ninst✝⁸ : NormedAddCommGroup E\ninst✝⁷ : CompleteSpace E\ninst✝⁶ : NormedSpace ℝ E\na b : ℝ\nμ : MeasureTheory.Measure ℝ\nf : ℝ → E\ninst✝⁵ : IsROrC 𝕜\ninst✝⁴ : NormedSpace 𝕜... | [
680,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
678,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | re_inner_eq_norm_add_mul_self_sub_norm_sub_mul_self_div_four | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.2586554\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nx y : E\n⊢ ↑re (inner x y) = (‖x‖ * ‖x‖ + 2 * ↑re (inner x y) + ‖y‖ * ‖y‖ -... | [
1153,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1150,
1
] |
Mathlib/Data/Real/CauSeq.lean | CauSeq.le_sup_right | [] | [
960,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
959,
11
] |
Mathlib/CategoryTheory/Limits/Shapes/CommSq.lean | CategoryTheory.IsPushout.of_isColimit | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝ : Category C\nZ X Y P : C\nf : Z ⟶ X\ng : Z ⟶ Y\ninl : X ⟶ P\ninr : Y ⟶ P\nc : PushoutCocone f g\nh : IsColimit c\n⊢ PushoutCocone.inl c ≫ (Iso.refl c.pt).hom =\n PushoutCocone.inl\n (PushoutCocone.mk (PushoutCocone.inl c) (PushoutCoco... | [
361,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
357,
1
] |
Mathlib/Order/Bounds/Basic.lean | IsLUB.exists_between | [] | [
1124,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1122,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.mem_Ici_Ioi_of_subset_of_subset | [
{
"state_after": "α : Type u_1\nβ : Type ?u.49056\ninst✝ : PartialOrder α\na b c : α\ns : Set α\nho : Ioi a ⊆ s\nhc : s ⊆ Ici a\nh : a ∈ s\n⊢ Ioi a ⊆ s ∧ {a} ⊆ s",
"state_before": "α : Type u_1\nβ : Type ?u.49056\ninst✝ : PartialOrder α\na b c : α\ns : Set α\nho : Ioi a ⊆ s\nhc : s ⊆ Ici a\nh : a ∈ s\n⊢ Ici... | [
911,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
905,
1
] |
Mathlib/MeasureTheory/MeasurableSpace.lean | measurable_of_empty | [] | [
264,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
263,
1
] |
Mathlib/Combinatorics/Catalan.lean | Tree.treesOfNumNodesEq_card_eq_catalan | [
{
"state_after": "case hz\n\n⊢ card (treesOfNumNodesEq 0) = catalan 0\n\ncase hi\nn : ℕ\nih : ∀ (m : ℕ), m ≤ n → card (treesOfNumNodesEq m) = catalan m\n⊢ card (treesOfNumNodesEq (Nat.succ n)) = catalan (Nat.succ n)",
"state_before": "n : ℕ\n⊢ card (treesOfNumNodesEq n) = catalan n",
"tactic": "inductio... | [
229,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/RingTheory/RootsOfUnity/Basic.lean | IsPrimitiveRoot.primitiveRoots_one | [
{
"state_after": "M : Type ?u.2760785\nN : Type ?u.2760788\nG : Type ?u.2760791\nR : Type u_1\nS : Type ?u.2760797\nF : Type ?u.2760800\ninst✝⁴ : CommMonoid M\ninst✝³ : CommMonoid N\ninst✝² : DivisionCommMonoid G\nk l : ℕ\nζ : R\ninst✝¹ : CommRing R\ninst✝ : IsDomain R\n⊢ 1 ∈ primitiveRoots 1 R ∧ ∀ (x : R), x ∈... | [
613,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
607,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Multiequalizer.lean | CategoryTheory.Limits.Multicoequalizer.ι_sigmaπ | [
{
"state_after": "C : Type u\ninst✝³ : Category C\nI : MultispanIndex C\ninst✝² : HasMulticoequalizer I\ninst✝¹ : HasCoproduct I.left\ninst✝ : HasCoproduct I.right\nb : I.R\n⊢ Sigma.ι I.right b ≫ coequalizer.π (MultispanIndex.fstSigmaMap I) (MultispanIndex.sndSigmaMap I) =\n π I b ≫\n (colimit.isoColimi... | [
923,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
918,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.preimage_iInter | [
{
"state_after": "case h\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.224777\nι : Sort u_3\nι' : Sort ?u.224783\nι₂ : Sort ?u.224786\nκ : ι → Sort ?u.224791\nκ₁ : ι → Sort ?u.224796\nκ₂ : ι → Sort ?u.224801\nκ' : ι' → Sort ?u.224806\nf : α → β\ns : ι → Set β\nx✝ : α\n⊢ (x✝ ∈ f ⁻¹' ⋂ (i : ι), s i) ↔ x✝ ∈ ⋂ (i : ι), ... | [
1731,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1730,
1
] |
Mathlib/Data/Set/Semiring.lean | SetSemiring.up_down | [] | [
70,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
11
] |
Mathlib/Topology/ContinuousOn.lean | nhdsWithin_eq | [] | [
77,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.image_mul_left' | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.124190\nα : Type u_1\nβ : Type ?u.124196\nγ : Type ?u.124199\ninst✝ : Group α\ns t : Set α\na b : α\n⊢ (fun b => a⁻¹ * b) '' t = (fun b => a * b) ⁻¹' t",
"tactic": "simp"
}
] | [
1211,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1211,
1
] |
Mathlib/SetTheory/Ordinal/Principal.lean | Ordinal.principal_mul_one | [
{
"state_after": "⊢ 0 * 0 = 0",
"state_before": "⊢ Principal (fun x x_1 => x * x_1) 1",
"tactic": "rw [principal_one_iff]"
},
{
"state_after": "no goals",
"state_before": "⊢ 0 * 0 = 0",
"tactic": "exact zero_mul _"
}
] | [
283,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
281,
1
] |
Mathlib/Algebra/Hom/Equiv/Basic.lean | MulEquiv.apply_eq_iff_eq | [] | [
400,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
399,
1
] |
Std/Data/Int/Lemmas.lean | Int.natAbs_eq_zero | [] | [
147,
20
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
143,
9
] |
Mathlib/Order/Bounds/Basic.lean | IsGreatest.dual | [] | [
159,
4
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.coeToSubmodule_inj | [] | [
209,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
208,
1
] |
Std/Data/Int/DivMod.lean | Int.natAbs_dvd | [
{
"state_after": "no goals",
"state_before": "a b : Int\ne : a = ↑(natAbs a)\n⊢ ↑(natAbs a) ∣ b ↔ a ∣ b",
"tactic": "rw [← e]"
},
{
"state_after": "no goals",
"state_before": "a b : Int\ne : a = -↑(natAbs a)\n⊢ ↑(natAbs a) ∣ b ↔ a ∣ b",
"tactic": "rw [← Int.neg_dvd, ← e]"
}
] | [
654,
41
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
651,
1
] |
Mathlib/Data/Set/Basic.lean | Set.empty_union | [] | [
771,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
770,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.subtypeDomain_add | [] | [
1077,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1075,
1
] |
Mathlib/Order/Filter/Ultrafilter.lean | Ultrafilter.compl_mem_iff_not_mem | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type ?u.7567\nf g : Ultrafilter α\ns t : Set α\np q : α → Prop\n⊢ sᶜ ∈ f ↔ ¬s ∈ f",
"tactic": "rw [← compl_not_mem_iff, compl_compl]"
}
] | [
137,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/Algebra/Group/Semiconj.lean | Units.mk_semiconjBy | [
{
"state_after": "M : Type u_1\ninst✝ : Monoid M\nu : Mˣ\nx : M\n⊢ ↑u * x = ↑u * x * ↑u⁻¹ * ↑u",
"state_before": "M : Type u_1\ninst✝ : Monoid M\nu : Mˣ\nx : M\n⊢ SemiconjBy (↑u) x (↑u * x * ↑u⁻¹)",
"tactic": "unfold SemiconjBy"
},
{
"state_after": "no goals",
"state_before": "M : Type u_1\n... | [
249,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
248,
1
] |
Mathlib/SetTheory/Game/PGame.lean | PGame.rightMoves_add | [] | [
1480,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1479,
1
] |
Mathlib/Tactic/Ring/Basic.lean | Mathlib.Tactic.Ring.pow_one | [
{
"state_after": "no goals",
"state_before": "u : Lean.Level\nR : Type u_1\nα : Q(Type u)\nsα : Q(CommSemiring «$α»)\ninst✝ : CommSemiring R\na : R\n⊢ a ^ 1 = a",
"tactic": "simp"
}
] | [
659,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
659,
1
] |
Mathlib/LinearAlgebra/Alternating.lean | AlternatingMap.coe_multilinearMap | [] | [
163,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/Data/Matrix/Block.lean | Matrix.toBlocks_fromBlocks₂₁ | [] | [
122,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
120,
1
] |
Mathlib/Topology/Sequences.lean | IsSeqCompact.totallyBounded | [
{
"state_after": "X : Type u_1\nY : Type ?u.15129\ninst✝ : UniformSpace X\ns : Set X\nh : IsSeqCompact s\nV : Set (X × X)\nV_in : V ∈ 𝓤 X\n⊢ ∃ t, Set.Finite t ∧ s ⊆ ⋃ (y : X) (_ : y ∈ t), {x | (x, y) ∈ V}",
"state_before": "X : Type u_1\nY : Type ?u.15129\ninst✝ : UniformSpace X\ns : Set X\nh : IsSeqCompac... | [
350,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
340,
11
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.countp_nsmul | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.300349\nγ : Type ?u.300352\np : α → Prop\ninst✝ : DecidablePred p\ns : Multiset α\nn : ℕ\n⊢ countp p (n • s) = n * countp p s",
"tactic": "induction n <;> simp [*, succ_nsmul', succ_mul, zero_nsmul]"
}
] | [
2240,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2239,
1
] |
Mathlib/CategoryTheory/Subobject/Basic.lean | CategoryTheory.Subobject.underlyingIso_arrow | [] | [
239,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | Complex.cos_int_mul_two_pi_sub | [] | [
1260,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1259,
1
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | LinearIsometryEquiv.congr_fun | [] | [
592,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
591,
11
] |
Mathlib/Order/Hom/CompleteLattice.lean | sSupHom.coe_comp | [] | [
319,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
318,
1
] |
Mathlib/Algebra/Group/UniqueProds.lean | UniqueMul.mulHom_preimage | [
{
"state_after": "G : Type u_1\nH : Type u_2\ninst✝¹ : Mul G\ninst✝ : Mul H\nA✝ B✝ : Finset G\na0✝ b0✝ : G\nf : G →ₙ* H\nhf : Function.Injective ↑f\na0 b0 : G\nA B : Finset H\nu : UniqueMul A B (↑f a0) (↑f b0)\na b : G\nha : a ∈ Finset.preimage A ↑f (_ : Set.InjOn (↑f) (↑f ⁻¹' ↑A))\nhb : b ∈ Finset.preimage B ↑... | [
120,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Mathlib/Analysis/LocallyConvex/WeakDual.lean | LinearMap.toSeminormFamily_apply | [] | [
89,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
88,
1
] |
Mathlib/Order/Basic.lean | Pi.lt_def | [
{
"state_after": "no goals",
"state_before": "ι✝ : Type ?u.46874\nα✝ : Type u\nβ : Type v\nγ : Type w\nπ : ι✝ → Type ?u.46885\nr : α✝ → α✝ → Prop\nι : Type u\nα : ι → Type v\ninst✝ : (i : ι) → Preorder (α i)\nx y : (i : ι) → α i\n⊢ x < y ↔ x ≤ y ∧ ∃ i, x i < y i",
"tactic": "simp (config := { contextual... | [
809,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
807,
1
] |
Mathlib/FieldTheory/Minpoly/Basic.lean | minpoly.map_ne_one | [
{
"state_after": "case pos\nA : Type u_3\nB : Type u_1\nB' : Type ?u.27580\ninst✝⁷ : CommRing A\ninst✝⁶ : Ring B\ninst✝⁵ : Ring B'\ninst✝⁴ : Algebra A B\ninst✝³ : Algebra A B'\nx : B\ninst✝² : Nontrivial B\nR : Type u_2\ninst✝¹ : Semiring R\ninst✝ : Nontrivial R\nf : A →+* R\nhx : IsIntegral A x\n⊢ map f (minpo... | [
106,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | Real.surjOn_sin | [
{
"state_after": "no goals",
"state_before": "⊢ SurjOn sin (Icc (-(π / 2)) (π / 2)) (Icc (-1) 1)",
"tactic": "simpa only [sin_neg, sin_pi_div_two] using\n intermediate_value_Icc (neg_le_self pi_div_two_pos.le) continuous_sin.continuousOn"
}
] | [
620,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
618,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | contDiffWithinAt_of_subsingleton | [
{
"state_after": "𝕜 : Type u_1\ninst✝¹¹ : NontriviallyNormedField 𝕜\nD : Type uD\ninst✝¹⁰ : NormedAddCommGroup D\ninst✝⁹ : NormedSpace 𝕜 D\nE : Type uE\ninst✝⁸ : NormedAddCommGroup E\ninst✝⁷ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁶ : NormedAddCommGroup F\ninst✝⁵ : NormedSpace 𝕜 F\nG : Type uG\ninst✝⁴ : Norme... | [
121,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
120,
1
] |
Mathlib/AlgebraicTopology/SimplicialObject.lean | CategoryTheory.SimplicialObject.eqToIso_refl | [
{
"state_after": "case w\nC : Type u\ninst✝ : Category C\nX : SimplicialObject C\nn : ℕ\nh : n = n\n⊢ (eqToIso X h).hom = (Iso.refl (X.obj [n].op)).hom",
"state_before": "C : Type u\ninst✝ : Category C\nX : SimplicialObject C\nn : ℕ\nh : n = n\n⊢ eqToIso X h = Iso.refl (X.obj [n].op)",
"tactic": "ext"
... | [
106,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/CategoryTheory/Category/Preorder.lean | CategoryTheory.leOfHom | [] | [
91,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean | ofSet_mem_contDiffGroupoid | [
{
"state_after": "m n : ℕ∞\n𝕜 : Type u_2\ninst✝⁴ : NontriviallyNormedField 𝕜\nE : Type u_3\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedSpace 𝕜 E\nH : Type u_1\ninst✝¹ : TopologicalSpace H\nI : ModelWithCorners 𝕜 E H\nM : Type ?u.103687\ninst✝ : TopologicalSpace M\ns : Set H\nhs : IsOpen s\n⊢ Pregroupoid.... | [
595,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
589,
1
] |
Mathlib/NumberTheory/LucasLehmer.lean | modEq_mersenne | [
{
"state_after": "no goals",
"state_before": "n k : ℕ\n⊢ 1 * (k / 2 ^ n) + k % 2 ^ n = k / 2 ^ n + k % 2 ^ n",
"tactic": "rw [one_mul]"
}
] | [
601,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
595,
1
] |
Mathlib/Algebra/Order/Floor.lean | Nat.le_of_ceil_le | [] | [
344,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
343,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Set.Finite.toFinset_one | [] | [
2193,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2192,
1
] |
src/lean/Init/Data/Array/BasicAux.lean | List.size_toArrayAux | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nas : List α\nbs : Array α\n⊢ Array.size (toArrayAux as bs) = length as + Array.size bs",
"tactic": "induction as generalizing bs with\n| nil => simp [toArrayAux]\n| cons a as ih => simp_arith [toArrayAux, *]"
},
{
"state_after": "no goa... | [
20,
47
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
17,
9
] |
Mathlib/Data/Finset/Basic.lean | Finset.coe_eq_pair | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.109653\nγ : Type ?u.109656\ninst✝ : DecidableEq α\ns✝ t u v : Finset α\na✝ b✝ : α\ns : Finset α\na b : α\n⊢ ↑s = {a, b} ↔ s = {a, b}",
"tactic": "rw [← coe_pair, coe_inj]"
}
] | [
1129,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1128,
1
] |
Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean | Matrix.isAdjMatrix_compl | [
{
"state_after": "no goals",
"state_before": "V : Type u_2\nα : Type u_1\nβ : Type ?u.16625\ninst✝³ : DecidableEq α\ninst✝² : DecidableEq V\nA : Matrix V V α\ninst✝¹ : Zero α\ninst✝ : One α\nh : IsSymm A\n⊢ IsSymm (compl A)",
"tactic": "simp [h]"
}
] | [
125,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Topology/Covering.lean | IsFiberBundle.isCoveringMap | [] | [
188,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
185,
11
] |
Mathlib/Data/Complex/Basic.lean | Complex.one_im | [] | [
173,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Mathlib/Logic/Equiv/Defs.lean | Equiv.apply_eq_iff_eq_symm_apply | [
{
"state_after": "α : Sort u\nβ : Sort v\nγ : Sort w\nx : α\ny : (fun x => β) x\nf : α ≃ β\n⊢ ↑f x = ↑f (↑f.symm y) ↔ x = ↑f.symm y",
"state_before": "α : Sort u\nβ : Sort v\nγ : Sort w\nx : α\ny : (fun x => β) x\nf : α ≃ β\n⊢ ↑f x = y ↔ x = ↑f.symm y",
"tactic": "conv_lhs => rw [← apply_symm_apply f y]... | [
309,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
307,
1
] |
Mathlib/Algebra/TrivSqZeroExt.lean | TrivSqZeroExt.algebraMap_eq_inl | [] | [
763,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
762,
1
] |
Mathlib/Data/Real/EReal.lean | EReal.coe_add_top | [] | [
669,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
668,
1
] |
Mathlib/Data/Fin/Tuple/Basic.lean | Fin.insertNth_zero | [
{
"state_after": "m n : ℕ\nα : Fin (n + 1) → Type u\nβ : Type v\nx : α 0\np : (j : Fin n) → α (↑(succAbove 0) j)\n⊢ p = fun j => cons x (fun j => _root_.cast (_ : α (↑(succAbove 0) j) = α (succ j)) (p j)) (↑(succAbove 0) j)",
"state_before": "m n : ℕ\nα : Fin (n + 1) → Type u\nβ : Type v\nx : α 0\np : (j : ... | [
727,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
722,
1
] |
Mathlib/Data/Fintype/Basic.lean | Finset.univ_inter | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.21194\nγ : Type ?u.21197\ninst✝¹ : Fintype α\ns✝ t : Finset α\ninst✝ : DecidableEq α\ns : Finset α\na : α\n⊢ a ∈ univ ∩ s ↔ a ∈ s",
"tactic": "simp"
}
] | [
275,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
274,
1
] |
Mathlib/Data/List/ProdSigma.lean | List.product_nil | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nhead✝ : α\nl : List α\n⊢ (head✝ :: l) ×ˢ [] = []",
"tactic": "simp [product_cons, product_nil]"
}
] | [
43,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
41,
1
] |
Mathlib/Combinatorics/Quiver/Cast.lean | Quiver.hom_cast_eq_of_cons_eq_cons | [
{
"state_after": "U : Type u_1\ninst✝ : Quiver U\nu v v' w : U\np : Path u v\np' : Path u v'\ne : v ⟶ w\ne' : v' ⟶ w\nh : cons p e = cons p' e'\n⊢ HEq e e'",
"state_before": "U : Type u_1\ninst✝ : Quiver U\nu v v' w : U\np : Path u v\np' : Path u v'\ne : v ⟶ w\ne' : v' ⟶ w\nh : cons p e = cons p' e'\n⊢ Hom.... | [
148,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/RingTheory/Coprime/Basic.lean | IsCoprime.of_add_mul_left_right | [
{
"state_after": "R : Type u\ninst✝ : CommSemiring R\nx y z : R\nh : IsCoprime (y + x * z) x\n⊢ IsCoprime y x",
"state_before": "R : Type u\ninst✝ : CommSemiring R\nx y z : R\nh : IsCoprime x (y + x * z)\n⊢ IsCoprime x y",
"tactic": "rw [isCoprime_comm] at h⊢"
},
{
"state_after": "no goals",
... | [
196,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/CategoryTheory/Preadditive/FunctorCategory.lean | CategoryTheory.NatTrans.app_add | [] | [
92,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/Topology/MetricSpace/Baire.lean | IsGδ.dense_sUnion_interior_of_closed | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.27075\nγ : Type ?u.27078\nι : Type ?u.27081\ninst✝¹ : TopologicalSpace α\ninst✝ : BaireSpace α\nT : Set (Set α)\ns : Set α\nhs : IsGδ s\nhd : Dense s\nhc : Set.Countable T\nhc' : ∀ (t : Set α), t ∈ T → IsClosed t\nhU : s ⊆ ⋃₀ T\n⊢ s ⊆ ⋃... | [
327,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
324,
1
] |
Mathlib/LinearAlgebra/TensorProduct.lean | TensorProduct.map_mul | [] | [
780,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
778,
1
] |
Mathlib/Dynamics/FixedPoints/Basic.lean | Function.bijOn_fixedPoints_comp | [] | [
179,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
177,
1
] |
Mathlib/Topology/ContinuousOn.lean | ContinuousWithinAt.fst | [] | [
1279,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1277,
1
] |
Mathlib/Analysis/NormedSpace/Multilinear.lean | ContinuousMultilinearMap.le_op_norm_mul_pow_of_le | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u\nι : Type v\nι' : Type v'\nn : ℕ\nE : ι → Type wE\nE₁ : ι → Type wE₁\nE' : ι' → Type wE'\nEi✝ : Fin (Nat.succ n) → Type wEi\nG : Type wG\nG' : Type wG'\ninst✝¹⁹ : Fintype ι\ninst✝¹⁸ : Fintype ι'\ninst✝¹⁷ : NontriviallyNormedField 𝕜\ninst✝¹⁶ : (i : ι... | [
461,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
457,
1
] |
Mathlib/Data/Prod/Basic.lean | Prod.map_surjective | [
{
"state_after": "α : Type u_4\nβ : Type u_3\nγ : Type u_1\nδ : Type u_2\ninst✝¹ : Nonempty γ\ninst✝ : Nonempty δ\nf : α → γ\ng : β → δ\nh : Surjective (map f g)\nc : γ\ninhabited_h : Inhabited δ\n⊢ ∃ a, f a = c",
"state_before": "α : Type u_4\nβ : Type u_3\nγ : Type u_1\nδ : Type u_2\ninst✝¹ : Nonempty γ\n... | [
376,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
365,
1
] |
Mathlib/Data/MvPolynomial/Expand.lean | MvPolynomial.expand_comp_bind₁ | [
{
"state_after": "case hf\nσ : Type u_3\nτ : Type u_1\nR : Type u_2\nS : Type ?u.129297\ninst✝¹ : CommSemiring R\ninst✝ : CommSemiring S\np : ℕ\nf : σ → MvPolynomial τ R\n⊢ ∀ (i : σ), ↑(AlgHom.comp (expand p) (bind₁ f)) (X i) = ↑(bind₁ fun i => ↑(expand p) (f i)) (X i)",
"state_before": "σ : Type u_3\nτ : T... | [
73,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Std/Data/Int/DivMod.lean | Int.div_eq_of_eq_mul_left | [
{
"state_after": "no goals",
"state_before": "a b c : Int\nH1 : b ≠ 0\nH2 : a = c * b\n⊢ a = b * c",
"tactic": "rw [Int.mul_comm, H2]"
}
] | [
781,
59
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
779,
11
] |
Mathlib/Analysis/BoxIntegral/Partition/Tagged.lean | BoxIntegral.TaggedPrepartition.distortion_le_iff | [] | [
429,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
428,
1
] |
Mathlib/MeasureTheory/Function/Jacobian.lean | MeasureTheory.integrableOn_image_iff_integrableOn_abs_det_fderiv_smul | [
{
"state_after": "E : Type u_1\nF : Type u_2\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace ℝ E\ninst✝⁵ : FiniteDimensional ℝ E\ninst✝⁴ : NormedAddCommGroup F\ninst✝³ : NormedSpace ℝ F\ns : Set E\nf : E → E\nf' : E → E →L[ℝ] E\ninst✝² : MeasurableSpace E\ninst✝¹ : BorelSpace E\nμ : Measure E\ninst✝ : IsAd... | [
1204,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1191,
1
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.coe_commutes | [] | [
1058,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1057,
1
] |
Mathlib/Probability/Kernel/Basic.lean | ProbabilityTheory.kernel.ext | [] | [
183,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
183,
1
] |
Mathlib/Order/UpperLower/Basic.lean | UpperSet.compl_iInf₂ | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.85665\nγ : Type ?u.85668\nι : Sort u_2\nκ : ι → Sort u_3\ninst✝ : LE α\ns t : UpperSet α\na : α\nf : (i : ι) → κ i → UpperSet α\n⊢ compl (⨅ (i : ι) (j : κ i), f i j) = ⨅ (i : ι) (j : κ i), compl (f i j)",
"tactic": "simp_rw [UpperSe... | [
863,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
862,
1
] |
Mathlib/Algebra/Star/Pointwise.lean | Set.Nonempty.star | [] | [
58,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/Logic/Equiv/Set.lean | Equiv.prod_assoc_preimage | [
{
"state_after": "case h\nα✝ : Sort u\nβ✝ : Sort v\nγ✝ : Sort w\nα : Type u_1\nβ : Type u_2\nγ : Type u_3\ns : Set α\nt : Set β\nu : Set γ\nx✝ : (α × β) × γ\n⊢ x✝ ∈ ↑(prodAssoc α β γ) ⁻¹' s ×ˢ t ×ˢ u ↔ x✝ ∈ (s ×ˢ t) ×ˢ u",
"state_before": "α✝ : Sort u\nβ✝ : Sort v\nγ✝ : Sort w\nα : Type u_1\nβ : Type u_2\nγ... | [
143,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/Topology/ShrinkingLemma.lean | ShrinkingLemma.PartialRefinement.mem_find_carrier_iff | [
{
"state_after": "ι : Type u_2\nX : Type u_1\ninst✝¹ : TopologicalSpace X\ninst✝ : NormalSpace X\nu : ι → Set X\ns : Set X\nc : Set (PartialRefinement u s)\ni : ι\nne : Set.Nonempty c\n⊢ i ∈ (if hi : ∃ v, v ∈ c ∧ i ∈ v.carrier then Exists.choose hi else Set.Nonempty.some ne).carrier ↔\n i ∈ chainSupCarrier c... | [
135,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/CategoryTheory/Bicategory/Free.lean | CategoryTheory.FreeBicategory.mk_left_unitor_inv | [] | [
295,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
294,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.dual_node' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nl : Ordnode α\nx : α\nr : Ordnode α\n⊢ dual (node' l x r) = node' (dual r) x (dual l)",
"tactic": "simp [node', add_comm]"
}
] | [
312,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
311,
1
] |
Mathlib/ModelTheory/Substructures.lean | FirstOrder.Language.Hom.mem_range | [] | [
834,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
833,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/ZeroMorphisms.lean | CategoryTheory.Limits.zero_of_target_iso_zero' | [] | [
400,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
399,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.insert_sdiff_insert | [] | [
2188,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2187,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Pointwise.lean | Subalgebra.pointwise_smul_toSubmodule | [] | [
102,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Data/Set/Function.lean | Set.RightInvOn.eq | [] | [
1109,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1108,
1
] |
Mathlib/Data/Nat/Order/Basic.lean | Nat.bit0_le | [] | [
688,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
687,
11
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Ioo_inter_Ioc_of_left_le | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.196535\ninst✝¹ : LinearOrder α\ninst✝ : LinearOrder β\nf : α → β\na a₁ a₂ b b₁ b₂ c d : α\nh : b₁ ≤ b₂\n⊢ Ioo a₁ b₁ ∩ Ioc a₂ b₂ = Ioo (max a₁ a₂) b₁",
"tactic": "rw [inter_comm, Ioc_inter_Ioo_of_right_le h, max_comm]"
}
] | [
1807,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1806,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.natDegree_monomial | [
{
"state_after": "case inl\nR : Type u\nS : Type v\na b c d : R\nn m : ℕ\ninst✝¹ : Semiring R\np q r✝ : R[X]\ninst✝ : DecidableEq R\ni : ℕ\nr : R\nhr : r = 0\n⊢ natDegree (↑(monomial i) r) = 0\n\ncase inr\nR : Type u\nS : Type v\na b c d : R\nn m : ℕ\ninst✝¹ : Semiring R\np q r✝ : R[X]\ninst✝ : DecidableEq R\ni... | [
331,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
327,
1
] |
Std/Data/Int/Lemmas.lean | Int.add_left_cancel | [
{
"state_after": "a b c : Int\nh : a + b = a + c\nh₁ : -a + (a + b) = -a + (a + c)\n⊢ b = c",
"state_before": "a b c : Int\nh : a + b = a + c\n⊢ b = c",
"tactic": "have h₁ : -a + (a + b) = -a + (a + c) := by rw [h]"
},
{
"state_after": "a b c : Int\nh : a + b = a + c\nh₁ : b = c\n⊢ b = c",
"... | [
331,
73
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
329,
11
] |
Mathlib/Data/List/Func.lean | List.Func.eq_get_of_mem | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\na✝ : α\nas as1 as2 as3 : List α\ninst✝¹ : Inhabited α\ninst✝ : Inhabited β\na : α\nh : a ∈ []\n⊢ ∃ n, a = get n []",
"tactic": "cases h"
},
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\na✝ : α\nas✝ as1 as2 ... | [
145,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Concrete.lean | Equiv.Perm.toCycle_eq_toList | [
{
"state_after": "α : Type u_1\ninst✝¹ : Fintype α\ninst✝ : DecidableEq α\np : Perm α\nx✝ : α\nf : Perm α\nhf : IsCycle f\nx : α\nhx : ↑f x ≠ x\nkey : Finset.univ.val = x ::ₘ Multiset.erase Finset.univ.val x\n⊢ toCycle f hf = ↑(toList f x)",
"state_before": "α : Type u_1\ninst✝¹ : Fintype α\ninst✝ : Decidab... | [
415,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
411,
1
] |
Mathlib/Algebra/Order/Sub/Canonical.lean | AddLECancellable.tsub_right_inj | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝² : CanonicallyOrderedAddMonoid α\ninst✝¹ : Sub α\ninst✝ : OrderedSub α\na b c d : α\nha : AddLECancellable a\nhb : AddLECancellable b\nhc : AddLECancellable c\nhba : b ≤ a\nhca : c ≤ a\n⊢ a - b = a - c ↔ b = c",
"tactic": "simp_rw [le_ant... | [
377,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
374,
11
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.IsNormal.limit_le | [] | [
405,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
403,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | Summable.prod_symm | [] | [
233,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
232,
1
] |
Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean | Basis.parallelepiped_basisFun | [
{
"state_after": "case refine'_1\nι : Type u_1\ninst✝ : Fintype ι\n⊢ ↑(parallelepiped (Pi.basisFun ℝ ι)) = uIcc (fun i => 0) fun i => 1\n\ncase refine'_2\nι : Type u_1\ninst✝ : Fintype ι\n⊢ (fun i => 0) ≤ fun i => 1",
"state_before": "ι : Type u_1\ninst✝ : Fintype ι\n⊢ ↑(parallelepiped (Pi.basisFun ℝ ι)) = ... | [
82,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.ncard_le_ncard_diff_add_ncard | [
{
"state_after": "case inl\nα : Type u_1\nβ : Type ?u.124878\ns✝ t✝ : Set α\na b x y : α\nf : α → β\ns t : Set α\nht : autoParam (Set.Finite t) _auto✝\nh : Set.Finite s\n⊢ ncard s ≤ ncard (s \\ t) + ncard t\n\ncase inr\nα : Type u_1\nβ : Type ?u.124878\ns✝ t✝ : Set α\na b x y : α\nf : α → β\ns t : Set α\nht : a... | [
515,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
508,
1
] |
Mathlib/CategoryTheory/GlueData.lean | CategoryTheory.GlueData.diagram_sndFrom | [] | [
171,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/Algebra/Module/Basic.lean | Module.nontrivial | [] | [
338,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
336,
11
] |
Mathlib/CategoryTheory/Idempotents/Karoubi.lean | CategoryTheory.Idempotents.Karoubi.coe_p | [
{
"state_after": "no goals",
"state_before": "C : Type u_2\ninst✝ : Category C\nX : C\n⊢ (mk X (𝟙 X)).p = 𝟙 X",
"tactic": "rfl"
}
] | [
143,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.max_of_mem | [
{
"state_after": "case intro.intro\nF : Type ?u.313391\nα : Type u_1\nβ : Type ?u.313397\nγ : Type ?u.313400\nι : Type ?u.313403\nκ : Type ?u.313406\ninst✝ : LinearOrder α\ns : Finset α\na : α\nh✝ : a ∈ s\nb : α\nh : b ∈ sup s some\nright✝ : a ≤ b\n⊢ ∃ b, Finset.max s = ↑b",
"state_before": "F : Type ?u.313... | [
1182,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1180,
1
] |
Mathlib/Analysis/Convex/Between.lean | mem_const_vsub_affineSegment | [
{
"state_after": "no goals",
"state_before": "R : Type u_3\nV : Type u_1\nV' : Type ?u.53134\nP : Type u_2\nP' : Type ?u.53140\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 : P\n... | [
133,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
131,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.