[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 encode-zero
⊦ encode(m, n) = 0 ↔ m = 0 ∧ n = 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
int-pair
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 1
Used lemmas:
encode-def
,
Used spec theorems:
Used simplifier rules:
nat-mult
/
rsucc-02
nat-basic2
/
a
nat-basic2
/
c
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic2
/
z-01
nat-basic2
/
add-base
nat-div
/
two-zero-01-01
nat-mult
/
square-one