q:
, E:(q*
q*Prop).
(EquivRel x,y:q*. x E y) & (x,y:q*. Dec(x E y)) 
(
h:(q*q*).
(x,y:q*. (x E y) 
h(x) = h(y)) & (x:q*. x E (h(x))))
list_quo_choice_pls
== {i:
| 0 < i }
Thm* q:, E:(q*q*Prop).
(EquivRel x,y:q*. x E y) & (x,y:q*. Dec(x E y))
(h:(q*q*).
(x,y:q*. (x E y) h(x) = h(y)) & (x:q*. x E (h(x))))
list_quo_choice_pls
In prior sections: int 1 int 2 finite sets exponent action sets det automata