reserve v,x for object;
reserve D,V,A for set;
reserve n for Nat;
reserve p,q for PartialPredicate of D;
reserve f,g for BinominativeFunction of D;
reserve D for non empty set;
reserve d for Element of D;
reserve f,g for BinominativeFunction of D;
reserve p,q,r,s for PartialPredicate of D;

theorem
  p is total implies <*PP_inversion(p),f,q*> is SFHT of D
  proof
    assume p is total;
    then
A1: PP_inversion(p) ||= PP_False(D) by PARTPR_2:10;
    <*PP_False(D),f,q*> is SFHT of D by Th18;
    hence thesis by A1,Th15;
  end;
