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/SetTheory/Game/PGame.lean | PGame.fuzzy_of_fuzzy_of_equiv | [] | [
976,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
975,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.pow_apply | [] | [
1283,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1283,
1
] |
Mathlib/Order/Filter/NAry.lean | Filter.map_map₂_distrib | [
{
"state_after": "no goals",
"state_before": "α : Type u_3\nα' : Type u_5\nβ : Type u_4\nβ' : Type u_6\nγ : Type u_2\nγ' : Type ?u.39560\nδ : Type u_1\nδ' : Type ?u.39566\nε : Type ?u.39569\nε' : Type ?u.39572\nm : α → β → γ\nf f₁ f₂ : Filter α\ng g₁ g₂ : Filter β\nh h₁ h₂ : Filter γ\ns s₁ s₂ : Set α\nt t₁ ... | [
329,
63
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
326,
1
] |
Mathlib/SetTheory/Lists.lean | Lists.to_ofList | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nl : List (Lists α)\n⊢ toList (ofList l) = l",
"tactic": "simp [ofList, of']"
}
] | [
251,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
251,
1
] |
Mathlib/RingTheory/FractionalIdeal.lean | FractionalIdeal.spanSingleton_zero | [
{
"state_after": "case a\nR : Type u_2\ninst✝⁶ : CommRing R\nS : Submonoid R\nP : Type u_1\ninst✝⁵ : CommRing P\ninst✝⁴ : Algebra R P\nloc : IsLocalization S P\nR₁ : Type ?u.1321354\ninst✝³ : CommRing R₁\nK : Type ?u.1321360\ninst✝² : Field K\ninst✝¹ : Algebra R₁ K\ninst✝ : IsFractionRing R₁ K\nx✝ : P\n⊢ x✝ ∈ s... | [
1345,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1343,
1
] |
Mathlib/Algebra/TrivSqZeroExt.lean | TrivSqZeroExt.inl_fst_add_inr_snd_eq | [] | [
387,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
385,
1
] |
Mathlib/CategoryTheory/Category/Basic.lean | CategoryTheory.eq_of_comp_left_eq | [
{
"state_after": "no goals",
"state_before": "C : Type u\ninst✝ : Category C\nX Y Z : C\nf g : X ⟶ Y\nw : ∀ {Z : C} (h : Y ⟶ Z), f ≫ h = g ≫ h\n⊢ f = g",
"tactic": "convert w (𝟙 Y) <;>\naesop"
}
] | [
213,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
210,
1
] |
Mathlib/Algebra/Associated.lean | pow_not_prime | [] | [
368,
73
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
367,
1
] |
Mathlib/NumberTheory/Padics/PadicIntegers.lean | PadicInt.mul_inv | [
{
"state_after": "p : ℕ\nhp : Fact (Nat.Prime p)\nk : ℚ_[p]\nproperty✝ : ‖k‖ ≤ 1\nh : ‖{ val := k, property := property✝ }‖ = 1\nhk : k ≠ 0\n⊢ { val := k, property := property✝ } * inv { val := k, property := property✝ } = 1",
"state_before": "p : ℕ\nhp : Fact (Nat.Prime p)\nk : ℚ_[p]\nproperty✝ : ‖k‖ ≤ 1\n... | [
440,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
432,
1
] |
Mathlib/Data/Nat/Log.lean | Nat.log_mul_base | [
{
"state_after": "case h₁\nb n : ℕ\nhb : 1 < b\nhn : n ≠ 0\n⊢ b ^ log b n * b ≤ n * b\n\ncase h₂\nb n : ℕ\nhb : 1 < b\nhn : n ≠ 0\n⊢ n * b < b ^ (log b n + 1) * b",
"state_before": "b n : ℕ\nhb : 1 < b\nhn : n ≠ 0\n⊢ log b (n * b) = log b n + 1",
"tactic": "apply log_eq_of_pow_le_of_lt_pow <;> rw [pow_s... | [
176,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
173,
1
] |
Mathlib/Data/Int/GCD.lean | Int.gcd_div | [
{
"state_after": "i j k : ℤ\nH1 : k ∣ i\nH2 : k ∣ j\n⊢ Nat.gcd (natAbs i / natAbs k) (natAbs j / natAbs k) = gcd i j / natAbs k",
"state_before": "i j k : ℤ\nH1 : k ∣ i\nH2 : k ∣ j\n⊢ gcd (i / k) (j / k) = gcd i j / natAbs k",
"tactic": "rw [gcd, natAbs_ediv i k H1, natAbs_ediv j k H2]"
},
{
"st... | [
330,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
327,
1
] |
Mathlib/Data/Set/Image.lean | Set.preimage_subset_preimage_iff | [
{
"state_after": "case mp\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.77161\nι : Sort ?u.77164\nι' : Sort ?u.77167\nf✝ : ι → α\ns✝ t✝ s t : Set α\nf : β → α\nhs : s ⊆ range f\n⊢ f ⁻¹' s ⊆ f ⁻¹' t → s ⊆ t\n\ncase mpr\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.77161\nι : Sort ?u.77164\nι' : Sort ?u.77167\nf✝ : ι → α\n... | [
826,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
820,
1
] |
Mathlib/RingTheory/IntegrallyClosed.lean | IsIntegrallyClosed.integralClosure_eq_bot | [] | [
124,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
123,
1
] |
Mathlib/Algebra/Algebra/Operations.lean | Submodule.map_op_pow | [
{
"state_after": "no goals",
"state_before": "ι : Sort uι\nR : Type u\ninst✝² : CommSemiring R\nA : Type v\ninst✝¹ : Semiring A\ninst✝ : Algebra R A\nS T : Set A\nM N P Q : Submodule R A\nm n✝ : A\nn : ℕ\n⊢ map (↑(opLinearEquiv R)) (M ^ n) = map (↑(opLinearEquiv R)) M ^ n",
"tactic": "rw [map_equiv_eq_c... | [
543,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
540,
1
] |
Mathlib/MeasureTheory/Measure/Regular.lean | MeasurableSet.exists_lt_isCompact_of_ne_top | [] | [
524,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
521,
1
] |
Mathlib/Data/Set/Image.lean | Set.range_const_subset | [] | [
995,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
994,
1
] |
Mathlib/Topology/UniformSpace/Basic.lean | Filter.HasBasis.uniformContinuousOn_iff | [
{
"state_after": "no goals",
"state_before": "α : Type ua\nβ : Type ub\nγ : Type uc\nδ : Type ud\nι : Sort u_2\ninst✝¹ : UniformSpace α\nι' : Sort u_1\ninst✝ : UniformSpace β\np : ι → Prop\ns : ι → Set (α × α)\nha : HasBasis (𝓤 α) p s\nq : ι' → Prop\nt : ι' → Set (β × β)\nhb : HasBasis (𝓤 β) q t\nf : α → ... | [
1152,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1146,
1
] |
Mathlib/Data/Set/Basic.lean | Set.nontrivial_iff_exists_ne | [] | [
2497,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2496,
1
] |
Mathlib/Data/List/Join.lean | List.sum_take_map_length_lt2 | [
{
"state_after": "case h.e'_4\nα : Type u_1\nβ : Type ?u.13935\nL : List (List α)\ni j : ℕ\nhi : i < length L\nhj : j < length (nthLe L i hi)\n⊢ length (join L) = (fun i => sum (take i (map length L))) (length L)",
"state_before": "α : Type u_1\nβ : Type ?u.13935\nL : List (List α)\ni j : ℕ\nhi : i < length... | [
174,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/RingTheory/WittVector/Defs.lean | WittVector.constantCoeff_wittZSMul | [
{
"state_after": "p : ℕ\nR : Type ?u.198597\nhp : Fact (Nat.Prime p)\ninst✝ : CommRing R\nz : ℤ\nn : ℕ\n⊢ ↑constantCoeff (z • X 0) = 0",
"state_before": "p : ℕ\nR : Type ?u.198597\nhp : Fact (Nat.Prime p)\ninst✝ : CommRing R\nz : ℤ\nn : ℕ\n⊢ ↑constantCoeff (wittZSMul p z n) = 0",
"tactic": "apply consta... | [
326,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
324,
1
] |
Mathlib/Algebra/CharZero/Defs.lean | Nat.cast_add_one_ne_zero | [
{
"state_after": "R : Type u_1\ninst✝¹ : AddMonoidWithOne R\ninst✝ : CharZero R\nn : ℕ\n⊢ ¬n + 1 = 0",
"state_before": "R : Type u_1\ninst✝¹ : AddMonoidWithOne R\ninst✝ : CharZero R\nn : ℕ\n⊢ ↑n + 1 ≠ 0",
"tactic": "norm_cast"
},
{
"state_after": "no goals",
"state_before": "R : Type u_1\nin... | [
88,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
85,
1
] |
Mathlib/Topology/Sequences.lean | seqClosure_subset_closure | [] | [
91,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Std/Data/Int/Lemmas.lean | Int.le_sub_right_of_add_le | [
{
"state_after": "a b c : Int\nh✝ : a + b ≤ c\nh : a + b + -b ≤ c + -b\n⊢ a ≤ c - b",
"state_before": "a b c : Int\nh : a + b ≤ c\n⊢ a ≤ c - b",
"tactic": "have h := Int.add_le_add_right h (-b)"
},
{
"state_after": "no goals",
"state_before": "a b c : Int\nh✝ : a + b ≤ c\nh : a + b + -b ≤ c ... | [
972,
38
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
970,
11
] |
Mathlib/LinearAlgebra/Matrix/Determinant.lean | Matrix.det_updateColumn_add_smul_self | [
{
"state_after": "m : Type ?u.1700808\nn : Type u_1\ninst✝⁴ : DecidableEq n\ninst✝³ : Fintype n\ninst✝² : DecidableEq m\ninst✝¹ : Fintype m\nR : Type v\ninst✝ : CommRing R\nA : Matrix n n R\ni j : n\nhij : i ≠ j\nc : R\n⊢ det (updateRow Aᵀ i fun k => A k i + c • A k j) = det Aᵀ",
"state_before": "m : Type ?... | [
469,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
466,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean | AffineEquiv.toAffineMap_mk | [] | [
73,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/Algebra/Module/Torsion.lean | Submodule.torsionBy_torsionBy_eq_top | [] | [
367,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
366,
1
] |
Mathlib/Data/Complex/Module.lean | Complex.liftAux_neg_I | [] | [
394,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
393,
1
] |
Mathlib/Topology/MetricSpace/EMetricSpace.lean | EMetric.closedBall_mem_nhds | [] | [
705,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
704,
1
] |
Std/Data/String/Lemmas.lean | Substring.Valid.validFor | [
{
"state_after": "l mr lm r : List Char\ne : lm ++ r = l ++ mr\nh : utf8Len l ≤ utf8Len lm\n⊢ ∃ l_1 m r,\n ValidFor l_1 m r\n { str := { data := l ++ mr }, startPos := { byteIdx := utf8Len l }, stopPos := { byteIdx := utf8Len lm } }",
"state_before": "l mr lm r : List Char\ne :\n lm ++ r =\n { s... | [
967,
73
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
957,
1
] |
Mathlib/Data/List/Basic.lean | List.get_insertNth_of_lt | [
{
"state_after": "case zero\nι : Type ?u.124628\nα : Type u\nβ : Type v\nγ : Type w\nδ : Type x\nl₁ l₂ : List α\na : α\nl✝ : List α\nx : α\nn k✝ : ℕ\nhn✝ : k✝ < n\nhk✝ : k✝ < length l✝\nhk'✝ : optParam (k✝ < length (insertNth n x l✝)) (_ : k✝ < length (insertNth n x l✝))\nl : List α\nk : ℕ\nhn : k < zero\nhk : ... | [
1706,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1696,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | Summable.comp_injective | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type u_3\nδ : Type ?u.755506\ninst✝³ : AddCommGroup α\ninst✝² : UniformSpace α\ninst✝¹ : UniformAddGroup α\nf g : β → α\na a₁ a₂ : α\ninst✝ : CompleteSpace α\ni : γ → β\nhf : Summable f\nhi : Injective i\n⊢ Summable (f ∘ i)",
... | [
1180,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1177,
1
] |
Mathlib/LinearAlgebra/InvariantBasisNumber.lean | card_le_of_injective | [
{
"state_after": "R : Type u\ninst✝³ : Semiring R\ninst✝² : StrongRankCondition R\nα : Type u_1\nβ : Type u_2\ninst✝¹ : Fintype α\ninst✝ : Fintype β\nf : (α → R) →ₗ[R] β → R\ni : Injective ↑f\nP : (Fin (Fintype.card α) → R) ≃ₗ[R] α → R := LinearEquiv.funCongrLeft R R (Fintype.equivFin α)\n⊢ Fintype.card α ≤ Fin... | [
115,
79
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
109,
1
] |
Mathlib/Data/PEquiv.lean | PEquiv.mem_trans | [] | [
152,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/StrictInitial.lean | CategoryTheory.Limits.initial.hom_ext | [] | [
125,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
124,
1
] |
Mathlib/Algebra/Module/Equiv.lean | LinearEquiv.coe_coe | [] | [
215,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Data/Int/Order/Units.lean | Int.units_pow_eq_pow_mod_two | [
{
"state_after": "no goals",
"state_before": "u : ℤˣ\nn : ℕ\n⊢ u ^ n = u ^ (n % 2)",
"tactic": "conv =>\n lhs\n rw [← Nat.mod_add_div n 2];\n rw [pow_add, pow_mul, units_sq, one_pow, mul_one]"
}
] | [
71,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
67,
1
] |
Mathlib/Order/GaloisConnection.lean | GaloisConnection.le_u | [] | [
99,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/SetTheory/ZFC/Basic.lean | PSet.Equiv.symm | [] | [
193,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
192,
11
] |
Mathlib/Data/Part.lean | Part.of_toOption | [] | [
385,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
384,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.Valid'.balanceL_aux | [
{
"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₁ : size l = 0 → size r ≤ 1\nH₂ : 1 ≤ size l → 1 ≤ size r → size r ≤ delta * size l\nH₃ : 2 * size l ≤ 9 * size r + 5 ∨ size l ≤ 3\n⊢ Valid' o₁ (O... | [
1359,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1350,
1
] |
src/lean/Init/Core.lean | funext | [
{
"state_after": "a b c d : Prop\nα✝ : Type u\nr : α✝ → α✝ → Prop\nα : Sort u\nβ : α → Sort v\nf g : (x : α) → β x\nh : ∀ (x : α), f x = g x\neqv : ((x : α) → β x) → ((x : α) → β x) → Prop := fun f g => ∀ (x : α), f x = g x\n⊢ f = g",
"state_before": "a b c d : Prop\nα✝ : Type u\nr : α✝ → α✝ → Prop\nα : Sor... | [
1563,
42
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
1555,
1
] |
Mathlib/Algebra/Order/Field/Power.lean | zpow_two_pos_of_ne_zero | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : LinearOrderedField α\na b c d : α\nn : ℤ\nh : a ≠ 0\n⊢ 0 < a ^ 2",
"tactic": "convert zpow_bit0_pos h 1"
}
] | [
146,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
145,
1
] |
Mathlib/MeasureTheory/Function/AEEqFun.lean | MeasureTheory.AEEqFun.mk_eq_mk | [] | [
162,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Order/RelIso/Basic.lean | RelIso.coe_fn_injective | [] | [
691,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
690,
1
] |
Mathlib/Order/Lattice.lean | inf_eq_inf_iff_left | [] | [
552,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
551,
1
] |
Mathlib/MeasureTheory/Decomposition/SignedHahn.lean | MeasureTheory.SignedMeasure.bddBelow_measureOfNegatives | [
{
"state_after": "α : Type u_1\nβ : Type ?u.101130\ninst✝³ : MeasurableSpace α\nM : Type ?u.101136\ninst✝² : AddCommMonoid M\ninst✝¹ : TopologicalSpace M\ninst✝ : OrderedAddCommMonoid M\ns : SignedMeasure α\ni j : Set α\n⊢ ∃ x, ∀ (x_1 : ℝ), x_1 ∈ measureOfNegatives s → x ≤ x_1",
"state_before": "α : Type u_... | [
368,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
346,
1
] |
Mathlib/Data/Complex/Basic.lean | Complex.isCauSeq_conj | [
{
"state_after": "f : CauSeq ℂ ↑abs\nε : ℝ\nε0 : ε > 0\ni : ℕ\nhi : ∀ (j : ℕ), j ≥ i → ↑abs (↑f j - ↑f i) < ε\nj : ℕ\nhj : j ≥ i\n⊢ ↑abs (↑f j - ↑f i) < ε",
"state_before": "f : CauSeq ℂ ↑abs\nε : ℝ\nε0 : ε > 0\ni : ℕ\nhi : ∀ (j : ℕ), j ≥ i → ↑abs (↑f j - ↑f i) < ε\nj : ℕ\nhj : j ≥ i\n⊢ ↑abs ((fun n => ↑(st... | [
1310,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1306,
1
] |
Mathlib/Data/Matrix/Basic.lean | Matrix.updateRow_self | [] | [
2751,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2749,
1
] |
Mathlib/Topology/ContinuousFunction/Bounded.lean | BoundedContinuousFunction.coe_ofNormedAddCommGroup | [] | [
885,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
883,
1
] |
Mathlib/LinearAlgebra/FreeModule/Finite/Matrix.lean | FiniteDimensional.finrank_linearMap | [
{
"state_after": "no goals",
"state_before": "R : Type u\nM : Type v\nN : Type w\ninst✝⁹ : CommRing R\ninst✝⁸ : StrongRankCondition R\ninst✝⁷ : AddCommGroup M\ninst✝⁶ : Module R M\ninst✝⁵ : Module.Free R M\ninst✝⁴ : Module.Finite R M\ninst✝³ : AddCommGroup N\ninst✝² : Module R N\ninst✝¹ : Module.Free R N\ni... | [
96,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/Topology/MetricSpace/Infsep.lean | Set.einfsep_singleton | [] | [
137,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
136,
1
] |
Mathlib/Order/Cover.lean | wcovby_iff_covby_or_eq | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.36173\ninst✝ : PartialOrder α\na b c : α\n⊢ a ⩿ b ↔ a ⋖ b ∨ a = b",
"tactic": "rw [le_antisymm_iff, wcovby_iff_covby_or_le_and_le]"
}
] | [
382,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
381,
1
] |
Mathlib/Topology/MetricSpace/HausdorffDistance.lean | Metric.thickening_eq_biUnion_ball | [
{
"state_after": "case h\nι : Sort ?u.96949\nα : Type u\nβ : Type v\ninst✝¹ : PseudoEMetricSpace α\nδ✝ : ℝ\ns : Set α\nx✝ : α\nX : Type u\ninst✝ : PseudoMetricSpace X\nδ : ℝ\nE : Set X\nx : X\n⊢ x ∈ thickening δ E ↔ x ∈ ⋃ (x : X) (_ : x ∈ E), ball x δ",
"state_before": "ι : Sort ?u.96949\nα : Type u\nβ : Ty... | [
999,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
996,
1
] |
Mathlib/Logic/Equiv/Defs.lean | Equiv.refl_trans | [
{
"state_after": "case mk\nα : Sort u\nβ : Sort v\nγ : Sort w\ntoFun✝ : α → β\ninvFun✝ : β → α\nleft_inv✝ : LeftInverse invFun✝ toFun✝\nright_inv✝ : Function.RightInverse invFun✝ toFun✝\n⊢ (Equiv.refl α).trans { toFun := toFun✝, invFun := invFun✝, left_inv := left_inv✝, right_inv := right_inv✝ } =\n { toFun ... | [
347,
87
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
347,
9
] |
Mathlib/Topology/Connected.lean | nonempty_frontier_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nι : Type ?u.71012\nπ : ι → Type ?u.71017\ninst✝¹ : TopologicalSpace α\ns✝ t u v : Set α\ninst✝ : PreconnectedSpace α\ns : Set α\n⊢ Set.Nonempty (frontier s) ↔ Set.Nonempty s ∧ s ≠ univ",
"tactic": "simp only [nonempty_iff_ne_empty, Ne... | [
858,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
856,
1
] |
Mathlib/RingTheory/Subring/Basic.lean | Subring.coe_toSubsemiring | [] | [
519,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
518,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Ioc_subset_Ioc_left | [] | [
489,
26
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
488,
1
] |
Mathlib/Algebra/Order/Sub/Defs.lean | lt_tsub_iff_left | [] | [
425,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
424,
1
] |
Mathlib/Analysis/Convex/Side.lean | AffineSubspace.setOf_wOppSide_eq_image2 | [
{
"state_after": "case h\nR : Type u_1\nV : Type u_2\nV' : Type ?u.423675\nP : Type u_3\nP' : Type ?u.423681\ninst✝⁶ : LinearOrderedField R\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P'\ns : AffineSubspace R P\nx p ... | [
821,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
805,
1
] |
Mathlib/Data/Set/Pointwise/SMul.lean | Set.set_smul_subset_iff | [] | [
917,
85
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
915,
1
] |
Mathlib/FieldTheory/Adjoin.lean | IntermediateField.mem_bot | [] | [
93,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
92,
1
] |
Mathlib/Algebra/AddTorsor.lean | Equiv.pointReflection_self | [] | [
458,
16
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
457,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Localization.mk_eq_mk_iff' | [
{
"state_after": "α : Type u_1\ninst✝ : CancelCommMonoid α\ns : Submonoid α\na₁ b₁ : α\na₂ b₂ : { x // x ∈ s }\nthis : Nonempty { x // x ∈ s }\n⊢ mk a₁ a₂ = mk b₁ b₂ ↔ ↑b₂ * a₁ = ↑a₂ * b₁",
"state_before": "α : Type u_1\ninst✝ : CancelCommMonoid α\ns : Submonoid α\na₁ b₁ : α\na₂ b₂ : { x // x ∈ s }\n⊢ mk a₁... | [
1897,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1894,
1
] |
Mathlib/Data/PFunctor/Multivariate/W.lean | MvPFunctor.comp_wPathCasesOn | [
{
"state_after": "case a.h\nn : ℕ\nP : MvPFunctor (n + 1)\nα : TypeVec n\nβ : TypeVec n\nh : α ⟹ β\na : P.A\nf : PFunctor.B (last P) a → PFunctor.W (last P)\ng' : B (drop P) a ⟹ α\ng : (j : PFunctor.B (last P) a) → WPath P (f j) ⟹ α\ni : Fin2 n\nx : WPath P (WType.mk a fun j => f j) i\n⊢ (h ⊚ wPathCasesOn P g' ... | [
121,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
118,
1
] |
Mathlib/Data/PNat/Defs.lean | PNat.not_lt_one | [] | [
183,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Analysis/SpecialFunctions/Complex/Circle.lean | Real.Angle.expMapCircle_coe | [] | [
120,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
119,
1
] |
Mathlib/Data/Nat/Interval.lean | Nat.Ico_eq_range' | [] | [
72,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/CategoryTheory/Monoidal/CoherenceLemmas.lean | CategoryTheory.MonoidalCategory.leftUnitor_inv_tensor_id | [
{
"state_after": "no goals",
"state_before": "C : Type u_2\ninst✝¹ : Category C\ninst✝ : MonoidalCategory C\nX Y : C\n⊢ (λ_ X).inv ⊗ 𝟙 Y = (λ_ (X ⊗ Y)).inv ≫ (α_ tensorUnit' X Y).inv",
"tactic": "coherence"
}
] | [
55,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
1
] |
Mathlib/Data/Nat/Factorization/Basic.lean | Nat.eq_of_factorization_eq | [
{
"state_after": "no goals",
"state_before": "a b : ℕ\nha : a ≠ 0\nhb : b ≠ 0\nh : ∀ (p : ℕ), ↑(factorization a) p = ↑(factorization b) p\n⊢ factors a ~ factors b",
"tactic": "simpa only [List.perm_iff_count, factors_count_eq] using h"
}
] | [
114,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
112,
1
] |
Mathlib/LinearAlgebra/Orientation.lean | Basis.abs_det_adjustToOrientation | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\ninst✝⁶ : LinearOrderedCommRing R\nM : Type u_3\ninst✝⁵ : AddCommGroup M\ninst✝⁴ : Module R M\nι : Type u_2\ninst✝³ : Fintype ι\ninst✝² : DecidableEq ι\ninst✝¹ : Nontrivial R\ninst✝ : Nonempty ι\ne : Basis ι R M\nx : Orientation R M ι\nv : ι → M\n⊢ ... | [
318,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
316,
1
] |
Mathlib/Data/Sym/Sym2.lean | Sym2.diag_isDiag | [] | [
451,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
450,
1
] |
Mathlib/Topology/Order/Basic.lean | ge_of_tendsto' | [] | [
203,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/LinearAlgebra/AffineSpace/Independent.lean | Affine.Simplex.reindex_range_points | [
{
"state_after": "no goals",
"state_before": "k : Type u_1\nV : Type u_2\nP : Type u_3\ninst✝³ : Ring k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\nm n : ℕ\ns : Simplex k P m\ne : Fin (m + 1) ≃ Fin (n + 1)\n⊢ Set.range (reindex s e).points = Set.range s.points",
"tactic": "rw... | [
904,
68
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
902,
1
] |
Mathlib/Topology/Basic.lean | isClosed_closure | [] | [
416,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
415,
1
] |
Std/Data/RBMap/Lemmas.lean | Std.RBNode.Stream.forIn_eq_forIn_toList | [
{
"state_after": "m : Type u_1 → Type u_2\nα : Type u_3\nα✝ : Type u_1\ninit : α✝\nf : α → α✝ → m (ForInStep α✝)\ninst✝¹ : Monad m\ninst✝ : LawfulMonad m\nt : RBNode α\n⊢ ForInStep.run <$> forIn.visit f t init = forIn (RBNode.toList t) init f",
"state_before": "m : Type u_1 → Type u_2\nα : Type u_3\nα✝ : Ty... | [
387,
83
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
385,
1
] |
Mathlib/Data/Nat/Parity.lean | Even.mod_even | [] | [
363,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
362,
1
] |
Mathlib/LinearAlgebra/Ray.lean | SameRay.exists_pos | [] | [
99,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
97,
1
] |
Mathlib/Data/Ordmap/Ordset.lean | Ordnode.all_rotateL | [
{
"state_after": "case node\nα : Type u_1\nP : α → Prop\nl : Ordnode α\nx : α\nsize✝ : ℕ\nl✝ : Ordnode α\nx✝ : α\nr✝ : Ordnode α\n⊢ All P (if size l✝ < ratio * size r✝ then node3L l x l✝ x✝ r✝ else node4L l x l✝ x✝ r✝) ↔\n All P l ∧ P x ∧ All P (node size✝ l✝ x✝ r✝)",
"state_before": "α : Type u_1\nP : α... | [
519,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
517,
1
] |
Mathlib/Topology/Order.lean | TopologicalSpace.le_def | [] | [
164,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
163,
11
] |
Mathlib/Data/Nat/Order/Lemmas.lean | Nat.dvd_iff_le_div_mul | [] | [
172,
95
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
171,
1
] |
Mathlib/Algebra/AddTorsor.lean | Equiv.injective_pointReflection_left_of_injective_bit0 | [
{
"state_after": "no goals",
"state_before": "G✝ : Type ?u.56742\nP✝ : Type ?u.56745\ninst✝³ : AddGroup G✝\ninst✝² : AddTorsor G✝ P✝\nG : Type u_1\nP : Type u_2\ninst✝¹ : AddCommGroup G\ninst✝ : AddTorsor G P\nh : Injective bit0\ny x₁ x₂ : P\nhy : ↑(pointReflection x₁) y = ↑(pointReflection x₂) y\n⊢ x₁ = x₂... | [
484,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
478,
1
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.isBigOWith_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.1884\nE : Type u_2\nF : Type u_3\nG : Type ?u.1893\nE' : Type ?u.1896\nF' : Type ?u.1899\nG' : Type ?u.1902\nE'' : Type ?u.1905\nF'' : Type ?u.1908\nG'' : Type ?u.1911\nR : Type ?u.1914\nR' : Type ?u.1917\n𝕜 : Type ?u.1920\n𝕜' : Type ... | [
95,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/Algebra/Lie/Submodule.lean | LieHom.ker_eq_bot | [
{
"state_after": "no goals",
"state_before": "R : Type u\nL : Type v\nL' : Type w₂\nM : Type w\nM' : Type w₁\ninst✝¹² : CommRing R\ninst✝¹¹ : LieRing L\ninst✝¹⁰ : LieAlgebra R L\ninst✝⁹ : LieRing L'\ninst✝⁸ : LieAlgebra R L'\ninst✝⁷ : AddCommGroup M\ninst✝⁶ : Module R M\ninst✝⁵ : LieRingModule L M\ninst✝⁴ :... | [
981,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
979,
1
] |
Mathlib/Analysis/Calculus/Inverse.lean | ApproximatesLinearOn.antilipschitz | [
{
"state_after": "case inl\n𝕜 : Type u_1\ninst✝⁹ : NontriviallyNormedField 𝕜\nE : Type u_2\ninst✝⁸ : NormedAddCommGroup E\ninst✝⁷ : NormedSpace 𝕜 E\nF : Type u_3\ninst✝⁶ : NormedAddCommGroup F\ninst✝⁵ : NormedSpace 𝕜 F\nG : Type ?u.329645\ninst✝⁴ : NormedAddCommGroup G\ninst✝³ : NormedSpace 𝕜 G\nG' : Type ... | [
374,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
368,
11
] |
Mathlib/Analysis/NormedSpace/BallAction.lean | ne_neg_of_mem_unit_sphere | [] | [
211,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
210,
1
] |
Mathlib/Topology/FiberBundle/Trivialization.lean | Trivialization.toPretrivialization_injective | [
{
"state_after": "case h₁\nι : Type ?u.21592\nB : Type u_1\nF : Type u_2\nE : B → Type ?u.21603\nZ : Type u_3\ninst✝³ : TopologicalSpace B\ninst✝² : TopologicalSpace F\nproj : Z → B\ninst✝¹ : TopologicalSpace Z\ninst✝ : TopologicalSpace (TotalSpace E)\ne✝ : Trivialization F proj\nx : Z\ne e' : Trivialization F ... | [
344,
43
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
340,
1
] |
Mathlib/Topology/MetricSpace/EMetricSpace.lean | ULift.edist_up_up | [] | [
442,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
442,
1
] |
Mathlib/Topology/Algebra/Monoid.lean | continuousMul_iInf | [
{
"state_after": "ι : Type ?u.456770\nα : Type ?u.456773\nX : Type ?u.456776\nM : Type u_1\nN : Type ?u.456782\ninst✝¹ : TopologicalSpace X\nι' : Sort u_2\ninst✝ : Mul M\nts : ι' → TopologicalSpace M\nh' : ∀ (i : ι'), ContinuousMul M\n⊢ ContinuousMul M",
"state_before": "ι : Type ?u.456770\nα : Type ?u.4567... | [
853,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
850,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.pred_succAbove_pred | [
{
"state_after": "case inl\nn m : ℕ\na : Fin (n + 2)\nb : Fin (n + 1)\nha : a ≠ 0\nhb : b ≠ 0\nhk : optParam (↑(succAbove a) b ≠ 0) (_ : ↑(succAbove a) b ≠ 0)\nhbelow : ↑castSucc b < a\n⊢ ↑(succAbove (pred a ha)) (pred b hb) = pred (↑(succAbove a) b) hk\n\ncase inr\nn m : ℕ\na : Fin (n + 2)\nb : Fin (n + 1)\nha... | [
2423,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2412,
1
] |
Mathlib/Topology/LocallyFinite.lean | LocallyFinite.point_finite | [] | [
42,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
40,
1
] |
Mathlib/Data/ZMod/Basic.lean | ZMod.coe_unitOfCoprime | [] | [
692,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
690,
1
] |
Mathlib/Analysis/SpecialFunctions/Exp.lean | ContinuousOn.exp | [] | [
158,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
157,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Ioo_subset_Ioc_union_Ioo | [] | [
1558,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1557,
1
] |
Mathlib/Init/Data/Nat/Lemmas.lean | Nat.bit1_inj | [
{
"state_after": "n m : ℕ\nh : bit0 n = bit0 m\n⊢ succ (bit0 n) = succ (bit0 m)",
"state_before": "n m : ℕ\nh : bit1 n = bit1 m\n⊢ succ (bit0 n) = succ (bit0 m)",
"tactic": "simp [Nat.bit1_eq_succ_bit0] at h"
},
{
"state_after": "no goals",
"state_before": "n m : ℕ\nh : bit0 n = bit0 m\n⊢ su... | [
136,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
133,
11
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Homeomorph.isBigO_congr | [
{
"state_after": "α : Type u_1\nβ : Type u_2\ninst✝³ : TopologicalSpace α\ninst✝² : TopologicalSpace β\nE : Type u_3\ninst✝¹ : Norm E\nF : Type u_4\ninst✝ : Norm F\ne : α ≃ₜ β\nb : β\nf : β → E\ng : β → F\n⊢ (∃ c, IsBigOWith c (𝓝 b) f g) ↔ ∃ c, IsBigOWith c (𝓝 (↑(Homeomorph.symm e) b)) (f ∘ ↑e) (g ∘ ↑e)",
... | [
2229,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2226,
1
] |
Mathlib/RingTheory/MvPolynomial/WeightedHomogeneous.lean | MvPolynomial.isWeightedHomogeneous_monomial | [
{
"state_after": "R : Type u_3\nM : Type u_2\ninst✝¹ : CommSemiring R\nσ : Type u_1\ninst✝ : AddCommMonoid M\nw : σ → M\nd : σ →₀ ℕ\nr : R\nm : M\nhm : ↑(weightedDegree' w) d = m\nc : σ →₀ ℕ\nhc : coeff c (↑(monomial d) r) ≠ 0\n⊢ ↑(weightedDegree' w) c = m",
"state_before": "R : Type u_3\nM : Type u_2\ninst... | [
202,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
194,
1
] |
Mathlib/CategoryTheory/Limits/Final.lean | CategoryTheory.Functor.Initial.limit_pre_is_iso_aux | [
{
"state_after": "C : Type u₁\ninst✝³ : Category C\nD : Type u₂\ninst✝² : Category D\nF : C ⥤ D\ninst✝¹ : Initial F\nE : Type u₃\ninst✝ : Category E\nG : D ⥤ E\nt : Cone G\nP : IsLimit t\n⊢ 𝟙 t.pt ≫ IsLimit.lift P (extendCone.obj (Cone.whisker F t)) = 𝟙 t.pt",
"state_before": "C : Type u₁\ninst✝³ : Catego... | [
585,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
580,
1
] |
Mathlib/Analysis/Calculus/ContDiffDef.lean | HasFTaylorSeriesUpToOn.congr | [
{
"state_after": "𝕜 : 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✝¹ : NormedAdd... | [
207,
23
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/Analysis/NormedSpace/FiniteDimension.lean | AffineEquiv.continuous_of_finiteDimensional | [] | [
140,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/Data/Finset/Card.lean | Finset.card_mk | [] | [
55,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
54,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.