Level: Lib Thy Top: 1 1 1
Hypotheses:

  1. Alph :

  2. St :

  3. Auto : Automata(Alph;St)

  4. Fin(Alph) Fin(St)

  5. EquivRel(Alph List;x,y.x Rl y)

  6. s : x,y:(Alph List)//(x Rl y)

Conclusion:

l:Alph List. MinAuto(Auto)(l) = s

Applied Tactic: InstLemma `fin_alph_list_quo` [Alph;x,y.x = y] THENA Auto
Generated subgoals:

1. EquivRel(Alph List;x,y.x (x,y.x = y) y)

2. Dec(x (x,y.x = y) y)

3. l:Alph List. MinAuto(Auto)(l) = s