Mathlib Map

Theorems · Theorem · category theory

Profinite.NobelingProof.GoodProducts.good_lt_maxProducts

∀ {I : Type u} (C : Set (I → Bool)) [inst : LinearOrder I] [inst_1 : WellFoundedLT I] {o : Ordinal.{u}},
  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
Defined in
Mathlib.Topology.Category.Profinite.Nobeling.Successor
Cited by
1 results in Mathlib
Foundations
Depth 163 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
LinearOrderWellFoundedLT

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites24

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.