[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 from-from
⊦ ¬ # σ < ⌜m + n⌝ → σ from m from n = σ from m + n
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 12
Used lemmas:
get-from-inf
,
from-nf
,
size-inf
,
from-inf
,
from-succ-cons-l-lem
,
from-zero-l
,
size-fin
,
from-fin
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
c
nat-basic
/
a
nat-inf
/
add-fin
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat
/
lels
nat-inf
/
ls-natinf-to-nat-1-2
stream-basic
/
inj-rqui
list-data
/
size-nil
nat
/
lez-01
nat-basic
/
z-01
list
/
a
list
/
len-02
list
/
len
list
/
c
nat-basic
/
z-02
nat
/
lep-02
nat-basic
/
succ
nat-inf
/
less-inf1
stream-basic
/
inj-rqui0