Nuprl - Proof: count pairs swap 1 1 1 1 2 1 2 1 2 2 1

(29steps total) PrintForm Definitions Lemmas mb list 2 Sections MarkB generic Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: count pairs swap 1 1 1 1 2 1 2 1 2 2 1

1. T : Type
2. L : T List
3. P : T

T

4. n :

(||L||-1)
5. (n, n+1)

||L||

||L||
6. ||swap(L;n;n+1)|| = ||L||
7. f :

||L||

||L||
8.

i:

||L||. f(i) = (n, n+1)(i)
9. i :

||L||
10. j :

||L||
11. i<j
12. j = n+1

i = n+1

j = n

i = n

n

n+1

0-if P(L[i],L[j])

1 else 0 fi = if P(L[i],L[j])

-1 else 0 fi

By:	SplitOnConclITE

Generated subgoals:

None

About:

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

(29steps total) PrintForm Definitions Lemmas mb list 2 Sections MarkB generic Doc