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

1. a : 
2. b : 
3. f : {a..b}
4. j : {a..b}
5. 2j
6. 0<f(j)
  {a..b}(reduce_factorization(fj))<{a..b}(f)


By: Rewrite by
Thm*  a,b:f:({a..b}), z:{a..b}.
Thm*  0<f(z {a..b}(f) = z{a..b}(reduce_factorization(fz))
Using:[z:= j] ...


Generated subgoal:

1   {a..b}(reduce_factorization(fj))<j{a..b}(reduce_factorization(fj))
2 steps

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

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