fact: Definition StrongOrder_bck {X Y : UU} (f : Y → X) (gt : StrongOrder X) : StrongOrder Y := (fun_hrel_comp f gt) ,, isStrongOrder_bck f _ (pr2 gt).
imports: UniMath.MoreFoundations.Propositions UniMath.MoreFoundations.Sets