Nuprl - Pf rel_mng_2

(26steps) PrintForm Definitions Lemmas mb automata 3 Sections GenAutomata Doc

1. ds: Collection(dec())
2. da: Collection(dec())
3. de: sig()
4. rho: Decl
5. st1: Collection(SimpleType)
6. e1: {1of([[de]] rho)}
7. s: {[[ds]] rho}
8. s': {[[ds]] rho}
9. a: [[st1]] rho
10. tr: trace_env([[da]] rho)
11. l: Term List
12. u: Term
13. v: Term List
14. (i:||v||. trace_consistent(rho;da;tr.proj;v[i])) (ls:SimpleType List, f:reduce(s,m. [[s]] rhom;Prop;ls). ||ls|| = ||v|| & (i:. i < ||v|| ls[i] term_types(ds;st1;de;v[i])) list_accum(x,t.x([[t]] e1 s s' a tr);f;v) Prop)
15. i:(||v||+1). trace_consistent(rho;da;tr.proj;[u / v][i])
16. ls: SimpleType List
17. f: reduce(s,m. [[s]] rhom;Prop;ls)
18. ||ls|| = ||v||+1 & (i:. i < ||v||+1 ls[i] term_types(ds;st1;de;[u / v][i]))

list_accum(x,t.x([[t]] e1 s s' a tr);f([[u]] e1 s s' a tr);v) Prop

By: Analyze -1 THEN Analyze -6

Generated subgoals:

1 14. i:(||v||+1). trace_consistent(rho;da;tr.proj;[u / v][i])
15. ls: SimpleType List
16. f: reduce(s,m. [[s]] rhom;Prop;ls)
17. ||ls|| = ||v||+1
18. i:. i < ||v||+1 ls[i] term_types(ds;st1;de;[u / v][i])
i:||v||. trace_consistent(rho;da;tr.proj;v[i])

2 14. i:(||v||+1). trace_consistent(rho;da;tr.proj;[u / v][i])
15. ls: SimpleType List
16. f: reduce(s,m. [[s]] rhom;Prop;ls)
17. ||ls|| = ||v||+1
18. i:. i < ||v||+1 ls[i] term_types(ds;st1;de;[u / v][i])
19. ls:SimpleType List, f:reduce(s,m. [[s]] rhom;Prop;ls). ||ls|| = ||v|| & (i:. i < ||v|| ls[i] term_types(ds;st1;de;v[i])) list_accum(x,t.x([[t]] e1 s s' a tr);f;v) Prop
list_accum(x,t.x([[t]] e1 s s' a tr);f([[u]] e1 s s' a tr);v) Prop

About:

(26steps) PrintForm Definitions Lemmas mb automata 3 Sections GenAutomata Doc