Prove:
=> prime(2)
Given:
| Axiom | Definition |
|---|---|
| division | not X = 0 and X * Y = X * Z=> Y = Z ; |
| ordering | integer(X) and any(X) and integer(Y) and any(Y) => X > Y xor X = Y xor Y > X ; |
| magnitude1 | X * Y = Z and X > 1 and Z > 0=> Z > Y ; |
| magnitude2 | X * Y > 0 and X > 0=> Y > 0 ; |
| times_range1 | X > 0 and X * Y > 0=> Y > 0 ; |
| times_range2 | X * Y = Z and X > 0 and Z > 0=> not Y > Z ; |
| factor | integer(X) and any(X) and integer(Y) and any(Y) and integer(Z) and exists(Z) and factor(X,Y)<=> X * Z = Y ; |
| prime | integer(X) and any(X) and integer(Y) and any(Y) and prime(X)<=> X > 1 and ((factor(Y,X)) and Y > 0=> Y = 1 or Y = X) ; |