blob: 08fa8fbc22d39ee7bc697221855c2cb353b90703 (
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
|
Set Implicit Arguments.
Notation "'fun' { x : A | P } => Q" :=
(fun x:{x:A|P} => Q)
(at level 200, x ident, right associativity).
Notation " {{ x }} " := (tt : { y : unit | x }).
Notation "( x & ? )" := (@exist _ _ x _) : core_scope.
Notation " ! " := (False_rect _ _).
Definition ex_pi1 (A : Prop) (P : A -> Prop) (t : ex P) : A.
intros.
induction t.
exact x.
Defined.
Lemma ex_pi2 : forall (A : Prop) (P : A -> Prop) (t : ex P),
P (ex_pi1 t).
intros A P.
dependent inversion t.
simpl.
exact p.
Defined.
Notation "` t" := (proj1_sig t) (at level 100) : core_scope.
Notation "'forall' { x : A | P } , Q" :=
(forall x:{x:A|P}, Q)
(at level 200, x ident, right associativity).
Lemma subset_simpl : forall (A : Set) (P : A -> Prop)
(t : sig P), P (` t).
Proof.
intros.
induction t.
simpl ; auto.
Qed.
Ltac destruct_one_pair :=
match goal with
| [H : (ex _) |- _] => destruct H
| [H : (ex2 _) |- _] => destruct H
| [H : (sig _) |- _] => destruct H
| [H : (_ /\ _) |- _] => destruct H
end.
Ltac destruct_exists := repeat (destruct_one_pair) .
Ltac subtac_simpl := simpl ; intros ; destruct_exists ; simpl in * ; try subst ;
try (solve [ red ; intros ; discriminate ]) ; auto with arith.
(* Destructs calls to f in hypothesis or conclusion, useful if f creates a subset object *)
Ltac destruct_call f :=
match goal with
| H : ?T |- _ =>
match T with
context [f ?x ?y ?z] => destruct (f x y z)
| context [f ?x ?y] => destruct (f x y)
| context [f ?x] => destruct (f x)
end
| |- ?T =>
match T with
context [f ?x ?y ?z] => let n := fresh "H" in set (n:=f x y z); destruct n
| context [f ?x ?y] => let n := fresh "H" in set (n:=f x y); destruct n
| context [f ?x] => let n := fresh "H" in set (n:=f x); destruct n
end
end.
Ltac myinjection :=
let tac H := inversion H ; subst ; clear H in
match goal with
| [ H : ?f ?a = ?f' ?a' |- _ ] => tac H
| [ H : ?f ?a ?b = ?f' ?a' ?b' |- _ ] => tac H
| [ H : ?f ?a ?b ?c = ?f' ?a' ?b' ?c' |- _ ] => tac H
| [ H : ?f ?a ?b ?c ?d= ?f' ?a' ?b' ?c' ?d' |- _ ] => tac H
| [ H : ?f ?a ?b ?c ?d ?e= ?f' ?a' ?b' ?c' ?d' ?e' |- _ ] => tac H
| [ H : ?f ?a ?b ?c ?d ?e ?g= ?f' ?a' ?b' ?c' ?d' ?e' ?g' |- _ ] => tac H
| [ H : ?f ?a ?b ?c ?d ?e ?g ?h= ?f' ?a' ?b' ?c' ?d' ?e'?g' ?h' |- _ ] => tac H
| [ H : ?f ?a ?b ?c ?d ?e ?g ?h ?i = ?f' ?a' ?b' ?c' ?d' ?e'?g' ?h' ?i' |- _ ] => tac H
| [ H : ?f ?a ?b ?c ?d ?e ?g ?h ?i ?j = ?f' ?a' ?b' ?c' ?d' ?e'?g' ?h' ?i' ?j' |- _ ] => tac H
| _ => idtac
end.
Extraction Inline proj1_sig.
Extract Inductive unit => "unit" [ "()" ].
Extract Inductive bool => "bool" [ "true" "false" ].
Extract Inductive sumbool => "bool" [ "true" "false" ].
Axiom pair : Type -> Type -> Type.
Extract Constant pair "'a" "'b" => " 'a * 'b ".
Extract Inductive prod => "pair" [ "" ].
Extract Inductive sigT => "pair" [ "" ].
Require Export ProofIrrelevance.
|
