[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 four-square-congmod
i2 ^2 + i1 ^2 + i0 ^2 + i ^2 = j0 * j, ≡mod(i3, i2, j0), ≡mod(i4, i1, j0), ≡mod(i5, i0, j0), ≡mod(i6, i, j0), 1 < j, 0 < j, 0 < j0, j ≠ 2, j0 ≠ 1, 0 < i3 ^2 + i4 ^2 + i5 ^2 + i6 ^2 ⊦ ≡mod(i3 ^2 + i4 ^2 + i5 ^2 + i6 ^2, 0, j0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Lagrange-SumOf4Squares-primes
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 18
Proof steps: 35
Used lemmas:
congmod-def
,
Used spec theorems:
int-gcd
/
divides
int-square
/
two-plus
int-square
/
two-mult
int-square
/
Square-def
Used simplifier rules:
int-basic1
/
forward-pos
int-abs
/
abs-16
int-abs
/
sub-zero-01
int-gcd
/
div-abs-02
int-abs
/
sub-eq
int-gcd
/
divides-mult-add
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
forward-le-05
int-gcd
/
div-mult