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/Algebra/Module/LinearPMap.lean | LinearPMap.closure_def | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nE : Type u_2\nF : Type u_3\ninst✝¹¹ : CommRing R\ninst✝¹⁰ : AddCommGroup E\ninst✝⁹ : AddCommGroup F\ninst✝⁸ : Module R E\ninst✝⁷ : Module R F\ninst✝⁶ : TopologicalSpace E\ninst✝⁵ : TopologicalSpace F\ninst✝⁴ : ContinuousAdd E\ninst✝³ : ContinuousAd... | [
113,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
1
] |
Mathlib/ModelTheory/Semantics.lean | FirstOrder.Language.Formula.realize_inf | [] | [
632,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
631,
1
] |
Mathlib/Algebra/Lie/Submodule.lean | lie_mem_right | [] | [
231,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
230,
1
] |
Mathlib/Data/Sum/Basic.lean | Sum.isLeft_inr | [] | [
105,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
105,
9
] |
Mathlib/Data/Set/Basic.lean | Set.subset_singleton_iff_eq | [
{
"state_after": "case inl\nα : Type u\nβ : Type v\nγ : Type w\nι : Sort x\na b : α\ns s₁ s₂ t t₁ t₂ u : Set α\nx : α\n⊢ ∅ ⊆ {x} ↔ ∅ = ∅ ∨ ∅ = {x}\n\ncase inr\nα : Type u\nβ : Type v\nγ : Type w\nι : Sort x\na b : α\ns✝ s₁ s₂ t t₁ t₂ u s : Set α\nx : α\nhs : Set.Nonempty s\n⊢ s ⊆ {x} ↔ s = ∅ ∨ s = {x}",
"st... | [
1497,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1494,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.tendsto_mul_const_atTop_iff_pos | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.218886\nι' : Type ?u.218889\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.218898\ninst✝¹ : LinearOrderedSemifield α\nl : Filter β\nf : β → α\nr c : α\nn : ℕ\ninst✝ : NeBot l\nh : Tendsto f l atTop\n⊢ Tendsto (fun x => f x * r) l atTop ↔ 0 < r",
"tacti... | [
1029,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1027,
1
] |
Mathlib/Order/Monotone/Basic.lean | StrictMono.le_iff_le | [] | [
807,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
806,
1
] |
Mathlib/Computability/TuringMachine.lean | Turing.ListBlank.head_mk | [] | [
223,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
221,
1
] |
Mathlib/Algebra/GroupPower/Identities.lean | pow_four_add_four_mul_pow_four | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝ : CommRing R\na b x₁ x₂ x₃ x₄ x₅ x₆ x₇ x₈ y₁ y₂ y₃ y₄ y₅ y₆ y₇ y₈ n : R\n⊢ a ^ 4 + 4 * b ^ 4 = ((a - b) ^ 2 + b ^ 2) * ((a + b) ^ 2 + b ^ 2)",
"tactic": "ring"
}
] | [
44,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
42,
1
] |
Mathlib/LinearAlgebra/TensorProduct.lean | TensorProduct.comm_tmul | [] | [
654,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
653,
1
] |
Mathlib/Data/Set/Pointwise/Interval.lean | Set.preimage_neg_Iic | [] | [
139,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.dart_snd_mem_support_of_mem_darts | [
{
"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\nd : Dart G\nh : d ∈ darts p\n⊢ d.snd ∈ support p",
"tactic": "simpa using p.reverse.dart_fst_mem_support_of_mem_darts (by simp [h] ... | [
795,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
793,
1
] |
Mathlib/Topology/MetricSpace/PiNat.lean | PiNat.isOpen_iff_dist | [
{
"state_after": "case mp\nE : ℕ → Type u_1\ninst✝¹ : (n : ℕ) → TopologicalSpace (E n)\ninst✝ : ∀ (n : ℕ), DiscreteTopology (E n)\ns : Set ((n : ℕ) → E n)\n⊢ IsOpen s → ∀ (x : (n : ℕ) → E n), x ∈ s → ∃ ε, ε > 0 ∧ ∀ (y : (n : ℕ) → E n), dist x y < ε → y ∈ s\n\ncase mpr\nE : ℕ → Type u_1\ninst✝¹ : (n : ℕ) → Topol... | [
409,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
393,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Equiv.lean | ContinuousLinearEquiv.comp_hasFDerivAt_iff' | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_4\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type u_3\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type u_2\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace ... | [
156,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/FieldTheory/Adjoin.lean | IntermediateField.rank_adjoin_eq_one_iff | [] | [
732,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
731,
1
] |
Std/Data/List/Init/Lemmas.lean | List.map_append | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nf : α → β\n⊢ ∀ (l₁ l₂ : List α), map f (l₁ ++ l₂) = map f l₁ ++ map f l₂",
"tactic": "intro l₁ <;> induction l₁ <;> intros <;> simp_all"
}
] | [
91,
52
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
90,
9
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | ContDiffOn.csinh | [] | [
565,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
563,
1
] |
Mathlib/LinearAlgebra/Matrix/Transvection.lean | Matrix.Pivot.mul_listTransvecRow_last_row | [
{
"state_after": "n : Type ?u.187814\np : Type ?u.187817\nR : Type u₂\n𝕜 : Type u_1\ninst✝³ : Field 𝕜\ninst✝² : DecidableEq n\ninst✝¹ : DecidableEq p\ninst✝ : CommRing R\nr : ℕ\nM : Matrix (Fin r ⊕ Unit) (Fin r ⊕ Unit) 𝕜\nhM : M (inr ()) (inr ()) ≠ 0\ni : Fin r\nH :\n ∀ (k : ℕ),\n k ≤ r →\n (M ⬝ Lis... | [
495,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
454,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.Frequently.forall_exists_of_atTop | [] | [
345,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
343,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | ContDiffOn.sub | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝¹⁰ : NontriviallyNormedField 𝕜\nD : Type uD\ninst✝⁹ : NormedAddCommGroup D\ninst✝⁸ : NormedSpace 𝕜 D\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜... | [
1333,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1331,
1
] |
Mathlib/Algebra/Group/TypeTags.lean | Multiplicative.ofAdd_symm_eq | [] | [
88,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.ceil_eq_add_one_sub_fract | [
{
"state_after": "F : Type ?u.234022\nα : Type u_1\nβ : Type ?u.234028\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing α\nz : ℤ\na : α\nha : fract a ≠ 0\n⊢ ↑⌈a⌉ = a + 1 - (a + 1 - ↑⌈a⌉)",
"state_before": "F : Type ?u.234022\nα : Type u_1\nβ : Type ?u.234028\ninst✝¹ : LinearOrderedRing α\ninst✝ : FloorRing ... | [
1253,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1251,
1
] |
Mathlib/Data/Sum/Basic.lean | Sum.map_inr | [] | [
223,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
222,
1
] |
Mathlib/Order/Atoms.lean | le_iff_atom_le_imp | [
{
"state_after": "α : Type u_1\nβ : Type ?u.20383\ninst✝¹ : CompleteLattice α\ninst✝ : IsAtomistic α\na b : α\nh : ∀ (c : α), IsAtom c → c ≤ a → c ≤ b\n⊢ sSup {a_1 | IsAtom a_1 ∧ a_1 ≤ a} ≤ sSup {a | IsAtom a ∧ a ≤ b}",
"state_before": "α : Type u_1\nβ : Type ?u.20383\ninst✝¹ : CompleteLattice α\ninst✝ : Is... | [
402,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
399,
1
] |
Mathlib/Data/List/Zip.lean | List.prod_mul_prod_eq_prod_zipWith_mul_prod_drop | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type ?u.284124\nγ : Type ?u.284127\nδ : Type ?u.284130\nε : Type ?u.284133\ninst✝ : CommMonoid α\nys : List α\n⊢ prod [] * prod ys =\n prod (zipWith (fun x x_1 => x * x_1) [] ys) * prod (drop (length ys) []) * prod (drop (length []) ys)",
... | [
540,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
528,
1
] |
Mathlib/Topology/Order/LowerTopology.lean | WithLowerTopology.toLower_inj | [] | [
97,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
1
] |
Mathlib/Topology/Instances/Matrix.lean | Continuous.matrix_blockDiag | [] | [
262,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
260,
1
] |
Mathlib/Algebra/Star/StarAlgHom.lean | StarAlgHom.copy_eq | [] | [
402,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
401,
1
] |
Mathlib/Data/Finsupp/Fin.lean | Finsupp.tail_apply | [] | [
43,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
42,
1
] |
Mathlib/RingTheory/GradedAlgebra/Basic.lean | DirectSum.decompose_symm_mul | [] | [
102,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Analysis/SpecialFunctions/Arsinh.lean | DifferentiableOn.arsinh | [] | [
269,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Mathlib/Order/Filter/AtTopBot.lean | Filter.comap_embedding_atBot | [] | [
1342,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1340,
1
] |
Mathlib/Order/Max.lean | NoMinOrder.not_acc | [] | [
172,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Order/Hom/Lattice.lean | InfTopHom.comp_assoc | [] | [
965,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
963,
1
] |
Mathlib/GroupTheory/Subgroup/Pointwise.lean | Subgroup.pointwise_smul_le_pointwise_smul_iff₀ | [] | [
423,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
421,
1
] |
Mathlib/Topology/NhdsSet.lean | union_mem_nhdsSet | [
{
"state_after": "α : Type u_1\nβ : Type ?u.13910\ninst✝¹ : TopologicalSpace α\ninst✝ : TopologicalSpace β\ns t s₁ s₂ t₁ t₂ : Set α\nx : α\nh₁ : s₁ ∈ 𝓝ˢ t₁\nh₂ : s₂ ∈ 𝓝ˢ t₂\n⊢ s₁ ∪ s₂ ∈ 𝓝ˢ t₁ ⊔ 𝓝ˢ t₂",
"state_before": "α : Type u_1\nβ : Type ?u.13910\ninst✝¹ : TopologicalSpace α\ninst✝ : TopologicalSpac... | [
140,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/Algebra/MonoidAlgebra/Grading.lean | AddMonoidAlgebra.decomposeAux_eq_decompose | [] | [
204,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/Algebra/IndicatorFunction.lean | Set.mulIndicator_finset_biUnion | [
{
"state_after": "case refine'_1\nα : Type u_2\nβ : Type ?u.111160\nι✝ : Type ?u.111163\nM : Type u_3\nN : Type ?u.111169\ninst✝ : CommMonoid M\nι : Type u_1\nI : Finset ι\ns : ι → Set α\nf : α → M\n⊢ (∀ (i : ι), i ∈ ∅ → ∀ (j : ι), j ∈ ∅ → i ≠ j → Disjoint (s i) (s j)) →\n mulIndicator (⋃ (i : ι) (_ : i ∈ ∅)... | [
660,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
642,
1
] |
Std/Data/Int/Lemmas.lean | Int.neg_add_lt_of_lt_add | [
{
"state_after": "a b c : Int\nh✝ : a < b + c\nh : -b + a < -b + (b + c)\n⊢ -b + a < c",
"state_before": "a b c : Int\nh : a < b + c\n⊢ -b + a < c",
"tactic": "have h := Int.add_lt_add_left h (-b)"
},
{
"state_after": "no goals",
"state_before": "a b c : Int\nh✝ : a < b + c\nh : -b + a < -b ... | [
1069,
37
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1067,
11
] |
Mathlib/Dynamics/Flow.lean | Flow.image_eq_preimage | [] | [
196,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
195,
1
] |
Mathlib/Order/Heyting/Hom.lean | map_compl | [
{
"state_after": "no goals",
"state_before": "F : Type u_3\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.30200\nδ : Type ?u.30203\ninst✝² : HeytingAlgebra α\ninst✝¹ : HeytingAlgebra β\ninst✝ : HeytingHomClass F α β\nf : F\na : α\n⊢ ↑f (aᶜ) = ↑f aᶜ",
"tactic": "rw [← himp_bot, ← himp_bot, map_himp, map_bot]"
... | [
193,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/GroupTheory/FreeAbelianGroup.lean | FreeAbelianGroup.map_of_apply | [] | [
397,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
396,
1
] |
Mathlib/MeasureTheory/Measure/Content.lean | MeasureTheory.Content.le_outerMeasure_compacts | [
{
"state_after": "G : Type w\ninst✝¹ : TopologicalSpace G\nμ : Content G\ninst✝ : T2Space G\nK : Compacts G\n⊢ (fun s => ↑(toFun μ s)) K ≤\n ⨅ (t : Set G) (ht : IsOpen t) (_ : ↑K ⊆ t), innerContent μ { carrier := t, is_open' := ht }\n\ncase PU\nG : Type w\ninst✝¹ : TopologicalSpace G\nμ : Content G\ninst✝ : ... | [
276,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
271,
1
] |
Mathlib/Combinatorics/DoubleCounting.lean | Fintype.card_le_card_of_rightTotal_unique | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\ninst✝¹ : Fintype α\ninst✝ : Fintype β\nr : α → β → Prop\nh₁ : RightTotal r\nh₂ : RightUnique r\n⊢ ∀ (b : β), b ∈ univ → ∃ a, a ∈ univ ∧ r a b",
"tactic": "simpa using h₁"
}
] | [
149,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
147,
1
] |
Mathlib/Order/CompleteLattice.lean | sInf_range | [] | [
691,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
690,
1
] |
Mathlib/Data/Sym/Basic.lean | Sym.coe_attach | [] | [
438,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
436,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | MvPowerSeries.smul_eq_C_mul | [
{
"state_after": "case h\nσ : Type u_1\nR : Type u_2\ninst✝ : Semiring R\nf : MvPowerSeries σ R\na : R\nn✝ : σ →₀ ℕ\n⊢ ↑(coeff R n✝) (a • f) = ↑(coeff R n✝) (↑(C σ R) a * f)",
"state_before": "σ : Type u_1\nR : Type u_2\ninst✝ : Semiring R\nf : MvPowerSeries σ R\na : R\n⊢ a • f = ↑(C σ R) a * f",
"tacti... | [
538,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
536,
1
] |
Mathlib/Algebra/Order/Floor.lean | Nat.floor_eq_iff' | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.38289\nα : Type u_1\nβ : Type ?u.38295\ninst✝¹ : LinearOrderedSemiring α\ninst✝ : FloorSemiring α\na : α\nn : ℕ\nhn : n ≠ 0\n⊢ ⌊a⌋₊ = n ↔ ↑n ≤ a ∧ a < ↑n + 1",
"tactic": "rw [← le_floor_iff' hn, ← Nat.cast_one, ← Nat.cast_add, ← floor_lt' (Nat.ad... | [
247,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/Data/Finset/Preimage.lean | Finset.prod_preimage_of_bij | [] | [
170,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/Topology/SubsetProperties.lean | isCompact_diagonal | [] | [
852,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
851,
1
] |
Mathlib/FieldTheory/RatFunc.lean | RatFunc.algebraMap_apply | [
{
"state_after": "K : Type u\ninst✝³ : CommRing K\ninst✝² : IsDomain K\nR : Type u_1\ninst✝¹ : CommSemiring R\ninst✝ : Algebra R K[X]\nx : R\n⊢ ↑(algebraMap R (RatFunc K)) x = RatFunc.mk (↑(algebraMap R K[X]) x) 1",
"state_before": "K : Type u\ninst✝³ : CommRing K\ninst✝² : IsDomain K\nR : Type u_1\ninst✝¹ ... | [
854,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
851,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.IsNormal.eq_iff_zero_and_succ | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.371664\nβ : Type ?u.371667\nγ : Type ?u.371670\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nf g : Ordinal → Ordinal\nhf : IsNormal f\nhg : IsNormal g\nh : f = g\n⊢ f 0 = g 0 ∧ ∀ (a : Ordinal), f a = g a → f (succ a) = g (succ a)",
"tact... | [
2000,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1990,
1
] |
Mathlib/Data/Rat/Cast.lean | Rat.cast_le | [] | [
323,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
322,
1
] |
Mathlib/SetTheory/ZFC/Basic.lean | ZFSet.hereditarily_iff | [
{
"state_after": "no goals",
"state_before": "p : ZFSet → Prop\nx y : ZFSet\n⊢ Hereditarily p x ↔ p x ∧ ∀ (y : ZFSet), y ∈ x → Hereditarily p y",
"tactic": "rw [← Hereditarily]"
}
] | [
1420,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1419,
1
] |
Mathlib/Data/Multiset/Range.lean | Multiset.not_mem_range_self | [] | [
58,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/Algebra/Order/Sub/WithTop.lean | WithTop.sub_top | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.1766\ninst✝¹ : Sub α\ninst✝ : Zero α\na : WithTop α\n⊢ a - ⊤ = 0",
"tactic": "cases a <;> rfl"
}
] | [
48,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
48,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Localization.mk_eq_monoidOf_mk'_apply | [
{
"state_after": "M : Type u_1\ninst✝² : CommMonoid M\nS : Submonoid M\nN : Type ?u.3263012\ninst✝¹ : CommMonoid N\nP : Type ?u.3263018\ninst✝ : CommMonoid P\nx : M\ny : { x // x ∈ S }\n⊢ mk (x * ↑y) (1 * y) = mk x 1",
"state_before": "M : Type u_1\ninst✝² : CommMonoid M\nS : Submonoid M\nN : Type ?u.326301... | [
1649,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1644,
1
] |
Mathlib/Data/Finsupp/Basic.lean | Finsupp.filter_single_of_neg | [] | [
938,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
936,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.neg_apply | [] | [
951,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
951,
1
] |
Mathlib/Topology/UniformSpace/CompactConvergence.lean | ContinuousMap.tendsto_of_tendstoLocallyUniformly | [
{
"state_after": "α : Type u₁\nβ : Type u₂\ninst✝¹ : TopologicalSpace α\ninst✝ : UniformSpace β\nK : Set α\nV : Set (β × β)\nf : C(α, β)\nι : Type u₃\np : Filter ι\nF : ι → C(α, β)\nh : TendstoLocallyUniformly (fun i a => ↑(F i) a) (↑f) p\n⊢ ∀ (K : Set α), IsCompact K → TendstoUniformlyOn (fun i a => ↑(F i) a) ... | [
397,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
392,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.transpose_list_prod | [] | [
2099,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2097,
1
] |
Mathlib/Data/Finset/Lattice.lean | Set.iInter_eq_iInter_finset' | [] | [
1879,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1877,
1
] |
Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean | MeasureTheory.aecover_Ioc | [] | [
166,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
165,
1
] |
Mathlib/GroupTheory/Submonoid/Pointwise.lean | Submonoid.mul_subset | [
{
"state_after": "case intro.intro.intro.intro\nα : Type ?u.68\nG : Type ?u.71\nM : Type u_1\nR : Type ?u.77\nA : Type ?u.80\ninst✝¹ : Monoid M\ninst✝ : AddMonoid A\ns t u : Set M\nS : Submonoid M\nhs : s ⊆ ↑S\nht : t ⊆ ↑S\np q : M\nhp : p ∈ s\nhq : q ∈ t\n⊢ (fun x x_1 => x * x_1) p q ∈ ↑S",
"state_before":... | [
65,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/Logic/Basic.lean | Decidable.ne_or_eq | [] | [
207,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
207,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | one_div_lt_of_neg | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.157245\nα : Type u_1\nβ : Type ?u.157251\ninst✝ : LinearOrderedField α\na b c d : α\nn : ℤ\nha : a < 0\nhb : b < 0\n⊢ 1 / a < b ↔ 1 / b < a",
"tactic": "simpa using inv_lt_of_neg ha hb"
}
] | [
824,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
823,
1
] |
Mathlib/Data/Option/Basic.lean | Option.pbind_eq_some | [
{
"state_after": "case none\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.11629\nδ : Type ?u.11632\np : α → Prop\nf✝ : (a : α) → p a → β\ny : β\nf : (a : α) → a ∈ none → Option β\n⊢ pbind none f = some y ↔ ∃ z H, f z H = some y\n\ncase some\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.11629\nδ : Type ?u.11632\np : α → P... | [
232,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
222,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.eq_of_mem_uIcc_of_mem_uIcc' | [
{
"state_after": "ι : Type ?u.191847\nα : Type u_1\ninst✝¹ : DistribLattice α\ninst✝ : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\n⊢ a ⊓ c ≤ b ∧ b ≤ a ⊔ c → a ⊓ b ≤ c ∧ c ≤ a ⊔ b → b = c",
"state_before": "ι : Type ?u.191847\nα : Type u_1\ninst✝¹ : DistribLattice α\ninst✝ : LocallyFiniteOrder α\na a₁ a₂ ... | [
973,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
971,
1
] |
Mathlib/Topology/Algebra/ConstMulAction.lean | set_smul_mem_nhds_smul | [
{
"state_after": "M : Type ?u.159604\nα : Type u_1\nβ : Type ?u.159610\nΓ : Type ?u.159613\ninst✝⁶ : Group Γ\nT : Type ?u.159619\ninst✝⁵ : TopologicalSpace T\ninst✝⁴ : MulAction Γ T\nG₀ : Type u_2\ninst✝³ : GroupWithZero G₀\ninst✝² : MulAction G₀ α\ninst✝¹ : TopologicalSpace α\ninst✝ : ContinuousConstSMul G₀ α\... | [
554,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
550,
1
] |
Mathlib/Data/PFunctor/Univariate/M.lean | PFunctor.M.head_eq_head' | [] | [
278,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Mathlib/Analysis/Convex/StrictConvexSpace.lean | dist_add_dist_eq_iff | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.76649\nE : Type u_1\ninst✝⁴ : NormedLinearOrderedField 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedSpace 𝕜 E\ninst✝¹ : NormedSpace ℝ E\ninst✝ : StrictConvexSpace ℝ E\nx y z : E\na b r : ℝ\n⊢ dist x y + dist y z = dist x z ↔ y ∈ [x-[ℝ]z]",
... | [
239,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
1
] |
Mathlib/Analysis/InnerProductSpace/GramSchmidtOrtho.lean | span_gramSchmidtNormed_range | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_2\nE : Type u_1\ninst✝⁵ : IsROrC 𝕜\ninst✝⁴ : NormedAddCommGroup E\ninst✝³ : InnerProductSpace 𝕜 E\nι : Type u_3\ninst✝² : LinearOrder ι\ninst✝¹ : LocallyFiniteOrderBot ι\ninst✝ : IsWellOrder ι fun x x_1 => x < x_1\nf : ι → E\n⊢ span 𝕜 (Set.range (... | [
334,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
332,
1
] |
Mathlib/Order/Monotone/Basic.lean | antitone_comp_ofDual_iff | [] | [
143,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Mathlib/Data/List/Basic.lean | List.foldl_assoc_comm_cons | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.275924\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nop : α → α → α\nha : IsAssociative α op\nhc : IsCommutative α op\nl : List α\na₁ a₂ : α\n⊢ ((a₁ :: l) <*> a₂) = op a₁ (l <*> a₂)",
"tactic": "rw [foldl_cons, hc.comm, foldl_a... | [
2777,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2776,
1
] |
Mathlib/Algebra/CharP/Basic.lean | frobenius_zero | [] | [
398,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
397,
1
] |
Mathlib/MeasureTheory/Integral/Lebesgue.lean | MeasureTheory.set_lintegral_congr | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.294840\nγ : Type ?u.294843\nδ : Type ?u.294846\nm : MeasurableSpace α\nμ ν : Measure α\nf : α → ℝ≥0∞\ns t : Set α\nh : s =ᵐ[μ] t\n⊢ (∫⁻ (x : α) in s, f x ∂μ) = ∫⁻ (x : α) in t, f x ∂μ",
"tactic": "rw [Measure.restrict_congr_set h]"
... | [
328,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
327,
1
] |
Mathlib/LinearAlgebra/Matrix/ZPow.lean | Matrix.zpow_neg_mul_zpow_self | [
{
"state_after": "no goals",
"state_before": "n' : Type u_1\ninst✝² : DecidableEq n'\ninst✝¹ : Fintype n'\nR : Type u_2\ninst✝ : CommRing R\nn : ℤ\nA : M\nh : IsUnit (det A)\n⊢ A ^ (-n) * A ^ n = 1",
"tactic": "rw [zpow_neg h, mul_eq_mul, nonsing_inv_mul _ (h.det_zpow _)]"
}
] | [
328,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
327,
1
] |
Mathlib/Data/List/Zip.lean | List.zipWith_map | [
{
"state_after": "case nil\nα : Type u\nβ : Type u_2\nγ : Type u_3\nδ : Type u_4\nε : Type ?u.23411\nμ : Type u_1\nf : γ → δ → μ\ng : α → γ\nh : β → δ\nbs : List β\n⊢ zipWith f (map g []) (map h bs) = zipWith (fun a b => f (g a) (h b)) [] bs\n\ncase cons\nα : Type u\nβ : Type u_2\nγ : Type u_3\nδ : Type u_4\nε ... | [
143,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.bit1_apply | [
{
"state_after": "l : Type ?u.79474\nm : Type ?u.79477\nn : Type u_1\no : Type ?u.79483\nm' : o → Type ?u.79488\nn' : o → Type ?u.79493\nR : Type ?u.79496\nS : Type ?u.79499\nα : Type v\nβ : Type w\nγ : Type ?u.79506\ninst✝² : DecidableEq n\ninst✝¹ : AddZeroClass α\ninst✝ : One α\nM : Matrix n n α\ni j : n\n⊢ b... | [
584,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
580,
1
] |
Mathlib/Analysis/Complex/Basic.lean | Complex.nnnorm_nat | [
{
"state_after": "no goals",
"state_before": "E : Type ?u.221115\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℂ E\nn : ℕ\n⊢ ↑‖↑n‖₊ = ↑↑n",
"tactic": "simp"
}
] | [
191,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/Data/Vector.lean | Vector.map_cons | [] | [
141,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/MeasureTheory/Decomposition/Lebesgue.lean | MeasureTheory.SignedMeasure.eq_singularPart' | [
{
"state_after": "α : Type u_1\nβ : Type ?u.494818\nm : MeasurableSpace α\nμ ν : Measure α\ns t✝ t : SignedMeasure α\nf : α → ℝ\nhf : Measurable f\nhfi : Integrable f\nhtμ : t ⟂ᵥ toENNRealVectorMeasure μ\nhadd : s = t + withDensityᵥ μ f\nhtμ' : t ⟂ᵥ toENNRealVectorMeasure μ\n⊢ t = singularPart s μ",
"state_... | [
1044,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1027,
9
] |
Mathlib/Topology/Algebra/Order/Archimedean.lean | AddSubgroup.dense_of_not_isolated_zero | [
{
"state_after": "case inl\nG : Type u_1\ninst✝³ : LinearOrderedAddCommGroup G\ninst✝² : TopologicalSpace G\ninst✝¹ : OrderTopology G\ninst✝ : Archimedean G\nS : AddSubgroup G\nhS : ∀ (ε : G), ε > 0 → ∃ g, g ∈ S ∧ g ∈ Ioo 0 ε\nh✝ : Subsingleton G\n⊢ Dense ↑S\n\ncase inr\nG : Type u_1\ninst✝³ : LinearOrderedAddC... | [
56,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
45,
1
] |
Std/Data/RBMap/Lemmas.lean | Std.RBNode.size_lt_depth | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\n⊢ 0 < 1",
"tactic": "decide"
},
{
"state_after": "α : Type u_1\nc✝ : RBColor\na : RBNode α\nv✝ : α\nb : RBNode α\n⊢ size a + 1 + size b < 2 ^ max (depth a) (depth b) + 2 ^ max (depth a) (depth b)",
"state_before": "α : Type u_1\nc✝ ... | [
37,
73
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
30,
1
] |
Mathlib/Analysis/NormedSpace/Pointwise.lean | ball_add_ball | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type ?u.661902\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.ball a ε + Metric.ball b δ = Metric.ball (a + b) (ε +... | [
350,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
348,
1
] |
Mathlib/RingTheory/Algebraic.lean | Polynomial.algebraMap_pi_eq_aeval | [] | [
471,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
469,
1
] |
Mathlib/Data/Finset/NAry.lean | Finset.image₂_right_comm | [
{
"state_after": "α : Type u_4\nα' : Type ?u.74614\nβ : Type u_5\nβ' : Type ?u.74620\nγ✝ : Type ?u.74623\nγ' : Type ?u.74626\nδ : Type u_3\nδ' : Type u_6\nε : Type u_2\nε' : Type ?u.74638\nζ : Type ?u.74641\nζ' : Type ?u.74644\nν : Type ?u.74647\ninst✝⁷ : DecidableEq α'\ninst✝⁶ : DecidableEq β'\ninst✝⁵ : Decida... | [
396,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/CategoryTheory/Preadditive/Basic.lean | CategoryTheory.Preadditive.mono_iff_cancel_zero | [] | [
241,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
239,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | mem_ball_one_iff | [
{
"state_after": "no goals",
"state_before": "𝓕 : Type ?u.93611\n𝕜 : Type ?u.93614\nα : Type ?u.93617\nι : Type ?u.93620\nκ : Type ?u.93623\nE : Type u_1\nF : Type ?u.93629\nG : Type ?u.93632\ninst✝² : SeminormedGroup E\ninst✝¹ : SeminormedGroup F\ninst✝ : SeminormedGroup G\ns : Set E\na a₁ a₂ b b₁ b₂ : E... | [
628,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
628,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | Subalgebra.prod_top | [
{
"state_after": "case h\nR : Type u\nA : Type v\nB : Type w\ninst✝⁴ : CommSemiring R\ninst✝³ : Semiring A\ninst✝² : Algebra R A\ninst✝¹ : Semiring B\ninst✝ : Algebra R B\nS : Subalgebra R A\nS₁ : Subalgebra R B\nx✝ : A × B\n⊢ x✝ ∈ prod ⊤ ⊤ ↔ x✝ ∈ ⊤",
"state_before": "R : Type u\nA : Type v\nB : Type w\nins... | [
1128,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1128,
1
] |
Std/Data/Nat/Gcd.lean | Nat.coprime_one_left_eq_true | [] | [
361,
98
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
361,
9
] |
Mathlib/Algebra/Group/Opposite.lean | MulOpposite.commute_unop | [] | [
265,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
264,
1
] |
Mathlib/Data/Part.lean | Part.mod_def | [] | [
703,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
703,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Filter.lean | BoxIntegral.IntegrationParams.hasBasis_toFilterDistortion | [] | [
476,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
470,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.zpow_mem | [] | [
633,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
632,
11
] |
Mathlib/Order/LatticeIntervals.lean | Set.Ici.coe_bot | [] | [
134,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
133,
1
] |
Mathlib/Data/MvPolynomial/Variables.lean | MvPolynomial.degrees_add_of_disjoint | [
{
"state_after": "case a\nR : Type u\nS : Type v\nσ : Type u_1\nτ : Type ?u.51214\nr : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\np✝ q✝ : MvPolynomial σ R\ninst✝ : DecidableEq σ\np q : MvPolynomial σ R\nh : Multiset.Disjoint (degrees p) (degrees q)\n⊢ degrees (p + q) ≤ degrees p ∪ degrees q\n\ncase... | [
225,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
218,
1
] |
Mathlib/Algebra/Hom/Group.lean | MonoidWithZeroHom.toZeroHom_coe | [] | [
635,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
634,
1
] |
Mathlib/Algebra/Order/AbsoluteValue.lean | AbsoluteValue.pos | [] | [
127,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
11
] |
Mathlib/Analysis/Calculus/FDeriv/Add.lean | HasFDerivWithinAt.const_add | [] | [
264,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
262,
8
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.