Every AVL tree may be red black tree
Your proof produces a tree in which all nodes are colored black. It doesn't necessarily satisfy the "black height" rule:


  Every path from a given node to any of its descendant NIL nodes contains the same number of black nodes.


Not every AVL tree satisfies this condition, for example the Wikipedia example doesn't.