Loogle!
Result
Found 110 declarations mentioning Order.succ and Ordinal.
- Cardinal.lt_ord_succ_card 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u_1}) : o < (Order.succ o.card).ord - Ordinal.natCast_succ 📋 Mathlib.SetTheory.Ordinal.Basic
(n : ℕ) : ↑n.succ = Order.succ ↑n - Cardinal.card_le_iff 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} {c : Cardinal.{u_1}} : o.card ≤ c ↔ o < (Order.succ c).ord - Ordinal.type_lt_mem_range_succ 📋 Mathlib.SetTheory.Ordinal.Basic
{α : Type u} [LinearOrder α] [WellFoundedLT α] [OrderTop α] : (Ordinal.type fun x1 x2 => x1 < x2) ∈ Set.range Order.succ - Ordinal.type_lt_mem_range_succ_iff 📋 Mathlib.SetTheory.Ordinal.Basic
{α : Type u} [LinearOrder α] [WellFoundedLT α] : (Ordinal.type fun x1 x2 => x1 < x2) ∈ Set.range Order.succ ↔ ∃ x, IsMax x - Ordinal.le_enum_succ 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} (a : (Order.succ o).ToType) : a ≤ (Ordinal.enum fun x1 x2 => x1 < x2) ⟨o, ⋯⟩ - Ordinal.pred_succ 📋 Mathlib.SetTheory.Ordinal.Arithmetic
(o : Ordinal.{u_4}) : (Order.succ o).pred = o - Ordinal.predSuccGi 📋 Mathlib.SetTheory.Ordinal.Arithmetic
: GaloisInsertion Ordinal.pred Order.succ - Ordinal.pred_succ_gi 📋 Mathlib.SetTheory.Ordinal.Arithmetic
: GaloisInsertion Ordinal.pred Order.succ - Ordinal.self_le_succ_pred 📋 Mathlib.SetTheory.Ordinal.Arithmetic
(o : Ordinal.{u_4}) : o ≤ Order.succ o.pred - Ordinal.lift_succ 📋 Mathlib.SetTheory.Ordinal.Arithmetic
(a : Ordinal.{v}) : Ordinal.lift.{u, v} (Order.succ a) = Order.succ (Ordinal.lift.{u, v} a) - Ordinal.succ_pred_eq_iff_not_isSuccPrelimit 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{o : Ordinal.{u_4}} : Order.succ o.pred = o ↔ ¬Order.IsSuccPrelimit o - Ordinal.lt_pred_iff_succ_lt 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{a b : Ordinal.{u_4}} : a < b.pred ↔ Order.succ a < b - Ordinal.pred_le_iff_le_succ 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{a b : Ordinal.{u_4}} : a.pred ≤ b ↔ a ≤ Order.succ b - Ordinal.one_add_natCast 📋 Mathlib.SetTheory.Ordinal.Arithmetic
(m : ℕ) : 1 + ↑m = ↑(Order.succ m) - Ordinal.zero_or_succ_or_isSuccLimit 📋 Mathlib.SetTheory.Ordinal.Arithmetic
(o : Ordinal.{u_4}) : o = 0 ∨ o ∈ Set.range Order.succ ∨ Order.IsSuccLimit o - Ordinal.one_add_ofNat 📋 Mathlib.SetTheory.Ordinal.Arithmetic
(m : ℕ) [m.AtLeastTwo] : 1 + OfNat.ofNat m = Order.succ (OfNat.ofNat m) - Ordinal.lt_mul_succ_div 📋 Mathlib.SetTheory.Ordinal.Arithmetic
(a : Ordinal.{u_4}) {b : Ordinal.{u_4}} (h : b ≠ 0) : a < b * Order.succ (a / b) - Ordinal.mul_succ 📋 Mathlib.SetTheory.Ordinal.Arithmetic
(a b : Ordinal.{u_4}) : a * Order.succ b = a * b + a - Ordinal.div_le 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{a b c : Ordinal.{u_4}} (b0 : b ≠ 0) : a / b ≤ c ↔ a < b * Order.succ c - Ordinal.lt_div 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{a b c : Ordinal.{u_4}} (h : c ≠ 0) : a < b / c ↔ c * Order.succ a ≤ b - Ordinal.orderTopToTypeSucc 📋 Mathlib.SetTheory.Ordinal.Arithmetic
(o : Ordinal.{u_4}) : OrderTop (Order.succ o).ToType - Ordinal.add_mul_succ 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{a b : Ordinal.{u_4}} (c : Ordinal.{u_4}) (ba : b + a = a) : (a + b) * Order.succ c = a * Order.succ c + b - Ordinal.limitRecOn_succ 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{motive : Ordinal.{u_4} → Sort u_5} (o : Ordinal.{u_4}) (H₁ : motive 0) (H₂ : (o : Ordinal.{u_4}) → motive o → motive (o + 1)) (H₃ : (o : Ordinal.{u_4}) → Order.IsSuccLimit o → ((o' : Ordinal.{u_4}) → o' < o → motive o') → motive o) : Ordinal.limitRecOn (Order.succ o) H₁ H₂ H₃ = H₂ o (Ordinal.limitRecOn o H₁ H₂ H₃) - Ordinal.enum_succ_eq_top 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{o : Ordinal.{u_4}} : (Ordinal.enum fun x1 x2 => x1 < x2) ⟨o, ⋯⟩ = ⊤ - Ordinal.sInf_compl_lt_ord_succ 📋 Mathlib.SetTheory.Ordinal.Family
{ι : Type u} (f : ι → Ordinal.{u}) : sInf (Set.range f)ᶜ < (Order.succ (Cardinal.mk ι)).ord - Ordinal.sInf_compl_lt_lift_ord_succ 📋 Mathlib.SetTheory.Ordinal.Family
{ι : Type u} (f : ι → Ordinal.{max u v}) : sInf (Set.range f)ᶜ < Ordinal.lift.{v, u} (Order.succ (Cardinal.mk ι)).ord - Ordinal.succ_lt_iSup_of_ne_iSup 📋 Mathlib.SetTheory.Ordinal.Family
{ι : Type u_3} {f : ι → Ordinal.{u}} [Small.{u, u_3} ι] (hf : ∀ (i : ι), f i ≠ iSup f) {a : Ordinal.{u}} (hao : a < iSup f) : Order.succ a < iSup f - Ordinal.enumOrd_succ_le 📋 Mathlib.SetTheory.Ordinal.Enum
{a b : Ordinal.{u}} {s : Set Ordinal.{u}} (hs : ¬BddAbove s) (ha : a ∈ s) (hb : Ordinal.enumOrd s b < a) : Ordinal.enumOrd s (Order.succ b) ≤ a - Ordinal.lt_opow_succ_log_self 📋 Mathlib.SetTheory.Ordinal.Exponential
{b : Ordinal.{u_1}} (hb : 1 < b) (x : Ordinal.{u_1}) : x < b ^ Order.succ (Ordinal.log b x) - Ordinal.opow_succ 📋 Mathlib.SetTheory.Ordinal.Exponential
(a b : Ordinal.{u_1}) : a ^ Order.succ b = a ^ b * a - Ordinal.opow_lt_opow_left_of_succ 📋 Mathlib.SetTheory.Ordinal.Exponential
{a b c : Ordinal.{u_1}} (ab : a < b) : a ^ Order.succ c < b ^ Order.succ c - Ordinal.lt_omega0_opow_succ 📋 Mathlib.SetTheory.Ordinal.Exponential
{a b : Ordinal.{u_1}} : a < Ordinal.omega0 ^ Order.succ b ↔ ∃ n, a < Ordinal.omega0 ^ b * ↑n - Ordinal.deriv_succ 📋 Mathlib.SetTheory.Ordinal.FixedPoint
(f : Ordinal.{u_1} → Ordinal.{u_1}) (o : Ordinal.{u_1}) : Ordinal.deriv f (Order.succ o) = Ordinal.nfp f (Order.succ (Ordinal.deriv f o)) - Ordinal.derivFamily_succ 📋 Mathlib.SetTheory.Ordinal.FixedPoint
{ι : Type u_1} (f : ι → Ordinal.{u_2} → Ordinal.{u_2}) (o : Ordinal.{u_2}) : Ordinal.derivFamily f (Order.succ o) = Ordinal.nfpFamily f (Order.succ (Ordinal.derivFamily f o)) - Ordinal.nfp_mul_opow_omega0_add 📋 Mathlib.SetTheory.Ordinal.FixedPoint
{a c : Ordinal.{u_1}} (b : Ordinal.{u_1}) (ha : 0 < a) (hc : 0 < c) (hca : c ≤ a ^ Ordinal.omega0) : Ordinal.nfp (fun x => a * x) (a ^ Ordinal.omega0 * b + c) = a ^ Ordinal.omega0 * Order.succ b - Ordinal.mul_eq_opow_log_succ 📋 Mathlib.SetTheory.Ordinal.Principal
{a b : Ordinal.{u}} (ha : a ≠ 0) (hb : Ordinal.IsPrincipal (fun x1 x2 => x1 * x2) b) (hb₂ : 2 < b) : a * b = b ^ Order.succ (Ordinal.log b a) - Ordinal.isInitial_succ 📋 Mathlib.SetTheory.Cardinal.Aleph
{o : Ordinal.{u_1}} : (Order.succ o).IsInitial ↔ o < Ordinal.omega0 - Cardinal.succ_aleph0 📋 Mathlib.SetTheory.Cardinal.Aleph
: Order.succ Cardinal.aleph0 = Cardinal.aleph 1 - Cardinal.beth_succ 📋 Mathlib.SetTheory.Cardinal.Aleph
(o : Ordinal.{u_1}) : Cardinal.beth (Order.succ o) = 2 ^ Cardinal.beth o - Cardinal.preBeth_succ 📋 Mathlib.SetTheory.Cardinal.Aleph
(o : Ordinal.{u_1}) : Cardinal.preBeth (Order.succ o) = 2 ^ Cardinal.preBeth o - Cardinal.succ_aleph 📋 Mathlib.SetTheory.Cardinal.Aleph
(o : Ordinal.{u_1}) : Order.succ (Cardinal.aleph o) = Cardinal.aleph (o + 1) - Cardinal.succ_preAleph 📋 Mathlib.SetTheory.Cardinal.Aleph
(o : Ordinal.{u_1}) : Order.succ (Cardinal.preAleph o) = Cardinal.preAleph (o + 1) - Ordinal.cof_succ 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u_1}) : (Order.succ o).cof = 1 - Ordinal.cof_eq_one_iff 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u_1}} : o.cof = 1 ↔ o ∈ Set.range Order.succ - CategoryTheory.SmallObject.prop_iterationFunctor_map_succ 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (j : κ.ord.ToType) : (CategoryTheory.SmallObject.succStruct I κ).prop ((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : CategoryTheory.Arrow.mk (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f) ≅ CategoryTheory.Arrow.mk ((CategoryTheory.SmallObject.ε I.homFamily).app (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj f)) - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso_hom_left 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : CategoryTheory.Arrow.Hom.left (CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso I κ f j).hom = CategoryTheory.CategoryStruct.id (CategoryTheory.Arrow.mk (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)).left - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso_hom_right_right_comp_assoc 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) {Z : C} (h : (((CategoryTheory.SmallObject.iterationFunctor I κ).obj (Order.succ j)).obj f).right ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right (CategoryTheory.Arrow.Hom.right (CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso I κ f j).hom)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)) h) = h - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso_hom_right_right_comp 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right (CategoryTheory.Arrow.Hom.right (CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso I κ f j).hom)) (CategoryTheory.Arrow.Hom.right (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)) = CategoryTheory.CategoryStruct.id (CategoryTheory.Arrow.mk (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)).right.right - CategoryTheory.SmallObject.relativeCellComplexιObjFObjSuccIso 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) (j : κ.ord.ToType) : (CategoryTheory.SmallObject.relativeCellComplexιObj I κ f).F.obj (Order.succ j) ≅ CategoryTheory.SmallObject.functorObj I.homFamily (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj (CategoryTheory.Arrow.mk f)).hom - CategoryTheory.SmallObject.ιFunctorObj_eq 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) (j : κ.ord.ToType) : CategoryTheory.SmallObject.ιFunctorObj I.homFamily (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj (CategoryTheory.Arrow.mk f)).hom = CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.relativeCellComplexιObj I κ f).F.map (CategoryTheory.homOfLE ⋯)) (CategoryTheory.SmallObject.relativeCellComplexιObjFObjSuccIso I κ f j).hom - CategoryTheory.SmallObject.πFunctorObj_eq 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) (j : κ.ord.ToType) : CategoryTheory.SmallObject.πFunctorObj I.homFamily (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj (CategoryTheory.Arrow.mk f)).hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.relativeCellComplexιObjFObjSuccIso I κ f j).inv (CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.relativeCellComplexιObj I κ f).incl.app (Order.succ j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.πObj I κ f) (CategoryTheory.SmallObject.iterationFunctorObjObjRightIso I κ (CategoryTheory.Arrow.mk f) j).inv)) - CategoryTheory.OrthogonalReflection.iterationObjSuccIso 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] (j : κ.ord.ToType) : (CategoryTheory.OrthogonalReflection.iteration W Z κ).obj (Order.succ j) ≅ CategoryTheory.OrthogonalReflection.succ W ((CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j) - CategoryTheory.OrthogonalReflection.iteration_map_succ_surjectivity 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {Z : C} [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] {κ : Cardinal.{w}} [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] {X Y : C} (f : X ⟶ Y) (hf : W f) {j : κ.ord.ToType} (g : X ⟶ (CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j) : ∃ g', CategoryTheory.CategoryStruct.comp f g' = CategoryTheory.CategoryStruct.comp g ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.OrthogonalReflection.iteration_map_succ_injectivity 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {Z : C} [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] {κ : Cardinal.{w}} [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] {X Y : C} (f : X ⟶ Y) (hf : W f) {j : κ.ord.ToType} (g₁ g₂ : Y ⟶ (CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j) (hg : CategoryTheory.CategoryStruct.comp f g₁ = CategoryTheory.CategoryStruct.comp f g₂) : CategoryTheory.CategoryStruct.comp g₁ ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) = CategoryTheory.CategoryStruct.comp g₂ ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.OrthogonalReflection.iteration_map_succ 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] (j : κ.ord.ToType) : (CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯) = CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.toSucc W ((CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j)) (CategoryTheory.OrthogonalReflection.iterationObjSuccIso W Z κ j).inv - CategoryTheory.OrthogonalReflection.iteration_map_succ_assoc 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] (j : κ.ord.ToType) {Z✝ : C} (h : (CategoryTheory.OrthogonalReflection.iteration W Z κ).obj (Order.succ j) ⟶ Z✝) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.toStep W ((CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.fromStep W ((CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.iterationObjSuccIso W Z κ j).inv h)) - Field.Emb.Cardinal.filtration_succ 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : (Module.rank F E).ord.ToType) : IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio (Order.succ i)) = IntermediateField.restrictScalars F (↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)))⟮(Field.Emb.Cardinal.wellOrderedBasis F E) (Field.Emb.Cardinal.leastExt F E i)⟯ - Field.Emb.Cardinal.equivSucc 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : WithTop (Module.rank F E).ord.ToType) : (↥(Field.Emb.Cardinal.filtration (Order.succ i)) →ₐ[F] AlgebraicClosure E) ≃ (↥(Field.Emb.Cardinal.filtration i) →ₐ[F] AlgebraicClosure E) × Field.Emb.Cardinal.factor i - Field.Emb.Cardinal.succEquiv 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : (Module.rank F E).ord.ToType) : (↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio (Order.succ i))) →ₐ[F] AlgebraicClosure E) ≃ (↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)) →ₐ[F] AlgebraicClosure E) × Field.Emb ↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)) ↥(↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)))⟮(Field.Emb.Cardinal.wellOrderedBasis F E) (Field.Emb.Cardinal.leastExt F E i)⟯ - Field.Emb.Cardinal.equivSucc_coherence 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : WithTop (Module.rank F E).ord.ToType) (f : ↥(Field.Emb.Cardinal.filtration (Order.succ i)) →ₐ[F] AlgebraicClosure E) : ((Field.Emb.Cardinal.equivSucc i) f).1 = Field.Emb.Cardinal.embFunctor F E ⋯ f - Field.Emb.Cardinal.succEquiv_coherence 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : (Module.rank F E).ord.ToType) (f : ↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio (Order.succ i))) →ₐ[F] AlgebraicClosure E) : ((Field.Emb.Cardinal.succEquiv i) f).1 = f.comp (Subalgebra.inclusion ⋯) - WellFounded.rank_eq 📋 Mathlib.SetTheory.Ordinal.Rank
{α : Type u} (r : α → α → Prop) [hwf : WellFounded r] (a : α) : WellFounded.rank r a = ⨆ b, Order.succ (WellFounded.rank r ↑b) - Acc.rank_eq 📋 Mathlib.SetTheory.Ordinal.Rank
{α : Type u} {a : α} {r : α → α → Prop} (h : Acc r a) : h.rank = ⨆ b, Order.succ ⋯.rank - OrdinalApprox.exists_gfpApprox_eq_gfpApprox 📋 Mathlib.SetTheory.Ordinal.FixedPointApproximants
{α : Type u} [CompleteLattice α] (f : α →o α) {x : α} : ∃ a < (Order.succ (Cardinal.mk α)).ord, ∃ b < (Order.succ (Cardinal.mk α)).ord, a ≠ b ∧ OrdinalApprox.gfpApprox f x a = OrdinalApprox.gfpApprox f x b - OrdinalApprox.exists_lfpApprox_eq_lfpApprox 📋 Mathlib.SetTheory.Ordinal.FixedPointApproximants
{α : Type u} [CompleteLattice α] (f : α →o α) (x : α) : ∃ a < (Order.succ (Cardinal.mk α)).ord, ∃ b < (Order.succ (Cardinal.mk α)).ord, a ≠ b ∧ OrdinalApprox.lfpApprox f x a = OrdinalApprox.lfpApprox f x b - ONote.fundamentalSequenceProp_inl_some 📋 Mathlib.SetTheory.Ordinal.Notation
(o a : ONote) : o.FundamentalSequenceProp (Sum.inl (some a)) ↔ o.repr = Order.succ a.repr ∧ (o.NF → a.NF) - ONote.repr_opow_aux₂ 📋 Mathlib.SetTheory.Ordinal.Notation
{a0 a' : ONote} [N0 : a0.NF] [Na' : a'.NF] (m : ℕ) (d : Ordinal.omega0 ∣ a'.repr) (e0 : a0.repr ≠ 0) (h : a'.repr + ↑m < Ordinal.omega0 ^ a0.repr) (n : ℕ+) (k : ℕ) : have R := (ONote.opowAux 0 a0 (a0.oadd n a' * ↑m) k m).repr; (k ≠ 0 → R < (Ordinal.omega0 ^ a0.repr) ^ Order.succ ↑k) ∧ (Ordinal.omega0 ^ a0.repr) ^ ↑k * (Ordinal.omega0 ^ a0.repr * ↑↑n + a'.repr) + R = (Ordinal.omega0 ^ a0.repr * ↑↑n + a'.repr + ↑m) ^ Order.succ ↑k - Ordinal.gamma_succ_eq_nfp 📋 Mathlib.SetTheory.Ordinal.Veblen
(o : Ordinal.{u_1}) : (Order.succ o).gamma = Ordinal.nfp (fun x => Ordinal.veblen x 0) (Order.succ o.gamma) - Ordinal.epsilon_succ_eq_nfp 📋 Mathlib.SetTheory.Ordinal.Veblen
(o : Ordinal.{u_1}) : (Order.succ o).epsilon = Ordinal.nfp (fun a => Ordinal.omega0 ^ a) (Order.succ o.epsilon) - PSet.rank_powerset 📋 Mathlib.SetTheory.ZFC.Rank
(x : PSet.{u_1}) : x.powerset.rank = Order.succ x.rank - ZFSet.rank_powerset 📋 Mathlib.SetTheory.ZFC.Rank
(x : ZFSet.{u_1}) : x.powerset.rank = Order.succ x.rank - PSet.rank_singleton 📋 Mathlib.SetTheory.ZFC.Rank
(x : PSet.{u_1}) : {x}.rank = Order.succ x.rank - ZFSet.rank_singleton 📋 Mathlib.SetTheory.ZFC.Rank
(x : ZFSet.{u_1}) : {x}.rank = Order.succ x.rank - PSet.le_succ_rank_sUnion 📋 Mathlib.SetTheory.ZFC.Rank
(x : PSet.{u_1}) : x.rank ≤ Order.succ (⋃₀ x).rank - ZFSet.le_succ_rank_sUnion 📋 Mathlib.SetTheory.ZFC.Rank
(x : ZFSet.{u_1}) : x.rank ≤ Order.succ x.sUnion.rank - PSet.rank_insert 📋 Mathlib.SetTheory.ZFC.Rank
(x y : PSet.{u_1}) : (insert x y).rank = max (Order.succ x.rank) y.rank - ZFSet.rank_insert 📋 Mathlib.SetTheory.ZFC.Rank
(x y : ZFSet.{u_1}) : (insert x y).rank = max (Order.succ x.rank) y.rank - ZFSet.rank_range 📋 Mathlib.SetTheory.ZFC.Rank
{α : Type u_1} [Small.{u, u_1} α] (f : α → ZFSet.{u}) : (ZFSet.range f).rank = ⨆ i, Order.succ (f i).rank - PSet.rank_pair 📋 Mathlib.SetTheory.ZFC.Rank
(x y : PSet.{u_1}) : {x, y}.rank = max (Order.succ x.rank) (Order.succ y.rank) - ZFSet.rank_pair 📋 Mathlib.SetTheory.ZFC.Rank
(x y : ZFSet.{u_1}) : {x, y}.rank = max (Order.succ x.rank) (Order.succ y.rank) - ZFSet.vonNeumann_succ 📋 Mathlib.SetTheory.ZFC.VonNeumann
(o : Ordinal.{u_1}) : ZFSet.vonNeumann (Order.succ o) = (ZFSet.vonNeumann o).powerset - ZFSet.mem_vonNeumann_succ 📋 Mathlib.SetTheory.ZFC.VonNeumann
(x : ZFSet.{u_1}) : x ∈ ZFSet.vonNeumann (Order.succ x.rank) - Profinite.NobelingProof.CC'₁ 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) : ↑(Profinite.NobelingProof.C' C ho) → ↑C - Profinite.NobelingProof.C0_projOrd 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) {x : I → Bool} (hx : x ∈ Profinite.NobelingProof.C0 C ho) : Profinite.NobelingProof.Proj (fun x => Profinite.NobelingProof.ord I x < o) x = x - Profinite.NobelingProof.C1_projOrd 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) {x : I → Bool} (hx : x ∈ Profinite.NobelingProof.C1 C ho) : Profinite.NobelingProof.SwapTrue o (Profinite.NobelingProof.Proj (fun x => Profinite.NobelingProof.ord I x < o) x) = x - Profinite.NobelingProof.GoodProducts.sum_equiv 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) : ↑(Profinite.NobelingProof.GoodProducts (Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o)) ⊕ ↑(Profinite.NobelingProof.GoodProducts.MaxProducts C ho) ≃ ↑(Profinite.NobelingProof.GoodProducts C) - Profinite.NobelingProof.GoodProducts.union_succ 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) : Profinite.NobelingProof.GoodProducts C = Profinite.NobelingProof.GoodProducts (Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o) ∪ Profinite.NobelingProof.GoodProducts.MaxProducts C ho - Profinite.NobelingProof.continuous_CC'₁ 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) : Continuous (Profinite.NobelingProof.CC'₁ C hsC ho) - Profinite.NobelingProof.GoodProducts.head!_eq_o_of_maxProducts 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) [Inhabited I] (l : ↑(Profinite.NobelingProof.GoodProducts.MaxProducts C ho)) : (↑↑l).head! = Profinite.NobelingProof.term I ho - Profinite.NobelingProof.swapTrue_mem_C1 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) (f : ↑(Profinite.NobelingProof.π (Profinite.NobelingProof.C1 C ho) fun x => Profinite.NobelingProof.ord I x < o)) : Profinite.NobelingProof.SwapTrue o ↑f ∈ Profinite.NobelingProof.C1 C ho - Profinite.NobelingProof.GoodProducts.isChain_cons_of_lt 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) (l : ↑(Profinite.NobelingProof.GoodProducts.MaxProducts C ho)) (q : Profinite.NobelingProof.Products I) (hq : q < (↑l).Tail) : List.IsChain (fun x x_1 => x > x_1) (Profinite.NobelingProof.term I ho :: ↑q) - Profinite.NobelingProof.GoodProducts.max_eq_o_cons_tail 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) (l : ↑(Profinite.NobelingProof.GoodProducts.MaxProducts C ho)) : ↑↑l = Profinite.NobelingProof.term I ho :: ↑(↑l).Tail - Profinite.NobelingProof.GoodProducts.good_lt_maxProducts 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) (q : ↑(Profinite.NobelingProof.GoodProducts (Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o))) (l : ↑(Profinite.NobelingProof.GoodProducts.MaxProducts C ho)) : List.Lex (fun x1 x2 => x1 < x2) ↑↑q ↑↑l - Profinite.NobelingProof.Linear_CC' 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) : LocallyConstant ↑C ℤ →ₗ[ℤ] LocallyConstant ↑(Profinite.NobelingProof.C' C ho) ℤ - Profinite.NobelingProof.Linear_CC'₁ 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) : LocallyConstant ↑C ℤ →ₗ[ℤ] LocallyConstant ↑(Profinite.NobelingProof.C' C ho) ℤ - Profinite.NobelingProof.GoodProducts.linearIndependent_iff_sum 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) : LinearIndependent ℤ (Profinite.NobelingProof.GoodProducts.eval C) ↔ LinearIndependent ℤ (Profinite.NobelingProof.GoodProducts.SumEval C ho) - Profinite.NobelingProof.GoodProducts.span_sum 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) : Set.range (Profinite.NobelingProof.GoodProducts.eval C) = Set.range (Sum.elim (fun l => Profinite.NobelingProof.Products.eval C ↑l) fun l => Profinite.NobelingProof.Products.eval C ↑l) - Profinite.NobelingProof.GoodProducts.sum_equiv_comp_eval_eq_elim 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) : Profinite.NobelingProof.GoodProducts.eval C ∘ (Profinite.NobelingProof.GoodProducts.sum_equiv C hsC ho).toFun = Sum.elim (fun l => Profinite.NobelingProof.Products.eval C ↑l) fun l => Profinite.NobelingProof.Products.eval C ↑l - Profinite.NobelingProof.GoodProducts.max_eq_eval 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) (l : ↑(Profinite.NobelingProof.GoodProducts.MaxProducts C ho)) : (Profinite.NobelingProof.Linear_CC' C hsC ho) (Profinite.NobelingProof.Products.eval C ↑l) = Profinite.NobelingProof.Products.eval (Profinite.NobelingProof.C' C ho) (↑l).Tail - Profinite.NobelingProof.Products.max_eq_eval 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) [Inhabited I] (l : Profinite.NobelingProof.Products I) (hl : ↑l ≠ []) (hlh : (↑l).head! = Profinite.NobelingProof.term I ho) : (Profinite.NobelingProof.Linear_CC' C hsC ho) (Profinite.NobelingProof.Products.eval C l) = Profinite.NobelingProof.Products.eval (Profinite.NobelingProof.C' C ho) l.Tail - Profinite.NobelingProof.GoodProducts.max_eq_eval_unapply 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) : (⇑(Profinite.NobelingProof.Linear_CC' C hsC ho) ∘ fun l => Profinite.NobelingProof.Products.eval C ↑l) = fun l => Profinite.NobelingProof.Products.eval (Profinite.NobelingProof.C' C ho) (↑l).Tail - Profinite.NobelingProof.succ_exact 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hC : IsClosed C) (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) : { X₁ := ↧(LocallyConstant ↑(Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o) ℤ), X₂ := ↧(LocallyConstant ↑C ℤ), X₃ := ↧(LocallyConstant ↑(Profinite.NobelingProof.C' C ho) ℤ), f := ModuleCat.ofHom (Profinite.NobelingProof.πs C o), g := ModuleCat.ofHom (Profinite.NobelingProof.Linear_CC' C hsC ho), zero := ⋯ }.Exact - Profinite.NobelingProof.CC_comp_zero 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) (y : LocallyConstant ↑(Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o) ℤ) : (Profinite.NobelingProof.Linear_CC' C hsC ho) ((Profinite.NobelingProof.πs C o) y) = 0 - Profinite.NobelingProof.CC_exact 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hC : IsClosed C) (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) {f : LocallyConstant ↑C ℤ} (hf : (Profinite.NobelingProof.Linear_CC' C hsC ho) f = 0) : ∃ y, (Profinite.NobelingProof.πs C o) y = f - Profinite.NobelingProof.GoodProducts.MaxToGood 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hC : IsClosed C) (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) (h₁ : ⊤ ≤ Submodule.span ℤ (Set.range (Profinite.NobelingProof.GoodProducts.eval (Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o)))) : ↑(Profinite.NobelingProof.GoodProducts.MaxProducts C ho) → ↑(Profinite.NobelingProof.GoodProducts (Profinite.NobelingProof.C' C ho)) - Profinite.NobelingProof.GoodProducts.maxToGood_injective 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hC : IsClosed C) (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) (h₁ : ⊤ ≤ Submodule.span ℤ (Set.range (Profinite.NobelingProof.GoodProducts.eval (Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o)))) : Function.Injective (Profinite.NobelingProof.GoodProducts.MaxToGood C hC hsC ho h₁) - Profinite.NobelingProof.GoodProducts.maxTail_isGood 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hC : IsClosed C) (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) (l : ↑(Profinite.NobelingProof.GoodProducts.MaxProducts C ho)) (h₁ : ⊤ ≤ Submodule.span ℤ (Set.range (Profinite.NobelingProof.GoodProducts.eval (Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o)))) : Profinite.NobelingProof.Products.isGood (Profinite.NobelingProof.C' C ho) (↑l).Tail - Profinite.NobelingProof.GoodProducts.linearIndependent_comp_of_eval 📋 Mathlib.Topology.Category.Profinite.Nobeling.Successor
{I : Type u} (C : Set (I → Bool)) [LinearOrder I] [WellFoundedLT I] {o : Ordinal.{u}} (hC : IsClosed C) (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2) (h₁ : ⊤ ≤ Submodule.span ℤ (Set.range (Profinite.NobelingProof.GoodProducts.eval (Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o)))) : LinearIndependent ℤ (Profinite.NobelingProof.GoodProducts.eval (Profinite.NobelingProof.C' C ho)) → LinearIndependent (ι := ↑(Profinite.NobelingProof.GoodProducts.MaxProducts C ho)) ℤ (⇑(CategoryTheory.ConcreteCategory.hom (ModuleCat.ofHom (Profinite.NobelingProof.Linear_CC' C hsC ho))) ∘ Profinite.NobelingProof.GoodProducts.SumEval C ho ∘ Sum.inr)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 499b0ec