by using additional variables as we did for SAT in Section 4.2.2 show how to break a NAE-k-SAT clause, for any k, into a chain of NAE-3-SAT clauses

This completes the chain of reductions

3-SAT <= NAE-4-SAT <= NAE-3-SAT

and proves that NAE-3-SAT is NP-complete