Abstract
In this paper we prove that the principles in the language with relation composition and dynamic
implication, valid for all binary relations, are the same ones as the principles valid when we restrict
ourselves to DPL-relations, i.e., relations generated from conditions (tests) and resettings.
