“…An ω 1 -tree is a tree T such that: (1) ht(T ) = ω 1 ; (2) for each α < ω 1 , |T α | ω; (3) for every t ∈ T and for every α, ht(t) < α < ω 1 , t has at least two successors of height α; (4) if ht(t) = ht(s) is a limit ordinal, t = s if and only ift =ŝ (see [2]). In [8], Hart showed the Pressing-Down Lemma (PDL) for ω 1 -trees. Some properties of ω 1 -trees were investigated in [4] and [8].…”