[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 swap-from-to
⊦ ¬ # σ < ⌜m⌝ + ⌜n⌝ → (σ from m) to n = (σ to m + n) from m
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
swap-inf-from-to
,
swap-to-from
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 22
Used lemmas:
get-from
,
get-to
,
size-inf
,
from-inf
,
size-inf-to
,
inf-size-to
,
to-inf
,
size-fin
,
length-from
,
from-fin
,
to-fin
,
get-finto
,
get-from-01
,
length-to
,
sel-fin
,
fin-size-from
,
size-to
,
extensionality
,
Used spec theorems:
Used simplifier rules:
stream-basic
/
stream-fin-forward
nat-basic
/
f
nat-basic
/
l-02
nat
/
eq-01
nat-inf
/
inj-rqui
stream-basic
/
test-finp-rqui
nat-inf
/
less-fin
nat
/
le-def
nat-basic
/
ls-02
nat
/
ls-01
nat
/
let
nat
/
fle
list-data
/
l
nat
/
lep-02
nat-basic
/
l
nat-basic
/
a
nat-basic
/
c
nat-inf
/
sel-rqui-dotn
nat-inf
/
ls-natinf-to-nat-1-2
nat
/
lels
nat
/
ls-le-simp
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-inf
/
less-inf1
nat
/
fle-01
nat-basic
/
lf-01
nat
/
le-ls-simp
nat-inf
/
ls-lsadd
nat-inf
/
lele-trans
nat-inf
/
add-ls-cancel-01
nat-inf
/
add-fin
nat
/
lels-03