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/Tactic/CategoryTheory/Elementwise.lean | Tactic.Elementwise.forget_hom_Type | [] | [
43,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
43,
1
] |
Mathlib/Combinatorics/Pigeonhole.lean | Finset.exists_sum_fiber_lt_of_sum_fiber_nonneg_of_sum_lt_nsmul | [] | [
157,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | Units.conj_pow | [] | [
1241,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1237,
1
] |
Mathlib/ModelTheory/Satisfiability.lean | FirstOrder.Language.completeTheory.mem_or_not_mem | [
{
"state_after": "no goals",
"state_before": "L : Language\nT : Theory L\nα : Type w\nn : ℕ\nM : Type w\ninst✝ : Structure L M\nφ : Sentence L\n⊢ φ ∈ completeTheory L M ∨ Formula.not φ ∈ completeTheory L M",
"tactic": "simp_rw [completeTheory, Set.mem_setOf_eq, Sentence.Realize, Formula.realize_not, or_... | [
505,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
504,
1
] |
Mathlib/Algebra/Parity.lean | even_bit0 | [] | [
272,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
271,
9
] |
Mathlib/Analysis/SpecialFunctions/NonIntegrable.lean | not_intervalIntegrable_of_sub_inv_isBigO_punctured | [
{
"state_after": "E : Type ?u.29629\nF : Type u_1\ninst✝⁴ : NormedAddCommGroup E\ninst✝³ : NormedSpace ℝ E\ninst✝² : SecondCountableTopology E\ninst✝¹ : CompleteSpace E\ninst✝ : NormedAddCommGroup F\nf : ℝ → F\na b c : ℝ\nhf : (fun x => (x - c)⁻¹) =O[𝓝[{c}ᶜ] c] f\nhne : a ≠ b\nhc : c ∈ [[a, b]]\nA : ∀ᶠ (x : ℝ)... | [
155,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
143,
1
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.sum.map_inv | [] | [
970,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
969,
1
] |
Mathlib/Data/Nat/Factorization/Basic.lean | Nat.factorization_eq_factors_multiset | [
{
"state_after": "case h\nn p : ℕ\n⊢ ↑(factorization n) p = ↑(↑Multiset.toFinsupp ↑(factors n)) p",
"state_before": "n : ℕ\n⊢ factorization n = ↑Multiset.toFinsupp ↑(factors n)",
"tactic": "ext p"
},
{
"state_after": "case h\nn p : ℕ\n⊢ ↑(factorization n) p = count p (factors n)",
"state_bef... | [
94,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
89,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.map_comp | [] | [
754,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
753,
1
] |
Mathlib/Data/PFunctor/Univariate/Basic.lean | PFunctor.liftp_iff | [
{
"state_after": "case mp\nP : PFunctor\nα : Type u\np : α → Prop\nx : Obj P α\n⊢ Liftp p x → ∃ a f, x = { fst := a, snd := f } ∧ ∀ (i : B P a), p (f i)\n\ncase mpr\nP : PFunctor\nα : Type u\np : α → Prop\nx : Obj P α\n⊢ (∃ a f, x = { fst := a, snd := f } ∧ ∀ (i : B P a), p (f i)) → Liftp p x",
"state_befor... | [
197,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearMap.proj_apply | [] | [
1247,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1246,
1
] |
Mathlib/Analysis/MeanInequalities.lean | Real.young_inequality_of_nonneg | [
{
"state_after": "no goals",
"state_before": "ι : Type u\ns : Finset ι\na b p q : ℝ\nha : 0 ≤ a\nhb : 0 ≤ b\nhpq : IsConjugateExponent p q\n⊢ a * b ≤ a ^ p / p + b ^ q / q",
"tactic": "simpa [← rpow_mul, ha, hb, hpq.ne_zero, hpq.symm.ne_zero, _root_.div_eq_inv_mul] using\n geom_mean_le_arith_mean2_weig... | [
259,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
255,
1
] |
Mathlib/CategoryTheory/Functor/EpiMono.lean | CategoryTheory.Functor.preservesMonomorphisms_of_adjunction | [
{
"state_after": "C : Type u₁\ninst✝² : Category C\nD : Type u₂\ninst✝¹ : Category D\nE : Type u₃\ninst✝ : Category E\nF : C ⥤ D\nG : D ⥤ C\nadj : F ⊣ G\nX Y : D\nf : X ⟶ Y\nhf : Mono f\nZ : C\ng h : Z ⟶ G.obj X\nH : g ≫ G.map f = h ≫ G.map f\n⊢ g = h",
"state_before": "C : Type u₁\ninst✝² : Category C\nD :... | [
200,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Data/Fintype/Basic.lean | Finset.compl_empty | [] | [
183,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.sumComm_symm | [] | [
344,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
343,
1
] |
Mathlib/CategoryTheory/Monoidal/Free/Basic.lean | CategoryTheory.FreeMonoidalCategory.mk_comp | [] | [
190,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
188,
1
] |
Mathlib/RingTheory/UniqueFactorizationDomain.lean | UniqueFactorizationMonoid.normalizedFactors_pow | [
{
"state_after": "case zero\nα : Type u_1\ninst✝³ : CancelCommMonoidWithZero α\ninst✝² : DecidableEq α\ninst✝¹ : NormalizationMonoid α\ninst✝ : UniqueFactorizationMonoid α\nx : α\n⊢ normalizedFactors (x ^ Nat.zero) = Nat.zero • normalizedFactors x\n\ncase succ\nα : Type u_1\ninst✝³ : CancelCommMonoidWithZero α\... | [
697,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
691,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.induction_on' | [
{
"state_after": "no goals",
"state_before": "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\nP : MvPolynomial σ R → Prop\np : MvPolynomial σ R\nh1 : ∀ (u : σ →₀ ℕ) (a : R)... | [
420,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
414,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.card_replicate | [] | [
914,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
913,
9
] |
Mathlib/Data/Set/Function.lean | Set.image_restrict | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.1357\nι : Sort ?u.1360\nπ : α → Type ?u.1365\nf : α → β\ns t : Set α\n⊢ restrict s f '' (Subtype.val ⁻¹' t) = f '' (t ∩ s)",
"tactic": "rw [restrict_eq, image_comp, image_preimage_eq_inter_range, Subtype.range_coe]"
... | [
79,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/Algebra/MonoidAlgebra/Basic.lean | MonoidAlgebra.liftNC_one | [
{
"state_after": "no goals",
"state_before": "k : Type u₁\nG : Type u₂\nR : Type u_2\ninst✝³ : NonAssocSemiring R\ninst✝² : Semiring k\ninst✝¹ : One G\ng_hom : Type u_1\ninst✝ : OneHomClass g_hom G R\nf : k →+* R\ng : g_hom\n⊢ ↑(liftNC ↑f ↑g) 1 = 1",
"tactic": "simp [one_def]"
}
] | [
247,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
246,
1
] |
Mathlib/RingTheory/HahnSeries.lean | HahnSeries.coeff_eq_zero_of_lt_order | [
{
"state_after": "case inl\nΓ : Type u_1\nR : Type u_2\ninst✝² : PartialOrder Γ\ninst✝¹ : Zero R\na b : Γ\nr : R\ninst✝ : Zero Γ\ni : Γ\nhi : i < order 0\n⊢ coeff 0 i = 0\n\ncase inr\nΓ : Type u_1\nR : Type u_2\ninst✝² : PartialOrder Γ\ninst✝¹ : Zero R\na b : Γ\nr : R\ninst✝ : Zero Γ\nx : HahnSeries Γ R\ni : Γ\... | [
259,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
252,
1
] |
Mathlib/Topology/Algebra/Order/ProjIcc.lean | continuous_IccExtend_iff | [] | [
53,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
52,
1
] |
Mathlib/Analysis/NormedSpace/Extend.lean | LinearMap.extendTo𝕜'_apply_re | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_2\ninst✝⁴ : IsROrC 𝕜\nF : Type u_1\ninst✝³ : SeminormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\ninst✝¹ : Module ℝ F\ninst✝ : IsScalarTower ℝ 𝕜 F\nfr : F →ₗ[ℝ] ℝ\nx : F\n⊢ ↑re (↑(extendTo𝕜' fr) x) = ↑fr x",
"tactic": "simp only [extendTo𝕜'_a... | [
93,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.inter_subset_left | [] | [
1586,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1586,
1
] |
Mathlib/Data/Fin/Tuple/NatAntidiagonal.lean | Multiset.Nat.antidiagonalTuple_two | [] | [
221,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
219,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.darts_nodup_of_support_nodup | [
{
"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\nh : List.Nodup (support p)\n⊢ List.Nodup (darts p)",
"tactic": "induction p with\n| nil => simp\n| cons _ p' ih =>\n simp only [da... | [
819,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
813,
1
] |
Mathlib/Algebra/Group/Basic.lean | inv_mul_eq_iff_eq_mul | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.54779\nβ : Type ?u.54782\nG : Type u_1\ninst✝ : Group G\na b c d : G\nh : a⁻¹ * b = c\n⊢ b = a * c",
"tactic": "rw [← h, mul_inv_cancel_left]"
},
{
"state_after": "no goals",
"state_before": "α : Type ?u.54779\nβ : Type ?u.54782\nG : ... | [
705,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
704,
1
] |
Mathlib/Order/GaloisConnection.lean | GaloisConnection.isLUB_l_image | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\nκ : ι → Sort ?u.9528\na✝ a₁ a₂ : α\nb✝ b₁ b₂ : β\ninst✝¹ : Preorder α\ninst✝ : Preorder β\nl : α → β\nu : β → α\ngc : GaloisConnection l u\ns : Set α\na : α\nh : IsLUB s a\nb : β\nhb : b ∈ upperBounds (l '' s)\n⊢ u... | [
135,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
133,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.mem_iUnion₂ | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.42510\nβ : Type ?u.42513\nγ : Type u_1\nι : Sort u_2\nι' : Sort ?u.42522\nι₂ : Sort ?u.42525\nκ : ι → Sort u_3\nκ₁ : ι → Sort ?u.42535\nκ₂ : ι → Sort ?u.42540\nκ' : ι' → Sort ?u.42545\nx : γ\ns : (i : ι) → κ i → Set γ\n⊢ (x ∈ ⋃ (i : ι) (j : κ i), s i... | [
151,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/LinearAlgebra/QuadraticForm/Basic.lean | QuadraticForm.polar_smul_right_of_tower | [
{
"state_after": "no goals",
"state_before": "S : Type u_3\nR : Type u_1\nR₁ : Type ?u.194332\nM : Type u_2\ninst✝⁷ : Ring R\ninst✝⁶ : CommRing R₁\ninst✝⁵ : AddCommGroup M\ninst✝⁴ : Module R M\nQ : QuadraticForm R M\ninst✝³ : CommSemiring S\ninst✝² : Algebra S R\ninst✝¹ : Module S M\ninst✝ : IsScalarTower S... | [
336,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
335,
1
] |
Mathlib/Data/Set/Basic.lean | Set.union_diff_cancel_right | [] | [
1838,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1837,
1
] |
Mathlib/GroupTheory/OrderOfElement.lean | Commute.orderOf_mul_eq_mul_orderOf_of_coprime | [
{
"state_after": "G : Type u\nA : Type v\nx y : G\na b : A\nn m : ℕ\ninst✝¹ : Monoid G\ninst✝ : AddMonoid A\nh : _root_.Commute x y\nhco : coprime (orderOf x) (orderOf y)\n⊢ minimalPeriod ((fun x_1 => x * x_1) ∘ fun x => y * x) 1 = orderOf x * orderOf y",
"state_before": "G : Type u\nA : Type v\nx y : G\na ... | [
412,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
409,
1
] |
Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean | eq_div_iff | [] | [
96,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/Algebra/Ring/Equiv.lean | RingEquiv.coe_monoidHom_trans | [] | [
534,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
532,
1
] |
Mathlib/Topology/Instances/Matrix.lean | Matrix.blockDiagonal_tsum | [
{
"state_after": "case pos\nX : Type u_5\nα : Type ?u.94238\nl : Type ?u.94241\nm : Type u_3\nn : Type u_4\np : Type u_1\nS : Type ?u.94253\nR : Type u_2\nm' : l → Type ?u.94261\nn' : l → Type ?u.94266\ninst✝⁵ : Semiring α\ninst✝⁴ : AddCommMonoid R\ninst✝³ : TopologicalSpace R\ninst✝² : Module α R\ninst✝¹ : Dec... | [
405,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
399,
1
] |
Mathlib/GroupTheory/Perm/Sign.lean | Equiv.Perm.sign_permCongr | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝³ : DecidableEq α\ninst✝² : Fintype α\ninst✝¹ : DecidableEq β\ninst✝ : Fintype β\ne : α ≃ β\np : Perm α\n⊢ ∀ (x : β), ↑e.symm (↑(↑(permCongr e) p) x) = ↑p (↑e.symm x)",
"tactic": "simp"
}
] | [
767,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
766,
1
] |
Mathlib/Data/Num/Lemmas.lean | Num.zneg_toZNumNeg | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.446609\nn : Num\n⊢ -toZNumNeg n = toZNum n",
"tactic": "cases n <;> rfl"
}
] | [
778,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
778,
1
] |
Mathlib/Data/List/Basic.lean | List.get_reverse | [] | [
1458,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1456,
9
] |
Mathlib/Algebra/Invertible.lean | mul_invOf_self_assoc' | [
{
"state_after": "no goals",
"state_before": "α : Type u\ninst✝ : Monoid α\na b : α\nx✝ : Invertible a\n⊢ a * (⅟a * b) = b",
"tactic": "rw [← mul_assoc, mul_invOf_self, one_mul]"
}
] | [
128,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/Order/Basic.lean | le_of_forall_le | [] | [
529,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
528,
1
] |
Mathlib/Algebra/Opposites.lean | AddOpposite.unop_inv | [] | [
417,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
416,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.fract_eq_zero_or_add_one_sub_ceil | [
{
"state_after": "case inl\nF : Type ?u.229164\nα : Type u_1\nβ : Type ?u.229170\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz : ℤ\na✝ a : α\nha : fract a = 0\n⊢ fract a = 0 ∨ fract a = a + 1 - ↑⌈a⌉\n\ncase inr\nF : Type ?u.229164\nα : Type u_1\nβ : Type ?u.229170\ninst✝¹ : LinearOrderedRing α\ninst✝ : ... | [
1248,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1237,
1
] |
Mathlib/Algebra/BigOperators/Finsupp.lean | SubmonoidClass.finsupp_prod_mem | [] | [
205,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | ContDiffOn.congr_mono | [] | [
717,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
715,
1
] |
Mathlib/RingTheory/ChainOfDivisors.lean | DivisorChain.eq_pow_second_of_chain_of_has_chain | [
{
"state_after": "case intro\nM : Type u_1\ninst✝¹ : CancelCommMonoidWithZero M\ninst✝ : UniqueFactorizationMonoid M\nq : Associates M\nn : ℕ\nhn : n ≠ 0\nc : Fin (n + 1) → Associates M\nh₁ : StrictMono c\nh₂ : ∀ {r : Associates M}, r ≤ q ↔ ∃ i, r = c i\nhq : q ≠ 0\ni : Fin (n + 1)\nhi' : q = c 1 ^ ↑i\n⊢ q = c ... | [
214,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean | Asymptotics.superpolynomialDecay_iff_abs_isBoundedUnder | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nl : Filter α\nk f g g' : α → β\ninst✝² : TopologicalSpace β\ninst✝¹ : LinearOrderedField β\ninst✝ : OrderTopology β\nhk : Tendsto k l atTop\nh : ∀ (z : ℕ), IsBoundedUnder (fun x x_1 => x ≤ x_1) l fun a => abs (k a ^ z * f a)\nz : ℕ\n⊢ Tendsto (fun a => abs (k a ^ z ... | [
241,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
1
] |
Mathlib/Combinatorics/SimpleGraph/Coloring.lean | SimpleGraph.Colorable.chromaticNumber_le_of_forall_imp | [
{
"state_after": "V : Type u\nG : SimpleGraph V\nα : Type v\nC : Coloring G α\nV' : Type u_1\nG' : SimpleGraph V'\nm : ℕ\nhc : Colorable G' m\nh : ∀ (n : ℕ), Colorable G' n → Colorable G n\n⊢ chromaticNumber G' ∈ {n | Colorable G n}",
"state_before": "V : Type u\nG : SimpleGraph V\nα : Type v\nC : Coloring ... | [
330,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
325,
1
] |
Mathlib/RingTheory/IntegralClosure.lean | IsIntegralClosure.algebraMap_mk' | [] | [
868,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
867,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.mem_seq_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.289749\nι : Sort x\nf : Filter (α → β)\ng : Filter α\ns : Set β\n⊢ s ∈ seq f g ↔ ∃ u, u ∈ f ∧ ∃ t, t ∈ g ∧ Set.seq u t ⊆ s",
"tactic": "simp only [mem_seq_def, seq_subset, exists_prop, iff_self_iff]"
}
] | [
2618,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2616,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.isFractional_span_iff | [
{
"state_after": "R : Type u_2\ninst✝⁶ : CommRing R\nS : Submonoid R\nP : Type u_1\ninst✝⁵ : CommRing P\ninst✝⁴ : Algebra R P\nloc : IsLocalization S P\nP' : Type ?u.659673\ninst✝³ : CommRing P'\ninst✝² : Algebra R P'\nloc' : IsLocalization S P'\nP'' : Type ?u.660126\ninst✝¹ : CommRing P''\ninst✝ : Algebra R P'... | [
855,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
842,
1
] |
Mathlib/Data/Multiset/Powerset.lean | Multiset.powerset_aux'_perm | [
{
"state_after": "case nil\nα : Type u_1\nl₁ l₂ : List α\n⊢ powersetAux' [] ~ powersetAux' []\n\ncase cons\nα : Type u_1\nl₁✝ l₂✝ : List α\na : α\nl₁ l₂ : List α\np : l₁ ~ l₂\nIH : powersetAux' l₁ ~ powersetAux' l₂\n⊢ powersetAux' (a :: l₁) ~ powersetAux' (a :: l₂)\n\ncase swap\nα : Type u_1\nl₁ l₂ : List α\na ... | [
74,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
64,
1
] |
Mathlib/Algebra/Ring/Defs.lean | mul_two | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nR : Type x\ninst✝ : NonAssocSemiring α\nn : α\n⊢ n * 1 + n * 1 = n + n",
"tactic": "rw [mul_one]"
}
] | [
192,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
191,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.sSup_adj | [] | [
390,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
389,
1
] |
Mathlib/Topology/Constructions.lean | continuousAt_apply | [] | [
1209,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1208,
1
] |
Mathlib/Analysis/Convex/SpecificFunctions/Basic.lean | strictConvexOn_exp | [
{
"state_after": "⊢ ∀ {x y z : ℝ}, x ∈ univ → z ∈ univ → x < y → y < z → (exp y - exp x) / (y - x) < (exp z - exp y) / (z - y)",
"state_before": "⊢ StrictConvexOn ℝ univ exp",
"tactic": "apply strictConvexOn_of_slope_strict_mono_adjacent convex_univ"
},
{
"state_after": "x y z : ℝ\nhxy : x < y\n... | [
68,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
49,
1
] |
Mathlib/Algebra/Lie/Nilpotent.lean | LieModule.nilpotencyLength_eq_zero_iff | [
{
"state_after": "R : 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\ninst✝ : IsNilpotent R L M\ns : Set ℕ := {k | lowerCentralSeri... | [
272,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
1
] |
Mathlib/Order/GaloisConnection.lean | GaloisCoinsertion.u_sSup_l_image | [] | [
820,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
818,
1
] |
Mathlib/Computability/Ackermann.lean | ack_injective_left | [] | [
229,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
228,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.eq_singleton_iff_nonempty_unique_mem | [
{
"state_after": "case mp\nα : Type u_1\nβ : Type ?u.30920\nγ : Type ?u.30923\ns✝ : Finset α\na✝ b : α\ns : Finset α\na : α\n⊢ s = {a} → Finset.Nonempty s ∧ ∀ (x : α), x ∈ s → x = a\n\ncase mpr\nα : Type u_1\nβ : Type ?u.30920\nγ : Type ?u.30923\ns✝ : Finset α\na✝ b : α\ns : Finset α\na : α\n⊢ (Finset.Nonempty ... | [
756,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
747,
1
] |
Mathlib/Algebra/Order/Group/Defs.lean | le_iff_forall_one_lt_lt_mul | [] | [
1053,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1052,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.Adj.symm | [] | [
115,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
11
] |
Mathlib/ModelTheory/Satisfiability.lean | FirstOrder.Language.Theory.isSatisfiable_empty | [] | [
88,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Order/WithBot.lean | WithBot.recBotCoe_bot | [] | [
106,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | Submodule.coe_inner | [] | [
1955,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1954,
1
] |
Mathlib/Analysis/NormedSpace/ConformalLinearMap.lean | IsConformalMap.ne_zero | [
{
"state_after": "R : Type u_2\nM : Type ?u.245254\nN : Type u_3\nG : Type ?u.245260\nM' : Type u_1\ninst✝⁹ : NormedField R\ninst✝⁸ : SeminormedAddCommGroup M\ninst✝⁷ : SeminormedAddCommGroup N\ninst✝⁶ : SeminormedAddCommGroup G\ninst✝⁵ : NormedSpace R M\ninst✝⁴ : NormedSpace R N\ninst✝³ : NormedSpace R G\ninst... | [
103,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean | MvQPF.wrepr_equiv | [
{
"state_after": "n : ℕ\nF : TypeVec (n + 1) → Type u\ninst✝ : MvFunctor F\nq : MvQPF F\nα : TypeVec n\nx : MvPFunctor.W (P F) α\n⊢ ∀ (a : (P F).A) (f' : MvPFunctor.B (MvPFunctor.drop (P F)) a ⟹ α)\n (f : PFunctor.B (MvPFunctor.last (P F)) a → MvPFunctor.W (P F) α),\n (∀ (i : PFunctor.B (MvPFunctor.last (... | [
156,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Data/List/Rdrop.lean | List.rdropWhile_eq_nil_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\np : α → Bool\nl : List α\nn : ℕ\n⊢ rdropWhile p l = [] ↔ ∀ (x : α), x ∈ l → p x = true",
"tactic": "simp [rdropWhile]"
}
] | [
141,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | Subalgebra.bot_eq_top_iff_finrank_eq_one | [
{
"state_after": "no goals",
"state_before": "K : Type u\nV : Type v\nF : Type u_2\nE : Type u_1\ninst✝³ : Field F\ninst✝² : Ring E\ninst✝¹ : Algebra F E\ninst✝ : Nontrivial E\n⊢ ⊥ = ⊤ ↔ finrank F E = 1",
"tactic": "rw [← finrank_top, ← subalgebra_top_finrank_eq_submodule_top_finrank,\n Subalgebra.finr... | [
1428,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1425,
1
] |
Mathlib/Data/Real/EReal.lean | EReal.coe_coe_sign | [
{
"state_after": "no goals",
"state_before": "x : SignType\n⊢ ↑↑x = ↑x",
"tactic": "cases x <;> rfl"
}
] | [
1122,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1122,
1
] |
Mathlib/Algebra/Order/Sub/Defs.lean | lt_of_tsub_lt_tsub_right | [] | [
415,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
414,
1
] |
Mathlib/Data/Set/Basic.lean | Set.compl_eq_univ_diff | [] | [
1893,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1892,
1
] |
Mathlib/Data/Fintype/Basic.lean | Finset.map_univ_equiv | [] | [
270,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
269,
1
] |
Mathlib/Analysis/InnerProductSpace/Adjoint.lean | IsSelfAdjoint.adjoint_eq | [] | [
283,
5
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.map_equiv_eq_comap_symm | [] | [
1473,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1471,
1
] |
Mathlib/RingTheory/Artinian.lean | IsArtinian.bijective_of_injective_endomorphism | [] | [
252,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
251,
1
] |
Mathlib/CategoryTheory/Abelian/InjectiveResolution.lean | CategoryTheory.InjectiveResolution.exact_ofCocomplex | [
{
"state_after": "C : Type u\ninst✝² : Category C\ninst✝¹ : Abelian C\ninst✝ : EnoughInjectives C\nZ : C\nn : ℕ\n⊢ Exact\n (CochainComplex.mkAux (under Z) (syzygies (Injective.ι Z)) (syzygies (d (Injective.ι Z))) (d (Injective.ι Z))\n (d (d (Injective.ι Z)))\n (_ :\n { fst := under Z, ... | [
296,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
286,
1
] |
Mathlib/Logic/Function/Basic.lean | Function.Surjective.of_comp_iff | [] | [
176,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
1
] |
Mathlib/Order/CompleteLattice.lean | unary_relation_sSup_iff | [
{
"state_after": "α✝ : Type ?u.195778\nβ : Type ?u.195781\nβ₂ : Type ?u.195784\nγ : Type ?u.195787\nι : Sort ?u.195790\nι' : Sort ?u.195793\nκ : ι → Sort ?u.195798\nκ' : ι' → Sort ?u.195803\nα : Type u_1\ns : Set (α → Prop)\na : α\n⊢ (⨆ (f : ↑s), ↑f a) ↔ ∃ r, r ∈ s ∧ r a",
"state_before": "α✝ : Type ?u.1957... | [
1784,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1781,
1
] |
Mathlib/Data/PEquiv.lean | PEquiv.bot_trans | [
{
"state_after": "case h.a\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nf : β ≃. γ\nx✝ : α\na✝ : γ\n⊢ a✝ ∈ ↑(PEquiv.trans ⊥ f) x✝ ↔ a✝ ∈ ↑⊥ x✝",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nf : β ≃. γ\n⊢ PEquiv.trans ⊥ f = ⊥",
"tactic": "ext"
},
{
"state_after": "case h.a... | [
318,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
317,
1
] |
Mathlib/Algebra/Lie/Abelian.lean | LieAlgebra.abelian_of_le_center | [] | [
278,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Basis.lean | AffineBasis.exists_affine_subbasis | [
{
"state_after": "case intro.intro.intro\nι : Type ?u.183706\nι' : Type ?u.183709\nk : Type u_2\nV : Type u_3\nP : Type u_1\ninst✝³ : AddCommGroup V\ninst✝² : AffineSpace V P\ninst✝¹ : DivisionRing k\ninst✝ : Module k V\nt : Set P\nht : affineSpan k t = ⊤\ns : Set P\nhst : s ⊆ t\nh_tot : affineSpan k s = affine... | [
324,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
320,
1
] |
Mathlib/Topology/ShrinkingLemma.lean | exists_subset_iUnion_closure_subset | [
{
"state_after": "ι : Type u_2\nX : Type u_1\ninst✝¹ : TopologicalSpace X\ninst✝ : NormalSpace X\nu : ι → Set X\ns : Set X\nhs : IsClosed s\nuo : ∀ (i : ι), IsOpen (u i)\nuf : ∀ (x : X), x ∈ s → Set.Finite {i | x ∈ u i}\nus : s ⊆ ⋃ (i : ι), u i\nthis : Nonempty (PartialRefinement u s)\n⊢ ∃ v, s ⊆ iUnion v ∧ (∀ ... | [
234,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
221,
1
] |
Mathlib/Data/Bool/Count.lean | List.Chain'.count_false_eq_count_true | [] | [
79,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/FieldTheory/Subfield.lean | Subfield.mem_mk | [] | [
188,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/GroupTheory/Congruence.lean | Con.lift_surjective_of_surjective | [] | [
998,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
996,
1
] |
Mathlib/Topology/LocalHomeomorph.lean | LocalHomeomorph.image_mem_nhds | [] | [
376,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
375,
1
] |
Mathlib/Algebra/MonoidAlgebra/Grading.lean | AddMonoidAlgebra.grade_eq_lsingle_range | [] | [
85,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
83,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.toFinsupp_C | [] | [
496,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
495,
1
] |
Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean | LocalHomeomorph.contDiffWithinAt_extend_coord_change | [
{
"state_after": "𝕜 : Type u_3\nE : Type u_4\nM : Type u_2\nH : Type u_1\nE' : Type ?u.176540\nM' : Type ?u.176543\nH' : Type ?u.176546\ninst✝⁹ : NontriviallyNormedField 𝕜\ninst✝⁸ : NormedAddCommGroup E\ninst✝⁷ : NormedSpace 𝕜 E\ninst✝⁶ : TopologicalSpace H\ninst✝⁵ : TopologicalSpace M\nf f' : LocalHomeomorp... | [
1009,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1003,
1
] |
Mathlib/Algebra/GeomSum.lean | Nat.pred_mul_geom_sum_le | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type ?u.218631\na b n : ℕ\n⊢ (b - 1) * ∑ i in range (succ n), a / b ^ i =\n ∑ i in range n, a / b ^ (i + 1) * b + a * b - (∑ i in range n, a / b ^ i + a / b ^ n)",
"tactic": "rw [tsub_mul, mul_comm, sum_mul, one_mul, sum_range_succ', sum_r... | [
420,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
408,
1
] |
Mathlib/Algebra/Order/Nonneg/Field.lean | Nonneg.coe_inv | [] | [
46,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
45,
11
] |
Mathlib/Order/Monotone/Basic.lean | monotoneOn_const | [] | [
529,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
527,
1
] |
Mathlib/Data/Nat/Cast/Basic.lean | toLex_natCast | [] | [
376,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
375,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.mem_support_finset_sum | [] | [
1197,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1193,
1
] |
Std/Data/RBMap/Alter.lean | Std.RBSet.ModifyWF.of_eq | [
{
"state_after": "α : Type u_1\ncmp : α → α → Ordering\ncut : α → Ordering\nf : α → α\nt : RBSet α cmp\nH : ∀ {x : α}, RBNode.find? cut t.val = some x → cmpEq cmp (f x) x\n⊢ OnRoot (fun x => cmpEq cmp (f x) x) (zoom cut t.val Path.root).fst",
"state_before": "α : Type u_1\ncmp : α → α → Ordering\ncut : α → ... | [
421,
64
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
417,
1
] |
Mathlib/MeasureTheory/Covering/VitaliFamily.lean | VitaliFamily.FineSubfamilyOn.covering_disjoint_subtype | [] | [
143,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.filter_smul | [] | [
1575,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1573,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | EMetric.hausdorffEdist_closure₂ | [
{
"state_after": "no goals",
"state_before": "ι : Sort ?u.53920\nα : Type u\nβ : Type v\ninst✝¹ : PseudoEMetricSpace α\ninst✝ : PseudoEMetricSpace β\nx y : α\ns t u : Set α\nΦ : α → β\n⊢ hausdorffEdist s (closure t) = hausdorffEdist s t",
"tactic": "simp [@hausdorffEdist_comm _ _ s _]"
}
] | [
407,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
406,
1
] |
Mathlib/GroupTheory/GroupAction/Units.lean | Units.smul_isUnit | [] | [
46,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.