Nuprl Basics - Proof: sfa doc ntuple contains wf 1 1 2

(12steps total) PrintForm Definitions Lemmas NuprlPrimitives Sections NuprlLIB Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: sfa doc ntuple contains wf 1 1 2

1. A : Type
2. P : A

Prop
3. n :

4.

n1:

. n1<n

(

X:(A^n1). (

u in X: A^n1. P(u))

Prop)
5. X : A^n
6. n

2

(X/a,rest. P(a)

(

u in rest: A^(n-1). P(u)))

Prop

By:	ChangeToEqType5: A(A^(n-1))

Generated subgoals:

1 5. X : A(A^(n-1))
6. n2
(X/a,rest. P(a) ( u in rest: A^(n-1). P(u))) Prop
4 steps

2 (A^n) = A(A^(n-1))
1 step

About:

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

(12steps total) PrintForm Definitions Lemmas NuprlPrimitives Sections NuprlLIB Doc