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/CategoryTheory/Sites/SheafOfTypes.lean | CategoryTheory.Presieve.isSheafFor_top_sieve | [
{
"state_after": "C : Type u₁\ninst✝ : Category C\nP✝ Q U : Cᵒᵖ ⥤ Type w\nX Y : C\nS : Sieve X\nR : Presieve X\nJ J₂ : GrothendieckTopology C\nP : Cᵒᵖ ⥤ Type w\n⊢ IsSheafFor P (generate (singleton (𝟙 X))).arrows",
"state_before": "C : Type u₁\ninst✝ : Category C\nP✝ Q U : Cᵒᵖ ⥤ Type w\nX Y : C\nS : Sieve X... | [
664,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
661,
1
] |
Mathlib/Computability/Halting.lean | Partrec.sum_casesOn | [
{
"state_after": "no goals",
"state_before": "α : Type u_4\nβ : Type u_1\nγ : Type u_2\nσ : Type u_3\ninst✝³ : Primcodable α\ninst✝² : Primcodable β\ninst✝¹ : Primcodable γ\ninst✝ : Primcodable σ\nf : α → β ⊕ γ\ng : α → β →. σ\nh : α → γ →. σ\nhf : Computable f\nhg : Partrec₂ g\nhh : Partrec₂ h\na : α\n⊢ (b... | [
134,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
8
] |
Mathlib/Tactic/NormNum/Basic.lean | Mathlib.Meta.NormNum.ne_of_true_of_false | [] | [
761,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
761,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.lintegral_withDensity_eq_lintegral_mul₀ | [] | [
1823,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1820,
1
] |
Mathlib/Algebra/Order/Monoid/Lemmas.lean | Monotone.mul' | [] | [
1341,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1339,
1
] |
Mathlib/Data/ULift.lean | ULift.up_surjective | [] | [
105,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/Data/List/Rotate.lean | List.nthLe_rotate_one | [] | [
284,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
281,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | dvd_lcm_right | [] | [
720,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
719,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | one_add_mul_le_pow' | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.289091\nM : Type u\nN : Type v\nG : Type w\nH✝ : Type x\nA : Type y\nB : Type z\nR : Type u₁\nS : Type u₂\ninst✝ : StrictOrderedSemiring R\na : R\nHsq : 0 ≤ a * a\nHsq' : 0 ≤ (1 + a) * (1 + a)\nH : 0 ≤ 2 + a\n⊢ 1 + ↑0 * a ≤ (1 + a) ^ 0",
"tactic"... | [
660,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
642,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean | Sbtw.angle₁₂₃_eq_pi | [
{
"state_after": "V : Type u_1\nP : Type u_2\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerProductSpace ℝ V\ninst✝¹ : MetricSpace P\ninst✝ : NormedAddTorsor V P\np₁ p₂ p₃ : P\nh : Sbtw ℝ p₁ p₂ p₃\n⊢ p₁ -ᵥ p₂ ≠ 0 ∧ ∃ r, r < 0 ∧ p₃ -ᵥ p₂ = r • (p₁ -ᵥ p₂)",
"state_before": "V : Type u_1\nP : Type u_2\ninst✝³ :... | [
298,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
281,
1
] |
Mathlib/Data/List/Count.lean | List.not_mem_of_count_eq_zero | [] | [
259,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
258,
1
] |
Mathlib/Data/List/Cycle.lean | List.nextOr_eq_nextOr_of_mem_of_ne | [
{
"state_after": "case nil\nα : Type u_1\ninst✝ : DecidableEq α\nxs : List α\nx d d' : α\nx_mem✝ : x ∈ xs\nx_ne✝ : x ≠ getLast xs (_ : xs ≠ [])\nx_mem : x ∈ []\nx_ne : x ≠ getLast [] (_ : [] ≠ [])\n⊢ nextOr [] x d = nextOr [] x d'\n\ncase cons\nα : Type u_1\ninst✝ : DecidableEq α\nxs : List α\nx d d' : α\nx_mem... | [
77,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/Algebra/Order/Interval.lean | Interval.sub_bot | [] | [
393,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
392,
1
] |
Mathlib/Data/Fintype/BigOperators.lean | Fintype.prod_sum_elim | [] | [
290,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
288,
1
] |
Mathlib/CategoryTheory/Shift/Basic.lean | CategoryTheory.shiftZero' | [
{
"state_after": "C : Type u\nA : Type u_1\ninst✝² : Category C\ninst✝¹ : AddMonoid A\ninst✝ : HasShift C A\nX Y : C\nf : X ⟶ Y\n⊢ (shiftZero A X).hom ≫ f ≫ (shiftZero A Y).inv = (shiftFunctor C 0).map f",
"state_before": "C : Type u\nA : Type u_1\ninst✝² : Category C\ninst✝¹ : AddMonoid A\ninst✝ : HasShift... | [
406,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
404,
1
] |
Mathlib/Order/CompleteLattice.lean | iInf_top | [] | [
1058,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1057,
1
] |
Mathlib/RingTheory/IntegralClosure.lean | map_isIntegral_int | [] | [
170,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/Order/Circular.lean | btw_rfl_right | [] | [
315,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.spanFinset_eq_zero | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.1277042\ninst✝⁶ : CommRing R\nS : Submonoid R\nP : Type ?u.1277249\ninst✝⁵ : CommRing P\ninst✝⁴ : Algebra R P\nloc : IsLocalization S P\nR₁ : Type u_3\ninst✝³ : CommRing R₁\nK : Type u_2\ninst✝² : Field K\ninst✝¹ : Algebra R₁ K\ninst✝ : IsFractionRin... | [
1277,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1274,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.map_fst_darts_append | [
{
"state_after": "no goals",
"state_before": "V : Type u\nV' : Type v\nV'' : Type w\nG : SimpleGraph V\nG' : SimpleGraph V'\nG'' : SimpleGraph V''\nu v : V\np : Walk G u v\n⊢ List.map (fun x => x.fst) (darts p) ++ [v] = support p",
"tactic": "induction p <;> simp! [*]"
}
] | [
732,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
730,
1
] |
src/lean/Init/Control/Lawful.lean | ReaderT.run_pure | [] | [
184,
104
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
184,
9
] |
Mathlib/Algebra/MonoidAlgebra/Degree.lean | AddMonoidAlgebra.le_inf_support_list_prod | [
{
"state_after": "R : Type u_3\nA : Type u_2\nT : Type u_1\nB : Type ?u.38739\nι : Type ?u.38742\ninst✝¹¹ : SemilatticeSup B\ninst✝¹⁰ : OrderBot B\ninst✝⁹ : SemilatticeInf T\ninst✝⁸ : OrderTop T\ninst✝⁷ : Semiring R\ninst✝⁶ : AddMonoid A\ninst✝⁵ : AddMonoid B\ninst✝⁴ : CovariantClass B B (fun x x_1 => x + x_1) ... | [
115,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/GroupTheory/Coset.lean | rightCoset_one | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : Monoid α\ns : Set α\n⊢ ∀ (x : α), x ∈ s *r 1 ↔ x ∈ s",
"tactic": "simp [rightCoset]"
}
] | [
158,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/Data/Nat/Digits.lean | Nat.digits_def' | [
{
"state_after": "no goals",
"state_before": "n n✝ : ℕ\nh : 1 < 0\n⊢ ¬1 < 0",
"tactic": "decide"
},
{
"state_after": "no goals",
"state_before": "n n✝ : ℕ\nh : 1 < 1\n⊢ ¬1 < 1",
"tactic": "decide"
},
{
"state_after": "no goals",
"state_before": "n n✝ b : ℕ\nx✝ : 1 < b + 2\n⊢ ... | [
128,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.lt_inf_iff | [] | [
734,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
733,
11
] |
Mathlib/Order/Heyting/Basic.lean | sdiff_top | [] | [
989,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
988,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Ioc_subset_Iic_self | [] | [
481,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
481,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.diagonal_apply | [] | [
430,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
429,
1
] |
Mathlib/RingTheory/DedekindDomain/Ideal.lean | Ideal.isPrime_of_prime | [
{
"state_after": "case refine_1\nR : Type ?u.795002\nA : Type u_1\nK : Type ?u.795008\ninst✝⁶ : CommRing R\ninst✝⁵ : CommRing A\ninst✝⁴ : Field K\ninst✝³ : IsDomain A\ninst✝² : IsDedekindDomain A\ninst✝¹ : Algebra A K\ninst✝ : IsFractionRing A K\nP : Ideal A\nh : Prime P\n⊢ P ≠ ⊤\n\ncase refine_2\nR : Type ?u.7... | [
712,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
706,
1
] |
Mathlib/Algebra/Lie/Basic.lean | LieHom.map_smul | [] | [
307,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
306,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.nat_findGreatest | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.157987\nγ : Type ?u.157990\nδ : Type ?u.157993\nσ : Type ?u.157996\ninst✝⁵ : Primcodable α\ninst✝⁴ : Primcodable β\ninst✝³ : Primcodable γ\ninst✝² : Primcodable δ\ninst✝¹ : Primcodable σ\nf : α → ℕ\np : α → ℕ → Prop\ninst✝ : (x : α) → (... | [
804,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
799,
1
] |
Mathlib/Data/Nat/Factorization/PrimePow.lean | isPrimePow_pow_iff | [
{
"state_after": "R : Type ?u.11956\ninst✝ : CommMonoidWithZero R\nn✝ p : R\nk✝ n k : ℕ\nhk : k ≠ 0\n⊢ (∃! p, Nat.Prime p ∧ p ∣ n ^ k) ↔ ∃! p, Nat.Prime p ∧ p ∣ n",
"state_before": "R : Type ?u.11956\ninst✝ : CommMonoidWithZero R\nn✝ p : R\nk✝ n k : ℕ\nhk : k ≠ 0\n⊢ IsPrimePow (n ^ k) ↔ IsPrimePow n",
"... | [
120,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Algebra/Group/Defs.lean | inv_inv | [] | [
779,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
778,
1
] |
Mathlib/Analysis/MeanInequalities.lean | Real.geom_mean_le_arith_mean_weighted | [
{
"state_after": "case pos\nι : Type u\ns : Finset ι\nw z : ι → ℝ\nhw : ∀ (i : ι), i ∈ s → 0 ≤ w i\nhw' : ∑ i in s, w i = 1\nhz : ∀ (i : ι), i ∈ s → 0 ≤ z i\nA : ∃ i, i ∈ s ∧ z i = 0 ∧ w i ≠ 0\n⊢ ∏ i in s, z i ^ w i ≤ ∑ i in s, w i * z i\n\ncase neg\nι : Type u\ns : Finset ι\nw z : ι → ℝ\nhw : ∀ (i : ι), i ∈ s ... | [
138,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
117,
1
] |
Mathlib/Data/PFunctor/Multivariate/W.lean | MvPFunctor.map_objAppend1 | [
{
"state_after": "n : ℕ\nP : MvPFunctor (n + 1)\nα γ : TypeVec n\ng : α ⟹ γ\na : P.A\nf' : B (drop P) a ⟹ α\nf : PFunctor.B (last P) a → W P α\n⊢ { fst := a, snd := splitFun (g ⊚ f') (wMap P g ∘ f) } = { fst := a, snd := splitFun (g ⊚ f') fun x => wMap P g (f x) }",
"state_before": "n : ℕ\nP : MvPFunctor (n... | [
287,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
283,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.mem_mk | [] | [
113,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
11
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.pred_lt_iff_is_succ | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.84510\nβ : Type ?u.84513\nγ : Type ?u.84516\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\no : Ordinal\n⊢ pred o < o ↔ ¬pred o = o",
"tactic": "simp only [le_antisymm_iff, pred_le_self, true_and_iff, not_le]"
}
] | [
195,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Order/Filter/Prod.lean | Filter.inf_prod | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.42471\nδ : Type ?u.42474\nι : Sort ?u.42477\ns : Set α\nt : Set β\nf : Filter α\ng✝ : Filter β\nf₁ f₂ : Filter α\ng : Filter β\n⊢ (f₁ ⊓ f₂) ×ˢ g = f₁ ×ˢ g ⊓ f₂ ×ˢ g",
"tactic": "rw [prod_inf_prod, inf_idem]"
}
] | [
394,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
393,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.ceil_eq_zero_iff | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.223342\nα : Type u_1\nβ : Type ?u.223348\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz : ℤ\na : α\n⊢ ⌈a⌉ = 0 ↔ a ∈ Ioc (-1) 0",
"tactic": "simp [ceil_eq_iff]"
}
] | [
1212,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1212,
1
] |
Mathlib/CategoryTheory/Abelian/NonPreadditive.lean | CategoryTheory.NonPreadditiveAbelian.sub_comp | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝¹ : Category C\ninst✝ : NonPreadditiveAbelian C\nX Y Z : C\nf g : X ⟶ Y\nh : Y ⟶ Z\n⊢ (f - g) ≫ h = f ≫ h - g ≫ h",
"tactic": "rw [sub_def, Category.assoc, σ_comp, ← Category.assoc, prod.lift_map, sub_def]"
}
] | [
436,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
435,
1
] |
Mathlib/CategoryTheory/Generator.lean | CategoryTheory.isCodetecting_empty_of_groupoid | [] | [
254,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
253,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean | HasStrictDerivAt.log | [
{
"state_after": "f : ℝ → ℝ\nx f' : ℝ\ns : Set ℝ\nhf : HasStrictDerivAt f f' x\nhx : f x ≠ 0\n⊢ HasStrictDerivAt (fun y => Real.log (f y)) ((f x)⁻¹ * f') x",
"state_before": "f : ℝ → ℝ\nx f' : ℝ\ns : Set ℝ\nhf : HasStrictDerivAt f f' x\nhx : f x ≠ 0\n⊢ HasStrictDerivAt (fun y => Real.log (f y)) (f' / f x) x... | [
117,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/MeasureTheory/Constructions/Pi.lean | isPiSystem_pi | [] | [
85,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
83,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalSubsemiring.prod_mono | [] | [
790,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
788,
1
] |
Mathlib/Topology/Semicontinuous.lean | LowerSemicontinuousWithinAt.add' | [
{
"state_after": "α : Type u_1\ninst✝⁴ : TopologicalSpace α\nβ : Type ?u.61424\ninst✝³ : Preorder β\nf✝ g✝ : α → β\nx : α\ns t : Set α\ny✝ z : β\nι : Type ?u.61450\nγ : Type u_2\ninst✝² : LinearOrderedAddCommMonoid γ\ninst✝¹ : TopologicalSpace γ\ninst✝ : OrderTopology γ\nf g : α → γ\nhf : LowerSemicontinuousWit... | [
446,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
379,
1
] |
Mathlib/Data/Fintype/Perm.lean | length_permsOfList | [
{
"state_after": "α : Type u_1\nβ : Type ?u.3194\nγ : Type ?u.3197\ninst✝¹ : DecidableEq α\ninst✝ : DecidableEq β\na : α\nl : List α\n⊢ length (permsOfList (a :: l)) = (length l + 1) * (length l)!",
"state_before": "α : Type u_1\nβ : Type ?u.3194\nγ : Type ?u.3197\ninst✝¹ : DecidableEq α\ninst✝ : DecidableE... | [
47,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
41,
1
] |
Mathlib/Data/List/Nodup.lean | List.Nodup.nthLe_inj_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nl✝ l₁ l₂ : List α\nr : α → α → Prop\na b : α\nl : List α\nh : Nodup l\ni j : ℕ\nhi : i < length l\nhj : j < length l\n⊢ i = j → nthLe l i hi = nthLe l j hj",
"tactic": "simp (config := { contextual := true })"
}
] | [
124,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/CategoryTheory/Monoidal/Functor.lean | CategoryTheory.MonoidalFunctor.map_tensor | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝³ : Category C\ninst✝² : MonoidalCategory C\nD : Type u₂\ninst✝¹ : Category D\ninst✝ : MonoidalCategory D\nF : MonoidalFunctor C D\nX Y X' Y' : C\nf : X ⟶ Y\ng : X' ⟶ Y'\n⊢ F.map (f ⊗ g) =\n inv (LaxMonoidalFunctor.μ F.toLaxMonoidalFunctor X... | [
205,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/Topology/Algebra/Group/Basic.lean | inv_mem_connectedComponent_one | [
{
"state_after": "α : Type u\nβ : Type v\nG✝ : Type w\nH : Type x\ninst✝⁶ : TopologicalSpace G✝\ninst✝⁵ : Group G✝\ninst✝⁴ : TopologicalGroup G✝\ninst✝³ : TopologicalSpace α\nf : α → G✝\ns : Set α\nx : α\nG : Type u_1\ninst✝² : TopologicalSpace G\ninst✝¹ : Group G\ninst✝ : TopologicalGroup G\ng : G\nhg : g ∈ co... | [
778,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
772,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.sumAddHom_single | [
{
"state_after": "ι : Type u\nγ : Type w\nβ : ι → Type v\nβ₁ : ι → Type v₁\nβ₂ : ι → Type v₂\ndec : DecidableEq ι\ninst✝¹ : (i : ι) → AddZeroClass (β i)\ninst✝ : AddCommMonoid γ\nφ : (i : ι) → β i →+ γ\ni : ι\nx : β i\n⊢ ∑ i_1 in Multiset.toFinset {i}, ↑(φ i_1) (Pi.single i x i_1) = ↑(φ i) x",
"state_before... | [
1915,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1912,
1
] |
Mathlib/Algebra/Lie/Nilpotent.lean | LieModule.trivial_iff_lower_central_eq_bot | [
{
"state_after": "case mp\nR : Type u\nL : Type v\nM : Type w\ninst✝⁶ : CommRing R\ninst✝⁵ : LieRing L\ninst✝⁴ : LieAlgebra R L\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\ninst✝¹ : LieRingModule L M\ninst✝ : LieModule R L M\nk : ℕ\nN : LieSubmodule R L M\nh : IsTrivial L M\n⊢ lowerCentralSeries R L M 1 = ⊥\n... | [
148,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/NumberTheory/Padics/PadicNumbers.lean | Padic.zero_def | [] | [
516,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
516,
1
] |
Mathlib/Topology/ContinuousFunction/StoneWeierstrass.lean | ContinuousMap.subalgebra_topologicalClosure_eq_top_of_separatesPoints | [
{
"state_after": "case h\nX : Type u_1\ninst✝¹ : TopologicalSpace X\ninst✝ : CompactSpace X\nA : Subalgebra ℝ C(X, ℝ)\nw : Subalgebra.SeparatesPoints A\n⊢ ↑(Subalgebra.topologicalClosure A) = ↑⊤",
"state_before": "X : Type u_1\ninst✝¹ : TopologicalSpace X\ninst✝ : CompactSpace X\nA : Subalgebra ℝ C(X, ℝ)\nw... | [
287,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Multiset.disjoint_sum_right | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.895881\nβ : Type u\nα : Type v\nγ : Type w\ns s₁ s₂ : Finset α\na✝ : α\nf g : α → β\na : Multiset α\ni : Multiset (Multiset α)\n⊢ Disjoint a (sum i) ↔ ∀ (b : Multiset α), b ∈ i → Disjoint a b",
"tactic": "simpa only [@disjoint_comm _ a] using dis... | [
2076,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2074,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Ico_subset_Icc_self | [
{
"state_after": "ι : Type ?u.24429\nα : Type u_1\ninst✝¹ : Preorder α\ninst✝ : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\n⊢ Set.Ico a b ⊆ Set.Icc a b",
"state_before": "ι : Type ?u.24429\nα : Type u_1\ninst✝¹ : Preorder α\ninst✝ : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\n⊢ Ico a b ⊆ Icc a b",
... | [
237,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/Order/CompleteLattice.lean | lt_sSup_iff | [] | [
590,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
589,
1
] |
Mathlib/Data/Finset/Option.lean | Option.card_toFinset | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.816\no : Option α\n⊢ Finset.card (toFinset o) = Option.elim o 0 1",
"tactic": "cases o <;> rfl"
}
] | [
58,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
58,
1
] |
Mathlib/Data/List/Infix.lean | List.tails_cons | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.39006\nl✝ l₁ l₂ l₃ : List α\na✝ b : α\nm n : ℕ\na : α\nl : List α\n⊢ tails (a :: l) = (a :: l) :: tails l",
"tactic": "simp"
}
] | [
376,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
376,
1
] |
Mathlib/Order/Disjoint.lean | Disjoint.eq_bot | [] | [
137,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
136,
1
] |
Mathlib/Analysis/InnerProductSpace/EuclideanDist.lean | ContDiff.euclidean_dist | [
{
"state_after": "E : Type ?u.104861\ninst✝¹¹ : AddCommGroup E\ninst✝¹⁰ : TopologicalSpace E\ninst✝⁹ : TopologicalAddGroup E\ninst✝⁸ : T2Space E\ninst✝⁷ : Module ℝ E\ninst✝⁶ : ContinuousSMul ℝ E\ninst✝⁵ : FiniteDimensional ℝ E\nF : Type u_1\ninst✝⁴ : NormedAddCommGroup F\ninst✝³ : NormedSpace ℝ F\nG : Type u_2\... | [
139,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | Matrix.toLin'_submatrix | [] | [
378,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
374,
1
] |
Mathlib/Logic/Relation.lean | Relation.TransGen.lift | [
{
"state_after": "case single\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.23090\nδ : Type ?u.23093\nr : α → α → Prop\na✝¹ b✝¹ c d : α\np : β → β → Prop\na b : α\nf : α → β\nh : ∀ (a b : α), r a b → p (f a) (f b)\nb✝ : α\na✝ : r a b✝\n⊢ TransGen p (f a) (f b✝)\n\ncase tail\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.2... | [
478,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
474,
1
] |
Mathlib/MeasureTheory/Covering/VitaliFamily.lean | VitaliFamily.FineSubfamilyOn.measure_le_tsum | [] | [
181,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/Order/InitialSeg.lean | PrincipalSeg.top_eq | [
{
"state_after": "α : Type u_2\nβ : Type u_3\nγ : Type u_1\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\ninst✝ : IsWellOrder γ t\ne : r ≃r s\nf : r ≺i t\ng : s ≺i t\n⊢ (equivLT e g).top = g.top",
"state_before": "α : Type u_2\nβ : Type u_3\nγ : Type u_1\nr : α → α → Prop\ns : β → β → Prop\nt : γ → ... | [
371,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
370,
1
] |
Mathlib/Order/Filter/Cofinite.lean | Filter.Tendsto.exists_within_forall_ge | [] | [
184,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
181,
1
] |
Mathlib/LinearAlgebra/Alternating.lean | AlternatingMap.domLCongr_trans | [] | [
631,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
629,
1
] |
Mathlib/Algebra/Homology/ImageToKernel.lean | imageToKernel_comp_hom_inv_comp | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.19938\nV : Type u\ninst✝³ : Category V\ninst✝² : HasZeroMorphisms V\nA B C : V\nf : A ⟶ B\ng : B ⟶ C\ninst✝¹ : HasEqualizers V\ninst✝ : HasImages V\nZ : V\ni : B ≅ Z\nw : (f ≫ i.hom) ≫ i.inv ≫ g = 0\n⊢ f ≫ g = 0",
"tactic": "simpa using w"
},
... | [
142,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/NumberTheory/LegendreSymbol/MulCharacter.lean | MulChar.coe_mk | [] | [
146,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/Analysis/Calculus/Deriv/Inv.lean | deriv_inv' | [] | [
104,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
1
] |
Mathlib/Combinatorics/SimpleGraph/Metric.lean | SimpleGraph.dist_eq_zero_of_not_reachable | [
{
"state_after": "no goals",
"state_before": "V : Type u_1\nG : SimpleGraph V\nu v : V\nh : ¬Reachable G u v\n⊢ dist G u v = 0",
"tactic": "simp [h]"
}
] | [
99,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/Init/Logic.lean | exists_unique_congr | [] | [
267,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
266,
1
] |
Mathlib/Computability/Primrec.lean | Nat.Primrec'.comp' | [
{
"state_after": "no goals",
"state_before": "n m : ℕ\nf : Vector ℕ m → ℕ\ng : Vector ℕ n → Vector ℕ m\nhf : Primrec' f\nhg : Vec g\nv : Vector ℕ n\n⊢ f (ofFn fun i => Vector.get (g v) i) = f (g v)",
"tactic": "simp"
}
] | [
1432,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1431,
1
] |
Mathlib/Logic/Relation.lean | Relation.ReflTransGen.cases_head_iff | [
{
"state_after": "α : Type u_1\nβ : Type ?u.17848\nγ : Type ?u.17851\nδ : Type ?u.17854\nr : α → α → Prop\na b c d : α\n⊢ (a = b ∨ ∃ c, r a c ∧ ReflTransGen r c b) → ReflTransGen r a b",
"state_before": "α : Type u_1\nβ : Type ?u.17848\nγ : Type ?u.17851\nδ : Type ?u.17854\nr : α → α → Prop\na b c d : α\n⊢ ... | [
332,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
328,
1
] |
Mathlib/Order/LiminfLimsup.lean | Filter.isCobounded_principal | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.24269\nγ : Type ?u.24272\nι : Type ?u.24275\nr : α → α → Prop\nf g : Filter α\ns : Set α\n⊢ IsCobounded r (𝓟 s) ↔ ∃ b, ∀ (a : α), (∀ (x : α), x ∈ s → r x a) → r b a",
"tactic": "simp [IsCobounded, subset_def]"
}
] | [
225,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.pow_subset_pow | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.302112\nα : Type u_1\nβ : Type ?u.302118\nγ : Type ?u.302121\ninst✝² : DecidableEq α\ninst✝¹ : DecidableEq β\ninst✝ : Monoid α\ns t : Finset α\na : α\nm n : ℕ\nhst : s ⊆ t\n⊢ s ^ 0 ⊆ t ^ 0",
"tactic": "simp [pow_zero]"
},
{
"state_after":... | [
893,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
888,
1
] |
Mathlib/Analysis/Convex/Combination.lean | convexHull_sub | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nE : Type u_1\nF : Type ?u.413908\nι : Type ?u.413911\nι' : Type ?u.413914\nα : Type ?u.413917\ninst✝⁷ : LinearOrderedField R\ninst✝⁶ : AddCommGroup E\ninst✝⁵ : AddCommGroup F\ninst✝⁴ : LinearOrderedAddCommGroup α\ninst✝³ : Module R E\ninst✝² : Modu... | [
435,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
434,
1
] |
Mathlib/RingTheory/GradedAlgebra/HomogeneousIdeal.lean | Ideal.homogeneousHull_mono | [
{
"state_after": "case a\nι : Type u_2\nσ : Type u_3\nR : Type ?u.210738\nA : Type u_1\ninst✝⁵ : Semiring A\ninst✝⁴ : DecidableEq ι\ninst✝³ : AddMonoid ι\ninst✝² : SetLike σ A\ninst✝¹ : AddSubmonoidClass σ A\n𝒜 : ι → σ\ninst✝ : GradedRing 𝒜\nI✝ I J : Ideal A\nI_le_J : I ≤ J\n⊢ {r | ∃ i x, ↑(↑(↑(decompose 𝒜) ... | [
563,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
560,
1
] |
Mathlib/Data/Nat/PSub.lean | Nat.psub_eq_some | [
{
"state_after": "no goals",
"state_before": "m k : ℕ\n⊢ psub m 0 = some k ↔ k + 0 = m",
"tactic": "simp [eq_comm]"
},
{
"state_after": "m n k : ℕ\n⊢ (∃ a, psub m (Nat.add n 0) = some a ∧ ppred a = some k) ↔ k + (n + 1) = m",
"state_before": "m n k : ℕ\n⊢ psub m (n + 1) = some k ↔ k + (n + 1... | [
85,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Mathlib/Topology/UniformSpace/Separation.lean | UniformSpace.SeparationQuotient.map_mk | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² : UniformSpace α\ninst✝¹ : UniformSpace β\ninst✝ : UniformSpace γ\nf : α → β\nh : UniformContinuous f\na : α\n⊢ (Quotient.mk' ∘ f) a = Quotient.mk (separationSetoid β) (f a)",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² : UniformSp... | [
397,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
396,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.max_erase_ne_self | [
{
"state_after": "case pos\nF : Type ?u.372851\nα : Type u_1\nβ : Type ?u.372857\nγ : Type ?u.372860\nι : Type ?u.372863\nκ : Type ?u.372866\ninst✝ : LinearOrder α\ns✝ : Finset α\nH : Finset.Nonempty s✝\nx : α\ns : Finset α\ns0 : Finset.Nonempty (erase s x)\n⊢ Finset.max (erase s x) ≠ ↑x\n\ncase neg\nF : Type ?... | [
1556,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1551,
1
] |
Mathlib/Algebra/Hom/Commute.lean | Commute.map | [] | [
33,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
32,
11
] |
Mathlib/Algebra/Quaternion.lean | Quaternion.nat_cast_re | [] | [
977,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
977,
1
] |
Mathlib/Order/Bounds/Basic.lean | BddAbove.mono | [] | [
219,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
218,
1
] |
Mathlib/Analysis/Convex/Side.lean | AffineSubspace.wSameSide_of_right_mem | [] | [
261,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
259,
1
] |
Mathlib/Data/Set/Basic.lean | Set.pair_comm | [] | [
1386,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1385,
1
] |
Mathlib/Algebra/Group/Prod.lean | Prod.inv_mk | [] | [
150,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
149,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.countable_meas_pos_of_disjoint_of_meas_iUnion_ne_top | [
{
"state_after": "α : Type u_2\nβ : Type ?u.735840\nγ : Type ?u.735843\nδ : Type ?u.735846\nι✝ : Type ?u.735849\nR : Type ?u.735852\nR' : Type ?u.735855\nm0 : MeasurableSpace α\ninst✝² : MeasurableSpace β\ninst✝¹ : MeasurableSpace γ\nμ✝ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set α\nι : Type u_1\ninst✝ : Meas... | [
3603,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3587,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.diag_diagonal | [] | [
617,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
616,
1
] |
Mathlib/Data/Nat/Parity.lean | Function.Involutive.iterate_even | [
{
"state_after": "case intro\nα : Type u_1\nf : α → α\nhf : Involutive f\nm : ℕ\n⊢ f^[m + m] = id",
"state_before": "α : Type u_1\nf : α → α\nn : ℕ\nhf : Involutive f\nhn : Even n\n⊢ f^[n] = id",
"tactic": "rcases hn with ⟨m, rfl⟩"
},
{
"state_after": "no goals",
"state_before": "case intro\... | [
316,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/Data/Set/Basic.lean | Set.union_eq_union_iff_right | [] | [
867,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
866,
1
] |
Mathlib/MeasureTheory/MeasurableSpace.lean | Filter.Eventually.exists_measurable_mem | [] | [
1704,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1702,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.uniformity_basis_dist_le_pow | [] | [
806,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
802,
1
] |
Mathlib/Algebra/Group/Defs.lean | MulOneClass.ext | [
{
"state_after": "case mk.mk.mk.mk.mk.mk.refl\nG : Type ?u.36374\nM : Type u\none₁ : M\nmul₁ : M → M → M\none_mul₁ : ∀ (a : M), 1 * a = a\nmul_one₁ : ∀ (a : M), a * 1 = a\none₂ : M\none_mul₂ : ∀ (a : M), 1 * a = a\nmul_one₂ : ∀ (a : M), a * 1 = a\n⊢ mk one_mul₁ mul_one₁ = mk one_mul₂ mul_one₂",
"state_befor... | [
448,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
443,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snormEssSup_eq_zero_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nE : Type ?u.2318609\nF : Type u_2\nG : Type ?u.2318615\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\nf : α → F\n⊢ snormEssSup f μ = 0 ↔ f =ᵐ[... | [
735,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
734,
1
] |
Mathlib/Deprecated/Ring.lean | IsRingHom.comp | [
{
"state_after": "α : Type u\nβ : Type v\ninst✝² : Ring α\ninst✝¹ : Ring β\nf : α → β\nhf✝ : IsRingHom f\nx✝ y✝ : α\nhf : IsRingHom f\nγ : Type u_1\ninst✝ : Ring γ\ng : β → γ\nhg : IsRingHom g\nx y : α\n⊢ g (f x + f y) = g (f x) + g (f y)",
"state_before": "α : Type u\nβ : Type v\ninst✝² : Ring α\ninst✝¹ : ... | [
131,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.exists_ne_of_one_lt_ncard | [
{
"state_after": "α : Type u_1\nβ : Type ?u.159008\ns t : Set α\na✝ b x y : α\nf : α → β\nhs : 1 < ncard s\na : α\nhsf : Set.Finite s\n⊢ ∃ b, b ∈ s ∧ b ≠ a",
"state_before": "α : Type u_1\nβ : Type ?u.159008\ns t : Set α\na✝ b x y : α\nf : α → β\nhs : 1 < ncard s\na : α\n⊢ ∃ b, b ∈ s ∧ b ≠ a",
"tactic":... | [
721,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
718,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.nat_le | [
{
"state_after": "α : Type ?u.129087\nβ : Type ?u.129090\nγ : Type ?u.129093\nδ : Type ?u.129096\nσ : Type ?u.129099\ninst✝⁴ : Primcodable α\ninst✝³ : Primcodable β\ninst✝² : Primcodable γ\ninst✝¹ : Primcodable δ\ninst✝ : Primcodable σ\np : ℕ × ℕ\n⊢ Nat.rec true (fun n n_ih => false) (p.fst - p.snd) = decide (p... | [
695,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
690,
1
] |
Mathlib/Data/Set/Basic.lean | Set.coe_eq_subtype | [] | [
177,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
1
] |
Mathlib/Data/Real/EReal.lean | EReal.zero_lt_top | [] | [
332,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
331,
1
] |
Mathlib/RingTheory/Subring/Basic.lean | Subring.mem_sSup_of_directedOn | [
{
"state_after": "R : Type u\nS✝ : Type v\nT : Type w\ninst✝² : Ring R\ninst✝¹ : Ring S✝\ninst✝ : Ring T\nS : Set (Subring R)\nSne : Set.Nonempty S\nhS : DirectedOn (fun x x_1 => x ≤ x_1) S\nx : R\nthis : Nonempty ↑S\n⊢ x ∈ sSup S ↔ ∃ s, s ∈ S ∧ x ∈ s",
"state_before": "R : Type u\nS✝ : Type v\nT : Type w\n... | [
1163,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1159,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.