PrintForm Definitions myhill nerode Sections AutomataTheory Doc

At: mn 23 lem 1 1 1 1 2 1 1 2 2 1 1
1. Alph: Type
2. R: Alph*Alph*Prop
3. Fin(Alph)
4. EquivRel x,y:Alph*. x R y
5. Fin(x,y:Alph*//(x R y))
6. x,y,z:Alph*. (x R y) ((z @ x) R (z @ y))
7. g: (x,y:Alph*//(x R y))
8. x: x,y:Alph*//(x R y)
9. y: x,y:Alph*//(x R y)
10. < (x,y:Alph*//(x R y))(x,y:Alph*//(x R y)),a,p. p/x,y. < a.x,a.y > > ActionSet(Alph)
11. Fin((x,y:Alph*//(x R y))(x,y:Alph*//(x R y)))
12. x1: (x,y:Alph*//(x R y))(x,y:Alph*//(x R y))
13. y1: Alph*

( < (x,y:Alph*//(x R y))(x,y:Alph*//(x R y)),a,p. p/x,y. < a.x,a.y > > :y1x1) = (x1/x1,x2. < y1@x1,y1@x2 > )
By:
ListInd -1
THEN
Unfold `mn_quo_append` 0
THEN
RecUnfold `maction` 0
THEN
Analyze 12
THEN
Reduce 0
Generated subgoals:

112. x2: x,y:Alph*//(x R y)
13. x3: x,y:Alph*//(x R y)
14. y1: Alph*
< x2,x3 > = < x2,x3 >
212. x2: x,y:Alph*//(x R y)
13. x3: x,y:Alph*//(x R y)
14. y1: Alph*
15. u: Alph
16. v: Alph*
17. ( < (x,y:Alph*//(x R y))(x,y:Alph*//(x R y)),a,p. p/x,y. < a.x,a.y > > :v < x2,x3 > ) = ( < x2,x3 > /x1,x2. < v@x1,v@x2 > )
(( < (x,y:Alph*//(x R y))(x,y:Alph*//(x R y)),a,p. p/x,y. < a.x,a.y > > :v < x2,x3 > )/x,y. < u.x,u.y > ) = < u.(v @ x2),u.(v @ x3) > (x,y:Alph*//(x R y))(x,y:Alph*//(x R y))

About:
equalproductquotientlistpairlambdaspreadcons
universefunctionpropallimpliesboolmember