Let $D$ be a set, $\mathbb{N\_0}$ the set of natural numbers including zero. Let $P$ be the set of all functions from $D$ to $\mathbb{N\_0}$, i.e. $P = \lbrace m \mid m: D \rightarrow \mathbb{N\_0} \rbrace$. 


Let $f, g \in P$. Then we define that $f \leq g$ holds iff $\forall d\in D f(d) \leq g(d)$. So $\leq$ is a partial order on $P$.


Now, $(P,\leq)$ is a lattice but it is not a complete lattice because some subsets of $P$ don't have a supremum in $P$.


So let us allow the functions to map to an infinity, $\infty$, too, i.e. $\forall n\in \mathbb{N\_0} n < \infty$. Let $P' = \lbrace m \mid m: D \rightarrow \mathbb{N\_0} \cup \infty \rbrace$.


Is $(P',\leq)$ a complete lattice? Resp., I am quite sure it is and I would like to know if there is some reference I could cite or if it is so trivial that I can simply state it. 



A complete lattice of functions
Once one adds infinity, it is easy to check that $(P', \leq)$ is indeed a complete lattice. For any subset $A$ of $P'$, it is easy to see that $\vee A$ is just the pointwise supremum of members of $A$. In the case that $A$ is empty, we have that $\vee A$ is the zero function. So, $(P', \leq)$ is a complete join semi-lattice, and hence a complete lattice. 


