From eb17292767bda59f9d9452da926ac57d5bc83ae4 Mon Sep 17 00:00:00 2001
From: Jason Gross
Date: Tue, 27 Jun 2017 12:55:34 -0400
Subject: Update CHANGES with inversion_sigma entry

---
 CHANGES | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/CHANGES b/CHANGES
index 8b3f9c9c34..4e95f9d4c8 100644
--- a/CHANGES
+++ b/CHANGES
@@ -6,6 +6,17 @@ Tactics
 - New tactic "extensionality in H" which applies (possibly dependent)
   functional extensionality in H supposed to be a quantified equality
   until giving a bare equality.
+- New tactic "inversion_sigma" which turns equalities of dependent
+  pairs (e.g., "existT P x p = existT P y q", frequently left over by
+  "inversion" on a dependent type family) into pairs of equalities
+  (e.g., a hypothesis "H : x = y" and a hypothesis of type "rew H in p
+  = q"); these hypotheses can subsequently be simplified using
+  "subst", without ever invoking any kind of axiom asserting
+  uniqueness of identity proofs. If you want to explicitly specify the
+  hypothesis to be inverted, or name the generated hypotheses, you can
+  invoke "induction H as [H1 H2] using eq_sigT_rect".  The tactic also
+  works for "sig", "sigT2", and "sig2", and there are similar
+  "eq_sig*_rect" induction lemmas.
 - Tactic "specialize with ..." now accepts any partial bindings.
   Missing bindings are either solved by unification or left quantified
   in the hypothesis.
-- 
cgit v1.2.3