PrintForm Definitions automata 4 Sections AutomataTheory Doc

At: refine iso 1 1 1 1 1 4 1 1
1. Alph: Type
2. S1: Type
3. S2: Type
4. A1: Automata(Alph;S1)
5. A2: Automata(Alph;S2)
6. s:S1. l:Alph*. (Result(A1)l) = s
7. Con(A2)
8. l:Alph*. LangOf(A1)(l) LangOf(A2)(l)
9. A1 A2
10. A2 A1
11. f: S1Alph*
12. x:S1. (Result(A1)f(x)) = x
13. s: S1

FinalState(A1)(s) = FinalState(A2)(Result(A2)f(s))
By: Unfold `auto_lang` 8
Generated subgoal:

18. l:Alph*. (l.A1(l))(l) (l.A2(l))(l)
9. A1 A2
10. A2 A1
11. f: S1Alph*
12. x:S1. (Result(A1)f(x)) = x
13. s: S1
FinalState(A1)(s) = FinalState(A2)(Result(A2)f(s))

About:
equalboolapplyuniverseallexistslistfunction