Theorems · Theorem · category theory

Profinite.NobelingProof.Products.isGood_mono

∀ {I : Type u} (C : Set (I → Bool)) [inst : LinearOrder I] [inst_1 : WellFoundedLT I]
  {l : Profinite.NobelingProof.Products I} {o₁ o₂ : Ordinal.{u}},
  o₁ ≤ o₂ →
    Profinite.NobelingProof.Products.isGood (Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o₁)
        l →
      Profinite.NobelingProof.Products.isGood
        (Profinite.NobelingProof.π C fun x => Profinite.NobelingProof.ord I x < o₂) l

If l is good w.r.t. π C (ord I · < o₁) and o₁ ≤ o₂, then it is good w.r.t. π C (ord I · < o₂)

Defined in

Mathlib.Topology.Category.Profinite.Nobeling.Basic

Cited by

4 results in Mathlib

Foundations

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

Assumes

LinearOrderWellFoundedLT