[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 enc-nat-neg
⊦ n % 2 ≠ 0 → encode(n) = ~ n→i((n + 1) / 2)
Type: An axiom
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
dec-int-01
,
dec-nat
,
enc-zero-02
,
Used by units in proved state:
Proof exists?: No