(4steps total) PrintForm Definitions FTA Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: reduce factorization cancel 1 1

1. a : 
2. b : 
3. f : {a..b}
4. g : {a..b}
5. j : {a..b}
6. 0<f(j)
7. 0<g(j)
8. reduce_factorization(fj) = reduce_factorization(gj)
9. x : {a..b}
10. reduce_factorization(fj)(x) = reduce_factorization(gj)(x)
  f(x) = g(x)


By: (-1) Def of reduce_factorization(<term>; <term>) THEN Reduce Hyp:-1


Generated subgoal:

1 10. if x=j f(x)-1 else f(x) fi = if x=j g(x)-1 else g(x) fi
  f(x) = g(x)

1 step

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

(4steps total) PrintForm Definitions FTA Sections DiscrMathExt Doc