Understanding recurive let expression in lambda calculus with Haskell, OCaml and nix language

Question

I\'m trying to understand how recursive set operate in functional (not just scope check).

I can find it in wiki. In that, I need to know Y combinator, fixed point. I