Proposition 1.4.3.
Assuming that:
L
is a
bounded
lattice
≤
is the order induced by the operations in
L
(
a
≤
b
if
a
∧
b
=
a
)
Then
≤
is a partial order with least element
⊥
, greatest element
⊤
, and for any
a
,
b
∈
L
, we have
a
∧
b
=
inf
{
a
,
b
}
and
a
∧
b
=
sup
{
a
,
b
}
. Conversely, every partial order with all finite infs and sups is a
bounded
lattice
.