Assume x>=3. Then take each side mod 3.
x! and (x+1)! are congruent to 0 mod 3 while 2^y is congruent to 1 or 2 mod 3.
Then the equation would reduce to 1=0 mod 3 or 2=0 mod 3.
These are false so there are no solutions with x>=3.
Then x=0, 1, or 2.
If x=0 then 1+2^y=1, no solution for y.
If x=1 then 1+2^y=2, then 2^y=1 which makes y=0.
If x=2 then 2+2^y=6, then 2^y=4 which makes y=2.
The set of all non-negative integer solutions (x,y) of the given equation is (x,y)=(1,0) or (2,2).