(10steps) PrintForm Definitions mb automata 2 Sections GenAutomata Doc

At: unequal termlists 1


a,b:Term List. termlist_eq(a;b) ||a|| = ||b|| (i:. i < ||a|| & a[i] = b[i])

By:
Analyze 0
THEN
ListInd -1
THEN
Analyze 0
THEN
ListInd -1
THEN
Reduce 0
THEN
Try (Complete Auto)


Generated subgoals:

11. a: Term List
2. b: Term List
termlist_eq(nil;nil) 0 = 0 (i:. i < 0 & nil[i] = nil[i] Term)
21. a: Term List
2. u: Term
3. v: Term List
4. b:Term List. termlist_eq(v;b) ||v|| = ||b|| (i:. i < ||v|| & v[i] = b[i])
5. b: Term List
6. u1: Term
7. v1: Term List
8. termlist_eq([u / v];v1) ||[u / v]|| = ||v1|| (i:. i < ||[u / v]|| & [u / v][i] = v1[i])
termlist_eq([u / v];[u1 / v1]) ||v||+1 = ||v1||+1 (i:. i < ||v||+1 & [u / v][i] = [u1 / v1][i])

About:
listconsnilassertnatural_numberaddless_thanequalimpliesallexists

(10steps) PrintForm Definitions mb automata 2 Sections GenAutomata Doc