blob: 8013e1d38e89e5313ea3efca6092e620d2374fad (
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
67
68
69
70
71
72
73
74
75
76
|
(* Submitted by Robert Schneck *)
Parameters A B C D : Prop.
Axiom X : A -> B -> C /\ D.
Lemma foo : A -> B -> C.
Proof.
intros.
destruct X. (* Should find axiom X and should handle arguments of X *)
assumption.
assumption.
assumption.
Qed.
(* Simplification of bug 711 *)
Parameter f : true = false.
Goal let p := f in True.
intro p.
set (b := true) in *.
(* Check that it doesn't fail with an anomaly *)
(* Ultimately, adapt destruct to make it succeeding *)
try destruct b.
Abort.
(* Used to fail with error "n is used in conclusion" before revision 9447 *)
Goal forall n, n = S n.
induction S.
Abort.
(* Check that elimination with remaining evars do not raise an bad
error message *)
Theorem Refl : forall P, P <-> P. tauto. Qed.
Goal True.
case Refl || ecase Refl.
Abort.
(* Submitted by B. Baydemir (bug #1882) *)
Require Import List.
Definition alist R := list (nat * R)%type.
Section Properties.
Variable A : Type.
Variable a : A.
Variable E : alist A.
Lemma silly : E = E.
Proof.
clear. induction E. (* this fails. *)
Abort.
End Properties.
(* This used not to work before revision 11944 *)
Goal forall P:(forall n, 0=n -> Prop), forall H: 0=0, P 0 H.
destruct H.
Abort.
(* The calls to "destruct" below did not work before revision 12356 *)
Variable A0:Type.
Variable P:A0->Type.
Require Import JMeq.
Goal forall a b (p:P a) (q:P b),
forall H:a = b, eq_rect a P p b H = q -> JMeq (existT _ a p) (existT _ b q).
intros.
destruct H.
destruct H0.
reflexivity.
Qed.
|
