PrintForm Definitions automata 4 Sections AutomataTheory Doc

At: refine iso 1 1 1 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. LangOf(A1) = LangOf(A2)
9. A1 A2
10. A2 A1
11. f: S1Alph*
12. x:S1. (Result(A1)f(x)) = x

f:(S1S2). Bij(S1; S2; f) & (s:S1, a:Alph. f(A1(s,a)) = A2(f(s),a) S2) & f(InitialState(A1)) = InitialState(A2) S2 & (s:S1. FinalState(A1)(s) = FinalState(A2)(f(s)))
By: Witness s.Result(A2)f(s)
Generated subgoals:

1 Bij(S1; S2; s.Result(A2)f(s))
213. s: S1
14. a: Alph
(s.Result(A2)f(s))(A1(s,a)) = A2((s.Result(A2)f(s))(s),a)
3 (s.Result(A2)f(s))(InitialState(A1)) = InitialState(A2)
413. s: S1
FinalState(A1)(s) = FinalState(A2)((s.Result(A2)f(s))(s))

About:
existsfunctionandallequal
applyboollambdauniverselist