(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 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)
8. x : {a..b}
  f(x) = trivial_factorization(z)(x)+reduce_factorization(fz)(x)


By: Def of trivial_factorization(z) | reduce_factorization(fz) THEN Reduce Concl


Generated subgoal:

1   f(x) = if x=z 1 else 0 fi+if x=z f(x)-1 else f(x) fi
1 step

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

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