Definition is_complete_lattice {X : hSet} (L : lattice X) : UU := ∏ (I : UU) (f : I → X), ∑ (x : X), is_least_upperbound_lattice L f x.
Require Import UniMath.Foundations.All. Require Import UniMath.MoreFoundations.All. Require Import UniMath.OrderTheory.Lattice.Lattice. Require Import UniMath.OrderTheory.Lattice.Bounded. Require Import UniMath.OrderTheory.Lattice.Heyting.