\newcommand{\areparents}{<_{\mkern-14.0mu _1\mkern+5.0mu}}
\renewcommand{\implies}{\Rightarrow}
+\renewcommand{\equiv}{\Leftrightarrow}
+\renewcommand{\land}{\wedge}
+\renewcommand{\lor}{\vee}
\newcommand{\pancs}[2]{{\mathcal A} ( #1 , #2 ) }
\newcommand{\pends}[2]{{\mathcal E} ( #1 , #2 ) }
\newcommand{\patchof}[1]{{\mathcal P} ( #1 ) }
+\newcommand{\baseof}[1]{{\mathcal B} ( #1 ) }
-\renewcommand{\land}{\wedge}
+\newcommand{\eqn}[2]{ #2 \tag*{\mbox{#1}} }
+
+%\newcommand{\bigforall}{\mathop{\hbox{\huge$\forall$}}}
+\newcommand{\bigforall}{%
+ \mathop{\mathchoice%
+ {\hbox{\huge$\forall$}}%
+ {\hbox{\Large$\forall$}}%
+ {\hbox{\normalsize$\forall$}}%
+ {\hbox{\scriptsize$\forall$}}}%
+}
\begin{document}
A \neq E \land E \le A \} $
i.e. all $\le$-maximal commits in $\pancs{C}{\set P}$.
+\item[ $ \baseof{C} $ ]
+$ \pends{C}{\pn} = \{ \baseof{C} \} $ where $ C \in \py $.
+A partial function from commits to commits.
+See ``unique base'', below.
+
+\item[ $ C \haspatch \p $ ]
+$ \bigforall_{D \in \py} D \isin C \equiv D \le C $.
+Informally, $C$ has the contents of $\p$.
+
+\item[ $\displaystyle C \nothaspatch \p $ ]
+$\displaystyle \bigforall_{D \in \py} D \not\isin C $.
+~ Informally, $C$ has none of the contents of $\p$.
+
\end{basedescript}
\section{Invariants}
-\[ C \has D \implies C \ge D \tag*{\mbox{No replay:}} \]
-
-\[ \mathop{\forall}_{C \in \py} \pends{C}{\pn} = \{ B \} \tag*{\mbox{Unique base:}} \]
+\[ \eqn{No replay:}{
+ C \has D \implies C \ge D
+}\]
+\[\eqn{Unique base:}{
+ \bigforall_{C \in \py} \pends{C}{\pn} = \{ B \}
+}\]
+\[\eqn{Tip contents:}{
+ \bigforall_{C \in \py} D \isin C \equiv
+ { D \isin \baseof{C} \lor \atop
+ (D \in \py \land D \le C) }
+}\]
+\[\eqn{Base non-circ:}{
+ \bigforall_{B \in \pn} D \isin B \implies D \notin \py
+}\]
\section{Test more symbols}