[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 mk-inj
⊦ m ≠ 0 → (mklist(a, m) = mklist(b, n) ↔ a = b ∧ m = n)
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 10
Used lemmas:
mk-in
,
mk-inj-01
,
mk-elem
,
mk-rec
,
mk-empty
,
mk-zero
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
succ
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz
nat-basic
/
z-01
nat
/
elim-pred-c
nat-basic
/
eq-01
list
/
a
list
/
in-14
list
/
c
nat-basic
/
add-base
nat
/
add-01
list
/
app-08