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/Basic.lean | Filter.EventuallyEq.const_smul | [] | [
1540,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1538,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/SubboxInduction.lean | BoxIntegral.Prepartition.isHenstock_toSubordinate | [] | [
189,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/RingTheory/Polynomial/Content.lean | Polynomial.content_eq_gcd_range_succ | [] | [
204,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
202,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | norm_le_norm_add_norm_div' | [
{
"state_after": "𝓕 : Type ?u.85510\n𝕜 : Type ?u.85513\nα : Type ?u.85516\nι : Type ?u.85519\nκ : Type ?u.85522\nE : Type u_1\nF : Type ?u.85528\nG : Type ?u.85531\ninst✝² : SeminormedGroup E\ninst✝¹ : SeminormedGroup F\ninst✝ : SeminormedGroup G\ns : Set E\na a₁ a₂ b b₁ b₂ : E\nr r₁ r₂ : ℝ\nu v : E\n⊢ ‖u‖ ≤ ... | [
580,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
577,
1
] |
Mathlib/Topology/Basic.lean | tendsto_inf_principal_nhds_iff_of_forall_eq | [
{
"state_after": "α : Type u\nβ : Type v\nι : Sort w\na✝ : α\ns✝ s₁ s₂ t : Set α\np p₁ p₂ : α → Prop\ninst✝ : TopologicalSpace α\nf : β → α\nl : Filter β\ns : Set β\na : α\nh : ∀ (x : β), ¬x ∈ s → f x = a\n⊢ l ⊓ 𝓟 s ≤ comap f (𝓝 a) ↔ l ≤ comap f (𝓝 a)",
"state_before": "α : Type u\nβ : Type v\nι : Sort w... | [
1480,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1469,
1
] |
Mathlib/LinearAlgebra/LinearIndependent.lean | exists_maximal_independent | [
{
"state_after": "case intro.intro\nι : Type u'\nι' : Type ?u.511300\nR : Type u_1\nK : Type ?u.511306\nM : Type u_2\nM' : Type ?u.511312\nM'' : Type ?u.511315\nV : Type u\nV' : Type ?u.511320\nv : ι → M\ninst✝⁶ : Ring R\ninst✝⁵ : AddCommGroup M\ninst✝⁴ : AddCommGroup M'\ninst✝³ : AddCommGroup M''\ninst✝² : Mod... | [
929,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
897,
1
] |
Mathlib/Order/UpperLower/Basic.lean | UpperSet.coe_eq_empty | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.46281\nγ : Type ?u.46284\nι : Sort ?u.46287\nκ : ι → Sort ?u.46292\ninst✝ : LE α\nS : Set (UpperSet α)\ns t : UpperSet α\na : α\n⊢ ↑s = ∅ ↔ s = ⊤",
"tactic": "simp [SetLike.ext'_iff]"
}
] | [
529,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
529,
1
] |
Std/Data/Nat/Lemmas.lean | Nat.sub_eq_iff_eq_add | [
{
"state_after": "no goals",
"state_before": "a b c : Nat\nab : b ≤ a\nc_eq : a - b = c\n⊢ a = c + b",
"tactic": "rw [c_eq.symm, Nat.sub_add_cancel ab]"
},
{
"state_after": "no goals",
"state_before": "a b c : Nat\nab : b ≤ a\na_eq : a = c + b\n⊢ a - b = c",
"tactic": "rw [a_eq, Nat.add_... | [
163,
49
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
161,
11
] |
Mathlib/Dynamics/Ergodic/Conservative.lean | MeasureTheory.Conservative.frequently_measure_inter_ne_zero | [
{
"state_after": "ι : Type ?u.54331\nα : Type u_1\ninst✝ : MeasurableSpace α\nf : α → α\ns : Set α\nμ : Measure α\nhf : Conservative f μ\nhs : MeasurableSet s\nh0 : ↑↑μ s ≠ 0\nH : ¬∃ᶠ (m : ℕ) in atTop, ↑↑μ (s ∩ f^[m] ⁻¹' s) ≠ 0\n⊢ False",
"state_before": "ι : Type ?u.54331\nα : Type u_1\ninst✝ : MeasurableS... | [
106,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
83,
1
] |
Mathlib/RingTheory/Localization/Basic.lean | IsLocalization.sec_fst_ne_zero | [
{
"state_after": "R : Type u_1\ninst✝⁶ : CommRing R\nM : Submonoid R\nS : Type u_2\ninst✝⁵ : CommRing S\ninst✝⁴ : Algebra R S\nP : Type ?u.3066574\ninst✝³ : CommRing P\nK : Type ?u.3066580\ninst✝² : IsLocalization M S\ninst✝¹ : Nontrivial R\ninst✝ : NoZeroDivisors S\nhM : M ≤ nonZeroDivisors R\nx : S\nhx : x ≠ ... | [
1197,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1191,
1
] |
Mathlib/Data/Set/Basic.lean | Set.mem_sep_iff | [] | [
1417,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1416,
1
] |
Mathlib/Topology/Algebra/UniformGroup.lean | UniformGroup.ext_iff | [] | [
303,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
300,
1
] |
Mathlib/Algebra/Star/Pointwise.lean | Set.compl_star | [] | [
97,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
97,
1
] |
Mathlib/Data/Set/Finite.lean | Set.Finite.inter_of_right | [
{
"state_after": "case intro\nα : Type u\nβ : Type v\nι : Sort w\nγ : Type x\ns t : Set α\na✝ : Fintype ↑s\n⊢ Set.Finite (t ∩ s)",
"state_before": "α : Type u\nβ : Type v\nι : Sort w\nγ : Type x\ns : Set α\nhs : Set.Finite s\nt : Set α\n⊢ Set.Finite (t ∩ s)",
"tactic": "cases hs"
},
{
"state_aft... | [
749,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
747,
1
] |
Mathlib/Order/Bounds/Basic.lean | not_bddAbove_iff | [
{
"state_after": "no goals",
"state_before": "α✝ : Type u\nβ : Type v\nγ : Type w\nι : Sort x\ninst✝² : Preorder α✝\ninst✝¹ : Preorder β\ns✝ t : Set α✝\na b : α✝\nα : Type u_1\ninst✝ : LinearOrder α\ns : Set α\n⊢ ¬BddAbove s ↔ ∀ (x : α), ∃ y, y ∈ s ∧ x < y",
"tactic": "simp only [not_bddAbove_iff', not_... | [
136,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
134,
1
] |
Mathlib/Data/Set/Basic.lean | Set.inter_subset_inter | [] | [
1011,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1010,
1
] |
Mathlib/GroupTheory/CommutingProbability.lean | Subgroup.commProb_quotient_le | [
{
"state_after": "M : Type ?u.28957\ninst✝⁵ : Mul M\ninst✝⁴ : Finite M\nG : Type u_1\ninst✝³ : Group G\ninst✝² : Finite G\ninst✝¹ : Group G\nH : Subgroup G\ninst✝ : Normal H\n⊢ Nat.card (ConjClasses (G ⧸ H)) ≤ Nat.card (ConjClasses G)\n\ncase h\nM : Type ?u.28957\ninst✝⁵ : Mul M\ninst✝⁴ : Finite M\nG : Type u_1... | [
118,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
1
] |
Mathlib/Topology/VectorBundle/Basic.lean | Trivialization.symmL_continuousLinearMapAt | [] | [
461,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
459,
1
] |
Mathlib/Data/List/Cycle.lean | List.prev_getLast_cons' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : DecidableEq α\nl : List α\nx y : α\nhxy : x ∈ y :: l\nhx : x = y\n⊢ prev (y :: l) x hxy = getLast (y :: l) (_ : y :: l ≠ [])",
"tactic": "cases l <;> simp [prev, hx]"
}
] | [
210,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
209,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | Metric.nhds_basis_ball_inv_nat_succ | [] | [
986,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
984,
1
] |
Mathlib/Data/Quot.lean | Quotient.mk_eq_iff_out | [
{
"state_after": "α : Sort u_1\nβ : Sort ?u.34412\ns : Setoid α\nx : α\ny : Quotient s\n⊢ Quotient.mk s x = y ↔ Quotient.mk s x = Quotient.mk s (out y)",
"state_before": "α : Sort u_1\nβ : Sort ?u.34412\ns : Setoid α\nx : α\ny : Quotient s\n⊢ Quotient.mk s x = y ↔ x ≈ out y",
"tactic": "refine' Iff.tran... | [
386,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
383,
1
] |
Mathlib/LinearAlgebra/Dual.lean | Module.forall_dual_apply_eq_zero_iff | [
{
"state_after": "K : Type u₁\nV : Type u₂\ninst✝² : Field K\ninst✝¹ : AddCommGroup V\ninst✝ : Module K V\nv : V\n⊢ (∀ (φ : Dual K V), ↑φ v = 0) ↔ ∀ (x : Dual K V), ↑(↑(eval K V) v) x = ↑0 x",
"state_before": "K : Type u₁\nV : Type u₂\ninst✝² : Field K\ninst✝¹ : AddCommGroup V\ninst✝ : Module K V\nv : V\n⊢ ... | [
578,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
576,
1
] |
Mathlib/Data/Set/Basic.lean | Set.nontrivial_of_pair_subset | [] | [
2470,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2469,
1
] |
Mathlib/Data/Fintype/Card.lean | Fintype.card_orderDual | [] | [
379,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
378,
1
] |
Mathlib/NumberTheory/ADEInequality.lean | ADEInequality.admissible_of_one_lt_sumInv | [
{
"state_after": "p q r : ℕ+\nH : 1 < sumInv {p, q, r}\n⊢ (∃ q_1 r_1, A' q_1 r_1 = {p, q, r}) ∨\n (∃ r_1, D' r_1 = {p, q, r}) ∨ E' 3 = {p, q, r} ∨ E' 4 = {p, q, r} ∨ E' 5 = {p, q, r}",
"state_before": "p q r : ℕ+\nH : 1 < sumInv {p, q, r}\n⊢ Admissible {p, q, r}",
"tactic": "simp only [Admissible]"
... | [
273,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
264,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.span_image | [] | [
577,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
575,
1
] |
Mathlib/RingTheory/Congruence.lean | RingCon.coe_int_cast | [] | [
326,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
325,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.toFinsupp_C_mul_X | [
{
"state_after": "no goals",
"state_before": "R : Type u\na✝ b : R\nm n : ℕ\ninst✝ : Semiring R\np q : R[X]\na : R\n⊢ (↑C a * X).toFinsupp = Finsupp.single 1 a",
"tactic": "rw [C_mul_X_eq_monomial, toFinsupp_monomial]"
}
] | [
750,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
749,
1
] |
Mathlib/Algebra/Homology/HomologicalComplex.lean | ChainComplex.next | [] | [
124,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/CategoryTheory/Preadditive/Injective.lean | CategoryTheory.Injective.enoughProjectives_of_enoughInjectives_op | [] | [
274,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
1
] |
Mathlib/GroupTheory/PGroup.lean | IsPGroup.center_nontrivial | [
{
"state_after": "no goals",
"state_before": "p : ℕ\nG : Type u_1\ninst✝⁴ : Group G\nhG : IsPGroup p G\nhp : Fact (Nat.Prime p)\nα : Type ?u.343920\ninst✝³ : MulAction G α\ninst✝² : Fintype α\ninst✝¹ : Nontrivial G\ninst✝ : Finite G\n⊢ Nontrivial { x // x ∈ Subgroup.center G }",
"tactic": "classical\n ... | [
257,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
248,
1
] |
Mathlib/Data/Num/Lemmas.lean | Num.ofZNum'_toNat | [
{
"state_after": "α : Type ?u.862147\np : PosNum\n⊢ castNum <$> ofZNum' (ZNum.pos p) = toNat' ↑↑p",
"state_before": "α : Type ?u.862147\np : PosNum\n⊢ castNum <$> ofZNum' (ZNum.pos p) = toNat' ↑p",
"tactic": "rw [← PosNum.to_nat_to_int p]"
},
{
"state_after": "no goals",
"state_before": "α :... | [
1293,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1288,
1
] |
Mathlib/Algebra/Order/Sub/Defs.lean | tsub_le_tsub_add_tsub | [
{
"state_after": "α : Type u_1\nβ : Type ?u.12335\ninst✝⁴ : Preorder α\ninst✝³ : AddCommSemigroup α\ninst✝² : Sub α\ninst✝¹ : OrderedSub α\na b c d : α\ninst✝ : CovariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1\n⊢ a ≤ c + (b - c) + (a - b)",
"state_before": "α : Type u_1\nβ : Type ?u.12335\nins... | [
159,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/RingTheory/Localization/Basic.lean | IsLocalization.mk'_eq_zero_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝⁴ : CommSemiring R\nM : Submonoid R\nS : Type u_2\ninst✝³ : CommSemiring S\ninst✝² : Algebra R S\nP : Type ?u.700135\ninst✝¹ : CommSemiring P\ninst✝ : IsLocalization M S\nx : R\ns : { x // x ∈ M }\n⊢ mk' S x s = 0 ↔ ∃ m, ↑m * x = 0",
"tact... | [
348,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
347,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.not_mem_Ioo_of_ge | [] | [
749,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
749,
1
] |
Mathlib/Order/Bounds/Basic.lean | isLUB_Ico | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nι : Sort x\ninst✝³ : Preorder α\ninst✝² : Preorder β\ns t : Set α\na✝ b✝ : α\ninst✝¹ : SemilatticeInf γ\ninst✝ : DenselyOrdered γ\na b : γ\nhab : a < b\n⊢ IsLUB (Ico a b) b",
"tactic": "simpa only [dual_Ioc] using isGLB_Io... | [
776,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
775,
1
] |
Mathlib/Analysis/InnerProductSpace/PiL2.lean | OrthonormalBasis.coe_of_orthogonal_eq_bot_mk | [] | [
585,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
583,
11
] |
Mathlib/ModelTheory/FinitelyGenerated.lean | FirstOrder.Language.Substructure.fg_closure | [
{
"state_after": "no goals",
"state_before": "L : Language\nM : Type u_1\ninst✝ : Structure L M\ns : Set M\nhs : Set.Finite s\n⊢ LowerAdjoint.toFun (closure L) ↑(Finite.toFinset hs) = LowerAdjoint.toFun (closure L) s",
"tactic": "rw [hs.coe_toFinset]"
}
] | [
71,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
70,
1
] |
Mathlib/LinearAlgebra/Matrix/ZPow.lean | Matrix.zpow_one_add | [
{
"state_after": "no goals",
"state_before": "n' : Type u_1\ninst✝² : DecidableEq n'\ninst✝¹ : Fintype n'\nR : Type u_2\ninst✝ : CommRing R\nA : M\nh : IsUnit (det A)\ni : ℤ\n⊢ A ^ (1 + i) = A * A ^ i",
"tactic": "rw [zpow_add h, zpow_one]"
}
] | [
194,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
193,
1
] |
Mathlib/Order/Monotone/Basic.lean | strictAnti_int_of_succ_lt | [] | [
1068,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1067,
1
] |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | GaloisConnection.l_ciSup | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.99982\nι : Sort u_3\ninst✝² : ConditionallyCompleteLattice α\ninst✝¹ : ConditionallyCompleteLattice β\ninst✝ : Nonempty ι\nl : α → β\nu : β → α\ngc : GaloisConnection l u\nf : ι → α\nhf : BddAbove (range f)\n⊢ l (⨆ (i : ι)... | [
1288,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1287,
1
] |
Mathlib/Topology/Homotopy/Path.lean | Path.Homotopy.hcomp_half | [
{
"state_after": "no goals",
"state_before": "X : Type u\nY : Type v\ninst✝¹ : TopologicalSpace X\ninst✝ : TopologicalSpace Y\nx₀ x₁ x₂ x₃ : X\np₀ q₀ : Path x₀ x₁\np₁ q₁ : Path x₁ x₂\nF : Homotopy p₀ q₀\nG : Homotopy p₁ q₁\nt : ↑I\n⊢ 0 ≤ 1 / 2",
"tactic": "norm_num"
},
{
"state_after": "no goals... | [
191,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/Data/Sum/Basic.lean | Sum.getRight_map | [
{
"state_after": "no goals",
"state_before": "α : Type u\nα' : Type w\nβ : Type v\nβ' : Type x\nγ : Type u_1\nδ : Type u_2\nf : α → β\ng : γ → δ\nx : α ⊕ γ\n⊢ getRight (Sum.map f g x) = Option.map g (getRight x)",
"tactic": "cases x <;> rfl"
}
] | [
271,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
270,
1
] |
Mathlib/MeasureTheory/Integral/Bochner.lean | MeasureTheory.SimpleFunc.integral_eq_lintegral' | [
{
"state_after": "α : Type u_1\nE : Type u_2\nF : Type ?u.139356\n𝕜 : Type ?u.139359\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedAddCommGroup F\ninst✝³ : NormedSpace ℝ F\np : ℝ≥0∞\nG : Type ?u.139461\nF' : Type ?u.139464\ninst✝² : NormedAddCommGroup G\ninst✝¹ : NormedAddCommGroup F'\ninst✝ : NormedSpace ℝ F... | [
396,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
383,
1
] |
Mathlib/Analysis/SpecialFunctions/Integrals.lean | integral_sin_pow_succ_le | [
{
"state_after": "a b : ℝ\nn : ℕ\nH : ∀ (x : ℝ), x ∈ Set.Icc 0 π → sin x ^ (n + 1) ≤ sin x ^ n :=\n fun x h => pow_le_pow_of_le_one (sin_nonneg_of_mem_Icc h) (sin_le_one x) (Nat.le_add_right n 1)\n⊢ (∫ (x : ℝ) in 0 ..π, sin x ^ (n + 1)) ≤ ∫ (x : ℝ) in 0 ..π, sin x ^ n",
"state_before": "a b : ℝ\nn : ℕ\n⊢ (... | [
692,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
690,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | Ideal.map_comap_le | [] | [
1435,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1434,
1
] |
Mathlib/Algebra/Algebra/Hom.lean | AlgHom.mul_apply | [] | [
446,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
445,
1
] |
Mathlib/Order/Cover.lean | Covby.of_image | [] | [
346,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
345,
1
] |
Mathlib/MeasureTheory/Measure/NullMeasurable.lean | Set.Finite.nullMeasurableSet_sInter | [] | [
402,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
400,
1
] |
Mathlib/CategoryTheory/EqToHom.lean | CategoryTheory.inv_eqToHom | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\ninst✝ : Category C\nX Y : C\nh : X = Y\n⊢ inv (eqToHom h) = eqToHom (_ : Y = X)",
"tactic": "aesop_cat"
}
] | [
166,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
165,
1
] |
Mathlib/Analysis/BoxIntegral/Box/SubboxInduction.lean | BoxIntegral.Box.subbox_induction_on' | [
{
"state_after": "ι : Type u_1\nI✝ J : Box ι\np : Box ι → Prop\nI : Box ι\nH_ind : ∀ (J : Box ι), J ≤ I → (∀ (s : Set ι), p (splitCenterBox J s)) → p J\nH_nhds :\n ∀ (z : ι → ℝ),\n z ∈ ↑Box.Icc I →\n ∃ U,\n U ∈ 𝓝[↑Box.Icc I] z ∧\n ∀ (J : Box ι),\n J ≤ I →\n ∀ (m... | [
175,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
125,
1
] |
Mathlib/Order/SuccPred/Basic.lean | Order.succ_lt_succ_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝² : Preorder α\ninst✝¹ : SuccOrder α\na b : α\ninst✝ : NoMaxOrder α\n⊢ succ a < succ b ↔ a < b",
"tactic": "simp"
}
] | [
348,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
348,
1
] |
Mathlib/Data/Nat/Factorization/Basic.lean | Nat.pow_succ_factorization_not_dvd | [
{
"state_after": "n p : ℕ\nhn : n ≠ 0\nhp : Prime p\nh : p ^ (↑(factorization n) p + 1) ∣ n\n⊢ False",
"state_before": "n p : ℕ\nhn : n ≠ 0\nhp : Prime p\n⊢ ¬p ^ (↑(factorization n) p + 1) ∣ n",
"tactic": "intro h"
},
{
"state_after": "n p : ℕ\nhn : n ≠ 0\nhp : Prime p\nh : factorization (p ^ (↑... | [
473,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
469,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Multiequalizer.lean | CategoryTheory.Limits.Multifork.hom_comp_ι | [] | [
365,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
364,
1
] |
Std/Data/Array/Init/Lemmas.lean | Array.foldl_data_eq_map | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nl : List α\nacc : Array β\nG : α → β\n⊢ (List.foldl (fun acc a => push acc (G a)) acc l).data = acc.data ++ List.map G l",
"tactic": "induction l generalizing acc <;> simp [*]"
}
] | [
214,
44
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
212,
1
] |
Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean | Complex.arg_eq_pi_iff | [
{
"state_after": "case pos\nz : ℂ\nh₀ : z = 0\n⊢ arg z = π ↔ z.re < 0 ∧ z.im = 0\n\ncase neg\nz : ℂ\nh₀ : ¬z = 0\n⊢ arg z = π ↔ z.re < 0 ∧ z.im = 0",
"state_before": "z : ℂ\n⊢ arg z = π ↔ z.re < 0 ∧ z.im = 0",
"tactic": "by_cases h₀ : z = 0"
},
{
"state_after": "case neg\nz : ℂ\nh₀ : ¬z = 0\n⊢ a... | [
242,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
233,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | contDiffOn_succ_iff_derivWithin | [
{
"state_after": "𝕜 : Type u_1\ninst✝¹⁰ : NontriviallyNormedField 𝕜\nD : Type uD\ninst✝⁹ : NormedAddCommGroup D\ninst✝⁸ : NormedSpace 𝕜 D\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : Normed... | [
2086,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2068,
1
] |
Mathlib/Data/Seq/Computation.lean | Computation.has_map_eq_map | [] | [
873,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
872,
1
] |
Mathlib/GroupTheory/GroupAction/Defs.lean | ofAdd_smul | [] | [
1190,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1189,
1
] |
Mathlib/Algebra/BigOperators/Basic.lean | ofAdd_sum | [] | [
2361,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2360,
1
] |
Mathlib/Data/Int/Dvd/Pow.lean | Int.pow_dvd_of_le_of_pow_dvd | [] | [
34,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
32,
1
] |
Mathlib/Algebra/Hom/Centroid.lean | CentroidHom.coe_zero | [] | [
294,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
293,
1
] |
Mathlib/Topology/Algebra/Order/LeftRightLim.lean | Monotone.rightLim_le | [] | [
140,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/LinearAlgebra/BilinearForm.lean | BilinForm.compRight_compLeft | [] | [
588,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
586,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Basic.lean | BoxIntegral.Prepartition.biUnion_le_iff | [
{
"state_after": "case mp\nι : Type u_1\nI J✝ J₁ J₂ : Box ι\nπ π₁ π₂ : Prepartition I\nx : ι → ℝ\nπi✝ πi₁ πi₂ πi : (J : Box ι) → Prepartition J\nπ' : Prepartition I\nH : biUnion π πi ≤ π'\nJ : Box ι\nhJ : J ∈ π\n⊢ πi J ≤ restrict π' J\n\ncase mpr\nι : Type u_1\nI J✝ J₁ J₂ : Box ι\nπ π₁ π₂ : Prepartition I\nx : ... | [
552,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
543,
1
] |
Mathlib/Algebra/Star/SelfAdjoint.lean | selfAdjoint.val_one | [] | [
326,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
325,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Icc_subset_Ioi_iff | [] | [
578,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
577,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.map_map | [] | [
1444,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1443,
1
] |
Mathlib/Data/Int/ConditionallyCompleteOrder.lean | Int.csInf_eq_least_of_bdd | [
{
"state_after": "s : Set ℤ\ninst✝ : DecidablePred fun x => x ∈ s\nb : ℤ\nHb : ∀ (z : ℤ), z ∈ s → b ≤ z\nHinh : ∃ z, z ∈ s\nthis : Set.Nonempty s ∧ BddBelow s\n⊢ sInf s = ↑(leastOfBdd b Hb Hinh)",
"state_before": "s : Set ℤ\ninst✝ : DecidablePred fun x => x ∈ s\nb : ℤ\nHb : ∀ (z : ℤ), z ∈ s → b ≤ z\nHinh : ... | [
87,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
83,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalSubsemiring.closure_empty | [] | [
719,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
718,
1
] |
Mathlib/Data/Multiset/Fold.lean | Multiset.le_smul_dedup | [
{
"state_after": "α : Type u_1\nβ : Type ?u.22330\ninst✝ : DecidableEq α\ns : Multiset α\na : α\n⊢ count a s ≤ fold max 0 (map (fun a => count a s) s) * count a (dedup s)",
"state_before": "α : Type u_1\nβ : Type ?u.22330\ninst✝ : DecidableEq α\ns : Multiset α\na : α\n⊢ count a s ≤ count a (fold max 0 (map ... | [
153,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
144,
1
] |
Mathlib/Algebra/Order/Field/Basic.lean | zpow_nonneg | [
{
"state_after": "ι : Type ?u.12689\nα : Type u_1\nβ : Type ?u.12695\ninst✝ : LinearOrderedSemifield α\na b c d e : α\nm n✝ : ℤ\nha : 0 ≤ a\nn : ℕ\n⊢ 0 ≤ a ^ n",
"state_before": "ι : Type ?u.12689\nα : Type u_1\nβ : Type ?u.12695\ninst✝ : LinearOrderedSemifield α\na b c d e : α\nm n✝ : ℤ\nha : 0 ≤ a\nn : ℕ\... | [
117,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
111,
1
] |
Mathlib/Data/Nat/Basic.lean | Nat.le_of_pred_lt | [] | [
329,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
326,
1
] |
Mathlib/Data/List/Func.lean | List.Func.mem_get_of_le | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\na : α\nas as1 as2 as3 : List α\ninst✝¹ : Inhabited α\ninst✝ : Inhabited β\nx✝ : ℕ\nh1 : x✝ < length []\n⊢ get x✝ [] ∈ []",
"tactic": "cases h1"
},
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\na✝ : α\nas✝ a... | [
158,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Algebra/Order/Sub/Canonical.lean | AddLECancellable.add_tsub_tsub_cancel | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝⁵ : AddCommSemigroup α\ninst✝⁴ : PartialOrder α\ninst✝³ : ExistsAddOfLE α\ninst✝² : CovariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1\ninst✝¹ : Sub α\ninst✝ : OrderedSub α\na b c d : α\nhac : AddLECancellable (a - c)\nh : c ≤ a\n⊢... | [
187,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
185,
11
] |
Mathlib/Analysis/Complex/Basic.lean | Complex.re_tsum | [] | [
615,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
614,
1
] |
Mathlib/Algebra/Periodic.lean | Function.Periodic.div | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.30906\nf g : α → β\nc c₁ c₂ x : α\ninst✝¹ : Add α\ninst✝ : Div β\nhf : Periodic f c\nhg : Periodic g c\n⊢ Periodic (f / g) c",
"tactic": "simp_all"
}
] | [
77,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
11
] |
Mathlib/Algebra/CubicDiscriminant.lean | Cubic.leadingCoeff_of_c_ne_zero | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nS : Type ?u.556672\nF : Type ?u.556675\nK : Type ?u.556678\nP Q : Cubic R\na b c d a' b' c' d' : R\ninst✝ : Semiring R\nha : P.a = 0\nhb : P.b = 0\nhc : P.c ≠ 0\n⊢ leadingCoeff (toPoly P) = P.c",
"tactic": "rw [of_b_eq_zero ha hb, leadingCoeff_... | [
225,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
223,
1
] |
Mathlib/Data/Fintype/Basic.lean | Finset.inter_compl | [] | [
208,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
207,
1
] |
Mathlib/Analysis/InnerProductSpace/Basic.lean | InnerProductSpace.Core.inner_smul_left | [] | [
241,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
240,
1
] |
Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean | MeasureTheory.AECover.iSup_lintegral_eq_of_countably_generated | [
{
"state_after": "α : Type u_2\nι : Type u_1\ninst✝³ : MeasurableSpace α\nμ : Measure α\nl : Filter ι\ninst✝² : Nonempty ι\ninst✝¹ : NeBot l\ninst✝ : IsCountablyGenerated l\nφ : ι → Set α\nhφ : AECover μ l φ\nf : α → ℝ≥0∞\nhfm : AEMeasurable f\nthis : Tendsto (fun i => ∫⁻ (x : α) in φ i, f x ∂μ) l (𝓝 (∫⁻ (x : ... | [
399,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/Algebra/Field/Defs.lean | Rat.cast_def | [] | [
143,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
142,
1
] |
Mathlib/Data/MvPolynomial/Basic.lean | MvPolynomial.coeff_zero_X | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS₁ : Type v\nS₂ : Type w\nS₃ : Type x\nσ : Type u_1\na a' a₁ a₂ : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝¹ : CommSemiring R\ninst✝ : CommSemiring S₁\np q : MvPolynomial σ R\ni : σ\nh : Finsupp.single i 1 = 0\n⊢ False",
"tactic": "cases Finsupp.singl... | [
627,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
626,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.transpose_pow | [] | [
2094,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2092,
1
] |
Mathlib/Data/Real/CauSeq.lean | CauSeq.pow_equiv_pow | [
{
"state_after": "case zero\nα : Type u_1\nβ : Type u_2\ninst✝² : LinearOrderedField α\ninst✝¹ : Ring β\nabv : β → α\ninst✝ : IsAbsoluteValue abv\nf1 f2 : CauSeq β abv\nhf : f1 ≈ f2\n⊢ f1 ^ Nat.zero ≈ f2 ^ Nat.zero\n\ncase succ\nα : Type u_1\nβ : Type u_2\ninst✝² : LinearOrderedField α\ninst✝¹ : Ring β\nabv : β... | [
586,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
583,
1
] |
Mathlib/GroupTheory/Subsemigroup/Operations.lean | Subsemigroup.comap_map_eq_of_injective | [] | [
388,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
387,
1
] |
Mathlib/Order/Heyting/Basic.lean | himp_self | [] | [
341,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
340,
1
] |
Mathlib/Data/Finmap.lean | Finmap.mem_union | [] | [
573,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
572,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | measurable_biSup | [
{
"state_after": "α : Type u_3\nβ : Type ?u.1524783\nγ : Type ?u.1524786\nγ₂ : Type ?u.1524789\nδ : Type u_2\nι✝ : Sort y\ns✝ t u : Set α\ninst✝¹² : TopologicalSpace α\ninst✝¹¹ : MeasurableSpace α\ninst✝¹⁰ : BorelSpace α\ninst✝⁹ : TopologicalSpace β\ninst✝⁸ : MeasurableSpace β\ninst✝⁷ : BorelSpace β\ninst✝⁶ : T... | [
1284,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1280,
1
] |
Mathlib/RingTheory/Polynomial/Cyclotomic/Basic.lean | Polynomial.map_cyclotomic_int | [
{
"state_after": "case pos\nn : ℕ\nR : Type u_1\ninst✝ : Ring R\nhzero : n = 0\n⊢ map (Int.castRingHom R) (cyclotomic n ℤ) = cyclotomic n R\n\ncase neg\nn : ℕ\nR : Type u_1\ninst✝ : Ring R\nhzero : ¬n = 0\n⊢ map (Int.castRingHom R) (cyclotomic n ℤ) = cyclotomic n R",
"state_before": "n : ℕ\nR : Type u_1\nin... | [
273,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
269,
1
] |
Mathlib/LinearAlgebra/Matrix/Charpoly/LinearMap.lean | Matrix.isRepresentation.eq_toEnd_of_represents | [] | [
190,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/Algebra/Star/CHSH.lean | TsirelsonInequality.sqrt_two_inv_mul_self | [
{
"state_after": "R : Type u\n⊢ (Real.sqrt 2 * Real.sqrt 2)⁻¹ = 2⁻¹",
"state_before": "R : Type u\n⊢ (Real.sqrt 2)⁻¹ * (Real.sqrt 2)⁻¹ = 2⁻¹",
"tactic": "rw [← mul_inv]"
},
{
"state_after": "no goals",
"state_before": "R : Type u\n⊢ (Real.sqrt 2 * Real.sqrt 2)⁻¹ = 2⁻¹",
"tactic": "norm_n... | [
182,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
180,
1
] |
Mathlib/CategoryTheory/Subobject/Basic.lean | CategoryTheory.Subobject.representative_arrow | [] | [
227,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
226,
1
] |
Mathlib/Topology/MetricSpace/Infsep.lean | Set.einfsep_le_of_mem_of_edist_le | [] | [
122,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
120,
1
] |
Mathlib/Algebra/Hom/Units.lean | IsUnit.mul_eq_one_iff_eq_inv | [] | [
356,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
355,
11
] |
Mathlib/Algebra/Group/Prod.lean | Prod.mk_one_mul_mk_one | [
{
"state_after": "no goals",
"state_before": "A : Type ?u.2634\nB : Type ?u.2637\nG : Type ?u.2640\nH : Type ?u.2643\nM : Type u_1\nN : Type u_2\nP : Type ?u.2652\ninst✝¹ : Mul M\ninst✝ : Monoid N\na₁ a₂ : M\n⊢ (a₁, 1) * (a₂, 1) = (a₁ * a₂, 1)",
"tactic": "rw [mk_mul_mk, mul_one]"
}
] | [
88,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
86,
1
] |
Mathlib/LinearAlgebra/StdBasis.lean | Matrix.stdBasis_eq_stdBasisMatrix | [
{
"state_after": "case a.h\nR : Type u_3\nm : Type u_2\nn : Type u_1\ninst✝⁴ : Fintype m\ninst✝³ : Fintype n\ninst✝² : Semiring R\ni : n\nj : m\ninst✝¹ : DecidableEq n\ninst✝ : DecidableEq m\na : n\nb : m\n⊢ ↑(stdBasis R n m) (i, j) a b = stdBasisMatrix i j 1 a b",
"state_before": "R : Type u_3\nm : Type u_... | [
334,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/Data/Rel.lean | Rel.core_subset | [] | [
219,
99
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
219,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalSubsemiring.top_prod_top | [] | [
814,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
813,
1
] |
Mathlib/Data/Set/Prod.lean | Set.insert_pi | [
{
"state_after": "case h\nι : Type u_1\nα : ι → Type u_2\nβ : ι → Type ?u.128441\ns✝ s₁ s₂ : Set ι\nt✝ t₁ t₂ : (i : ι) → Set (α i)\ni✝ i : ι\ns : Set ι\nt : (i : ι) → Set (α i)\nx✝ : (i : ι) → α i\n⊢ x✝ ∈ pi (insert i s) t ↔ x✝ ∈ eval i ⁻¹' t i ∩ pi s t",
"state_before": "ι : Type u_1\nα : ι → Type u_2\nβ :... | [
727,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
724,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.