The Coq mailing list

[Claudio Sacerdoti Coen <sacerdot AT cs.unibo.it>]

 Hi Nicolas,

> My attempt was to make a pattern (n1,n2) appear in the ((P n1)/\(Q n2)).
> It yields something like  ((P (fst (pair n1 n2)))/\(Q (snd (pair n1 n2)))))
> by convertibility.  At this stage, I would like to be able to do some sort
> of reduction (of the let construct) to get "mk_pair v" instead of "(pair n1 
> n2)"
> in the goal.

 The non-refutable let pattern is just sintactic sugar for case analysis.
 Thus you need to destruct your pair (mk_pair v). (e.g. by
 "destruct (mk_pair v)").

                                Cheers,
                                C.S.C.

-- 
----------------------------------------------------------------
Real name: Claudio Sacerdoti Coen
Doctor in Computer Science, University of Bologna
E-mail: 
sacerdot AT cs.unibo.it
http://www.cs.unibo.it/~sacerdot
----------------------------------------------------------------