Nuprl - Proof: prime divs mul via intseg 1 1 1 2 1 2

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

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: prime divs mul via intseg 1 1 1 2 1 2

1. p :

2. prime(p)
3. a :

4. k :

5.

k1:

.
5. k1<k
5.

5. (

b:

.
5. (b-a = k1
5. (

5. ((

e:({a..b

}

). a<b

p | (

i:{a..b

}. e(i))

(

i:{a..b

}. p | e(i))))
6. b :

7. b-a = k
8. e : {a..b

}

9. a<b
10. p | (

i:{a..b

}. e(i))
11.

a+1 = b
12. p | (

i:{a..b-1

}. e(i))

e(b-1)
13. p | e(b-1)

i:{a..b

}. p | e(i)

By:	Witness: b-1 ...

Generated subgoals:

None

About:

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

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