(**************************************************************************)
-(* ___ *)
+(* ___ *)
(* ||M|| *)
(* ||A|| A project by Andrea Asperti *)
(* ||T|| *)
interpretation "congruent" 'congruent n m p = (congruent n m p).
-notation < "hvbox(n break \cong\sub p m)"
- (*non associative*) with precedence 45
-for @{ 'congruent $n $m $p }.
-
theorem congruent_n_n: \forall n,p:nat.congruent n n p.
intros.unfold congruent.reflexivity.
qed.