Theorems · Theorem · order theory

Set.unbounded_le_inter_not_le

∀ {α : Type u_1} {s : Set α} [inst : SemilatticeSup α] (a : α),
  Set.Unbounded (fun x1 x2 => x1 ≤ x2) (s ∩ {b | ¬b ≤ a}) ↔ Set.Unbounded (fun x1 x2 => x1 ≤ x2) s

Defined in

Mathlib.Order.Bounded

Cited by

2 results in Mathlib

Foundations

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

Assumes

SemilatticeSup