let S be non empty non void ManySortedSign ; :: thesis: for A being non-empty MSAlgebra over S
for R being invariant stable ManySortedRelation of A holds TRS R = R
let A be non-empty MSAlgebra over S; :: thesis: for R being invariant stable ManySortedRelation of A holds TRS R = R
let R be invariant stable ManySortedRelation of A; :: thesis: TRS R = R
( TRS R c= R & R c= TRS R ) by Def13;
hence TRS R = R by PBOOLE:146; :: thesis: verum