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/GroupTheory/Complement.lean | Subgroup.mem_rightTransversals_iff_existsUnique_quotient_mk''_eq | [
{
"state_after": "G : Type u_1\ninst✝ : Group G\nH K : Subgroup G\nS T : Set G\n⊢ (∀ (g : G), ∃! s, Quotient.mk'' ↑s = Quotient.mk'' g) ↔\n ∀ (q : Quotient (QuotientGroup.rightRel H)), ∃! s, Quotient.mk'' ↑s = q",
"state_before": "G : Type u_1\ninst✝ : Group G\nH K : Subgroup G\nS T : Set G\n⊢ S ∈ rightT... | [
258,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
253,
1
] |
Mathlib/Analysis/Convex/Function.lean | ConcaveOn.left_le_of_le_right | [] | [
750,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
748,
1
] |
Mathlib/LinearAlgebra/TensorProduct/Matrix.lean | TensorProduct.toMatrix_assoc | [
{
"state_after": "case a.mk.mk.h.mk.mk\nR : Type u_1\nM : Type u_5\nN : Type u_6\nP : Type u_7\nM' : Type ?u.187308\nN' : Type ?u.187311\nι : Type u_2\nκ : Type u_3\nτ : Type u_4\nι' : Type ?u.187323\nκ' : Type ?u.187326\ninst✝¹⁸ : DecidableEq ι\ninst✝¹⁷ : DecidableEq κ\ninst✝¹⁶ : DecidableEq τ\ninst✝¹⁵ : Finty... | [
88,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/MeasureTheory/Integral/Bochner.lean | MeasureTheory.integral_trim | [
{
"state_after": "α : Type ?u.1710649\nE : Type ?u.1710652\nF : Type u_2\n𝕜 : Type ?u.1710658\ninst✝⁹ : NormedAddCommGroup E\ninst✝⁸ : NormedSpace ℝ E\ninst✝⁷ : CompleteSpace E\ninst✝⁶ : NontriviallyNormedField 𝕜\ninst✝⁵ : NormedSpace 𝕜 E\ninst✝⁴ : SMulCommClass ℝ 𝕜 E\ninst✝³ : NormedAddCommGroup F\ninst✝² ... | [
1788,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1761,
1
] |
Mathlib/Data/Set/Finite.lean | Set.iInter_iUnion_of_antitone | [] | [
1547,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1544,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Submonoid.LocalizationMap.lift_mk' | [
{
"state_after": "no goals",
"state_before": "M : Type u_1\ninst✝² : CommMonoid M\nS : Submonoid M\nN : Type u_3\ninst✝¹ : CommMonoid N\nP : Type u_2\ninst✝ : CommMonoid P\nf : LocalizationMap S N\ng : M →* P\nhg : ∀ (y : { x // x ∈ S }), IsUnit (↑g ↑y)\nx : M\ny : { x // x ∈ S }\n⊢ ↑(toMap f) ((sec f (mk' ... | [
948,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
945,
1
] |
Mathlib/Data/Set/Pointwise/Basic.lean | Set.preimage_mul_right_one | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.131696\nα : Type u_1\nβ : Type ?u.131702\nγ : Type ?u.131705\ninst✝ : Group α\ns t : Set α\na b : α\n⊢ (fun x => x * b) ⁻¹' 1 = {b⁻¹}",
"tactic": "rw [← image_mul_right', image_one, one_mul]"
}
] | [
1240,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1239,
1
] |
Mathlib/Data/Set/Image.lean | Set.preimage_ite | [] | [
111,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
1
] |
Mathlib/Data/MvPolynomial/Division.lean | MvPolynomial.mul_monomial_modMonomial | [] | [
132,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
130,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | hasFTaylorSeriesUpTo_top_iff' | [
{
"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\... | [
1282,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1277,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Mul.lean | fderivWithin_clm_comp | [] | [
106,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
101,
1
] |
Mathlib/Data/Seq/Computation.lean | Computation.of_results_think | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ns : Computation α\na : α\nn : ℕ\nh : Results (think s) a n\nthis : Terminates s\n⊢ ∃ m, Results s a m ∧ n = m + 1",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ns : Computation α\na : α\nn : ℕ\nh : Results (think s) a n\n⊢ ∃ m, Results s a m ∧ n ... | [
582,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
578,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.coe_finset_sum | [] | [
644,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
643,
1
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | LocalEquiv.IsImage.symm_iff | [] | [
376,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
375,
1
] |
Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean | Complex.arg_of_re_neg_of_im_neg | [
{
"state_after": "no goals",
"state_before": "x : ℂ\nhx_re : x.re < 0\nhx_im : x.im < 0\n⊢ arg x = arcsin ((-x).im / ↑abs x) - π",
"tactic": "simp only [arg, hx_re.not_le, hx_im.not_le, if_false]"
}
] | [
287,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
285,
1
] |
Mathlib/Data/Rel.lean | Rel.preimage_mono | [] | [
188,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Algebra/Hom/Units.lean | Units.coe_liftRight | [] | [
170,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
1
] |
Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean | divp_mk0 | [] | [
149,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
148,
1
] |
Mathlib/RingTheory/Valuation/Basic.lean | Valuation.IsEquiv.of_eq | [
{
"state_after": "K : Type ?u.2583538\nF : Type ?u.2583541\nR : Type u_1\ninst✝⁴ : DivisionRing K\nΓ₀ : Type u_2\nΓ'₀ : Type ?u.2583553\nΓ''₀ : Type ?u.2583556\ninst✝³ : LinearOrderedCommMonoidWithZero Γ''₀\ninst✝² : Ring R\ninst✝¹ : LinearOrderedCommMonoidWithZero Γ₀\ninst✝ : LinearOrderedCommMonoidWithZero Γ'... | [
386,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
386,
1
] |
Mathlib/Topology/Algebra/Order/LiminfLimsup.lean | gt_mem_sets_of_limsInf_gt | [] | [
146,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.prod_map_seq_comm | [
{
"state_after": "case refine'_1\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.295875\nι : Sort x\nf : Filter α\ng : Filter β\ns : Set (α → α × β)\nhs : s ∈ map (fun b a => (a, b)) g\nt : Set α\nht : t ∈ f\n⊢ Set.seq s t ∈ seq (map Prod.mk f) g\n\ncase refine'_2\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type ... | [
2690,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2680,
1
] |
Mathlib/Analysis/NormedSpace/AffineIsometry.lean | AffineIsometryEquiv.pointReflection_symm | [] | [
800,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
799,
1
] |
Mathlib/RingTheory/Adjoin/Basic.lean | Algebra.adjoin_union_coe_submodule | [
{
"state_after": "R : Type u\nA : Type v\nB : Type w\ninst✝² : CommSemiring R\ninst✝¹ : CommSemiring A\ninst✝ : Algebra R A\ns t : Set A\n⊢ span R ↑(Submonoid.closure (s ∪ t)) = span R (↑(Submonoid.closure s) * ↑(Submonoid.closure t))",
"state_before": "R : Type u\nA : Type v\nB : Type w\ninst✝² : CommSemir... | [
323,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
319,
1
] |
Mathlib/Algebra/BigOperators/Multiset/Basic.lean | Multiset.prod_le_prod_map | [] | [
419,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
418,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.lt_iff_exists_add_pos_lt | [
{
"state_after": "α : Type ?u.127753\nβ : Type ?u.127756\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nhab : a < b\n⊢ ∃ r, 0 < r ∧ a + ↑r < b",
"state_before": "α : Type ?u.127753\nβ : Type ?u.127756\na b c d : ℝ≥0∞\nr p q : ℝ≥0\n⊢ a < b ↔ ∃ r, 0 < r ∧ a + ↑r < b",
"tactic": "refine' ⟨fun hab => _, fun ⟨r, _, hr⟩ => lt... | [
836,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
830,
1
] |
Mathlib/Order/BooleanAlgebra.lean | compl_sup_eq_top | [] | [
568,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
567,
1
] |
Mathlib/Data/Real/CauSeqCompletion.lean | CauSeq.lim_mul | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝³ : LinearOrderedField α\nβ : Type u_2\ninst✝² : Ring β\nabv : β → α\ninst✝¹ : IsAbsoluteValue abv\ninst✝ : IsComplete β abv\nf : CauSeq β abv\nx : β\n⊢ lim f * x = lim (f * const abv x)",
"tactic": "rw [← lim_mul_lim, lim_const]"
}
] | [
390,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
389,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.insert_inter_of_not_mem | [
{
"state_after": "α : Type u_1\nβ : Type ?u.185481\nγ : Type ?u.185484\ninst✝ : DecidableEq α\ns s₁✝ s₂✝ t t₁ t₂ u v : Finset α\na✝ b : α\ns₁ s₂ : Finset α\na : α\nh : ¬a ∈ s₂\nx : α\nthis : ¬(x = a ∧ x ∈ s₂)\n⊢ x ∈ insert a s₁ ∩ s₂ ↔ x ∈ s₁ ∩ s₂",
"state_before": "α : Type u_1\nβ : Type ?u.185481\nγ : Type... | [
1666,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1662,
1
] |
Mathlib/Topology/Algebra/Order/IntermediateValue.lean | intermediate_value_univ₂_eventually₁ | [] | [
80,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
1
] |
Mathlib/Data/Nat/Order/Basic.lean | Nat.add_eq_max_iff | [
{
"state_after": "m n k l : ℕ\n⊢ m + n = max m n ↔ min m n = 0",
"state_before": "m n k l : ℕ\n⊢ m + n = max m n ↔ m = 0 ∨ n = 0",
"tactic": "rw [← min_eq_zero_iff]"
},
{
"state_after": "no goals",
"state_before": "m n k l : ℕ\n⊢ m + n = max m n ↔ min m n = 0",
"tactic": "cases' le_total... | [
142,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
140,
1
] |
Mathlib/Order/Ideal.lean | Order.Ideal.eq_sup_of_le_sup | [
{
"state_after": "P : Type u_1\ninst✝ : DistribLattice P\nI J : Ideal P\nx i j : P\nhi : i ∈ I\nhj : j ∈ J\nhx : x ≤ i ⊔ j\n⊢ x = x ⊓ i ⊔ x ⊓ j",
"state_before": "P : Type u_1\ninst✝ : DistribLattice P\nI J : Ideal P\nx i j : P\nhi : i ∈ I\nhj : j ∈ J\nhx : x ≤ i ⊔ j\n⊢ ∃ i', i' ∈ I ∧ ∃ j', j' ∈ J ∧ x = i' ... | [
481,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
476,
1
] |
Std/Data/Int/Lemmas.lean | Int.sign_neg_one | [] | [
197,
45
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
197,
1
] |
Std/Data/RBMap/WF.lean | Std.RBNode.cmpEq.lt_congr_left | [] | [
40,
95
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
39,
1
] |
Mathlib/RingTheory/Ideal/Basic.lean | Ideal.unit_mul_mem_iff_mem | [
{
"state_after": "α : Type u\nβ : Type v\ninst✝ : Semiring α\nI : Ideal α\na b x y : α\nhy : IsUnit y\nh : y * x ∈ I\n⊢ x ∈ I",
"state_before": "α : Type u\nβ : Type v\ninst✝ : Semiring α\nI : Ideal α\na b x y : α\nhy : IsUnit y\n⊢ y * x ∈ I ↔ x ∈ I",
"tactic": "refine' ⟨fun h => _, fun h => I.mul_mem_l... | [
109,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
105,
1
] |
Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean | MeasureTheory.AEStronglyMeasurable.comp_aemeasurable | [] | [
1550,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1546,
1
] |
Mathlib/Topology/Order/Basic.lean | mem_nhdsWithin_Iic_iff_exists_mem_Ico_Ioc_subset | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² : TopologicalSpace α\ninst✝¹ : LinearOrder α\ninst✝ : OrderTopology α\na l' : α\ns : Set α\nhl' : l' < a\n⊢ List.get?\n [s ∈ 𝓝[Iic a] a, s ∈ 𝓝[Icc l' a] a, s ∈ 𝓝[Ioc l' a] a, ∃ l, l ∈ Ico l' a ∧ Ioc l a ⊆ s,\n ... | [
1814,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1812,
1
] |
Mathlib/Data/Polynomial/Coeff.lean | Polynomial.coeff_one | [] | [
43,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
42,
1
] |
Mathlib/Data/List/Chain.lean | List.Chain'.cons' | [] | [
278,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/CategoryTheory/Monoidal/Limits.lean | CategoryTheory.Limits.limLax_ε | [] | [
132,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | Complex.deriv_sin | [] | [
66,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/RingTheory/Valuation/Basic.lean | AddValuation.map_lt_sum | [] | [
706,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
704,
1
] |
Mathlib/RingTheory/Filtration.lean | Ideal.Filtration.top_N | [] | [
164,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
1
] |
Mathlib/Topology/Algebra/Ring/Basic.lean | mulRight_continuous | [] | [
237,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
236,
1
] |
Mathlib/Order/Filter/Lift.lean | Filter.mem_lift | [] | [
87,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Data/Finset/NAry.lean | Finset.image_image₂ | [
{
"state_after": "α : Type u_3\nα' : Type ?u.58773\nβ : Type u_4\nβ' : Type ?u.58779\nγ : Type u_2\nγ' : Type ?u.58785\nδ : Type u_1\nδ' : Type ?u.58791\nε : Type ?u.58794\nε' : Type ?u.58797\nζ : Type ?u.58800\nζ' : Type ?u.58803\nν : Type ?u.58806\ninst✝⁷ : DecidableEq α'\ninst✝⁶ : DecidableEq β'\ninst✝⁵ : De... | [
317,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
313,
1
] |
Mathlib/Algebra/TrivSqZeroExt.lean | TrivSqZeroExt.inr_zero | [] | [
352,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
351,
1
] |
Mathlib/Data/Polynomial/Eval.lean | Polynomial.eval₂_mul_eq_zero_of_right | [
{
"state_after": "R : Type u\nS : Type v\nT : Type w\nι : Type y\na b : R\nm n : ℕ\ninst✝¹ : Semiring R\np✝ q r : R[X]\ninst✝ : CommSemiring S\nf : R →+* S\nx : S\np : R[X]\nhq : eval₂ f x q = 0\n⊢ eval₂ f x p * eval₂ f x q = 0",
"state_before": "R : Type u\nS : Type v\nT : Type w\nι : Type y\na b : R\nm n ... | [
271,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
269,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | lcm_eq_of_associated_right | [] | [
873,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
870,
1
] |
Mathlib/Computability/Primrec.lean | Primrec.ite | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.127715\nγ : Type ?u.127718\nδ : Type ?u.127721\nσ : Type u_2\ninst✝⁵ : Primcodable α\ninst✝⁴ : Primcodable β\ninst✝³ : Primcodable γ\ninst✝² : Primcodable δ\ninst✝¹ : Primcodable σ\nc : α → Prop\ninst✝ : DecidablePred c\nf g : α → σ\nhc... | [
687,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
685,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | MeasureTheory.ae_restrict_biUnion_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.561248\nγ : Type ?u.561251\nδ : Type ?u.561254\nι : Type u_2\nR : Type ?u.561260\nR' : Type ?u.561263\nm0 : MeasurableSpace α\ninst✝¹ : MeasurableSpace β\ninst✝ : MeasurableSpace γ\nμ μ₁ μ₂ μ₃ ν ν' ν₁ ν₂ : Measure α\ns✝ s' t✝ : Set α\ns... | [
2761,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2759,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Concrete.lean | Equiv.Perm.toList_pow_apply_eq_rotate | [
{
"state_after": "case hl\nα : Type u_1\ninst✝¹ : Fintype α\ninst✝ : DecidableEq α\np✝ : Perm α\nx✝ : α\np : Perm α\nx : α\nk : ℕ\n⊢ length (toList p (↑(p ^ k) x)) = length (rotate (toList p x) k)\n\ncase h\nα : Type u_1\ninst✝¹ : Fintype α\ninst✝ : DecidableEq α\np✝ : Perm α\nx✝ : α\np : Perm α\nx : α\nk : ℕ\n... | [
324,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
318,
1
] |
Mathlib/Analysis/Convex/Between.lean | Sbtw.right_mem_image_Ioi | [] | [
730,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
728,
1
] |
Mathlib/Analysis/NormedSpace/BoundedLinearMaps.lean | IsBoundedLinearMap.add | [
{
"state_after": "no goals",
"state_before": "𝕜 : Type u_1\ninst✝⁶ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\nF : Type u_3\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\nG : Type ?u.45640\ninst✝¹ : NormedAddCommGroup G\ninst✝ : NormedSp... | [
151,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/NumberTheory/Padics/PadicIntegers.lean | PadicInt.norm_le_pow_iff_mem_span_pow | [
{
"state_after": "case pos\np : ℕ\nhp : Fact (Nat.Prime p)\nx : ℤ_[p]\nn : ℕ\nhx : x = 0\n⊢ ‖x‖ ≤ ↑p ^ (-↑n) ↔ x ∈ Ideal.span {↑p ^ n}\n\ncase neg\np : ℕ\nhp : Fact (Nat.Prime p)\nx : ℤ_[p]\nn : ℕ\nhx : ¬x = 0\n⊢ ‖x‖ ≤ ↑p ^ (-↑n) ↔ x ∈ Ideal.span {↑p ^ n}",
"state_before": "p : ℕ\nhp : Fact (Nat.Prime p)\nx... | [
558,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
552,
1
] |
Mathlib/Data/Finset/Prod.lean | Finset.offDiag_mono | [] | [
350,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
349,
1
] |
Mathlib/Data/Set/Function.lean | Set.EqOn.congr_monotoneOn | [] | [
275,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
274,
1
] |
Mathlib/SetTheory/Ordinal/Arithmetic.lean | Ordinal.lift_add | [] | [
76,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | fderivWithin_eventually_congr_set | [] | [
821,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
819,
1
] |
Mathlib/Probability/Independence/Basic.lean | ProbabilityTheory.indep_bot_right | [
{
"state_after": "Ω : Type u_1\nι : Type ?u.540154\nm' m : MeasurableSpace Ω\nμ : MeasureTheory.Measure Ω\ninst✝ : IsProbabilityMeasure μ\ns t : Set Ω\n_hs : s ∈ {s | MeasurableSet s}\nht : t ∈ {s | MeasurableSet s}\n⊢ ↑↑μ (s ∩ t) = ↑↑μ s * ↑↑μ t",
"state_before": "Ω : Type u_1\nι : Type ?u.540154\nm' m : M... | [
165,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
159,
1
] |
Mathlib/ModelTheory/Semantics.lean | FirstOrder.Language.BoundedFormula.realize_rel₂ | [
{
"state_after": "L : Language\nL' : Language\nM : Type w\nN : Type ?u.55232\nP : Type ?u.55235\ninst✝² : Structure L M\ninst✝¹ : Structure L N\ninst✝ : Structure L P\nα : Type u'\nβ : Type v'\nn l : ℕ\nφ ψ : BoundedFormula L α l\nθ : BoundedFormula L α (Nat.succ l)\nv : α → M\nxs : Fin l → M\nR : Relations L 2... | [
324,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
318,
1
] |
Mathlib/Algebra/Order/Monoid/Lemmas.lean | MonotoneOn.mul_const' | [] | [
1320,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1318,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.deleteVerts_verts | [] | [
1213,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1212,
1
] |
Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean | CircleDeg1Lift.translationNumber_translate | [
{
"state_after": "no goals",
"state_before": "f g : CircleDeg1Lift\nx : ℝ\n⊢ Tendsto (fun n => (↑↑(↑translate (↑Multiplicative.ofAdd x))^[n + 1]) 0 / (↑n + 1)) atTop (𝓝 x)",
"tactic": "simp only [translate_iterate, translate_apply, add_zero, Nat.cast_succ,\n mul_div_cancel_left (G₀ := ℝ) _ (Nat.cast_a... | [
814,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
811,
1
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | Equiv.trans_toLocalEquiv | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_3\nγ : Type u_2\nδ : Type ?u.76640\ne : α ≃ β\ne' : β ≃ γ\n⊢ (toLocalEquiv (e.trans e')).source = (LocalEquiv.trans (toLocalEquiv e) (toLocalEquiv e')).source",
"tactic": "simp [LocalEquiv.trans_source, Equiv.toLocalEquiv]"
}
] | [
1112,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1110,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | fderivWithin_id | [
{
"state_after": "𝕜 : Type u_1\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type ?u.1262982\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type ?u.1263077\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\nG' : Type ?u... | [
1043,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1041,
1
] |
Mathlib/AlgebraicTopology/SimplicialObject.lean | CategoryTheory.CosimplicialObject.δ_comp_δ'' | [
{
"state_after": "C : Type u\ninst✝ : Category C\nX : CosimplicialObject C\nn : ℕ\ni : Fin (n + 3)\nj : Fin (n + 2)\nH : i ≤ ↑Fin.castSucc j\n⊢ X.map (SimplexCategory.δ (Fin.castLT i (_ : ↑i < n + 2))) ≫ X.map (SimplexCategory.δ (Fin.succ j)) =\n X.map (SimplexCategory.δ j) ≫ X.map (SimplexCategory.δ i)",
... | [
501,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
497,
1
] |
Mathlib/RingTheory/Adjoin/Basic.lean | Algebra.adjoin_inl_union_inr_eq_prod | [
{
"state_after": "case a\nR : Type u\nA : Type v\nB : Type w\ninst✝⁴ : CommSemiring R\ninst✝³ : Semiring A\ninst✝² : Semiring B\ninst✝¹ : Algebra R A\ninst✝ : Algebra R B\ns✝ t✝ s : Set A\nt : Set B\n⊢ adjoin R (↑(LinearMap.inl R A B) '' (s ∪ {1}) ∪ ↑(LinearMap.inr R A B) '' (t ∪ {1})) ≤\n Subalgebra.prod (a... | [
271,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
252,
1
] |
Mathlib/Logic/Equiv/Defs.lean | Equiv.conj_symm | [] | [
575,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
575,
9
] |
Mathlib/FieldTheory/RatFunc.lean | RatFunc.induction_on | [
{
"state_after": "no goals",
"state_before": "K : Type u\ninst✝¹ : CommRing K\ninst✝ : IsDomain K\nP : RatFunc K → Prop\nx : RatFunc K\nf : ∀ (p q : K[X]), q ≠ 0 → P (↑(algebraMap K[X] (RatFunc K)) p / ↑(algebraMap K[X] (RatFunc K)) q)\np q : K[X]\nhq : q ≠ 0\n⊢ P (RatFunc.mk p q)",
"tactic": "simpa usi... | [
1032,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1030,
11
] |
Mathlib/Data/Set/Pointwise/Interval.lean | Set.preimage_mul_const_Iio_of_neg | [] | [
557,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
555,
1
] |
Mathlib/Analysis/Normed/Field/Basic.lean | nnnorm_mul | [] | [
525,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
524,
1
] |
Mathlib/LinearAlgebra/Basis.lean | Basis.mk_coord_apply | [
{
"state_after": "case inl\nι : Type u_1\nι' : Type ?u.851959\nR : Type u_2\nR₂ : Type ?u.851965\nK : Type ?u.851968\nM : Type u_3\nM' : Type ?u.851974\nM'' : Type ?u.851977\nV : Type u\nV' : Type ?u.851982\nv : ι → M\ninst✝⁹ : Ring R\ninst✝⁸ : CommRing R₂\ninst✝⁷ : AddCommGroup M\ninst✝⁶ : AddCommGroup M'\nins... | [
1169,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1165,
1
] |
Mathlib/Topology/ContinuousOn.lean | Filter.Eventually.self_of_nhdsWithin | [] | [
178,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
1
] |
Mathlib/CategoryTheory/Abelian/Pseudoelements.lean | CategoryTheory.Abelian.Pseudoelement.pseudo_surjective_of_epi | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝² : Category C\ninst✝¹ : Abelian C\nP Q : C\nf : P ⟶ Q\ninst✝ : Epi f\nqbar : Pseudoelement Q\nq : Over Q\n⊢ 𝟙 (pullback f q.hom) ≫ ((fun g => app f g) (Over.mk pullback.fst)).hom = pullback.snd ≫ q.hom",
"tactic": "rw [Category.id_comp, ← ... | [
338,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
332,
1
] |
Mathlib/AlgebraicTopology/SimplexCategory.lean | SimplexCategory.len_le_of_mono | [
{
"state_after": "x y : SimplexCategory\nf : x ⟶ y\nhyp_f_mono : Mono f\n⊢ len x ≤ len y",
"state_before": "x y : SimplexCategory\nf : x ⟶ y\n⊢ Mono f → len x ≤ len y",
"tactic": "intro hyp_f_mono"
},
{
"state_after": "x y : SimplexCategory\nf : x ⟶ y\nhyp_f_mono : Mono f\nf_inj : Function.Injec... | [
501,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
498,
1
] |
Mathlib/GroupTheory/SemidirectProduct.lean | SemidirectProduct.mul_left | [] | [
76,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/Algebra/Ring/Prod.lean | RingEquiv.snd_comp_coe_prod_comm | [] | [
303,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
301,
1
] |
Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean | mul_eq_one_iff_eq_inv₀ | [] | [
60,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/Algebra/Module/Basic.lean | map_nat_cast_smul | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.172942\nR✝ : Type ?u.172945\nk : Type ?u.172948\nS✝ : Type ?u.172951\nM : Type u_1\nM₂ : Type u_2\nM₃ : Type ?u.172960\nι : Type ?u.172963\ninst✝⁶ : AddCommMonoid M\ninst✝⁵ : AddCommMonoid M₂\nF : Type u_3\ninst✝⁴ : AddMonoidHomClass F M M₂\nf : F\nR... | [
463,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
460,
1
] |
Mathlib/Data/Set/Ncard.lean | Set.ncard_map | [] | [
288,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
287,
9
] |
Mathlib/Algebra/BigOperators/Ring.lean | Finset.dvd_sum | [
{
"state_after": "case intro.intro\nα : Type u\nβ : Type v\nγ : Type w\ns✝ s₁ s₂ : Finset α\na : α\nb✝ : β\nf✝ g : α → β\ninst✝ : CommSemiring β\nb : β\ns : Finset α\nf : α → β\nh : ∀ (x : α), x ∈ s → b ∣ f x\nx : α\nhx : x ∈ s.val\nhy : f x ∈ Multiset.map (fun x => f x) s.val\n⊢ b ∣ f x",
"state_before": "... | [
215,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Order/Bounds/Basic.lean | upperBounds_union | [] | [
363,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/Algebra/Group/Basic.lean | div_left_injective | [
{
"state_after": "α : Type ?u.56027\nβ : Type ?u.56030\nG : Type u_1\ninst✝ : Group G\na b c d : G\n⊢ Injective fun a => a * b⁻¹",
"state_before": "α : Type ?u.56027\nβ : Type ?u.56030\nG : Type u_1\ninst✝ : Group G\na b c d : G\n⊢ Injective fun a => a / b",
"tactic": "simp only [div_eq_mul_inv]"
},
... | [
729,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
726,
1
] |
Mathlib/CategoryTheory/Limits/Fubini.lean | CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim_inv_π_π | [
{
"state_after": "J K : Type v\ninst✝⁶ : SmallCategory J\ninst✝⁵ : SmallCategory K\nC : Type u\ninst✝⁴ : Category C\nF : J ⥤ K ⥤ C\ninst✝³ : HasLimitsOfShape J C\ninst✝² : HasLimitsOfShape K C\ninst✝¹ : HasLimitsOfShape (J × K) C\ninst✝ : HasLimitsOfShape (K × J) C\nk : K\nj : J\n⊢ ((((limitUncurryIsoLimitCompL... | [
250,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
246,
1
] |
Mathlib/Topology/UniformSpace/Compact.lean | IsCompact.uniformContinuousAt_of_continuousAt | [
{
"state_after": "case intro.intro.intro\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.42994\ninst✝¹ : UniformSpace α\ninst✝ : UniformSpace β\nr : Set (β × β)\ns : Set α\nhs : IsCompact s\nf : α → β\nhf : ∀ (a : α), a ∈ s → ContinuousAt f a\nhr : r ∈ 𝓤 β\nt : Set (β × β)\nht : t ∈ 𝓤 β\nhtsymm : SymmetricRel t\nhtr... | [
204,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
1
] |
Mathlib/Algebra/GroupWithZero/Basic.lean | left_ne_zero_of_mul | [] | [
56,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
1
] |
Mathlib/Algebra/Homology/ImageToKernel.lean | imageToKernel_zero_left | [
{
"state_after": "case h\nι : Type ?u.8478\nV : Type u\ninst✝³ : Category V\ninst✝² : HasZeroMorphisms V\nA B C : V\nf : A ⟶ B\ng : B ⟶ C\ninst✝¹ : HasKernels V\ninst✝ : HasZeroObject V\nw : 0 ≫ g = 0\n⊢ imageToKernel 0 g w ≫ Subobject.arrow (kernelSubobject g) = 0 ≫ Subobject.arrow (kernelSubobject g)",
"s... | [
88,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/MeasureTheory/Function/AEEqFun.lean | MeasureTheory.AEEqFun.mk_pow | [] | [
678,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
675,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Metrizable.lean | aemeasurable_of_tendsto_metrizable_ae | [
{
"state_after": "case intro\nα : Type u_2\nβ : Type u_3\ninst✝⁵ : MeasurableSpace α\ninst✝⁴ : TopologicalSpace β\ninst✝³ : PseudoMetrizableSpace β\ninst✝² : MeasurableSpace β\ninst✝¹ : BorelSpace β\nι : Type u_1\nμ : MeasureTheory.Measure α\nf : ι → α → β\ng : α → β\nu : Filter ι\nhu : NeBot u\ninst✝ : IsCount... | [
117,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean | collinear_insert_iff_of_mem_affineSpan | [
{
"state_after": "no goals",
"state_before": "k : Type u_2\nV : Type u_3\nP : Type u_1\nι : Type ?u.320461\ninst✝³ : DivisionRing k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\ns : Set P\np : P\nh : p ∈ affineSpan k s\n⊢ Collinear k (insert p s) ↔ Collinear k s",
"tactic": "rw... | [
552,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
550,
1
] |
Mathlib/Data/List/Rotate.lean | List.Nodup.rotate_congr | [
{
"state_after": "α : Type u\nl : List α\nhl : Nodup l\nhn : l ≠ []\ni j : ℕ\nh : rotate l i = rotate l j\nhi : i % length l < length l\n⊢ i % length l = j % length l",
"state_before": "α : Type u\nl : List α\nhl : Nodup l\nhn : l ≠ []\ni j : ℕ\nh : rotate l i = rotate l j\n⊢ i % length l = j % length l",
... | [
421,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
415,
1
] |
Mathlib/LinearAlgebra/StdBasis.lean | LinearMap.stdBasis_ne | [] | [
75,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/Algebra/Module/LinearMap.lean | LinearMap.coe_mul | [] | [
1044,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1043,
1
] |
Mathlib/Data/Fintype/Basic.lean | Function.Embedding.left_inv_of_invOfMemRange | [] | [
535,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
534,
1
] |
Mathlib/RingTheory/Localization/Basic.lean | IsLocalization.lift_unique | [] | [
572,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
568,
1
] |
Mathlib/Combinatorics/SimpleGraph/Basic.lean | SimpleGraph.iInf_adj | [
{
"state_after": "no goals",
"state_before": "ι : Sort u_1\n𝕜 : Type ?u.21433\nV : Type u\nW : Type v\nX : Type w\nG : SimpleGraph V\nG' : SimpleGraph W\na b c u v w : V\ne : Sym2 V\nf : ι → SimpleGraph V\n⊢ Adj (⨅ (i : ι), f i) a b ↔ (∀ (i : ι), Adj (f i) a b) ∧ a ≠ b",
"tactic": "simp [iInf]"
}
] | [
324,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
323,
1
] |
Mathlib/SetTheory/Ordinal/Topology.lean | Ordinal.mem_closure_iff_bsup | [
{
"state_after": "no goals",
"state_before": "s : Set Ordinal\na : Ordinal\n⊢ (∃ o, o ≠ 0 ∧ ∃ f, (∀ (x : Ordinal) (hx : x < o), f x hx ∈ s) ∧ bsup o f = a) ↔\n ∃ o _ho f, (∀ (i : Ordinal) (hi : i < o), f i hi ∈ s) ∧ bsup o f = a",
"tactic": "simp only [exists_prop]"
}
] | [
145,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
141,
1
] |
Mathlib/Order/Lattice.lean | sup_sup_distrib_left | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\ninst✝ : SemilatticeSup α\na✝ b✝ c✝ d a b c : α\n⊢ a ⊔ (b ⊔ c) = a ⊔ b ⊔ (a ⊔ c)",
"tactic": "rw [sup_sup_sup_comm, sup_idem]"
}
] | [
286,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
285,
1
] |
Mathlib/Data/Fintype/Card.lean | List.Nodup.length_le_card | [
{
"state_after": "no goals",
"state_before": "α✝ : Type ?u.13820\nβ : Type ?u.13823\nγ : Type ?u.13826\nα : Type u_1\ninst✝ : Fintype α\nl : List α\nh : Nodup l\n⊢ length l ≤ Fintype.card α",
"tactic": "classical exact List.toFinset_card_of_nodup h ▸ l.toFinset.card_le_univ"
},
{
"state_after": ... | [
456,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
454,
1
] |
Mathlib/Order/Filter/Pointwise.lean | Filter.mem_div | [] | [
441,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
440,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.