Theorems · Theorem · category theory

Profinite.NobelingProof.term_ord_aux

∀ {I : Type u} [inst : LinearOrder I] [inst_1 : WellFoundedLT I] {i : I}
  (ho : Profinite.NobelingProof.ord I i < Ordinal.type fun x1 x2 => x1 < x2), Profinite.NobelingProof.term I ho = i

Defined in

Mathlib.Topology.Category.Profinite.Nobeling.Basic

Cited by

1 results in Mathlib

Foundations

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

Assumes

LinearOrderWellFoundedLT