[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem Lagrange-SumOf4Squares-primes
prime(j), j ≠ 2 ⊦ ∃ i, i0, i1, i2. j = i ^2 + i0 ^2 + i1 ^2 + i2 ^2
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Lagrange-SumOf4Squares
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 58
Proof steps: 82
Used lemmas:
four-square-mod-zero
,
four-square-odd-ls
,
four-square-congmod
,
four-square-divides-all
,
congmod-def
,
ex-modeq-half-all
,
even-sum
,
lagrange-lemma-smallest
,
Used spec theorems:
int-min
/
even-def
int-square
/
two-even-01
int-mult
/
dist-rmerge
int-min
/
odd-even-rew
int-square
/
euler-four-square-identity2
int-gcd
/
divides
int-mult
/
dist-rsplit
int-square
/
two-mult
int-square
/
Square-def
int-min
/
even-odd-rew
Used simplifier rules:
int-basic2
/
num-between
int-min
/
even-mult
int-div
/
div-lezero
int-basic1
/
two-ls
int-div
/
div2-nle
int-mult
/
ls-same-01
int-div
/
nummult-ls-02
int-mult
/
neq-two
int-mult
/
one
int-div
/
div-mult-num
int-mult
/
add-mult-two
int-min
/
not-even-mod2
int-abs
/
abs-16
int-abs
/
sub-zero-01
int-abs
/
forward-le-05
int-basic1
/
forward-pos
oelem
/intlista/
transitivity
int-mult
/
neq-not-zero
int-square
/
neq
int-mult
/
eq-pos
int-basic2
/
add-in
int-abs
/
sub-sub
int-abs
/
sub-add-01
int-mult
/
zero-gr
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
ls-pos
int-abs
/
lenls
int-abs
/
forward-le-01
int-abs
/
mone-06
int-abs
/
forward-lels
int-abs
/
numleledel-01
int-div
/
div-two-zero-01
oelem
/intlista/
lel
int-basic2
/
add-c
int-basic2
/
add-a
int-square
/
four-square-le-zero
int-abs
/
lels
int-abs
/
gr-def