Theorems · Theorem · category theory

Profinite.NobelingProof.GoodProducts.square_commutes

∀ {I : Type u} (C : Set (I → Bool)) [inst : LinearOrder I] [inst_1 : WellFoundedLT I] {o : Ordinal.{u}}
  (ho : o < Ordinal.type fun x1 x2 => x1 < x2),
  Profinite.NobelingProof.GoodProducts.SumEval C ho ∘ Sum.inl =
    ⇑(CategoryTheory.ConcreteCategory.hom (ModuleCat.ofHom (Profinite.NobelingProof.πs C o))) ∘
      Profinite.NobelingProof.GoodProducts.eval
        (Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o)

Defined in

Mathlib.Topology.Category.Profinite.Nobeling.Successor

Cited by

1 results in Mathlib

Foundations

Depth 162 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

LinearOrderWellFoundedLT