diff options
author | Jason Gross <jgross@mit.edu> | 2017-01-30 19:16:00 -0500 |
---|---|---|
committer | Jason Gross <jgross@mit.edu> | 2017-01-30 19:16:00 -0500 |
commit | 922e467dc432d630f83dfcd20c33f1eeb184d87b (patch) | |
tree | e12c6b57a27257f91bb9dff3672c5176d1411f6b /src/Util/Sumbool.v | |
parent | 7f9164f563f5306bcbf487b61e252a258feb0476 (diff) |
Add Util.Sumbool
Diffstat (limited to 'src/Util/Sumbool.v')
-rw-r--r-- | src/Util/Sumbool.v | 65 |
1 files changed, 65 insertions, 0 deletions
diff --git a/src/Util/Sumbool.v b/src/Util/Sumbool.v new file mode 100644 index 000000000..a21777605 --- /dev/null +++ b/src/Util/Sumbool.v @@ -0,0 +1,65 @@ +(** * Classification of the [{_} + {_}] Type *) +(** In this file, we classify the basic structure of [sumbool] types. *) +Require Import Crypto.Util.GlobalSettings. + +(*Local Set Keep Proof Equalities. +Scheme Equality for sumbool.*) + +(** ** Equality for [sumbool] *) +Section sumbool. + Local Notation sumbool_code u v + := (match u, v with + | left u', left v' + | right u', right v' + => u' = v' + | left _, _ + | right _, _ + => False + end). + + (** *** Equality of [sumbool] is a [match] *) + Definition path_sumbool {A B} (u v : sumbool A B) (p : sumbool_code u v) + : u = v. + Proof. destruct u, v; first [ apply f_equal | exfalso ]; exact p. Defined. + + (** *** Equivalence of equality of [sumbool] with [sumbool_code] *) + Definition unpath_sumbool {A B} {u v : sumbool A B} (p : u = v) + : sumbool_code u v. + Proof. subst v; destruct u; reflexivity. Defined. + + Definition path_sumbool_iff {A B} + (u v : @sumbool A B) + : u = v <-> sumbool_code u v. + Proof. + split; [ apply unpath_sumbool | apply path_sumbool ]. + Defined. + + (** *** Eta-expansion of [@eq (sumbool _ _)] *) + Definition path_sumbool_eta {A B} {u v : @sumbool A B} (p : u = v) + : p = path_sumbool u v (unpath_sumbool p). + Proof. destruct u, p; reflexivity. Defined. + + (** *** Induction principle for [@eq (sumbool _ _)] *) + Definition path_sumbool_rect {A B} {u v : @sumbool A B} (P : u = v -> Type) + (f : forall p, P (path_sumbool u v p)) + : forall p, P p. + Proof. intro p; specialize (f (unpath_sumbool p)); destruct u, p; exact f. Defined. + Definition path_sumbool_rec {A B u v} (P : u = v :> @sumbool A B -> Set) := path_sumbool_rect P. + Definition path_sumbool_ind {A B u v} (P : u = v :> @sumbool A B -> Prop) := path_sumbool_rec P. +End sumbool. + +(** ** Useful Tactics *) +(** *** [inversion_sumbool] *) +Ltac induction_path_sumbool H := + induction H as [H] using path_sumbool_rect; + try match type of H with + | False => exfalso; exact H + end. +Ltac inversion_sumbool_step := + match goal with + | [ H : _ = sumbool _ _ |- _ ] + => induction_path_sumbool H + | [ H : sumbool _ _ = _ |- _ ] + => induction_path_sumbool H + end. +Ltac inversion_sumbool := repeat inversion_sumbool_step. |