In the study of free arrangements, the most useful result to construct/check free arrangements is the addition-deletion theorem in [J. Fac. Sci. Univ. Tokyo 27 (1980), 293–320]. Recently, the multiple version of the addition theorem was proved in [J. Eur. Math. Soc. 18 (2016), 1339–1348], called the multiple addition theorem (MAT), to prove the ideal-free theorem. The aim of this article is to give the deletion version of MAT, the multiple deletion theorem (MDT). Also, we can generalize MAT to get MAT2 from the viewpoint of our new proof. Moreover, we introduce the restriction version, a multiple restriction theorem (MRT). Applications of MAT2, including the combinatorial freeness of the extended Catalan arrangements, are given.