Nuprl - Proof: hanoi seq join seq 1 1 2 1

(9steps total) PfGloss PrintForm Definitions Lemmas HanoiTowers Sections NuprlLIB Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: hanoi seq join seq 1 1 2 1

1. n :

2. a :

3. z :

4. m : {a...z-1}
5. s1 : {a...m}

{1...n}

Peg
6. s2 : {m+1...z}

{1...n}

Peg
7.

k:{1...n}. Moving disk k of n takes s1(m) to s2(m+1)
8. s1 is a Hanoi(n disk) seq on a..m
9. s2 is a Hanoi(n disk) seq on m+1..z
10. x : {a...z}
11. x' : {a...z}
12. x+1 = x'
13. x = m

k:{1...n}. Moving disk k of n takes s1(x) to s2(x')

By:	Rewrite by x = m {a...m} THEN Rewrite by x' = m+1 {m+1...z}

Generated subgoals:

None

About:

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(9steps total) PfGloss PrintForm Definitions Lemmas HanoiTowers Sections NuprlLIB Doc