Observe that $3$ is an upper bound of $S = \{n \in\mathbb{N} \space \colon n^2 < 10\} = \{1,\space 2, \space 3\}$. Thus $\text{sup(S)} \leq 3$, but $3 \in S$, so $ 3\leq \text{sup(S)}$. Thus $\text{sup(S)} = 3$. Similarly you can show that $\text{inf(S)} = 1$.
I'm interpreting the question as asking to prove that given an ordered field $\mathbb F$, if $\mathbb F$ has the lub property, then $\mathbb F$ has the glb property. Or equivalentely that if all non-empty bounded above subsets of $\mathbb F$ have a supremum, then all non-empty and bounded below subsets of $\mathbb F$ have an infimum.
Ordered fields are irrelevant here, this can be generalized to any poset.
Let $P$ be a poset such that each of its non-empty and bounded above subsets has a supremum.
The goal is to prove that any non-empty and bounded below subset $A$ of $P$ has an infimum.
Being a universal statement, one way to prove it is to start by taking an arbitrary non-empty and bounded below subset $A$ of $P$.
Now consider the set $\downarrow A$, where $\downarrow A:=\{p\in P\colon \forall a\in A(p\leq a)\}$, that is, consider the set the lower bounds of $A$.
The set $\downarrow A$ isn't empty because $A$ is bounded below. It is also bounded above by any element of $A$.
Hence it's possible to use the hypothesis that any non-empty and bounded above subset of $P$ has a supremum particularized to $\downarrow A$.
Let $s:=\sup\left(\downarrow A\right)$.
Claim: $s=\inf(A)$.
Proof: It suffices to prove that $s$ is a lower bound of $A$ and that $\forall p\in \downarrow A(p\leq s)$. The latter part follows immediately from the fact that $s$ is an upper bound of $\downarrow A$. The first part follows from the fact that any element of $A$ is an upperbound of $\downarrow A$ and hence greater than the supremum of $\downarrow A$ which is $s$.
Since $A$ was an arbitrary bounded below and non-empty subset of $P$, it wasproved that $P$ has the glp property.
Best Answer
Let $(X,\leq)$ be a partially ordered set. That means that for all $x,y,z\in X$:
1) $x\leq x$ (reflexivity)
2) $x\leq y$ and $y\leq x$ imply $x=y$ (anti-symmetry)
3) $x\leq y$ and $y\leq z$ imply $x\leq z$ (transitivity)
An element $x\in X$ is a lower bound of a subset $S\subseteq X$ if $x\leq S$ for all $s\in S$. An element $x$ is the greatest element in a subset $T\subseteq X$ if $x\in T$ and $t\leq x$ for all $t\in T$. An infimum of a set $S$ is a greatest element in the set of lower bounds of $S$. We will show that there can be at most one greatest element in every set, so there can be at most one infimum for every set.
There can be at most one greatest element in a subset $T\subseteq X$.
Proof: Let $x,x'$ be both greatest elements in $T$. Then $x\in T$ and $x'\in T$ and since $x$ is a greatest element in $T$, we have $x'\leq x$. Similarly, $x\leq x'$. By anti-symmetry, $x=x'$.