If I have some set $A$ = {$ f(x) | x \in \mathbb{F}$}
Where $f: \mathbb{F} \Rightarrow \mathbb{L}$
Then $A \subset \mathbb{L}$
Now if Inf ($\mathbb{L})=\alpha$
And $\alpha \in A$
Then Inf($A$) = $\alpha$
Is this always true?
Can it be used to prove a value of Inf($A$) if there is a defined value of Inf($\mathbb{L}$) or do we have to assume it is just a lower bound of $A$ and continue to prove that it is Inf($A$) through the standard conditions of an infimum.
Yes it's always true.
It follows from that a lower bound that is member of the set is the infimum - it follows from the definition: if a lower bound $\alpha$ of $A$ it's obviously a lower bound the question is if it's the largest - assume it wasn't, that there is a $\beta>\alpha$ that is a lower bound, but we have $\alpha\in A$ and $\alpha<\beta$ so $\beta$ is not a lower bound of $A$.
You also use that a lower bound of a superset is a lower bound to the set itself. That is if $\alpha$ is a lower bound (infimum is a lower bound) of $\mathbb L$ we have that $\alpha\le x$ for all $x\in\mathbb L$. Now if $A\subseteq\mathbb L$ we have that any $x\in A$ we have that $x\in\mathbb L$ and therefore $\alpha\le x$ - that is $\alpha$ is a lower bound of $A$.
Note that this technique can only be used to find the infimum of $A$ if it actually contains the infimum of $\mathbb L$.