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/Analysis/InnerProductSpace/Orthogonal.lean | Submodule.sub_mem_orthogonal_of_inner_left | [
{
"state_after": "𝕜 : Type u_2\nE : Type u_1\nF : Type ?u.32170\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : NormedAddCommGroup E\ninst✝² : InnerProductSpace 𝕜 E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : InnerProductSpace 𝕜 F\nK : Submodule 𝕜 E\nx y : E\nh : ∀ (v : { x // x ∈ K }), inner x ↑v = inner y ↑v\n⊢ ∀ (u : E), u ∈ ... | [
96,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/LinearAlgebra/TensorAlgebra/Basic.lean | TensorAlgebra.induction | [
{
"state_after": "R : Type u_1\ninst✝² : CommSemiring R\nM : Type u_2\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\nC : TensorAlgebra R M → Prop\nh_grade0 : ∀ (r : R), C (↑(algebraMap R (TensorAlgebra R M)) r)\nh_grade1 : ∀ (x : M), C (↑(ι R) x)\nh_mul : ∀ (a b : TensorAlgebra R M), C a → C b → C (a * b)\nh_ad... | [
190,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | FiniteDimensional.fintype_card_le_finrank_of_linearIndependent | [
{
"state_after": "no goals",
"state_before": "K : Type u\nV : Type v\ninst✝⁶ : DivisionRing K\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module K V\nV₂ : Type v'\ninst✝³ : AddCommGroup V₂\ninst✝² : Module K V₂\ninst✝¹ : FiniteDimensional K V\nι : Type u_1\ninst✝ : Fintype ι\nb : ι → V\nh : LinearIndependent K b\n⊢ ... | [
286,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
1
] |
Mathlib/Data/Matrix/Basis.lean | Matrix.StdBasisMatrix.apply_same | [] | [
126,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/Topology/Order.lean | continuous_sSup_dom | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type ?u.39116\nf : α → β\nι : Sort ?u.39123\nT : Set (TopologicalSpace α)\nt₂ : TopologicalSpace β\n⊢ Continuous f ↔ ∀ (t : TopologicalSpace α), t ∈ T → Continuous f",
"tactic": "simp only [continuous_iff_le_induced, sSup_le_iff]"... | [
753,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
751,
1
] |
Mathlib/Analysis/Calculus/Deriv/Mul.lean | hasDerivAt_mul_const | [
{
"state_after": "no goals",
"state_before": "𝕜 : 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₂ : F... | [
215,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.pi_diff_pi_subset | [
{
"state_after": "α : Type u_1\nβ : Type ?u.287119\nγ : Type ?u.287122\nι : Sort ?u.287125\nι' : Sort ?u.287128\nι₂ : Sort ?u.287131\nκ : ι → Sort ?u.287136\nκ₁ : ι → Sort ?u.287141\nκ₂ : ι → Sort ?u.287146\nκ' : ι' → Sort ?u.287151\nπ : α → Type u_2\ni : Set α\ns t : (a : α) → Set (π a)\nx : (i : α) → π i\nhx ... | [
2033,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2028,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.left_mem_Ici | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.4607\ninst✝ : Preorder α\na a₁ a₂ b b₁ b₂ c x : α\n⊢ a ∈ Ici a",
"tactic": "simp"
}
] | [
203,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.iInf_sum | [
{
"state_after": "case h₁\nα : Type u_1\nβ : Type ?u.863516\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nι : Sort u_2\nf✝ g : ι → ℝ≥0∞\nf : ι → α → ℝ≥0∞\ninst✝ : Nonempty ι\nh : ∀ (t : Finset α) (i j : ι), ∃ k, ∀ (a : α), a ∈ t → f k a ≤ f i a ∧ f k a ≤ f j a\n⊢ (⨅ (i : ι), ∑ a in ∅, f i a) = ∑ a in ∅, ⨅ (i : ι), f i a\n\ncas... | [
2439,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2430,
1
] |
Mathlib/Data/Multiset/Antidiagonal.lean | Multiset.card_antidiagonal | [
{
"state_after": "α : Type u_1\nβ : Type ?u.25052\ns : Multiset α\nthis : ↑card (powerset s) = 2 ^ ↑card s\n⊢ ↑card (antidiagonal s) = 2 ^ ↑card s",
"state_before": "α : Type u_1\nβ : Type ?u.25052\ns : Multiset α\n⊢ ↑card (antidiagonal s) = 2 ^ ↑card s",
"tactic": "have := card_powerset s"
},
{
... | [
106,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | tsum_zero | [] | [
477,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
476,
1
] |
Std/Data/Array/Init/Lemmas.lean | Array.foldrM_push' | [
{
"state_after": "no goals",
"state_before": "m : Type u_1 → Type u_2\nα : Type u_3\nβ : Type u_1\ninst✝ : Monad m\nf : α → β → m β\ninit : β\narr : Array α\na : α\n⊢ foldrM f init (push arr a) (size arr + 1) = do\n let init ← f a init\n foldrM f init arr (size arr)",
"tactic": "simp [← foldrM_pus... | [
84,
23
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
82,
9
] |
Mathlib/Analysis/Complex/AbsMax.lean | Complex.norm_le_of_forall_mem_frontier_norm_le | [
{
"state_after": "E : Type u\ninst✝⁴ : NormedAddCommGroup E\ninst✝³ : NormedSpace ℂ E\nF : Type v\ninst✝² : NormedAddCommGroup F\ninst✝¹ : NormedSpace ℂ F\ninst✝ : Nontrivial E\nf : E → F\nU : Set E\nhU : Metric.Bounded U\nhd : DiffContOnCl ℂ f U\nC : ℝ\nhC : ∀ (z : E), z ∈ frontier U → ‖f z‖ ≤ C\nz : E\nhz : z... | [
409,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
390,
1
] |
Mathlib/LinearAlgebra/FiniteDimensional.lean | Subalgebra.eq_bot_of_finrank_one | [
{
"state_after": "K : Type u\nV : Type v\nF : Type u_1\nE : Type u_2\ninst✝² : Field F\ninst✝¹ : Ring E\ninst✝ : Algebra F E\nS : Subalgebra F E\nh : finrank F { x // x ∈ S } = 1\nthis : FiniteDimensional F { x // x ∈ S }\n⊢ Module.rank F { x // x ∈ S } ≤ 1",
"state_before": "K : Type u\nV : Type v\nF : Typ... | [
1404,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1400,
1
] |
Mathlib/Algebra/Lie/BaseChange.lean | LieAlgebra.ExtendScalars.bracket_lie_self | [
{
"state_after": "R : Type u\nA : Type w\nL : Type v\ninst✝⁴ : CommRing R\ninst✝³ : CommRing A\ninst✝² : Algebra R A\ninst✝¹ : LieRing L\ninst✝ : LieAlgebra R L\nx : A ⊗[R] L\n⊢ ↑(↑(LieAlgebra.ExtendScalars.bracket' R A L) x) x = 0",
"state_before": "R : Type u\nA : Type w\nL : Type v\ninst✝⁴ : CommRing R\n... | [
86,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
9
] |
Mathlib/Algebra/Order/Field/Power.lean | Nat.cast_le_pow_div_sub | [] | [
237,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
235,
1
] |
Mathlib/Analysis/Calculus/Deriv/Add.lean | derivWithin_const_add | [
{
"state_after": "no goals",
"state_before": "𝕜 : 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 : Filter �... | [
142,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/Data/Finset/Card.lean | Multiset.toFinset_card_le | [] | [
188,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/CategoryTheory/Sites/SheafOfTypes.lean | CategoryTheory.Presieve.isAmalgamation_restrict | [] | [
401,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
399,
1
] |
Mathlib/Tactic/Ring/Basic.lean | Mathlib.Tactic.Ring.neg_add | [
{
"state_after": "u : Lean.Level\nR✝ : Type ?u.213656\nα : Q(Type u)\nsα : Q(CommSemiring «$α»)\ninst✝¹ : CommSemiring R✝\nR : Type u_1\ninst✝ : Ring R\na₁ a₂ : R\n⊢ -(a₁ + a₂) = -a₁ + -a₂",
"state_before": "u : Lean.Level\nR✝ : Type ?u.213656\nα : Q(Type u)\nsα : Q(CommSemiring «$α»)\ninst✝¹ : CommSemiring... | [
556,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
555,
1
] |
Mathlib/Algebra/Group/OrderSynonym.lean | pow_toLex | [] | [
296,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/Logic/Basic.lean | not_and_not_right | [] | [
450,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
450,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.ncard_eq_succ | [
{
"state_after": "α : Type u_1\nβ : Type ?u.161808\ns t : Set α\na b x y : α\nf : α → β\nn : ℕ\nhs : autoParam (Set.Finite s) _auto✝\n⊢ (∃ a t, ¬a ∈ t ∧ insert a t = s ∧ ncard t = n) → ncard s = n + 1",
"state_before": "α : Type u_1\nβ : Type ?u.161808\ns t : Set α\na b x y : α\nf : α → β\nn : ℕ\nhs : autoP... | [
742,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
738,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | ContDiffWithinAt.mono_of_mem | [
{
"state_after": "𝕜 : 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\nX : Type uX\ninst✝¹ : NormedAdd... | [
488,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
484,
1
] |
Mathlib/MeasureTheory/Function/LpSpace.lean | MeasureTheory.Memℒp.of_comp_antilipschitzWith | [
{
"state_after": "α✝ : Type ?u.1311404\nE✝ : Type ?u.1311407\nF✝ : Type ?u.1311410\nG : Type ?u.1311413\nm m0 : MeasurableSpace α✝\np : ℝ≥0∞\nq : ℝ\nμ✝ ν : Measure α✝\ninst✝⁵ : NormedAddCommGroup E✝\ninst✝⁴ : NormedAddCommGroup F✝\ninst✝³ : NormedAddCommGroup G\ng✝ : E✝ → F✝\nc : ℝ≥0\nα : Type u_1\nE : Type u_2... | [
880,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
869,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsBigO.exists_pos | [] | [
209,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
207,
1
] |
Mathlib/Data/List/Sort.lean | List.length_split_le | [
{
"state_after": "case mk\nα : Type uu\nr : α → α → Prop\ninst✝ : DecidableRel r\na : α\nl l₁' l₂' : List α\nh : split (a :: l) = (l₁', l₂')\nl₁ l₂ : List α\ne : split l = (l₁, l₂)\n⊢ length l₁' ≤ length (a :: l) ∧ length l₂' ≤ length (a :: l)",
"state_before": "α : Type uu\nr : α → α → Prop\ninst✝ : Decida... | [
325,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
318,
1
] |
Mathlib/Algebra/Tropical/BigOperators.lean | Multiset.untrop_sum | [
{
"state_after": "case empty\nR : Type u_1\nS : Type ?u.37156\ninst✝¹ : LinearOrder R\ninst✝ : OrderTop R\n⊢ untrop (sum 0) = inf (map untrop 0)\n\ncase cons\nR : Type u_1\nS : Type ?u.37156\ninst✝¹ : LinearOrder R\ninst✝ : OrderTop R\ns : Tropical R\nx : Multiset (Tropical R)\nIH : untrop (sum x) = inf (map un... | [
121,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
116,
1
] |
Mathlib/Data/List/Basic.lean | List.foldr_hom₂ | [
{
"state_after": "ι : Type u_1\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\nl : List ι\nf : α → β → γ\nop₁ : ι → α → α\nop₂ : ι → β → β\nop₃ : ι → γ → γ\nb : β\nh : ∀ (a : α) (b : β) (i : ι), f (op₁ i a) (op₂ i b) = op₃ i (f a b)\n⊢ ∀ (a : α), foldr op₃ (f a b) l = f (foldr op₁ a l) (foldr o... | [
2504,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2500,
1
] |
Mathlib/Data/PEquiv.lean | PEquiv.inj | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nf : α ≃. β\na₁ a₂ : α\nb : β\nh₁ : a₁ ∈ ↑(PEquiv.symm f) b\nh₂ : a₂ ∈ ↑(PEquiv.symm f) b\n⊢ a₁ = a₂",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nf : α ≃. β\na₁ a₂ : α\nb : β\nh₁ : b ∈ ↑f a₁\nh₂ : b ∈ ↑f a₂\n⊢ a₁ = a₂",
... | [
178,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
177,
11
] |
Mathlib/Topology/SubsetProperties.lean | generalized_tube_lemma | [] | [
698,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
693,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | NNReal.nndist_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.237706\nι : Type ?u.237709\ninst✝ : PseudoMetricSpace α\na b x✝ : ℝ≥0\n⊢ nndist a b ≤ x✝ ↔ max (a - b) (b - a) ≤ x✝",
"tactic": "simp only [← NNReal.coe_le_coe, coe_nndist, dist_eq, max_le_iff, abs_sub_le_iff,\n tsub_le_i... | [
1688,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1685,
1
] |
Mathlib/Data/Set/Intervals/Monotone.lean | MonotoneOn.Ioo | [] | [
171,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
11
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.C_mul_X_pow_eq_monomial | [
{
"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 : MvPolynomial σ R\ns : σ\na : R\nn : ℕ\n⊢ ↑C a * X s ^ n = ↑(monomial (Finsupp.single s n)) a",... | [
336,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
334,
1
] |
Mathlib/Algebra/Quaternion.lean | QuaternionAlgebra.add_imI | [] | [
218,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
218,
9
] |
Mathlib/Algebra/GroupPower/Lemmas.lean | zpow_lt_zpow_iff' | [] | [
415,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
414,
1
] |
Mathlib/Data/Finset/Sigma.lean | Finset.not_mem_sigmaLift_of_ne_left | [
{
"state_after": "ι : Type u_2\nα : ι → Type u_3\nβ : ι → Type u_4\nγ : ι → Type u_1\ninst✝ : DecidableEq ι\nf : ⦃i : ι⦄ → α i → β i → Finset (γ i)\na : Sigma α\nb : Sigma β\nx : Sigma γ\nh : a.fst ≠ x.fst\n⊢ ¬∃ ha hb, x.snd ∈ f (ha ▸ a.snd) (hb ▸ b.snd)",
"state_before": "ι : Type u_2\nα : ι → Type u_3\nβ ... | [
158,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
155,
1
] |
Mathlib/Order/Filter/Ultrafilter.lean | Ultrafilter.ext | [] | [
102,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Mathlib/Order/JordanHolder.lean | CompositionSeries.coe_append | [] | [
517,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
515,
1
] |
Mathlib/LinearAlgebra/Finrank.lean | finrank_span_finset_eq_card | [
{
"state_after": "case h.e'_3.h.e'_2\nK : Type u\nV : Type v\ninst✝² : DivisionRing K\ninst✝¹ : AddCommGroup V\ninst✝ : Module K V\ns : Finset V\nhs : LinearIndependent K Subtype.val\n⊢ s = Set.toFinset ↑s",
"state_before": "K : Type u\nV : Type v\ninst✝² : DivisionRing K\ninst✝¹ : AddCommGroup V\ninst✝ : M... | [
352,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
348,
1
] |
Mathlib/Topology/FiberBundle/Basic.lean | FiberPrebundle.totalSpaceMk_preimage_source | [] | [
864,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
862,
1
] |
Mathlib/Order/RelIso/Basic.lean | RelEmbedding.isWellFounded | [] | [
404,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
403,
11
] |
Mathlib/Dynamics/Ergodic/Conservative.lean | MeasureTheory.Conservative.id | [] | [
77,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
11
] |
Mathlib/Logic/Relation.lean | Relation.flip_comp | [
{
"state_after": "case h.h\nα : Type u_1\nβ : Type u_3\nγ : Type u_2\nδ : Type ?u.12462\nr : α → β → Prop\np : β → γ → Prop\nq : γ → δ → Prop\nc : γ\na : α\n⊢ flip (r ∘r p) c a = (flip p ∘r flip r) c a",
"state_before": "α : Type u_1\nβ : Type u_3\nγ : Type u_2\nδ : Type ?u.12462\nr : α → β → Prop\np : β → ... | [
172,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/LinearAlgebra/Finsupp.lean | Finsupp.mem_supported_support | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nM : Type u_2\nN : Type ?u.60317\nP : Type ?u.60320\nR : Type u_3\nS : Type ?u.60326\ninst✝⁷ : Semiring R\ninst✝⁶ : Semiring S\ninst✝⁵ : AddCommMonoid M\ninst✝⁴ : Module R M\ninst✝³ : AddCommMonoid N\ninst✝² : Module R N\ninst✝¹ : AddCommMonoid P\ni... | [
210,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/Topology/Algebra/Monoid.lean | Submonoid.top_closure_mul_self_subset | [] | [
414,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
411,
1
] |
Mathlib/Algebra/Ring/Equiv.lean | RingEquiv.toMonoidHom_refl | [] | [
739,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
738,
1
] |
Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean | div_eq_one_iff_eq | [] | [
116,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Data/Set/Sigma.lean | Set.sigma_diff_sigma | [
{
"state_after": "no goals",
"state_before": "ι : Type u_1\nι' : Type ?u.32460\nα : ι → Type u_2\nβ : ι → Type ?u.32470\ns s₁ s₂ : Set ι\nt t₁ t₂ : (i : ι) → Set (α i)\nu : Set ((i : ι) × α i)\nx✝ : (i : ι) × α i\ni j : ι\na : α i\nx : (i : ι) × α i\n⊢ x ∈ Set.Sigma s₁ t₁ \\ Set.Sigma s₂ t₂ ↔ x ∈ Set.Sigma ... | [
253,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
251,
1
] |
Mathlib/Analysis/Calculus/FDerivMeasurable.lean | aemeasurable_deriv | [] | [
445,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
443,
1
] |
Mathlib/Logic/Function/Basic.lean | Function.uncurry_apply_pair | [] | [
808,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
807,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Metric.hausdorffDist_le_diam | [
{
"state_after": "case intro\nι : Sort ?u.77842\nα : Type u\nβ : Type v\ninst✝¹ : PseudoMetricSpace α\ninst✝ : PseudoMetricSpace β\ns t u : Set α\nx✝ y : α\nΦ : α → β\nbs : Bounded s\nht : Set.Nonempty t\nbt : Bounded t\nx : α\nxs : x ∈ s\n⊢ hausdorffDist s t ≤ diam (s ∪ t)",
"state_before": "ι : Sort ?u.77... | [
791,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
781,
1
] |
Mathlib/Algebra/Lie/CartanMatrix.lean | CartanMatrix.Relations.adF_of_eq_eq_zero | [
{
"state_after": "R : Type u\nB : Type v\ninst✝² : CommRing R\ninst✝¹ : DecidableEq B\ninst✝ : Fintype B\nA : Matrix B B ℤ\ni : B\nh : A i i = 2\nh' : Int.toNat (-2) = 0\n⊢ adF R A (i, i) = 0",
"state_before": "R : Type u\nB : Type v\ninst✝² : CommRing R\ninst✝¹ : DecidableEq B\ninst✝ : Fintype B\nA : Matri... | [
164,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
9
] |
Mathlib/Order/CompleteLattice.lean | Monotone.map_iInf_le | [] | [
1011,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1009,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Linear.lean | ContinuousLinearMap.differentiableOn | [] | [
107,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
106,
11
] |
Mathlib/Analysis/InnerProductSpace/GramSchmidtOrtho.lean | gramSchmidt_triangular | [
{
"state_after": "𝕜 : Type u_2\nE : Type u_3\ninst✝⁵ : IsROrC 𝕜\ninst✝⁴ : NormedAddCommGroup E\ninst✝³ : InnerProductSpace 𝕜 E\nι : Type u_1\ninst✝² : LinearOrder ι\ninst✝¹ : LocallyFiniteOrderBot ι\ninst✝ : IsWellOrder ι fun x x_1 => x < x_1\ni j : ι\nhij : i < j\nb : Basis ι 𝕜 E\nthis : gramSchmidt 𝕜 (↑b... | [
245,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
238,
1
] |
Mathlib/Order/Filter/Pointwise.lean | Filter.bot_mul | [] | [
312,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
311,
1
] |
Mathlib/RingTheory/ClassGroup.lean | ClassGroup.mk0_eq_mk0_iff | [
{
"state_after": "case refine_1\nR : Type u_1\nK : Type ?u.1434681\nL : Type ?u.1434684\ninst✝¹¹ : CommRing R\ninst✝¹⁰ : Field K\ninst✝⁹ : Field L\ninst✝⁸ : DecidableEq L\ninst✝⁷ : Algebra R K\ninst✝⁶ : IsFractionRing R K\ninst✝⁵ : Algebra K L\ninst✝⁴ : FiniteDimensional K L\ninst✝³ : Algebra R L\ninst✝² : IsSc... | [
315,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
298,
1
] |
Mathlib/Data/Polynomial/Laurent.lean | LaurentPolynomial.isUnit_T | [] | [
272,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
271,
1
] |
Mathlib/Data/Set/Basic.lean | Set.diff_self | [] | [
2066,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2065,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.restrict_finset_biUnion_congr | [
{
"state_after": "case empty\nα : Type u_2\nβ : Type ?u.310858\nγ : Type ?u.310861\nδ : Type ?u.310864\nι : Type u_1\nR : Type ?u.310870\nR' : Type ?u.310873\nm0 : MeasurableSpace α\ninst✝¹ : MeasurableSpace β\ninst✝ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns s' t✝ : Set α\nt : ι → Set α\n⊢ restr... | [
1844,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1839,
1
] |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | le_csSup_of_le | [] | [
459,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
458,
1
] |
Mathlib/Algebra/Order/Monoid/Lemmas.lean | le_of_le_mul_of_le_one_left | [] | [
1078,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1075,
1
] |
Mathlib/Combinatorics/SetFamily/HarrisKleitman.lean | IsUpperSet.card_inter_le_finset | [
{
"state_after": "α : Type u_1\ninst✝¹ : DecidableEq α\n𝒜 ℬ : Finset (Finset α)\ns : Finset α\na : α\ninst✝ : Fintype α\nh𝒜✝ : IsLowerSet (↑𝒜ᶜ)\nh𝒜 : IsLowerSet ↑(𝒜ᶜ)\nhℬ : IsLowerSet ↑ℬ\n⊢ 2 ^ Fintype.card α * card (𝒜 ∩ ℬ) ≤ card 𝒜 * card ℬ",
"state_before": "α : Type u_1\ninst✝¹ : DecidableEq α\n𝒜... | [
113,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
106,
1
] |
Mathlib/GroupTheory/Subsemigroup/Operations.lean | Subsemigroup.map_comap_le | [] | [
300,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
299,
1
] |
Mathlib/Combinatorics/SimpleGraph/Finsubgraph.lean | SimpleGraph.singletonFinsubgraph_le_adj_left | [
{
"state_after": "no goals",
"state_before": "V : Type u\nW : Type v\nG : SimpleGraph V\nF : SimpleGraph W\nu v : V\ne : Adj G u v\n⊢ singletonFinsubgraph u ≤ finsubgraphOfAdj e",
"tactic": "simp [singletonFinsubgraph, finsubgraphOfAdj]"
}
] | [
98,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
1
] |
Mathlib/CategoryTheory/Localization/Predicate.lean | CategoryTheory.Localization.liftNatTrans_id | [
{
"state_after": "C : Type u_3\nD : Type u_6\ninst✝³ : Category C\ninst✝² : Category D\nL : C ⥤ D\nW : MorphismProperty C\nE : Type u_4\ninst✝¹ : Category E\ninst✝ : Functor.IsLocalization L W\nF : C ⥤ E\nF' : D ⥤ E\nh : Lifting L W F F'\nX : C\n⊢ 𝟙 ((L ⋙ F').obj X) = 𝟙 (F'.obj (L.obj X))",
"state_before"... | [
366,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
362,
1
] |
Mathlib/Algebra/ContinuedFractions/Computation/Translations.lean | GeneralizedContinuedFraction.of_s_succ | [
{
"state_after": "case inl\nK : Type u_1\ninst✝¹ : LinearOrderedField K\ninst✝ : FloorRing K\nv : K\nn✝ n : ℕ\nh : fract v = 0\n⊢ Stream'.Seq.get? (of v).s (n + 1) = Stream'.Seq.get? (of (fract v)⁻¹).s n\n\ncase inr\nK : Type u_1\ninst✝¹ : LinearOrderedField K\ninst✝ : FloorRing K\nv : K\nn✝ n : ℕ\nh : fract v ... | [
314,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Std/Data/Int/Lemmas.lean | Int.sub_le_self | [
{
"state_after": "no goals",
"state_before": "a b : Int\nh : 0 ≤ b\n⊢ a + 0 = a",
"tactic": "rw [Int.add_zero]"
}
] | [
1139,
38
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1136,
11
] |
Mathlib/Order/BoundedOrder.lean | monotone_or | [] | [
562,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
560,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.beth_limit | [] | [
427,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
426,
1
] |
Mathlib/FieldTheory/Laurent.lean | RatFunc.laurent_at_zero | [
{
"state_after": "case f\nR : Type u\ninst✝ : CommRing R\nhdomain : IsDomain R\nr s : R\np q : R[X]\nf : RatFunc R\np✝ q✝ : R[X]\nhq✝ : q✝ ≠ 0\n⊢ ↑(laurent 0) (↑(algebraMap R[X] (RatFunc R)) p✝ / ↑(algebraMap R[X] (RatFunc R)) q✝) =\n ↑(algebraMap R[X] (RatFunc R)) p✝ / ↑(algebraMap R[X] (RatFunc R)) q✝",
... | [
112,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
1
] |
Mathlib/Order/CompleteLattice.lean | iInf_plift_up | [] | [
728,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
727,
1
] |
Mathlib/Order/Hom/CompleteLattice.lean | sInfHom.symm_dual_id | [] | [
854,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
853,
1
] |
Mathlib/Algebra/Periodic.lean | List.periodic_prod | [
{
"state_after": "case nil\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.34343\nf g : α → β\nc c₁ c₂ x : α\ninst✝¹ : Add α\ninst✝ : Monoid β\nl : List (α → β)\nhl✝ : ∀ (f : α → β), f ∈ l → Periodic f c\nhl : ∀ (f : α → β), f ∈ [] → Periodic f c\n⊢ Periodic (List.prod []) c\n\ncase cons\nα : Type u_1\nβ : Type u_2\nγ... | [
87,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
1
] |
Mathlib/Data/MvPolynomial/Supported.lean | MvPolynomial.supportedEquivMvPolynomial_symm_X | [
{
"state_after": "no goals",
"state_before": "σ : Type u_1\nτ : Type ?u.86982\nR : Type u\nS : Type v\nr : R\ne : ℕ\nn m : σ\ninst✝ : CommSemiring R\np q : MvPolynomial σ R\ns : Set σ\ni : ↑s\n⊢ ↑(↑(AlgEquiv.symm (supportedEquivMvPolynomial s)) (X i)) = X ↑i",
"tactic": "simp [supportedEquivMvPolynomial... | [
72,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/Init/Logic.lean | iff_true_iff | [] | [
193,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Data/Complex/Basic.lean | Complex.inv_im | [
{
"state_after": "no goals",
"state_before": "z : ℂ\n⊢ z⁻¹.im = -z.im / ↑normSq z",
"tactic": "simp [inv_def, division_def, ofReal']"
}
] | [
743,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
743,
1
] |
Mathlib/Algebra/Divisibility/Basic.lean | dvd_iff_exists_eq_mul_left | [
{
"state_after": "case intro\nα : Type u_1\ninst✝ : CommSemigroup α\na c✝ c : α\n⊢ a ∣ c * a",
"state_before": "α : Type u_1\ninst✝ : CommSemigroup α\na b c : α\n⊢ (∃ c, b = c * a) → a ∣ b",
"tactic": "rintro ⟨c, rfl⟩"
},
{
"state_after": "no goals",
"state_before": "case intro\nα : Type u_1... | [
159,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.coprime_of_dvd' | [] | [
533,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
532,
1
] |
Mathlib/Control/LawfulFix.lean | Pi.continuous_curry | [
{
"state_after": "case h.h\nα : Type u_1\nβ : α → Type u_2\nγ : (a : α) → β a → Type u_3\ninst✝ : (x : α) → (y : β x) → OmegaCompletePartialOrder (γ x y)\nc : Chain ((x : (a : α) × β a) → γ x.fst x.snd)\nx : α\ny : β x\n⊢ ↑(monotoneCurry α β γ) (ωSup c) x y = ωSup (Chain.map c (monotoneCurry α β γ)) x y",
"... | [
255,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
251,
1
] |
Mathlib/LinearAlgebra/Trace.lean | LinearMap.trace_transpose' | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝⁹ : CommRing R\nM : Type u_2\ninst✝⁸ : AddCommGroup M\ninst✝⁷ : Module R M\nN : Type ?u.575799\ninst✝⁶ : AddCommGroup N\ninst✝⁵ : Module R N\nι : Type ?u.576341\ninst✝⁴ : Module.Free R M\ninst✝³ : Module.Finite R M\ninst✝² : Module.Free R N\ni... | [
269,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
267,
1
] |
Mathlib/Data/Set/Basic.lean | Set.union_left_comm | [] | [
791,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
790,
1
] |
Std/Logic.lean | Not.imp | [] | [
20,
69
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
20,
1
] |
Mathlib/Analysis/Normed/Group/Quotient.lean | image_norm_nonempty | [] | [
131,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
129,
1
] |
Mathlib/Topology/Algebra/UniformGroup.lean | totallyBounded_iff_subset_finite_iUnion_nhds_one | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.337374\ninst✝² : UniformSpace α\ninst✝¹ : Group α\ninst✝ : UniformGroup α\ns : Set α\n⊢ (∀ (i : Set α),\n i ∈ 𝓝 1 → ∃ t, Set.Finite t ∧ s ⊆ ⋃ (y : α) (_ : y ∈ t), {x | (x, y) ∈ {x | x.snd⁻¹ * x.fst ∈ id i}}) ↔\n ∀ (U : Set α), ... | [
471,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
468,
1
] |
Mathlib/NumberTheory/LegendreSymbol/ZModChar.lean | ZMod.χ₄_nat_three_mod_four | [
{
"state_after": "n : ℕ\nhn : n % 4 = 3\n⊢ ↑χ₄ ↑3 = -1",
"state_before": "n : ℕ\nhn : n % 4 = 3\n⊢ ↑χ₄ ↑n = -1",
"tactic": "rw [χ₄_nat_mod_four, hn]"
},
{
"state_after": "no goals",
"state_before": "n : ℕ\nhn : n % 4 = 3\n⊢ ↑χ₄ ↑3 = -1",
"tactic": "rfl"
}
] | [
106,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | contDiffOn_pi | [] | [
1157,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1155,
1
] |
Mathlib/Computability/Partrec.lean | Computable.vector_ofFn | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.209886\nγ : Type ?u.209889\nσ : Type u_2\ninst✝³ : Primcodable α\ninst✝² : Primcodable β\ninst✝¹ : Primcodable γ\ninst✝ : Primcodable σ\nn : ℕ\nf : Fin n → α → σ\nhf : ∀ (i : Fin n), Computable (f i)\na : α\n⊢ (Vector.mOfFn fun i => ↑(f... | [
755,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
753,
1
] |
Mathlib/Order/Bounds/Basic.lean | BddBelow.exists_le | [] | [
501,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
499,
1
] |
Mathlib/LinearAlgebra/Determinant.lean | LinearMap.det_toMatrix_eq_det_toMatrix | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.43313\ninst✝¹⁰ : CommRing R\nM : Type u_4\ninst✝⁹ : AddCommGroup M\ninst✝⁸ : Module R M\nM' : Type ?u.43904\ninst✝⁷ : AddCommGroup M'\ninst✝⁶ : Module R M'\nι : Type u_2\ninst✝⁵ : DecidableEq ι\ninst✝⁴ : Fintype ι\ne : Basis ι R M\nA : Type u_3\ninst... | [
125,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
121,
1
] |
Mathlib/LinearAlgebra/Finsupp.lean | Finsupp.total_option | [
{
"state_after": "α : Type u_1\nM : Type u_3\nN : Type ?u.394504\nP : Type ?u.394507\nR : Type u_2\nS : Type ?u.394513\ninst✝¹² : Semiring R\ninst✝¹¹ : Semiring S\ninst✝¹⁰ : AddCommMonoid M\ninst✝⁹ : Module R M\ninst✝⁸ : AddCommMonoid N\ninst✝⁷ : Module R N\ninst✝⁶ : AddCommMonoid P\ninst✝⁵ : Module R P\nα' : T... | [
702,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
699,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.mem_singleton_mul | [
{
"state_after": "case mp\nR : Type u_1\ninst✝⁶ : CommRing R\nS : Submonoid R\nP : Type u_2\ninst✝⁵ : CommRing P\ninst✝⁴ : Algebra R P\nloc : IsLocalization S P\nR₁ : Type ?u.1449884\ninst✝³ : CommRing R₁\nK : Type ?u.1449890\ninst✝² : Field K\ninst✝¹ : Algebra R₁ K\ninst✝ : IsFractionRing R₁ K\nx y : P\nI : Fr... | [
1430,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1418,
1
] |
Mathlib/Data/Fintype/Basic.lean | Finset.sdiff_eq_inter_compl | [] | [
162,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean | AffineEquiv.pointReflection_apply | [] | [
562,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
561,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.sdiff_idem | [] | [
2154,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2153,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Continuity.lean | Filter.Tendsto.rpow_const | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nl : Filter α\nf : α → ℝ\nx p : ℝ\nhf : Tendsto f l (𝓝 x)\nh : x ≠ 0 ∨ 0 ≤ p\nh0 : 0 = p\n⊢ Tendsto (fun a => f a ^ 0) l (𝓝 (x ^ 0))",
"tactic": "simp [tendsto_const_nhds]"
}
] | [
285,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/CategoryTheory/Monoidal/Rigid/Basic.lean | CategoryTheory.tensorLeftHomEquiv_symm_coevaluation_comp_id_tensor | [
{
"state_after": "C : Type u₁\ninst✝² : Category C\ninst✝¹ : MonoidalCategory C\nY Y' Z : C\ninst✝ : ExactPairing Y Y'\nf : Y' ⟶ Z\n⊢ (𝟙 Y' ⊗ η_ Y Y' ≫ (𝟙 Y ⊗ f)) ≫ (α_ Y' Y Z).inv ≫ (ε_ Y Y' ⊗ 𝟙 Z) ≫ (λ_ Z).hom = (ρ_ Y').hom ≫ f",
"state_before": "C : Type u₁\ninst✝² : Category C\ninst✝¹ : MonoidalCateg... | [
478,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
471,
1
] |
Mathlib/Algebra/Quaternion.lean | QuaternionAlgebra.coe_linearEquivTuple_symm | [] | [
551,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
550,
1
] |
Mathlib/Data/Set/Basic.lean | Set.exists_of_ssubset | [] | [
404,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
403,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.