A general determinantal identity of Sylvester type over arbitrary commutative fields is derived. While its proof is rather short and conceptually simpler than earlier attempts, the result contains Sylvester's classical determinantal identity and more recent extensions as well as some old and some new determinantal identities. An application to the E-algorithm is added.