[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 succ-03
⊦ 2^ m = 2 * n + 1 ↔ m = 0 ∧ n = 0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
lemma-ax2
,
Pot2-zero
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
succ
nat-basic2
/
a
nat-basic2
/
c
nat-mult
/
modeq-01
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic2
/
one-03
nat-mult
/
two-zero-01