[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 inj-add
⊦ a + x = a0 + x0 ↔ a = a0 ∧ x = x0
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment: |- a + x = a0 + x0 <-> a = a0 and x = x0
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 15
Used lemmas:
Used spec theorems:
array-listops
/
cons
array
/
Extension
array-copy
/
at-copy
Used simplifier rules:
array
/
eq-write-1
array-copy
/
size-copy
array
/
Size-mkarray
nat-basic
/
zero
nat-basic
/
oz
nat-basic
/
a
nat-basic
/
c
nat-basic
/
s-04
array
/
Size-put
nat-basic
/
eq-01
nat-basic
/
f
nat-basic
/
lf-01
nat-basic
/
z-01
array
/
Put-other
array-copy
/
at-copy
nat-basic
/
nls-fst
nat
/
lep-02
nat
/
ls-le-simp
nat
/
add-01
nat-basic
/
add-base
nat-basic
/
l
nat
/
lels