Nuprl - Proof: reduce factorization cancel 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: reduce factorization cancel 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(f; j) = reduce_factorization(g; j)
9. x : {a..b

}

f(x) = g(x)

By:	ApFun: Hyp:8 to: x

Generated subgoal:

1 10. reduce_factorization(f; j)(x) = reduce_factorization(g; j)(x)
f(x) = g(x)
2 steps

About:

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