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/MeasureTheory/Measure/Lebesgue/EqHaar.lean | MeasureTheory.Measure.add_haar_preimage_linearEquiv | [
{
"state_after": "E : Type u_1\ninst✝⁸ : NormedAddCommGroup E\ninst✝⁷ : NormedSpace ℝ E\ninst✝⁶ : MeasurableSpace E\ninst✝⁵ : BorelSpace E\ninst✝⁴ : FiniteDimensional ℝ E\nμ : Measure E\ninst✝³ : IsAddHaarMeasure μ\nF : Type ?u.1469836\ninst✝² : NormedAddCommGroup F\ninst✝¹ : NormedSpace ℝ F\ninst✝ : CompleteSp... | [
278,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
274,
1
] |
Mathlib/Algebra/Lie/Solvable.lean | Function.Surjective.lieAlgebra_isSolvable | [
{
"state_after": "case mk.intro\nR : Type u\nL : Type v\nM : Type w\nL' : Type w₁\ninst✝⁴ : CommRing R\ninst✝³ : LieRing L\ninst✝² : LieAlgebra R L\ninst✝¹ : LieRing L'\ninst✝ : LieAlgebra R L'\nI J : LieIdeal R L\nf : L' →ₗ⁅R⁆ L\nh₁ : IsSolvable R L'\nh₂ : Surjective ↑f\nk : ℕ\nhk : derivedSeries R L' k = ⊥\n⊢... | [
240,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/CategoryTheory/Preadditive/Basic.lean | CategoryTheory.Preadditive.epi_of_cokernel_zero | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝² : Category C\ninst✝¹ : Preadditive C\nP Q R : C\nf✝ f' : P ⟶ Q\ng✝ g' : Q ⟶ R\nX Y : C\nf : X ⟶ Y\ninst✝ : HasColimit (parallelPair f 0)\nw : cokernel.π f = 0\nR✝ : C\ng : Y ⟶ R✝\nh : f ≫ g = 0\n⊢ g = 0",
"tactic": "rw [← cokernel.π_desc f... | [
262,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
260,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Types.lean | CategoryTheory.Limits.Types.unique_of_type_equalizer | [
{
"state_after": "X Y Z : Type u\nf : X ⟶ Y\ng h : Y ⟶ Z\nw : f ≫ g = f ≫ h\nt : IsLimit (Fork.ofι f w)\ny : Y\nhy : g y = h y\ny' : PUnit ⟶ Y := fun x => y\n⊢ ∃! x, f x = y",
"state_before": "X Y Z : Type u\nf : X ⟶ Y\ng h : Y ⟶ Z\nw : f ≫ g = f ≫ h\nt : IsLimit (Fork.ofι f w)\ny : Y\nhy : g y = h y\n⊢ ∃! ... | [
413,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
403,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.succ_eq_last_succ | [
{
"state_after": "no goals",
"state_before": "n✝ m n : ℕ\ni : Fin (Nat.succ n)\n⊢ succ i = last (n + 1) ↔ i = last n",
"tactic": "rw [← succ_last, (succ_injective _).eq_iff]"
}
] | [
1244,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1243,
1
] |
Mathlib/Topology/Order/Basic.lean | pi_Ioc_mem_nhds | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ninst✝⁷ : TopologicalSpace α\ninst✝⁶ : LinearOrder α\ninst✝⁵ : OrderTopology α\nι : Type u_2\nπ : ι → Type u_1\ninst✝⁴ : Finite ι\ninst✝³ : (i : ι) → LinearOrder (π i)\ninst✝² : (i : ι) → TopologicalSpace (π i)\ninst✝¹ : ∀ (i : ι), OrderTopology (π i)\na b x ... | [
1505,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1503,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Submodule.comap_sup_map_of_injective | [] | [
974,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
973,
1
] |
Mathlib/Topology/Constructions.lean | Continuous.subtype_val | [] | [
1019,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1017,
1
] |
Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean | CircleDeg1Lift.le_translationNumber_of_add_nat_le | [] | [
842,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
841,
1
] |
Mathlib/CategoryTheory/Sites/CompatibleSheafification.lean | CategoryTheory.GrothendieckTopology.sheafificationWhiskerLeftIso_inv_app | [
{
"state_after": "C : Type u\ninst✝¹⁰ : Category C\nJ : GrothendieckTopology C\nD : Type w₁\ninst✝⁹ : Category D\nE : Type w₂\ninst✝⁸ : Category E\nF✝ : D ⥤ E\ninst✝⁷ : ∀ (α β : Type (max v u)) (fst snd : β → α), HasLimitsOfShape (WalkingMulticospan fst snd) D\ninst✝⁶ : ∀ (α β : Type (max v u)) (fst snd : β → α... | [
98,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.comap_apply | [] | [
1331,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1328,
1
] |
Mathlib/Topology/UniformSpace/Equicontinuity.lean | uniformEquicontinuous_at_iff_range | [
{
"state_after": "ι : Type u_1\nκ : Type ?u.49263\nX : Type ?u.49266\nY : Type ?u.49269\nZ : Type ?u.49272\nα : Type u_2\nβ : Type u_3\nγ : Type ?u.49281\n𝓕 : Type ?u.49284\ninst✝⁵ : TopologicalSpace X\ninst✝⁴ : TopologicalSpace Y\ninst✝³ : TopologicalSpace Z\ninst✝² : UniformSpace α\ninst✝¹ : UniformSpace β\n... | [
237,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
234,
1
] |
Mathlib/Control/EquivFunctor.lean | EquivFunctor.mapEquiv_apply | [] | [
64,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean | ContDiffOn.rpow_const_of_ne | [] | [
531,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
530,
1
] |
Mathlib/GroupTheory/Commutator.lean | Subgroup.commutator_bot_right | [] | [
165,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/MeasureTheory/Integral/CircleIntegral.lean | circleIntegral.norm_integral_le_of_norm_le_const | [
{
"state_after": "no goals",
"state_before": "E : Type u_1\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℂ E\ninst✝ : CompleteSpace E\nf : ℂ → E\nc : ℂ\nR C : ℝ\nhR : 0 ≤ R\nhf : ∀ (z : ℂ), z ∈ sphere c R → ‖f z‖ ≤ C\nthis : Abs.abs R = R\n⊢ ∀ (z : ℂ), z ∈ sphere c (Abs.abs R) → ‖f z‖ ≤ C",
"tact... | [
409,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
404,
1
] |
Mathlib/Algebra/Periodic.lean | Function.Antiperiodic.mul_const | [] | [
490,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
488,
1
] |
Mathlib/Data/Part.lean | Part.bind_none | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.20958\nf : α → Part β\na : β\n⊢ ¬a ∈ Part.bind none f",
"tactic": "simp"
}
] | [
516,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
515,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.floor_add_one | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.130776\nα : Type u_1\nβ : Type ?u.130782\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz : ℤ\na✝ a : α\n⊢ ⌊a + 1⌋ = ⌊a⌋ + 1",
"tactic": "rw [← cast_one, floor_add_int]"
}
] | [
731,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
729,
1
] |
Mathlib/NumberTheory/PythagoreanTriples.lean | PythagoreanTriple.eq | [] | [
70,
4
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/LinearAlgebra/FinsuppVectorSpace.lean | Finset.sum_univ_ite | [
{
"state_after": "no goals",
"state_before": "R : Type u_3\nM : Type u_1\nn : Type u_2\ninst✝⁴ : DecidableEq n\ninst✝³ : Fintype n\ninst✝² : Semiring R\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\nb : n → M\ni : n\n⊢ (Finset.sum Finset.univ fun x => (if i = x then 1 else 0) • b x) = b i",
"tactic": "s... | [
174,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Mathlib/Topology/Order/Basic.lean | isLUB_of_mem_nhds | [] | [
2008,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2001,
1
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.toWord_injective | [
{
"state_after": "case mk.mk\nα : Type u\nL L₁✝ L₂✝ L₃ L₄ : List (α × Bool)\ninst✝ : DecidableEq α\na₁✝ : FreeGroup α\nL₁ : List (α × Bool)\na₂✝ : FreeGroup α\nL₂ : List (α × Bool)\n⊢ toWord (Quot.mk Red.Step L₁) = toWord (Quot.mk Red.Step L₂) → Quot.mk Red.Step L₁ = Quot.mk Red.Step L₂",
"state_before": "α... | [
1296,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1295,
1
] |
Mathlib/Order/SuccPred/Basic.lean | Order.Iio_succ_of_not_isMax | [] | [
304,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
303,
1
] |
Mathlib/NumberTheory/LegendreSymbol/MulCharacter.lean | MulChar.toUnitHom_eq | [] | [
244,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/Analysis/InnerProductSpace/PiL2.lean | EuclideanSpace.nndist_eq | [] | [
138,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
136,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.subset_sUnion_of_subset | [] | [
1049,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1047,
1
] |
Mathlib/Order/LiminfLimsup.lean | Antitone.isBoundedUnder_le_comp | [] | [
1196,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1193,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.iUnion_ge_eq_iUnion_nat_add | [] | [
2198,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2197,
1
] |
Mathlib/MeasureTheory/Group/Arithmetic.lean | Multiset.aemeasurable_prod' | [
{
"state_after": "case mk\nM : Type u_1\nι : Type ?u.4397208\nα : Type u_2\ninst✝² : CommMonoid M\ninst✝¹ : MeasurableSpace M\ninst✝ : MeasurableMul₂ M\nm : MeasurableSpace α\nμ : MeasureTheory.Measure α\nf : ι → α → M\nl✝ : Multiset (α → M)\nl : List (α → M)\nhl : ∀ (f : α → M), f ∈ Quot.mk Setoid.r l → AEMeas... | [
913,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
910,
1
] |
Mathlib/Analysis/Complex/PhragmenLindelof.lean | PhragmenLindelof.eq_zero_on_quadrant_II | [] | [
507,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
500,
1
] |
Mathlib/Topology/MetricSpace/Lipschitz.lean | LipschitzWith.prod_fst | [] | [
240,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
239,
11
] |
Mathlib/Data/Multiset/Antidiagonal.lean | Multiset.antidiagonal_coe | [] | [
36,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
35,
1
] |
Mathlib/Order/LocallyFinite.lean | Finset.Iic_eq_Icc | [] | [
477,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
476,
1
] |
Mathlib/Topology/Semicontinuous.lean | LowerSemicontinuousOn.lowerSemicontinuousWithinAt | [] | [
151,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
1
] |
Mathlib/Order/Chain.lean | IsChain.insert | [] | [
95,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/NumberTheory/Zsqrtd/Basic.lean | Zsqrtd.divides_sq_eq_zero_z | [
{
"state_after": "d : ℕ\ndnsq : Nonsquare d\nx y : ℤ\nh : ↑(Int.natAbs x * Int.natAbs x) = ↑(d * Int.natAbs y * Int.natAbs y)\n⊢ x = 0 ∧ y = 0",
"state_before": "d : ℕ\ndnsq : Nonsquare d\nx y : ℤ\nh : x * x = ↑d * y * y\n⊢ x = 0 ∧ y = 0",
"tactic": "rw [mul_assoc, ← Int.natAbs_mul_self, ← Int.natAbs_mu... | [
919,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
915,
1
] |
Mathlib/Topology/Basic.lean | isClosed_iff_frequently | [
{
"state_after": "α : Type u\nβ : Type v\nι : Sort w\na : α\ns✝ s₁ s₂ t : Set α\np p₁ p₂ : α → Prop\ninst✝ : TopologicalSpace α\ns : Set α\n⊢ closure s ⊆ s ↔ ∀ (x : α), (∃ᶠ (y : α) in 𝓝 x, y ∈ s) → x ∈ s",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\na : α\ns✝ s₁ s₂ t : Set α\np p₁ p₂ : α → Prop\ni... | [
1279,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1276,
1
] |
Mathlib/GroupTheory/Submonoid/Pointwise.lean | AddSubmonoid.closure_pow | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.264941\nG : Type ?u.264944\nM : Type ?u.264947\nR : Type u_1\nA : Type ?u.264953\ninst✝² : Monoid M\ninst✝¹ : AddMonoid A\ninst✝ : Semiring R\ns : Set R\n⊢ closure s ^ 0 = closure (s ^ 0)",
"tactic": "rw [pow_zero, pow_zero, one_eq_closure_one_se... | [
684,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
682,
1
] |
Mathlib/Algebra/CubicDiscriminant.lean | Cubic.ne_zero_of_b_ne_zero | [] | [
191,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/Data/Nat/Set.lean | Nat.zero_union_range_succ | [
{
"state_after": "case h\nn : ℕ\n⊢ n ∈ {0} ∪ range succ ↔ n ∈ univ",
"state_before": "⊢ {0} ∪ range succ = univ",
"tactic": "ext n"
},
{
"state_after": "no goals",
"state_before": "case h\nn : ℕ\n⊢ n ∈ {0} ∪ range succ ↔ n ∈ univ",
"tactic": "cases n <;> simp"
}
] | [
26,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
24,
1
] |
Std/Data/List/Init/Lemmas.lean | List.or_cons | [] | [
39,
57
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
39,
9
] |
Mathlib/Logic/IsEmpty.lean | isEmpty_psum | [
{
"state_after": "no goals",
"state_before": "α✝ : Sort ?u.3457\nβ✝ : Sort ?u.3460\nγ : Sort ?u.3463\nα : Sort u_1\nβ : Sort u_2\n⊢ IsEmpty (α ⊕' β) ↔ IsEmpty α ∧ IsEmpty β",
"tactic": "simp only [← not_nonempty_iff, nonempty_psum, not_or]"
}
] | [
186,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
185,
1
] |
Mathlib/GroupTheory/GroupAction/BigOperators.lean | List.smul_sum | [] | [
32,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
31,
1
] |
Mathlib/Data/Dfinsupp/Order.lean | Dfinsupp.support_inf | [
{
"state_after": "case a\nι : Type u_1\nα : ι → Type u_2\ninst✝¹ : (i : ι) → CanonicallyLinearOrderedAddMonoid (α i)\ninst✝ : DecidableEq ι\nf g : Π₀ (i : ι), α i\na✝ : ι\n⊢ a✝ ∈ support (f ⊓ g) ↔ a✝ ∈ support f ∩ support g",
"state_before": "ι : Type u_1\nα : ι → Type u_2\ninst✝¹ : (i : ι) → CanonicallyLin... | [
257,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
254,
1
] |
Mathlib/RingTheory/IntegralClosure.lean | RingHom.is_integral_zero | [] | [
477,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
476,
1
] |
Mathlib/CategoryTheory/Over.lean | CategoryTheory.Over.id_left | [] | [
75,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/Data/List/Basic.lean | List.attach_eq_nil | [] | [
3163,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3162,
1
] |
Mathlib/Data/Real/EReal.lean | EReal.bot_ne_coe | [] | [
297,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/SetTheory/Ordinal/Basic.lean | PrincipalSeg.ordinal_type_lt | [] | [
383,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
381,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean | UniformOnFun.precomp_uniformContinuous | [
{
"state_after": "α : Type u_2\nβ : Type u_3\nγ : Type u_1\nι : Type ?u.81138\ns s' : Set α\nx : α\np : Filter ι\ng : ι → α\ninst✝ : UniformSpace β\n𝔖 : Set (Set α)\n𝔗 : Set (Set γ)\nf : γ → α\nhf : 𝔗 ⊆ image f ⁻¹' 𝔖\n⊢ (⨅ (s : Set α) (_ : s ∈ 𝔖), UniformSpace.comap (restrict s) (UniformFun.uniformSpace (↑... | [
826,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
802,
11
] |
Mathlib/CategoryTheory/Subobject/Lattice.lean | CategoryTheory.Subobject.mk_eq_bot_iff_zero | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝⁴ : Category C\nX Y Z : C\nD : Type u₂\ninst✝³ : Category D\ninst✝² : HasZeroObject C\ninst✝¹ : HasZeroMorphisms C\nf : X ⟶ Y\ninst✝ : Mono f\nh : mk f = ⊥\n⊢ f = 0",
"tactic": "simpa [h, bot_factors_iff_zero] using mk_factors_self f"
},
... | [
358,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
356,
1
] |
Mathlib/AlgebraicGeometry/RingedSpace.lean | AlgebraicGeometry.RingedSpace.basicOpen_mul | [
{
"state_after": "case h\nX : RingedSpace\nU : Opens ↑↑X.toPresheafedSpace\nf g : ↑(X.presheaf.obj U.op)\n⊢ ↑(basicOpen X (f * g)) = ↑(basicOpen X f ⊓ basicOpen X g)",
"state_before": "X : RingedSpace\nU : Opens ↑↑X.toPresheafedSpace\nf g : ↑(X.presheaf.obj U.op)\n⊢ basicOpen X (f * g) = basicOpen X f ⊓ bas... | [
244,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.union_eq_sdiff_union_sdiff_union_inter | [] | [
2339,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2338,
1
] |
Mathlib/Topology/LocalHomeomorph.lean | LocalHomeomorph.restr_source_inter | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.54413\nδ : Type ?u.54416\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\ne : LocalHomeomorph α β\ne' : LocalHomeomorph β γ\ns : Set α\n⊢ (LocalHomeomorph.restr e (e.source ∩ s)).toLocalE... | [
731,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
729,
1
] |
Std/Data/Option/Init/Lemmas.lean | Option.some_bind | [] | [
23,
80
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
23,
9
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.dual_Iio | [] | [
246,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.principal_add_aleph | [] | [
863,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
862,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Localization.mk_zero | [
{
"state_after": "no goals",
"state_before": "M : Type u_1\ninst✝² : CommMonoidWithZero M\nS : Submonoid M\nN : Type ?u.3329406\ninst✝¹ : CommMonoidWithZero N\nP : Type ?u.3329412\ninst✝ : CommMonoidWithZero P\nx : { x // x ∈ S }\n⊢ ↑(0, 1).snd * (0, x).fst = ↑(0, x).snd * (0, 1).fst",
"tactic": "simp"
... | [
1834,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1831,
1
] |
Mathlib/Data/Polynomial/Derivative.lean | Polynomial.degree_derivative_eq | [
{
"state_after": "case a\nR : Type u\nS : Type v\nT : Type w\nι : Type y\nA : Type z\na b : R\nn : ℕ\ninst✝¹ : Semiring R\ninst✝ : NoZeroSMulDivisors ℕ R\np : R[X]\nhp : 0 < natDegree p\n⊢ degree (↑derivative p) ≤ ↑(natDegree p - 1)\n\ncase a\nR : Type u\nS : Type v\nT : Type w\nι : Type y\nA : Type z\na b : R\... | [
391,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
375,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.coe_orderIso_apply | [
{
"state_after": "case mk\nn m : ℕ\nα : Type ?u.29565\ninst✝ : Preorder α\ne : Fin n ≃o Fin m\ni : ℕ\nhi : i < n\n⊢ ↑(↑e { val := i, isLt := hi }) = ↑{ val := i, isLt := hi }",
"state_before": "n m : ℕ\nα : Type ?u.29565\ninst✝ : Preorder α\ne : Fin n ≃o Fin m\ni : Fin n\n⊢ ↑(↑e i) = ↑i",
"tactic": "rca... | [
583,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
572,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.one_subset | [] | [
114,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Mathlib/Data/Finmap.lean | Finmap.lookup_empty | [] | [
282,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
281,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.lintegral_strict_mono | [
{
"state_after": "α : Type u_1\nβ : Type ?u.985899\nγ : Type ?u.985902\nδ : Type ?u.985905\nm : MeasurableSpace α\nμ ν : Measure α\nf g : α → ℝ≥0∞\nhμ : ¬↑↑μ univ = 0\nhg : AEMeasurable g\nhfi : (∫⁻ (x : α), f x ∂μ) ≠ ⊤\nh : ∀ᵐ (x : α) ∂μ, f x < g x\n⊢ (∫⁻ (x : α), f x ∂μ) < ∫⁻ (x : α), g x ∂μ",
"state_befo... | [
956,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
952,
1
] |
Mathlib/Algebra/BigOperators/Multiset/Lemmas.lean | Commute.multiset_sum_left | [] | [
54,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Topology/UniformSpace/UniformEmbedding.lean | uniformEmbedding_set_inclusion | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² : UniformSpace α\ninst✝¹ : UniformSpace β\ninst✝ : UniformSpace γ\ns t : Set α\nhst : s ⊆ t\n⊢ comap ((fun q => (↑q.fst, ↑q.snd)) ∘ fun x => (inclusion hst x.fst, inclusion hst x.snd)) (𝓤 α) =\n comap (fun q => (↑q.fst, ↑q.snd)) (𝓤 α)",
"stat... | [
168,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
165,
1
] |
Mathlib/Data/Finset/Slice.lean | Finset.slice_subset | [] | [
148,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.Red.Step.lift | [
{
"state_after": "case not\nα : Type u\nL L₃ L₄ : List (α × Bool)\nβ : Type v\ninst✝ : Group β\nf✝ : α → β\nx y : FreeGroup α\nf : α → β\nL₁✝ L₂✝ : List (α × Bool)\nx✝ : α\nb : Bool\n⊢ Lift.aux f (L₁✝ ++ (x✝, b) :: (x✝, !b) :: L₂✝) = Lift.aux f (L₁✝ ++ L₂✝)",
"state_before": "α : Type u\nL L₁ L₂ L₃ L₄ : Lis... | [
694,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
693,
1
] |
Mathlib/Data/Set/Prod.lean | Set.mk_preimage_prod_right_eq_if | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.28728\nδ : Type ?u.28731\ns s₁ s₂ : Set α\nt t₁ t₂ : Set β\na : α\nb : β\ninst✝ : DecidablePred fun x => x ∈ s\n⊢ Prod.mk a ⁻¹' s ×ˢ t = if a ∈ s then t else ∅",
"tactic": "split_ifs with h <;> simp [h]"
}
] | [
253,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
252,
1
] |
Mathlib/Topology/ContinuousOn.lean | continuousOn_iff_continuous_restrict | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.312868\nδ : Type ?u.312871\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\nf : α → β\ns : Set α\n⊢ (∀ (x : α), x ∈ s → ContinuousWithinAt f s x) ↔ ∀ (x : ↑s), ContinuousAt (restrict s f)... | [
607,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
601,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearMap.ker_smul | [] | [
1545,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1544,
1
] |
Mathlib/RingTheory/JacobsonIdeal.lean | Ideal.isLocal_iff | [] | [
371,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
370,
1
] |
Mathlib/Data/Fintype/Card.lean | Finite.wellFounded_of_trans_of_irrefl | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.61329\nγ : Type ?u.61332\ninst✝² : Finite α\nr : α → α → Prop\ninst✝¹ : IsTrans α r\ninst✝ : IsIrrefl α r\n⊢ WellFounded r",
"tactic": "classical\ncases nonempty_fintype α;\nexact\n have :\n ∀ x y, r x y → (univ.filter fun z => ... | [
911,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
897,
1
] |
Mathlib/Logic/Equiv/Option.lean | Equiv.optionCongr_trans | [] | [
59,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.ofFunction_caratheodory | [
{
"state_after": "α : Type u_1\nm : Set α → ℝ≥0∞\ns : Set α\nh₀ : m ∅ = 0\nhs : ∀ (t : Set α), m (t ∩ s) + m (t \\ s) ≤ m t\n⊢ ∀ (t : Set α),\n ↑(OuterMeasure.ofFunction m h₀) (t ∩ s) + ↑(OuterMeasure.ofFunction m h₀) (t \\ s) ≤\n ↑(OuterMeasure.ofFunction m h₀) t",
"state_before": "α : Type u_1\nm ... | [
1084,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1069,
1
] |
Mathlib/ModelTheory/Definability.lean | FirstOrder.Language.DefinableSet.le_iff | [] | [
309,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
308,
1
] |
Mathlib/Order/OmegaCompletePartialOrder.lean | OmegaCompletePartialOrder.Chain.map_le_map | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type ?u.4453\ninst✝² : Preorder α\ninst✝¹ : Preorder β\ninst✝ : Preorder γ\nc c' : Chain α\nf : α →o β\ng✝ : β →o γ\ng : α →o β\nh : f ≤ g\ni : ℕ\n⊢ ∃ j, ↑f (↑c i) ≤ ↑g (↑c j)",
"state_before": "α : Type u\nβ : Type v\nγ : Type ?u.4453\ninst✝² : Preorder α\ninst... | [
149,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/Data/Finset/Sym.lean | Finset.sym_eq_empty | [
{
"state_after": "case zero\nα : Type u_1\ninst✝ : DecidableEq α\ns t : Finset α\na b : α\nm : Sym α Nat.zero\n⊢ Finset.sym s Nat.zero = ∅ ↔ Nat.zero ≠ 0 ∧ s = ∅\n\ncase succ\nα : Type u_1\ninst✝ : DecidableEq α\ns t : Finset α\na b : α\nn✝ : ℕ\nm : Sym α (Nat.succ n✝)\n⊢ Finset.sym s (Nat.succ n✝) = ∅ ↔ Nat.su... | [
197,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.QuasiMeasurePreserving.image_zpow_ae_eq | [
{
"state_after": "α : Type u_1\nβ : Type ?u.412225\nγ : Type ?u.412228\nδ : Type ?u.412231\nι : Type ?u.412234\nR : Type ?u.412237\nR' : Type ?u.412240\nm0 : MeasurableSpace α\ninst✝¹ : MeasurableSpace β\ninst✝ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns✝ s' t : Set α\nμa μa' : Measure α\nμb μb' :... | [
2546,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2532,
1
] |
Mathlib/Order/Monotone/Basic.lean | monotone_fst | [] | [
1150,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1150,
1
] |
Mathlib/SetTheory/ZFC/Basic.lean | ZFSet.toSet_sInter | [
{
"state_after": "case h\nx : ZFSet\nh : ZFSet.Nonempty x\nx✝ : ZFSet\n⊢ x✝ ∈ toSet (⋂₀ x) ↔ x✝ ∈ ⋂₀ (toSet '' toSet x)",
"state_before": "x : ZFSet\nh : ZFSet.Nonempty x\n⊢ toSet (⋂₀ x) = ⋂₀ (toSet '' toSet x)",
"tactic": "ext"
},
{
"state_after": "no goals",
"state_before": "case h\nx : ZF... | [
1109,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1107,
1
] |
Mathlib/Analysis/BoxIntegral/Box/SubboxInduction.lean | BoxIntegral.Box.exists_mem_splitCenterBox | [] | [
88,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/GroupTheory/Submonoid/Pointwise.lean | AddSubmonoid.mul_subset_mul | [
{
"state_after": "case intro.intro.intro.intro\nα : Type ?u.254804\nG : Type ?u.254807\nM✝ : Type ?u.254810\nR : Type u_1\nA : Type ?u.254816\ninst✝² : Monoid M✝\ninst✝¹ : AddMonoid A\ninst✝ : NonUnitalNonAssocSemiring R\nM N : AddSubmonoid R\ni j : R\nhi : i ∈ ↑M\nhj : j ∈ ↑N\n⊢ (fun x x_1 => x * x_1) i j ∈ ↑(... | [
601,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
598,
1
] |
Std/Data/String/Lemmas.lean | String.Pos.byteIdx_mk | [] | [
86,
54
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
86,
1
] |
Mathlib/Order/Basic.lean | le_update_iff | [] | [
863,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
862,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Ico_union_Ico' | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.130159\nα : Type u_1\ninst✝¹ : LinearOrder α\ninst✝ : LocallyFiniteOrder α\na✝ b✝ a b c d : α\nhcb : c ≤ b\nhad : a ≤ d\n⊢ Ico a b ∪ Ico c d = Ico (min a c) (max b d)",
"tactic": "rw [← coe_inj, coe_union, coe_Ico, coe_Ico, coe_Ico, Set.Ico_union... | [
774,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
772,
1
] |
Mathlib/Order/WellFoundedSet.lean | Set.Finite.partiallyWellOrderedOn | [
{
"state_after": "ι : Type ?u.80471\nα : Type u_1\nβ : Type ?u.80477\nr : α → α → Prop\nr' : β → β → Prop\nf✝ : α → β\ns t : Set α\na : α\ninst✝ : IsRefl α r\nhs : Set.Finite s\nf : ℕ → α\nhf : ∀ (n : ℕ), f n ∈ s\n⊢ ∃ m n, m < n ∧ r (f m) (f n)",
"state_before": "ι : Type ?u.80471\nα : Type u_1\nβ : Type ?u... | [
297,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
294,
11
] |
Mathlib/Algebra/GroupPower/Ring.lean | ne_zero_pow | [
{
"state_after": "R : Type ?u.34697\nS : Type ?u.34700\nM : Type u_1\ninst✝ : MonoidWithZero M\na : M\nn : ℕ\nhn : n ≠ 0\n⊢ a = 0 → a ^ n = 0",
"state_before": "R : Type ?u.34697\nS : Type ?u.34700\nM : Type u_1\ninst✝ : MonoidWithZero M\na : M\nn : ℕ\nhn : n ≠ 0\n⊢ a ^ n ≠ 0 → a ≠ 0",
"tactic": "contra... | [
83,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Mathlib/Topology/UniformSpace/CompactConvergence.lean | ContinuousMap.tendsto_iff_tendstoLocallyUniformly | [] | [
420,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
418,
1
] |
Std/Data/Array/Lemmas.lean | Array.getElem_fin_eq_data_get | [] | [
42,
87
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
42,
1
] |
Mathlib/RingTheory/Localization/Submodule.lean | IsLocalization.coeSubmodule_fg | [] | [
75,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/Deprecated/Subgroup.lean | IsGroupHom.injective_of_trivial_ker | [
{
"state_after": "G : Type u_1\nH : Type u_2\nA : Type ?u.111129\na a₁✝ a₂✝ b c : G\ninst✝¹ : Group G\ninst✝ : Group H\nf : G → H\nhf : IsGroupHom f\nh : ker f = IsSubgroup.trivial G\na₁ a₂ : G\nhfa : f a₁ = f a₂\n⊢ a₁ = a₂",
"state_before": "G : Type u_1\nH : Type u_2\nA : Type ?u.111129\na a₁ a₂ b c : G\n... | [
455,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
450,
1
] |
Mathlib/Data/Set/Image.lean | Set.image_comp | [] | [
275,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
1
] |
Mathlib/Data/Nat/Log.lean | Nat.pow_le_iff_le_log | [
{
"state_after": "case h\nb : ℕ\nhb : 1 < b\nx✝ y✝ : ℕ\nhy✝ : y✝ ≠ 0\ny : ℕ\nih : ∀ (m : ℕ), m < y → ∀ {x : ℕ}, m ≠ 0 → (b ^ x ≤ m ↔ x ≤ log b m)\nx : ℕ\nhy : y ≠ 0\n⊢ b ^ x ≤ y ↔ x ≤ log b y",
"state_before": "b : ℕ\nhb : 1 < b\nx y : ℕ\nhy : y ≠ 0\n⊢ b ^ x ≤ y ↔ x ≤ log b y",
"tactic": "induction' y u... | [
104,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Data/Nat/Interval.lean | Nat.Icc_succ_left | [
{
"state_after": "case a\na b c x : ℕ\n⊢ x ∈ Icc (succ a) b ↔ x ∈ Ioc a b",
"state_before": "a b c : ℕ\n⊢ Icc (succ a) b = Ioc a b",
"tactic": "ext x"
},
{
"state_after": "no goals",
"state_before": "case a\na b c x : ℕ\n⊢ x ∈ Icc (succ a) b ↔ x ∈ Ioc a b",
"tactic": "rw [mem_Icc, mem_Io... | [
162,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
160,
1
] |
Std/Data/Int/Lemmas.lean | Int.sub_lt_self | [
{
"state_after": "no goals",
"state_before": "a b : Int\nh : 0 < b\n⊢ a + 0 = a",
"tactic": "rw [Int.add_zero]"
}
] | [
1144,
38
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1141,
11
] |
Mathlib/Order/WithBot.lean | WithTop.lt_iff_exists_coe | [
{
"state_after": "α : Type u_1\nβ : Type ?u.89259\nγ : Type ?u.89262\nδ : Type ?u.89265\ninst✝ : LT α\na✝ b✝ : α\na b : WithTop α\n⊢ (∃ a_1, ↑WithTop.toDual a = ↑(↑toDual a_1) ∧ ↑WithTop.toDual b < ↑(↑toDual a_1)) ↔ ∃ p, a = ↑p ∧ ↑p < b",
"state_before": "α : Type u_1\nβ : Type ?u.89259\nγ : Type ?u.89262\n... | [
1081,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1079,
1
] |
Mathlib/LinearAlgebra/AdicCompletion.lean | Hausdorffification.lift_eq | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝⁴ : CommRing R\nI : Ideal R\nM : Type u_2\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\nN : Type u_3\ninst✝¹ : AddCommGroup N\ninst✝ : Module R N\nh : IsHausdorff I N\nf : M →ₗ[R] N\ng : Hausdorffification I M →ₗ[R] N\nhg : LinearMap.comp g (... | [
181,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
179,
1
] |
Mathlib/CategoryTheory/Sites/Sheafification.lean | CategoryTheory.GrothendieckTopology.Plus.exists_of_sep | [
{
"state_after": "C : Type u\ninst✝⁶ : Category C\nJ : GrothendieckTopology C\nD : Type w\ninst✝⁵ : Category D\ninst✝⁴ : ConcreteCategory D\ninst✝³ : PreservesLimits (forget D)\ninst✝² : ∀ (X : C), HasColimitsOfShape (Cover J X)ᵒᵖ D\ninst✝¹ : ∀ (P : Cᵒᵖ ⥤ D) (X : C) (S : Cover J X), HasMultiequalizer (Cover.ind... | [
416,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
367,
1
] |
src/lean/Init/Data/String/Basic.lean | Substring.lt_next | [
{
"state_after": "s : Substring\ni : String.Pos\nh : i.byteIdx < bsize s\n⊢ i.byteIdx <\n (ite (s.startPos + i = s.stopPos) i\n { byteIdx := (String.next s.str (s.startPos + i)).byteIdx - s.startPos.byteIdx }).byteIdx",
"state_before": "s : Substring\ni : String.Pos\nh : i.byteIdx < bsize s\n⊢ i.b... | [
549,
42
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
542,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.