reserve n for Element of NAT,
  p,q,r,s for Element of HP-WFF;
reserve V for SetValuation;
reserve P for Permutation of V;

theorem
  p is pseudo-canonical & p => q is pseudo-canonical implies
  q is pseudo-canonical
proof
  assume that
A1: p is pseudo-canonical and
A2: p => q is pseudo-canonical;
  let V;
  let P be Permutation of V;
  consider x being set such that
A3: x is_a_fixpoint_of Perm(P,p) by A1;
  consider f being set such that
A4: f is_a_fixpoint_of Perm(P,p => q) by A2;
  dom Perm(P,p => q) = SetVal(V,p => q) by FUNCT_2:52
    .= Funcs(SetVal(V,p),SetVal(V,q)) by Def2;
  then reconsider f as Function of SetVal(V,p), SetVal(V,q) by FUNCT_2:66,A4;
  take f.x;
  thus thesis by A3,A4,Th39;
end;
