Regular languages of infinite trees that are boolean combinations of open sets - continuation

This is the continuation of last week talk. Last week I presented a decidable characterization of the class of trees languages definable by boolean combinations of open sets. This week I will present part of the proof.