Lemma 1.6.25. Let \(f\colon C \to D\) and \(g\colon D \to E\) be functors and assume that \(g\) is an embedding. Then the square
is a pullback square.
Proof
This is immediate from the pasting law of pullback squares applied to the following commutative diagram:
Indeed, the bottom square is a pullback square by assumption on \(g\), while the top square is clearly a pullback square.