Some of your statements are true, some are not (see slide 56 of Chapter 4 on Transition systems):
for the empty state set, we get:
- pre∃({}) := {}
- pre∀({}) := {s ∈ S | suc(s) = {}} (deadend states)
- suc∃({}) := {}
- suc∀({}) := {s ∈ S | pre(s) = {}} (root states)
for the set of all states S, we get:
- pre∃(S) := {s ∈ S | suc(s) ̸= {}} (all except for deadends)
- pre∀(S) := S
- suc∃(S) := {s ∈ S | pre(s) ̸= {}} (all except for root states)
- suc∀(S) := S