[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-invert
⊦ encode(m.fst, m.snd) = m
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
exencode
,
Used by units in proved state:
int-pair
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 24
Proof steps: 25
Used lemmas:
max-size
,
max-size-01
,
max-nls
,
encode-def
,
dec-snd
,
dec-fst
,
Used spec theorems:
nat-div
/
exmult
nat-div
/
two-mdiv2-02
nat
/
prop-01
nat
/
ls-03
nat-mult
/
dist
nat-basic
/
c
nat-basic
/
a
nat
/
sub-add
Used simplifier rules:
nat
/
le-def
nat
/
eq-02
nat-basic
/
eq-01
nat-mult
/
rsucc-02
nat-div
/
square-even-02
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic
/
a
nat-basic
/
c
nat
/
fle-01
nat-basic
/
f
nat
/
add-num-03
nat-mult
/
le-num
nat
/
ls-le-simp
nat-div
/
two-rec
nat-basic
/
s-04
nat-div
/
two-mdiv2-02
nat
/
let
nat-div
/
le-div-to-mult
nat
/
lels
nat
/
le-ls-simp
nat-mult
/
coef-07