Yet more proof that there is no such thing as "the" relational algebra.
As for restriction :
Your book/teacher seems to go by the principle that restriction conditions can only be "very basic". In the sense as the wiki article on http://en.wikipedia.org/wiki/Selection_%28relational_algebra%29 (at least one attribute referenced, one other attribute or constant value, only one single comparison operator involved, no other operator invocations allowed such as SIN(angle attr) or MONTH(datetime attr) or ...).
But that restriction (on the restrict condition) is unnecessary. The wiki article about relational algebra on http://en.wikipedia.org/wiki/Relational_algebra#Selection_.28.CF.83.29 says explicitly "... is a propositional formula that consists of ... and the logical operators AND,OR,NOT ...".
As for rename :
The RENAME operator in relational algebra is used to yield a relation value that differs from the input only in that certain attributes have "changed name".
Your book/teacher apparently uses an operator called "rename" to assign a name to some specified relational expression (a UNION in your example). That isn't even an algebraic operation !!!
(While it is a valid and useful idea in language design to devise a possibility for the user to have "named expressions", that he can subsequently reference using just the assigned name, this is a matter of language design, not of relational algebra !)