Nuprl - Proof: list iso 2 2 1 1 1 2 1 2 1 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: list iso 2 2 1 1 1 2 1 2 1 1

1. 'a : S
2. x : (

'a)

3. f :

'a
4. n :

5. x = <

. if m<

n then f(m) else @

x:'a. true

fi ,n>
6. ||f{

n}|| = n-0
7. m :

if m<

n then f(m) else @

x:'a. true

if m<

||f{

n}|| then (f{

n})[m] else arb('a) fi

By:	BifCase THEN Simp THEN StrongAuto THEN BifCase THEN Simp THEN StrongAuto

Generated subgoals:

1 8. m<n
9. m<||f{n}||
f(m) = (f{n})[m]
2 steps

2 8. m<n
9. m<||f{n}||
(@x:'a. true) = arb('a)
2 steps

About:

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

1	8. m<n 9. m<\|\|f{n}\|\| f(m) = (f{n})[m]	2 steps
2	8. m<n 9. m<\|\|f{n}\|\| (@x:'a. true) = arb('a)	2 steps