[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 mod-twoodd-02
⊦ j % (2 * i) = 1 ∧ 0 < i ∧ 0 ≤ j → j % 2 = 1
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
Used by units in proved state:
int-pot
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
mod-mult-03
,
div-elim-pos
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
lstwo
int-abs
/
forward-le-01
int-basic2
/
add-zero-rev
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
zero-ge
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
eq-one
int-abs
/
zero-gels-04