use named types to force some constraints asap

[helm.git] / helm / software / matita / library / logic / coimplication.ma

diff --git a/helm/software/matita/library/logic/coimplication.ma b/helm/software/matita/library/logic/coimplication.ma
index 24965d72ce063f6209259812b1b189b661a5f331..67f04b90308b28e8632c9ddf266d7e86e99ff246 100644 (file)
--- a/helm/software/matita/library/logic/coimplication.ma
+++ b/helm/software/matita/library/logic/coimplication.ma
@@ -12,30 +12,19 @@
 (*                                                                        *)
 (**************************************************************************)
 
-set "baseuri" "cic:/matita/logic/coimplication".
-
 include "logic/connectives.ma".
 
 definition Iff : Prop \to Prop \to Prop \def
    \lambda A,B. (A \to B) \land (B \to A).
    
- (*CSC: the URI must disappear: there is a bug now *)
-interpretation "logical iff" 'iff x y = (cic:/matita/logic/coimplication/Iff.con x y).
-
-notation > "hvbox(a break \liff b)" 
-  left associative with precedence 25
-for @{ 'iff $a $b }.
-
-notation < "hvbox(a break \leftrightarrow b)" 
-  left associative with precedence 25
-for @{ 'iff $a $b }.
+interpretation "logical iff" 'iff x y = (Iff x y).
 
 theorem iff_intro: \forall A,B. (A \to B) \to (B \to A) \to (A \liff B).
- unfold Iff. intros. split; intros; auto.
+ unfold Iff. intros. split; intros; autobatch.
 qed.
 
 theorem iff_refl: \forall A. A \liff A.
- intros. apply iff_intro; intros; auto.
+ intros. apply iff_intro; intros; autobatch.
 qed.
 
 theorem iff_sym: \forall A,B. A \liff B \to B \liff A.
@@ -43,5 +32,5 @@ theorem iff_sym: \forall A,B. A \liff B \to B \liff A.
 qed.
 
 theorem iff_trans: \forall A,B,C. A \liff B \to B \liff C \to A \liff C.
- intros. elim H. elim H1. apply iff_intro;intros;auto.
+ intros. elim H. elim H1. apply iff_intro;intros;autobatch.
 qed.