Nuprl - Proof: strongwf-implies 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: strongwf-implies 1

1. T : Type
2. R : T

Type
3. f : T

x,y:T. R(x,y)

f(x)<f(y)
5. P : T

Prop
6.

j:T. (

k:T. R(k,j)

P(k))

P(j)

n:T. P(n)

By:	Assert (i:, x:T. f(x) = i P(x))

Generated subgoals:

1   i:, x:T. f(x) = i  P(x)
2 steps

2 7. i:, x:T. f(x) = i  P(x)
  n:T. P(n)
1 step

About:

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

1	i:, x:T. f(x) = i P(x)	2 steps
2	7. i:, x:T. f(x) = i P(x) n:T. P(n)	1 step