formatting

Co-authored-by: Ted Thibodeau Jr <[email protected]>

Author: franconi

spec/index.html

@@ -1959,11 +1959,7 @@ <h2>Proofs of some results</h2>
 
   <p>Using the terminology in the previous proof: if H does not contain any skolem IRIs, then H=ks(H).
     So if sk(G) entails H then G entails ks(H)=H; and if G entails H then sk(G) entails G entails H, so sk(G) entails H. QED.</p>
-    
-    
-    
-    
-    
+
     <p class="fact"><b>Subgraph Lemma</b>.
 A graph S simply entails each of its its subgraphs E.</p>