Theorems · Theorem · category theory

Profinite.NobelingProof.swapTrue_eq_true

∀ {I : Type u} [inst : LinearOrder I] [inst_1 : WellFoundedLT I] {o : Ordinal.{u}}
  (ho : o < Ordinal.type fun x1 x2 => x1 < x2) (x : I → Bool),
  Profinite.NobelingProof.SwapTrue o x (Profinite.NobelingProof.term I ho) = true

Defined in

Mathlib.Topology.Category.Profinite.Nobeling.Successor

Cited by

1 results in Mathlib

Foundations

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

Assumes

LinearOrderWellFoundedLT