proposition: Lemma isaprop_ispreZFS (T : Tree) : isaprop (ispreZFS T).
proof: Proof. apply isapropdirprod. apply (isaprop_Tree_isWellFounded T). apply (isaprop_issuperrigid T). Qed.
imports: UniMath.Foundations.PartB UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.Foundations.HLevels UniMath.Combinatorics.WellOrderedSets UniMath.Combinatorics.OrderedSets UniMath.MoreFoundations.DecidablePropositions UniMath.MoreFoundations.Propositions