From ea83ab467124ccdbe2d98434f409a1061b689267 Mon Sep 17 00:00:00 2001 From: letouzey Date: Sat, 10 Jul 2010 14:31:47 +0000 Subject: Bool: iff lemmas about or, a reflect inductive, an is_true function For the moment, almost no lemmas about (reflect P b), just the proofs that it is equivalent with an P<->b=true. is_true b is (b=true), and is meant to be added as a coercion if one wants it. In the StdLib, this coercion is not globally activated, but particular files are free to use Local Coercion... git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@13275 85f007b7-540e-0410-9357-904b9bb8a0f7 --- theories/Structures/Orders.v | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'theories/Structures') diff --git a/theories/Structures/Orders.v b/theories/Structures/Orders.v index d7bdfbf71..f83e77ed8 100644 --- a/theories/Structures/Orders.v +++ b/theories/Structures/Orders.v @@ -162,9 +162,9 @@ Module OTF_to_TotalOrder (O:OrderedTypeFull) <: TotalOrder *) (** For stating properties like transitivity of [leb], - we coerce [bool] into [Prop]. - NB: To migrate in Init/Datatype later *) -Local Coercion is_true b := b = true. (*: bool >-> Sortclass.*) + we coerce [bool] into [Prop]. *) + +Local Coercion is_true : bool >-> Sortclass. Hint Unfold is_true. Module Type HasLeBool (Import T:Typ). -- cgit v1.2.3