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/Algebra/ContinuedFractions/TerminatedStable.lean | GeneralizedContinuedFraction.terminated_stable | [] | [
29,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
27,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | NNReal.hasSum_strict_mono | [] | [
1211,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1208,
1
] |
Mathlib/Topology/Order/Basic.lean | mem_nhdsWithin_Iio_iff_exists_Ico_subset | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ninst✝⁴ : TopologicalSpace α\ninst✝³ : LinearOrder α\ninst✝² : OrderTopology α\ninst✝¹ : NoMinOrder α\ninst✝ : DenselyOrdered α\na : α\ns : Set α\nthis : ↑ofDual ⁻¹' s ∈ 𝓝[Ioi (↑toDual a)] ↑toDual a ↔ ∃ u, u ∈ Ioi (↑toDual a) ∧ Ioc (↑toDual a) u ⊆ ↑ofDual ⁻¹... | [
1713,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1710,
1
] |
Mathlib/RingTheory/MvPolynomial/WeightedHomogeneous.lean | MvPolynomial.IsWeightedHomogeneous.mul | [] | [
282,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
280,
1
] |
Mathlib/Topology/MetricSpace/Contracting.lean | ContractingWith.dist_inequality | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : MetricSpace α\nK : ℝ≥0\nf : α → α\nhf : ContractingWith K f\nx y : α\nthis : dist x y ≤ dist x (f x) + dist y (f y) + ↑K * dist x y\n⊢ dist x y ≤ (dist x (f x) + dist y (f y)) / (1 - ↑K)",
"tactic": "rwa [le_div_iff hf.one_sub_K_pos, mu... | [
281,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/Topology/UniformSpace/Cauchy.lean | cauchySeq_tendsto_of_isComplete | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝¹ : UniformSpace α\ninst✝ : SemilatticeSup β\nK : Set α\nh₁ : IsComplete K\nu : β → α\nh₂ : ∀ (n : β), u n ∈ K\nh₃ : CauchySeq u\n⊢ u '' univ ⊆ K",
"tactic": "rwa [image_univ, range_subset_iff]"
}
] | [
433,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
430,
1
] |
Mathlib/Analysis/LocallyConvex/WeakDual.lean | LinearMap.hasBasis_weakBilin | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\nF : Type u_3\nι : Type ?u.39109\ninst✝⁵ : NormedField 𝕜\ninst✝⁴ : AddCommGroup E\ninst✝³ : Module 𝕜 E\ninst✝² : AddCommGroup F\ninst✝¹ : Module 𝕜 F\ninst✝ : Nonempty ι\nB✝ B : E →ₗ[𝕜] F →ₗ[𝕜] 𝕜\np : SeminormFamily 𝕜 E F := toSeminormFamily B\n⊢ Filter.HasBas... | [
140,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/Topology/Algebra/Module/Multilinear.lean | ContinuousMultilinearMap.add_apply | [] | [
203,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
Mathlib/Topology/FiberBundle/Constructions.lean | Bundle.Trivial.trivialization_target | [] | [
92,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Data/Polynomial/Mirror.lean | Polynomial.mirror_mul_of_domain | [
{
"state_after": "case pos\nR : Type u_1\ninst✝¹ : Ring R\np q : R[X]\ninst✝ : NoZeroDivisors R\nhp : p = 0\n⊢ mirror (p * q) = mirror p * mirror q\n\ncase neg\nR : Type u_1\ninst✝¹ : Ring R\np q : R[X]\ninst✝ : NoZeroDivisors R\nhp : ¬p = 0\n⊢ mirror (p * q) = mirror p * mirror q",
"state_before": "R : Typ... | [
209,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
src/lean/Init/Data/Nat/Div.lean | Nat.modCore_eq_mod | [
{
"state_after": "no goals",
"state_before": "x y : Nat\n⊢ Nat.modCore x y = x % y",
"tactic": "cases x with\n| zero =>\n rw [Nat.modCore]\n exact if_neg fun ⟨hlt, hle⟩ => Nat.lt_irrefl _ (Nat.lt_of_lt_of_le hlt hle)\n| succ x => rfl"
},
{
"state_after": "case zero\ny : Nat\n⊢ ite (0 < y ∧ y ≤... | [
92,
18
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
87,
11
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Metric.frontier_thickening_subset | [] | [
954,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
952,
1
] |
Mathlib/Computability/Partrec.lean | Partrec.fix | [
{
"state_after": "α : Type u_1\nβ : Type ?u.267253\nγ : Type ?u.267256\nσ : Type u_2\ninst✝³ : Primcodable α\ninst✝² : Primcodable β\ninst✝¹ : Primcodable γ\ninst✝ : Primcodable σ\nf : α →. σ ⊕ α\nhf : Partrec f\nF : α → ℕ →. σ ⊕ α :=\n fun a n =>\n Nat.rec (Part.some (Sum.inr a)) (fun x IH => Part.bind IH ... | [
863,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
853,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean | AEMeasurable.congr | [] | [
702,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
701,
1
] |
Mathlib/Order/Antichain.lean | IsAntichain.preimage_relEmbedding | [] | [
132,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean | MeasureTheory.Set.mulIndicator_ae_eq_one | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type ?u.132859\nγ : Type ?u.132862\nδ : Type ?u.132865\nι : Type ?u.132868\ninst✝¹ : MeasurableSpace α\nμ μ₁ μ₂ : Measure α\ns✝ s₁ s₂ t : Set α\nM : Type u_1\ninst✝ : One M\nf : α → M\ns : Set α\nh : mulIndicator s f =ᵐ[μ] 1\n⊢ ↑↑μ (s ∩ mulSupp... | [
556,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
554,
1
] |
src/lean/Init/Data/Nat/Div.lean | Nat.div_eq | [
{
"state_after": "x y : Nat\n⊢ Nat.div x y = ite (0 < y ∧ y ≤ x) ((x - y) / y + 1) 0",
"state_before": "x y : Nat\n⊢ x / y = ite (0 < y ∧ y ≤ x) ((x - y) / y + 1) 0",
"tactic": "show Nat.div x y = _"
},
{
"state_after": "x y : Nat\n⊢ ite (0 < y ∧ y ≤ x) (Nat.div (x - y) y + 1) 0 = ite (0 < y ∧ y... | [
28,
6
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
25,
1
] |
Mathlib/Data/MvPolynomial/Variables.lean | MvPolynomial.degrees_map | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nσ : Type u_1\nτ : Type ?u.52567\nr : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\np✝ q : MvPolynomial σ R\ninst✝ : CommSemiring S\np : MvPolynomial σ R\nf : R →+* S\n⊢ degrees (↑(map f) p) ⊆ degrees p",
"tactic": "classical... | [
234,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
228,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.toList'_nil | [] | [
1273,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1267,
1
] |
Mathlib/GroupTheory/GroupAction/Support.lean | MulAction.Supports.mono | [] | [
50,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
49,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | Real.sin_pi_div_two_sub | [
{
"state_after": "no goals",
"state_before": "x : ℝ\n⊢ sin (π / 2 - x) = cos x",
"tactic": "simp [sub_eq_add_neg, sin_add]"
}
] | [
451,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
451,
1
] |
Mathlib/Algebra/Category/GroupCat/Images.lean | AddCommGroupCat.image.fac | [
{
"state_after": "case w\nG H : AddCommGroupCat\nf : G ⟶ H\nx✝ : ↑G\n⊢ ↑(factorThruImage f ≫ ι f) x✝ = ↑f x✝",
"state_before": "G H : AddCommGroupCat\nf : G ⟶ H\n⊢ factorThruImage f ≫ ι f = f",
"tactic": "ext"
},
{
"state_after": "no goals",
"state_before": "case w\nG H : AddCommGroupCat\nf ... | [
61,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/Topology/Instances/AddCircle.lean | AddCircle.finite_setOf_add_order_eq | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nB : Type ?u.298327\ninst✝² : LinearOrderedField 𝕜\ninst✝¹ : TopologicalSpace 𝕜\ninst✝ : OrderTopology 𝕜\np q : 𝕜\nhp : Fact (0 < p)\nn : ℕ\nhn : 0 < n\n⊢ Nat.card ↑{u | addOrderOf u = n} ≠ 0",
"tactic": "simpa only [coe_setOf, card_addOrde... | [
502,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
498,
1
] |
Mathlib/Data/MvPolynomial/Rename.lean | MvPolynomial.killCompl_rename_app | [] | [
147,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/MeasureTheory/Function/LpSpace.lean | ContinuousMap.toLp_inj | [] | [
1748,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1746,
1
] |
Mathlib/Data/Rel.lean | Rel.preimage_univ | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.19926\nr : Rel α β\n⊢ preimage r Set.univ = dom r",
"tactic": "rw [preimage, image_univ, codom_inv]"
}
] | [
207,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
207,
1
] |
Mathlib/Topology/SubsetProperties.lean | isPreirreducible_empty | [] | [
1703,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1702,
1
] |
Mathlib/CategoryTheory/Sites/SheafOfTypes.lean | CategoryTheory.Presieve.FamilyOfElements.comp_of_compatible | [
{
"state_after": "no goals",
"state_before": "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\nS : Sieve X\nx : FamilyOfElements P S.arrows\nt : Compatible x\nf : Y ⟶ X\nhf : S.arrows f\nZ : C\ng : Z ⟶ Y\n⊢ x (g ≫ f) (_ : S.arrows (... | [
288,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
285,
1
] |
Mathlib/Data/Set/Basic.lean | Set.Nontrivial.ne_singleton | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\na b : α\ns s₁ s₂ t t₁ t₂ u : Set α\nx : α\nhs : Set.Nontrivial {x}\nH : s = {x}\n⊢ False",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\na b : α\ns s₁ s₂ t t₁ t₂ u : Set α\nx : α\nhs : Set.Nontrivial s\nH : s = {x}\n⊢ False... | [
2548,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2546,
1
] |
Mathlib/MeasureTheory/Measure/Portmanteau.lean | MeasureTheory.le_measure_compl_liminf_of_limsup_measure_le | [
{
"state_after": "case pos\nΩ : Type u_2\ninst✝² : MeasurableSpace Ω\nι : Type u_1\nL : Filter ι\nμ : Measure Ω\nμs : ι → Measure Ω\ninst✝¹ : IsProbabilityMeasure μ\ninst✝ : ∀ (i : ι), IsProbabilityMeasure (μs i)\nE : Set Ω\nE_mble : MeasurableSet E\nh : limsup (fun i => ↑↑(μs i) E) L ≤ ↑↑μ E\nL_bot : L = ⊥\n⊢ ... | [
128,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.mk_bounded_set_le | [
{
"state_after": "α : Type u\nc : Cardinal\n⊢ (#{ t // (#↑t) ≤ c }) ≤ (#{ t // (#↑t) ≤ c })\n\nα : Type u\nc : Cardinal\n⊢ (#{ t // (#↑t) ≤ c }) ≤ max (#α) ℵ₀ ^ c",
"state_before": "α : Type u\nc : Cardinal\n⊢ (#{ t // (#↑t) ≤ c }) ≤ max (#α) ℵ₀ ^ c",
"tactic": "trans #{ t : Set (Sum (ULift.{u} ℕ) α) //... | [
1131,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1121,
1
] |
Mathlib/Data/List/Cycle.lean | Cycle.mem_coe_iff | [] | [
532,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
531,
1
] |
Mathlib/LinearAlgebra/Basis.lean | Basis.total_repr | [
{
"state_after": "ι : Type u_2\nι' : Type ?u.52430\nR : Type u_3\nR₂ : Type ?u.52436\nK : Type ?u.52439\nM : Type u_1\nM' : Type ?u.52445\nM'' : Type ?u.52448\nV : Type u\nV' : Type ?u.52453\ninst✝⁴ : Semiring R\ninst✝³ : AddCommMonoid M\ninst✝² : Module R M\ninst✝¹ : AddCommMonoid M'\ninst✝ : Module R M'\nb b₁... | [
189,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
src/lean/Init/Data/Fin/Basic.lean | Fin.modn_lt | [] | [
113,
68
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
112,
1
] |
Mathlib/Computability/Reduce.lean | ManyOneDegree.liftOn₂_eq | [] | [
415,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
412,
11
] |
src/lean/Init/Core.lean | if_neg | [] | [
798,
23
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
795,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | real_inner_mul_inner_self_le | [
{
"state_after": "𝕜 : Type ?u.1881062\nE : Type ?u.1881065\nF : Type u_1\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace ℝ F\ndec_E : DecidableEq E\nx y : F\n⊢ inner y x * inner y x ≤ ‖inner y x * inner y x‖",
"st... | [
721,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
716,
1
] |
Mathlib/CategoryTheory/Limits/IsLimit.lean | CategoryTheory.Limits.IsLimit.hom_ext | [
{
"state_after": "J : Type u₁\ninst✝² : Category J\nK : Type u₂\ninst✝¹ : Category K\nC : Type u₃\ninst✝ : Category C\nF : J ⥤ C\nt : Cone F\nh : IsLimit t\nW : C\nf f' : W ⟶ t.pt\nw : ∀ (j : J), f ≫ t.π.app j = f' ≫ t.π.app j\n⊢ lift h { pt := W, π := NatTrans.mk fun b => f ≫ t.π.app b } =\n lift h { pt := ... | [
237,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
234,
1
] |
Mathlib/Algebra/Order/SMul.lean | smul_le_smul_of_nonneg | [
{
"state_after": "case inl\nι : Type ?u.20016\n𝕜 : Type ?u.20019\nR : Type u_2\nM : Type u_1\nN : Type ?u.20028\ninst✝³ : OrderedSemiring R\ninst✝² : OrderedAddCommMonoid M\ninst✝¹ : SMulWithZero R M\ninst✝ : OrderedSMul R M\ns : Set M\na : M\nc : R\nh₂ : 0 ≤ c\nh₁ : a ≤ a\n⊢ c • a ≤ c • a\n\ncase inr\nι : Typ... | [
101,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
11
] |
Mathlib/Combinatorics/Additive/SalemSpencer.lean | mulRothNumber_map_mul_right | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.148022\nα : Type u_1\nβ : Type ?u.148028\n𝕜 : Type ?u.148031\nE : Type ?u.148034\ninst✝¹ : DecidableEq α\ninst✝ : CancelCommMonoid α\ns : Finset α\na : α\n⊢ ↑mulRothNumber (map (mulRightEmbedding a) s) = ↑mulRothNumber s",
"tactic": "rw [← mul_l... | [
446,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
444,
1
] |
Mathlib/LinearAlgebra/Basis.lean | Basis.noZeroSMulDivisors | [
{
"state_after": "no goals",
"state_before": "ι : Type u_2\nι' : Type ?u.592022\nR : Type u_1\nR₂ : Type ?u.592028\nK : Type ?u.592031\nM : Type u_3\nM' : Type ?u.592037\nM'' : Type ?u.592040\nV : Type u\nV' : Type ?u.592045\ninst✝⁵ : Semiring R\ninst✝⁴ : AddCommMonoid M\ninst✝³ : Module R M\ninst✝² : AddCo... | [
784,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
777,
11
] |
Std/Logic.lean | not_and' | [] | [
318,
67
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
318,
1
] |
Mathlib/Data/Rat/Defs.lean | Rat.div_num_den | [
{
"state_after": "a b c q r : ℚ\nhr : r.num = 0\nhr' : r = 0\n⊢ q / r = q.num * ↑r.den /. (↑q.den * r.num)",
"state_before": "a b c q r : ℚ\nhr : r.num = 0\n⊢ q / r = q.num * ↑r.den /. (↑q.den * r.num)",
"tactic": "have hr' : r = 0 := zero_of_num_zero hr"
},
{
"state_after": "no goals",
"sta... | [
468,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
459,
1
] |
Mathlib/Algebra/Regular/Basic.lean | isRegular_of_cancelMonoid | [] | [
361,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
360,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | le_div_iff_of_neg' | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.146538\nα : Type u_1\nβ : Type ?u.146544\ninst✝ : LinearOrderedField α\na b c d : α\nn : ℤ\nhc : c < 0\n⊢ a ≤ b / c ↔ b ≤ c * a",
"tactic": "rw [mul_comm, le_div_iff_of_neg hc]"
}
] | [
733,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
732,
1
] |
Mathlib/Order/BoundedOrder.lean | ne_top_of_le_ne_top | [] | [
196,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
1
] |
Mathlib/Data/Fin/VecNotation.lean | Matrix.cons_val_zero | [] | [
129,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/Data/Part.lean | Part.mem_eq | [] | [
100,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
99,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.inf'_apply | [] | [
1052,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1049,
11
] |
Mathlib/Computability/Partrec.lean | Partrec₂.unpaired | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.82494\nγ : Type ?u.82497\nδ : Type ?u.82500\nσ : Type ?u.82503\ninst✝⁴ : Primcodable α\ninst✝³ : Primcodable β\ninst✝² : Primcodable γ\ninst✝¹ : Primcodable δ\ninst✝ : Primcodable σ\nf : ℕ → ℕ →. α\nh : Partrec (Nat.unpaired f)\n⊢ Partr... | [
504,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
502,
1
] |
Mathlib/Data/Nat/Factorization/PrimePow.lean | IsPrimePow.exists_ord_compl_eq_one | [
{
"state_after": "case inl\nR : Type ?u.4264\ninst✝ : CommMonoidWithZero R\nn p : R\nk : ℕ\nh : IsPrimePow 0\n⊢ ∃ p, Nat.Prime p ∧ 0 / p ^ ↑(Nat.factorization 0) p = 1\n\ncase inr\nR : Type ?u.4264\ninst✝ : CommMonoidWithZero R\nn✝ p : R\nk n : ℕ\nh : IsPrimePow n\nhn0 : n ≠ 0\n⊢ ∃ p, Nat.Prime p ∧ n / p ^ ↑(Na... | [
77,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
67,
1
] |
Mathlib/Data/SetLike/Basic.lean | SetLike.ext | [] | [
155,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Topology/Algebra/Order/Compact.lean | IsCompact.exists_sSup_image_eq_and_ge | [] | [
216,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Data/Nat/ModEq.lean | Nat.chineseRemainder_lt_mul | [] | [
378,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
376,
1
] |
Mathlib/Data/Set/List.lean | Set.range_list_getI | [] | [
67,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/Combinatorics/Young/YoungDiagram.lean | YoungDiagram.mk_mem_row_iff | [
{
"state_after": "no goals",
"state_before": "μ : YoungDiagram\ni j : ℕ\n⊢ (i, j) ∈ row μ i ↔ (i, j) ∈ μ",
"tactic": "simp [row]"
}
] | [
293,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
293,
1
] |
Mathlib/SetTheory/Ordinal/Basic.lean | Ordinal.induction | [] | [
581,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
579,
1
] |
Mathlib/Data/List/Basic.lean | List.nthLe_zero | [
{
"state_after": "case nil\nι : Type ?u.87426\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\ninst✝ : Inhabited α\nh : 0 < length []\n⊢ nthLe [] 0 h = head! []\n\ncase cons\nι : Type ?u.87426\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\ninst✝ : Inhabited α\nhead✝ : α\ntail✝ ... | [
1327,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1324,
1
] |
Mathlib/NumberTheory/RamificationInertia.lean | Ideal.Factors.piQuotientEquiv_mk | [] | [
780,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
779,
1
] |
Mathlib/Data/Stream/Init.lean | Stream'.tail_eq_drop | [] | [
63,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/Logic/Function/Basic.lean | Function.RightInverse.leftInverse | [] | [
358,
4
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
357,
1
] |
Mathlib/CategoryTheory/Limits/Constructions/Over/Products.lean | CategoryTheory.Over.ConstructProducts.over_binaryProduct_of_pullback | [] | [
151,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Data/Finsupp/Multiset.lean | Finsupp.lt_wf | [] | [
233,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
232,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.deleteEdges_adj | [] | [
1043,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1042,
1
] |
Mathlib/Logic/Basic.lean | cast_cast | [] | [
525,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
523,
9
] |
Mathlib/Topology/Sequences.lean | IsSeqClosed.isClosed | [] | [
197,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
11
] |
Mathlib/Combinatorics/Additive/Behrend.lean | Behrend.div_lt_floor | [
{
"state_after": "α : Type ?u.696433\nβ : Type ?u.696436\nn d k N : ℕ\nx✝ : Fin n → ℕ\nx : ℝ\nhx : 2 / (1 - 2 / exp 1) ≤ x\n⊢ x / exp 1 ≤ x / 2 - 1",
"state_before": "α : Type ?u.696433\nβ : Type ?u.696436\nn d k N : ℕ\nx✝ : Fin n → ℕ\nx : ℝ\nhx : 2 / (1 - 2 / exp 1) ≤ x\n⊢ x / exp 1 < ↑⌊x / 2⌋₊",
"tact... | [
358,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
350,
1
] |
Mathlib/Data/List/Intervals.lean | List.Ico.nodup | [
{
"state_after": "n m : ℕ\n⊢ Nodup (range' n (m - n))",
"state_before": "n m : ℕ\n⊢ Nodup (Ico n m)",
"tactic": "dsimp [Ico]"
},
{
"state_after": "no goals",
"state_before": "n m : ℕ\n⊢ Nodup (range' n (m - n))",
"tactic": "simp only [nodup_range']"
}
] | [
61,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/RingTheory/ClassGroup.lean | ClassGroup.mk_eq_one_of_coe_ideal | [
{
"state_after": "R : Type u_1\nK : Type ?u.554196\nL : Type ?u.554199\ninst✝¹⁰ : CommRing R\ninst✝⁹ : Field K\ninst✝⁸ : Field L\ninst✝⁷ : DecidableEq L\ninst✝⁶ : Algebra R K\ninst✝⁵ : IsFractionRing R K\ninst✝⁴ : Algebra K L\ninst✝³ : FiniteDimensional K L\ninst✝² : Algebra R L\ninst✝¹ : IsScalarTower R K L\ni... | [
160,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/Data/Nat/Pow.lean | Nat.pow_mod | [
{
"state_after": "case zero\na n : ℕ\n⊢ a ^ zero % n = (a % n) ^ zero % n\n\ncase succ\na n b : ℕ\nih : a ^ b % n = (a % n) ^ b % n\n⊢ a ^ succ b % n = (a % n) ^ succ b % n",
"state_before": "a b n : ℕ\n⊢ a ^ b % n = (a % n) ^ b % n",
"tactic": "induction' b with b ih"
},
{
"state_after": "case ... | [
163,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.eval₂Hom_eq_zero | [
{
"state_after": "R : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type u_1\na a' a₁ a₂ : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝³ : CommSemiring R\ninst✝² : CommSemiring S₁\np q : MvPolynomial σ R\ninst✝¹ : Algebra R S₁\ninst✝ : CommSemiring S₂\nf✝ : σ → S₁\nf : R →+* S₂\ng : σ → S₂\nφ : MvPolynomial σ R\nh... | [
1545,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1538,
1
] |
Mathlib/MeasureTheory/Measure/GiryMonad.lean | MeasureTheory.Measure.join_map_map | [
{
"state_after": "case h\nα : Type u_1\nβ : Type u_2\ninst✝¹ : MeasurableSpace α\ninst✝ : MeasurableSpace β\nf : α → β\nhf : Measurable f\nμ : Measure (Measure α)\ns : Set β\nhs : MeasurableSet s\n⊢ ↑↑(join (map (map f) μ)) s = ↑↑(map f (join μ)) s",
"state_before": "α : Type u_1\nβ : Type u_2\ninst✝¹ : Mea... | [
219,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/LinearAlgebra/Dual.lean | Basis.dual_rank_eq | [
{
"state_after": "no goals",
"state_before": "R : Type u\nM : Type v\nK : Type u₁\nV : Type u₂\nι : Type w\ninst✝³ : CommRing K\ninst✝² : AddCommGroup V\ninst✝¹ : Module K V\ninst✝ : _root_.Finite ι\nb : Basis ι K V\n⊢ lift (Module.rank K V) = Module.rank K (Dual K V)",
"tactic": "classical\n cases non... | [
526,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
519,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.ae_restrict_uIoc_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.566270\nγ : Type ?u.566273\nδ : Type ?u.566276\nι : Type ?u.566279\nR : Type ?u.566282\nR' : Type ?u.566285\nm0 : MeasurableSpace α\ninst✝² : MeasurableSpace β\ninst✝¹ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t : Set... | [
2794,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2791,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.size_erase_of_mem | [
{
"state_after": "no goals",
"state_before": "case nil\nα : Type u_1\ninst✝¹ : Preorder α\ninst✝ : DecidableRel fun x x_1 => x ≤ x_1\nx : α\na₁ : WithBot α\na₂ : WithTop α\nh : Valid' a₁ nil a₂\nh_mem : x ∈ nil\n⊢ size (erase x nil) = size nil - 1",
"tactic": "contradiction"
},
{
"state_after": ... | [
1673,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1639,
1
] |
Mathlib/Algebra/Quaternion.lean | QuaternionAlgebra.im_idem | [] | [
135,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/Analysis/Convex/Segment.lean | segment_translate_preimage | [] | [
275,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Types.lean | CategoryTheory.Limits.Types.pullbackIsoPullback_hom_snd | [] | [
594,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
592,
1
] |
Mathlib/Data/Set/Image.lean | Set.preimage_inl_image_inr | [
{
"state_after": "case h\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.83955\nι : Sort ?u.83958\nι' : Sort ?u.83961\nf : ι → α\ns✝ t : Set α\ns : Set β\nx✝ : α\n⊢ x✝ ∈ Sum.inl ⁻¹' (Sum.inr '' s) ↔ x✝ ∈ ∅",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.83955\nι : Sort ?u.83958\nι' : Sort ?u.83961\nf : ... | [
920,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
918,
1
] |
Mathlib/Analysis/Convex/Strict.lean | StrictConvex.add | [
{
"state_after": "case intro.intro.intro.intro.intro.intro.intro.intro\n𝕜 : Type u_1\n𝕝 : Type ?u.78535\nE : Type u_2\nF : Type ?u.78541\nβ : Type ?u.78544\ninst✝⁷ : OrderedSemiring 𝕜\ninst✝⁶ : TopologicalSpace E\ninst✝⁵ : TopologicalSpace F\ninst✝⁴ : AddCommGroup E\ninst✝³ : AddCommGroup F\ninst✝² : Module ... | [
259,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
247,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.leadingCoeff_X_add_C | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\na b c d : R\nn m : ℕ\ninst✝¹ : Semiring R\ninst✝ : Semiring S\nr : S\n⊢ leadingCoeff (X + ↑C r) = 1",
"tactic": "rw [← pow_one (X : S[X]), leadingCoeff_X_pow_add_C zero_lt_one]"
}
] | [
1433,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1432,
1
] |
Mathlib/Algebra/Lie/Nilpotent.lean | Function.Surjective.lieAlgebra_isNilpotent | [
{
"state_after": "case mk.intro\nR : Type u\nL : Type v\nL' : Type w\ninst✝⁴ : CommRing R\ninst✝³ : LieRing L\ninst✝² : LieAlgebra R L\ninst✝¹ : LieRing L'\ninst✝ : LieAlgebra R L'\nh₁ : LieAlgebra.IsNilpotent R L\nf : L →ₗ⁅R⁆ L'\nh₂ : Surjective ↑f\nk : ℕ\nhk : lowerCentralSeries R L L k = ⊥\n⊢ ∃ k, lowerCentr... | [
636,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
630,
1
] |
Mathlib/Data/Nat/Choose/Bounds.lean | Nat.choose_le_pow | [
{
"state_after": "α : Type u_1\ninst✝ : LinearOrderedSemifield α\nr n : ℕ\n⊢ ↑r ! * ↑(choose n r) ≤ ↑(n ^ r)\n\nα : Type u_1\ninst✝ : LinearOrderedSemifield α\nr n : ℕ\n⊢ 0 < ↑r !",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedSemifield α\nr n : ℕ\n⊢ ↑(choose n r) ≤ ↑(n ^ r) / ↑r !",
"tactic": "r... | [
39,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
34,
1
] |
Mathlib/Order/Lattice.lean | Prod.snd_inf | [] | [
1284,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1283,
1
] |
Mathlib/FieldTheory/Adjoin.lean | IntermediateField.rank_eq_one_iff | [
{
"state_after": "no goals",
"state_before": "F : Type u_2\ninst✝² : Field F\nE : Type u_1\ninst✝¹ : Field E\ninst✝ : Algebra F E\nα : E\nS : Set E\nK L : IntermediateField F E\n⊢ Module.rank F { x // x ∈ K } = 1 ↔ K = ⊥",
"tactic": "rw [← toSubalgebra_eq_iff, ← rank_eq_rank_subalgebra, Subalgebra.rank_... | [
714,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
712,
1
] |
Mathlib/Topology/Semicontinuous.lean | lowerSemicontinuousOn_biSup | [] | [
609,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
606,
1
] |
Mathlib/CategoryTheory/Limits/ExactFunctor.lean | CategoryTheory.ExactFunctor.forget_map | [] | [
201,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
200,
1
] |
Std/Logic.lean | forall₅_congr | [] | [
410,
46
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
407,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.heq_ext_iff | [
{
"state_after": "n m k : ℕ\ni j : Fin k\n⊢ HEq i j ↔ ↑i = ↑j",
"state_before": "n m k l : ℕ\nh : k = l\ni : Fin k\nj : Fin l\n⊢ HEq i j ↔ ↑i = ↑j",
"tactic": "subst h"
},
{
"state_after": "no goals",
"state_before": "n m k : ℕ\ni j : Fin k\n⊢ HEq i j ↔ ↑i = ↑j",
"tactic": "simp [val_eq_... | [
243,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
240,
11
] |
Mathlib/Data/Set/Intervals/Pi.lean | Set.image_mulSingle_Icc | [] | [
200,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/Data/Nat/Log.lean | Nat.log_monotone | [
{
"state_after": "b n : ℕ\n⊢ log b n ≤ log b (n + 1)",
"state_before": "b : ℕ\n⊢ Monotone (log b)",
"tactic": "refine' monotone_nat_of_le_succ fun n => _"
},
{
"state_after": "case inl\nb n : ℕ\nhb : b ≤ 1\n⊢ log b n ≤ log b (n + 1)\n\ncase inr\nb n : ℕ\nhb : 1 < b\n⊢ log b n ≤ log b (n + 1)",
... | [
189,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
184,
1
] |
Mathlib/SetTheory/Ordinal/Principal.lean | Ordinal.mul_omega | [] | [
348,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
347,
1
] |
Mathlib/LinearAlgebra/Finsupp.lean | Finsupp.finsuppProdLEquiv_apply | [
{
"state_after": "no goals",
"state_before": "α✝ : Type ?u.639667\nM✝ : Type ?u.639670\nN : Type ?u.639673\nP : Type ?u.639676\nR✝ : Type ?u.639679\nS : Type ?u.639682\ninst✝¹⁰ : Semiring R✝\ninst✝⁹ : Semiring S\ninst✝⁸ : AddCommMonoid M✝\ninst✝⁷ : Module R✝ M✝\ninst✝⁶ : AddCommMonoid N\ninst✝⁵ : Module R✝ ... | [
1019,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1017,
1
] |
Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean | NeZero.of_gt | [] | [
317,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
316,
1
] |
Mathlib/GroupTheory/Complement.lean | Subgroup.exists_right_transversal | [
{
"state_after": "G : Type u_1\ninst✝ : Group G\nH K : Subgroup G\nS T : Set G\ng : G\nq : Quotient (QuotientGroup.rightRel H)\n⊢ Quotient.mk'' (Function.update Quotient.out' (Quotient.mk'' g) g q) = q",
"state_before": "G : Type u_1\ninst✝ : Group G\nH K : Subgroup G\nS T : Set G\ng : G\n⊢ ∃ S, S ∈ rightTr... | [
335,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
328,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearEquiv.map_dfinsupp_sumAddHom | [] | [
1958,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1955,
1
] |
Mathlib/Analysis/NormedSpace/Exponential.lean | expSeries_apply_zero | [
{
"state_after": "𝕂 : Type u_2\n𝔸 : Type u_1\ninst✝⁴ : Field 𝕂\ninst✝³ : Ring 𝔸\ninst✝² : Algebra 𝕂 𝔸\ninst✝¹ : TopologicalSpace 𝔸\ninst✝ : TopologicalRing 𝔸\nn : ℕ\n⊢ (↑n !)⁻¹ • 0 ^ n = Pi.single 0 1 n",
"state_before": "𝕂 : Type u_2\n𝔸 : Type u_1\ninst✝⁴ : Field 𝕂\ninst✝³ : Ring 𝔸\ninst✝² : Al... | [
120,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Data/Nat/Order/Lemmas.lean | Nat.dvd_iff_dvd_dvd | [] | [
176,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
175,
1
] |
Mathlib/Data/Int/Parity.lean | Int.even_sub | [
{
"state_after": "no goals",
"state_before": "m n : ℤ\n⊢ Even (m - n) ↔ (Even m ↔ Even n)",
"tactic": "simp [sub_eq_add_neg, parity_simps]"
}
] | [
127,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/Logic/Function/Conjugate.lean | Function.Commute.comp_left | [] | [
119,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.