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/Order/Filter/Prod.lean | Filter.Eventually.diag_of_prod_left | [
{
"state_after": "α : Type u_1\nβ : Type ?u.9875\nγ : Type u_2\nδ : Type ?u.9881\nι : Sort ?u.9884\ns : Set α\nt : Set β\nf✝ : Filter α\ng✝ : Filter β\nf : Filter α\ng : Filter γ\np : (α × α) × γ → Prop\nh : ∀ᶠ (x : (α × α) × γ) in (f ×ˢ f) ×ˢ g, p x\n⊢ ∀ᶠ (x : α × γ) in f ×ˢ g, p ((x.fst, x.fst), x.snd)",
... | [
202,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean | stronglyMeasurable_bot_iff | [
{
"state_after": "case inl\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.48568\nι : Type ?u.48571\ninst✝³ : Countable ι\nf g : α → β\ninst✝² : TopologicalSpace β\ninst✝¹ : Nonempty β\ninst✝ : T2Space β\nhα : IsEmpty α\n⊢ StronglyMeasurable f ↔ ∃ c, f = fun x => c\n\ncase inr\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.... | [
292,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
275,
1
] |
Mathlib/Data/Nat/Factorization/Basic.lean | Nat.factorization_eq_zero_iff | [
{
"state_after": "n p : ℕ\n⊢ ¬p ∈ factors n ↔ ¬Prime p ∨ ¬p ∣ n ∨ n = 0",
"state_before": "n p : ℕ\n⊢ ↑(factorization n) p = 0 ↔ ¬Prime p ∨ ¬p ∣ n ∨ n = 0",
"tactic": "rw [← not_mem_support_iff, support_factorization, mem_toFinset]"
},
{
"state_after": "case inl\np : ℕ\n⊢ ¬p ∈ factors 0 ↔ ¬Prime... | [
160,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/Topology/UniformSpace/Cauchy.lean | CauchySeq.comp_tendsto | [] | [
204,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
Mathlib/MeasureTheory/Function/LpSpace.lean | BoundedContinuousFunction.range_toLp | [] | [
1664,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1661,
1
] |
Mathlib/Data/Nat/PSub.lean | Nat.ppred_eq_none | [
{
"state_after": "no goals",
"state_before": "⊢ ppred 0 = none ↔ 0 = 0",
"tactic": "simp"
},
{
"state_after": "no goals",
"state_before": "n : ℕ\n⊢ ppred (n + 1) = none ↔ n + 1 = 0",
"tactic": "constructor <;> intro <;> contradiction"
}
] | [
77,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/RingTheory/DedekindDomain/Ideal.lean | FractionalIdeal.one_mem_inv_coe_ideal | [
{
"state_after": "R : Type ?u.275932\nA : Type u_1\nK : Type u_2\ninst✝⁵ : CommRing R\ninst✝⁴ : CommRing A\ninst✝³ : Field K\ninst✝² : IsDomain A\ninst✝¹ : Algebra A K\ninst✝ : IsFractionRing A K\nI : Ideal A\nhI : I ≠ ⊥\n⊢ ∀ (y : K), y ∈ ↑I → 1 * y ∈ 1",
"state_before": "R : Type ?u.275932\nA : Type u_1\nK... | [
459,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
454,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | differentiableAt_id' | [] | [
1013,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1012,
1
] |
Mathlib/Topology/ContinuousOn.lean | ContinuousWithinAt.tendsto_nhdsWithin | [] | [
554,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
552,
1
] |
Mathlib/Algebra/Module/LinearMap.lean | LinearMap.comp_neg | [] | [
922,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
921,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.L1.norm_sub_eq_lintegral | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.1303508\nδ : Type ?u.1303511\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝² : MeasurableSpace δ\ninst✝¹ : NormedAddCommGroup β\ninst✝ : NormedAddCommGroup γ\nf g : { x // x ∈ Lp β 1 }\n⊢ ENNReal.toReal (∫⁻ (a : α), ↑‖↑↑(f - g) a‖₊ ∂μ) = ENNReal.toReal (... | [
1321,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1315,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.diam_triple | [
{
"state_after": "α : Type u\nβ : Type v\nX : Type ?u.529537\nι : Type ?u.529540\ninst✝ : PseudoMetricSpace α\ns : Set α\nx y z : α\n⊢ ENNReal.toReal (max (max (edist x y) (edist x z)) (edist y z)) =\n max (max (ENNReal.toReal (edist x y)) (ENNReal.toReal (edist x z))) (ENNReal.toReal (edist y z))",
"sta... | [
2610,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2607,
1
] |
Mathlib/Topology/PathConnected.lean | mem_pathComponent_of_mem | [] | [
913,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
912,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearEquiv.coe_inj | [] | [
1824,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1823,
1
] |
src/lean/Init/Control/Lawful.lean | StateT.ext | [] | [
243,
11
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
242,
1
] |
Mathlib/RingTheory/HahnSeries.lean | HahnSeries.SummableFamily.embDomain_succ_smul_powers | [
{
"state_after": "case h\nΓ : Type u_1\nR : Type u_2\ninst✝² : LinearOrderedCancelAddCommMonoid Γ\ninst✝¹ : CommRing R\ninst✝ : IsDomain R\nx : HahnSeries Γ R\nhx : 0 < ↑(addVal Γ R) x\n⊢ ∀ (a : ℕ),\n toFun (embDomain (x • powers x hx) { toFun := Nat.succ, inj' := Nat.succ_injective }) a =\n toFun (powe... | [
1804,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1793,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.prod_sInter | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.241940\nι : Sort ?u.241943\nι' : Sort ?u.241946\nι₂ : Sort ?u.241949\nκ : ι → Sort ?u.241954\nκ₁ : ι → Sort ?u.241959\nκ₂ : ι → Sort ?u.241964\nκ' : ι' → Sort ?u.241969\nT : Set (Set β)\nhT : Set.Nonempty T\ns : Set α\n⊢ (⋂ (r : Set α × Set β) (_ : r ∈ {... | [
1853,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1850,
1
] |
Mathlib/GroupTheory/PGroup.lean | IsPGroup.cyclic_center_quotient_of_card_eq_prime_sq | [
{
"state_after": "case intro.intro\np : ℕ\nG : Type u_1\ninst✝² : Group G\ninst✝¹ : Fintype G\ninst✝ : Fact (Nat.Prime p)\nn : ℕ\nhGpn : card G = p ^ n\nhG : card G = p ^ 2\nk : ℕ\nhk0 : k > 0\nhk : card { x // x ∈ center G } = p ^ k\n⊢ IsCyclic (G ⧸ center G)",
"state_before": "p : ℕ\nG : Type u_1\ninst✝² ... | [
396,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
383,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | HasStrictDerivAt.csinh | [] | [
267,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
265,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean | HasDerivWithinAt.cpow | [
{
"state_after": "no goals",
"state_before": "f g : ℂ → ℂ\ns : Set ℂ\nf' g' x c : ℂ\nhf : HasDerivWithinAt f f' s x\nhg : HasDerivWithinAt g g' s x\nh0 : 0 < (f x).re ∨ (f x).im ≠ 0\n⊢ HasDerivWithinAt (fun x => f x ^ g x) (g x * f x ^ (g x - 1) * f' + f x ^ g x * Complex.log (f x) * g') s x",
"tactic":... | [
196,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Probability/ProbabilityMassFunction/Monad.lean | Pmf.mem_support_bindOnSupport_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nγ : Type ?u.107281\np : Pmf α\nf : (a : α) → a ∈ support p → Pmf β\nb : β\n⊢ b ∈ support (bindOnSupport p f) ↔ ∃ a h, b ∈ support (f a h)",
"tactic": "simp only [support_bindOnSupport, Set.mem_setOf_eq, Set.mem_iUnion]"
}
] | [
243,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
241,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | LinearMap.toMatrix'_algebraMap | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝² : CommSemiring R\nk : Type ?u.932592\nl : Type ?u.932595\nm : Type ?u.932598\nn : Type u_2\ninst✝¹ : Fintype n\ninst✝ : DecidableEq n\nx : R\n⊢ ↑toMatrix' (↑(algebraMap R (Module.End R (n → R))) x) = ↑(scalar n) x",
"tactic": "simp [Modu... | [
412,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
410,
1
] |
Mathlib/Data/Num/Lemmas.lean | PosNum.bit_to_nat | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.357130\nb : Bool\nn : PosNum\n⊢ ↑(bit b n) = Nat.bit b ↑n",
"tactic": "cases b <;> rfl"
}
] | [
659,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
659,
1
] |
Mathlib/Data/Int/Order/Basic.lean | Int.ediv_mul_le | [
{
"state_after": "a✝ b✝ : ℤ\nn : ℕ\na b : ℤ\nH : b ≠ 0\n⊢ 0 ≤ a % b",
"state_before": "a✝ b✝ : ℤ\nn : ℕ\na b : ℤ\nH : b ≠ 0\n⊢ 0 ≤ a - a / b * b",
"tactic": "rw [mul_comm, ← emod_def]"
},
{
"state_after": "no goals",
"state_before": "a✝ b✝ : ℤ\nn : ℕ\na b : ℤ\nH : b ≠ 0\n⊢ 0 ≤ a % b",
"t... | [
422,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
421,
11
] |
Mathlib/Data/Set/Intervals/OrdConnected.lean | Set.ordConnected_iff_uIcc_subset_left | [] | [
282,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
280,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.iUnion_of_empty | [] | [
1331,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1330,
1
] |
Mathlib/Algebra/Periodic.lean | Function.Periodic.exists_mem_Ioc | [] | [
306,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
303,
1
] |
Mathlib/CategoryTheory/Shift/Basic.lean | CategoryTheory.shift_shiftFunctorCompIsoId_add_neg_self_hom_app | [
{
"state_after": "no goals",
"state_before": "C : Type u\nA : Type u_1\ninst✝² : Category C\ninst✝¹ : AddGroup A\ninst✝ : HasShift C A\nX✝ Y : C\nf : X✝ ⟶ Y\nn : A\nX : C\n⊢ (shiftFunctor C n).map ((shiftFunctorCompIsoId C n (-n) (_ : n + -n = 0)).hom.app X) =\n (shiftFunctorCompIsoId C (-n) n (_ : -n + ... | [
526,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
523,
1
] |
Mathlib/Analysis/Normed/Group/Hom.lean | NormedAddGroupHom.coe_nsmul | [] | [
555,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
554,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean | Real.arcsin_lt_iff_lt_sin' | [] | [
182,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.Dart.edge_mem | [] | [
736,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
735,
1
] |
Mathlib/FieldTheory/Laurent.lean | RatFunc.laurent_injective | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝ : CommRing R\nhdomain : IsDomain R\nr s : R\np q : R[X]\nf x✝¹ x✝ : RatFunc R\nh : ↑(laurent r) x✝¹ = ↑(laurent r) x✝\n⊢ x✝¹ = x✝",
"tactic": "simpa [laurent_laurent] using congr_arg (laurent (-r)) h"
}
] | [
121,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
120,
1
] |
Mathlib/Algebra/Lie/TensorProduct.lean | LieModule.toModuleHom_apply | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝⁶ : CommRing R\nL : Type v\nM : Type w\ninst✝⁵ : LieRing L\ninst✝⁴ : LieAlgebra R L\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\ninst✝¹ : LieRingModule L M\ninst✝ : LieModule R L M\nx : L\nm : M\n⊢ ↑(toModuleHom R L M) (x ⊗ₜ[R] m) = ⁅x, m⁆",
... | [
199,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
197,
1
] |
Mathlib/Algebra/Ring/BooleanRing.lean | BooleanRing.inf_sup_self | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.14539\nγ : Type ?u.14542\ninst✝² : BooleanRing α\ninst✝¹ : BooleanRing β\ninst✝ : BooleanRing γ\na b : α\n⊢ a * (a + b + a * b) = a",
"tactic": "rw [mul_add, mul_add, mul_self, ← mul_assoc, mul_self, add_assoc, add_self, add_zero]"
... | [
225,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Mathlib/Order/SuccPred/Limit.lean | Order.IsSuccLimit.isMax | [
{
"state_after": "α : Type u_1\ninst✝¹ : Preorder α\na : α\ninst✝ : SuccOrder α\nh : IsSuccLimit (succ a)\nH : ¬IsMax a\n⊢ False",
"state_before": "α : Type u_1\ninst✝¹ : Preorder α\na : α\ninst✝ : SuccOrder α\nh : IsSuccLimit (succ a)\n⊢ IsMax a",
"tactic": "by_contra H"
},
{
"state_after": "no... | [
75,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
11
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.mul_eq_mul | [] | [
547,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
546,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.mk_zero | [] | [
406,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
405,
1
] |
Mathlib/Data/Finset/LocallyFinite.lean | Finset.Icc_subset_Ico_right | [
{
"state_after": "ι : Type ?u.23148\nα : Type u_1\ninst✝¹ : Preorder α\ninst✝ : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\nh : b₁ < b₂\n⊢ Set.Icc a b₁ ⊆ Set.Ico a b₂",
"state_before": "ι : Type ?u.23148\nα : Type u_1\ninst✝¹ : Preorder α\ninst✝ : LocallyFiniteOrder α\na a₁ a₂ b b₁ b₂ c x : α\nh : b₁ < b... | [
222,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
220,
1
] |
Mathlib/Data/Nat/Factors.lean | Nat.coprime_factors_disjoint | [
{
"state_after": "a b : ℕ\nhab : coprime a b\nq : ℕ\nhqa : q ∈ factors a\nhqb : q ∈ factors b\n⊢ False",
"state_before": "a b : ℕ\nhab : coprime a b\n⊢ List.Disjoint (factors a) (factors b)",
"tactic": "intro q hqa hqb"
},
{
"state_after": "a b : ℕ\nhab : coprime a b\nq : ℕ\nhqa : q ∈ factors a\... | [
270,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
265,
1
] |
Mathlib/Order/Height.lean | Set.chainHeight_eq_iSup_subtype | [] | [
93,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Algebra/Lie/Basic.lean | LieModuleHom.map_neg | [] | [
746,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
745,
1
] |
Mathlib/Algebra/Group/Opposite.lean | MulOpposite.semiconjBy_op | [
{
"state_after": "no goals",
"state_before": "α : Type u\ninst✝ : Mul α\na x y : α\n⊢ SemiconjBy (op a) (op y) (op x) ↔ SemiconjBy a x y",
"tactic": "simp only [SemiconjBy, ← op_mul, op_inj, eq_comm]"
}
] | [
218,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
217,
1
] |
Mathlib/Data/Fintype/Card.lean | Finset.card_eq_iff_eq_univ | [
{
"state_after": "α : Type u_1\nβ : Type ?u.8142\nγ : Type ?u.8145\ninst✝ : Fintype α\n⊢ card univ = Fintype.card α",
"state_before": "α : Type u_1\nβ : Type ?u.8142\nγ : Type ?u.8145\ninst✝ : Fintype α\ns : Finset α\n⊢ s = univ → card s = Fintype.card α",
"tactic": "rintro rfl"
},
{
"state_afte... | [
263,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
259,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.apply_lt_nfpBFamily_iff | [
{
"state_after": "o : Ordinal\nf : (b : Ordinal) → b < o → Ordinal → Ordinal\nho : o ≠ 0\nH : ∀ (i : Ordinal) (hi : i < o), IsNormal (f i hi)\na : Ordinal\nb : Ordinal\nh : ∀ (i : Ordinal) (hi : i < o), f i hi b < nfpBFamily o f a\nthis : Nonempty (Quotient.out o).α\n⊢ b < nfpBFamily o f a",
"state_before":... | [
307,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
302,
1
] |
Std/Data/Nat/Lemmas.lean | Nat.dvd_mul_right | [] | [
657,
68
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
657,
11
] |
Mathlib/Order/Monotone/Extension.lean | MonotoneOn.exists_monotone_extension | [
{
"state_after": "case intro\nα : Type u_1\nβ : Type u_2\ninst✝¹ : LinearOrder α\ninst✝ : ConditionallyCompleteLinearOrder β\nf : α → β\ns : Set α\na✝ b : α\nh : MonotoneOn f s\nhu : BddAbove (f '' s)\na : β\nha : a ∈ lowerBounds (f '' s)\n⊢ ∃ g, Monotone g ∧ EqOn f g s",
"state_before": "α : Type u_1\nβ : ... | [
51,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
28,
1
] |
Mathlib/SetTheory/Ordinal/Basic.lean | Ordinal.card_one | [] | [
639,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
638,
1
] |
Mathlib/Data/Nat/Order/Basic.lean | Nat.lt_mul_self_iff | [] | [
333,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
331,
1
] |
Mathlib/Algebra/Group/Commute.lean | Commute.units_inv_left_iff | [] | [
241,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
240,
1
] |
Mathlib/SetTheory/Ordinal/Basic.lean | RelIso.ordinal_type_eq | [] | [
215,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/Order/Filter/Ultrafilter.lean | Ultrafilter.eventually_imp | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type ?u.12644\nf g : Ultrafilter α\ns t : Set α\np q : α → Prop\n⊢ (∀ᶠ (x : α) in ↑f, p x → q x) ↔ (∀ᶠ (x : α) in ↑f, p x) → ∀ᶠ (x : α) in ↑f, q x",
"tactic": "simp only [imp_iff_not_or, eventually_or, eventually_not]"
}
] | [
199,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
1
] |
Mathlib/LinearAlgebra/Span.lean | LinearEquiv.coord_self | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nR₂ : Type ?u.393929\nK : Type ?u.393932\nM : Type u_2\nM₂ : Type ?u.393938\nV : Type ?u.393941\nS : Type ?u.393944\ninst✝³ : Ring R\ninst✝² : AddCommGroup M\ninst✝¹ : Module R M\ninst✝ : NoZeroSMulDivisors R M\nx : M\nh : x ≠ 0\n⊢ ↑(coord R M x h) ... | [
1042,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1041,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.toSubgraph_map | [
{
"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 w : V\nf : G →g G'\np : Walk G u v\n⊢ Walk.toSubgraph (Walk.map f p) = Subgraph.map f (Walk.toSubgraph p)",
"tactic": "induction p <;> simp [*, Subgraph... | [
2276,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2275,
1
] |
Std/Data/Int/Lemmas.lean | Int.add_le_add_three | [] | [
1148,
43
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1146,
11
] |
Mathlib/Algebra/GeomSum.lean | geom_sum_inv | [
{
"state_after": "α : Type u\ninst✝ : DivisionRing α\nx : α\nhx1 : x ≠ 1\nhx0 : x ≠ 0\nn : ℕ\nh₁ : x⁻¹ ≠ 1\n⊢ ∑ i in range n, x⁻¹ ^ i = (x - 1)⁻¹ * (x - x⁻¹ ^ n * x)",
"state_before": "α : Type u\ninst✝ : DivisionRing α\nx : α\nhx1 : x ≠ 1\nhx0 : x ≠ 0\nn : ℕ\n⊢ ∑ i in range n, x⁻¹ ^ i = (x - 1)⁻¹ * (x - x⁻... | [
391,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/LinearAlgebra/SesquilinearForm.lean | LinearMap.orthogonal_span_singleton_eq_to_lin_ker | [
{
"state_after": "case h\nR : Type ?u.247696\nR₁ : Type ?u.247699\nR₂ : Type ?u.247702\nR₃ : Type ?u.247705\nM : Type ?u.247708\nM₁ : Type ?u.247711\nM₂ : Type ?u.247714\nMₗ₁ : Type ?u.247717\nMₗ₁' : Type ?u.247720\nMₗ₂ : Type ?u.247723\nMₗ₂' : Type ?u.247726\nK : Type u_1\nK₁ : Type ?u.247732\nK₂ : Type ?u.247... | [
386,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/Data/List/Perm.lean | List.Perm.join_congr | [] | [
1084,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1081,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.map_eq_of_inverse | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.313560\nι : Sort x\nf : Filter α\ng : Filter β\nφ : α → β\nψ : β → α\neq : φ ∘ ψ = id\nhφ : Tendsto φ f g\nhψ : Tendsto ψ g f\n⊢ g ≤ map φ (map ψ g)",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.313560\nι : Sort x\nf : Fi... | [
2981,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2978,
1
] |
Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean | Finpartition.isUniformOne | [
{
"state_after": "α : Type u_1\n𝕜 : Type u_2\ninst✝² : LinearOrderedField 𝕜\ninst✝¹ : DecidableEq α\nA : Finset α\nP : Finpartition A\nG : SimpleGraph α\ninst✝ : DecidableRel G.Adj\nε : 𝕜\n⊢ card (nonUniforms P G 1) ≤ card P.parts * (card P.parts - 1)",
"state_before": "α : Type u_1\n𝕜 : Type u_2\ninst✝... | [
246,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
242,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Icc_subset_Iic_iff | [] | [
582,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
581,
1
] |
Mathlib/GroupTheory/Coset.lean | Subgroup.quotientSubgroupOfMapOfLe_apply_mk | [] | [
720,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
717,
1
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | smul_pow | [
{
"state_after": "case zero\nα : Type ?u.64314\nM : Type u\nN : Type v\nG : Type w\nH : Type x\nA : Type y\nB : Type z\nR : Type u₁\nS : Type u₂\ninst✝⁶ : Monoid M\ninst✝⁵ : Monoid N\ninst✝⁴ : AddMonoid A\ninst✝³ : AddMonoid B\ninst✝² : MulAction M N\ninst✝¹ : IsScalarTower M N N\ninst✝ : SMulCommClass M N N\nk... | [
117,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Mathlib/Order/Atoms.lean | Set.isCoatom_iff | [
{
"state_after": "α : Type u_1\nβ : Type ?u.81807\ns : Set α\n⊢ (∃ x, sᶜ = {x}) ↔ ∃ x, s = {x}ᶜ",
"state_before": "α : Type u_1\nβ : Type ?u.81807\ns : Set α\n⊢ IsCoatom s ↔ ∃ x, s = {x}ᶜ",
"tactic": "rw [isCompl_compl.isCoatom_iff_isAtom, isAtom_iff]"
},
{
"state_after": "no goals",
"state_... | [
906,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
904,
1
] |
Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean | MeasureTheory.AECover.integrable_of_lintegral_nnnorm_tendsto | [
{
"state_after": "α : Type u_2\nι : Type u_1\nE : Type u_3\ninst✝³ : MeasurableSpace α\nμ : Measure α\nl : Filter ι\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NeBot l\ninst✝ : IsCountablyGenerated l\nφ : ι → Set α\nhφ : AECover μ l φ\nf : α → E\nI : ℝ\nhfm : AEStronglyMeasurable f μ\nhtendsto : Tendsto (fun i => ... | [
422,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
415,
1
] |
Mathlib/Order/Lattice.lean | inf_eq_inf_iff_right | [] | [
556,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
555,
1
] |
Mathlib/MeasureTheory/Function/AEEqOfIntegral.lean | MeasureTheory.Lp.ae_eq_of_forall_set_integral_eq | [] | [
489,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
482,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Real.lean | Real.mul_rpow | [
{
"state_after": "case inl.inr.hx\nx✝ y✝ z✝ x y z : ℝ\nh : 0 ≤ x\nh₁ : 0 ≤ y\nh_ifs : x = 0 ∨ y = 0\nh✝ : ¬z = 0\n⊢ 0 ≤ x\n\ncase inr\nx✝ y✝ z✝ x y z : ℝ\nh : 0 ≤ x\nh₁ : 0 ≤ y\nh_ifs : ¬(x = 0 ∨ y = 0)\n⊢ exp (log (x * y) * z) = x ^ z * y ^ z\n\ncase hx\nx✝ y✝ z✝ x y z : ℝ\nh : 0 ≤ x\nh₁ : 0 ≤ y\n⊢ 0 ≤ x * y",... | [
393,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
375,
1
] |
Mathlib/Data/MvPolynomial/CommRing.lean | MvPolynomial.totalDegree_neg | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nσ : Type u_1\na✝ a' a₁ a₂ : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝ : CommRing R\np q a : MvPolynomial σ R\n⊢ totalDegree (-a) = totalDegree a",
"tactic": "simp only [totalDegree, support_neg]"
}
] | [
203,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
Mathlib/Data/List/Basic.lean | List.splitOnP_first | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.302857\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\np : α → Bool\nxs ys : List α\nls : List (List α)\nf : List α → List α\nh : ∀ (x : α), x ∈ xs → ¬p x = true\nsep : α\nhsep : p sep = true\nas : List α\n⊢ splitOnP p (xs ++ sep :: ... | [
2981,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2977,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.sup_def | [] | [
46,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
45,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.coeff_C_ne_zero | [
{
"state_after": "no goals",
"state_before": "R : Type u\na b : R\nm n : ℕ\ninst✝ : Semiring R\np q : R[X]\nh : n ≠ 0\n⊢ coeff (↑C a) n = 0",
"tactic": "rw [coeff_C, if_neg h]"
}
] | [
730,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
730,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.coe_zero | [] | [
292,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
291,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | Finset.prod_apply_dite | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.387864\nβ : Type u\nα : Type v\nγ : Type w\ns✝ s₁ s₂ : Finset α\na : α\nf✝ g✝ : α → β\ninst✝¹ : CommMonoid β\ns : Finset α\np : α → Prop\nhp : DecidablePred p\ninst✝ : DecidablePred fun x => ¬p x\nf : (x : α) → p x → γ\ng : (x : α) → ¬p x → γ\nh : γ ... | [
968,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
951,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.measure_le_sInf | [
{
"state_after": "α : Type u_1\nβ : Type ?u.152195\nγ : Type ?u.152198\nδ : Type ?u.152201\nι : Type ?u.152204\nR : Type ?u.152207\nR' : Type ?u.152210\nm0 : MeasurableSpace α\ninst✝¹ : MeasurableSpace β\ninst✝ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns✝ s' t : Set α\nm : Set (Measure α)\nh : ∀ (... | [
1033,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1030,
9
] |
Mathlib/Analysis/NormedSpace/lpSpace.lean | lp.coeFn_add | [] | [
374,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
373,
1
] |
Mathlib/MeasureTheory/Measure/OuterMeasure.lean | MeasureTheory.OuterMeasure.map_iSup | [
{
"state_after": "no goals",
"state_before": "α : Type u_3\nβ✝ : Type ?u.80158\nR : Type ?u.80161\nR' : Type ?u.80164\nms : Set (OuterMeasure α)\nm✝ : OuterMeasure α\nβ : Type u_1\nι : Sort u_2\nf : α → β\nm : ι → OuterMeasure α\ns : Set β\n⊢ ↑(↑(map f) (⨆ (i : ι), m i)) s = ↑(⨆ (i : ι), ↑(map f) (m i)) s",... | [
483,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
482,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsLittleO.add_isBigO | [] | [
1091,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1090,
1
] |
Mathlib/MeasureTheory/Function/LpSeminorm.lean | MeasureTheory.snorm_const_smul | [
{
"state_after": "case inl\nα : Type u_1\nE : Type ?u.5983830\nF : Type u_2\nG : Type ?u.5983836\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq : ℝ\nμ ν : Measure α\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedAddCommGroup F\ninst✝⁵ : NormedAddCommGroup G\n𝕜 : Type u_3\ninst✝⁴ : NormedDivisionRing 𝕜\ninst✝³ : MulAc... | [
1574,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1568,
1
] |
Mathlib/Data/Polynomial/Splits.lean | Polynomial.splits_prod_iff | [
{
"state_after": "F : Type u\nK : Type v\nL : Type w\ninst✝² : Field K\ninst✝¹ : Field L\ninst✝ : Field F\ni : K →+* L\nι : Type u\ns : ι → K[X]\nt✝ : Finset ι\na : ι\nt : Finset ι\nhat : ¬a ∈ t\nih : (∀ (j : ι), j ∈ t → s j ≠ 0) → (Splits i (∏ x in t, s x) ↔ ∀ (j : ι), j ∈ t → Splits i (s j))\nht : ∀ (j : ι), ... | [
281,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
274,
1
] |
Mathlib/Data/Finset/Card.lean | Finset.card_eq_of_bijective | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.20200\ns t : Finset α\nf✝ : α → β\nn : ℕ\nf : (i : ℕ) → i < n → α\nhf : ∀ (a : α), a ∈ s → ∃ i h, f i h = a\nhf' : ∀ (i : ℕ) (h : i < n), f i h ∈ s\nf_inj : ∀ (i j : ℕ) (hi : i < n) (hj : j < n), f i hi = f j hj → i = j\n⊢ card s = n",
... | [
309,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
292,
1
] |
Mathlib/Data/Finsupp/NeLocus.lean | Finsupp.neLocus_add_right | [] | [
132,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/Logic/Encodable/Basic.lean | Encodable.decode₂_eq_some | [] | [
205,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.HasBasis.eq_of_same_basis | [
{
"state_after": "case a\nα : Type u_1\nβ : Type ?u.11236\nγ : Type ?u.11239\nι : Sort u_2\nι' : Sort ?u.11245\nl l' : Filter α\np : ι → Prop\ns : ι → Set α\nt✝ : Set α\ni : ι\np' : ι' → Prop\ns' : ι' → Set α\ni' : ι'\nhl : HasBasis l p s\nhl' : HasBasis l' p s\nt : Set α\n⊢ t ∈ l ↔ t ∈ l'",
"state_before":... | [
270,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
268,
1
] |
Std/Data/String/Lemmas.lean | String.Iterator.ValidFor.mk' | [
{
"state_after": "no goals",
"state_before": "l r : List Char\n⊢ ValidFor l r { s := { data := List.reverse l ++ r }, i := { byteIdx := utf8Len (List.reverse l) } }",
"tactic": "simpa [List.reverseAux_eq] using mk"
}
] | [
522,
38
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
521,
1
] |
Mathlib/Computability/RegularExpressions.lean | RegularExpression.plus_def | [] | [
101,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Data/Option/Basic.lean | Option.coe_get | [] | [
54,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean | MeasureTheory.Measure.map_linearMap_add_haar_eq_smul_add_haar | [
{
"state_after": "E : Type u_1\ninst✝⁸ : NormedAddCommGroup E\ninst✝⁷ : NormedSpace ℝ E\ninst✝⁶ : MeasurableSpace E\ninst✝⁵ : BorelSpace E\ninst✝⁴ : FiniteDimensional ℝ E\nμ : Measure E\ninst✝³ : IsAddHaarMeasure μ\nF : Type ?u.986679\ninst✝² : NormedAddCommGroup F\ninst✝¹ : NormedSpace ℝ F\ninst✝ : CompleteSpa... | [
246,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
221,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.restrict_apply_superset | [] | [
1610,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1608,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.ofReal_pos | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.807239\nβ : Type ?u.807242\na b c d : ℝ≥0∞\nr p✝ q : ℝ≥0\np : ℝ\n⊢ 0 < ENNReal.ofReal p ↔ 0 < p",
"tactic": "simp [ENNReal.ofReal]"
}
] | [
2114,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2114,
1
] |
Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean | SubmodulesRingBasis.toRing_subgroups_basis | [
{
"state_after": "ι : Type u_1\nR : Type u_2\nA : Type u_3\ninst✝² : CommRing R\ninst✝¹ : CommRing A\ninst✝ : Algebra R A\nB : ι → Submodule R A\nhB✝ hB : SubmodulesRingBasis B\n⊢ ∀ (x : A) (i : ι), ∃ j, ↑(Submodule.toAddSubgroup (B j)) ⊆ (fun y => x * y) ⁻¹' ↑(Submodule.toAddSubgroup (B i))",
"state_before... | [
238,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
231,
1
] |
Mathlib/Analysis/NormedSpace/LinearIsometry.lean | LinearIsometryEquiv.symm_trans_self | [] | [
833,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
832,
1
] |
Mathlib/Analysis/Convex/Between.lean | Wbtw.right_mem_image_Ici_of_left_ne | [] | [
697,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
695,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.ext_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type u_1\na a' a₁ a₂ : R\ne : ℕ\nn m✝ : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\ninst✝ : CommSemiring S₁\np✝ q✝ p q : MvPolynomial σ R\nh : p = q\nm : σ →₀ ℕ\n⊢ coeff m p = coeff m q",
"tactic": "rw [h]"
... | [
606,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
605,
1
] |
Mathlib/Topology/Algebra/UniformGroup.lean | UniformGroup.mk' | [
{
"state_after": "no goals",
"state_before": "α✝ : Type ?u.661\nβ : Type ?u.664\nα : Type u_1\ninst✝¹ : UniformSpace α\ninst✝ : Group α\nh₁ : UniformContinuous fun p => p.fst * p.snd\nh₂ : UniformContinuous fun p => p⁻¹\n⊢ UniformContinuous fun p => p.fst / p.snd",
"tactic": "simpa only [div_eq_mul_inv]... | [
70,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean | mem_extChartAt_source | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_3\nE : Type u_2\nM : Type u_1\nH : Type u_4\nE' : Type ?u.184306\nM' : Type ?u.184309\nH' : Type ?u.184312\ninst✝¹⁰ : NontriviallyNormedField 𝕜\ninst✝⁹ : NormedAddCommGroup E\ninst✝⁸ : NormedSpace 𝕜 E\ninst✝⁷ : TopologicalSpace H\ninst✝⁶ : Topologi... | [
1050,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1049,
1
] |
Mathlib/Data/Fintype/Basic.lean | Fintype.univ_empty | [] | [
872,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
871,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean | CategoryTheory.Limits.biprod.hom_ext | [] | [
1425,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1423,
1
] |
Mathlib/LinearAlgebra/Ray.lean | sameRay_neg_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝⁴ : StrictOrderedCommRing R\nM : Type u_2\nN : Type ?u.141134\ninst✝³ : AddCommGroup M\ninst✝² : AddCommGroup N\ninst✝¹ : Module R M\ninst✝ : Module R N\nx y : M\n⊢ SameRay R (-x) (-y) ↔ SameRay R x y",
"tactic": "simp only [SameRay, neg_e... | [
399,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
398,
1
] |
Mathlib/Logic/Basic.lean | eq_equivalence | [] | [
514,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
513,
1
] |
Mathlib/Topology/Connected.lean | isPreconnected_iUnion | [] | [
139,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
137,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.