On permutations

Define the following relationships on (list A): Show that the second one is an equivalence relation.


Look at this file


You could also define the relationship perm as (Rstar _ transpose). In this case, you first have to load the module Rstar of the library Relations, and prove that the reflexive transitive closure of a symmetric relation is symmetric too.
Follow this link

Going home
Pierre Castéran