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/Data/List/Basic.lean | List.length_insertNth | [] | [
1613,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1610,
1
] |
Mathlib/RingTheory/AdjoinRoot.lean | AdjoinRoot.liftHom_of | [] | [
347,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
346,
1
] |
Mathlib/RingTheory/Derivation/Basic.lean | Derivation.coe_sub | [] | [
446,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
445,
1
] |
Mathlib/Data/Matrix/Block.lean | Matrix.blockDiagonal_smul | [
{
"state_after": "case a.h\nl : Type ?u.169372\nm : Type u_3\nn : Type u_4\no : Type u_5\np : Type ?u.169384\nq : Type ?u.169387\nm' : o → Type ?u.169392\nn' : o → Type ?u.169397\np' : o → Type ?u.169402\nR✝ : Type ?u.169405\nS : Type ?u.169408\nα : Type u_2\nβ : Type ?u.169414\ninst✝³ : DecidableEq o\nR : Type... | [
492,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
488,
1
] |
Mathlib/Order/Lattice.lean | sup_eq_max | [] | [
831,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
830,
1
] |
Mathlib/LinearAlgebra/Matrix/Determinant.lean | Matrix.det_mul_column | [] | [
318,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
316,
1
] |
Mathlib/CategoryTheory/Adjunction/Mates.lean | CategoryTheory.transferNatTransSelf_symm_comp | [
{
"state_after": "C : Type u₁\nD : Type u₂\ninst✝¹ : Category C\ninst✝ : Category D\nL₁ L₂ L₃ : C ⥤ D\nR₁ R₂ R₃ : D ⥤ C\nadj₁ : L₁ ⊣ R₁\nadj₂ : L₂ ⊣ R₂\nadj₃ : L₃ ⊣ R₃\nf : R₂ ⟶ R₁\ng : R₃ ⟶ R₂\n⊢ ↑(transferNatTransSelf adj₃ adj₂) (↑(transferNatTransSelf adj₃ adj₂).symm g) ≫\n ↑(transferNatTransSelf adj₂ a... | [
224,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
220,
1
] |
Mathlib/MeasureTheory/Function/AEEqFun.lean | MeasureTheory.AEEqFun.liftRel_iff_coeFn | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type u_3\nδ : Type ?u.449609\ninst✝³ : MeasurableSpace α\nμ ν : Measure α\ninst✝² : TopologicalSpace β\ninst✝¹ : TopologicalSpace γ\ninst✝ : TopologicalSpace δ\nr : β → γ → Prop\nf : α →ₘ[μ] β\ng : α →ₘ[μ] γ\n⊢ LiftRel r f g ↔ ∀ᵐ ... | [
434,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
433,
1
] |
Mathlib/Data/Stream/Init.lean | Stream'.unfolds_eq | [
{
"state_after": "α : Type u\nβ : Type v\nδ : Type w\ng : α → β\nf : α → α\na : α\n⊢ corec g f a = g a :: corec g f (f a)",
"state_before": "α : Type u\nβ : Type v\nδ : Type w\ng : α → β\nf : α → α\na : α\n⊢ unfolds g f a = g a :: unfolds g f (f a)",
"tactic": "unfold unfolds"
},
{
"state_after"... | [
401,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
400,
1
] |
Mathlib/Topology/Algebra/GroupWithZero.lean | Units.embedding_val₀ | [] | [
149,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/Combinatorics/Young/SemistandardTableau.lean | Ssyt.row_weak_of_le | [
{
"state_after": "case inl\nμ : YoungDiagram\nT : Ssyt μ\ni j1 j2 : ℕ\nhj : j1 ≤ j2\ncell : (i, j2) ∈ μ\nh : j1 = j2\n⊢ ↑T i j1 ≤ ↑T i j2\n\ncase inr\nμ : YoungDiagram\nT : Ssyt μ\ni j1 j2 : ℕ\nhj : j1 ≤ j2\ncell : (i, j2) ∈ μ\nh : j1 < j2\n⊢ ↑T i j1 ≤ ↑T i j2",
"state_before": "μ : YoungDiagram\nT : Ssyt μ... | [
132,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | PowerSeries.invOfUnit_eq | [] | [
2148,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2146,
1
] |
Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean | MeasureTheory.AEStronglyMeasurable.mul_const | [] | [
1297,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1295,
11
] |
Mathlib/Algebra/Lie/OfAssociative.lean | Ring.lie_def | [] | [
55,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
1
] |
Mathlib/Algebra/Lie/SkewAdjoint.lean | Matrix.isSkewAdjoint_bracket | [
{
"state_after": "R : Type u\nn : Type w\ninst✝² : CommRing R\ninst✝¹ : DecidableEq n\ninst✝ : Fintype n\nJ A B : Matrix n n R\nhA : IsSkewAdjoint J A\nhB : IsSkewAdjoint J B\n⊢ IsSkewAdjoint J ⁅A, B⁆",
"state_before": "R : Type u\nn : Type w\ninst✝² : CommRing R\ninst✝¹ : DecidableEq n\ninst✝ : Fintype n\n... | [
116,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
106,
1
] |
Mathlib/Data/List/Rotate.lean | List.rotate_cons_succ | [
{
"state_after": "no goals",
"state_before": "α : Type u\nl : List α\na : α\nn : ℕ\n⊢ rotate (a :: l) (succ n) = rotate (l ++ [a]) n",
"tactic": "rw [rotate_eq_rotate', rotate_eq_rotate', rotate'_cons_succ]"
}
] | [
121,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/RingTheory/Valuation/Integral.lean | Valuation.Integers.mem_of_integral | [
{
"state_after": "R : Type u\nΓ₀ : Type v\ninst✝³ : CommRing R\ninst✝² : LinearOrderedCommGroupWithZero Γ₀\nv : Valuation R Γ₀\nO : Type w\ninst✝¹ : CommRing O\ninst✝ : Algebra O R\nhv : Integers v O\nx : R\nhx : IsIntegral O x\np : O[X]\nhpm : Monic p\nhpx : x ^ natDegree p = -∑ i in Finset.range (natDegree p)... | [
48,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Mathlib/LinearAlgebra/ProjectiveSpace/Subspace.lean | Projectivization.Subspace.sup_span | [
{
"state_after": "no goals",
"state_before": "K : Type u_2\nV : Type u_1\ninst✝² : Field K\ninst✝¹ : AddCommGroup V\ninst✝ : Module K V\nS : Set (ℙ K V)\nW : Subspace K V\n⊢ W ⊔ span S = span (↑W ∪ S)",
"tactic": "rw [span_union, span_coe]"
}
] | [
195,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/RingTheory/Ideal/QuotientOperations.lean | Ideal.Quotient.liftₐ_comp | [] | [
264,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
262,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | IsPreconnected.measurableSet | [] | [
565,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
564,
1
] |
Mathlib/Data/Sym/Basic.lean | Sym.fill_filterNe | [
{
"state_after": "α : Type u_1\nβ : Type ?u.54293\nn n' m✝ : ℕ\ns : Sym α n\na✝ b : α\ninst✝ : DecidableEq α\na : α\nm : Sym α n\n⊢ filter ((fun x x_1 => x ≠ x_1) a) ↑m + ↑(replicate (count a ↑m) a) = ↑m",
"state_before": "α : Type u_1\nβ : Type ?u.54293\nn n' m✝ : ℕ\ns : Sym α n\na✝ b : α\ninst✝ : Decidabl... | [
574,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
565,
1
] |
Mathlib/NumberTheory/Padics/PadicIntegers.lean | PadicInt.coe_int_cast | [] | [
163,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | MultilinearMap.mkPiRing_eq_zero_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u\nι : Type u'\nn : ℕ\nM : Fin (Nat.succ n) → Type v\nM₁ : ι → Type v₁\nM₂ : Type v₂\nM₃ : Type v₃\nM' : Type v'\ninst✝⁷ : CommSemiring R\ninst✝⁶ : (i : ι) → AddCommMonoid (M₁ i)\ninst✝⁵ : (i : Fin (Nat.succ n)) → AddCommMonoid (M i)\ninst✝⁴ : AddCommMo... | [
1089,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1088,
1
] |
Mathlib/Data/Multiset/Bind.lean | Multiset.map_bind | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type u_3\nδ : Type ?u.28107\na : α\ns t : Multiset α\nf✝ g : α → Multiset β\nm : Multiset α\nn : α → Multiset β\nf : β → γ\n⊢ map f (bind 0 n) = bind 0 fun a => map f (n a)",
"tactic": "simp"
},
{
"state_after": "no go... | [
164,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/Analysis/Complex/Basic.lean | Complex.nndist_of_im_eq | [] | [
123,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
122,
1
] |
Mathlib/Data/Complex/Exponential.lean | Real.cos_add_cos | [
{
"state_after": "no goals",
"state_before": "x y : ℝ\n⊢ ↑(cos x + cos y) = ↑(2 * cos ((x + y) / 2) * cos ((x - y) / 2))",
"tactic": "simp [cos_add_cos]"
}
] | [
1222,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1221,
8
] |
Mathlib/Algebra/GroupWithZero/Units/Basic.lean | div_ne_zero | [
{
"state_after": "α : Type ?u.19055\nM₀ : Type ?u.19058\nG₀ : Type u_1\nM₀' : Type ?u.19064\nG₀' : Type ?u.19067\nF : Type ?u.19070\nF' : Type ?u.19073\ninst✝¹ : MonoidWithZero M₀\ninst✝ : GroupWithZero G₀\na b c : G₀\nha : a ≠ 0\nhb : b ≠ 0\n⊢ a * b⁻¹ ≠ 0",
"state_before": "α : Type ?u.19055\nM₀ : Type ?u.... | [
286,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
1
] |
Mathlib/MeasureTheory/Measure/VectorMeasure.lean | MeasureTheory.Measure.toSignedMeasure_sub_apply | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.150394\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝¹ : IsFiniteMeasure μ\ninst✝ : IsFiniteMeasure ν\ni : Set α\nhi : MeasurableSet i\n⊢ ↑(toSignedMeasure μ - toSignedMeasure ν) i = ENNReal.toReal (↑↑μ i) - ENNReal.toReal (↑↑ν i)",
... | [
523,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
519,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | half_le_self_iff | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.94503\nα : Type u_1\nβ : Type ?u.94509\ninst✝ : LinearOrderedSemifield α\na b c d e : α\nm n : ℤ\n⊢ a / 2 ≤ a ↔ 0 ≤ a",
"tactic": "rw [div_le_iff (zero_lt_two' α), mul_two, le_add_iff_nonneg_left]"
}
] | [
516,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
515,
1
] |
Mathlib/Algebra/Hom/NonUnitalAlg.lean | NonUnitalAlgHom.coe_inr | [] | [
401,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
400,
1
] |
Mathlib/Analysis/NormedSpace/Extr.lean | IsMaxOn.norm_add_self | [] | [
66,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/Computability/NFA.lean | NFA.stepSet_empty | [
{
"state_after": "no goals",
"state_before": "α : Type u\nσ σ' : Type v\nM : NFA α σ\na : α\n⊢ stepSet M ∅ a = ∅",
"tactic": "simp [stepSet]"
}
] | [
62,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
62,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.mul_div_le | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.239646\nβ : Type ?u.239649\nγ : Type ?u.239652\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\na b : Ordinal\nb0 : b = 0\n⊢ b * (a / b) ≤ a",
"tactic": "simp only [b0, zero_mul, Ordinal.zero_le]"
}
] | [
938,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
937,
1
] |
Mathlib/Algebra/Order/Field/Power.lean | zpow_bit1_nonpos_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedField α\na b c d : α\nn : ℤ\n⊢ a ^ bit1 n ≤ 0 ↔ a ≤ 0",
"tactic": "rw [le_iff_lt_or_eq, le_iff_lt_or_eq, zpow_bit1_neg_iff, zpow_eq_zero_iff (Int.bit1_ne_zero n)]"
}
] | [
171,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/Order/PropInstances.lean | Pi.isCompl_iff | [
{
"state_after": "no goals",
"state_before": "ι : Type u_2\nα' : ι → Type u_1\ninst✝¹ : (i : ι) → PartialOrder (α' i)\ninst✝ : (i : ι) → BoundedOrder (α' i)\nf g : (i : ι) → α' i\n⊢ IsCompl f g ↔ ∀ (i : ι), IsCompl (f i) (g i)",
"tactic": "simp_rw [_root_.isCompl_iff, disjoint_iff, codisjoint_iff, foral... | [
95,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/Analysis/Calculus/LHopital.lean | deriv.lhopital_zero_atBot | [
{
"state_after": "a b : ℝ\nhab : a < b\nl : Filter ℝ\nf f' g g' : ℝ → ℝ\nhdf : ∀ᶠ (x : ℝ) in atBot, DifferentiableAt ℝ f x\nhg' : ∀ᶠ (x : ℝ) in atBot, deriv g x ≠ 0\nhfbot : Tendsto f atBot (𝓝 0)\nhgbot : Tendsto g atBot (𝓝 0)\nhdiv : Tendsto (fun x => deriv f x / deriv g x) atBot l\nhdg : ∀ᶠ (x : ℝ) in atBot... | [
463,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
452,
1
] |
Mathlib/LinearAlgebra/Matrix/Determinant.lean | Matrix.det_updateRow_add_smul_self | [
{
"state_after": "no goals",
"state_before": "m : Type ?u.1684713\nn : Type u_1\ninst✝⁴ : DecidableEq n\ninst✝³ : Fintype n\ninst✝² : DecidableEq m\ninst✝¹ : Fintype m\nR : Type v\ninst✝ : CommRing R\nA : Matrix n n R\ni j : n\nhij : i ≠ j\nc : R\n⊢ det (updateRow A i (A i + c • A j)) = det A",
"tactic"... | [
463,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
460,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.mul_iInter₂_subset | [] | [
544,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
542,
1
] |
Mathlib/Algebra/BigOperators/Multiset/Basic.lean | Multiset.prod_map_eq_pow_single | [
{
"state_after": "case h\nι : Type u_1\nα : Type u_2\nβ : Type ?u.22654\nγ : Type ?u.22657\ninst✝¹ : CommMonoid α\ns t : Multiset α\na : α\nm : Multiset ι\nf g : ι → α\ninst✝ : DecidableEq ι\ni : ι\nhf✝ : ∀ (i' : ι), i' ≠ i → i' ∈ m → f i' = 1\nl : List ι\nhf : ∀ (i' : ι), i' ≠ i → i' ∈ Quotient.mk (List.isSeto... | [
140,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/Topology/UniformSpace/Cauchy.lean | totallyBounded_of_forall_symm | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝ : UniformSpace α\ns : Set α\nh : ∀ (V : Set (α × α)), V ∈ 𝓤 α → SymmetricRel V → ∃ t, Set.Finite t ∧ s ⊆ ⋃ (y : α) (_ : y ∈ t), ball y V\nV : Set (α × α)\nhV : V ∈ 𝓤 α ∧ SymmetricRel V\n⊢ ∃ t, Set.Finite t ∧ s ⊆ ⋃ (y : α) (_ : y ∈... | [
495,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
491,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | lcm_units_coe_right | [] | [
792,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
791,
1
] |
Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean | ProjectiveSpectrum.zeroLocus_span | [
{
"state_after": "case h\nR : Type u_2\nA : Type u_1\ninst✝³ : CommSemiring R\ninst✝² : CommRing A\ninst✝¹ : Algebra R A\n𝒜 : ℕ → Submodule R A\ninst✝ : GradedAlgebra 𝒜\ns : Set A\nx : ProjectiveSpectrum 𝒜\n⊢ x ∈ zeroLocus 𝒜 ↑(Ideal.span s) ↔ x ∈ zeroLocus 𝒜 s",
"state_before": "R : Type u_2\nA : Type ... | [
87,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Std/Data/List/Lemmas.lean | List.length_filter_le | [] | [
1219,
67
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1218,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | uniformContinuous_iff | [] | [
1301,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1299,
1
] |
Mathlib/MeasureTheory/Function/EssSup.lean | essSup_comp_le_essSup_map_measure | [
{
"state_after": "α : Type u_1\nβ : Type u_3\nm : MeasurableSpace α\nμ ν : MeasureTheory.Measure α\ninst✝ : CompleteLattice β\nγ : Type u_2\nmγ : MeasurableSpace γ\nf : α → γ\ng : γ → β\nhf : AEMeasurable f\nt : Set β\n⊢ t ∈ map g (Measure.ae (Measure.map f μ)) → t ∈ map (g ∘ f) (Measure.ae μ)",
"state_befo... | [
234,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
226,
1
] |
Mathlib/Algebra/Hom/Units.lean | IsUnit.div_eq_of_eq_mul | [] | [
424,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
11
] |
Mathlib/Order/Monotone/Basic.lean | StrictAntiOn.cmp_map_eq | [] | [
951,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
949,
1
] |
Mathlib/Topology/Semicontinuous.lean | lowerSemicontinuous_ciSup | [] | [
614,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
612,
1
] |
Mathlib/Data/Set/Intervals/WithBotTop.lean | WithBot.image_coe_Ico | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : PartialOrder α\na b : α\n⊢ some '' Ico a b = Ico ↑a ↑b",
"tactic": "rw [← preimage_coe_Ico, image_preimage_eq_inter_range, range_coe,\n inter_eq_self_of_subset_left\n (Subset.trans Ico_subset_Ici_self <| Ici_subset_Ioi.2 <| bot_lt_c... | [
230,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
227,
1
] |
Mathlib/LinearAlgebra/Matrix/Trace.lean | Matrix.trace_one | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.21632\nm : Type ?u.21635\nn : Type u_2\np : Type ?u.21641\nα : Type ?u.21644\nR : Type u_1\nS : Type ?u.21650\ninst✝⁴ : Fintype m\ninst✝³ : Fintype n\ninst✝² : Fintype p\ninst✝¹ : DecidableEq n\ninst✝ : AddCommMonoidWithOne R\n⊢ trace 1 = ↑(Fintype.c... | [
138,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/Tactic/PushNeg.lean | Mathlib.Tactic.PushNeg.not_and_or_eq | [] | [
21,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
21,
1
] |
Mathlib/GroupTheory/Subgroup/Pointwise.lean | Subgroup.smul_mem_pointwise_smul_iff₀ | [] | [
407,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
405,
1
] |
Mathlib/Logic/Denumerable.lean | Nat.Subtype.coe_comp_ofNat_range | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.71312\nβ : Type ?u.71315\ns : Set ℕ\ninst✝¹ : Infinite ↑s\ninst✝ : DecidablePred fun x => x ∈ s\n⊢ Set.range (Subtype.val ∘ ofNat s) = s",
"tactic": "rw [Set.range_comp Subtype.val, ofNat_range, Set.image_univ, Subtype.range_coe]"
}
] | [
318,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
317,
1
] |
Mathlib/Algebra/Category/ModuleCat/Monoidal/Closed.lean | ModuleCat.monoidalClosed_uncurry | [] | [
82,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
78,
1
] |
Mathlib/Analysis/Calculus/Deriv/ZPow.lean | DifferentiableWithinAt.zpow | [] | [
159,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Std/Logic.lean | Or.neg_resolve_left | [] | [
270,
79
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
270,
1
] |
Mathlib/Algebra/Squarefree.lean | IsUnit.squarefree | [] | [
45,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
44,
1
] |
Mathlib/Data/Real/CauSeq.lean | CauSeq.le_sup_left | [] | [
952,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
951,
11
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.gt_of_neg_of_infinitesimal | [] | [
677,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
676,
1
] |
Mathlib/Topology/VectorBundle/Basic.lean | Trivialization.linear | [] | [
184,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
181,
11
] |
Mathlib/GroupTheory/Abelianization.lean | Abelianization.commutator_subset_ker | [
{
"state_after": "G : Type u\ninst✝¹ : Group G\nA : Type v\ninst✝ : CommGroup A\nf : G →* A\n⊢ commutatorSet G ⊆ ↑(MonoidHom.ker f)",
"state_before": "G : Type u\ninst✝¹ : Group G\nA : Type v\ninst✝ : CommGroup A\nf : G →* A\n⊢ commutator G ≤ MonoidHom.ker f",
"tactic": "rw [commutator_eq_closure, Subgr... | [
133,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/Probability/ProbabilityMassFunction/Monad.lean | Pmf.toMeasure_pure | [
{
"state_after": "α : Type u_1\nβ : Type ?u.7470\nγ : Type ?u.7473\na a' : α\ns✝ : Set α\ninst✝ : MeasurableSpace α\ns : Set α\nhs : MeasurableSet s\n⊢ (if a ∈ s then 1 else 0) = Set.indicator s 1 a",
"state_before": "α : Type u_1\nβ : Type ?u.7470\nγ : Type ?u.7473\na a' : α\ns✝ : Set α\ninst✝ : Measurable... | [
95,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
94,
1
] |
Mathlib/CategoryTheory/Abelian/Exact.lean | CategoryTheory.Functor.preservesZeroMorphisms_of_map_exact | [
{
"state_after": "C : Type u₁\ninst✝⁵ : Category C\ninst✝⁴ : Abelian C\nA : Type u₁\nB : Type u₂\ninst✝³ : Category A\ninst✝² : Category B\ninst✝¹ : Abelian A\ninst✝ : Abelian B\nL : A ⥤ B\nh : L.map (𝟙 0) ≫ L.map (𝟙 0) = 0\n⊢ PreservesZeroMorphisms L",
"state_before": "C : Type u₁\ninst✝⁵ : Category C\ni... | [
390,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
387,
1
] |
Mathlib/Order/LiminfLimsup.lean | Filter.limsup_eq_iInf_iSup_of_nat | [
{
"state_after": "α : Type u_1\nβ : Type ?u.106921\nγ : Type ?u.106924\nι : Type ?u.106927\ninst✝ : CompleteLattice α\nu : ℕ → α\n⊢ (⨅ (i : ℕ), ⨆ (a : ℕ) (_ : a ∈ Ici i), u a) = ⨅ (n : ℕ), ⨆ (i : ℕ) (_ : i ≥ n), u i",
"state_before": "α : Type u_1\nβ : Type ?u.106921\nγ : Type ?u.106924\nι : Type ?u.106927\... | [
700,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
699,
1
] |
Mathlib/Order/Max.lean | IsMax.prod_mk | [] | [
416,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
416,
1
] |
Mathlib/Analysis/Fourier/FourierTransform.lean | VectorFourier.fourierIntegral_continuous | [
{
"state_after": "case hF_meas\n𝕜 : Type u_2\ninst✝¹⁴ : CommRing 𝕜\nV : Type u_3\ninst✝¹³ : AddCommGroup V\ninst✝¹² : Module 𝕜 V\ninst✝¹¹ : MeasurableSpace V\nW : Type u_1\ninst✝¹⁰ : AddCommGroup W\ninst✝⁹ : Module 𝕜 W\nE : Type u_4\ninst✝⁸ : NormedAddCommGroup E\ninst✝⁷ : NormedSpace ℂ E\ninst✝⁶ : Topologi... | [
180,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
1
] |
Std/Logic.lean | exists_eq_right_right' | [
{
"state_after": "α : Sort u_1\np q : α → Prop\nb : Prop\na' : α\n⊢ (∃ a, p a ∧ b ∧ a = a') ↔ p a' ∧ b",
"state_before": "α : Sort u_1\np q : α → Prop\nb : Prop\na' : α\n⊢ (∃ a, p a ∧ b ∧ a' = a) ↔ p a' ∧ b",
"tactic": "(conv in _=_ => rw [eq_comm])"
},
{
"state_after": "no goals",
"state_be... | [
480,
38
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
479,
9
] |
Std/Data/Nat/Lemmas.lean | Nat.le_zero | [] | [
395,
55
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
394,
1
] |
Mathlib/Order/Ideal.lean | Order.Cofinal.le_above | [] | [
545,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
544,
1
] |
Mathlib/Analysis/Convex/Extrema.lean | IsMaxOn.of_isLocalMaxOn_of_concaveOn | [] | [
77,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/Analysis/NormedSpace/Pointwise.lean | closedBall_add_ball | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.1204873\nE : Type u_1\ninst✝³ : NormedField 𝕜\ninst✝² : SeminormedAddCommGroup E\ninst✝¹ : NormedSpace 𝕜 E\ninst✝ : NormedSpace ℝ E\nx y z : E\nδ ε : ℝ\nhε : 0 ≤ ε\nhδ : 0 < δ\na b : E\n⊢ Metric.closedBall a ε + Metric.ball b δ = Metric.ball (a + ... | [
370,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
368,
1
] |
Mathlib/Analysis/MeanInequalities.lean | NNReal.inner_le_Lp_mul_Lq_hasSum | [
{
"state_after": "case intro\nι : Type u\ns : Finset ι\nf g : ι → ℝ≥0\nA B : ℝ≥0\np q : ℝ\nhpq : Real.IsConjugateExponent p q\nhf : HasSum (fun i => f i ^ p) (A ^ p)\nhg : HasSum (fun i => g i ^ q) (B ^ q)\nH₁ : Summable fun i => f i * g i\nH₂ : (∑' (i : ι), f i * g i) ≤ (∑' (i : ι), f i ^ p) ^ (1 / p) * (∑' (i... | [
429,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
420,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.comap_le_map_of_inv_on | [] | [
1363,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1362,
1
] |
Mathlib/Data/Finsupp/Multiset.lean | Finsupp.toMultiset_sum | [] | [
76,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/Topology/Basic.lean | closure_image_closure | [] | [
1764,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1760,
1
] |
Mathlib/Algebra/Squarefree.lean | Int.squarefree_coe_nat | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.125583\nn : ℕ\n⊢ Squarefree ↑n ↔ Squarefree n",
"tactic": "rw [← squarefree_natAbs, natAbs_ofNat]"
}
] | [
279,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
278,
1
] |
Mathlib/Analysis/SpecialFunctions/Exp.lean | Complex.tendsto_exp_comap_re_atBot | [] | [
460,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
459,
1
] |
Mathlib/Algebra/Category/ModuleCat/Abelian.lean | ModuleCat.exact_iff | [
{
"state_after": "R : Type u\ninst✝ : Ring R\nM N : ModuleCat R\nf : M ⟶ N\nO : ModuleCat R\ng : N ⟶ O\n⊢ f ≫ g = 0 ∧ Fork.ι (kernelCone g) ≫ Cofork.π (cokernelCocone f) = 0 ↔ range f = ker g",
"state_before": "R : Type u\ninst✝ : Ring R\nM N : ModuleCat R\nf : M ⟶ N\nO : ModuleCat R\ng : N ⟶ O\n⊢ Exact f g... | [
129,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/Order/Basic.lean | ne_iff_lt_iff_le | [] | [
449,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
447,
1
] |
Mathlib/Order/Bounds/Basic.lean | BddAbove.image2 | [
{
"state_after": "case intro.intro\nα : Type u\nβ : Type v\nγ : Type w\nι : Sort x\ninst✝² : Preorder α\ninst✝¹ : Preorder β\ninst✝ : Preorder γ\nf : α → β → γ\ns : Set α\nt : Set β\na✝ : α\nb✝ : β\nh₀ : ∀ (b : β), Monotone (swap f b)\nh₁ : ∀ (a : α), Monotone (f a)\na : α\nha : a ∈ upperBounds s\nb : β\nhb : b... | [
1381,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1379,
1
] |
Mathlib/Order/Heyting/Basic.lean | himp_inf_self | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.28717\nα : Type u_1\nβ : Type ?u.28723\ninst✝ : GeneralizedHeytingAlgebra α\na✝ b✝ c d a b : α\n⊢ (a ⇨ b) ⊓ a = b ⊓ a",
"tactic": "rw [inf_comm, inf_himp, inf_comm]"
}
] | [
361,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/Data/Set/Intervals/SurjOn.lean | surjOn_Icc_of_monotone_surjective | [
{
"state_after": "α : Type u_1\nβ : Type u_2\ninst✝¹ : LinearOrder α\ninst✝ : PartialOrder β\nf : α → β\nh_mono : Monotone f\nh_surj : Surjective f\na b : α\nhab : a ≤ b\np : β\nhp : p ∈ Icc (f a) (f b)\n⊢ p ∈ f '' Icc a b",
"state_before": "α : Type u_1\nβ : Type u_2\ninst✝¹ : LinearOrder α\ninst✝ : Partia... | [
64,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/Data/Set/Image.lean | Option.injective_iff | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nf : Option α → β\n⊢ ((Injective fun x => f (some x)) ∧ ∀ (x : α), ¬f (some x) = f none) → Injective f",
"state_before": "α : Type u_1\nβ : Type u_2\nf : Option α → β\n⊢ Injective f ↔ (Injective fun x => f (some x)) ∧ ∀ (x : α), ¬f (some x) = f none",
"tactic... | [
1501,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1495,
1
] |
Mathlib/Topology/Semicontinuous.lean | ContinuousWithinAt.upperSemicontinuousWithinAt | [] | [
812,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
811,
1
] |
Mathlib/Data/List/ToFinsupp.lean | List.toFinsupp_append | [
{
"state_after": "case h\nM : Type ?u.10005\ninst✝⁵ : Zero M\nl : List M\ninst✝⁴ : DecidablePred fun x => getD l x 0 ≠ 0\nn✝ : ℕ\nR : Type u_1\ninst✝³ : AddZeroClass R\nl₁ l₂ : List R\ninst✝² : DecidablePred fun x => getD (l₁ ++ l₂) x 0 ≠ 0\ninst✝¹ : DecidablePred fun x => getD l₁ x 0 ≠ 0\ninst✝ : DecidablePred... | [
129,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineMap.lean | AffineMap.lineMap_symm | [
{
"state_after": "k : Type u_1\nV1 : Type u_2\nP1 : Type u_3\nV2 : Type ?u.527038\nP2 : Type ?u.527041\nV3 : Type ?u.527044\nP3 : Type ?u.527047\nV4 : Type ?u.527050\nP4 : Type ?u.527053\ninst✝¹² : Ring k\ninst✝¹¹ : AddCommGroup V1\ninst✝¹⁰ : Module k V1\ninst✝⁹ : AffineSpace V1 P1\ninst✝⁸ : AddCommGroup V2\nin... | [
625,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
622,
1
] |
Mathlib/Analysis/SpecialFunctions/Integrals.lean | intervalIntegral.intervalIntegrable_id | [] | [
187,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
186,
1
] |
Mathlib/Data/Set/Lattice.lean | Antitone.iInter_nat_add | [] | [
2212,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2210,
1
] |
Mathlib/Order/GameAdd.lean | Sym2.GameAdd.fix_eq | [
{
"state_after": "α : Type u_2\nβ : Type ?u.8826\nrα : α → α → Prop\nrβ : β → β → Prop\nC : α → α → Sort u_1\nhr : WellFounded rα\nIH :\n (a₁ b₁ : α) →\n ((a₂ b₂ : α) → GameAdd rα (Quotient.mk (Rel.setoid α) (a₂, b₂)) (Quotient.mk (Rel.setoid α) (a₁, b₁)) → C a₂ b₂) →\n C a₁ b₁\na b : α\n⊢ WellFounded.... | [
242,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Algebra/GroupPower/Ring.lean | mul_neg_one_pow_eq_zero_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nS : Type ?u.121845\nM : Type ?u.121848\ninst✝ : Ring R\na b : R\nn : ℕ\nr : R\n⊢ r * (-1) ^ n = 0 ↔ r = 0",
"tactic": "rcases neg_one_pow_eq_or R n with h | h <;> simp [h]"
}
] | [
251,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
250,
1
] |
Mathlib/Algebra/Order/Hom/Monoid.lean | map_nonpos | [
{
"state_after": "F : Type u_3\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.33978\nδ : Type ?u.33981\ninst✝² : OrderedAddCommMonoid α\ninst✝¹ : OrderedAddCommMonoid β\ninst✝ : OrderAddMonoidHomClass F α β\nf : F\na : α\nha : a ≤ 0\n⊢ ↑f a ≤ ↑f 0",
"state_before": "F : Type u_3\nα : Type u_1\nβ : Type u_2\nγ : T... | [
229,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
227,
1
] |
Mathlib/Analysis/InnerProductSpace/Projection.lean | OrthogonalFamily.isInternal_iff | [] | [
1256,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1252,
1
] |
Mathlib/NumberTheory/Liouville/LiouvilleWith.lean | LiouvilleWith.ne_cast_int | [
{
"state_after": "p q y : ℝ\nr : ℚ\nm✝ : ℤ\nn : ℕ\nhp : 1 < p\nm : ℤ\nh : LiouvilleWith p ↑m\n⊢ False",
"state_before": "p q x y : ℝ\nr : ℚ\nm✝ : ℤ\nn : ℕ\nh : LiouvilleWith p x\nhp : 1 < p\nm : ℤ\n⊢ x ≠ ↑m",
"tactic": "rintro rfl"
},
{
"state_after": "p q y : ℝ\nr : ℚ\nm : ℤ\nn : ℕ\nhp : 1 < p\... | [
324,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/Analysis/Calculus/Taylor.lean | taylorWithinEval_hasDerivAt_Ioo | [] | [
218,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
210,
1
] |
Mathlib/Algebra/Periodic.lean | Function.Antiperiodic.int_mul_eq_of_eq_zero | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.162678\nf g : α → β\nc c₁ c₂ x : α\ninst✝¹ : Ring α\ninst✝ : SubtractionMonoid β\nh : Antiperiodic f c\nhi : f 0 = 0\nn : ℕ\n⊢ f (↑↑n * c) = 0",
"tactic": "rw [Int.cast_ofNat, h.nat_mul_eq_of_eq_zero hi n]"
},
{
... | [
432,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
429,
1
] |
Mathlib/Order/CompactlyGenerated.lean | CompleteLattice.WellFounded.finite_of_setIndependent | [
{
"state_after": "ι : Sort ?u.78582\nα : Type u_1\ninst✝ : CompleteLattice α\nf : ι → α\nh : WellFounded fun x x_1 => x > x_1\ns : Set α\nhs : SetIndependent s\ncontra : Set.Infinite s\n⊢ False",
"state_before": "ι : Sort ?u.78582\nα : Type u_1\ninst✝ : CompleteLattice α\nf : ι → α\nh : WellFounded fun x x_... | [
319,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
304,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.cof_lsub_le | [
{
"state_after": "α : Type ?u.21876\nr : α → α → Prop\nι : Type u\nf : ι → Ordinal\n⊢ sInf {a | ∃ ι_1 f_1, lsub f_1 = lsub f ∧ (#ι_1) = a} ≤ (#ι)",
"state_before": "α : Type ?u.21876\nr : α → α → Prop\nι : Type u\nf : ι → Ordinal\n⊢ cof (lsub f) ≤ (#ι)",
"tactic": "rw [cof_eq_sInf_lsub]"
},
{
"s... | [
308,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
306,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.sup_lt_ord | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.30591\nr : α → α → Prop\nι : Type u\nf : ι → Ordinal\nc : Ordinal\nhι : (#ι) < cof c\n⊢ Cardinal.lift (#ι) < cof c",
"tactic": "rwa [(#ι).lift_id]"
}
] | [
363,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/CommSq.lean | CategoryTheory.IsPullback.of_hasBinaryProduct | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝³ : Category C\nP X Y Z : C\nfst : P ⟶ X\nsnd : P ⟶ Y\nf : X ⟶ Z\ng : Y ⟶ Z\ninst✝² : HasBinaryProduct X Y\ninst✝¹ : HasZeroObject C\ninst✝ : HasZeroMorphisms C\n⊢ IsPullback prod.fst prod.snd 0 0",
"tactic": "convert @of_is_product _ _ X Y... | [
276,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
274,
1
] |
Mathlib/Order/Chain.lean | maxChain_spec | [] | [
280,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.