The pullback consists of pairs with the same image and is universal among all such compatible pairs. The example is deliberately concrete; it is a test of the statement, not a substitute for it.
Definitions first
Category theory records objects through their morphisms. A functor \(F:\mathcal C\to\mathcal D\) preserves identities and composition, while a natural transformation \(\eta:F\Rightarrow G\) compares functors uniformly.
There are two layers here: the object \(\mathsf D\) and the law \(\mathsf C\). Writing them separately makes the direction of \(\Longrightarrow\) visible and keeps an accidental converse from slipping in.
A small case in full
A worked instance is useful here because it exposes every index that the compressed statement hides.
The reusable statement
The abstraction earns its keep by explaining why the same computation reappears. The notation compresses repeated reasoning without erasing the hypothesis that licenses it.
A nearby false statement
An isomorphism of objects is stronger than a natural bijection of underlying sets unless that bijection respects all morphisms in the relevant category.
I would use the boxed line as a reference later, while returning to the full display whenever a hypothesis becomes uncertain. That division keeps compression from becoming ambiguity.