Level: Lib Thy Top: 1
Hypotheses:

  1. Alph :

  2. St :

  3. Auto : Automata(Alph;St)

  4. c : St Alph List

  5. (q:St. Auto(c q) = q) Fin(Alph) Fin(St)

Conclusion:

Surj(St;x,y:(Alph List)//(x Rl y);c)

Applied Tactic: InstLemma `lang_rel_equi` [Alph;L(Auto)] THENA Auto
Generated subgoals:

1. Surj(St;x,y:(Alph List)//(x Rl y);c)