X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=hints%2Fassignment_7_hint_5.mdwn;h=40df3b81971f5b8c31139c6fcfd7bc942fbdce24;hp=2e7808a1ae62a8642095c71e397a0112e8820d60;hb=ddcb99cc42fe32a7a16ba2fe78b9228c354807d0;hpb=c6f572fd09dbe53dff30a91cd07b318b3e5edfd6

diff --git a/hints/assignment_7_hint_5.mdwn b/hints/assignment_7_hint_5.mdwn
index 2e7808a1..40df3b81 100644
--- a/hints/assignment_7_hint_5.mdwn
+++ b/hints/assignment_7_hint_5.mdwn
@@ -1,4 +1,3 @@
-
 *	How shall we handle \[[∃x]]? As we said, GS&V really tell us how to interpret \[[∃xPx]], but for our purposes, what they say about this can be broken naturally into two pieces, such that we represent the update of our starting set `u` with \[[∃xPx]] as:
 
 	<pre><code>u >>= \[[&exist;x]] >>= \[[Px]]
@@ -108,7 +107,7 @@
 			
 	That would be the meaning of \[[&exist;]], which we'd use like this:
 
-	<pre><code>\[[&exist;]] \[[Q]]
+	<pre><code>\[[&exist;]] ( \[[Q]] )
 	</code></pre>
 
 	or this: