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/LinearAlgebra/Quotient.lean | Submodule.Quotient.equiv_trans | [
{
"state_after": "case h\nR : Type u_3\nM : Type u_4\nr : R\nx y : M\ninst✝⁹ : Ring R\ninst✝⁸ : AddCommGroup M\ninst✝⁷ : Module R M\np p' : Submodule R M\nR₂ : Type ?u.395898\nM₂ : Type ?u.395901\ninst✝⁶ : Ring R₂\ninst✝⁵ : AddCommGroup M₂\ninst✝⁴ : Module R₂ M₂\nτ₁₂ : R →+* R₂\nq : Submodule R₂ M₂\nN : Type u_... | [
563,
39
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
554,
1
] |
Mathlib/Data/MvPolynomial/CommRing.lean | MvPolynomial.totalDegree_sub | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nσ : Type u_1\na✝ a' a₁ a₂ : R\ne : ℕ\nn m : σ\ns : σ →₀ ℕ\ninst✝ : CommRing R\np q a b : MvPolynomial σ R\n⊢ totalDegree (a - b) = totalDegree (a + -b)",
"tactic": "rw [sub_eq_add_neg]"
},
{
"state_after": "no goals",
"sta... | [
211,
67
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
206,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Filter.lean | BoxIntegral.IntegrationParams.biUnionTagged_memBaseSet | [
{
"state_after": "case refine'_1\nι : Type u_1\ninst✝ : Fintype ι\nI J : Box ι\nc c₁ c₂ : ℝ≥0\nr r₁ r₂ : (ι → ℝ) → ↑(Set.Ioi 0)\nπ✝ π₁ π₂ : TaggedPrepartition I\nl l₁ l₂ : IntegrationParams\nπ : Prepartition I\nπi : (J : Box ι) → TaggedPrepartition J\nh : ∀ (J : Box ι), J ∈ π → MemBaseSet l J c r (πi J)\nhp : ∀... | [
431,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
421,
1
] |
Mathlib/Algebra/Star/Order.lean | conjugate_nonneg | [
{
"state_after": "R : Type u\ninst✝² : NonUnitalSemiring R\ninst✝¹ : PartialOrder R\ninst✝ : StarOrderedRing R\na : R\nha✝ : 0 ≤ a\nha : a ∈ AddSubmonoid.closure (Set.range fun s => star s * s)\nc : R\n⊢ 0 ≤ star c * a * c",
"state_before": "R : Type u\ninst✝² : NonUnitalSemiring R\ninst✝¹ : PartialOrder R\... | [
174,
40
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
164,
1
] |
Mathlib/Topology/Order/Basic.lean | Continuous.bddAbove_range_of_hasCompactMulSupport | [] | [
845,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
843,
1
] |
Mathlib/Logic/Function/Basic.lean | Function.partialInv_left | [] | [
419,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
418,
1
] |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean | Measurable.quasiMeasurePreserving | [] | [
2455,
33
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2452,
11
] |
Mathlib/Algebra/Group/Basic.lean | mul_div_mul_right_eq_div | [
{
"state_after": "α : Type ?u.58098\nβ : Type ?u.58101\nG : Type u_1\ninst✝ : Group G\na✝ b✝ c✝ d a b c : G\n⊢ a * c / c / b = a / b",
"state_before": "α : Type ?u.58098\nβ : Type ?u.58101\nG : Type u_1\ninst✝ : Group G\na✝ b✝ c✝ d a b c : G\n⊢ a * c / (b * c) = a / b",
"tactic": "rw [div_mul_eq_div_div... | [
765,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
764,
1
] |
Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean | PrimeSpectrum.zeroLocus_singleton_pow | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\ninst✝¹ : CommRing R\ninst✝ : CommRing S\nf : R\nn : ℕ\nhn : 0 < n\nx : PrimeSpectrum R\n⊢ x ∈ zeroLocus {f ^ n} ↔ x ∈ zeroLocus {f}",
"tactic": "simpa using x.2.pow_mem_iff_mem n hn"
}
] | [
387,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
385,
1
] |
Mathlib/Algebra/BigOperators/Finsupp.lean | Finsupp.finset_sum_apply | [] | [
308,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
306,
1
] |
Mathlib/GroupTheory/CommutingProbability.lean | commProb_def | [] | [
44,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
42,
1
] |
Mathlib/Topology/Order/Basic.lean | nhdsWithin_Iic_eq' | [
{
"state_after": "no goals",
"state_before": "α : Type u\nβ : Type v\nγ : Type w\ninst✝² : TopologicalSpace α\ninst✝¹ : Preorder α\ninst✝ : OrderTopology α\na : α\nha : ∃ l, l < a\n⊢ 𝓝[Iic a] a = ⨅ (l : α) (_ : l < a), 𝓟 (Ioc l a)",
"tactic": "simp only [nhdsWithin_Iic_eq'', biInf_inf ha, inf_principa... | [
1102,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1100,
1
] |
Mathlib/Algebra/Periodic.lean | Function.Antiperiodic.const_add | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.165187\nf g : α → β\nc c₁ c₂ x✝ : α\ninst✝¹ : AddSemigroup α\ninst✝ : Neg β\nh : Antiperiodic f c\na x : α\n⊢ (fun x => f (a + x)) (x + c) = -(fun x => f (a + x)) x",
"tactic": "simpa [add_assoc] using h (a + x)"
}
] | [
436,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
435,
1
] |
Mathlib/Data/Rel.lean | Rel.preimage_comp | [
{
"state_after": "no goals",
"state_before": "α : Type u_3\nβ : Type u_1\nγ : Type u_2\nr : Rel α β\ns : Rel β γ\nt : Set γ\n⊢ preimage (r • s) t = preimage r (preimage s t)",
"tactic": "simp only [preimage, inv_comp, image_comp]"
}
] | [
204,
48
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/AlgebraicGeometry/StructureSheaf.lean | AlgebraicGeometry.StructureSheaf.const_zero | [
{
"state_after": "no goals",
"state_before": "R : Type u\ninst✝ : CommRing R\nf : R\nU : Opens ↑(PrimeSpectrum.Top R)\nhu : ∀ (x : ↑(PrimeSpectrum.Top R)), x ∈ U → f ∈ Ideal.primeCompl x.asIdeal\nx : { x // x ∈ U.op.unop }\n⊢ ↑(algebraMap R (Localizations R ↑x)) 0 =\n ↑0 x * ↑(algebraMap R (Localizations... | [
358,
83
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
356,
1
] |
Mathlib/SetTheory/Cardinal/Basic.lean | Cardinal.IsLimit.isSuccLimit | [] | [
844,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
843,
11
] |
Mathlib/Order/Extension/Well.lean | WellFounded.exists_well_order_ge | [] | [
72,
89
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
71,
1
] |
Mathlib/Algebra/Lie/Nilpotent.lean | LieHom.isNilpotent_range | [] | [
647,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
646,
1
] |
Mathlib/LinearAlgebra/Span.lean | Submodule.span_le | [] | [
69,
62
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
68,
1
] |
Mathlib/Data/List/Join.lean | List.join_append | [
{
"state_after": "case nil\nα : Type u_1\nβ : Type ?u.996\nL₂ : List (List α)\n⊢ join ([] ++ L₂) = join [] ++ join L₂\n\ncase cons\nα : Type u_1\nβ : Type ?u.996\nL₂ : List (List α)\nhead✝ : List α\ntail✝ : List (List α)\ntail_ih✝ : join (tail✝ ++ L₂) = join tail✝ ++ join L₂\n⊢ join (head✝ :: tail✝ ++ L₂) = joi... | [
42,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
39,
1
] |
Mathlib/Data/List/Count.lean | List.countp_filter | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\nl✝ : List α\np q : α → Bool\nl : List α\n⊢ countp p (filter q l) = countp (fun a => decide (p a = true ∧ q a = true)) l",
"tactic": "simp only [countp_eq_length_filter, filter_filter]"
}
] | [
128,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
127,
1
] |
Mathlib/Computability/Partrec.lean | Partrec.vector_mOfFn | [
{
"state_after": "α : Type u_1\nβ : Type ?u.137451\nγ : Type ?u.137454\nσ : Type u_2\ninst✝³ : Primcodable α\ninst✝² : Primcodable β\ninst✝¹ : Primcodable γ\ninst✝ : Primcodable σ\nn : ℕ\nf : Fin (n + 1) → α →. σ\nhf : ∀ (i : Fin (n + 1)), Partrec (f i)\n⊢ Partrec fun a =>\n Part.bind (f 0 a) fun a_1 => Part... | [
616,
65
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
607,
1
] |
Mathlib/Order/CompactlyGenerated.lean | CompleteLattice.WellFounded.isSupFiniteCompact | [
{
"state_after": "ι : Sort ?u.16216\nα : Type u_1\ninst✝ : CompleteLattice α\nf : ι → α\nh : WellFounded fun x x_1 => x > x_1\ns : Set α\nS : Set α := {x | ∃ t, ↑t ⊆ s ∧ Finset.sup t id = x}\n⊢ ∃ t, ↑t ⊆ s ∧ sSup s = Finset.sup t id",
"state_before": "ι : Sort ?u.16216\nα : Type u_1\ninst✝ : CompleteLattice... | [
213,
27
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
203,
1
] |
Mathlib/RingTheory/PowerSeries/Basic.lean | Polynomial.coe_bit0 | [] | [
2588,
14
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2587,
1
] |
Mathlib/LinearAlgebra/Finsupp.lean | Finsupp.total_mapDomain | [] | [
644,
52
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
642,
1
] |
Mathlib/AlgebraicTopology/SimplexCategory.lean | SimplexCategory.iso_eq_iso_refl | [
{
"state_after": "x : SimplexCategory\ne : x ≅ x\nh : Finset.card Finset.univ = len x + 1\n⊢ e = Iso.refl x",
"state_before": "x : SimplexCategory\ne : x ≅ x\n⊢ e = Iso.refl x",
"tactic": "have h : (Finset.univ : Finset (Fin (x.len + 1))).card = x.len + 1 := Finset.card_fin (x.len + 1)"
},
{
"st... | [
590,
11
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
580,
1
] |
Mathlib/Algebra/Order/Monoid/WithTop.lean | WithTop.add_ne_top | [] | [
159,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
158,
1
] |
Mathlib/Algebra/Group/Units.lean | IsUnit.val_inv_mul | [] | [
750,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
749,
1
] |
Mathlib/Computability/Partrec.lean | Computable.list_cons | [] | [
346,
28
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
345,
1
] |
Mathlib/Analysis/BoxIntegral/Partition/Split.lean | BoxIntegral.Prepartition.IsPartition.exists_splitMany_le | [
{
"state_after": "ι : Type u_1\nM : Type ?u.55340\nn : ℕ\nI✝ J : Box ι\ni : ι\nx : ℝ\ninst✝ : Finite ι\nI : Box ι\nπ : Prepartition I\nh : IsPartition π\ns : Finset (ι × ℝ)\nhs : π ⊓ splitMany I s = filter (splitMany I s) fun J => ↑J ⊆ Prepartition.iUnion π\n⊢ splitMany I s ≤ π",
"state_before": "ι : Type u... | [
350,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
346,
1
] |
Mathlib/Data/Int/ModEq.lean | Dvd.dvd.zero_modEq_int | [] | [
94,
24
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
93,
1
] |
Mathlib/GroupTheory/Index.lean | Subgroup.relindex_mul_relindex | [
{
"state_after": "G : Type u_1\ninst✝ : Group G\nH K L : Subgroup G\nhHK : H ≤ K\nhKL : K ≤ L\n⊢ relindex (subgroupOf H L) (subgroupOf K L) * relindex K L = relindex H L",
"state_before": "G : Type u_1\ninst✝ : Group G\nH K L : Subgroup G\nhHK : H ≤ K\nhKL : K ≤ L\n⊢ relindex H K * relindex K L = relindex H... | [
131,
46
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
128,
1
] |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean | bot_lt_affineSpan | [
{
"state_after": "k : Type u_2\nV : Type u_3\nP : Type u_1\ninst✝³ : Ring k\ninst✝² : AddCommGroup V\ninst✝¹ : Module k V\ninst✝ : AffineSpace V P\nι : Type ?u.337806\ns : Set P\n⊢ affineSpan k s ≠ ⊥ ↔ s ≠ ∅",
"state_before": "k : Type u_2\nV : Type u_3\nP : Type u_1\ninst✝³ : Ring k\ninst✝² : AddCommGroup ... | [
1172,
34
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1170,
1
] |
Mathlib/MeasureTheory/Function/L1Space.lean | MeasureTheory.integrable_zero_measure | [] | [
555,
74
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
553,
1
] |
Mathlib/Order/Filter/Curry.lean | Filter.eventually_curry_iff | [] | [
68,
10
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
66,
1
] |
Mathlib/Data/Set/Lattice.lean | Set.biUnion_mono | [] | [
888,
59
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
886,
1
] |
Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean | CircleDeg1Lift.map_lt_add_translationNumber_add_one | [
{
"state_after": "case bc.bc\nf g : CircleDeg1Lift\nx : ℝ\n⊢ ↑⌊τ f⌋ ≤ τ f",
"state_before": "f g : CircleDeg1Lift\nx : ℝ\n⊢ x + ↑⌊τ f⌋ + 1 ≤ x + τ f + 1",
"tactic": "gcongr"
},
{
"state_after": "no goals",
"state_before": "case bc.bc\nf g : CircleDeg1Lift\nx : ℝ\n⊢ ↑⌊τ f⌋ ≤ τ f",
"tactic... | [
879,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
876,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | MultilinearMap.currySum_apply | [] | [
1459,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1457,
1
] |
Mathlib/Data/Real/ENNReal.lean | ENNReal.div_lt_iff | [] | [
1607,
60
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1606,
11
] |
Mathlib/Analysis/Asymptotics/Asymptotics.lean | Asymptotics.IsLittleO.right_isBigO_add | [] | [
2094,
70
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2092,
1
] |
Mathlib/Topology/LocalHomeomorph.lean | LocalHomeomorph.injOn | [] | [
189,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
188,
11
] |
Mathlib/RingTheory/DedekindDomain/Ideal.lean | Ideal.coprime_of_no_prime_ge | [
{
"state_after": "R : Type u_1\nA : Type ?u.1171353\nK : Type ?u.1171356\ninst✝³ : CommRing R\ninst✝² : CommRing A\ninst✝¹ : Field K\ninst✝ : IsDomain A\nI J : Ideal R\nh : ∀ (P : Ideal R), I ≤ P → J ≤ P → ¬IsPrime P\nhIJ : ¬I ⊔ J = ⊤\n⊢ False",
"state_before": "R : Type u_1\nA : Type ?u.1171353\nK : Type ?... | [
1207,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1203,
1
] |
Mathlib/Computability/TMToPartrec.lean | Turing.ToPartrec.Code.pred_eval | [
{
"state_after": "v : List ℕ\n⊢ Nat.rec (Part.some [0]) (fun y x => Part.some [y]) (List.headI v) = Part.some [Nat.pred (List.headI v)]",
"state_before": "v : List ℕ\n⊢ eval pred v = pure [Nat.pred (List.headI v)]",
"tactic": "simp [pred]"
},
{
"state_after": "no goals",
"state_before": "v :... | [
215,
38
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
214,
1
] |
Mathlib/Data/Real/Basic.lean | Real.sInf_le_iff | [
{
"state_after": "x y : ℝ\ns : Set ℝ\nh : BddBelow s\nh' : Set.Nonempty s\na : ℝ\n⊢ (∀ (ε : ℝ), 0 < ε → sInf s < a + ε) ↔ ∀ (ε : ℝ), 0 < ε → ∃ x, x ∈ s ∧ x < a + ε",
"state_before": "x y : ℝ\ns : Set ℝ\nh : BddBelow s\nh' : Set.Nonempty s\na : ℝ\n⊢ sInf s ≤ a ↔ ∀ (ε : ℝ), 0 < ε → ∃ x, x ∈ s ∧ x < a + ε",
... | [
785,
35
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
779,
1
] |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean | Subalgebra.algebraMap_mem | [] | [
108,
22
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
107,
1
] |
Mathlib/Topology/Support.lean | tsupport_mul_subset_left | [] | [
92,
45
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | Real.cos_pi_div_sixteen | [
{
"state_after": "x : ℝ\n⊢ cos (π / 16) = cos (π / 2 ^ 4)\n\nx : ℝ\n⊢ cos (π / 2 ^ 4) = sqrt (2 + sqrt (2 + sqrt 2)) / 2",
"state_before": "x : ℝ\n⊢ cos (π / 16) = sqrt (2 + sqrt (2 + sqrt 2)) / 2",
"tactic": "trans cos (π / 2 ^ 4)"
},
{
"state_after": "case e_x.e_a\nx : ℝ\n⊢ 16 = 2 ^ 4\n\nx : ℝ... | [
817,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
813,
1
] |
Mathlib/SetTheory/Cardinal/Ordinal.lean | Cardinal.aleph'_limit | [
{
"state_after": "o : Ordinal\nho : Ordinal.IsLimit o\n⊢ aleph' o ≤ ⨆ (a : ↑(Iio o)), aleph' ↑a",
"state_before": "o : Ordinal\nho : Ordinal.IsLimit o\n⊢ aleph' o = ⨆ (a : ↑(Iio o)), aleph' ↑a",
"tactic": "refine' le_antisymm _ (ciSup_le' fun i => aleph'_le.2 (le_of_lt i.2))"
},
{
"state_after":... | [
227,
69
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
224,
1
] |
Mathlib/Data/Polynomial/Splits.lean | Polynomial.splits_iff_exists_multiset | [] | [
427,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
423,
1
] |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | tendsto_tsum_compl_atTop_zero | [
{
"state_after": "case pos\nα : Type u_2\nβ : Type u_1\nγ : Type ?u.676328\nδ : Type ?u.676331\ninst✝² : AddCommGroup α\ninst✝¹ : UniformSpace α\ninst✝ : UniformAddGroup α\nf✝ g : β → α\na a₁ a₂ : α\nf : β → α\nH : Summable f\n⊢ Tendsto (fun s => ∑' (b : { x // ¬x ∈ s }), f ↑b) atTop (𝓝 0)\n\ncase neg\nα : Typ... | [
1145,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1124,
1
] |
Mathlib/MeasureTheory/Measure/VectorMeasure.lean | MeasureTheory.VectorMeasure.map_apply | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nm inst✝³ : MeasurableSpace α\ninst✝² : MeasurableSpace β\nM : Type u_3\ninst✝¹ : AddCommMonoid M\ninst✝ : TopologicalSpace M\nv : VectorMeasure α M\nf : α → β\nhf : Measurable f\ns : Set β\nhs : MeasurableSet s\n⊢ ↑{ measureOf' := fun s => if MeasurableSet s then ↑v... | [
589,
18
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
586,
1
] |
Mathlib/Data/Polynomial/Degree/Lemmas.lean | Polynomial.degree_C_mul | [
{
"state_after": "no goals",
"state_before": "R : Type u\nS : Type v\nι : Type w\na b : R\nm n : ℕ\ninst✝¹ : Semiring R\ninst✝ : NoZeroDivisors R\np q : R[X]\na0 : a ≠ 0\n⊢ degree (↑C a * p) = degree p",
"tactic": "rw [degree_mul, degree_C a0, zero_add]"
}
] | [
331,
41
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
330,
1
] |
Mathlib/Order/Heyting/Boundary.lean | Coheyting.hnot_boundary | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : CoheytingAlgebra α\na✝ b a : α\n⊢ ￢∂ a = ⊤",
"tactic": "rw [boundary, hnot_inf_distrib, sup_hnot_self]"
}
] | [
79,
94
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
79,
1
] |
Mathlib/GroupTheory/FreeGroup.lean | FreeGroup.toWord_inv | [
{
"state_after": "case mk\nα : Type u\nL✝ L₁ L₂ L₃ L₄ : List (α × Bool)\ninst✝ : DecidableEq α\nx : FreeGroup α\nL : List (α × Bool)\n⊢ toWord (Quot.mk Red.Step L)⁻¹ = invRev (toWord (Quot.mk Red.Step L))",
"state_before": "α : Type u\nL L₁ L₂ L₃ L₄ : List (α × Bool)\ninst✝ : DecidableEq α\nx : FreeGroup α\... | [
1344,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1342,
1
] |
Mathlib/Combinatorics/Composition.lean | Composition.ne_ones_iff | [
{
"state_after": "n : ℕ\nc✝ c : Composition n\n⊢ (¬∀ (i : ℕ), i ∈ c.blocks → i = 1) ↔ ∃ i, i ∈ c.blocks ∧ 1 < i",
"state_before": "n : ℕ\nc✝ c : Composition n\n⊢ c ≠ ones n ↔ ∃ i, i ∈ c.blocks ∧ 1 < i",
"tactic": "refine' (not_congr eq_ones_iff).trans _"
},
{
"state_after": "n : ℕ\nc✝ c : Compos... | [
542,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
539,
1
] |
Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean | div_mul_cancel_of_imp | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.8884\nM₀ : Type ?u.8887\nG₀ : Type u_1\nM₀' : Type ?u.8893\nG₀' : Type ?u.8896\nF : Type ?u.8899\nF' : Type ?u.8902\ninst✝¹ : MonoidWithZero M₀\ninst✝ : GroupWithZero G₀\na✝ b✝ c a b : G₀\nh : b = 0 → a = 0\nhb : b = 0\n⊢ a / b * b = a",
"tactic"... | [
140,
72
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
139,
1
] |
Mathlib/Data/Nat/PSub.lean | Nat.sub_eq_psub | [
{
"state_after": "m n : ℕ\n⊢ Option.getD (ppred (Option.getD (psub m n) 0)) 0 = Option.getD (psub m n >>= ppred) 0",
"state_before": "m n : ℕ\n⊢ Option.getD (ppred (m - n)) 0 = Option.getD (psub m (n + 1)) 0",
"tactic": "rw [sub_eq_psub m n, psub]"
},
{
"state_after": "no goals",
"state_befo... | [
62,
100
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
60,
1
] |
Mathlib/NumberTheory/PellMatiyasevic.lean | Pell.dvd_of_ysq_dvd | [
{
"state_after": "no goals",
"state_before": "a : ℕ\na1 : 1 < a\nn t : ℕ\nh : yn a1 n * yn a1 n ∣ yn a1 t\nnt : n ∣ t\nn0 : n = 0\n⊢ yn a1 n ∣ t",
"tactic": "rwa [n0] at nt ⊢"
},
{
"state_after": "a : ℕ\na1 : 1 < a\nn t : ℕ\nh : yn a1 n * yn a1 n ∣ yn a1 t\nnt : n ∣ t\nn0l : 0 < n\nk : ℕ\nke : t... | [
506,
96
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
496,
1
] |
Mathlib/Algebra/Ring/Equiv.lean | RingEquiv.map_zero | [] | [
423,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
422,
11
] |
Mathlib/Analysis/Calculus/Deriv/Mul.lean | DifferentiableAt.div_const | [] | [
316,
47
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
314,
1
] |
Mathlib/Analysis/NormedSpace/Extr.lean | IsLocalMax.norm_add_self | [] | [
100,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
98,
1
] |
Mathlib/Order/Disjoint.lean | IsCompl.right_unique | [] | [
559,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
558,
1
] |
Mathlib/Algebra/BigOperators/Ring.lean | Finset.prod_add_ordered | [
{
"state_after": "α : Type u\nβ : Type v\nγ : Type w\ns✝ s₁ s₂ : Finset α\na : α\nb : β\nf✝ g✝ : α → β\ninst✝² : CommSemiring β\nι : Type u_1\nR : Type u_2\ninst✝¹ : CommSemiring R\ninst✝ : LinearOrder ι\ns : Finset ι\nf g : ι → R\n⊢ ∀ (a : ι) (s : Finset ι),\n (∀ (x : ι), x ∈ s → x < a) →\n ∏ i in s, (... | [
183,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
162,
1
] |
Mathlib/Order/Bounds/Basic.lean | isGLB_prod | [] | [
1604,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1602,
1
] |
Mathlib/Analysis/ODE/Gronwall.lean | gronwallBound_ε0_δ0 | [
{
"state_after": "no goals",
"state_before": "E : Type ?u.31080\ninst✝³ : NormedAddCommGroup E\ninst✝² : NormedSpace ℝ E\nF : Type ?u.31176\ninst✝¹ : NormedAddCommGroup F\ninst✝ : NormedSpace ℝ F\nK x : ℝ\n⊢ gronwallBound 0 K 0 x = 0",
"tactic": "simp only [gronwallBound_ε0, MulZeroClass.zero_mul]"
}
... | [
96,
54
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
95,
1
] |
Mathlib/LinearAlgebra/Multilinear/Basic.lean | MultilinearMap.domDomCongr_trans | [] | [
731,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
728,
1
] |
Mathlib/Data/PFunctor/Univariate/M.lean | PFunctor.M.head'_eq_head | [] | [
283,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
282,
1
] |
Mathlib/Topology/Algebra/Group/Basic.lean | Subgroup.isClosed_topologicalClosure | [] | [
727,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
726,
1
] |
Mathlib/Topology/Instances/ENNReal.lean | cauchySeq_of_edist_le_of_tsum_ne_top | [
{
"state_after": "case intro\nα : Type u_1\nβ : Type ?u.428595\nγ : Type ?u.428598\ninst✝ : PseudoEMetricSpace α\nf : ℕ → α\nd : ℕ → ℝ≥0\nhf : ∀ (n : ℕ), edist (f n) (f (Nat.succ n)) ≤ (fun i => ↑(d i)) n\nhd : (∑' (i : ℕ), ↑(d i)) ≠ ⊤\n⊢ CauchySeq f",
"state_before": "α : Type u_1\nβ : Type ?u.428595\nγ : ... | [
1471,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1467,
1
] |
Mathlib/Analysis/NormedSpace/Star/Multiplier.lean | DoubleCentralizer.range_toProdMulOpposite | [
{
"state_after": "case intro\n𝕜 : Type u_2\nA : Type u_1\ninst✝⁴ : NontriviallyNormedField 𝕜\ninst✝³ : NonUnitalNormedRing A\ninst✝² : NormedSpace 𝕜 A\ninst✝¹ : SMulCommClass 𝕜 A A\ninst✝ : IsScalarTower 𝕜 A A\na : 𝓜(𝕜, A)\n⊢ toProdMulOpposite a ∈ {lr | ∀ (x y : A), ↑(unop lr.snd) x * y = x * ↑lr.fst y}"... | [
349,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
343,
1
] |
Mathlib/Analysis/Normed/Group/Basic.lean | norm_div_sub_norm_div_le_norm_div | [
{
"state_after": "no goals",
"state_before": "𝓕 : Type ?u.97651\n𝕜 : Type ?u.97654\nα : Type ?u.97657\nι : Type ?u.97660\nκ : Type ?u.97663\nE : Type u_1\nF : Type ?u.97669\nG : Type ?u.97672\ninst✝² : SeminormedGroup E\ninst✝¹ : SeminormedGroup F\ninst✝ : SeminormedGroup G\ns : Set E\na a₁ a₂ b b₁ b₂ : E... | [
670,
81
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
669,
1
] |
Mathlib/Topology/Algebra/Module/Basic.lean | ContinuousLinearMap.restrictScalars_zero | [] | [
1690,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1689,
1
] |
Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean | Matrix.Nondegenerate.toLinearMap₂ | [] | [
705,
93
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
703,
1
] |
Mathlib/Geometry/Euclidean/Sphere/Basic.lean | EuclideanGeometry.Cospherical.affineIndependent | [
{
"state_after": "V : Type u_2\nP : Type u_1\ninst✝³ : NormedAddCommGroup V\ninst✝² : InnerProductSpace ℝ V\ninst✝¹ : MetricSpace P\ninst✝ : NormedAddTorsor V P\ns : Set P\nhs : Cospherical s\np : Fin 3 → P\nhps : Set.range p ⊆ s\nhpi : Function.Injective p\n⊢ ¬Collinear ℝ (Set.range p)",
"state_before": "V... | [
276,
49
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
242,
1
] |
Mathlib/Data/Finset/Lattice.lean | Finset.min_singleton | [
{
"state_after": "F : Type ?u.323869\nα : Type u_1\nβ : Type ?u.323875\nγ : Type ?u.323878\nι : Type ?u.323881\nκ : Type ?u.323884\ninst✝ : LinearOrder α\na : α\n⊢ Finset.min (insert a ∅) = ↑a",
"state_before": "F : Type ?u.323869\nα : Type u_1\nβ : Type ?u.323875\nγ : Type ?u.323878\nι : Type ?u.323881\nκ ... | [
1259,
19
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1257,
1
] |
Mathlib/SetTheory/Ordinal/FixedPoint.lean | Ordinal.deriv_isNormal | [] | [
531,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
530,
1
] |
Mathlib/Order/Grade.lean | grade_ofDual | [] | [
265,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
264,
1
] |
Mathlib/Algebra/Order/Group/Abs.lean | abs_by_cases | [] | [
77,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
76,
1
] |
Mathlib/Topology/SubsetProperties.lean | Filter.cocompact_le_cofinite | [] | [
542,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
541,
1
] |
Mathlib/NumberTheory/Padics/PadicNorm.lean | padicNorm.zero | [
{
"state_after": "no goals",
"state_before": "p : ℕ\n⊢ padicNorm p 0 = 0",
"tactic": "simp [padicNorm]"
}
] | [
77,
66
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
77,
11
] |
Mathlib/Data/Real/EReal.lean | EReal.coe_ennreal_add | [
{
"state_after": "no goals",
"state_before": "x y : ℝ≥0∞\n⊢ ↑(x + y) = ↑x + ↑y",
"tactic": "cases x <;> cases y <;> rfl"
}
] | [
568,
30
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
567,
1
] |
Mathlib/Data/Finite/Card.lean | Finite.card_eq | [
{
"state_after": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.1360\ninst✝¹ : Finite α\ninst✝ : Finite β\nthis : Fintype α\n⊢ Nat.card α = Nat.card β ↔ Nonempty (α ≃ β)",
"state_before": "α : Type u_1\nβ : Type u_2\nγ : Type ?u.1360\ninst✝¹ : Finite α\ninst✝ : Finite β\n⊢ Nat.card α = Nat.card β ↔ Nonempty (α ≃ ... | [
78,
56
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
75,
1
] |
Mathlib/Algebra/Order/Monoid/WithTop.lean | WithBot.coe_lt_one | [] | [
527,
13
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
526,
1
] |
Mathlib/Data/Fin/Basic.lean | Fin.pred_one | [
{
"state_after": "case h\nn✝ m n : ℕ\n⊢ ↑(pred 1 (_ : 1 ≠ 0)) = ↑0",
"state_before": "n✝ m n : ℕ\n⊢ pred 1 (_ : 1 ≠ 0) = 0",
"tactic": "ext"
},
{
"state_after": "no goals",
"state_before": "case h\nn✝ m n : ℕ\n⊢ ↑(pred 1 (_ : 1 ≠ 0)) = ↑0",
"tactic": "simp"
}
] | [
1561,
7
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1559,
1
] |
Mathlib/Algebra/Lie/Subalgebra.lean | LieSubalgebra.coe_lieSpan_submodule_eq_iff | [
{
"state_after": "R : Type u\nL : Type v\ninst✝⁴ : CommRing R\ninst✝³ : LieRing L\ninst✝² : LieAlgebra R L\nL₂ : Type w\ninst✝¹ : LieRing L₂\ninst✝ : LieAlgebra R L₂\nf : L →ₗ⁅R⁆ L₂\nK K' : LieSubalgebra R L\nK₂ : LieSubalgebra R L₂\ns : Set L\np : Submodule R L\n⊢ (lieSpan R L ↑p).toSubmodule = p ↔ ∀ (x y : L)... | [
719,
91
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
713,
1
] |
Mathlib/Data/Set/Intervals/WithBotTop.lean | WithBot.preimage_coe_Ioc_bot | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : PartialOrder α\na b : α\n⊢ some ⁻¹' Ioc ⊥ ↑a = Iic a",
"tactic": "simp [← Ioi_inter_Iic]"
}
] | [
190,
25
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
189,
1
] |
Mathlib/Data/Multiset/Basic.lean | Multiset.rel_flip | [] | [
2668,
31
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
2667,
1
] |
Mathlib/SetTheory/Ordinal/Basic.lean | Cardinal.lift_lt_univ | [
{
"state_after": "no goals",
"state_before": "α : Type ?u.233635\nβ : Type ?u.233638\nγ : Type ?u.233641\nr : α → α → Prop\ns : β → β → Prop\nt : γ → γ → Prop\nc : Cardinal\n⊢ lift c < univ",
"tactic": "simpa only [lift.principalSeg_coe, lift_ord, lift_succ, ord_le, succ_le_iff] using\n le_of_lt (lift.... | [
1504,
64
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1502,
1
] |
Mathlib/Analysis/Calculus/MeanValue.lean | exists_ratio_deriv_eq_ratio_slope | [] | [
767,
78
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
762,
1
] |
Mathlib/Data/Set/Intervals/WithBotTop.lean | WithTop.preimage_coe_Ioo | [
{
"state_after": "no goals",
"state_before": "α : Type u_1\ninst✝ : PartialOrder α\na b : α\n⊢ some ⁻¹' Ioo ↑a ↑b = Ioo a b",
"tactic": "simp [← Ioi_inter_Iio]"
}
] | [
72,
101
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
72,
1
] |
Mathlib/MeasureTheory/Integral/SetIntegral.lean | MeasureTheory.continuous_set_integral | [
{
"state_after": "α : Type u_2\nβ : Type ?u.347428\nE : Type u_1\nF : Type ?u.347434\ninst✝⁶ : MeasurableSpace α\ninst✝⁵ : NormedAddCommGroup E\n𝕜 : Type ?u.347443\ninst✝⁴ : NormedField 𝕜\ninst✝³ : NormedAddCommGroup F\ninst✝² : NormedSpace 𝕜 F\np : ℝ≥0∞\nμ : Measure α\ninst✝¹ : NormedSpace ℝ E\ninst✝ : Comp... | [
945,
76
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
936,
1
] |
Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean | MeasureTheory.Measure.ext_of_Ico | [] | [
732,
57
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
728,
1
] |
Mathlib/Analysis/ODE/PicardLindelof.lean | PicardLindelof.FunSpace.uniformInducing_toContinuousMap | [] | [
197,
8
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
196,
1
] |
Mathlib/Data/Finsupp/ToDfinsupp.lean | Finsupp.toDfinsupp_single | [
{
"state_after": "case h\nι : Type u_1\nR : Type ?u.953\nM : Type u_2\ninst✝¹ : DecidableEq ι\ninst✝ : Zero M\ni : ι\nm : M\ni✝ : ι\n⊢ ↑(toDfinsupp (single i m)) i✝ = ↑(Dfinsupp.single i m) i✝",
"state_before": "ι : Type u_1\nR : Type ?u.953\nM : Type u_2\ninst✝¹ : DecidableEq ι\ninst✝ : Zero M\ni : ι\nm : ... | [
94,
53
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
91,
1
] |
Mathlib/Data/List/Forall2.lean | List.forall₂_cons_left_iff | [] | [
98,
51
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
90,
1
] |
Mathlib/Data/Dfinsupp/Basic.lean | Dfinsupp.comapDomain'_zero | [
{
"state_after": "case h\nι : Type u\nγ : Type w\nβ : ι → Type v\nβ₁ : ι → Type v₁\nβ₂ : ι → Type v₂\ndec : DecidableEq ι\nκ : Type u_1\ninst✝ : (i : ι) → Zero (β i)\nh : κ → ι\nh' : ι → κ\nhh' : Function.LeftInverse h' h\ni✝ : κ\n⊢ ↑(comapDomain' h hh' 0) i✝ = ↑0 i✝",
"state_before": "ι : Type u\nγ : Type ... | [
1373,
50
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
1370,
1
] |
Mathlib/CategoryTheory/Limits/Shapes/Pullbacks.lean | CategoryTheory.Limits.cospan_left | [] | [
202,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
201,
1
] |
Mathlib/CategoryTheory/Limits/Final.lean | CategoryTheory.Functor.Initial.limit_cone_comp_aux | [
{
"state_after": "case h₁\nC : 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\ns : Cone (F ⋙ G)\nj : C\n⊢ ∀ (X₁ X₂ : C) (k₁ : F.obj X₁ ⟶ F.obj j) (k₂ : F.obj X₂ ⟶ F.obj j) (f : X₁ ⟶ X₂),\n F.map f ≫ k₂ = k₁ → s.π.app X... | [
534,
20
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
521,
1
] |
Mathlib/Order/Monotone/Basic.lean | StrictMono.comp_strictMonoOn | [] | [
696,
36
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
694,
11
] |
Mathlib/Order/Hom/Lattice.lean | InfTopHom.coe_toInfHom | [] | [
894,
6
] | 5a919533f110b7d76410134a237ee374f24eaaad | https://github.com/leanprover-community/mathlib4 | [
893,
1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.