[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 natset-ls-add-max-ls
⊦ ns < n → ns ++ m < max(m + 1, n)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
gjournal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 11
Used lemmas:
Used spec theorems:
oset
/nat-set/
Greater
min-max
/
max
Used simplifier rules:
set-basic
/nat-set/
In-insert
nat-basic
/
l-02
nat
/
fle
nat
/
le-ls-simp
set-basic
/nat-set/
size-zero-01
set-basic
/nat-set/
ne-01
oelem
/nat-set/
irreflexivity
nat-basic
/
f
nat
/
le-one
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01