Nuprl - Proof: iter nat prod one iff factors one 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. a :

b:

, e:({a..b

}

). (

i:{a..b

}. e(i)) = 1

(And i:{a..b

}. e(i) = 1)

By:	b:, e:({a..b}). ab (( i:{a..b}. e(i)) = 1 (And i:{a..b}. e(i) = 1)) Asserted THEN UnivCD

Generated subgoals:

1   b:, e:({a..b}).
  ab  (( i:{a..b}. e(i)) = 1  (And i:{a..b}. e(i) = 1))
8 steps

2 2. b:, e:({a..b}).
2. ab  (( i:{a..b}. e(i)) = 1  (And i:{a..b}. e(i) = 1))
3. b :
4. e : {a..b}
  ( i:{a..b}. e(i)) = 1  (And i:{a..b}. e(i) = 1)
4 steps

About:

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

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