file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/Order/Filter/ModEq.lean | Nat.frequently_even | [
{
"state_after": "no goals",
"state_before": "⊢ ∃ᶠ (m : ℕ) in atTop, Even m",
"tactic": "simpa only [even_iff] using frequently_mod_eq zero_lt_two"
}
] | [
36,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
35,
1
] |
Mathlib/Algebra/Star/Module.lean | star_rat_cast_smul | [] | [
67,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
65,
1
] |
Mathlib/Data/Finset/Sups.lean | Finset.disjSups_empty_left | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝³ : DecidableEq α\ninst✝² : SemilatticeSup α\ninst✝¹ : OrderBot α\ninst✝ : DecidableRel Disjoint\ns s₁ s₂ t t₁ t₂ u : Finset α\na b c : α\n⊢ ∅ ○ t = ∅",
"tactic": "simp [disjSups]"
}
] | [
490,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
490,
1
] |
Mathlib/Combinatorics/SimpleGraph/Prod.lean | SimpleGraph.boxProd_adj | [] | [
58,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/SetTheory/Cardinal/Cofinality.lean | Ordinal.sup_lt_ord_lift | [] | [
358,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
356,
1
] |
Mathlib/LinearAlgebra/Prod.lean | Submodule.prod_eq_bot_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u\nK : Type u'\nM : Type v\nV : Type v'\nM₂ : Type w\nV₂ : Type w'\nM₃ : Type y\nV₃ : Type y'\nM₄ : Type z\nι : Type x\nM₅ : Type ?u.385373\nM₆ : Type ?u.385376\ninst✝⁴ : Semiring R\ninst✝³ : AddCommMonoid M\ninst✝² : AddCommMonoid M₂\ninst✝¹ : Module R... | [
728,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
726,
1
] |
Mathlib/Order/Hom/Lattice.lean | SupBotHom.symm_dual_comp | [] | [
1470,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1467,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.normalCore_eq_iSup | [] | [
2562,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2557,
1
] |
Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean | Complex.arg_conj | [
{
"state_after": "x : ℂ\n⊢ (if 0 ≤ x.re then -arcsin (x.im / ↑abs x)\n else if 0 ≤ -x.im then arcsin (x.im / ↑abs x) + π else arcsin (x.im / ↑abs x) - π) =\n if x.re < 0 ∧ x.im = 0 then π\n else\n -if 0 ≤ x.re then arcsin (x.im / ↑abs x)\n else if 0 ≤ x.im then -arcsin (x.im / ↑abs x) + π e... | [
319,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
305,
1
] |
Std/Data/List/Lemmas.lean | List.infix_iff_prefix_suffix | [] | [
1648,
60
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1646,
1
] |
Mathlib/Topology/Algebra/UniformGroup.lean | TendstoUniformly.div | [] | [
519,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
517,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Basic.lean | DifferentiableOn.eventually_differentiableAt | [] | [
536,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
534,
1
] |
Mathlib/Data/Quot.lean | Quotient.eq_mk_iff_out | [
{
"state_after": "α : Sort u_1\nβ : Sort ?u.34513\ns : Setoid α\nx : Quotient s\ny : α\n⊢ x = Quotient.mk s y ↔ Quotient.mk s (out x) = Quotient.mk s y",
"state_before": "α : Sort u_1\nβ : Sort ?u.34513\ns : Setoid α\nx : Quotient s\ny : α\n⊢ x = Quotient.mk s y ↔ out x ≈ y",
"tactic": "refine' Iff.tran... | [
392,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
389,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.subset_zero | [] | [
432,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
431,
1
] |
Mathlib/Geometry/Manifold/LocalInvariantProperties.lean | StructureGroupoid.LocalInvariantProp.liftPropOn_symm_of_mem_maximalAtlas | [
{
"state_after": "H : Type u_1\nM : Type u_2\nH' : Type ?u.58167\nM' : Type ?u.58170\nX : Type ?u.58173\ninst✝⁷ : TopologicalSpace H\ninst✝⁶ : TopologicalSpace M\ninst✝⁵ : ChartedSpace H M\ninst✝⁴ : TopologicalSpace H'\ninst✝³ : TopologicalSpace M'\ninst✝² : ChartedSpace H' M'\ninst✝¹ : TopologicalSpace X\nG : ... | [
509,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
504,
1
] |
Mathlib/Logic/Equiv/Basic.lean | Equiv.sigmaCongrRight_sigmaEquivProd | [
{
"state_after": "case H.mk\nα₁ : Type u_3\nβ₁ : Type u_2\nβ₂ : Type u_1\ne : α₁ → β₁ ≃ β₂\na : α₁\nb : β₁\n⊢ ↑((sigmaCongrRight e).trans (sigmaEquivProd α₁ β₂)) { fst := a, snd := b } =\n ↑((sigmaEquivProd α₁ β₁).trans (prodCongrRight e)) { fst := a, snd := b }",
"state_before": "α₁ : Type u_3\nβ₁ : Typ... | [
760,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
756,
1
] |
Mathlib/CategoryTheory/DiscreteCategory.lean | CategoryTheory.Discrete.functor_map_id | [
{
"state_after": "J : Type v₁\nC : Type u₂\ninst✝ : Category C\nF : Discrete J ⥤ C\nj : Discrete J\nf : j ⟶ j\nh : f = 𝟙 j\n⊢ F.map f = 𝟙 (F.obj j)",
"state_before": "J : Type v₁\nC : Type u₂\ninst✝ : Category C\nF : Discrete J ⥤ C\nj : Discrete J\nf : j ⟶ j\n⊢ F.map f = 𝟙 (F.obj j)",
"tactic": "have... | [
297,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
293,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.mem_top_iff_forall | [] | [
456,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
455,
1
] |
Mathlib/MeasureTheory/Function/UniformIntegrable.lean | MeasureTheory.Memℒp.integral_indicator_norm_ge_le | [
{
"state_after": "α : Type u_2\nβ : Type u_1\nι : Type ?u.20636\nm : MeasurableSpace α\nμ : Measure α\ninst✝ : NormedAddCommGroup β\np : ℝ≥0∞\nf : α → β\nhf : Memℒp f 1\nhmeas : StronglyMeasurable f\nε : ℝ\nhε : 0 < ε\nhtendsto : ∀ᵐ (x : α) ∂μ, Tendsto (fun M => Set.indicator {x | ↑M ≤ ↑‖f x‖₊} f x) atTop (𝓝 0... | [
211,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
179,
1
] |
Std/Data/List/Lemmas.lean | List.nil_prefix | [] | [
1572,
55
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1572,
1
] |
Mathlib/Analysis/Calculus/Taylor.lean | exists_taylor_mean_remainder_bound | [
{
"state_after": "case inl\n𝕜 : Type ?u.368580\nE : Type u_1\nF : Type ?u.368586\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedSpace ℝ E\nf : ℝ → E\na : ℝ\nn : ℕ\nhab : a ≤ a\nhf : ContDiffOn ℝ (↑n + 1) f (Icc a a)\n⊢ ∃ C, ∀ (x : ℝ), x ∈ Icc a a → ‖f x - taylorWithinEval f n (Icc a a) a x‖ ≤ C * (x - a) ^ (n +... | [
390,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
377,
1
] |
Mathlib/MeasureTheory/Function/AEEqFun.lean | MeasureTheory.AEEqFun.pow_toGerm | [] | [
687,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
686,
1
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | intervalIntegral.integral_comp_sub_mul | [
{
"state_after": "ι : Type ?u.14923117\n𝕜 : Type ?u.14923120\nE : Type u_1\nF : Type ?u.14923126\nA : Type ?u.14923129\ninst✝² : NormedAddCommGroup E\ninst✝¹ : CompleteSpace E\ninst✝ : NormedSpace ℝ E\na b c d✝ : ℝ\nf : ℝ → E\nhc : c ≠ 0\nd : ℝ\n⊢ (∫ (x : ℝ) in a..b, f (d + -c * x)) = c⁻¹ • ∫ (x : ℝ) in d + -c... | [
817,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
813,
1
] |
Mathlib/CategoryTheory/Sites/Whiskering.lean | CategoryTheory.GrothendieckTopology.Cover.multicospanComp_hom_app_left | [] | [
80,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
78,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean | CategoryTheory.Limits.coprod.map_id_comp | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝³ : Category C\nX✝ Y✝ X Y Z W : C\nf : X ⟶ Y\ng : Y ⟶ Z\ninst✝² : HasBinaryCoproduct W X\ninst✝¹ : HasBinaryCoproduct W Y\ninst✝ : HasBinaryCoproduct W Z\n⊢ map (𝟙 W) (f ≫ g) = map (𝟙 W) f ≫ map (𝟙 W) g",
"tactic": "simp"
}
] | [
904,
82
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
902,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean | CategoryTheory.Limits.biprod.conePointUniqueUpToIso_inv | [
{
"state_after": "case refine'_1\nJ : Type w\nC : Type u\ninst✝² : Category C\ninst✝¹ : HasZeroMorphisms C\nP Q X Y : C\ninst✝ : HasBinaryBiproduct X Y\nb : BinaryBicone X Y\nhb : BinaryBicone.IsBilimit b\nj : Discrete WalkingPair\n⊢ (inl ≫ (IsLimit.conePointUniqueUpToIso hb.isLimit (BinaryBiproduct.isLimit X Y... | [
1560,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1552,
1
] |
Std/Data/Int/Lemmas.lean | Int.natAbs_eq_iff | [
{
"state_after": "no goals",
"state_before": "a : Int\nn : Nat\n⊢ natAbs a = n ↔ a = ↑n ∨ a = -↑n",
"tactic": "rw [← Int.natAbs_eq_natAbs_iff, Int.natAbs_ofNat]"
}
] | [
191,
52
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
190,
1
] |
Mathlib/GroupTheory/Perm/Cycle/Basic.lean | Equiv.Perm.isCycle_cycleOf | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.2439325\nα : Type u_1\nβ : Type ?u.2439331\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf✝ g : Perm α\nx y : α\nf : Perm α\nhx : ↑f x ≠ x\n⊢ ↑(cycleOf f x) x ≠ x",
"tactic": "rwa [SameCycle.rfl.cycleOf_apply]"
},
{
"state_after": "no goals... | [
1092,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1083,
1
] |
Mathlib/Algebra/Homology/Exact.lean | CategoryTheory.Preadditive.exact_of_iso_of_exact | [
{
"state_after": "V : Type u\ninst✝⁵ : Category V\ninst✝⁴ : HasImages V\ninst✝³ : HasZeroObject V\ninst✝² : Preadditive V\ninst✝¹ : HasKernels V\ninst✝ : HasCokernels V\nA₁ B₁ C₁ A₂ B₂ C₂ : V\nf₁ : A₁ ⟶ B₁\ng₁ : B₁ ⟶ C₁\nf₂ : A₂ ⟶ B₂\ng₂ : B₂ ⟶ C₂\nα : Arrow.mk f₁ ≅ Arrow.mk f₂\nβ : Arrow.mk g₁ ≅ Arrow.mk g₂\np... | [
111,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.ConnectedComponent.exact | [] | [
2005,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2003,
11
] |
Mathlib/Topology/UniformSpace/Basic.lean | iInf_uniformity | [] | [
1232,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1231,
1
] |
Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean | mul_eq_one_iff_inv_eq₀ | [] | [
64,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
63,
1
] |
Mathlib/MeasureTheory/Group/Measure.lean | MeasureTheory.map_div_right_ae | [] | [
315,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
313,
1
] |
Mathlib/Algebra/Order/Ring/Defs.lean | StrictAnti.mul_const | [] | [
598,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
597,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.sInter_prod | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.239402\nι : Sort ?u.239405\nι' : Sort ?u.239408\nι₂ : Sort ?u.239411\nκ : ι → Sort ?u.239416\nκ₁ : ι → Sort ?u.239421\nκ₂ : ι → Sort ?u.239426\nκ' : ι' → Sort ?u.239431\nS : Set (Set α)\nhS : Set.Nonempty S\nt : Set β\n⊢ (⋂ (r : Set α × Set β) (_ : r ∈ S... | [
1845,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1842,
1
] |
Mathlib/Data/List/Perm.lean | List.Perm.symm | [] | [
64,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
11
] |
Mathlib/Order/GaloisConnection.lean | GaloisConnection.u_iInf₂ | [] | [
304,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
303,
1
] |
Mathlib/Analysis/LocallyConvex/Bounded.lean | Filter.HasBasis.isVonNBounded_basis_iff | [
{
"state_after": "𝕜 : Type u_3\n𝕜' : Type ?u.978\nE : Type u_1\nE' : Type ?u.984\nF : Type ?u.987\nι : Type u_2\ninst✝³ : SeminormedRing 𝕜\ninst✝² : SMul 𝕜 E\ninst✝¹ : Zero E\ninst✝ : TopologicalSpace E\nq : ι → Prop\ns : ι → Set E\nA : Set E\nh : HasBasis (𝓝 0) q s\nhA : ∀ (i : ι), q i → Absorbs 𝕜 (s i) ... | [
88,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
84,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | Subalgebra.zsmul_mem | [] | [
200,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
198,
11
] |
Std/Data/List/Lemmas.lean | List.getLast_eq_get | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\na : α\nh : [a] ≠ []\n⊢ getLast [a] h = get [a] { val := length [a] - 1, isLt := (_ : length [a] - 1 < length [a]) }",
"tactic": "rw [getLast_singleton, get_singleton]"
},
{
"state_after": "α : Type u_1\na b : α\nl : List α\nh : a :: b :... | [
629,
99
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
625,
1
] |
Mathlib/Topology/UniformSpace/UniformConvergence.lean | TendstoLocallyUniformlyOn.comp | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nι : Type x\ninst✝² : UniformSpace β\nF : ι → α → β\nf : α → β\ns s' : Set α\nx✝ : α\np : Filter ι\np' : Filter α\ng✝ : ι → α\ninst✝¹ : TopologicalSpace α\ninst✝ : TopologicalSpace γ\nt : Set γ\nh : TendstoLocallyUniformlyOn F f p s\ng : γ → α\nhg : MapsTo g ... | [
721,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
714,
1
] |
Mathlib/Data/Polynomial/FieldDivision.lean | Polynomial.divByMonic_add_X_sub_C_mul_derivate_divByMonic_eq_derivative | [
{
"state_after": "R : Type u\nS : Type v\nk : Type y\nA : Type z\na✝ b : R\nn : ℕ\ninst✝¹ : Field R\np q : R[X]\nK : Type u_1\ninst✝ : Field K\nf : K[X]\na : K\nkey : ↑derivative ((X - ↑C a) * (f /ₘ (X - ↑C a))) = ↑derivative (f - f %ₘ (X - ↑C a))\n⊢ f /ₘ (X - ↑C a) + (X - ↑C a) * ↑derivative (f /ₘ (X - ↑C a)) ... | [
518,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
510,
1
] |
Std/Data/Int/Lemmas.lean | Int.lt_add_of_neg_add_lt_left | [
{
"state_after": "a b c : Int\nh : a + -b < c\n⊢ a < b + c",
"state_before": "a b c : Int\nh : -b + a < c\n⊢ a < b + c",
"tactic": "rw [Int.add_comm] at h"
},
{
"state_after": "no goals",
"state_before": "a b c : Int\nh : a + -b < c\n⊢ a < b + c",
"tactic": "exact Int.lt_add_of_sub_left_... | [
1089,
36
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
1087,
11
] |
Mathlib/GroupTheory/GroupAction/Quotient.lean | MulAction.Quotient.coe_smul_out' | [] | [
120,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/Topology/Order/Basic.lean | Dense.exists_countable_dense_subset_no_bot_top | [
{
"state_after": "case intro.intro.intro\nα : Type u\nβ : Type v\nγ : Type w\ninst✝⁵ : TopologicalSpace α\ninst✝⁴ : LinearOrder α\ninst✝³ : OrderTopology α\ninst✝² : DenselyOrdered α\na b : α\ns✝ : Set α\nl : Filter β\nf : α → β\ninst✝¹ : Nontrivial α\ns : Set α\ninst✝ : SeparableSpace ↑s\nhs : Dense s\nt : Set... | [
2603,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2594,
1
] |
Mathlib/Data/Rat/Defs.lean | Rat.zero_mk | [
{
"state_after": "no goals",
"state_before": "d : ℕ\nh : d ≠ 0\nw : Nat.coprime (Int.natAbs 0) d\n⊢ mk' 0 d = 0",
"tactic": "congr"
}
] | [
75,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/Order/Monotone/Basic.lean | Antitone.prod_map | [] | [
1161,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1160,
1
] |
Mathlib/Data/Finsupp/Order.lean | Finsupp.le_iff | [] | [
164,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
1
] |
Mathlib/Algebra/Order/Monoid/WithTop.lean | WithBot.add_eq_coe | [] | [
601,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
600,
1
] |
Std/Data/List/Lemmas.lean | List.getLast_concat | [] | [
308,
41
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
307,
1
] |
Mathlib/Topology/UnitInterval.lean | iccHomeoI_symm_apply_coe | [] | [
243,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
241,
1
] |
Mathlib/Data/Finset/Pointwise.lean | Finset.zero_div_subset | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.657730\nα : Type u_1\nβ : Type ?u.657736\nγ : Type ?u.657739\ninst✝² : DecidableEq α\ninst✝¹ : DecidableEq β\ninst✝ : GroupWithZero α\ns✝ t s : Finset α\n⊢ 0 / s ⊆ 0",
"tactic": "simp [subset_iff, mem_div]"
}
] | [
1192,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1192,
1
] |
Mathlib/Data/Nat/Factorial/Cast.lean | Nat.cast_factorial | [
{
"state_after": "no goals",
"state_before": "S : Type u_1\ninst✝ : Semiring S\na b : ℕ\n⊢ ↑a ! = Polynomial.eval 1 (pochhammer S a)",
"tactic": "rw [← zero_ascFactorial, cast_ascFactorial, cast_zero, zero_add]"
}
] | [
54,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Order/Disjoint.lean | Disjoint.inf_left' | [] | [
159,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/NumberTheory/ArithmeticFunction.lean | Nat.ArithmeticFunction.zeta_pmul | [
{
"state_after": "case h\nR : Type u_1\ninst✝ : NonAssocSemiring R\nf : ArithmeticFunction R\nx : ℕ\n⊢ ↑(pmul (↑ζ) f) x = ↑f x",
"state_before": "R : Type u_1\ninst✝ : NonAssocSemiring R\nf : ArithmeticFunction R\n⊢ pmul (↑ζ) f = f",
"tactic": "ext x"
},
{
"state_after": "no goals",
"state_b... | [
534,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
532,
1
] |
Mathlib/RingTheory/Ideal/QuotientOperations.lean | Ideal.KerLift.map_smul | [
{
"state_after": "case intro\nR : Type u\nS : Type v\nF : Type w\ninst✝⁸ : CommRing R\ninst✝⁷ : CommRing S\nR₁ : Type u_1\nR₂ : Type ?u.775415\nA : Type u_2\nB : Type u_3\ninst✝⁶ : CommSemiring R₁\ninst✝⁵ : CommSemiring R₂\ninst✝⁴ : CommRing A\ninst✝³ : CommRing B\ninst✝² : Algebra R₁ A\ninst✝¹ : Algebra R₂ A\n... | [
270,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
267,
1
] |
Mathlib/Data/Analysis/Topology.lean | Ctop.toTopsp_isTopologicalBasis | [] | [
97,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean | MeasureTheory.Lp.simpleFunc.sub_toSimpleFunc | [
{
"state_after": "case h\nα : Type u_1\nβ : Type ?u.1588527\nι : Type ?u.1588530\nE : Type u_2\nF : Type ?u.1588536\n𝕜 : Type ?u.1588539\ninst✝² : MeasurableSpace α\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedAddCommGroup F\np : ℝ≥0∞\nμ : Measure α\nf g : { x // x ∈ simpleFunc E p μ }\na✝ : α\n⊢ ↑(toSimpleFu... | [
672,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
667,
1
] |
Mathlib/Algebra/Star/StarAlgHom.lean | StarAlgEquiv.symm_mk | [] | [
859,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
854,
1
] |
Mathlib/Control/Traversable/Equiv.lean | Equiv.naturality | [
{
"state_after": "no goals",
"state_before": "t t' : Type u → Type u\neqv : (α : Type u) → t α ≃ t' α\ninst✝⁵ : Traversable t\ninst✝⁴ : IsLawfulTraversable t\nF G : Type u → Type u\ninst✝³ : Applicative F\ninst✝² : Applicative G\ninst✝¹ : LawfulApplicative F\ninst✝ : LawfulApplicative G\nη : ApplicativeTran... | [
155,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
153,
11
] |
Mathlib/Algebra/Order/Field/Basic.lean | lt_of_neg_of_one_div_lt_one_div | [] | [
879,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
878,
1
] |
Mathlib/Algebra/Hom/Group.lean | coe_invMonoidHom | [] | [
985,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
985,
1
] |
Mathlib/CategoryTheory/Preadditive/Biproducts.lean | CategoryTheory.Limits.biproduct.matrix_desc | [
{
"state_after": "case w\nC : Type u\ninst✝⁵ : Category C\ninst✝⁴ : Preadditive C\nJ : Type\ninst✝³ : Fintype J\nf✝ : J → C\ninst✝² : HasBiproduct f✝\nK : Type\ninst✝¹ : Fintype K\ninst✝ : HasFiniteBiproducts C\nf : J → C\ng : K → C\nm : (j : J) → (k : K) → f j ⟶ g k\nP : C\nx : (k : K) → g k ⟶ P\nj✝ : J\n⊢ ι (... | [
246,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
242,
1
] |
Mathlib/Data/FunLike/Fintype.lean | FunLike.finite' | [] | [
79,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
78,
1
] |
Mathlib/Data/Set/Basic.lean | Set.mem_dite_empty_right | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\na b : α\ns s₁ s₂ t✝ t₁ t₂ u : Set α\np : Prop\ninst✝ : Decidable p\nt : p → Set α\nx : α\n⊢ (∀ (h : p), x ∈ t h) ∧ p ↔ ∃ h, x ∈ t h",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\na b : α\ns s₁ s₂ t✝ t₁ t₂ u : Set α\np : Pr... | [
2215,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2212,
1
] |
Mathlib/Data/Int/Div.lean | Int.ofNat_add_negSucc_of_ge | [
{
"state_after": "no goals",
"state_before": "m n : ℕ\nh : Nat.succ n ≤ m\n⊢ ofNat m + -[n+1] = ofNat (m - Nat.succ n)",
"tactic": "rw [negSucc_eq, ofNat_eq_cast, ofNat_eq_cast, ← Nat.cast_one, ← Nat.cast_add,\n ← sub_eq_add_neg, ← Nat.cast_sub h]"
}
] | [
56,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Algebra/BigOperators/Finprod.lean | single_le_finprod | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type ?u.380672\nι : Type ?u.380675\nG : Type ?u.380678\nM✝ : Type ?u.380681\nN : Type ?u.380684\ninst✝² : CommMonoid M✝\ninst✝¹ : CommMonoid N\nf✝ g : α → M✝\na b : α\ns t : Set α\nM : Type u_1\ninst✝ : OrderedCommMonoid M\ni : α\nf : α → M\nhf... | [
1152,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1146,
1
] |
Mathlib/Data/Set/Pointwise/Interval.lean | Set.image_sub_const_Iic | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : OrderedAddCommGroup α\na b c : α\n⊢ (fun x => x - a) '' Iic b = Iic (b - a)",
"tactic": "simp [sub_eq_neg_add]"
}
] | [
378,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/Data/List/BigOperators/Basic.lean | List.prod_eq_zero_iff | [
{
"state_after": "case nil\nι : Type ?u.109197\nα : Type ?u.109200\nM : Type ?u.109203\nN : Type ?u.109206\nP : Type ?u.109209\nM₀ : Type u_1\nG : Type ?u.109215\nR : Type ?u.109218\ninst✝² : MonoidWithZero M₀\ninst✝¹ : Nontrivial M₀\ninst✝ : NoZeroDivisors M₀\n⊢ prod [] = 0 ↔ 0 ∈ []\n\ncase cons\nι : Type ?u.1... | [
399,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
395,
1
] |
Mathlib/GroupTheory/Congruence.lean | Con.comap_rel | [] | [
679,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
677,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Submodule.smul_inf_le | [] | [
225,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/NumberTheory/RamificationInertia.lean | Ideal.FinrankQuotientMap.span_eq_top | [
{
"state_after": "R : Type u\ninst✝²⁶ : CommRing R\nS : Type v\ninst✝²⁵ : CommRing S\nf : R →+* S\np : Ideal R\nP : Ideal S\ninst✝²⁴ : Algebra R S\nK : Type u_1\ninst✝²³ : Field K\ninst✝²² : Algebra R K\nhRK : IsFractionRing R K\nL : Type u_2\ninst✝²¹ : Field L\ninst✝²⁰ : Algebra S L\ninst✝¹⁹ : IsFractionRing S... | [
397,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
304,
1
] |
Mathlib/MeasureTheory/Measure/NullMeasurable.lean | MeasureTheory.measure_iUnion | [
{
"state_after": "ι : Type u_2\nα : Type u_1\nβ : Type ?u.8694\nγ : Type ?u.8697\nm0✝ : MeasurableSpace α\nμ✝ : Measure α\ns t : Set α\nm0 : MeasurableSpace α\nμ : Measure α\ninst✝ : Countable ι\nf : ι → Set α\nhn : Pairwise (Disjoint on f)\nh : ∀ (i : ι), MeasurableSet (f i)\n⊢ (∑' (i : ι), extend (fun t _ht =... | [
282,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
275,
1
] |
Mathlib/Data/Finset/Basic.lean | Finset.piecewise_idem_right | [] | [
2529,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2527,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Comp.lean | HasFDerivWithinAt.iterate | [
{
"state_after": "𝕜 : Type u_1\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type ?u.144903\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type ?u.144998\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\nG' : Type ?u.1... | [
243,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
237,
11
] |
Mathlib/Analysis/Normed/Group/Basic.lean | controlled_prod_of_mem_closure | [
{
"state_after": "case intro.intro\n𝓕 : Type ?u.1017512\n𝕜 : Type ?u.1017515\nα : Type ?u.1017518\nι : Type ?u.1017521\nκ : Type ?u.1017524\nE : Type u_1\nF : Type ?u.1017530\nG : Type ?u.1017533\ninst✝¹ : SeminormedCommGroup E\ninst✝ : SeminormedCommGroup F\na a₁ a₂ b✝ b₁ b₂ : E\nr r₁ r₂ : ℝ\ns : Subgroup E\... | [
1643,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1614,
1
] |
Mathlib/GroupTheory/OrderOfElement.lean | exists_pow_eq_one | [
{
"state_after": "G : Type u\nA : Type v\nx✝ y : G\na b : A\nn m : ℕ\ninst✝² : LeftCancelMonoid G\ninst✝¹ : AddLeftCancelMonoid A\ninst✝ : Finite G\nx : G\nH : Set.Finite Set.univ\n⊢ IsOfFinOrder x",
"state_before": "G : Type u\nA : Type v\nx✝ y : G\na b : A\nn m : ℕ\ninst✝² : LeftCancelMonoid G\ninst✝¹ : A... | [
695,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
692,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.Integrable.neg_part | [] | [
1011,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1009,
1
] |
Mathlib/Data/Matrix/Hadamard.lean | Matrix.zero_hadamard | [] | [
111,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/CategoryTheory/Whiskering.lean | CategoryTheory.whiskerLeft_id' | [] | [
128,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/Order/UpperLower/Basic.lean | subset_upperClosure | [] | [
1293,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1293,
1
] |
Mathlib/Topology/Separation.lean | RegularSpace.ofExistsMemNhdsIsClosedSubset | [] | [
1517,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1515,
1
] |
Mathlib/Topology/Separation.lean | nhds_eq_nhds_iff | [] | [
227,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
226,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.spanningHom.injective | [] | [
755,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
754,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.comap_eval_neBot_iff' | [
{
"state_after": "case inl\nα✝ : Type u\nβ : Type v\nγ : Type w\nδ : Type ?u.269920\nι✝ : Sort x\nf✝ f₁ f₂ : Filter α✝\ng g₁ g₂ : Filter β\nm : α✝ → β\nm' : β → γ\ns : Set α✝\nt : Set β\nι : Type u_1\nα : ι → Type u_2\ni : ι\nf : Filter (α i)\nH : IsEmpty ((j : ι) → α j)\n⊢ NeBot (comap (eval i) f) ↔ (∀ (j : ι)... | [
2408,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2402,
1
] |
Mathlib/Data/Set/Intervals/WithBotTop.lean | WithTop.image_coe_Iic | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : PartialOrder α\na b : α\n⊢ some '' Iic a = Iic ↑a",
"tactic": "rw [← preimage_coe_Iic, image_preimage_eq_inter_range, range_coe,\n inter_eq_self_of_subset_left (Iic_subset_Iio.2 <| coe_lt_top a)]"
}
] | [
105,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
103,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.iInter_comm | [] | [
789,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
788,
1
] |
Mathlib/LinearAlgebra/Finsupp.lean | Finsupp.totalOn_range | [
{
"state_after": "α : Type u_1\nM : Type u_2\nN : Type ?u.439719\nP : Type ?u.439722\nR : Type u_3\nS : Type ?u.439728\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... | [
740,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
736,
1
] |
Mathlib/MeasureTheory/Measure/NullMeasurable.lean | MeasureTheory.measure_union₀ | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.19593\nα : Type u_1\nβ : Type ?u.19599\nγ : Type ?u.19602\nm0 : MeasurableSpace α\nμ : Measure α\ns t : Set α\nht : NullMeasurableSet t\nhd : AEDisjoint μ s t\n⊢ ↑↑μ (s ∪ t) = ↑↑μ s + ↑↑μ t",
"tactic": "rw [← measure_union_add_inter₀ s ht, hd, ad... | [
336,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
335,
1
] |
Mathlib/MeasureTheory/Constructions/Prod/Basic.lean | MeasureTheory.Measure.quasiMeasurePreserving_fst | [
{
"state_after": "α : Type u_2\nα' : Type ?u.4451554\nβ : Type u_1\nβ' : Type ?u.4451560\nγ : Type ?u.4451563\nE : Type ?u.4451566\ninst✝⁶ : MeasurableSpace α\ninst✝⁵ : MeasurableSpace α'\ninst✝⁴ : MeasurableSpace β\ninst✝³ : MeasurableSpace β'\ninst✝² : MeasurableSpace γ\nμ μ' : Measure α\nν ν' : Measure β\nτ ... | [
470,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
468,
1
] |
Mathlib/Data/Setoid/Basic.lean | Setoid.eqvGen_of_setoid | [
{
"state_after": "α : Type u_1\nβ : Type ?u.10362\nr : Setoid α\n⊢ sInf {s | ∀ ⦃x y : α⦄, Setoid.r x y → Rel s x y} ≤ r",
"state_before": "α : Type u_1\nβ : Type ?u.10362\nr : Setoid α\n⊢ EqvGen.Setoid Setoid.r ≤ r",
"tactic": "rw [eqvGen_eq]"
},
{
"state_after": "no goals",
"state_before": ... | [
250,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
249,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | Continuous.fderiv | [] | [
1073,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1070,
1
] |
Mathlib/Data/UnionFind.lean | UFModel.Agrees.mk' | [
{
"state_after": "case refl\nα : Type u_1\nβ : Sort u_2\narr : Array α\nf : α → β\ng : Fin (Array.size arr) → β\nH : ∀ (i : ℕ) (h₁ h₂ : i < Array.size arr), f (Array.get arr { val := i, isLt := h₁ }) = g { val := i, isLt := h₂ }\n⊢ Agrees arr f g",
"state_before": "α : Type u_1\nβ : Sort u_2\narr : Array α\... | [
78,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean | PrimeSpectrum.basicOpen_one | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\ninst✝¹ : CommRing R\ninst✝ : CommRing S\n⊢ ↑(basicOpen 1) = ↑⊤",
"tactic": "simp"
}
] | [
788,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
787,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | MonoidHom.mem_ker | [] | [
2767,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2766,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean | HasFDerivWithinAt.sinh | [] | [
1135,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1133,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.Valid'.balanceR | [
{
"state_after": "α : Type u_1\ninst✝ : Preorder α\nl : Ordnode α\nx : α\nr : Ordnode α\no₁ : WithBot α\no₂ : WithTop α\nhl : Valid' o₁ l ↑x\nhr : Valid' (↑x) r o₂\nH : (∃ l', Raised (size l) l' ∧ BalancedSz l' (size r)) ∨ ∃ r', Raised r' (size r) ∧ BalancedSz (size l) r'\n⊢ Valid' o₂ (Ordnode.balanceL (Ordnode... | [
1386,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1382,
1
] |
Mathlib/LinearAlgebra/AdicCompletion.lean | Hausdorffification.induction_on | [] | [
146,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/Data/Num/Lemmas.lean | Num.size_to_nat | [] | [
754,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
752,
1
] |
Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean | MvQPF.Fix.ind_rec | [
{
"state_after": "case mk\nn : ℕ\nF : TypeVec (n + 1) → Type u\ninst✝ : MvFunctor F\nq : MvQPF F\nα : TypeVec n\nβ : Type u\ng₁ g₂ : Fix F α → β\nh : ∀ (x : F (α ::: Fix F α)), (TypeVec.id ::: g₁) <$$> x = (TypeVec.id ::: g₂) <$$> x → g₁ (mk x) = g₂ (mk x)\n⊢ ∀ (a : MvPFunctor.W (P F) α), g₁ (Quot.mk Setoid.r a... | [
279,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.