Nuprl - Pf assert term eq 4 1

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

1. a: Term
2. u: TermType{i'}
3. w: a:{v:Term| u(v) }b:Term. term_eq(a;b) a = b
4. y1: {v:Term| u(v) }
5. y2: {v:Term| u(v) }
6. b: Term
7. u1: TermType{i'}
8. w1: b:{v:Term| u1(v) }term_eq(tree_node( < y1, y2 > );b) tree_node( < y1, y2 > ) = b Term
9. y3: {v:Term| u1(v) }
10. y4: {v:Term| u1(v) }
11. term_eq(y1;y3)term_eq(y2;y4)

tree_node( < y1, y2 > ) = tree_node( < y3, y4 > ) Term

By: RW assert_pushdownC -1 THEN Analyze -1

Generated subgoal:

1 11. term_eq(y1;y3)
12. term_eq(y2;y4)
tree_node( < y1, y2 > ) = tree_node( < y3, y4 > ) Term

About:

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