(*CSC: the URI must disappear: there is a bug now *)
interpretation "logical not" 'not x = (cic:/matita/logic/connectives/Not.con x).
-(*CSC: this alias should disappear. It is now required because the notation for Coq is pre-loaded *)
-alias symbol "not" (instance 0) = "logical not".
theorem absurd : \forall A,C:Prop. A \to \lnot A \to C.
intros. elim (H1 H).
(*CSC: the URI must disappear: there is a bug now *)
interpretation "logical and" 'and x y = (cic:/matita/logic/connectives/And.ind#xpointer(1/1) x y).
-(*CSC: this alias should disappear. It is now required because the notation for Coq is pre-loaded *)
-alias symbol "and" (instance 0) = "logical and".
theorem proj1: \forall A,B:Prop. A \land B \to A.
intros. elim H. assumption.
(*CSC: the URI must disappear: there is a bug now *)
interpretation "logical or" 'or x y = (cic:/matita/logic/connectives/Or.ind#xpointer(1/1) x y).
-(*CSC: this alias should disappear. It is now required because the notation for Coq is pre-loaded *)
-alias symbol "or" (instance 0) = "logical or".
definition decidable : Prop \to Prop \def \lambda A:Prop. A \lor \not A.