notation: define \commitmergeof in terms of \stmtmergeof

diff --git a/lemmas.tex b/lemmas.tex
index 55cba6010f3d097fb88e4e8769583a1447114721..23e22f3285bbc2ec8544714a1ed4d8a04479121d 100644 (file)
--- a/lemmas.tex
+++ b/lemmas.tex
@@ -11,7 +11,7 @@ $$
     \text{as above with L and R exchanged}
   \end{cases}
 $$
-\proof{ ~ Truth table (ordered by original definition): \\
+\proof{ ~ Truth table (ordered by original definitions): \\
   \begin{tabular}{cccc|c|cc}
      $D = C$ &
           $\isin L$ &

diff --git a/notation.tex b/notation.tex
index b5e0e9d5549c85d32514ae3e2756e56c33f7b0b2..f8f2b87973b9ad3740b7c4f4a595ac10e293c830 100644 (file)
--- a/notation.tex
+++ b/notation.tex
@@ -89,7 +89,6 @@ git's merge algorithm will DTRT when trying to re-apply the changes.
 \item[ $\displaystyle \stmtmergeof{L}{M}{R} $ ]
 The proper results of a merge.  Formally,
 where $L$, $M$ and $R$ are statements:
-
 $$
   \stmtmergeof{L}{M}{R}
     \equiv
@@ -117,9 +116,8 @@ The contents of a git merge result:
 
 $\displaystyle D \isin C \equiv
   \begin{cases}
-    (D \isin L \land D \isin R) \lor D = C : & \true \\
-    (D \not\isin L \land D \not\isin R) \land D \neq C : & \false \\
-    \text{otherwise} : & D \not\isin M
+    D = C : & \true \\
+    D \neq C : & \stmtmergeof{ D \isin L }{ D \isin M }{ D \isin R }
   \end{cases}
 $