Let -resolvable STS() denote a Steiner triple system of order whose blocks are partitioned into classes such that each point of the design occurs in precisely blocks in each class. We show that for and , there exists an -resolvable STS() containing an -resolvable sub-STS() for all suitable .