Theorems · Theorem · order theory

Pi.Lex.le_sInf_apply

∀ {ι : Type u_1} {α : ι → Type u_2} [inst : LinearOrder ι] [inst_1 : (i : ι) → CompleteLinearOrder (α i)]
  [inst_2 : WellFoundedLT ι] {s : Set (Lex ((i : ι) → (fun i => α i) i))} {i : ι}
  {e : Lex ((i : ι) → (fun i => α i) i)}, (∀ f ∈ s, (∀ j < i, f j = sInf s j) → e i ≤ f i) → e i ≤ sInf s i

Defined in

Mathlib.Order.CompleteLattice.PiLex

Cited by

2 results in Mathlib

Foundations

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

Assumes

LinearOrderCompleteLinearOrderWellFoundedLT