Theorems · Theorem · logic and foundations

Directed.sequence_le

∀ {α : Type u_1} {β : Type u_2} [inst : Encodable α] [inst_1 : Inhabited α] [inst_2 : Preorder β] {f : α → β}
  (hf : Directed (fun x1 x2 => x1 ≥ x2) f) (a : α), f (Directed.sequence f hf (Encodable.encode a + 1)) ≤ f a

Defined in

Mathlib.Logic.Encodable.Basic

Cited by

1 results in Mathlib

Foundations

Depth 11 from the axioms · uses Classical.choice

Assumes

EncodableInhabitedPreorder