[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 div-twoodd
0 ≤ i, 0 < j ⊦ (2 * i + 1) / (2 * j) = i / j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
div-two-intro
,
div-twoodd-02
,
div-twoodd-03
,
mod-twoodd
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
div-mult-pos-02
,
mult-02
,
div-elim-pos
,
Used spec theorems:
Used simplifier rules:
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
zero-ge-add