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/Combinatorics/Pigeonhole.lean | Fintype.exists_le_card_fiber_of_mul_le_card | [] | [
435,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
433,
1
] |
Mathlib/CategoryTheory/StructuredArrow.lean | CategoryTheory.StructuredArrow.id_right | [] | [
94,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/Topology/UnitInterval.lean | affineHomeomorph_image_I | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝² : LinearOrderedField 𝕜\ninst✝¹ : TopologicalSpace 𝕜\ninst✝ : TopologicalRing 𝕜\na b : 𝕜\nh : 0 < a\n⊢ ↑(affineHomeomorph a b (_ : a ≠ 0)) '' Icc 0 1 = Icc b (a + b)",
"tactic": "simp [h]"
}
] | [
218,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
217,
1
] |
Mathlib/Topology/MetricSpace/Gluing.lean | Metric.Sigma.isOpen_iff | [
{
"state_after": "case mp\nι : Type u_2\nE : ι → Type u_1\ninst✝ : (i : ι) → MetricSpace (E i)\ns : Set ((i : ι) × E i)\n⊢ IsOpen s → ∀ (x : (i : ι) × E i), x ∈ s → ∃ ε, ε > 0 ∧ ∀ (y : (i : ι) × E i), dist x y < ε → y ∈ s\n\ncase mpr\nι : Type u_2\nE : ι → Type u_1\ninst✝ : (i : ι) → MetricSpace (E i)\ns : Set ... | [
404,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
383,
11
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | AffineSubspace.preimage_coe_affineSpan_singleton | [] | [
723,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
721,
1
] |
Mathlib/Topology/Homeomorph.lean | Homeomorph.preimage_frontier | [] | [
360,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
359,
1
] |
Mathlib/Data/Real/Sqrt.lean | Real.sqrt_div_self | [
{
"state_after": "no goals",
"state_before": "x : ℝ\n⊢ sqrt x / x = (sqrt x)⁻¹",
"tactic": "rw [sqrt_div_self', one_div]"
}
] | [
429,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
429,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snorm'_le_snormEssSup | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nE : Type ?u.4185587\nF : Type u_2\nG : Type ?u.4185593\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedAddCommGroup F\ninst✝¹ : NormedAddCommGroup G\nhq_pos : 0 < q\nf : α → F\ninst✝ : IsPr... | [
1105,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1103,
1
] |
Mathlib/Data/Matrix/Hadamard.lean | Matrix.hadamard_add | [] | [
78,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/Analysis/SpecialFunctions/Complex/Circle.lean | surjOn_expMapCircle_neg_pi_pi | [] | [
85,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/RingTheory/Artinian.lean | isArtinian_of_range_eq_ker | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nM : Type u_2\nP : Type u_3\nN : Type u_4\ninst✝⁸ : Ring R\ninst✝⁷ : AddCommGroup M\ninst✝⁶ : AddCommGroup P\ninst✝⁵ : AddCommGroup N\ninst✝⁴ : Module R M\ninst✝³ : Module R P\ninst✝² : Module R N\ninst✝¹ : IsArtinian R M\ninst✝ : IsArtinian R P\nf ... | [
110,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
1
] |
Mathlib/Algebra/CubicDiscriminant.lean | Cubic.leadingCoeff_of_c_eq_zero' | [] | [
241,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
240,
1
] |
Mathlib/LinearAlgebra/Finsupp.lean | Finsupp.lcongr_symm_single | [
{
"state_after": "α : Type ?u.556480\nM : Type u_4\nN : Type u_5\nP : Type ?u.556489\nR : Type u_3\nS : Type ?u.556495\ninst✝⁷ : Semiring R\ninst✝⁶ : Semiring S\ninst✝⁵ : AddCommMonoid M\ninst✝⁴ : Module R M\ninst✝³ : AddCommMonoid N\ninst✝² : Module R N\ninst✝¹ : AddCommMonoid P\ninst✝ : Module R P\nι : Type u... | [
913,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
910,
1
] |
Mathlib/Algebra/Homology/ImageToKernel.lean | imageSubobjectIso_imageToKernel' | [
{
"state_after": "case h\nι : Type ?u.276606\nV : Type u\ninst✝³ : Category V\ninst✝² : HasZeroMorphisms V\nA B C : V\nf : A ⟶ B\ng : B ⟶ C\nw✝ : f ≫ g = 0\ninst✝¹ : HasKernels V\ninst✝ : HasImages V\nw : f ≫ g = 0\n⊢ ((imageSubobjectIso f).hom ≫ imageToKernel' f g w) ≫ equalizer.ι g 0 =\n (imageToKernel f g... | [
404,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
400,
1
] |
Mathlib/Combinatorics/Additive/Energy.lean | Finset.multiplicativeEnergy_empty_right | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : Mul α\ns s₁ s₂ t t₁ t₂ : Finset α\n⊢ multiplicativeEnergy s ∅ = 0",
"tactic": "simp [multiplicativeEnergy]"
}
] | [
104,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
1
] |
Mathlib/Algebra/Star/Subalgebra.lean | StarSubalgebra.inclusion_injective | [] | [
184,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Topology/Algebra/Monoid.lean | tendsto_multiset_prod | [
{
"state_after": "case mk\nι : Type u_2\nα : Type u_1\nX : Type ?u.408366\nM : Type u_3\nN : Type ?u.408372\ninst✝³ : TopologicalSpace X\ninst✝² : TopologicalSpace M\ninst✝¹ : CommMonoid M\ninst✝ : ContinuousMul M\nf : ι → α → M\nx : Filter α\na : ι → M\ns : Multiset ι\nl : List ι\n⊢ (∀ (i : ι), i ∈ Quot.mk Set... | [
734,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
730,
1
] |
Mathlib/Algebra/GradedMonoid.lean | SetLike.list_prod_ofFn_mem_graded | [
{
"state_after": "ι : Type u_3\nR : Type u_1\nS : Type u_2\ninst✝³ : SetLike S R\ninst✝² : Monoid R\ninst✝¹ : AddMonoid ι\nA : ι → S\ninst✝ : GradedMonoid A\nn : ℕ\ni : Fin n → ι\nr : Fin n → R\nh : ∀ (j : Fin n), r j ∈ A (i j)\n⊢ List.prod (List.map r (List.finRange n)) ∈ A (List.sum (List.map i (List.finRange... | [
585,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
582,
1
] |
Mathlib/CategoryTheory/Limits/Constructions/Pullbacks.lean | CategoryTheory.Limits.hasColimit_span_of_hasColimit_pair_of_hasColimit_parallelPair | [
{
"state_after": "no goals",
"state_before": "C : Type u\n𝒞 : Category C\nX Y Z : C\nf : X ⟶ Y\ng : X ⟶ Z\ninst✝¹ : HasColimit (pair Y Z)\ninst✝ : HasColimit (parallelPair (f ≫ coprod.inl) (g ≫ coprod.inr))\nι₁ : Y ⟶ Y ⨿ Z := coprod.inl\nι₂ : Z ⟶ Y ⨿ Z := coprod.inr\nc : Y ⨿ Z ⟶ coequalizer (f ≫ ι₁) (g ≫ ι... | [
88,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.mapRange_zero | [
{
"state_after": "case h\nι : Type u\nγ : Type w\nβ : ι → Type v\nβ₁ : ι → Type v₁\nβ₂ : ι → Type v₂\ninst✝² : (i : ι) → Zero (β i)\ninst✝¹ : (i : ι) → Zero (β₁ i)\ninst✝ : (i : ι) → Zero (β₂ i)\nf : (i : ι) → β₁ i → β₂ i\nhf : ∀ (i : ι), f i 0 = 0\ni✝ : ι\n⊢ ↑(mapRange f hf 0) i✝ = ↑0 i✝",
"state_before": ... | [
181,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
178,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.eq_of_not_mem_of_mem_insert | [] | [
1077,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1076,
1
] |
Mathlib/Order/Monotone/Basic.lean | StrictAnti.comp_strictMonoOn | [] | [
711,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
709,
1
] |
Mathlib/Analysis/Calculus/MeanValue.lean | exists_ratio_deriv_eq_ratio_slope' | [] | [
778,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
771,
1
] |
Mathlib/Data/Real/NNReal.lean | NNReal.coe_pos | [] | [
379,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
11
] |
Mathlib/GroupTheory/Index.lean | Subgroup.relindex_sup_right | [] | [
156,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.coe_castAdd | [] | [
1131,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1130,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.Integrable.abs | [
{
"state_after": "α : Type u_2\nβ✝ : Type ?u.955189\nγ : Type ?u.955192\nδ : Type ?u.955195\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝³ : MeasurableSpace δ\ninst✝² : NormedAddCommGroup β✝\ninst✝¹ : NormedAddCommGroup γ\nβ : Type u_1\ninst✝ : NormedLatticeAddCommGroup β\nf : α → β\nhf : Memℒp f 1\n⊢ Memℒp (f... | [
711,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
708,
1
] |
Mathlib/Dynamics/Ergodic/MeasurePreserving.lean | MeasureTheory.MeasurePreserving.restrict_image_emb | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.53205\nδ : Type ?u.53208\ninst✝³ : MeasurableSpace α\ninst✝² : MeasurableSpace β\ninst✝¹ : MeasurableSpace γ\ninst✝ : MeasurableSpace δ\nμa : Measure α\nμb : Measure β\nμc : Measure γ\nμd : Measure δ\nf : α → β\nhf : Measu... | [
87,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Data/Set/Intervals/Pi.lean | Set.image_update_Ico_left | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nα : ι → Type u_2\ninst✝¹ : DecidableEq ι\ninst✝ : (i : ι) → PartialOrder (α i)\nf : (i : ι) → α i\ni : ι\na : α i\n⊢ update f i '' Ico a (f i) = Ico (update f i a) f",
"tactic": "simpa using image_update_Ico f i a (f i)"
}
] | [
168,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/FieldTheory/Adjoin.lean | IntermediateField.algHom_mk_adjoin_splits | [
{
"state_after": "case intro\nF : Type u_2\nE : Type u_1\nK : Type u_3\ninst✝⁴ : Field F\ninst✝³ : Field E\ninst✝² : Field K\ninst✝¹ : Algebra F E\ninst✝ : Algebra F K\nS : Set E\nhK : ∀ (s : E), s ∈ S → IsIntegral F s ∧ Splits (algebraMap F K) (minpoly F s)\nx : Lifts F E K\nhx : ∀ (a : Lifts F E K), x ≤ a → a... | [
1158,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1146,
1
] |
Mathlib/Logic/Function/Basic.lean | Function.sometimes_eq | [] | [
974,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
973,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean | Sbtw.angle₂₃₁_eq_zero | [] | [
369,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
368,
1
] |
Mathlib/Data/List/Basic.lean | List.foldl_eq_of_comm_of_assoc | [
{
"state_after": "ι : Type ?u.249050\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nf : α → α → α\nhcomm : Commutative f\nhassoc : Associative f\na b c : α\nl : List α\n⊢ foldl f (f (f a b) c) l = f b (foldl f (f a c) l)",
"state_before": "ι : Type ?u.249050\nα : Type u\nβ : Type v\nγ : Ty... | [
2709,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2705,
1
] |
Mathlib/Data/Rat/NNRat.lean | Rat.toNNRat_add_le | [] | [
383,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
382,
1
] |
Mathlib/Analysis/SumIntegralComparisons.lean | MonotoneOn.integral_le_sum_Ico | [
{
"state_after": "x₀ : ℝ\na b : ℕ\nf : ℝ → ℝ\nhab : a ≤ b\nhf : MonotoneOn f (Icc ↑a ↑b)\n⊢ ∑ x in Finset.Ico a b, -f ↑(x + 1) ≤ ∫ (x : ℝ) in ↑a..↑b, -f x",
"state_before": "x₀ : ℝ\na b : ℕ\nf : ℝ → ℝ\nhab : a ≤ b\nhf : MonotoneOn f (Icc ↑a ↑b)\n⊢ (∫ (x : ℝ) in ↑a..↑b, f x) ≤ ∑ i in Finset.Ico a b, f ↑(i + ... | [
177,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
174,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | Differentiable.sum | [] | [
377,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
376,
1
] |
Mathlib/RingTheory/Adjoin/Basic.lean | Algebra.adjoin_eq_ring_closure | [] | [
397,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
395,
1
] |
Mathlib/MeasureTheory/Function/LpSpace.lean | MeasureTheory.Lp.ae_tendsto_of_cauchy_snorm' | [
{
"state_after": "α : Type u_2\nE : Type u_1\nF : Type ?u.8191047\nG : Type ?u.8191050\nm m0 : MeasurableSpace α\np✝ : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedAddCommGroup F\ninst✝¹ : NormedAddCommGroup G\ninst✝ : CompleteSpace E\nf : ℕ → α → E\np : ℝ\nhf : ∀ (n : ℕ), AEStron... | [
1454,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1414,
1
] |
Mathlib/Algebra/Star/Free.lean | FreeAlgebra.star_algebraMap | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : CommSemiring R\nX : Type u_2\nr : R\n⊢ star (↑(algebraMap R (FreeAlgebra R X)) r) = ↑(algebraMap R (FreeAlgebra R X)) r",
"tactic": "simp [star, Star.star]"
}
] | [
75,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | tendsto_left_nhds_uniformity | [] | [
864,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
863,
1
] |
Mathlib/Topology/Sets/Closeds.lean | TopologicalSpace.Clopens.ext | [] | [
307,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
306,
11
] |
Mathlib/Algebra/GCDMonoid/Finset.lean | Finset.dvd_gcd | [] | [
164,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Cardinal.infinite_pigeonhole_card_lt | [
{
"state_after": "α✝ : Type ?u.148026\nr : α✝ → α✝ → Prop\nβ α : Type u\nf : β → α\nw : (#α) < (#β)\nw' : ℵ₀ ≤ (#α)\n⊢ ∃ a, succ (#α) ≤ (#↑(f ⁻¹' {a}))",
"state_before": "α✝ : Type ?u.148026\nr : α✝ → α✝ → Prop\nβ α : Type u\nf : β → α\nw : (#α) < (#β)\nw' : ℵ₀ ≤ (#α)\n⊢ ∃ a, (#α) < (#↑(f ⁻¹' {a}))",
"t... | [
1024,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1019,
1
] |
Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.FinMeasSupp.iff_lintegral_lt_top | [] | [
1269,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1267,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | MultilinearMap.mkPiRing_zero | [
{
"state_after": "case H\nR : 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✝⁴ : AddCommMonoid M₂\ninst✝³ : (i : F... | [
1085,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1084,
1
] |
Mathlib/Analysis/Calculus/Deriv/Basic.lean | deriv_id' | [] | [
658,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
657,
1
] |
Mathlib/Algebra/Ring/Equiv.lean | RingEquiv.coe_ringHom_inj_iff | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.91573\nα : Type ?u.91576\nβ : Type ?u.91579\nR✝ : Type ?u.91582\nS✝ : Type ?u.91585\nS' : Type ?u.91588\ninst✝⁴ : NonAssocSemiring R✝\ninst✝³ : NonAssocSemiring S✝\ninst✝² : NonAssocSemiring S'\nR : Type u_1\nS : Type u_2\ninst✝¹ : NonAssocSemiring R... | [
695,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
693,
1
] |
Mathlib/Analysis/Calculus/Inverse.lean | ApproximatesLinearOn.continuousOn | [] | [
177,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
11
] |
Mathlib/SetTheory/Ordinal/Basic.lean | Ordinal.typein_enum | [
{
"state_after": "α : Type u_1\nβ : Type ?u.96934\nγ : Type ?u.96937\nr✝ : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nr : α → α → Prop\ninst✝ : IsWellOrder α r\no : Ordinal\nh : o < type r\na : α\ne : typein r a = o\n⊢ typein r (enum r o h) = o",
"state_before": "α : Type u_1\nβ : Type ?u.96934\nγ : ... | [
534,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
530,
1
] |
Mathlib/Data/MvPolynomial/Counit.lean | MvPolynomial.counitNat_C | [] | [
99,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/Algebra/Lie/Basic.lean | smul_lie | [] | [
127,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | csInf_le' | [] | [
1065,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1064,
1
] |
Mathlib/Algebra/Group/OrderSynonym.lean | toDual_div | [] | [
134,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/RingTheory/Ideal/MinimalPrime.lean | Ideal.exists_minimalPrimes_le | [
{
"state_after": "R : Type u_1\nS : Type ?u.1440\ninst✝² : CommRing R\ninst✝¹ : CommRing S\nI J : Ideal R\ninst✝ : IsPrime J\ne : I ≤ J\n⊢ ∃ m,\n m ∈ {p | IsPrime p ∧ I ≤ ↑OrderDual.ofDual p} ∧\n ↑OrderDual.toDual J ≤ m ∧ ∀ (z : (Ideal R)ᵒᵈ), z ∈ {p | IsPrime p ∧ I ≤ p} → m ≤ z → z = m",
"state_befo... | [
71,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Algebra/Order/Hom/Monoid.lean | strictMono_iff_map_pos | [
{
"state_after": "case refine_1\nF : Type u_3\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.52366\nδ : Type ?u.52369\ninst✝³ : OrderedAddCommGroup α\ninst✝² : OrderedAddCommMonoid β\ninst✝¹ : AddMonoidHomClass F α β\nf : F\ninst✝ : CovariantClass β β (fun x x_1 => x + x_1) fun x x_1 => x < x_1\nh : StrictMono ↑f\na ... | [
265,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
260,
1
] |
Mathlib/Data/List/Infix.lean | List.nth_le_inits | [
{
"state_after": "case nil\nα : Type u_1\nβ : Type ?u.50980\nl✝ l₁ l₂ l₃ : List α\na b : α\nm n✝¹ : ℕ\nl : List α\nn✝ : ℕ\nhn✝ : n✝ < length (inits l)\nn : ℕ\nhn : n < length (inits [])\n⊢ nthLe (inits []) n hn = take n []\n\ncase cons\nα : Type u_1\nβ : Type ?u.50980\nl✝¹ l₁ l₂ l₃ : List α\na b : α\nm n✝¹ : ℕ\... | [
456,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
450,
1
] |
Mathlib/Topology/ContinuousOn.lean | continuousOn_piecewise_ite | [] | [
1254,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1250,
1
] |
Mathlib/InformationTheory/Hamming.lean | Hamming.ofHamming_add | [] | [
377,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
375,
1
] |
Mathlib/Algebra/Order/Group/Defs.lean | inv_le_inv_iff | [
{
"state_after": "α : Type u\ninst✝³ : Group α\ninst✝² : LE α\ninst✝¹ : CovariantClass α α (fun x x_1 => x * x_1) fun x x_1 => x ≤ x_1\ninst✝ : CovariantClass α α (swap fun x x_1 => x * x_1) fun x x_1 => x ≤ x_1\na b c d : α\n⊢ a * a⁻¹ * b ≤ a * b⁻¹ * b ↔ b ≤ a",
"state_before": "α : Type u\ninst✝³ : Group ... | [
348,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
346,
1
] |
Mathlib/CategoryTheory/Limits/Types.lean | CategoryTheory.Limits.Types.Limit.map_π_apply' | [] | [
221,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
219,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.map_injective | [] | [
2334,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2333,
1
] |
Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean | ProjectiveSpectrum.basicOpen_pow | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nA : Type u_1\ninst✝³ : CommSemiring R\ninst✝² : CommRing A\ninst✝¹ : Algebra R A\n𝒜 : ℕ → Submodule R A\ninst✝ : GradedAlgebra 𝒜\nf : A\nn : ℕ\nhn : 0 < n\n⊢ ↑(basicOpen 𝒜 (f ^ n)) = ↑(basicOpen 𝒜 f)",
"tactic": "simpa using zeroLocus_singl... | [
438,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
437,
1
] |
Mathlib/RingTheory/Ideal/QuotientOperations.lean | Ideal.quotient_map_comp_mkₐ | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nF : Type w\ninst✝⁸ : CommRing R\ninst✝⁷ : CommRing S\nR₁ : Type u_3\nR₂ : Type ?u.1587950\nA : Type u_1\nB : Type u_2\ninst✝⁶ : CommSemiring R₁\ninst✝⁵ : CommSemiring R₂\ninst✝⁴ : CommRing A\ninst✝³ : CommRing B\ninst✝² : Algebra R₁ A\nin... | [
450,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
448,
1
] |
Mathlib/Order/Filter/Interval.lean | Filter.Tendsto.Ioo | [] | [
99,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
11
] |
Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean | Real.contDiff_rpow_const_of_le | [
{
"state_after": "case zero\nz x y p✝ : ℝ\nn : ℕ\nh✝ : ↑n ≤ p✝\np : ℝ\nh : ↑Nat.zero ≤ p\n⊢ ContDiff ℝ ↑Nat.zero fun x => x ^ p\n\ncase succ\nz x y p✝ : ℝ\nn✝ : ℕ\nh✝ : ↑n✝ ≤ p✝\nn : ℕ\nihn : ∀ {p : ℝ}, ↑n ≤ p → ContDiff ℝ ↑n fun x => x ^ p\np : ℝ\nh : ↑(Nat.succ n) ≤ p\n⊢ ContDiff ℝ ↑(Nat.succ n) fun x => x ^ ... | [
384,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
377,
1
] |
Mathlib/NumberTheory/Padics/PadicNumbers.lean | PadicSeq.norm_eq_pow_val | [
{
"state_after": "case hnc\np : ℕ\ninst✝ : Fact (Nat.Prime p)\nf : PadicSeq p\nhf : ¬f ≈ 0\n⊢ ¬↑f (stationaryPoint hf) = 0",
"state_before": "p : ℕ\ninst✝ : Fact (Nat.Prime p)\nf : PadicSeq p\nhf : ¬f ≈ 0\n⊢ norm f = ↑p ^ (-valuation f)",
"tactic": "rw [norm, valuation, dif_neg hf, dif_neg hf, padicNorm... | [
233,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
225,
1
] |
Mathlib/AlgebraicTopology/DoldKan/PInfty.lean | AlgebraicTopology.DoldKan.QInfty_f | [] | [
87,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.map_filterMap_of_inv | [] | [
2180,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2178,
1
] |
Mathlib/Data/List/Join.lean | List.append_join_map_append | [
{
"state_after": "case nil\nα : Type u_1\nβ : Type ?u.18108\nx : List α\n⊢ x ++ join (map (fun l => l ++ x) []) = join (map (fun l => x ++ l) []) ++ x\n\ncase cons\nα : Type u_1\nβ : Type ?u.18108\nx head✝ : List α\ntail✝ : List (List α)\nih : x ++ join (map (fun l => l ++ x) tail✝) = join (map (fun l => x ++ l... | [
216,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.lt_nfpBFamily | [] | [
279,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | ContDiff.smul | [] | [
1512,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1510,
1
] |
Mathlib/Order/CompleteLattice.lean | iSup_univ | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nβ₂ : Type ?u.113506\nγ : Type ?u.113509\nι : Sort ?u.113512\nι' : Sort ?u.113515\nκ : ι → Sort ?u.113520\nκ' : ι' → Sort ?u.113525\ninst✝ : CompleteLattice α\nf✝ g s t : ι → α\na b : α\nf : β → α\n⊢ (⨆ (x : β) (_ : x ∈ univ), f x) = ⨆... | [
1408,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1408,
1
] |
Mathlib/Data/Set/Intervals/Pi.lean | Set.pi_univ_Ioc_update_left | [
{
"state_after": "ι : Type u_2\nα : ι → Type u_1\ninst✝¹ : (i : ι) → Preorder (α i)\nx✝ y✝ : (i : ι) → α i\ninst✝ : DecidableEq ι\nx y : (i : ι) → α i\ni₀ : ι\nm : α i₀\nhm : x i₀ ≤ m\nthis : Ioc m (y i₀) = Ioi m ∩ Ioc (x i₀) (y i₀)\n⊢ (pi univ fun i => Ioc (update x i₀ m i) (y i)) = {z | m < z i₀} ∩ pi univ fu... | [
101,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/Data/Set/Basic.lean | Set.compl_subset_comm | [] | [
1726,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1725,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.Perm.sumCongr_refl | [] | [
324,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/Dynamics/PeriodicPts.lean | Function.bUnion_ptsOfPeriod | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.11680\nf fa : α → α\nfb : β → β\nx✝ y : α\nm n : ℕ\nx : α\n⊢ (x ∈ ⋃ (n : ℕ) (_ : n > 0), ptsOfPeriod f n) ↔ x ∈ periodicPts f",
"tactic": "simp [mem_periodicPts]"
}
] | [
249,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
248,
1
] |
Mathlib/Combinatorics/SimpleGraph/IncMatrix.lean | SimpleGraph.incMatrix_apply | [] | [
67,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.invRev_empty | [] | [
573,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
572,
1
] |
Mathlib/GroupTheory/Sylow.lean | Sylow.mem_fixedPoints_mul_left_cosets_iff_mem_normalizer | [
{
"state_after": "G : Type u\nα : Type v\nβ : Type w\ninst✝¹ : Group G\nH : Subgroup G\ninst✝ : Finite ↑↑H\nx : G\nhx : ↑x ∈ MulAction.fixedPoints { x // x ∈ H } (G ⧸ H)\nha : ∀ {y : G ⧸ H}, y ∈ orbit { x // x ∈ H } ↑x → y = ↑x\nn : G\nhn : n ∈ H\nthis : x⁻¹ * n * x ∈ H\n⊢ x⁻¹ * n * x⁻¹⁻¹ ∈ H",
"state_befor... | [
528,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
508,
1
] |
Mathlib/Computability/TMToPartrec.lean | Turing.ToPartrec.Code.exists_code.comp | [
{
"state_after": "case intro\nm n : ℕ\nf : Vector ℕ n →. ℕ\ng : Fin n → Vector ℕ m →. ℕ\nhf : ∃ c, ∀ (v : Vector ℕ n), eval c ↑v = pure <$> f v\nhg✝ : ∀ (i : Fin n), ∃ c, ∀ (v : Vector ℕ m), eval c ↑v = pure <$> g i v\ncg : Code\nhg : ∀ (v : Vector ℕ m), eval cg ↑v = Subtype.val <$> Vector.mOfFn fun i => g i v\... | [
285,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
267,
1
] |
Mathlib/Topology/Homeomorph.lean | Homeomorph.coe_toEquiv | [] | [
94,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/GroupTheory/Perm/Sign.lean | Equiv.Perm.swap_induction_on' | [] | [
285,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
283,
1
] |
Std/Logic.lean | forall_not_of_not_exists | [] | [
421,
82
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
421,
1
] |
Mathlib/Order/Directed.lean | directedOn_univ | [] | [
190,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
188,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Continuity.lean | Filter.Tendsto.cpow | [] | [
114,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
111,
1
] |
Mathlib/MeasureTheory/Decomposition/Jordan.lean | MeasureTheory.SignedMeasure.toJordanDecomposition_spec | [
{
"state_after": "α : Type u_1\nβ : Type ?u.37523\ninst✝² : MeasurableSpace α\ns✝ : SignedMeasure α\nμ ν : Measure α\ninst✝¹ : IsFiniteMeasure μ\ninst✝ : IsFiniteMeasure ν\ns : SignedMeasure α\ni : Set α :=\n choose\n (_ :\n ∃ i,\n MeasurableSet i ∧\n VectorMeasure.restrict 0 i ≤ Vector... | [
251,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/Computability/TMToPartrec.lean | Turing.PartrecToTM2.copy_ok | [
{
"state_after": "case nil\nq : Λ'\ns✝ : Option Γ'\na✝ c d✝ : List Γ'\ns : Option Γ'\na d : List Γ'\n⊢ Reaches₁ (TM2.step tr) { l := some (Λ'.copy q), var := s, stk := elim a [] c d }\n { l := some q, var := none, stk := elim (List.reverseAux [] a) [] c (List.reverseAux [] d) }\n\ncase cons\nq : Λ'\ns✝ : Opt... | [
1451,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1443,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Asymptotics.lean | Complex.isTheta_cpow_const_rpow | [
{
"state_after": "case a\nα : Type u_1\nl : Filter α\nf g : α → ℂ\nb : ℂ\nhl : b.re = 0 → b ≠ 0 → ∀ᶠ (x : α) in l, f x ≠ 0\n⊢ (∀ᶠ (x : α) in l, f x = 0 → b.re = 0 → b = 0) ↔ b.re = 0 → b ≠ 0 → ∀ᶠ (x : α) in l, f x ≠ 0",
"state_before": "α : Type u_1\nl : Filter α\nf g : α → ℂ\nb : ℂ\nhl : b.re = 0 → b ≠ 0 →... | [
206,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/Topology/MetricSpace/Gluing.lean | Metric.Sigma.one_le_dist_of_ne | [
{
"state_after": "ι : Type u_1\nE : ι → Type u_2\ninst✝ : (i : ι) → MetricSpace (E i)\ni j : ι\nh : i ≠ j\nx : E i\ny : E j\n⊢ 1 ≤ dist x (Nonempty.some (_ : Nonempty (E i))) + 1 + dist (Nonempty.some (_ : Nonempty (E j))) y",
"state_before": "ι : Type u_1\nE : ι → Type u_2\ninst✝ : (i : ι) → MetricSpace (E... | [
342,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
339,
1
] |
Mathlib/Algebra/TrivSqZeroExt.lean | TrivSqZeroExt.inl_zero | [] | [
313,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
312,
1
] |
Mathlib/FieldTheory/Subfield.lean | Subfield.coe_inf | [] | [
596,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
595,
1
] |
Mathlib/Analysis/Seminorm.lean | Seminorm.symmetric_ball_zero | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.1254732\nR' : Type ?u.1254735\n𝕜 : Type u_2\n𝕜₂ : Type ?u.1254741\n𝕜₃ : Type ?u.1254744\n𝕝 : Type ?u.1254747\nE : Type u_1\nE₂ : Type ?u.1254753\nE₃ : Type ?u.1254756\nF : Type ?u.1254759\nG : Type ?u.1254762\nι : Type ?u.1254765\ninst✝² : Normed... | [
1010,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1008,
1
] |
Std/Data/String/Lemmas.lean | String.ne_add_csize_add_self | [] | [
38,
54
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
37,
9
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.sum_zero_index | [
{
"state_after": "no goals",
"state_before": "R : Type u\na b : R\nm n : ℕ\ninst✝¹ : Semiring R\np q : R[X]\nS : Type u_1\ninst✝ : AddCommMonoid S\nf : ℕ → R → S\n⊢ sum 0 f = 0",
"tactic": "simp [sum]"
}
] | [
961,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
960,
1
] |
Mathlib/Logic/Basic.lean | dite_eq_iff | [
{
"state_after": "no goals",
"state_before": "α : Sort u_1\nβ : Sort ?u.32627\nσ : α → Sort ?u.32623\nf : α → β\nP Q : Prop\ninst✝¹ : Decidable P\ninst✝ : Decidable Q\na b c : α\nA : P → α\nB : ¬P → α\n⊢ dite P A B = c ↔ (∃ h, A h = c) ∨ ∃ h, B h = c",
"tactic": "by_cases P <;> simp [*, exists_prop_of_t... | [
1128,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1127,
1
] |
Mathlib/Data/List/Rotate.lean | List.isRotated_iff_mem_map_range | [
{
"state_after": "α : Type u\nl l' : List α\n⊢ (∃ n, n ≤ length l ∧ rotate l n = l') ↔ ∃ a, a < length l + 1 ∧ rotate l a = l'",
"state_before": "α : Type u\nl l' : List α\n⊢ l ~r l' ↔ l' ∈ map (rotate l) (range (length l + 1))",
"tactic": "simp_rw [mem_map, mem_range, isRotated_iff_mod]"
},
{
"... | [
548,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
544,
1
] |
Mathlib/MeasureTheory/Constructions/Prod/Basic.lean | MeasurableEmbedding.prod_mk | [
{
"state_after": "α✝ : Type ?u.3071758\nα' : Type ?u.3071761\nβ✝ : Type ?u.3071764\nβ' : Type ?u.3071767\nγ✝ : Type ?u.3071770\nE : Type ?u.3071773\ninst✝⁵ : MeasurableSpace α✝\ninst✝⁴ : MeasurableSpace α'\ninst✝³ : MeasurableSpace β✝\ninst✝² : MeasurableSpace β'\ninst✝¹ : MeasurableSpace γ✝\nμ μ' : MeasureTheo... | [
239,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/Combinatorics/Composition.lean | Composition.ones_blocksFun | [
{
"state_after": "no goals",
"state_before": "n✝ : ℕ\nc : Composition n✝\nn : ℕ\ni : Fin (length (ones n))\n⊢ blocksFun (ones n) i = 1",
"tactic": "simp only [blocksFun, ones, blocks, i.2, List.nthLe_replicate]"
}
] | [
511,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
510,
1
] |
Mathlib/RingTheory/SimpleModule.lean | is_semisimple_of_sSup_simples_eq_top | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\ninst✝⁴ : Ring R\nM : Type u_1\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\nm : Submodule R M\nN : Type ?u.36053\ninst✝¹ : AddCommGroup N\ninst✝ : Module R N\nh : sSup {m | IsSimpleModule R { x // x ∈ m }} = ⊤\n⊢ sSup {a | IsAtom a} = ⊤",
"tac... | [
104,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
102,
1
] |
Mathlib/Analysis/Complex/CauchyIntegral.lean | Complex.circleIntegral_sub_center_inv_smul_eq_of_differentiable_on_annulus_off_countable | [
{
"state_after": "E : Type u\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedSpace ℂ E\ninst✝ : CompleteSpace E\nc : ℂ\nr R : ℝ\nh0 : 0 < r\nhle : r ≤ R\nf : ℂ → E\ns : Set ℂ\nhs : Set.Countable s\nhd : ∀ (z : ℂ), z ∈ (ball c R \\ closedBall c r) \\ s → DifferentiableAt ℂ f z\nA : Set ℂ := closedBall c R \\ ball... | [
330,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
300,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.