[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 infapp-inj
⊦ # x = # x0 → (x + nf = x0 + nf0 ↔ x = x0 ∧ nf = nf0)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
infapp-from-eq
,
infapp-from-eqadd
,
infapp-to-eq
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 15
Used lemmas:
add-list-fun-def
,
Used spec theorems:
list-getput
/
extension
Used simplifier rules:
list-data
/
l
nat-basic
/
lf-01
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat
/
eq-01
nat-basic
/
l-02