better notation for oalgebra

[helm.git] / helm / software / matita / library / nat / permutation.ma

diff --git a/helm/software/matita/library/nat/permutation.ma b/helm/software/matita/library/nat/permutation.ma
index 209c0c12e2744783f644ac5c023b8e5c7bf0f62e..bfa5112bc4f2d6482ef1f83a912df96359fd0b88 100644 (file)
--- a/helm/software/matita/library/nat/permutation.ma
+++ b/helm/software/matita/library/nat/permutation.ma
@@ -12,8 +12,6 @@
 (*                                                                        *)
 (**************************************************************************)
 
-set "baseuri" "cic:/matita/nat/permutation".
-
 include "nat/compare.ma".
 include "nat/sigma_and_pi.ma".
 
@@ -74,16 +72,16 @@ match eqb n i with
       [ true \Rightarrow i
       | false \Rightarrow n]].
 
-notation < "(❲i↹j❳)n"
-  right associative with precedence 71 
+notation < "(❲i↹j❳) term 72 n" with precedence 71 
+for @{ 'transposition $i $j $n}.
+
+notation < "(❲i \atop j❳) term 72 n" with precedence 71 
 for @{ 'transposition $i $j $n}.
 
-notation < "(❲i \atop j❳)n"
-  right associative with precedence 71 
+notation > "(❲\frac term 90 i term 90 j❳)n" with precedence 71 
 for @{ 'transposition $i $j $n}.
 
-interpretation "natural transposition" 'transposition i j n =
-  (cic:/matita/nat/permutation/transpose.con i j n).
+interpretation "natural transposition" 'transposition i j n = (transpose i j n).
 
 lemma transpose_i_j_i: \forall i,j:nat. transpose i j i = j.
 intros.unfold transpose.
@@ -620,7 +618,7 @@ apply le_S.apply le_n.assumption.
 apply (trans_eq ? ? (map_iter_i (S k) (\lambda m. g 
 (transpose i (S(m1 + i)) (transpose (S(m1 + i)) (S(S(m1 + i))) m))) f n)).
 apply (H2 O ? ? (S(m1+i))).
-unfold lt.apply le_S_S.apply le_O_n.
+unfold lt.apply le_S_S.apply le_O_n.id.
 apply (trans_le ? i).assumption.
 change with (i \le (S m1)+i).apply le_plus_n.
 exact H4.
@@ -752,4 +750,4 @@ intros 4.elim k
       ]
     ]
   ]
-qed.
\ No newline at end of file
+qed.