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/Algebra/Order/ToIntervalMod.lean | toIcoMod_zero_one | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : LinearOrderedField α\ninst✝ : FloorRing α\np : α\nhp : 0 < p\nb : α\n⊢ toIcoMod (_ : 0 < 1) 0 b = Int.fract b",
"tactic": "simp [toIcoMod_eq_add_fract_mul]"
}
] | [
1037,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1036,
1
] |
Mathlib/ModelTheory/Semantics.lean | FirstOrder.Language.BoundedFormula.realize_bdEqual | [] | [
278,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/FieldTheory/IntermediateField.lean | IntermediateField.isIntegral_iff | [
{
"state_after": "no goals",
"state_before": "K : Type u_2\nL : Type u_1\nL' : Type ?u.313025\ninst✝⁴ : Field K\ninst✝³ : Field L\ninst✝² : Field L'\ninst✝¹ : Algebra K L\ninst✝ : Algebra K L'\nS : IntermediateField K L\nx : { x // x ∈ S }\n⊢ IsIntegral K x ↔ IsIntegral K ↑x",
"tactic": "rw [← isAlgebra... | [
734,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
733,
1
] |
Mathlib/Data/Int/Log.lean | Int.clog_inv | [
{
"state_after": "case inl\nR : Type u_1\ninst✝¹ : LinearOrderedSemifield R\ninst✝ : FloorSemiring R\nb : ℕ\nr : R\nhrp : 0 < r\n⊢ clog b r⁻¹ = -log b r\n\ncase inr\nR : Type u_1\ninst✝¹ : LinearOrderedSemifield R\ninst✝ : FloorSemiring R\nb : ℕ\nr : R\nhrp : r ≤ 0\n⊢ clog b r⁻¹ = -log b r",
"state_before":... | [
218,
92
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/NumberTheory/Padics/Hensel.lean | newton_seq_dist_tendsto | [] | [
406,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
402,
9
] |
Mathlib/CategoryTheory/Limits/Shapes/Images.lean | CategoryTheory.Limits.image.factor_map | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝³ : Category C\nf g : Arrow C\ninst✝² : HasImage f.hom\ninst✝¹ : HasImage g.hom\nsq : f ⟶ g\ninst✝ : HasImageMap sq\n⊢ factorThruImage f.hom ≫ map sq = sq.left ≫ factorThruImage g.hom",
"tactic": "simp"
}
] | [
800,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
799,
1
] |
Mathlib/RingTheory/Ideal/Cotangent.lean | Ideal.cotangentEquivIdeal_symm_apply | [
{
"state_after": "case a\nR : Type u\nS : Type v\nS' : Type w\ninst✝⁶ : CommRing R\ninst✝⁵ : CommSemiring S\ninst✝⁴ : Algebra S R\ninst✝³ : CommSemiring S'\ninst✝² : Algebra S' R\ninst✝¹ : Algebra S S'\ninst✝ : IsScalarTower S S' R\nI : Ideal R\nx : R\nhx : x ∈ I\n⊢ ↑(cotangentEquivIdeal I)\n (↑(LinearEqui... | [
175,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
169,
1
] |
Mathlib/Algebra/Order/Floor.lean | Int.preimage_ceil_singleton | [] | [
1234,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1233,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.inf_inf | [] | [
362,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
361,
1
] |
Mathlib/FieldTheory/Finite/Polynomial.lean | MvPolynomial.frobenius_zmod | [
{
"state_after": "case h_C\nσ : Type u_1\np : ℕ\ninst✝ : Fact (Nat.Prime p)\nf : MvPolynomial σ (ZMod p)\n⊢ ∀ (a : ZMod p), ↑(frobenius (MvPolynomial σ (ZMod p)) p) (↑C a) = ↑(expand p) (↑C a)\n\ncase h_add\nσ : Type u_1\np : ℕ\ninst✝ : Fact (Nat.Prime p)\nf : MvPolynomial σ (ZMod p)\n⊢ ∀ (p_1 q : MvPolynomial ... | [
43,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
38,
1
] |
Mathlib/Data/Fintype/Card.lean | Infinite.natEmbeddingAux_injective | [
{
"state_after": "α✝ : Type ?u.80507\nβ : Type ?u.80510\nγ : Type ?u.80513\nα : Type u_1\ninst✝ : Infinite α\nm n : ℕ\nh : Infinite.natEmbeddingAux α m = Infinite.natEmbeddingAux α n\n⊢ m = n",
"state_before": "α✝ : Type ?u.80507\nβ : Type ?u.80510\nγ : Type ?u.80513\nα : Type u_1\ninst✝ : Infinite α\n⊢ Inj... | [
1101,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1094,
9
] |
Mathlib/Analysis/NormedSpace/Basic.lean | frontier_sphere' | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.310915\nβ : Type ?u.310918\nγ : Type ?u.310921\nι : Type ?u.310924\ninst✝⁶ : NormedField α\nE : Type u_1\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace α E\nF : Type ?u.311017\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace α F\ninst✝¹ : N... | [
403,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
401,
1
] |
Mathlib/LinearAlgebra/Matrix/Block.lean | Matrix.blockTriangular_transpose_iff | [] | [
84,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
82,
11
] |
Mathlib/CategoryTheory/Products/Bifunctor.lean | CategoryTheory.Bifunctor.map_comp_id | [
{
"state_after": "no goals",
"state_before": "C : Type u₁\nD : Type u₂\nE : Type u₃\ninst✝² : Category C\ninst✝¹ : Category D\ninst✝ : Category E\nF : C × D ⥤ E\nX Y Z : C\nW : D\nf : X ⟶ Y\ng : Y ⟶ Z\n⊢ F.map (f ≫ g, 𝟙 W) = F.map (f, 𝟙 W) ≫ F.map (g, 𝟙 W)",
"tactic": "rw [← Functor.map_comp, prod_co... | [
45,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
42,
1
] |
Mathlib/MeasureTheory/Function/L2Space.lean | MeasureTheory.L2.integral_inner_eq_sq_snorm | [
{
"state_after": "α : Type u_1\nE : Type u_2\nF : Type ?u.50966\n𝕜 : Type u_3\ninst✝⁴ : IsROrC 𝕜\ninst✝³ : MeasurableSpace α\nμ : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : InnerProductSpace 𝕜 E\ninst✝ : NormedAddCommGroup F\nf : { x // x ∈ Lp E 2 }\n⊢ (∫ (a : α), ↑‖↑↑f a‖ ^ 2 ∂μ) = ↑(ENNReal.toReal ... | [
173,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
160,
1
] |
Mathlib/Topology/Separation.lean | RegularSpace.ofLift'_closure | [] | [
1506,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1505,
1
] |
Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | NonUnitalSubsemiring.toSubsemigroup_injective | [] | [
148,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/Topology/MetricSpace/Holder.lean | HolderWith.comp | [] | [
206,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
204,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Pointwise.lean | Subalgebra.mul_toSubmodule_le | [
{
"state_after": "R : Type u_1\nA : Type u_2\ninst✝² : CommSemiring R\ninst✝¹ : Semiring A\ninst✝ : Algebra R A\nS T : Subalgebra R A\n⊢ ∀ (m : A), m ∈ ↑toSubmodule S → ∀ (n : A), n ∈ ↑toSubmodule T → m * n ∈ ↑toSubmodule (S ⊔ T)",
"state_before": "R : Type u_1\nA : Type u_2\ninst✝² : CommSemiring R\ninst✝¹... | [
35,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
30,
1
] |
Mathlib/Data/Finsupp/WellFounded.lean | Finsupp.Lex.wellFounded | [] | [
49,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
48,
1
] |
Mathlib/Data/Nat/Log.lean | Nat.log_eq_of_pow_le_of_lt_pow | [
{
"state_after": "case inl\nb n : ℕ\nh₁ : b ^ 0 ≤ n\nh₂ : n < b ^ (0 + 1)\n⊢ log b n = 0\n\ncase inr\nb m n : ℕ\nh₁ : b ^ m ≤ n\nh₂ : n < b ^ (m + 1)\nhm : m ≠ 0\n⊢ log b n = m",
"state_before": "b m n : ℕ\nh₁ : b ^ m ≤ n\nh₂ : n < b ^ (m + 1)\n⊢ log b n = m",
"tactic": "rcases eq_or_ne m 0 with (rfl | ... | [
157,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
152,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | HasFTaylorSeriesUpToOn.shift_of_succ | [
{
"state_after": "case zero_eq\n𝕜 : Type u\ninst✝⁸ : NontriviallyNormedField 𝕜\nE : Type uE\ninst✝⁷ : NormedAddCommGroup E\ninst✝⁶ : NormedSpace 𝕜 E\nF : Type uF\ninst✝⁵ : NormedAddCommGroup F\ninst✝⁴ : NormedSpace 𝕜 F\nG : Type uG\ninst✝³ : NormedAddCommGroup G\ninst✝² : NormedSpace 𝕜 G\nX : Type uX\ninst... | [
361,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.disjoint_iff_ne | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.480530\nγ : Type ?u.480533\ns t : Multiset α\n⊢ Disjoint s t ↔ ∀ (a : α), a ∈ s → ∀ (b : α), b ∈ t → a ≠ b",
"tactic": "simp [disjoint_left, imp_not_comm]"
}
] | [
2913,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2912,
1
] |
Mathlib/Data/List/Perm.lean | List.Perm.nodup_iff | [] | [
1068,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1067,
1
] |
Mathlib/Topology/Constructions.lean | Continuous.snd' | [] | [
374,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
373,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.pullbackSymmetry_inv_comp_snd | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝² : Category C\nD : Type u₂\ninst✝¹ : Category D\nW X Y Z : C\nf : X ⟶ Z\ng : Y ⟶ Z\ninst✝ : HasPullback f g\n⊢ (pullbackSymmetry f g).inv ≫ pullback.snd = pullback.fst",
"tactic": "simp [Iso.inv_comp_eq]"
}
] | [
1539,
90
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1538,
1
] |
Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean | map_div₀ | [] | [
246,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
245,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.support_eq_empty | [
{
"state_after": "no goals",
"state_before": "ι : Type u\nγ : Type w\nβ : ι → Type v\nβ₁ : ι → Type v₁\nβ₂ : ι → Type v₂\ndec : DecidableEq ι\ninst✝¹ : (i : ι) → Zero (β i)\ninst✝ : (i : ι) → (x : β i) → Decidable (x ≠ 0)\nf : Π₀ (i : ι), β i\nH : support f = ∅\n⊢ ∀ (i : ι), ↑f i = ↑0 i",
"tactic": "sim... | [
1147,
98
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1146,
1
] |
Mathlib/RingTheory/Ideal/LocalRing.lean | LocalRing.ResidueField.map_comp_residue | [] | [
431,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
429,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.nfpBFamily_le_apply | [
{
"state_after": "o : Ordinal\nf : (b : Ordinal) → b < o → Ordinal → Ordinal\nho : o ≠ 0\nH : ∀ (i : Ordinal) (hi : i < o), IsNormal (f i hi)\na : Ordinal\nb : Ordinal\n⊢ (¬∃ i hi, nfpBFamily o f a ≤ f i hi b) ↔ ¬nfpBFamily o f a ≤ b",
"state_before": "o : Ordinal\nf : (b : Ordinal) → b < o → Ordinal → Ordi... | [
314,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
310,
1
] |
Mathlib/Analysis/InnerProductSpace/GramSchmidtOrtho.lean | gramSchmidt_ne_zero | [] | [
234,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
232,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Iic_union_Ioc_eq_Iic | [] | [
1405,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1403,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.cases_zero | [
{
"state_after": "no goals",
"state_before": "n✝ m n : ℕ\nC : Fin (n + 1) → Sort u_1\nH0 : C 0\nHs : (i : Fin n) → C (succ i)\n⊢ cases H0 Hs 0 = H0",
"tactic": "cases n <;> rfl"
}
] | [
1737,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1736,
1
] |
Mathlib/Analysis/Calculus/Deriv/Comp.lean | HasStrictDerivAt.iterate | [
{
"state_after": "𝕜 : Type u\ninst✝⁸ : NontriviallyNormedField 𝕜\nF : Type v\ninst✝⁷ : NormedAddCommGroup F\ninst✝⁶ : NormedSpace 𝕜 F\nE : Type w\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : NormedSpace 𝕜 E\nf✝ f₀ f₁ g : 𝕜 → F\nf'✝ f₀' f₁' g' : F\nx : 𝕜\ns t : Set 𝕜\nL L₁ L₂ : Filter 𝕜\n𝕜' : Type ?u.192344... | [
226,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
222,
19
] |
Mathlib/Topology/Inseparable.lean | SeparationQuotient.comap_mk_nhdsSet | [
{
"state_after": "no goals",
"state_before": "X : Type u_1\nY : Type ?u.79044\nZ : Type ?u.79047\nα : Type ?u.79050\nι : Type ?u.79053\nπ : ι → Type ?u.79058\ninst✝³ : TopologicalSpace X\ninst✝² : TopologicalSpace Y\ninst✝¹ : TopologicalSpace Z\ninst✝ : (i : ι) → TopologicalSpace (π i)\nx y z : X\ns : Set X... | [
495,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
494,
1
] |
Mathlib/Data/Nat/Prime.lean | Nat.Prime.dvd_mul_of_dvd_ne | [] | [
702,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
700,
1
] |
Mathlib/Data/Fin/Tuple/NatAntidiagonal.lean | Multiset.Nat.antidiagonalTuple_one | [] | [
216,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
1
] |
Mathlib/Data/Set/Basic.lean | Set.sep_inter | [] | [
1469,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1468,
1
] |
Mathlib/Data/Nat/Order/Basic.lean | Nat.div_eq_sub_mod_div | [
{
"state_after": "case pos\nm n k l : ℕ\nn0 : n = 0\n⊢ m / n = (m - m % n) / n\n\ncase neg\nm n k l : ℕ\nn0 : ¬n = 0\n⊢ m / n = (m - m % n) / n",
"state_before": "m n k l : ℕ\n⊢ m / n = (m - m % n) / n",
"tactic": "by_cases n0 : n = 0"
},
{
"state_after": "no goals",
"state_before": "case po... | [
558,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
553,
1
] |
Mathlib/Data/TypeVec.lean | TypeVec.casesCons_append1 | [] | [
333,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
330,
11
] |
Mathlib/Data/Int/Dvd/Basic.lean | Int.coe_nat_dvd_right | [
{
"state_after": "no goals",
"state_before": "n : ℕ\nz : ℤ\n⊢ z ∣ ↑n ↔ natAbs z ∣ n",
"tactic": "rcases natAbs_eq z with (eq | eq) <;> rw [eq] <;> simp [←coe_nat_dvd]"
}
] | [
42,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
41,
1
] |
Mathlib/GroupTheory/Nilpotent.lean | nilpotencyClass_prod | [
{
"state_after": "G : Type ?u.332663\ninst✝⁵ : Group G\nH : Subgroup G\ninst✝⁴ : Normal H\nG₁ : Type u_1\nG₂ : Type u_2\ninst✝³ : Group G₁\ninst✝² : Group G₂\ninst✝¹ : Group.IsNilpotent G₁\ninst✝ : Group.IsNilpotent G₂\nk : ℕ\n⊢ nilpotencyClass (G₁ × G₂) ≤ k ↔ max (nilpotencyClass G₁) (nilpotencyClass G₂) ≤ k",... | [
742,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
737,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | ULift.norm_def | [] | [
2106,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2105,
1
] |
Mathlib/Data/Int/Div.lean | Int.eq_zero_of_dvd_of_nonneg_of_lt | [] | [
43,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
42,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.sum_nat_eq_add_sum_succ | [
{
"state_after": "α β : Type u\nf : ℕ → Cardinal\n⊢ (#Quotient.out (f 0) ⊕ (n : ℕ) × Quotient.out (f (n + 1))) = f 0 + sum fun i => f (i + 1)",
"state_before": "α β : Type u\nf : ℕ → Cardinal\n⊢ sum f = f 0 + sum fun i => f (i + 1)",
"tactic": "refine' (Equiv.sigmaNatSucc fun i => Quotient.out (f i)).ca... | [
1005,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1002,
1
] |
Mathlib/MeasureTheory/Group/Action.lean | MeasureTheory.vadd_ae_eq_self_of_mem_zmultiples | [
{
"state_after": "G✝ : Type ?u.114459\nM : Type ?u.114462\nα : Type u_2\ns : Set α\nm : MeasurableSpace α\ninst✝⁹ : Group G✝\ninst✝⁸ : MulAction G✝ α\ninst✝⁷ : MeasurableSpace G✝\ninst✝⁶ : MeasurableSMul G✝ α\nc : G✝\nμ : Measure α\ninst✝⁵ : SMulInvariantMeasure G✝ α μ\nG : Type u_1\ninst✝⁴ : MeasurableSpace G\... | [
289,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
277,
1
] |
Mathlib/Algebra/Parity.lean | even_two_mul | [] | [
291,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
290,
1
] |
Mathlib/Combinatorics/Additive/PluenneckeRuzsa.lean | Finset.card_div_mul_le_card_mul_mul_card_div | [
{
"state_after": "α : Type u_1\ninst✝¹ : CommGroup α\ninst✝ : DecidableEq α\nA✝ B✝ C✝ A B C : Finset α\n⊢ card (A * C⁻¹) * card B ≤ card (A * B) * card (B * C⁻¹)",
"state_before": "α : Type u_1\ninst✝¹ : CommGroup α\ninst✝ : DecidableEq α\nA✝ B✝ C✝ A B C : Finset α\n⊢ card (A / C) * card B ≤ card (A * B) * ... | [
175,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.dist_le_iff_of_nonempty | [] | [
189,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
187,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean | MeasureTheory.ae_le_set | [
{
"state_after": "α : Type u_1\nβ : Type ?u.101868\nγ : Type ?u.101871\nδ : Type ?u.101874\nι : Type ?u.101877\ninst✝ : MeasurableSpace α\nμ μ₁ μ₂ : Measure α\ns s₁ s₂ t : Set α\n⊢ ↑↑μ {a | a ∈ s ∧ ¬a ∈ t} = 0 ↔ ↑↑μ (s \\ t) = 0",
"state_before": "α : Type u_1\nβ : Type ?u.101868\nγ : Type ?u.101871\nδ : Ty... | [
455,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
452,
1
] |
Mathlib/MeasureTheory/Integral/IntervalIntegral.lean | intervalIntegral.integral_smul | [
{
"state_after": "no goals",
"state_before": "ι : Type ?u.12999603\n𝕜✝ : Type ?u.12999606\nE : Type u_2\nF : Type ?u.12999612\nA : Type ?u.12999615\ninst✝⁵ : NormedAddCommGroup E\ninst✝⁴ : CompleteSpace E\ninst✝³ : NormedSpace ℝ E\na b : ℝ\nf✝ g : ℝ → E\nμ : MeasureTheory.Measure ℝ\n𝕜 : Type u_1\ninst✝² :... | [
607,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
604,
8
] |
Mathlib/RingTheory/SimpleModule.lean | is_semisimple_iff_top_eq_sSup_simples | [
{
"state_after": "R : Type u_2\ninst✝⁴ : Ring R\nM : Type u_1\ninst✝³ : AddCommGroup M\ninst✝² : Module R M\nm : Submodule R M\nN : Type ?u.47667\ninst✝¹ : AddCommGroup N\ninst✝ : Module R N\na✝ : IsSemisimpleModule R M\n⊢ sSup {m | IsSimpleModule R { x // x ∈ m }} = ⊤",
"state_before": "R : Type u_2\ninst✝... | [
127,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | SimpleGraph.Walk.copy_rfl_rfl | [] | [
138,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/Order/Filter/Bases.lean | Filter.hasBasis_generate | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.9944\nγ : Type ?u.9947\nι : Sort ?u.9950\nι' : Sort ?u.9953\nl l' : Filter α\np : ι → Prop\ns✝ : ι → Set α\nt : Set α\ni : ι\np' : ι' → Prop\ns' : ι' → Set α\ni' : ι'\ns : Set (Set α)\nU : Set α\n⊢ U ∈ generate s ↔ ∃ i, (Set.Finite i ∧ ... | [
245,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
243,
1
] |
Mathlib/Topology/Instances/TrivSqZeroExt.lean | TrivSqZeroExt.hasSum_inr | [] | [
156,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
154,
1
] |
Mathlib/Algebra/GCDMonoid/Basic.lean | gcd_one_right' | [] | [
422,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
421,
1
] |
Mathlib/Probability/Independence/ZeroOne.lean | ProbabilityTheory.indep_iSup_directed_limsup | [
{
"state_after": "case refine'_1\nΩ : Type u_1\nι : Type u_2\nm m0 : MeasurableSpace Ω\nμ : MeasureTheory.Measure Ω\ninst✝ : IsProbabilityMeasure μ\ns : ι → MeasurableSpace Ω\nα : Type u_3\np : Set ι → Prop\nf : Filter ι\nns : α → Set ι\nh_le : ∀ (n : ι), s n ≤ m0\nh_indep : iIndep s\nhf : ∀ (t : Set ι), p t → ... | [
96,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Analysis/Calculus/FDeriv/Comp.lean | DifferentiableWithinAt.iterate | [] | [
263,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
261,
11
] |
Mathlib/CategoryTheory/Subterminal.lean | CategoryTheory.IsSubterminal.mono_isTerminal_from | [] | [
59,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
57,
1
] |
Mathlib/Data/List/Rotate.lean | List.rotate_eq_rotate | [] | [
336,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
335,
1
] |
Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean | ModelWithCorners.right_inv | [] | [
284,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
283,
11
] |
Mathlib/AlgebraicTopology/SimplexCategory.lean | SimplexCategory.eq_δ_of_mono | [
{
"state_after": "case intro.intro\nn : ℕ\nθ : [n] ⟶ [n + 1]\ninst✝ : Mono θ\ni : Fin (n + 2)\nθ' : [n] ⟶ [n]\nh : θ = θ' ≫ δ i\n⊢ ∃ i, θ = δ i",
"state_before": "n : ℕ\nθ : [n] ⟶ [n + 1]\ninst✝ : Mono θ\n⊢ ∃ i, θ = δ i",
"tactic": "rcases eq_comp_δ_of_not_surjective θ (by\n by_contra h\n simpa using ... | [
755,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
746,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Metric.mem_thickening_iff_infEdist_lt | [] | [
908,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
907,
1
] |
Mathlib/RingTheory/Int/Basic.lean | Int.zmultiples_natAbs | [] | [
389,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
386,
1
] |
Mathlib/RingTheory/PolynomialAlgebra.lean | polyEquivTensor_symm_apply_tmul | [] | [
212,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
210,
1
] |
Mathlib/Algebra/Module/LocalizedModule.lean | LocalizedModule.induction_on₂ | [
{
"state_after": "case mk.mk.mk.mk\nR : Type u\ninst✝² : CommSemiring R\nS : Submonoid R\nM : Type v\ninst✝¹ : AddCommMonoid M\ninst✝ : Module R M\nβ : LocalizedModule S M → LocalizedModule S M → Prop\nh : ∀ (m m' : M) (s s' : { x // x ∈ S }), β (mk m s) (mk m' s')\nx✝ : LocalizedModule S M\nm : M\ns : { x // x... | [
113,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
110,
1
] |
Mathlib/Topology/Maps.lean | IsOpenMap.to_quotientMap | [] | [
405,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
402,
1
] |
Mathlib/Algebra/BigOperators/Intervals.lean | Finset.prod_Ioc_consecutive | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ns₂ s₁ s : Finset α\na : α\ng f✝ : α → β\ninst✝ : CommMonoid β\nf : ℕ → β\nm n k : ℕ\nhmn : m ≤ n\nhnk : n ≤ k\n⊢ Disjoint (Ioc m n) (Ioc n k)",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ns₂ s₁ s : Finset α\na : α\ng f✝ : α → β\ninst✝ : CommMono... | [
80,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/Order/Filter/CountableInter.lean | countable_iInter_mem | [] | [
54,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/RingTheory/Ideal/Operations.lean | RingHom.ker_eq_comap_bot | [] | [
2009,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2008,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineMap.lean | AffineMap.lineMap_apply_zero | [
{
"state_after": "k : Type u_2\nV1 : Type u_3\nP1 : Type u_1\nV2 : Type ?u.445314\nP2 : Type ?u.445317\nV3 : Type ?u.445320\nP3 : Type ?u.445323\nV4 : Type ?u.445326\nP4 : Type ?u.445329\ninst✝¹² : Ring k\ninst✝¹¹ : AddCommGroup V1\ninst✝¹⁰ : Module k V1\ninst✝⁹ : AffineSpace V1 P1\ninst✝⁸ : AddCommGroup V2\nin... | [
562,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
559,
1
] |
Mathlib/Algebra/Homology/HomologicalComplex.lean | CochainComplex.of_x | [] | [
900,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
899,
1
] |
Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean | CircleDeg1Lift.translationNumber_eq_of_tendsto₀ | [] | [
660,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
656,
1
] |
Mathlib/Data/Seq/WSeq.lean | Stream'.WSeq.map_ret | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\nf : α → β\na : α\n⊢ map f (ret a) = ret (f a)",
"tactic": "simp [ret]"
}
] | [
1418,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1418,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/ZeroMorphisms.lean | CategoryTheory.Limits.IsZero.of_epi_zero | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝³ : Category C\nD : Type u'\ninst✝² : Category D\ninst✝¹ : HasZeroMorphisms C\nX Y : C\ninst✝ : Epi 0\n⊢ 0 ≫ 𝟙 Y = 0 ≫ 0",
"tactic": "simp"
}
] | [
202,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/Data/Finsupp/NeLocus.lean | Finsupp.not_mem_neLocus | [] | [
51,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
50,
1
] |
Mathlib/Topology/MetricSpace/Basic.lean | NNReal.dist_eq | [] | [
1682,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1682,
1
] |
Mathlib/Algebra/Order/Group/Defs.lean | inv_lt_iff_one_lt_mul | [
{
"state_after": "no goals",
"state_before": "α : Type u\ninst✝² : Group α\ninst✝¹ : LT α\ninst✝ : CovariantClass α α (swap fun x x_1 => x * x_1) fun x x_1 => x < x_1\na b c : α\n⊢ a⁻¹ * a < b * a ↔ 1 < b * a",
"tactic": "rw [inv_mul_self]"
}
] | [
297,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
296,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean | Real.arcsin_zero | [] | [
116,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
115,
1
] |
Mathlib/Topology/Order/Hom/Basic.lean | ContinuousOrderHom.toFun_eq_coe | [] | [
114,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
114,
1
] |
Mathlib/LinearAlgebra/LinearPMap.lean | Submodule.valFromGraph_mem | [] | [
949,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
946,
1
] |
Mathlib/Order/Hom/Bounded.lean | BoundedOrderHom.cancel_left | [
{
"state_after": "no goals",
"state_before": "F : Type ?u.76609\nα : Type u_3\nβ : Type u_1\nγ : Type u_2\nδ : Type ?u.76621\ninst✝⁷ : Preorder α\ninst✝⁶ : Preorder β\ninst✝⁵ : Preorder γ\ninst✝⁴ : Preorder δ\ninst✝³ : BoundedOrder α\ninst✝² : BoundedOrder β\ninst✝¹ : BoundedOrder γ\ninst✝ : BoundedOrder δ\... | [
701,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
696,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.foldr_le_nfpBFamily | [] | [
269,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
266,
1
] |
Std/Data/String/Lemmas.lean | Substring.Valid.valid | [
{
"state_after": "no goals",
"state_before": "l m r : List Char\n⊢ l ++ (m ++ r) =\n { str := { data := l ++ m ++ r }, startPos := { byteIdx := utf8Len l },\n stopPos := { byteIdx := utf8Len l + utf8Len m } }.str.data ∧\n { str := { data := l ++ m ++ r }, startPos := { byteIdx := utf8Len ... | [
970,
79
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
969,
1
] |
Mathlib/SetTheory/Ordinal/NaturalOps.lean | NatOrdinal.toOrdinal_max | [] | [
125,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Analysis/SpecialFunctions/Log/Base.lean | Real.logb_prod | [
{
"state_after": "case empty\nb x y : ℝ\nα : Type u_1\ns : Finset α\nf : α → ℝ\nhf✝ : ∀ (x : α), x ∈ s → f x ≠ 0\nhf : ∀ (x : α), x ∈ ∅ → f x ≠ 0\n⊢ logb b (∏ i in ∅, f i) = ∑ i in ∅, logb b (f i)\n\ncase insert\nb x y : ℝ\nα : Type u_1\ns✝ : Finset α\nf : α → ℝ\nhf✝ : ∀ (x : α), x ∈ s✝ → f x ≠ 0\na : α\ns : Fi... | [
397,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
391,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean | CategoryTheory.Limits.Cofork.π_ofπ | [] | [
388,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
387,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.isBigO_norm_norm | [] | [
826,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
825,
1
] |
Mathlib/Algebra/Hom/Centroid.lean | CentroidHom.coe_sub | [] | [
483,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
482,
1
] |
Mathlib/CategoryTheory/Whiskering.lean | CategoryTheory.Functor.assoc | [] | [
276,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
275,
11
] |
Mathlib/Topology/Homeomorph.lean | Homeomorph.preimage_closure | [] | [
344,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
343,
1
] |
Mathlib/Data/Int/Parity.lean | Int.odd_mul | [
{
"state_after": "no goals",
"state_before": "m n : ℤ\n⊢ Odd (m * n) ↔ Odd m ∧ Odd n",
"tactic": "simp [not_or, parity_simps]"
}
] | [
146,
80
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
146,
1
] |
Mathlib/Order/UpperLower/Basic.lean | LowerSet.coe_iInf | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.71521\nγ : Type ?u.71524\nι : Sort u_2\nκ : ι → Sort ?u.71532\ninst✝ : LE α\nS : Set (LowerSet α)\ns t : LowerSet α\na : α\nf : ι → LowerSet α\n⊢ ↑(⨅ (i : ι), f i) = ⋂ (i : ι), ↑(f i)",
"tactic": "simp_rw [iInf, coe_sInf, mem_range,... | [
708,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
707,
1
] |
Mathlib/Data/Matrix/Block.lean | Matrix.blockDiag_neg | [] | [
595,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
594,
1
] |
Mathlib/Logic/Embedding/Basic.lean | Equiv.embeddingCongr_trans | [] | [
438,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
434,
1
] |
src/lean/Init/Data/Nat/Div.lean | Nat.div.inductionOn | [
{
"state_after": "case a\nmotive : Nat → Nat → Sort u\nx y : Nat\nind : (x y : Nat) → 0 < y ∧ y ≤ x → motive (x - y) y → motive x y\nbase : (x y : Nat) → ¬(0 < y ∧ y ≤ x) → motive x y\nh : 0 < y ∧ y ≤ x\n⊢ 0 < y ∧ y ≤ x",
"state_before": "motive : Nat → Nat → Sort u\nx y : Nat\nind : (x y : Nat) → 0 < y ∧ y... | [
40,
46
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
30,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.eventuallyEq_set | [] | [
1446,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1445,
1
] |
Mathlib/Data/Finset/NoncommProd.lean | Multiset.noncommFold_empty | [] | [
97,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
96,
1
] |
Std/Data/String/Lemmas.lean | String.Pos.mk_le_mk | [] | [
141,
81
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
141,
9
] |
Mathlib/Computability/TMToPartrec.lean | Turing.PartrecToTM2.contSupp_fix | [
{
"state_after": "no goals",
"state_before": "f : Code\nk : Cont'\n⊢ contSupp (Cont'.fix f k) = codeSupp f (Cont'.fix f k)",
"tactic": "simp (config := { contextual := true }) [codeSupp, codeSupp', contSupp, Finset.union_assoc,\n Finset.subset_iff]"
}
] | [
1886,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1884,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.