type theory – Generalised letrec semantics for mutual recursion

I’m new to system types and I was wondering how mutual recursion is defined through generalized
e::= ..|let rec x1=e1 ,…., xn=en in e .What has to be added in the “simple” let rec semantics and evaluation rules and how is its syntactic sugar (using fix ) changed as well!

enter image description here

enter image description here