Theorems · Theorem · category theory

Profinite.NobelingProof.CC_exact

∀ {I : Type u} (C : Set (I → Bool)) [inst : LinearOrder I] [inst_1 : WellFoundedLT I] {o : Ordinal.{u}},
  IsClosed C →
    ∀ (hsC : Profinite.NobelingProof.contained C (Order.succ o)) (ho : o < Ordinal.type fun x1 x2 => x1 < x2)
      {f : LocallyConstant ↑C ℤ},
      (Profinite.NobelingProof.Linear_CC' C hsC ho) f = 0 → ∃ y, (Profinite.NobelingProof.πs C o) y = f

Defined in

Mathlib.Topology.Category.Profinite.Nobeling.Successor

Cited by

1 results in Mathlib

Foundations

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

Assumes

LinearOrderWellFoundedLT