PrintForm Definitions list 3 autom Sections AutomataTheory Doc

At: lremove mem 1 2 1 1 2
1. St: Type
2. l: St*
3. s: St
4. eq: StSt
5. sx: St
6. u: St
7. v: St*
8. eq(s,sx)
9. mem_f(St;sx;v \ s) False
10. eq(s,u)

mem_f(St;sx;u.(v \ s)) False
By:
RecUnfold `mem_f` 0
THEN
Reduce 0
Generated subgoal:

1 u = sx mem_f(St;sx;v \ s) False

About:
impliesconsfalseuniverselistfunction
boolassertapplyorequal