Clean up paratext

LICENSE

+Copyright 2020 Tej Chajed
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

README.md

 # Ltac2 implementation of `string_to_ident`
 
-Implements `string_to_ident` using Ltac2, providing support for Gallina names in Iris intro patterns on Coq 8.11 and later.
+Implements `string_to_ident` using Ltac2, providing support for Gallina names in
+Iris intro patterns on Coq 8.11 and later.
 
 ## Usage
 
@@ -8,12 +9,26 @@ Simply require this file before using the feature in the proof mode:
 
 ```coq
 From IrisStringIdent Require ltac2_string_ident.
-From Iris.proofmode Require Import ltac_tactics.
-
-(* TODO *)
+From iris.proofmode Require Import tactics intro_patterns.
+
+Lemma sep_demo {PROP: sbi} (P1: PROP)  (P2 P3: Prop) (Himpl: P2 -> P3) :
+  P1 ∗ ⌜P2⌝ -∗ P1 ∗ ⌜P3⌝.
+Proof.
+  iIntros "[HP %HP2]".
+  iFrame.
+  iPureIntro.
+  exact (Himpl HP2).
+Qed.
+
+Lemma exists_demo P1 (P2: nat -> PROP) :
+  P1 ∗ (∃ x, P2 x) -∗ ∃ x, P1 ∗ P2 x.
+Proof.
+  iIntros "[? [%x HP2]]".
+  iFrame.
+  iExists x; iExact "HP2".
+Qed.
 ```
 
 ## Acknowledgements
 
 This implementation strategy was suggested by Robbert Krebbers.
-