blob: 8188f038abec1d221d4381430b971a9632d78a8b (
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
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
(*i $Id: Sumbool.v,v 1.12.2.1 2004/07/16 19:31:03 herbelin Exp $ i*)
(** Here are collected some results about the type sumbool (see INIT/Specif.v)
[sumbool A B], which is written [{A}+{B}], is the informative
disjunction "A or B", where A and B are logical propositions.
Its extraction is isomorphic to the type of booleans. *)
(** A boolean is either [true] or [false], and this is decidable *)
Definition sumbool_of_bool : forall b:bool, {b = true} + {b = false}.
Proof.
destruct b; auto.
Defined.
Hint Resolve sumbool_of_bool: bool.
Definition bool_eq_rec :
forall (b:bool) (P:bool -> Set),
(b = true -> P true) -> (b = false -> P false) -> P b.
destruct b; auto.
Defined.
Definition bool_eq_ind :
forall (b:bool) (P:bool -> Prop),
(b = true -> P true) -> (b = false -> P false) -> P b.
destruct b; auto.
Defined.
(*i pourquoi ce machin-la est dans BOOL et pas dans LOGIC ? Papageno i*)
(** Logic connectives on type [sumbool] *)
Section connectives.
Variables A B C D : Prop.
Hypothesis H1 : {A} + {B}.
Hypothesis H2 : {C} + {D}.
Definition sumbool_and : {A /\ C} + {B \/ D}.
Proof.
case H1; case H2; auto.
Defined.
Definition sumbool_or : {A \/ C} + {B /\ D}.
Proof.
case H1; case H2; auto.
Defined.
Definition sumbool_not : {B} + {A}.
Proof.
case H1; auto.
Defined.
End connectives.
Hint Resolve sumbool_and sumbool_or sumbool_not: core.
(** Any decidability function in type [sumbool] can be turned into a function
returning a boolean with the corresponding specification: *)
Definition bool_of_sumbool :
forall A B:Prop, {A} + {B} -> {b : bool | if b then A else B}.
Proof.
intros A B H.
elim H; [ intro; exists true; assumption | intro; exists false; assumption ].
Defined.
Implicit Arguments bool_of_sumbool.
|
