Edges crossing a primal cut form a cycle in the geometric dual and vice versa. The formulas are more useful when each symbol has a job rather than merely decorating the theorem.
Statement
A planar embedding divides the sphere into vertices, edges, and faces. Euler's relation \(|V|-|E|+|F|=2\) constrains density, while the dual \(G^\ast\) records adjacency of faces.
The definition determines which expressions are legal; only then does the identity become meaningful. An equality in \(\mathcal A\) may change ambient meaning, so I keep \(\mathsf D\) separate from \(\mathsf C\).
Worked algebra
Here is a concrete symbolic test. Reading it from left to right reveals which transformation is reversible and which is only an implication.
Conceptual compression
The two-row display is also a debugging tool: if the conclusion changes when only notation changes, some hidden choice has entered the argument.
Caveat
Planarity is a property of a graph, while a plane graph includes a chosen embedding. The dual depends on that embedding.
The notation is dense, but it is doing honest work: every delimiter records scope and every index records dependence. Removing one should require a mathematical reason.