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

}

5.

a

b

(

i:{a..b

}. e(i)) = 1

(And i:{a..b

}. e(i) = 1)

By:	Rewrite by Thm* f:(AAA), u:A, a,b:, e:({a..b}A). Thm* ba (Iter(f;u) i:{a..b}. e(i)) = (Iter(f;u) i:{a..a}. e(i))

Generated subgoal:

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