  Let M be a fine structural mouse. Let D be a fully backgrounded
L[E]-construction computed inside an iterable coarse premouse S. We describe a
process comparing M with D, through forming iteration trees on M and on S. We
then prove that this process succeeds.
