A first-order formula holds in an ultraproduct exactly when it holds on an ultrafilter-large set of coordinates. The point is to make the formal expression readable enough to audit line by line.
Set-up
A first-order language \(\mathcal L\) supplies symbols, formulas, and structures. Semantic consequence \(T\models\varphi\) is truth in every model, while provability \(T\vdash\varphi\) is a finite formal derivation.
I read the first line as input and the second as output. The symbols \(\forall\) and \(\exists\) are not interchangeable, and neither may be upgraded silently to \(\Longleftrightarrow\).
The calculation
The following line is the smallest calculation that still exercises the mechanism. It keeps nested delimiters and the order of operations explicit.
What survives abstraction
A good test for understanding is to change the presentation while keeping the invariant fixed. The aligned form makes that comparison unusually easy.
The boundary
First-order compactness does not apply to arbitrary second-order properties. Finiteness and categorical characterization of the natural numbers lie beyond its direct reach.
This is enough machinery for one note: an exact object, a worked case, a structural law, and a clearly marked boundary. Each layer can now be tested independently.