Def  P & Q == PQ

is mentioned by

Thm*  x:{2...}. p:{2...}. px & prime(p) & p | x	[prime_or_smaller_prime_factor]
Thm*  x:{2...}. p:{2...}, c:{1...}. px & prime(p) & x = pc	[prime_or_smaller_prime_factor2]
Thm*  x:{2...}. prime(x)  (i,j:{2..x}. x = ij & prime(i))	[composite_with_prime_factor]
Thm*  x:. prime(x)  2x & (i:{2..x}. i | x)	[prime_nat]
Thm*  k:, i:{2..k}, j:. ij = k  2  j < k & i<k	[factors_smaller2]
Thm*  i,j:{2...}. i<ij & j<ij	[factors_smaller]
Thm*  i,j:. 0<ij  iij & jij	[pos_mul_arg_boundsNat2]
Thm*  a,b:. 0<ab  0<a & 0<b	[pos_mul_arg_boundsNat]
Thm*  i,j:. iij & jij	[factors_bound]
Thm*  x,y:. xy = 1  x = 1 & y = 1	[nat_prod_one_iff_factors_one]

In prior sections: core int 1 bool 1 LogicSupplement int 2 num thy 1 rel 1

Try larger context: DiscrMathExt IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html