Nuprl - Proof: prime divs mul via intseg 1 a 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 a 2

1. p :

2. prime(p)
3. a :

4.

k:

, b:

.
4. b-a = k
4.

4. (

e:({a..b

}

). a<b

p | (

i:{a..b

}. e(i))

(

i:{a..b

}. p | e(i)))

b:

, e:({a..b

}

).

a<b

p | (

i:{a..b

}. e(i))

(

i:{a..b

}. p | e(i))

By:

Auto

Generated subgoal:

1 5. b :
6. e : {a..b}
7. a<b
8. p | ( i:{a..b}. e(i))
i:{a..b}. p | e(i)
1 step

About:

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

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