diff options
| author |  Guillaume Melquiond <guillaume.melquiond@inria.fr> | 2015-12-07 10:52:14 +0100 |
|---|---|---|
| committer | Guillaume Melquiond <guillaume.melquiond@inria.fr> | 2015-12-07 10:52:24 +0100 |
| commit | df3a49a18c5b01984000df9244ecea9c275b30cd (patch) | |
| tree | d14afdb5de5f93e4301f8eba8bddecd5a6597f9a /theories/Program | |
| parent | fe2776f9e0d355cccb0841495a9843351d340066 (diff) | |
Fix some typos.
Diffstat (limited to 'theories/Program')
| -rw-r--r-- | theories/Program/Subset.v | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/theories/Program/Subset.v b/theories/Program/Subset.v index 50b89b5c0..ce1f7768d 100644 --- a/theories/Program/Subset.v +++ b/theories/Program/Subset.v @@ -82,7 +82,7 @@ Qed. Definition match_eq (A B : Type) (x : A) (fn : {y : A | y = x} -> B) : B := fn (exist _ x eq_refl). -(* This is what we want to be able to do: replace the originaly matched object by a new, +(* This is what we want to be able to do: replace the originally matched object by a new, propositionally equal one. If [fn] works on [x] it should work on any [y | y = x]. *) Lemma match_eq_rewrite : forall (A B : Type) (x : A) (fn : {y : A | y = x} -> B) |