[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-two-ls
⊦ i < j ∧ 0 ≤ i → 2 ^ i % 2 ^ j = 2 ^ i
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
two-lsz
,
ls-pos-2pot
,
pot2-pos
,
Used spec theorems:
int-div
/
mod-zero-03
Used simplifier rules:
int-abs
/
forward-le-01
int-abs
/
forward-lels
int-abs
/
lels-01
int-basic1
/
ls-01