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 |
|---|---|---|---|---|---|---|
src/lean/Init/Data/Option/Basic.lean | Option.map_id | [] | [
44,
63
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
43,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/RightAngle.lean | EuclideanGeometry.angle_le_pi_div_two_of_angle_eq_pi_div_two | [
{
"state_after": "V : Type u_1\nP : Type u_2\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerProductSpace ℝ V\ninst✝¹ : MetricSpace P\ninst✝ : NormedAddTorsor V P\np₁ p₂ p₃ : P\nh : inner (p₂ -ᵥ p₃) (p₁ -ᵥ p₂) = 0\n⊢ ∠ p₂ p₃ p₁ ≤ π / 2",
"state_before": "V : Type u_1\nP : Type u_2\ninst✝³ : NormedAddCommGroup... | [
420,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
415,
1
] |
Mathlib/Algebra/Tropical/BigOperators.lean | untrop_prod | [
{
"state_after": "case h.e'_3\nR : Type u_1\nS : Type u_2\ninst✝ : AddCommMonoid R\ns : Finset S\nf : S → Tropical R\n⊢ ∑ i in s, untrop (f i) = Multiset.sum (Multiset.map untrop (Multiset.map f s.val))",
"state_before": "R : Type u_1\nS : Type u_2\ninst✝ : AddCommMonoid R\ns : Finset S\nf : S → Tropical R\... | [
79,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | contDiff_iff_contDiffAt | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\... | [
1418,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1417,
1
] |
Mathlib/Analysis/NormedSpace/Star/Multiplier.lean | DoubleCentralizer.coe_eq_algebraMap | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\nA : Type ?u.864686\ninst✝⁴ : NontriviallyNormedField 𝕜\ninst✝³ : NonUnitalNormedRing A\ninst✝² : NormedSpace 𝕜 A\ninst✝¹ : SMulCommClass 𝕜 A A\ninst✝ : IsScalarTower 𝕜 A A\n⊢ ↑𝕜 = ↑(algebraMap 𝕜 𝓜(𝕜, 𝕜))",
"tactic": "ext <;>\nsimp onl... | [
513,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
509,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | IsLUB.mul_right | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.191131\nα : Type u_1\nβ : Type ?u.191137\ninst✝ : LinearOrderedField α\na b c d : α\nn : ℤ\ns : Set α\nha : 0 ≤ a\nhs : IsLUB s b\n⊢ IsLUB ((fun b => b * a) '' s) (b * a)",
"tactic": "simpa [mul_comm] using hs.mul_left ha"
}
] | [
949,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
948,
1
] |
Mathlib/RingTheory/AlgebraicIndependent.lean | AlgebraicIndependent.algebraMap_injective | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.101051\nι' : Type ?u.101054\nR : Type u_1\nK : Type ?u.101060\nA : Type u_2\nA' : Type ?u.101066\nA'' : Type ?u.101069\nV : Type u\nV' : Type ?u.101074\nx : ι → A\ninst✝⁶ : CommRing R\ninst✝⁵ : CommRing A\ninst✝⁴ : CommRing A'\ninst✝³ : CommRing A''\... | [
113,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/NumberTheory/FermatPsp.lean | FermatPsp.exists_infinite_pseudoprimes | [
{
"state_after": "case pos\nb : ℕ\nh : 1 ≤ b\nm : ℕ\nb_ge_two : 2 ≤ b\n⊢ ∃ n, FermatPsp n b ∧ m ≤ n\n\ncase neg\nb : ℕ\nh : 1 ≤ b\nm : ℕ\nb_ge_two : ¬2 ≤ b\n⊢ ∃ n, FermatPsp n b ∧ m ≤ n",
"state_before": "b : ℕ\nh : 1 ≤ b\nm : ℕ\n⊢ ∃ n, FermatPsp n b ∧ m ≤ n",
"tactic": "by_cases b_ge_two : 2 ≤ b"
},
... | [
387,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
354,
1
] |
Mathlib/Analysis/Normed/Field/Basic.lean | nndist_inv_inv₀ | [
{
"state_after": "α : Type u_1\nβ : Type ?u.270994\nγ : Type ?u.270997\nι : Type ?u.271000\ninst✝ : NormedDivisionRing α\nz w : α\nhz : z ≠ 0\nhw : w ≠ 0\n⊢ ↑(nndist z⁻¹ w⁻¹) = ↑(nndist z w / (‖z‖₊ * ‖w‖₊))",
"state_before": "α : Type u_1\nβ : Type ?u.270994\nγ : Type ?u.270997\nι : Type ?u.271000\ninst✝ : ... | [
603,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
600,
1
] |
Mathlib/Algebra/Parity.lean | Even.neg_pow | [
{
"state_after": "case intro\nF : Type ?u.20712\nα : Type u_1\nβ : Type ?u.20718\nR : Type ?u.20721\ninst✝¹ : Monoid α\na✝ : α\ninst✝ : HasDistribNeg α\nc : ℕ\na : α\n⊢ (-a) ^ (c + c) = a ^ (c + c)",
"state_before": "F : Type ?u.20712\nα : Type u_1\nβ : Type ?u.20718\nR : Type ?u.20721\ninst✝¹ : Monoid α\nn... | [
137,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
135,
1
] |
Mathlib/Analysis/SpecialFunctions/Pow/Complex.lean | Complex.cpow_nat_inv_pow | [
{
"state_after": "x : ℂ\nn : ℕ\nhn : n ≠ 0\n⊢ (log x * (↑n)⁻¹).im ∈ Set.Ioc (-π) π",
"state_before": "x : ℂ\nn : ℕ\nhn : n ≠ 0\n⊢ (x ^ (↑n)⁻¹) ^ n = x",
"tactic": "suffices im (log x * (n⁻¹ : ℂ)) ∈ Ioc (-π) π by\n rw [← cpow_nat_cast, ← cpow_mul _ this.1 this.2, inv_mul_cancel, cpow_one]\n exact_mod_c... | [
163,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean | MeasureTheory.Measure.add_haar_ball | [
{
"state_after": "no goals",
"state_before": "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.1985564\ninst✝³ : NormedAddCommGroup F\ninst✝² : Nor... | [
438,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
436,
1
] |
Mathlib/Data/Polynomial/Eval.lean | Polynomial.mapRingHom_id | [] | [
897,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
896,
1
] |
Mathlib/LinearAlgebra/Basic.lean | LinearEquiv.conj_apply_apply | [] | [
2375,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2373,
1
] |
Mathlib/LinearAlgebra/Matrix/ToLin.lean | Algebra.smul_leftMulMatrix_algebraMap_ne | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nS : Type u_5\nT : Type u_3\ninst✝¹⁰ : CommRing R\ninst✝⁹ : CommRing S\ninst✝⁸ : Ring T\ninst✝⁷ : Algebra R S\ninst✝⁶ : Algebra S T\ninst✝⁵ : Algebra R T\ninst✝⁴ : IsScalarTower R S T\nm : Type u_4\nn : Type u_1\ninst✝³ : Fintype m\ninst✝² : Fintype... | [
949,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
947,
1
] |
Mathlib/Logic/Equiv/Option.lean | Equiv.removeNone_some | [] | [
138,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
136,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.max_empty | [] | [
1166,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1165,
1
] |
Mathlib/Order/Hom/Basic.lean | OrderIso.refl_apply | [] | [
843,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
842,
1
] |
Mathlib/Analysis/Convex/Extreme.lean | isExtreme_iInter | [
{
"state_after": "𝕜 : Type u_3\nE : Type u_2\nF✝ : Type ?u.2902\nι✝ : Type ?u.2905\nπ : ι✝ → Type ?u.2910\ninst✝³ : OrderedSemiring 𝕜\ninst✝² : AddCommMonoid E\ninst✝¹ : SMul 𝕜 E\nA B C : Set E\nx : E\nι : Sort u_1\ninst✝ : Nonempty ι\nF : ι → Set E\nhAF : ∀ (i : ι), IsExtreme 𝕜 A (F i)\ni : ι\n⊢ IsExtreme ... | [
119,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Mathlib/Probability/Independence/Basic.lean | ProbabilityTheory.IndepFun.symm | [] | [
710,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
709,
8
] |
Mathlib/Data/Matrix/Notation.lean | Matrix.head_transpose | [] | [
214,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
212,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.power_self_eq | [
{
"state_after": "c : Cardinal\nh : ℵ₀ ≤ c\n⊢ 2 ^ c ≤ c ^ c\n\nc : Cardinal\nh : ℵ₀ ≤ c\n⊢ (2 ^ c) ^ c ≤ 2 ^ c",
"state_before": "c : Cardinal\nh : ℵ₀ ≤ c\n⊢ c ^ c = 2 ^ c",
"tactic": "apply ((power_le_power_right <| (cantor c).le).trans _).antisymm"
},
{
"state_after": "no goals",
"state_be... | [
932,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
929,
1
] |
Mathlib/Algebra/BigOperators/Finsupp.lean | Nat.prod_pow_pos_of_zero_not_mem_support | [
{
"state_after": "α : Type ?u.637459\nι : Type ?u.637462\nγ : Type ?u.637465\nA : Type ?u.637468\nB : Type ?u.637471\nC : Type ?u.637474\ninst✝² : AddCommMonoid A\ninst✝¹ : AddCommMonoid B\ninst✝ : AddCommMonoid C\nt : ι → A → C\nh0 : ∀ (i : ι), t i 0 = 0\nh1 : ∀ (i : ι) (x y : A), t i (x + y) = t i x + t i y\n... | [
664,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
662,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean | CategoryTheory.Limits.eq_of_epi_fork_ι | [] | [
882,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
881,
1
] |
Mathlib/Algebra/Hom/Equiv/Basic.lean | MulEquiv.mk_coe | [] | [
493,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
492,
1
] |
Mathlib/NumberTheory/ArithmeticFunction.lean | Nat.ArithmeticFunction.coe_mk | [] | [
94,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/GroupTheory/Subsemigroup/Basic.lean | Subsemigroup.mem_closure | [] | [
307,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
306,
1
] |
Mathlib/Analysis/NormedSpace/lpSpace.lean | lp.uniformContinuous_coe | [
{
"state_after": "α : Type u_1\nE : α → Type u_2\np q : ℝ≥0∞\ninst✝ : (i : α) → NormedAddCommGroup (E i)\n_i : Fact (1 ≤ p)\nhp : p ≠ 0\n⊢ UniformContinuous Subtype.val",
"state_before": "α : Type u_1\nE : α → Type u_2\np q : ℝ≥0∞\ninst✝ : (i : α) → NormedAddCommGroup (E i)\n_i : Fact (1 ≤ p)\n⊢ UniformCont... | [
1125,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1114,
1
] |
Mathlib/Order/GameAdd.lean | Prod.gameAdd_iff | [
{
"state_after": "case mp\nα : Type u_1\nβ : Type u_2\nrα✝ : α → α → Prop\nrβ✝ : β → β → Prop\nrα : α → α → Prop\nrβ : β → β → Prop\nx y : α × β\n⊢ GameAdd rα rβ x y → rα x.fst y.fst ∧ x.snd = y.snd ∨ rβ x.snd y.snd ∧ x.fst = y.fst\n\ncase mpr\nα : Type u_1\nβ : Type u_2\nrα✝ : α → α → Prop\nrβ✝ : β → β → Prop\... | [
68,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
61,
1
] |
Mathlib/Data/PNat/Defs.lean | PNat.toPNat'_coe | [] | [
168,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
167,
1
] |
Mathlib/Algebra/Lie/Abelian.lean | Function.Injective.isLieAbelian | [] | [
68,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
61,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.sup_eq_lsub_iff_lt_sup | [
{
"state_after": "α : Type ?u.326038\nβ : Type ?u.326041\nγ : Type ?u.326044\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nι : Type u\nf : ι → Ordinal\nh : sup f = lsub f\ni : ι\n⊢ f i < lsub f",
"state_before": "α : Type ?u.326038\nβ : Type ?u.326041\nγ : Type ?u.326044\nr : α → α → Prop\ns : β → ... | [
1659,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1655,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.liftRel_cons | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nR : α → β → Prop\na : α\nb : β\ns : WSeq α\nt : WSeq β\n⊢ Computation.LiftRel (LiftRelO R (LiftRel R)) (destruct (cons a s)) (destruct (cons b t)) ↔ R a b ∧ LiftRel R s t",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nR : α → β → Prop\na : α\nb :... | [
1103,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1099,
1
] |
Mathlib/Order/Disjoint.lean | codisjoint_toDual_iff | [] | [
429,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
427,
1
] |
Std/Classes/LawfulMonad.lean | SatisfiesM_StateT_eq | [
{
"state_after": "case refine_1\nm : Type u_1 → Type u_2\nα ρ : Type u_1\np : α → Prop\nx : StateT ρ m α\ninst✝¹ : Monad m\ninst✝ : LawfulMonad m\nx✝ : SatisfiesM p x\nf : StateT ρ m { a // p a }\neq : Subtype.val <$> f = x\n⊢ ∃ f_1, ∀ (x : ρ), Subtype.val <$> f_1 x = (Subtype.val <$> f) x\n\ncase refine_2\nm :... | [
208,
51
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
202,
9
] |
Mathlib/Data/DList/Basic.lean | Std.DList.toList_ofList | [
{
"state_after": "case nil\nα : Type u_1\n⊢ toList (ofList []) = []\n\ncase cons\nα : Type u_1\nhead✝ : α\ntail✝ : List α\n⊢ toList (ofList (head✝ :: tail✝)) = head✝ :: tail✝",
"state_before": "α : Type u_1\nl : List α\n⊢ toList (ofList l) = l",
"tactic": "cases l"
},
{
"state_after": "case cons... | [
56,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.map_span | [] | [
102,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/Algebra/GroupPower/Ring.lean | Ring.inverse_pow | [
{
"state_after": "no goals",
"state_before": "R : Type ?u.52055\nS : Type ?u.52058\nM : Type u_1\ninst✝ : MonoidWithZero M\nr : M\n⊢ inverse r ^ 0 = inverse (r ^ 0)",
"tactic": "rw [pow_zero, pow_zero, Ring.inverse_one]"
},
{
"state_after": "no goals",
"state_before": "R : Type ?u.52055\nS :... | [
112,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
108,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Equiv.lean | ContinuousLinearEquiv.comp_differentiable_iff | [
{
"state_after": "𝕜 : 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 𝕜 G\nG' : Type ?u.76970\ninst✝¹... | [
120,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Mathlib/Algebra/GeomSum.lean | geom₂_sum | [] | [
263,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
1
] |
Mathlib/LinearAlgebra/Quotient.lean | Submodule.map_mkQ_eq_top | [
{
"state_after": "no goals",
"state_before": "R : Type u_2\nM : Type u_1\nr : R\nx y : M\ninst✝⁵ : Ring R\ninst✝⁴ : AddCommGroup M\ninst✝³ : Module R M\np p' : Submodule R M\nR₂ : Type ?u.242912\nM₂ : Type ?u.242915\ninst✝² : Ring R₂\ninst✝¹ : AddCommGroup M₂\ninst✝ : Module R₂ M₂\nτ₁₂ : R →+* R₂\n⊢ map (mk... | [
401,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
398,
1
] |
Mathlib/GroupTheory/Submonoid/Operations.lean | Submonoid.coe_comap | [] | [
194,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | AffineSubspace.inter_eq_singleton_of_nonempty_of_isCompl | [
{
"state_after": "case intro\nk : Type u_1\nV : Type u_2\nP : Type u_3\ninst✝² : Ring k\ninst✝¹ : AddCommGroup V\ninst✝ : Module k V\nS : AffineSpace V P\np₁ p₂ : P\ns1 s2 : AffineSubspace k P\nh1 : Set.Nonempty ↑s1\nh2 : Set.Nonempty ↑s2\nhd : IsCompl (direction s1) (direction s2)\np : P\nhp : p ∈ ↑s1 ∩ ↑s2\n⊢... | [
1002,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
990,
1
] |
Mathlib/CategoryTheory/Adjunction/Opposites.lean | CategoryTheory.Adjunction.rightAdjointUniq_hom_counit | [
{
"state_after": "case w.h\nC : Type u₁\ninst✝¹ : Category C\nD : Type u₂\ninst✝ : Category D\nF : C ⥤ D\nG G' : D ⥤ C\nadj1 : F ⊣ G\nadj2 : F ⊣ G'\nx✝ : D\n⊢ (whiskerRight (rightAdjointUniq adj1 adj2).hom F ≫ adj2.counit).app x✝ = adj1.counit.app x✝",
"state_before": "C : Type u₁\ninst✝¹ : Category C\nD : ... | [
285,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.mul_sup_eq_of_coprime_left | [
{
"state_after": "R : Type u\nι : Type ?u.272678\ninst✝ : CommSemiring R\nI J K L : Ideal R\nh : J ⊔ I = ⊤\n⊢ I * K ⊔ J = K ⊔ J",
"state_before": "R : Type u\nι : Type ?u.272678\ninst✝ : CommSemiring R\nI J K L : Ideal R\nh : I ⊔ J = ⊤\n⊢ I * K ⊔ J = K ⊔ J",
"tactic": "rw [sup_comm] at h"
},
{
"... | [
695,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
693,
1
] |
Mathlib/Data/Set/Basic.lean | Monotone.inter | [] | [
2889,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2887,
1
] |
Mathlib/Data/Set/Function.lean | Set.restrict_eq_restrict_iff | [] | [
193,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean | PrimeSpectrum.basicOpen_zero | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\ninst✝¹ : CommRing R\ninst✝ : CommRing S\n⊢ ↑(basicOpen 0) = ↑⊥",
"tactic": "simp"
}
] | [
793,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
792,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Icc_ssubset_Icc_right | [] | [
597,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
594,
1
] |
Mathlib/Analysis/NormedSpace/PiLp.lean | PiLp.nnnorm_equiv_symm_const' | [
{
"state_after": "p : ℝ≥0∞\n𝕜 : Type ?u.503614\n𝕜' : Type ?u.503617\nι : Type u_2\nα : ι → Type ?u.503625\nβ✝ : ι → Type ?u.503630\ninst✝¹⁰ : Fintype ι\ninst✝⁹ : Fact (1 ≤ p)\ninst✝⁸ : NormedField 𝕜\ninst✝⁷ : NormedField 𝕜'\ninst✝⁶ : (i : ι) → SeminormedAddCommGroup (β✝ i)\ninst✝⁵ : (i : ι) → NormedSpace 𝕜... | [
907,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
900,
1
] |
Mathlib/Algebra/Hom/Units.lean | Units.val_div_eq_div_val | [] | [
133,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
132,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearMap.smulRight_one_eq_iff | [
{
"state_after": "no goals",
"state_before": "R₁ : Type u_1\nR₂ : Type ?u.669818\nR₃ : Type ?u.669821\ninst✝²⁰ : Semiring R₁\ninst✝¹⁹ : Semiring R₂\ninst✝¹⁸ : Semiring R₃\nσ₁₂ : R₁ →+* R₂\nσ₂₃ : R₂ →+* R₃\nσ₁₃ : R₁ →+* R₃\nM₁ : Type ?u.669899\ninst✝¹⁷ : TopologicalSpace M₁\ninst✝¹⁶ : AddCommMonoid M₁\nM'₁ :... | [
1188,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1186,
1
] |
Mathlib/CategoryTheory/Monoidal/OfHasFiniteProducts.lean | CategoryTheory.monoidalOfHasFiniteProducts.rightUnitor_hom | [] | [
114,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
113,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Tagged.lean | BoxIntegral.TaggedPrepartition.distortion_le_of_mem | [] | [
425,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
424,
1
] |
Mathlib/Combinatorics/Additive/SalemSpencer.lean | MulSalemSpencer.mono | [] | [
81,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
80,
1
] |
Mathlib/Algebra/BigOperators/Multiset/Basic.lean | Multiset.prod_toList | [
{
"state_after": "ι : Type ?u.6108\nα : Type u_1\nβ : Type ?u.6114\nγ : Type ?u.6117\ninst✝ : CommMonoid α\ns✝ t : Multiset α\na : α\nm : Multiset ι\nf g : ι → α\ns : Multiset α\n⊢ List.prod (toList s) = prod ↑(toList s)",
"state_before": "ι : Type ?u.6108\nα : Type u_1\nβ : Type ?u.6114\nγ : Type ?u.6117\n... | [
75,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
73,
1
] |
Mathlib/Data/Set/Function.lean | Set.InjOn.invFunOn_image | [] | [
1253,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1251,
1
] |
Mathlib/Topology/Separation.lean | subsingleton_closure | [] | [
638,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
637,
1
] |
Mathlib/CategoryTheory/Category/Bipointed.lean | pointedToBipointedFst_comp_swap | [] | [
191,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.Measure.FiniteSpanningSetsIn.ext | [] | [
3758,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3756,
11
] |
Mathlib/Algebra/Order/LatticeGroup.lean | LatticeOrderedAddCommGroup.solidClosure_min | [] | [
620,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
619,
1
] |
Mathlib/Algebra/Jordan/Basic.lean | aux0 | [
{
"state_after": "A : Type u_1\ninst✝¹ : NonUnitalNonAssocRing A\ninst✝ : IsCommJordan A\na b c : A\n⊢ ⁅↑L (a + b + c), ↑L (a * (a + b + c) + b * (a + b + c) + c * (a + b + c))⁆ =\n ⁅↑L a + ↑L b + ↑L c, ↑L (a * a) + ↑L (b * b) + ↑L (c * c) + 2 • ↑L (a * b) + 2 • ↑L (c * a) + 2 • ↑L (b * c)⁆",
"state_befo... | [
198,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
9
] |
Mathlib/CategoryTheory/Limits/IsLimit.lean | CategoryTheory.Limits.IsColimit.ofCoconeEquiv_apply_desc | [] | [
780,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
775,
1
] |
Mathlib/LinearAlgebra/Basic.lean | Submodule.inf_comap_le_comap_add | [
{
"state_after": "R : Type u_1\nR₁ : Type ?u.2305340\nR₂ : Type u_2\nR₃ : Type ?u.2305346\nR₄ : Type ?u.2305349\nS : Type ?u.2305352\nK : Type ?u.2305355\nK₂ : Type ?u.2305358\nM : Type u_3\nM' : Type ?u.2305364\nM₁ : Type ?u.2305367\nM₂ : Type u_4\nM₃ : Type ?u.2305373\nM₄ : Type ?u.2305376\nN : Type ?u.230537... | [
2553,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2547,
1
] |
Mathlib/Algebra/Module/LocalizedModule.lean | IsLocalizedModule.fromLocalizedModule'_add | [
{
"state_after": "R : Type u_1\ninst✝⁷ : CommRing R\nS : Submonoid R\nM : Type u_2\nM' : Type u_3\nM'' : Type ?u.623487\ninst✝⁶ : AddCommMonoid M\ninst✝⁵ : AddCommMonoid M'\ninst✝⁴ : AddCommMonoid M''\ninst✝³ : Module R M\ninst✝² : Module R M'\ninst✝¹ : Module R M''\nf : M →ₗ[R] M'\ng : M →ₗ[R] M''\ninst✝ : IsL... | [
751,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
736,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Combination.lean | Finset.centroid_eq_affineCombination_fintype | [] | [
942,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
940,
1
] |
Mathlib/MeasureTheory/MeasurableSpace.lean | measurable_findGreatest' | [] | [
442,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
439,
1
] |
Mathlib/Order/Compare.lean | cmpLE_swap | [
{
"state_after": "case neg\nα✝ : Type ?u.181\nβ : Type ?u.184\nα : Type u_1\ninst✝² : LE α\ninst✝¹ : IsTotal α fun x x_1 => x ≤ x_1\ninst✝ : DecidableRel fun x x_1 => x ≤ x_1\nx y : α\nxy : ¬x ≤ y\nyx : ¬y ≤ x\n⊢ False",
"state_before": "α✝ : Type ?u.181\nβ : Type ?u.184\nα : Type u_1\ninst✝² : LE α\ninst✝¹... | [
40,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
37,
1
] |
Mathlib/Data/Complex/Basic.lean | Complex.ofReal_sum | [] | [
1343,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1342,
1
] |
Mathlib/Order/Hom/CompleteLattice.lean | FrameHom.comp_assoc | [] | [
627,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
625,
1
] |
Mathlib/Topology/UniformSpace/Cauchy.lean | le_nhds_of_cauchy_adhp | [
{
"state_after": "case intro.intro\nα : Type u\nβ : Type v\ninst✝ : UniformSpace α\nf : Filter α\nx : α\nhf : Cauchy f\nadhs : ClusterPt x f\ns : Set (α × α)\nhs : s ∈ 𝓤 α\nt : Set α\nt_mem : t ∈ f\nht : t ×ˢ t ⊆ s\n⊢ ∃ t, t ∈ f ∧ t ×ˢ t ⊆ s ∧ ∃ y, (x, y) ∈ s ∧ y ∈ t",
"state_before": "α : Type u\nβ : Type... | [
132,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
1
] |
Mathlib/Data/Bool/Basic.lean | Bool.or_left_comm | [
{
"state_after": "no goals",
"state_before": "⊢ ∀ (a b c : Bool), (a || (b || c)) = (b || (a || c))",
"tactic": "decide"
}
] | [
156,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
156,
1
] |
Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean | Asymptotics.superpolynomialDecay_iff_zpow_tendsto_zero | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nl : Filter α\nk f g g' : α → β\ninst✝² : TopologicalSpace β\ninst✝¹ : LinearOrderedField β\ninst✝ : OrderTopology β\nhk : Tendsto k l atTop\nh : SuperpolynomialDecay l k f\nz : ℤ\n⊢ Tendsto (fun a => k a ^ z * f a) l (𝓝 0)",
"state_before": "α : Type u_1\nβ : T... | [
254,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
244,
1
] |
Mathlib/Analysis/NormedSpace/AddTorsorBases.lean | continuous_barycentric_coord | [] | [
50,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
49,
1
] |
Mathlib/CategoryTheory/Whiskering.lean | CategoryTheory.isoWhiskerLeft_inv | [] | [
170,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/Algebra/MonoidAlgebra/Basic.lean | AddMonoidAlgebra.single_add | [] | [
1196,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1195,
1
] |
Mathlib/Algebra/Order/Ring/Lemmas.lean | mul_le_iff_le_one_left | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\na b c d : α\ninst✝⁴ : MulOneClass α\ninst✝³ : Zero α\ninst✝² : Preorder α\ninst✝¹ : MulPosMono α\ninst✝ : MulPosMonoRev α\nb0 : 0 < b\n⊢ a * b ≤ b ↔ a * b ≤ 1 * b",
"tactic": "rw [one_mul]"
}
] | [
654,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
653,
1
] |
Mathlib/Order/SuccPred/Basic.lean | Order.pred_ne_pred_iff | [] | [
834,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
833,
1
] |
Mathlib/Data/Finset/Fold.lean | Finset.fold_sup_bot_singleton | [] | [
211,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/MeasureTheory/Integral/IntegrableOn.lean | MeasureTheory.integrable_add_of_disjoint | [
{
"state_after": "case refine'_1\nα : Type u_1\nβ : Type ?u.1665526\nE : Type u_2\nF : Type ?u.1665532\ninst✝¹ : MeasurableSpace α\ninst✝ : NormedAddCommGroup E\nf✝ g✝ : α → E\ns t : Set α\nμ ν : Measure α\nl l' : Filter α\nf g : α → E\nh : Disjoint (support f) (support g)\nhf : StronglyMeasurable f\nhg : Stron... | [
478,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
473,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | Algebra.coe_iInf | [
{
"state_after": "no goals",
"state_before": "R : 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\nι : Sort u_1\nS : ι → Subalgebra R A\n⊢ ↑(⨅ (i : ι), S i) = ⋂ (i : ι), ↑(S i)",
"tactic": "simp [iInf]"
}
] | [
877,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
876,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.mul_left_comm | [
{
"state_after": "no goals",
"state_before": "n m k : Nat\n⊢ n * (m * k) = m * (n * k)",
"tactic": "rw [← Nat.mul_assoc, Nat.mul_comm n m, Nat.mul_assoc]"
}
] | [
203,
56
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
202,
11
] |
Mathlib/Order/SuccPred/Limit.lean | Order.IsSuccLimit.succ_ne | [
{
"state_after": "α : Type u_1\ninst✝² : Preorder α\ninst✝¹ : SuccOrder α\ninst✝ : NoMaxOrder α\nb : α\nh : IsSuccLimit (succ b)\n⊢ False",
"state_before": "α : Type u_1\ninst✝² : Preorder α\na : α\ninst✝¹ : SuccOrder α\ninst✝ : NoMaxOrder α\nh : IsSuccLimit a\nb : α\n⊢ succ b ≠ a",
"tactic": "rintro rf... | [
89,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.sdiff_inter_self_right | [] | [
2101,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2100,
1
] |
Mathlib/CategoryTheory/Limits/IsLimit.lean | CategoryTheory.Limits.IsColimit.comp_coconePointUniqueUpToIso_inv | [] | [
671,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
669,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.iInf_coe | [] | [
1927,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1926,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/CommSq.lean | CategoryTheory.IsPushout.inl_isoPushout_inv | [
{
"state_after": "C : Type u₁\ninst✝¹ : Category C\nZ X Y P : C\nf : Z ⟶ X\ng : Z ⟶ Y\ninl : X ⟶ P\ninr : Y ⟶ P\nh : IsPushout f g inl inr\ninst✝ : HasPushout f g\n⊢ pushout.inl ≫\n (colimit.isoColimitCocone\n { cocone := PushoutCocone.mk inl inr (_ : f ≫ inl = g ≫ inr), isColimit := isColimit h }... | [
423,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
420,
1
] |
Mathlib/Data/Nat/ModEq.lean | Nat.ModEq.add_right_cancel | [
{
"state_after": "m n a b c d : ℕ\nh₁ : c ≡ d [MOD n]\nh₂ : c + a ≡ d + b [MOD n]\n⊢ a ≡ b [MOD n]",
"state_before": "m n a b c d : ℕ\nh₁ : c ≡ d [MOD n]\nh₂ : a + c ≡ b + d [MOD n]\n⊢ a ≡ b [MOD n]",
"tactic": "rw [add_comm a, add_comm b] at h₂"
},
{
"state_after": "no goals",
"state_before... | [
169,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
166,
11
] |
Mathlib/CategoryTheory/GlueData.lean | CategoryTheory.GlueData.types_π_surjective | [] | [
235,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
234,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.comap_bot_of_injective | [] | [
1631,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1630,
1
] |
Mathlib/Topology/Sheaves/PUnit.lean | TopCat.Presheaf.isSheaf_iff_isTerminal_of_indiscrete | [] | [
52,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
49,
1
] |
Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean | EuclideanGeometry.angle_eq_zero_of_angle_eq_pi_right | [
{
"state_after": "V : Type u_1\nP : Type u_2\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerProductSpace ℝ V\ninst✝¹ : MetricSpace P\ninst✝ : NormedAddTorsor V P\np1 p2 p3 : P\nh : ∠ p3 p2 p1 = π\n⊢ ∠ p2 p3 p1 = 0",
"state_before": "V : Type u_1\nP : Type u_2\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerPro... | [
176,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | ball_pi | [
{
"state_after": "case h\nα : Type u\nβ : Type v\nX : Type ?u.398898\nι : Type ?u.398901\ninst✝² : PseudoMetricSpace α\nπ : β → Type u_1\ninst✝¹ : Fintype β\ninst✝ : (b : β) → PseudoMetricSpace (π b)\nx : (b : β) → π b\nr : ℝ\nhr : 0 < r\np : (b : β) → π b\n⊢ p ∈ ball x r ↔ p ∈ Set.pi Set.univ fun b => ball (x ... | [
2052,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2049,
1
] |
Mathlib/Data/Set/Countable.lean | Set.countable_isTop | [] | [
249,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
248,
1
] |
Mathlib/GroupTheory/Submonoid/Pointwise.lean | Submonoid.inv_inf | [] | [
180,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
179,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.right_mem_Ioo | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.4756\ninst✝ : Preorder α\na a₁ a₂ b b₁ b₂ c x : α\n⊢ b ∈ Ioo a b ↔ False",
"tactic": "simp [lt_irrefl]"
}
] | [
208,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
208,
1
] |
src/lean/Init/Prelude.lean | Nat.zero_lt_succ | [] | [
1587,
27
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
1586,
1
] |
Mathlib/Data/List/Sigma.lean | List.dlookup_eq_none | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : α → Type v\nl✝ l₁ l₂ : List (Sigma β)\ninst✝ : DecidableEq α\na : α\nl : List (Sigma β)\n⊢ dlookup a l = none ↔ ¬a ∈ keys l",
"tactic": "simp [← dlookup_isSome, Option.isNone_iff_eq_none]"
}
] | [
202,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/Analysis/BoxIntegral/Basic.lean | BoxIntegral.Integrable.dist_integralSum_sum_integral_le_of_memBaseSet_of_iUnion_eq | [
{
"state_after": "ι : Type u\nE : Type v\nF : Type w\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace ℝ E\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace ℝ F\nI J : Box ι\nπ : TaggedPrepartition I\ninst✝¹ : Fintype ι\nl : IntegrationParams\nf g : (ι → ℝ) → E\nvol : ι →ᵇᵃ[⊤] E →L[ℝ] F\ny y' : F\nc c₁ c₂... | [
609,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
566,
1
] |
Mathlib/NumberTheory/Padics/Hensel.lean | soln_dist_to_a | [] | [
413,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
412,
9
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.