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

(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 2

1. a :

2.

b:

, e:({a..b

}

).
2. a

b

((

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)

By:	Decide: ab

Generated subgoals:

1 5. ab
( i:{a..b}. e(i)) = 1 (And i:{a..b}. e(i) = 1)
1 step

2 5. ab
( i:{a..b}. e(i)) = 1 (And i:{a..b}. e(i) = 1)
2 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