file_path stringlengths 11 79 | full_name stringlengths 2 100 | traced_tactics list | end list | commit stringclasses 4
values | url stringclasses 4
values | start list |
|---|---|---|---|---|---|---|
Mathlib/GroupTheory/OrderOfElement.lean | orderOf_eq_zero_iff | [] | [
173,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
172,
1
] |
Mathlib/Data/IsROrC/Basic.lean | IsROrC.ofReal_finsupp_prod | [] | [
265,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
263,
1
] |
Mathlib/Algebra/GeomSum.lean | Odd.nat_add_dvd_pow_add_pow | [
{
"state_after": "no goals",
"state_before": "α : Type u\nx y n : ℕ\nh : Odd n\n⊢ x + y ∣ x ^ n + y ^ n",
"tactic": "exact_mod_cast Odd.add_dvd_pow_add_pow (x : ℤ) (↑y) h"
}
] | [
216,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
215,
1
] |
Mathlib/Data/Nat/Factors.lean | Nat.factors_unique | [
{
"state_after": "case refine'_1\nn : ℕ\nl : List ℕ\nh₁ : prod l = n\nh₂ : ∀ (p : ℕ), p ∈ l → Prime p\n⊢ prod l = prod (factors n)\n\ncase refine'_2\nn : ℕ\nl : List ℕ\nh₁ : prod l = n\nh₂ : ∀ (p : ℕ), p ∈ l → Prime p\n⊢ ∀ (p : ℕ), p ∈ l → _root_.Prime p\n\ncase refine'_3\nn : ℕ\nl : List ℕ\nh₁ : prod l = n\nh₂... | [
181,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/SetTheory/ZFC/Basic.lean | ZFSet.regularity | [] | [
1222,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1216,
1
] |
Mathlib/Algebra/Group/Semiconj.lean | SemiconjBy.eq | [] | [
46,
4
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
45,
11
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/ContinuousLinearMap.lean | ContinuousLinearMap.measurable_coe | [] | [
74,
42
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/Data/Finset/Sigma.lean | Finset.mem_sigma | [] | [
53,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
52,
1
] |
Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean | MeasureTheory.SimpleFunc.memℒp_of_finite_measure_preimage | [
{
"state_after": "case pos\nα : Type u_1\nβ : Type ?u.1422783\nι : Type ?u.1422786\nE : Type u_2\nF : Type ?u.1422792\n𝕜 : Type ?u.1422795\ninst✝² : MeasurableSpace α\ninst✝¹ : NormedAddCommGroup E\ninst✝ : NormedAddCommGroup F\nμ : Measure α\np✝ p : ℝ≥0∞\nf : α →ₛ E\nhf : ∀ (y : E), y ≠ 0 → ↑↑μ (↑f ⁻¹' {y}) <... | [
354,
86
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
342,
1
] |
Mathlib/MeasureTheory/Function/SimpleFunc.lean | MeasureTheory.SimpleFunc.bind_const | [
{
"state_after": "case H\nα : Type u_1\nβ : Type u_2\nγ : Type ?u.64948\nδ : Type ?u.64951\ninst✝ : MeasurableSpace α\nf : α →ₛ β\na✝ : α\n⊢ ↑(bind f (const α)) a✝ = ↑f a✝",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.64948\nδ : Type ?u.64951\ninst✝ : MeasurableSpace α\nf : α →ₛ β\n⊢ bind f (co... | [
432,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
432,
1
] |
Mathlib/RingTheory/NonZeroDivisors.lean | mul_cancel_right_mem_nonZeroDivisors | [
{
"state_after": "no goals",
"state_before": "M : Type ?u.15454\nM' : Type ?u.15457\nM₁ : Type ?u.15460\nR : Type u_1\nR' : Type ?u.15466\nF : Type ?u.15469\ninst✝⁴ : MonoidWithZero M\ninst✝³ : MonoidWithZero M'\ninst✝² : CommMonoidWithZero M₁\ninst✝¹ : Ring R\ninst✝ : CommRing R'\nx y r : R\nhr : r ∈ R⁰\nh... | [
70,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Mathlib/LinearAlgebra/Pi.lean | LinearMap.lsum_apply | [] | [
163,
55
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
161,
1
] |
Mathlib/Algebra/Order/LatticeGroup.lean | LatticeOrderedAddCommGroup.isSolid_solidClosure | [] | [
616,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
615,
1
] |
Mathlib/Algebra/Order/Monoid/ToMulBot.lean | WithZero.toMulBot_strictMono | [] | [
59,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
59,
1
] |
Mathlib/Algebra/GroupWithZero/InjSurj.lean | Function.Injective.noZeroDivisors | [
{
"state_after": "no goals",
"state_before": "M₀ : Type u_1\nG₀ : Type ?u.1682\nM₀' : Type u_2\nG₀' : Type ?u.1688\ninst✝⁴ : Mul M₀\ninst✝³ : Zero M₀\ninst✝² : Mul M₀'\ninst✝¹ : Zero M₀'\ninst✝ : NoZeroDivisors M₀'\nf : M₀ → M₀'\nhf : Injective f\nzero : f 0 = 0\nmul : ∀ (x y : M₀), f (x * y) = f x * f y\na... | [
62,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
56,
11
] |
Mathlib/Topology/Instances/Matrix.lean | Continuous.matrix_col | [] | [
105,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
104,
1
] |
Mathlib/LinearAlgebra/BilinearForm.lean | BilinForm.coe_smul | [] | [
221,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
219,
1
] |
Mathlib/Topology/MetricSpace/EMetricSpace.lean | EMetric.secondCountable_of_almost_dense_set | [
{
"state_after": "α : Type u\nβ : Type v\nX : Type ?u.281603\ninst✝ : PseudoEMetricSpace α\nx y z : α\nε ε₁ ε₂ : ℝ≥0∞\ns t : Set α\nhs : ∀ (ε : ℝ≥0∞), ε > 0 → ∃ t, Set.Countable t ∧ (⋃ (x : α) (_ : x ∈ t), closedBall x ε) = univ\n⊢ SeparableSpace α",
"state_before": "α : Type u\nβ : Type v\nX : Type ?u.2816... | [
864,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
857,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.tendsto_lintegral_norm_of_dominated_convergence | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.739626\nδ : Type ?u.739629\nm : MeasurableSpace α\nμ ν : Measure α\ninst✝² : MeasurableSpace δ\ninst✝¹ : NormedAddCommGroup β\ninst✝ : NormedAddCommGroup γ\nF✝ : ℕ → α → β\nf✝ : α → β\nbound✝ : α → ℝ\nF : ℕ → α → β\nf : α → β\nbound : α → ℝ\nF_measurable... | [
367,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
322,
1
] |
Mathlib/Data/List/Infix.lean | List.suffix_iff_eq_append | [
{
"state_after": "case intro\nα : Type u_1\nβ : Type ?u.3302\nl l₁ l₃ : List α\na b : α\nm n : ℕ\nr : List α\n⊢ take (length (r ++ l₁) - length l₁) (r ++ l₁) ++ l₁ = r ++ l₁",
"state_before": "α : Type u_1\nβ : Type ?u.3302\nl l₁ l₂ l₃ : List α\na b : α\nm n : ℕ\n⊢ l₁ <:+ l₂ → take (length l₂ - length l₁) l... | [
208,
12
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
206,
1
] |
Mathlib/Data/Set/Intervals/Basic.lean | Set.Ioi_inter_Iic | [] | [
631,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
630,
1
] |
src/lean/Init/Data/Nat/Basic.lean | Nat.add_sub_add_left | [
{
"state_after": "no goals",
"state_before": "k n m : Nat\n⊢ k + n - (k + m) = n - m",
"tactic": "rw [Nat.add_comm k n, Nat.add_comm k m, Nat.add_sub_add_right]"
}
] | [
592,
65
] | d5348dfac847a56a4595fb6230fd0708dcb4e7e9 | https://github.com/leanprover/lean4 | [
591,
11
] |
Mathlib/Order/Max.lean | Subsingleton.isMin | [] | [
370,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
369,
11
] |
Mathlib/Topology/MetricSpace/Basic.lean | squeeze_zero | [] | [
1448,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1446,
1
] |
Mathlib/GroupTheory/Congruence.lean | Con.mem_coe | [] | [
799,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
798,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/SubboxInduction.lean | BoxIntegral.Prepartition.toSubordinate_toPrepartition_le | [] | [
184,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
182,
1
] |
Mathlib/Data/Fintype/BigOperators.lean | Fintype.card_sigma | [] | [
128,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
126,
8
] |
Mathlib/Algebra/GroupPower/Order.lean | min_le_of_mul_le_sq | [
{
"state_after": "no goals",
"state_before": "β : Type ?u.169935\nA : Type ?u.169938\nG : Type ?u.169941\nM : Type u_1\nR : Type ?u.169947\ninst✝³ : Monoid M\ninst✝² : LinearOrder M\ninst✝¹ : CovariantClass M M (fun x x_1 => x * x_1) fun x x_1 => x < x_1\ninst✝ : CovariantClass M M (swap fun x x_1 => x * x_... | [
329,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
328,
1
] |
Mathlib/NumberTheory/Padics/Hensel.lean | soln_unique | [
{
"state_after": "no goals",
"state_before": "p : ℕ\ninst✝ : Fact (Nat.Prime p)\nF : Polynomial ℤ_[p]\na : ℤ_[p]\nhnorm : ‖Polynomial.eval a F‖ < ‖Polynomial.eval a (↑Polynomial.derivative F)‖ ^ 2\nhnsol : Polynomial.eval a F ≠ 0\nz : ℤ_[p]\nhev : Polynomial.eval z F = 0\nhnlt : ‖z - a‖ < ‖Polynomial.eval a... | [
457,
37
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
425,
9
] |
Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean | MeasureTheory.SimpleFunc.tendsto_approxOn_range_L1_nnnorm | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.941082\nβ : Type ?u.941085\nι : Type ?u.941088\nE : Type ?u.941091\nF : Type ?u.941094\n𝕜 : Type ?u.941097\ninst✝⁴ : MeasurableSpace β\ninst✝³ : MeasurableSpace E\ninst✝² : NormedAddCommGroup E\ninst✝¹ : OpensMeasurableSpace E\nf : β → E\nμ : Measur... | [
264,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
255,
1
] |
Mathlib/ModelTheory/Substructures.lean | FirstOrder.Language.Substructure.map_sup | [] | [
514,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
513,
1
] |
Mathlib/Algebra/MonoidAlgebra/Basic.lean | MonoidAlgebra.mul_apply | [
{
"state_after": "k : Type u₁\nG : Type u₂\nR : Type ?u.354844\ninst✝² : Semiring k\ninst✝¹ : DecidableEq G\ninst✝ : Mul G\nf g : MonoidAlgebra k G\nx : G\n⊢ (sum f fun a₁ b => ↑(sum g fun a₂ b₂ => single (a₁ * a₂) (b * b₂)) x) =\n sum f fun a₁ b₁ => sum g fun a₂ b₂ => if a₁ * a₂ = x then b₁ * b₂ else 0",
... | [
431,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
426,
1
] |
Mathlib/SetTheory/ZFC/Ordinal.lean | ZFSet.IsTransitive.subset_of_mem | [] | [
52,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
51,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Ring.lean | Summable.mul_left | [] | [
46,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
45,
1
] |
Mathlib/Data/Sum/Order.lean | Sum.swap_lt_swap_iff | [] | [
290,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
289,
1
] |
Mathlib/Data/Polynomial/Basic.lean | Polynomial.toFinsupp_erase | [
{
"state_after": "case ofFinsupp\nR : Type u\na b : R\nm n✝ : ℕ\ninst✝ : Semiring R\np q : R[X]\nn : ℕ\ntoFinsupp✝ : AddMonoidAlgebra R ℕ\n⊢ (erase n { toFinsupp := toFinsupp✝ }).toFinsupp = Finsupp.erase n { toFinsupp := toFinsupp✝ }.toFinsupp",
"state_before": "R : Type u\na b : R\nm n✝ : ℕ\ninst✝ : Semir... | [
1024,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1022,
1
] |
Std/Data/Rat/Lemmas.lean | Rat.zero_mul | [
{
"state_after": "no goals",
"state_before": "a : Rat\n⊢ 0 * a = 0",
"tactic": "simp [mul_def]"
}
] | [
260,
78
] | e68aa8f5fe47aad78987df45f99094afbcb5e936 | https://github.com/leanprover/std4 | [
260,
19
] |
Mathlib/Analysis/Convex/Side.lean | AffineSubspace.setOf_sOppSide_eq_image2 | [
{
"state_after": "case h\nR : Type u_1\nV : Type u_2\nV' : Type ?u.437898\nP : Type u_3\nP' : Type ?u.437904\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 ... | [
839,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
824,
1
] |
Mathlib/LinearAlgebra/Prod.lean | LinearMap.coe_inr | [] | [
191,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
190,
1
] |
Mathlib/Topology/Semicontinuous.lean | LowerSemicontinuous.lowerSemicontinuousAt | [] | [
164,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/Data/List/Basic.lean | List.replicate_right_inj | [] | [
475,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
473,
1
] |
Mathlib/Topology/FiberBundle/Trivialization.lean | Pretrivialization.apply_symm_apply' | [] | [
170,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
168,
1
] |
Mathlib/MeasureTheory/Constructions/Pi.lean | MeasureTheory.piPremeasure_pi' | [
{
"state_after": "case inl\nι : Type u_2\nι' : Type ?u.1509037\nα : ι → Type u_1\ninst✝ : Fintype ι\nm : (i : ι) → OuterMeasure (α i)\ns : (i : ι) → Set (α i)\nh✝ : IsEmpty ι\n⊢ piPremeasure m (Set.pi univ s) = ∏ i : ι, ↑(m i) (s i)\n\ncase inr\nι : Type u_2\nι' : Type ?u.1509037\nα : ι → Type u_1\ninst✝ : Fint... | [
178,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
170,
1
] |
Mathlib/Algebra/Lie/Normalizer.lean | LieSubmodule.normalizer_bot_eq_maxTrivSubmodule | [] | [
102,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
100,
1
] |
Mathlib/Order/Filter/Basic.lean | Filter.Tendsto.mono_right | [] | [
2927,
17
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2925,
1
] |
Mathlib/Computability/TuringMachine.lean | Turing.PointedMap.mk_val | [] | [
367,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
365,
1
] |
Mathlib/Order/Hom/Bounded.lean | TopHom.coe_top | [] | [
315,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/AlgebraicGeometry/StructureSheaf.lean | AlgebraicGeometry.StructureSheaf.const_mul_cancel | [
{
"state_after": "case h\nR : Type u\ninst✝ : CommRing R\nf g₁ g₂ : R\nU : Opens ↑(PrimeSpectrum.Top R)\nhu₁ : ∀ (x : ↑(PrimeSpectrum.Top R)), x ∈ U → g₁ ∈ Ideal.primeCompl x.asIdeal\nhu₂ : ∀ (x : ↑(PrimeSpectrum.Top R)), x ∈ U → g₂ ∈ Ideal.primeCompl x.asIdeal\n⊢ f * g₁ * g₂ = f * (g₁ * g₂)",
"state_before... | [
402,
44
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
400,
1
] |
Mathlib/Data/Erased.lean | Erased.out_proof | [] | [
56,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.cons_ne_zero | [] | [
292,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
291,
1
] |
Mathlib/Data/List/Zip.lean | List.unzip_right | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type u_1\nγ : Type ?u.85098\nδ : Type ?u.85101\nε : Type ?u.85104\nl : List (α × β)\n⊢ (unzip l).snd = map Prod.snd l",
"tactic": "simp only [unzip_eq_map]"
}
] | [
220,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
220,
1
] |
Mathlib/Topology/Basic.lean | Dense.inter_of_open_right | [] | [
1425,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1423,
1
] |
Mathlib/Algebra/Algebra/Basic.lean | NoZeroSMulDivisors.of_algebraMap_injective | [] | [
807,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
804,
1
] |
Mathlib/Topology/Algebra/UniformField.lean | UniformSpace.Completion.continuous_hatInv | [
{
"state_after": "K : Type u_1\ninst✝² : Field K\ninst✝¹ : UniformSpace K\ninst✝ : CompletableTopField K\nx : hat K\nh : x ≠ 0\nthis : T3Space (hat K)\n⊢ ContinuousAt hatInv x",
"state_before": "K : Type u_1\ninst✝² : Field K\ninst✝¹ : UniformSpace K\ninst✝ : CompletableTopField K\nx : hat K\nh : x ≠ 0\n⊢ C... | [
97,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/CategoryTheory/Preadditive/Biproducts.lean | CategoryTheory.Limits.inl_of_isLimit | [
{
"state_after": "case x\nC : Type u\ninst✝² : Category C\ninst✝¹ : Preadditive C\nJ : Type\ninst✝ : Fintype J\nX Y : C\nt : BinaryBicone X Y\nht : IsLimit (BinaryBicone.toCone t)\n⊢ ∀ (j : Discrete WalkingPair), t.inl ≫ (BinaryBicone.toCone t).π.app j = (BinaryFan.mk (𝟙 X) 0).π.app j",
"state_before": "C ... | [
352,
71
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
350,
1
] |
Mathlib/Algebra/ContinuedFractions/ContinuantsRecurrence.lean | GeneralizedContinuedFraction.numerators_recurrence | [
{
"state_after": "K : Type u_1\ng : GeneralizedContinuedFraction K\nn : ℕ\ninst✝ : DivisionRing K\ngp : Pair K\nppredA predA : K\nsucc_nth_s_eq : Stream'.Seq.get? g.s (n + 1) = some gp\nnth_num_eq : numerators g n = ppredA\nsucc_nth_num_eq : numerators g (n + 1) = predA\n⊢ ∃ conts, continuants g n = conts ∧ con... | [
62,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
53,
1
] |
Mathlib/Data/Nat/Factorization/Basic.lean | Nat.factorization_eq_of_coprime_left | [
{
"state_after": "no goals",
"state_before": "p a b : ℕ\nhab : coprime a b\nhpa : p ∈ factors a\n⊢ ↑(factorization (a * b)) p = ↑(factorization a) p",
"tactic": "rw [factorization_mul_apply_of_coprime hab, ← factors_count_eq, ← factors_count_eq,\n count_eq_zero_of_not_mem (coprime_factors_disjoint hab ... | [
769,
75
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
766,
1
] |
Mathlib/Topology/Sets/Compacts.lean | TopologicalSpace.Compacts.isCompact | [] | [
56,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
55,
11
] |
Mathlib/Logic/Embedding/Basic.lean | Equiv.toEmbedding_apply | [] | [
75,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
74,
1
] |
Mathlib/NumberTheory/LucasLehmer.lean | LucasLehmer.X.ofNat_fst | [] | [
284,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
284,
9
] |
Mathlib/Algebra/Algebra/Unitization.lean | Unitization.algebraMap_eq_inlRingHom_comp | [] | [
592,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
590,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | ContDiffWithinAt.continuousLinearMap_comp | [
{
"state_after": "case intro.intro.intro\n𝕜 : 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 : ... | [
216,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
213,
1
] |
Mathlib/Data/Nat/Order/Basic.lean | Nat.one_le_of_lt | [] | [
151,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
150,
1
] |
Mathlib/Analysis/NormedSpace/CompactOperator.lean | isClosed_setOf_isCompactOperator | [
{
"state_after": "𝕜₁ : Type u_1\n𝕜₂ : Type u_2\ninst✝¹⁰ : NontriviallyNormedField 𝕜₁\ninst✝⁹ : NormedField 𝕜₂\nσ₁₂ : 𝕜₁ →+* 𝕜₂\nM₁ : Type u_3\nM₂ : Type u_4\ninst✝⁸ : SeminormedAddCommGroup M₁\ninst✝⁷ : AddCommGroup M₂\ninst✝⁶ : NormedSpace 𝕜₁ M₁\ninst✝⁵ : Module 𝕜₂ M₂\ninst✝⁴ : UniformSpace M₂\ninst✝³ ... | [
436,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
402,
1
] |
Mathlib/Order/SuccPred/Limit.lean | Order.mem_range_succ_of_not_isSuccLimit | [
{
"state_after": "case intro\nα : Type u_1\ninst✝¹ : PartialOrder α\ninst✝ : SuccOrder α\na b✝ : α\nC : α → Sort ?u.4712\nh : ¬IsSuccLimit a\nb : α\nhb : ¬IsMax b ∧ succ b = a\n⊢ a ∈ range succ",
"state_before": "α : Type u_1\ninst✝¹ : PartialOrder α\ninst✝ : SuccOrder α\na b : α\nC : α → Sort ?u.4712\nh : ... | [
140,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
138,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean | Real.Angle.cos_sub_pi | [] | [
424,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
1
] |
Mathlib/Order/Interval.lean | NonemptyInterval.mem_pure | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.12507\nγ : Type ?u.12510\nδ : Type ?u.12513\nι : Sort ?u.12516\nκ : ι → Sort ?u.12521\ninst✝¹ : PartialOrder α\ninst✝ : PartialOrder β\ns t : NonemptyInterval α\nx : α × α\na b : α\n⊢ b ∈ pure a ↔ b = a",
"tactic": "rw [← SetLike.me... | [
277,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
276,
1
] |
Mathlib/MeasureTheory/Integral/SetIntegral.lean | MeasureTheory.set_integral_mono | [] | [
705,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
704,
1
] |
Mathlib/GroupTheory/MonoidLocalization.lean | Localization.mk_one | [
{
"state_after": "M : Type u_1\ninst✝² : CommMonoid M\nS : Submonoid M\nN : Type ?u.78772\ninst✝¹ : CommMonoid N\nP : Type ?u.78778\ninst✝ : CommMonoid P\n⊢ mk 1 1 = One.one",
"state_before": "M : Type u_1\ninst✝² : CommMonoid M\nS : Submonoid M\nN : Type ?u.78772\ninst✝¹ : CommMonoid N\nP : Type ?u.78778\n... | [
332,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
331,
1
] |
Mathlib/Analysis/Calculus/ContDiff.lean | LocalHomeomorph.contDiffAt_symm_deriv | [] | [
1852,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1849,
1
] |
Mathlib/Analysis/Convex/Gauge.lean | exists_lt_of_gauge_lt | [
{
"state_after": "case intro.intro.intro\n𝕜 : Type ?u.17621\nE : Type u_1\nF : Type ?u.17627\ninst✝¹ : AddCommGroup E\ninst✝ : Module ℝ E\ns t : Set E\na : ℝ\nx : E\nabsorbs : Absorbent ℝ s\nh : gauge s x < a\nb : ℝ\nhba : b < a\nhb : 0 < b\nhx : x ∈ b • s\n⊢ ∃ b, 0 < b ∧ b < a ∧ x ∈ b • s",
"state_before"... | [
96,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/Data/Matrix/Basis.lean | Matrix.induction_on' | [
{
"state_after": "l : Type ?u.17264\nm : Type u_1\nn : Type u_2\nR : Type ?u.17273\nα : Type u_3\ninst✝⁵ : DecidableEq l\ninst✝⁴ : DecidableEq m\ninst✝³ : DecidableEq n\ninst✝² : Semiring α\ninst✝¹ : Fintype m\ninst✝ : Fintype n\nP : Matrix m n α → Prop\nM : Matrix m n α\nh_zero : P 0\nh_add : ∀ (p q : Matrix m... | [
103,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
97,
11
] |
Mathlib/Algebra/Lie/IdealOperations.lean | LieIdeal.comap_bracket_incl_of_le | [
{
"state_after": "R : Type u\nL : Type v\nL' : Type w₂\ninst✝⁴ : CommRing R\ninst✝³ : LieRing L\ninst✝² : LieAlgebra R L\ninst✝¹ : LieRing L'\ninst✝ : LieAlgebra R L'\nf : L →ₗ⁅R⁆ L'\nI : LieIdeal R L\nJ : LieIdeal R L'\nI₁ I₂ : LieIdeal R L\nh₁ : I₁ ≤ I\nh₂ : I₂ ≤ I\n⊢ comap (incl I) ⁅I ⊓ I₁, I ⊓ I₂⁆ = comap (... | [
348,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
346,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearEquiv.self_comp_symm | [
{
"state_after": "case h\nR₁ : Type u_1\nR₂ : Type u_2\nR₃ : Type ?u.1589189\ninst✝²⁴ : Semiring R₁\ninst✝²³ : Semiring R₂\ninst✝²² : Semiring R₃\nσ₁₂ : R₁ →+* R₂\nσ₂₁ : R₂ →+* R₁\ninst✝²¹ : RingHomInvPair σ₁₂ σ₂₁\ninst✝²⁰ : RingHomInvPair σ₂₁ σ₁₂\nσ₂₃ : R₂ →+* R₃\nσ₃₂ : R₃ →+* R₂\ninst✝¹⁹ : RingHomInvPair σ₂₃ ... | [
2090,
29
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2088,
1
] |
Mathlib/GroupTheory/Subgroup/Basic.lean | Subgroup.comap_le_comap_of_surjective | [] | [
3046,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3044,
1
] |
Mathlib/Analysis/Convex/Star.lean | StarConvex.add_smul_sub_mem | [
{
"state_after": "case a\n𝕜 : Type u_1\nE : Type u_2\nF : Type ?u.114875\ninst✝⁴ : OrderedRing 𝕜\ninst✝³ : AddCommGroup E\ninst✝² : AddCommGroup F\ninst✝¹ : Module 𝕜 E\ninst✝ : Module 𝕜 F\nx y : E\ns t✝ : Set E\nhs : StarConvex 𝕜 x s\nhy : y ∈ s\nt : 𝕜\nht₀ : 0 ≤ t\nht₁ : t ≤ 1\n⊢ x + t • (y - x) ∈ [x-[𝕜... | [
351,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
347,
1
] |
Mathlib/Analysis/Analytic/Basic.lean | HasFPowerSeriesOnBall.exchange_radius | [] | [
1038,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1035,
1
] |
Mathlib/Topology/Algebra/Order/LeftRight.lean | nhds_left_sup_nhds_right' | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type ?u.2877\ninst✝² : TopologicalSpace α\ninst✝¹ : LinearOrder α\ninst✝ : TopologicalSpace β\na : α\n⊢ 𝓝[Iic a] a ⊔ 𝓝[Ioi a] a = 𝓝 a",
"tactic": "rw [← nhdsWithin_union, Iic_union_Ioi, nhdsWithin_univ]"
}
] | [
70,
58
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
69,
1
] |
Mathlib/Analysis/SpecialFunctions/Exp.lean | Real.isBigO_exp_comp_exp_comp | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nx y z : ℝ\nl : Filter α\nf g : α → ℝ\n⊢ (IsBoundedUnder (fun x x_1 => x ≤ x_1) l fun x => ‖exp (f x)‖ / ‖exp (g x)‖) ↔\n IsBoundedUnder (fun x x_1 => x ≤ x_1) l (f - g)",
"tactic": "simp only [norm_eq_abs, abs_exp, ← exp_sub, isBoundedUnder_... | [
369,
88
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
366,
1
] |
Mathlib/Analysis/Convex/Side.lean | Function.Injective.sSameSide_map_iff | [
{
"state_after": "no goals",
"state_before": "R : Type u_1\nV : Type u_2\nV' : Type u_4\nP : Type u_3\nP' : Type u_5\ninst✝⁶ : StrictOrderedCommRing R\ninst✝⁵ : AddCommGroup V\ninst✝⁴ : Module R V\ninst✝³ : AddTorsor V P\ninst✝² : AddCommGroup V'\ninst✝¹ : Module R V'\ninst✝ : AddTorsor V' P'\ns : AffineSub... | [
90,
77
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
87,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.mul_lt_of_lt_div | [
{
"state_after": "α : Type ?u.292307\nβ : Type ?u.292310\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nh : b ≤ a * c\n⊢ b / c ≤ a",
"state_before": "α : Type ?u.292307\nβ : Type ?u.292310\na b c d : ℝ≥0∞\nr p q : ℝ≥0\nh : a < b / c\n⊢ a * c < b",
"tactic": "contrapose! h"
},
{
"state_after": "no goals",
"st... | [
1612,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1610,
1
] |
Mathlib/Logic/Equiv/LocalEquiv.lean | LocalEquiv.symm_image_eq_source_inter_preimage | [] | [
501,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
499,
1
] |
Mathlib/Analysis/Calculus/MeanValue.lean | AntitoneOn.concaveOn_of_deriv | [
{
"state_after": "no goals",
"state_before": "E : Type ?u.426364\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedSpace ℝ E\nF : Type ?u.426460\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedSpace ℝ F\nD : Set ℝ\nhD : Convex ℝ D\nf : ℝ → ℝ\nhf : ContinuousOn f D\nhf' : DifferentiableOn ℝ f (interior D)\nh_anti... | [
1005,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1000,
1
] |
Mathlib/FieldTheory/Fixed.lean | FixedPoints.rank_le_card | [
{
"state_after": "no goals",
"state_before": "M : Type u\ninst✝⁵ : Monoid M\nG : Type u\ninst✝⁴ : Group G\nF : Type v\ninst✝³ : Field F\ninst✝² : MulSemiringAction M F\ninst✝¹ : MulSemiringAction G F\nm : M\ninst✝ : Fintype G\nx : F\ns : Finset F\nhs : LinearIndependent { x // x ∈ subfield G F } fun i => ↑i... | [
278,
61
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
273,
1
] |
Mathlib/ModelTheory/ElementaryMaps.lean | FirstOrder.Language.Equiv.toElementaryEmbedding_toEmbedding | [] | [
340,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
338,
1
] |
Mathlib/Data/Set/Function.lean | Function.Semiconj.mapsTo_range | [] | [
1623,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1622,
1
] |
Mathlib/Data/Set/Sigma.lean | Set.Nonempty.sigma | [] | [
208,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
205,
11
] |
Mathlib/Topology/UniformSpace/CompactConvergence.lean | ContinuousMap.nhds_compactConvergence | [
{
"state_after": "case h₀.intro.mk.intro.intro\nα : Type u₁\nβ : Type u₂\ninst✝¹ : TopologicalSpace α\ninst✝ : UniformSpace β\nK✝ : Set α\nV✝ : Set (β × β)\nf g : C(α, β)\nK : Set α\nV : Set (β × β)\nhK : IsCompact (K, V).fst\nhV : (K, V).snd ∈ 𝓤 β\n⊢ g ∈ (fun KV => compactConvNhd KV.fst KV.snd g) (K, V)\n\nca... | [
183,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
176,
1
] |
Mathlib/Algebra/ModEq.lean | AddCommGroup.ModEq.zsmul_add | [] | [
140,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
11
] |
Mathlib/Topology/Connected.lean | isConnected_univ_pi | [
{
"state_after": "α : Type u\nβ : Type v\nι : Type u_2\nπ : ι → Type u_1\ninst✝¹ : TopologicalSpace α\ns✝ t u v : Set α\ninst✝ : (i : ι) → TopologicalSpace (π i)\ns : (i : ι) → Set (π i)\n⊢ Set.Nonempty (pi univ s) → (IsPreconnected (pi univ s) ↔ ∀ (x : ι), IsPreconnected (s x))",
"state_before": "α : Type ... | [
512,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
507,
1
] |
Mathlib/Data/Real/Irrational.lean | Irrational.add_rat | [] | [
225,
32
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/Topology/Connected.lean | IsConnected.biUnion_of_reflTransGen | [] | [
210,
84
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
205,
1
] |
Mathlib/ModelTheory/Satisfiability.lean | FirstOrder.Language.BoundedFormula.inf_semanticallyEquivalent_not_sup_not | [
{
"state_after": "no goals",
"state_before": "L : Language\nT : Theory L\nα : Type w\nn : ℕ\nφ ψ : BoundedFormula L α n\nM : Theory.ModelType T\nv : α → ↑M\nxs : Fin n → ↑M\n⊢ Realize (φ ⊓ ψ ⇔ ∼(∼φ ⊔ ∼ψ)) v xs",
"tactic": "simp [and_iff_not_or_not]"
}
] | [
536,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
534,
1
] |
Mathlib/Algebra/GroupWithZero/Basic.lean | div_mul_eq_mul_div₀ | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.31135\nM₀ : Type ?u.31138\nG₀ : Type u_1\nM₀' : Type ?u.31144\nG₀' : Type ?u.31147\nF : Type ?u.31150\nF' : Type ?u.31153\ninst✝ : CommGroupWithZero G₀\na✝ b✝ c✝ d a b c : G₀\n⊢ a / c * b = a * b / c",
"tactic": "simp_rw [div_eq_mul_inv, mul_asso... | [
439,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
438,
1
] |
Mathlib/MeasureTheory/Function/LpSpace.lean | MeasureTheory.memℒp_norm_rpow_iff | [
{
"state_after": "α : Type u_1\nE : Type u_2\nF : Type ?u.720298\nG : Type ?u.720301\nm m0 : MeasurableSpace α\np : ℝ≥0∞\nq✝ : ℝ\nμ ν : Measure α\ninst✝² : NormedAddCommGroup E\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedAddCommGroup G\nq : ℝ≥0∞\nf : α → E\nhf : AEStronglyMeasurable f μ\nq_zero : q ≠ 0\nq_top... | [
833,
15
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
823,
1
] |
Mathlib/Data/Set/Basic.lean | Set.nonempty_diff | [] | [
1818,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1817,
1
] |
Mathlib/Topology/Order.lean | map_nhds_induced_of_mem | [
{
"state_after": "no goals",
"state_before": "α : Type u_2\nβ : Type u_1\nt : TopologicalSpace β\nf : α → β\na : α\nh : range f ∈ 𝓝 (f a)\n⊢ map f (𝓝 a) = 𝓝 (f a)",
"tactic": "rw [nhds_induced, Filter.map_comap_of_mem h]"
}
] | [
879,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
878,
1
] |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | SimpleGraph.Subgraph.map_le_iff_le_comap | [
{
"state_after": "case refine'_1\nι : Sort ?u.168978\nV : Type u\nW : Type v\nG : SimpleGraph V\nG₁ G₂ : Subgraph G\na b : V\nG' : SimpleGraph W\nf : G →g G'\nH : Subgraph G\nH' : Subgraph G'\nh : Subgraph.map f H ≤ H'\nv : V\nhv : v ∈ H.verts\n⊢ v ∈ (Subgraph.comap f H').verts\n\ncase refine'_2\nι : Sort ?u.16... | [
718,
21
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
706,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.pairwise_coe_iff_pairwise | [] | [
3013,
97
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
3011,
1
] |
Mathlib/GroupTheory/Perm/Support.lean | Equiv.Perm.apply_pow_apply_eq_iff | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝¹ : DecidableEq α\ninst✝ : Fintype α\nf✝ g f : Perm α\nn : ℕ\nx : α\n⊢ ↑f (↑(f ^ n) x) = ↑(f ^ n) x ↔ ↑f x = x",
"tactic": "rw [← mul_apply, Commute.self_pow f, mul_apply, apply_eq_iff_eq]"
}
] | [
367,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
365,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.