Perhaps you missed where I mentioned a constant "budget of bits." Your second h(x,y,z) is implicitly using more bits in the calculation, rather than "sharing" with x.
In other words, these are the two functions that should be compared:
h(content, very_random_bits(32))
h(content, very_random_bits(16) + slightly_random_bits(16))
The point of CSPRNG constructions is that there isn't a "budget bits" of seed. Again: this idea is pretty core to the design of the LRNG.
Neither of your constructions is secure.