[lemma=in] [□] □ □
[lemma=in] [□=□] □ □
[lemma=in] [□ & □] □ □
Building on the material in the first four chapters , we develop in Chapter 5 the state-splitting algorithm for code construction and prove the Finite-State Coding Theorem . Indeed , our historical core as embodied in the first four chapters is inadequate without the stress of the fifth chapter when it makes plain that ministry and mission is the work of the body of Christ itself .