Nuprl - Proof: prime factorization exists2 1 1 1 2 1 2 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: prime factorization exists2 1 1 1 2 1 2 1

1. n : {1...}
2. h : {2..(n+1)

}

3. n =

{2..n+1

}(h)
4. is_prime_factorization(2; (n+1); h)
5. x : {2..(n+1)

}
6.

prime(x)

h(x) = 0

By:	{by contrapositive of Hyp:4 } 0<h(x) Asserted THEN SimilarTo: Hyp:6 THEN BackThru: Hyp:4

Generated subgoals:

None

About:

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