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/Topology/Constructions.lean | Quotient.preimage_mem_nhds | [] | [
188,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
186,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.left_distrib | [
{
"state_after": "no goals",
"state_before": "n m k : Nat\n⊢ n * (m + k) = n * m + n * k",
"tactic": "induction n generalizing m k with\n| zero => repeat rw [Nat.zero_mul]\n| succ n ih => simp [succ_mul, ih]; rw [Nat.add_assoc, Nat.add_assoc (n*m)]; apply congrArg; apply Nat.add_left_comm"
},
{... | [
187,
119
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
184,
11
] |
Mathlib/Data/List/Sort.lean | List.sorted_le_ofFn_iff | [] | [
157,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
9
] |
Mathlib/Data/Polynomial/Cardinal.lean | Polynomial.cardinal_mk_eq_max | [
{
"state_after": "R : Type u\ninst✝¹ : Semiring R\ninst✝ : Nontrivial R\n⊢ max (#R) (lift (#ℕ)) = max (#R) ℵ₀",
"state_before": "R : Type u\ninst✝¹ : Semiring R\ninst✝ : Nontrivial R\n⊢ (#AddMonoidAlgebra R ℕ) = max (#R) ℵ₀",
"tactic": "rw [AddMonoidAlgebra, mk_finsupp_lift_of_infinite, lift_uzero, max_... | [
34,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
31,
1
] |
Mathlib/Order/Monotone/Basic.lean | monotoneOn_univ | [] | [
388,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
387,
9
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.IsCycle.isConj | [
{
"state_after": "ι : Type ?u.3031573\nα : Type u_1\nβ : Type ?u.3031579\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nσ τ : Perm α\nhσ : IsCycle σ\nhτ : IsCycle τ\nh : card (support σ) = card (support τ)\n⊢ ∀ (x : α) (hx : x ∈ ↑(support σ)),\n ↑(↑((zpowersEquivSupport hσ).symm.trans\n ((zpowersEq... | [
1740,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1723,
1
] |
Mathlib/RingTheory/Ideal/Prod.lean | Ideal.mem_prod | [] | [
43,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
42,
1
] |
Mathlib/MeasureTheory/Function/LpSpace.lean | LipschitzWith.norm_compLp_sub_le | [
{
"state_after": "case h\nα : Type u_3\nE : Type u_1\nF : Type u_2\nG : Type ?u.2355804\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : MeasureTheory.Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\ng : E → F\nc : ℝ≥0\nhg : LipschitzWith c g\ng0 : g 0 = 0\... | [
922,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
916,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | Uniform.tendsto_congr | [] | [
1978,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1976,
1
] |
Mathlib/ModelTheory/Ultraproducts.lean | FirstOrder.Language.Ultraproduct.sentence_realize | [
{
"state_after": "α : Type u_1\nM : α → Type u_2\nu : Ultrafilter α\nL : Language\ninst✝¹ : (a : α) → Structure L (M a)\ninst✝ : ∀ (a : α), Nonempty (M a)\nφ : Sentence L\n⊢ Formula.Realize φ default ↔ ∀ᶠ (a : α) in ↑u, Formula.Realize φ default",
"state_before": "α : Type u_1\nM : α → Type u_2\nu : Ultrafi... | [
166,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/Order/Hom/Basic.lean | WithTop.coe_toDualBotEquiv | [] | [
1306,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1304,
1
] |
Mathlib/Algebra/Parity.lean | Odd.pow_nonpos_iff | [] | [
491,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
490,
1
] |
Mathlib/Analysis/LocallyConvex/Polar.lean | LinearMap.polar_univ | [
{
"state_after": "𝕜 : Type u_1\nE : Type u_2\nF : Type u_3\ninst✝⁴ : NontriviallyNormedField 𝕜\ninst✝³ : AddCommMonoid E\ninst✝² : AddCommMonoid F\ninst✝¹ : Module 𝕜 E\ninst✝ : Module 𝕜 F\nB : E →ₗ[𝕜] F →ₗ[𝕜] 𝕜\nh : SeparatingRight B\n⊢ 0 ∈ polar B Set.univ ∧ ∀ (x : F), x ∈ polar B Set.univ → x = 0",
... | [
155,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/Topology/Semicontinuous.lean | ContinuousAt.comp_upperSemicontinuousAt_antitone | [] | [
868,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
865,
1
] |
Mathlib/Algebra/Category/ModuleCat/Basic.lean | ModuleCat.forget₂_obj | [] | [
153,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
151,
1
] |
Mathlib/Algebra/BigOperators/Finprod.lean | finprod_mem_finset_product | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nι : Type ?u.426329\nG : Type ?u.426332\nM : Type u_3\nN : Type ?u.426338\ninst✝¹ : CommMonoid M\ninst✝ : CommMonoid N\nf✝ g : α → M\na b : α\ns✝ t : Set α\ns : Finset (α × β)\nf : α × β → M\n⊢ (∏ᶠ (ab : α × β) (_ : ab ∈ s), f ab) = ∏ᶠ... | [
1249,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1245,
1
] |
Mathlib/Data/Nat/Basic.lean | Nat.mod_succ_eq_iff_lt | [] | [
701,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
700,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/CommSq.lean | CategoryTheory.IsPullback.zero_right | [
{
"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✝¹ : HasZeroObject C\ninst✝ : HasZeroMorphisms C\nX : C\n⊢ CommSq 0 (𝟙 X) 0 0",
"tactic": "simp"
},
{
"state_after": "no goals",
"state_before"... | [
492,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
490,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.le_div_iff_of_nonzero | [] | [
1142,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1139,
1
] |
Mathlib/Data/Finset/Image.lean | Finset.map_subset_map | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.27657\nf : α ↪ β\ns s₁ s₂ : Finset α\nh : s₁ ⊆ s₂\n⊢ map f s₁ ⊆ map f s₂",
"tactic": "simp [subset_def, Multiset.map_subset_map h]"
}
] | [
159,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.floor_eq_zero_iff | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.140446\nα : Type u_1\nβ : Type ?u.140452\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz : ℤ\na : α\n⊢ ⌊a⌋ = 0 ↔ a ∈ Ico 0 1",
"tactic": "simp [floor_eq_iff]"
}
] | [
785,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
785,
1
] |
Mathlib/Data/List/Sublists.lean | List.nodup_sublistsLen | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nn : ℕ\nl : List α\nh : Nodup l\nthis : Pairwise (fun x x_1 => x ≠ x_1) (sublists' l)\n⊢ Nodup (sublistsLen n l)",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nn : ℕ\nl : List α\nh : Nodup l\n⊢ Nodup (sublistsLen n l)",
"tactic": "have : Pairw... | [
397,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
394,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalRingHom.eq_of_eqOn_stop | [] | [
914,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
912,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.induce_mono_right | [] | [
1165,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1164,
1
] |
Mathlib/Computability/TuringMachine.lean | Turing.TM2to1.tr_eval | [
{
"state_after": "case intro.intro\nK : Type u_2\ninst✝² : DecidableEq K\nΓ : K → Type u_1\nΛ : Type u_4\ninst✝¹ : Inhabited Λ\nσ : Type u_3\ninst✝ : Inhabited σ\nM : Λ → Stmt₂\nk : K\nL L₂ : List (Γ k)\nH₂ : L₂ ∈ TM2.eval M k L\nc₁ : TM1.Cfg Γ' Λ' σ\nh₁ : c₁ ∈ eval (TM1.step (tr M)) (TM1.init (trInit k L))\nH₁... | [
2764,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2755,
1
] |
Mathlib/Data/List/Perm.lean | List.perm_append_singleton | [
{
"state_after": "no goals",
"state_before": "α : Type uu\nβ : Type vv\nl₁ l₂ : List α\na : α\nl : List α\n⊢ a :: (l ++ []) ~ a :: l",
"tactic": "rw [append_nil]"
}
] | [
140,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/Algebra/Ring/Equiv.lean | RingEquiv.toEquiv_commutes | [] | [
729,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
728,
1
] |
Mathlib/MeasureTheory/Function/AEMeasurableOrder.lean | ENNReal.aemeasurable_of_exist_almost_disjoint_supersets | [
{
"state_after": "case intro.intro.intro.intro\nα : Type u_1\nm : MeasurableSpace α\nμ : MeasureTheory.Measure α\nf : α → ℝ≥0∞\nh :\n ∀ (p q : ℝ≥0),\n p < q → ∃ u v, MeasurableSet u ∧ MeasurableSet v ∧ {x | f x < ↑p} ⊆ u ∧ {x | ↑q < f x} ⊆ v ∧ ↑↑μ (u ∩ v) = 0\ns : Set ℝ≥0∞\ns_count : Set.Countable s\ns_dens... | [
130,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
116,
1
] |
Mathlib/Algebra/Order/Ring/Defs.lean | bit0_lt_bit0 | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type ?u.124569\ninst✝ : LinearOrderedSemiring α\na b c d : α\n⊢ bit0 a < bit0 b ↔ a < b",
"tactic": "rw [bit0, bit0, ← two_mul, ← two_mul, mul_lt_mul_left (zero_lt_two : 0 < (2 : α))]"
}
] | [
895,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
894,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.inter_vsub_subset | [] | [
1547,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1546,
1
] |
Mathlib/Data/Real/Hyperreal.lean | Hyperreal.ofSeq_surjective | [] | [
153,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
1
] |
Mathlib/Probability/ProbabilityMassFunction/Monad.lean | Pmf.toOuterMeasure_bindOnSupport_apply | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.144355\np : Pmf α\nf : (a : α) → a ∈ support p → Pmf β\ns : Set β\n⊢ (∑' (x : β), if x ∈ s then ∑' (a : α), ↑p a * if h : ↑p a = 0 then 0 else ↑(f a (_ : ¬↑p a = 0)) x else 0) =\n ∑' (a : α), ↑p a * if h : ↑p a = 0 then 0 else ∑' (x : β), if x ∈ s the... | [
325,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
312,
1
] |
Mathlib/CategoryTheory/MorphismProperty.lean | CategoryTheory.MorphismProperty.StableUnderBaseChange.mk | [
{
"state_after": "C : Type u\ninst✝² : Category C\nD : Type ?u.19471\ninst✝¹ : Category D\nP : MorphismProperty C\ninst✝ : HasPullbacks C\nhP₁ : RespectsIso P\nhP₂ : ∀ (X Y S : C) (f : X ⟶ S) (g : Y ⟶ S), P g → P pullback.fst\nX Y Y' S : C\nf : X ⟶ S\ng : Y ⟶ S\nf' : Y' ⟶ Y\ng' : Y' ⟶ X\nsq : IsPullback f' g' g... | [
192,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.abs_fract | [] | [
895,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
894,
1
] |
Std/Data/Int/DivMod.lean | Int.ediv_nonneg | [] | [
102,
48
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
100,
1
] |
Mathlib/Init/Logic.lean | imp_of_if_neg | [
{
"state_after": "a b c✝ d : Prop\np : ?m.28021\nc t e : Prop\ninst✝ : Decidable c\nh : if c then t else e\nhnc : ¬c\nthis : e\n⊢ e",
"state_before": "a b c✝ d : Prop\np : ?m.28021\nc t e : Prop\ninst✝ : Decidable c\nh : if c then t else e\nhnc : ¬c\n⊢ e",
"tactic": "have := if_neg hnc ▸ h"
},
{
... | [
361,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
360,
1
] |
Mathlib/Order/Monotone/Monovary.lean | MonovaryOn.dual_right | [] | [
240,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
239,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.coeIdeal_ne_one | [] | [
1025,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1024,
1
] |
Mathlib/Analysis/NormedSpace/OperatorNorm.lean | ContinuousLinearMap.flipₗᵢ_symm | [] | [
874,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
873,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.IsCycleOn.of_pow | [] | [
929,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
928,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | hasSum_nat_add_iff | [
{
"state_after": "α : Type u_1\nβ : Type ?u.450378\nγ : Type ?u.450381\nδ : Type ?u.450384\ninst✝² : AddCommGroup α\ninst✝¹ : TopologicalSpace α\ninst✝ : TopologicalAddGroup α\nf✝ g : β → α\na✝ a₁ a₂ : α\nf : ℕ → α\nk : ℕ\na : α\n⊢ HasSum (fun n => f (n + k)) a ↔ HasSum (fun x => f ↑x) a",
"state_before": "... | [
944,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
940,
1
] |
Mathlib/Order/CompleteLattice.lean | iSup_eq_if | [] | [
1123,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1122,
1
] |
Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean | PrimeSpectrum.vanishingIdeal_univ | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\ninst✝¹ : CommRing R\ninst✝ : CommRing S\n⊢ vanishingIdeal ∅ = ⊤",
"tactic": "simpa using (gc R).u_top"
}
] | [
284,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
283,
1
] |
Mathlib/Algebra/Parity.lean | odd_two_mul_add_one | [] | [
354,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
353,
1
] |
Mathlib/LinearAlgebra/Matrix/Hermitian.lean | Matrix.isHermitian_diagonal_of_self_adjoint | [] | [
140,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Mathlib/Data/Polynomial/RingDivision.lean | Polynomial.irreducible_of_monic | [
{
"state_after": "case refine'_1\nR : Type u\nS : Type v\nT : Type w\na b : R\nn : ℕ\ninst✝¹ : CommSemiring R\ninst✝ : NoZeroDivisors R\np q : R[X]\nhp : Monic p\nhp1 : p ≠ 1\nh : ∀ (f g : R[X]), Monic f → Monic g → f * g = p → f = 1 ∨ g = 1\nf g : R[X]\nhfg : p = f * g\n⊢ Monic (g * ↑C (leadingCoeff f))\n\ncas... | [
287,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/Order/Hom/Lattice.lean | InfHom.copy_eq | [] | [
560,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
559,
1
] |
Mathlib/Topology/Basic.lean | isOpen_biUnion | [] | [
152,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/CategoryTheory/Subobject/Basic.lean | CategoryTheory.Subobject.mapIsoToOrderIso_apply | [] | [
626,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
624,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.IsTrail.reverse | [
{
"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 : IsTrail p\n⊢ IsTrail (Walk.reverse p)",
"tactic": "simpa [isTrail_def] using h"
}
] | [
932,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
931,
1
] |
Mathlib/Algebra/Algebra/Spectrum.lean | spectrum.of_subsingleton | [
{
"state_after": "no goals",
"state_before": "R : Type u\nA : Type v\ninst✝³ : CommSemiring R\ninst✝² : Ring A\ninst✝¹ : Algebra R A\ninst✝ : Subsingleton A\na : A\n⊢ σ a = ∅",
"tactic": "rw [spectrum, resolventSet_of_subsingleton, Set.compl_univ]"
}
] | [
145,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/Data/Set/Function.lean | Set.pi_piecewise | [] | [
1527,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1525,
1
] |
Mathlib/Data/Complex/Exponential.lean | Complex.cos_sub_cos | [
{
"state_after": "x y : ℂ\ns1 : cos ((x + y) / 2 + (x - y) / 2) = cos ((x + y) / 2) * cos ((x - y) / 2) - sin ((x + y) / 2) * sin ((x - y) / 2)\n⊢ cos x - cos y = -2 * sin ((x + y) / 2) * sin ((x - y) / 2)",
"state_before": "x y : ℂ\n⊢ cos x - cos y = -2 * sin ((x + y) / 2) * sin ((x - y) / 2)",
"tactic... | [
909,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
903,
1
] |
Mathlib/Algebra/IsPrimePow.lean | isPrimePow_def | [] | [
30,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
29,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | ContDiffAt.continuousAt | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\... | [
1353,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1352,
1
] |
Mathlib/Order/WellFoundedSet.lean | Set.Subsingleton.partiallyWellOrderedOn | [] | [
312,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
311,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.cons_append | [] | [
247,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
246,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearEquiv.map_neg | [] | [
2284,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2283,
1
] |
Mathlib/Analysis/Calculus/Deriv/Mul.lean | HasStrictDerivAt.mul | [
{
"state_after": "𝕜 : Type u\ninst✝⁸ : NontriviallyNormedField 𝕜\nF : Type v\ninst✝⁷ : NormedAddCommGroup F\ninst✝⁶ : NormedSpace 𝕜 F\nE : Type w\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\nf f₀ f₁ g : 𝕜 → F\nf' f₀' f₁' g' : F\nx : 𝕜\ns t : Set 𝕜\nL L₁ L₂ : Filter 𝕜\n𝕜' : Type ?u.223044\n... | [
187,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
181,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | MvPolynomial.coe_C | [] | [
1109,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1108,
1
] |
Mathlib/Analysis/NormedSpace/HahnBanach/Separation.lean | geometric_hahn_banach_open | [
{
"state_after": "case inl\n𝕜 : Type ?u.27194\nE : Type u_1\ninst✝⁴ : TopologicalSpace E\ninst✝³ : AddCommGroup E\ninst✝² : TopologicalAddGroup E\ninst✝¹ : Module ℝ E\ninst✝ : ContinuousSMul ℝ E\nt : Set E\nx y : E\nht : Convex ℝ t\nhs₁ : Convex ℝ ∅\nhs₂ : IsOpen ∅\ndisj : Disjoint ∅ t\n⊢ ∃ f u, (∀ (a : E), a ... | [
115,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsLittleO.trans | [] | [
522,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
520,
1
] |
Mathlib/Data/Seq/Computation.lean | Computation.results_think | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ns : Computation α\na : α\nn : ℕ\nh : Results s a n\nthis : Terminates s\n⊢ length (think s) = n + 1",
"tactic": "rw [length_think, h.length]"
}
] | [
575,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
573,
1
] |
Mathlib/Data/Polynomial/Degree/Definitions.lean | Polynomial.sum_over_range' | [
{
"state_after": "case ofFinsupp\nR : Type u\nS : Type v\na b c d : R\nn✝ m : ℕ\ninst✝¹ : Semiring R\np q r : R[X]\ninst✝ : AddCommMonoid S\nf : ℕ → R → S\nh : ∀ (n : ℕ), f n 0 = 0\nn : ℕ\ntoFinsupp✝ : AddMonoidAlgebra R ℕ\nw : natDegree { toFinsupp := toFinsupp✝ } < n\n⊢ sum { toFinsupp := toFinsupp✝ } f = ∑ a... | [
402,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
397,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.lt_sup_iff_not_mem | [
{
"state_after": "case mp\nR : Type u_1\nR₂ : Type ?u.235836\nK : Type ?u.235839\nM : Type u_2\nM₂ : Type ?u.235845\nV : Type ?u.235848\nS : Type ?u.235851\ninst✝⁵ : Semiring R\ninst✝⁴ : AddCommMonoid M\ninst✝³ : Module R M\nx : M\np p' : Submodule R M\ninst✝² : Semiring R₂\nσ₁₂ : R →+* R₂\ninst✝¹ : AddCommMono... | [
725,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
705,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean | AffineIsometry.angle_map | [
{
"state_after": "no goals",
"state_before": "V : Type u_3\nP : Type u_4\ninst✝⁷ : NormedAddCommGroup V\ninst✝⁶ : InnerProductSpace ℝ V\ninst✝⁵ : MetricSpace P\ninst✝⁴ : NormedAddTorsor V P\nV₂ : Type u_1\nP₂ : Type u_2\ninst✝³ : NormedAddCommGroup V₂\ninst✝² : InnerProductSpace ℝ V₂\ninst✝¹ : MetricSpace P... | [
62,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/Algebra/Order/Monoid/Lemmas.lean | Left.one_le_mul | [] | [
712,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
710,
1
] |
Mathlib/MeasureTheory/Group/Arithmetic.lean | AEMeasurable.div_const | [] | [
325,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/ModelTheory/Syntax.lean | FirstOrder.Language.LHom.id_onTerm | [
{
"state_after": "case h\nL : Language\nL' : Language\nM : Type w\nN : Type ?u.28071\nP : Type ?u.28074\ninst✝² : Structure L M\ninst✝¹ : Structure L N\ninst✝ : Structure L P\nα : Type u'\nβ : Type v'\nγ : Type ?u.28102\nt : Term L α\n⊢ onTerm (LHom.id L) t = id t",
"state_before": "L : Language\nL' : Langu... | [
285,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
280,
1
] |
Mathlib/Data/Set/Intervals/Monotone.lean | MonotoneOn.Icc | [] | [
111,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
11
] |
Mathlib/Order/Filter/Basic.lean | Filter.comap_const_of_not_mem | [] | [
2074,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2073,
1
] |
Mathlib/Data/Sym/Basic.lean | Sym.sigma_sub_ext | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.53104\nn n' m : ℕ\ns : Sym α n\na b : α\nm₁ m₂ : (i : Fin (n + 1)) × Sym α (n - ↑i)\nh : ↑m₁.snd = ↑m₂.snd\n⊢ ↑m₁.fst = ↑m₂.fst",
"tactic": "rw [← Nat.sub_sub_self (Nat.le_of_lt_succ m₁.1.is_lt), ← m₁.2.2, val_eq_coe, h,\n ← val_eq... | [
562,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
556,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.Tendsto.neg_const_mul_atTop | [] | [
1194,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1192,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.Tendsto.nsmul_atTop | [] | [
667,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
659,
1
] |
Mathlib/GroupTheory/Subsemigroup/Basic.lean | Subsemigroup.closure_union | [] | [
434,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
433,
1
] |
Mathlib/Data/List/Basic.lean | List.map_id'' | [] | [
1795,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1794,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.deriv_succ | [] | [
523,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
522,
1
] |
Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean | LocalHomeomorph.extend_preimage_inter_eq | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_3\nE : Type u_1\nM : Type u_2\nH : Type u_4\nE' : Type ?u.160305\nM' : Type ?u.160308\nH' : Type ?u.160311\ninst✝⁸ : NontriviallyNormedField 𝕜\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\ninst✝⁵ : TopologicalSpace H\ninst✝⁴ : Topologic... | [
936,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
933,
1
] |
Mathlib/Order/Iterate.lean | Function.Commute.iterate_le_of_map_le | [
{
"state_after": "case h₀\nα : Type u_1\ninst✝ : Preorder α\nf g : α → α\nh : Commute f g\nhf : Monotone f\nhg : Monotone g\nx : α\nhx : f x ≤ g x\nn : ℕ\n⊢ (f^[0]) x ≤ (g^[0]) x\n\ncase hx\nα : Type u_1\ninst✝ : Preorder α\nf g : α → α\nh : Commute f g\nhf : Monotone f\nhg : Monotone g\nx : α\nhx : f x ≤ g x\n... | [
176,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Algebra/GroupPower/Order.lean | pow_eq_one_iff | [
{
"state_after": "β : Type ?u.120218\nA : Type ?u.120221\nG : Type ?u.120224\nM : Type u_1\nR : Type ?u.120230\ninst✝² : Monoid M\ninst✝¹ : LinearOrder M\ninst✝ : CovariantClass M M (fun x x_1 => x * x_1) fun x x_1 => x ≤ x_1\nx : M\nn : ℕ\nhn : n ≠ 0\n⊢ x ^ n ≤ 1 ∧ 1 ≤ x ^ n ↔ x ≤ 1 ∧ 1 ≤ x",
"state_before... | [
263,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | ContDiffAt.div_const | [] | [
1474,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1472,
8
] |
Mathlib/LinearAlgebra/Basic.lean | LinearMap.subtype_comp_restrict | [] | [
243,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
241,
1
] |
Mathlib/SetTheory/ZFC/Basic.lean | ZFSet.mem_prod | [
{
"state_after": "no goals",
"state_before": "x y z : ZFSet\n⊢ z ∈ prod x y ↔ ∃ a, a ∈ x ∧ ∃ b, b ∈ y ∧ z = pair a b",
"tactic": "simp [prod]"
}
] | [
1345,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1344,
1
] |
Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean | MeasureTheory.StronglyMeasurable.isSeparable_range | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.132725\nι : Type ?u.132728\ninst✝¹ : Countable ι\nf g : α → β\nm : MeasurableSpace α\ninst✝ : TopologicalSpace β\nhf : StronglyMeasurable f\nthis : IsSeparable (closure (⋃ (n : ℕ), range ↑(StronglyMeasurable.approx hf n)))\n⊢ IsSeparable (range f)",
... | [
608,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
599,
1
] |
Mathlib/Data/List/Perm.lean | List.length_permutations'Aux | [
{
"state_after": "case nil\nα : Type uu\nβ : Type vv\nl₁ l₂ : List α\nx : α\n⊢ length (permutations'Aux x []) = length [] + 1\n\ncase cons\nα : Type uu\nβ : Type vv\nl₁ l₂ : List α\nx y : α\ns : List α\nIH : length (permutations'Aux x s) = length s + 1\n⊢ length (permutations'Aux x (y :: s)) = length (y :: s) +... | [
1383,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1379,
1
] |
Mathlib/Data/Matrix/Rank.lean | Matrix.rank_le_width | [] | [
73,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/Algebra/Homology/Homotopy.lean | Homotopy.nullHomotopicMap_f_of_not_rel_right | [
{
"state_after": "ι : Type u_1\nV : Type u\ninst✝¹ : Category V\ninst✝ : Preadditive V\nc : ComplexShape ι\nC D E : HomologicalComplex V c\nf g : C ⟶ D\nh k : D ⟶ E\ni k₁ k₀ : ι\nr₁₀ : ComplexShape.Rel c k₁ k₀\nhk₁ : ∀ (l : ι), ¬ComplexShape.Rel c l k₁\nhom : (i j : ι) → X C i ⟶ X D j\n⊢ ↑(dNext k₁) hom + ↑(pre... | [
412,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
407,
1
] |
Mathlib/CategoryTheory/Sites/SheafOfTypes.lean | CategoryTheory.Presieve.IsSheafFor.isAmalgamation | [] | [
617,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
615,
1
] |
Mathlib/Topology/Sheaves/Functors.lean | TopCat.Presheaf.SheafConditionPairwiseIntersections.map_diagram | [
{
"state_after": "case obj_eq\nC : Type u\ninst✝ : Category C\nX Y : TopCat\nf : X ⟶ Y\nι : Type w\nU : ι → Opens ↑Y\n⊢ ∀ (j : CategoryTheory.Pairwise ι),\n (Pairwise.diagram U ⋙ Opens.map f).obj j = (Pairwise.diagram ((Opens.map f).toPrefunctor.obj ∘ U)).obj j\n\nC : Type u\ninst✝ : Category C\nX Y : TopCat... | [
52,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
45,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.subset_range_sup_succ | [] | [
231,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/MeasureTheory/Measure/Sub.lean | MeasureTheory.Measure.sub_apply_eq_zero_of_restrict_le_restrict | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nm : MeasurableSpace α\nμ ν : Measure α\ns : Set α\nh_le : restrict μ s ≤ restrict ν s\nh_meas_s : MeasurableSet s\n⊢ ↑↑(μ - ν) s = 0",
"tactic": "rw [← restrict_apply_self, restrict_sub_eq_restrict_sub_restrict, sub_eq_zero_of_le] <;> simp [*]"... | [
141,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | tendsto_comp_of_locally_uniform_limit_within | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nι : Type x\ninst✝¹ : UniformSpace β\nF : ι → α → β\nf : α → β\ns s' : Set α\nx : α\np : Filter ι\np' : Filter α\ng : ι → α\ninst✝ : TopologicalSpace α\nh : ContinuousWithinAt f s x\nhg : Tendsto g p (𝓝[s] x)\nhunif : ∀ (u : Set (β × β)), u ∈ 𝓤 β → ∃ t, t ∈... | [
932,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
923,
1
] |
Mathlib/Topology/Bornology/Basic.lean | Bornology.isBounded_singleton | [
{
"state_after": "ι : Type ?u.4415\nα : Type u_1\nβ : Type ?u.4421\ninst✝ : Bornology α\ns t : Set α\nx : α\n⊢ {x}ᶜ ∈ cobounded α",
"state_before": "ι : Type ?u.4415\nα : Type u_1\nβ : Type ?u.4421\ninst✝ : Bornology α\ns t : Set α\nx : α\n⊢ IsBounded {x}",
"tactic": "rw [isBounded_def]"
},
{
"s... | [
182,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/RingTheory/EuclideanDomain.lean | left_div_gcd_ne_zero | [
{
"state_after": "case intro\nR : Type u_1\ninst✝¹ : EuclideanDomain R\ninst✝ : GCDMonoid R\np q : R\nhp : p ≠ 0\nr : R\nhr : p = GCDMonoid.gcd p q * r\n⊢ p / GCDMonoid.gcd p q ≠ 0",
"state_before": "R : Type u_1\ninst✝¹ : EuclideanDomain R\ninst✝ : GCDMonoid R\np q : R\nhp : p ≠ 0\n⊢ p / GCDMonoid.gcd p q ... | [
52,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
47,
1
] |
Mathlib/Data/Set/Intervals/OrdConnectedComponent.lean | Set.dual_ordConnectedSection | [
{
"state_after": "α : Type u_1\ninst✝ : LinearOrder α\ns✝ t : Set α\nx y z : α\ns : Set α\n⊢ (range fun x => Nonempty.some (_ : Set.Nonempty (ordConnectedComponent (↑ofDual ⁻¹' s) ↑x))) =\n ↑ofDual ⁻¹' range fun x => Nonempty.some (_ : Set.Nonempty (ordConnectedComponent s ↑x))",
"state_before": "α : Typ... | [
149,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/Analysis/MeanInequalities.lean | NNReal.young_inequality_real | [
{
"state_after": "ι : Type u\ns : Finset ι\na b : ℝ≥0\np q : ℝ\nhpq : Real.IsConjugateExponent p q\n⊢ a * b ≤ a ^ ↑(Real.toNNReal p) / Real.toNNReal p + b ^ q / Real.toNNReal q",
"state_before": "ι : Type u\ns : Finset ι\na b : ℝ≥0\np q : ℝ\nhpq : Real.IsConjugateExponent p q\n⊢ a * b ≤ a ^ p / Real.toNNRea... | [
288,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.natAdd_mk | [] | [
1403,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1402,
1
] |
Mathlib/Data/Semiquot.lean | Semiquot.exists_mem | [] | [
62,
9
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.filter_zero | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.474229\nγ : Type ?u.474232\nι : Type ?u.474235\nM : Type u_2\nM' : Type ?u.474241\nN : Type ?u.474244\nP : Type ?u.474247\nG : Type ?u.474250\nH : Type ?u.474253\nR : Type ?u.474256\nS : Type ?u.474259\ninst✝ : Zero M\np : α → Prop\nf :... | [
927,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
926,
1
] |
Mathlib/LinearAlgebra/Projection.lean | Submodule.mk_quotientEquivOfIsCompl_apply | [] | [
97,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.