Theorems · Theorem · order theory
Set.not_bounded_iff
∀ {α : Type u} {r : α → α → Prop} (s : Set α), ¬Set.Bounded r s ↔ Set.Unbounded r s- Defined in
- Mathlib.Order.RelClasses
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.Boundedstatement · cited by 57
- Set.Unboundedstatement · cited by 39
Cited by7
Results whose statement or proof uses this declaration.
- Set.unbounded_le_inter_not_leproof · cited by 2
- Set.unbounded_lt_inter_not_ltproof · cited by 2
- Set.unbounded_le_inter_leproof · cited by 1
- Set.not_unbounded_iffproof · cited by 1
- Set.unbounded_lt_inter_ltproof · cited by 1
- Ordinal.unbounded_range_of_le_iSupproof · cited by 0
- Cardinal.mk_subset_mk_lt_cofproof · cited by 0