Nuprl - Proof: eval factorization nullnorm 1

(2steps total) PrintForm Definitions Lemmas FTA Sections DiscrMathExt Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: eval factorization nullnorm 1

a,b:

, f:({a..b

}

). b

a

(

i:{a..b

}. i

f(i)) = (

i:{a..a

}. i

f(i))

By:	UnivCD THEN BackThru: 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 subgoals:

None

About:

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

(2steps total) PrintForm Definitions Lemmas FTA Sections DiscrMathExt Doc