(7steps 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 pluck 1 1

1. a : 
2. b : 
3. f : {a..b}
4. z : {a..b}
5. 0<f(z)
6. X : {a..b}
7. X = reduce_factorization(fz)
  {a..b}(f)
  =
  {a..b}(trivial_factorization(z)){a..b}(reduce_factorization(fz))


By: Rewrite by
Thm*  a,b:f,g:({a..b}).
Thm*  {a..b}(f){a..b}(g) = {a..b}(i.f(i)+g(i))


Generated subgoal:

1   {a..b}(f)
  =
  {a..b}(i.trivial_factorization(z)(i)+reduce_factorization(fz)(i))

4 steps

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

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