blob: b61cf275fbbe767a5cf7ce819b712268fcdac6f3 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
(* Refine and let-in's *)
Goal exists x : nat, x = 0.
refine (let y := 0 + 0 in _).
exists y; auto.
Save test1.
Goal exists x : nat, x = 0.
refine (let y := 0 + 0 in ex_intro _ (y + y) _).
auto.
Save test2.
Goal nat.
refine (let y := 0 in 0 + _).
exact 1.
Save test3.
(* Example submitted by Yves on coqdev *)
Require Import List.
Goal forall l : list nat, l = l.
Proof.
refine
(fun l =>
match l return (l = l) with
| nil => _
| O :: l0 => _
| S _ :: l0 => _
end).
Abort.
(* Submitted by Roland Zumkeller (bug #888) *)
(* The Fix and CoFix rules expect a subgoal even for closed components of the
(co-)fixpoint *)
Goal nat -> nat.
refine (fix f (n : nat) : nat := S _
with pred (n : nat) : nat := n
for f).
exact 0.
Qed.
(* Submitted by Roland Zumkeller (bug #889) *)
(* The types of metas were in metamap and they were not updated when
passing through a binder *)
Goal forall n : nat, nat -> n = 0.
refine
(fun n => fix f (i : nat) : n = 0 := match i with
| O => _
| S _ => _
end).
Abort.
(* Submitted by Roland Zumkeller (bug #931) *)
(* Don't turn dependent evar into metas *)
Goal (forall n : nat, n = 0 -> Prop) -> Prop.
intro P.
refine (P _ _).
reflexivity.
Abort.
|