Nuprl - Proof: iter nat prod one iff factors one 1 1 1 2 1

(14steps total) PrintForm Definitions Lemmas IteratedBinops Sections DiscrMathExt Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: iter nat prod one iff factors one 1 1 1 2 1

1. a :

2. k :

3. 0<k
4.

b:

, e:({a..b

}

).
4. b-a = k-1

((

i:{a..b

}. e(i)) = 1

(And i:{a..b

}. e(i) = 1))
5. b :

6. e : {a..b

}

7. b-a = k

(

i:{a..b-1

}. e(i))

e(b-1) = 1

(And i:{a..b-1

}. e(i) = 1) & e(b-1) = 1

By:	Rewrite by Thm* x,y:. xy = 1 x = 1 & y = 1 ...w

Generated subgoal:

1   ( i:{a..b-1}. e(i)) = 1 & e(b-1) = 1

  (And i:{a..b-1}. e(i) = 1) & e(b-1) = 1
1 step

About:

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

(14steps total) PrintForm Definitions Lemmas IteratedBinops Sections DiscrMathExt Doc