fact: Definition map : forall (A A' : Type) (AR : Param10.Rel A A') (n n' : nat) (nR : natR n n'), t A n -> t A' n' := fun A A' AR => fix F n n' nR := match nR with | OR => fun _ => nil | SR m m' mR => fun v => cons (map AR (hd v)) (F m m' mR (tail v)) end.
imports: Coq(ssreflect) HoTT(HoTT) HoTT_additions Hierarchy Param_nat