Nuprl - Proof: comp nat ind tp 1 1 1 1 1 1 1

(35steps total) PrintForm Definitions int 1 Sections StandardLIB Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: comp nat ind tp 1 1 1 1 1 1 1

1. P :

Prop
2.

. (

. j<i

P(j))

P(i)

. i<0

P(i)

By:	(Analyze 0) THEN (Analyze 0)

Generated subgoals:

1 3. i :
4. i<0
  P(i)
1 step

2 1. P : Prop{k}
2. i:. (j:. j<i  P(j))  P(i)
3. i :
  (i<0)  Prop{1}
1 step

3 1. P : Prop{k}
2. i:. (j:. j<i  P(j))  P(i)
    Type{1}
1 step

About:

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

(35steps total) PrintForm Definitions int 1 Sections StandardLIB Doc

1	3. i : 4. i<0 P(i)	1 step
2	1. P : Prop{k} 2. i:. (j:. j<i P(j)) P(i) 3. i : (i<0) Prop{1}	1 step
3	1. P : Prop{k} 2. i:. (j:. j<i P(j)) P(i) Type{1}	1 step