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

1. n : {1...}
2. n = 1
  g:({2..(n+1)}). n = {2..n+1}(g)


By: {empty factorization }
Rewrite by n+1 = 2   THEN Witness: i.i THEN Compute {2..2}(i.i) * 1


Generated subgoals:

None

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

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