[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 less-size-from
⌜n⌝ < # σ ⊦ ⌜n0⌝ < #(σ from n) ↔ ⌜n0 + n⌝ < # σ
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
from-append-add
,
swap-to-from-app
,
Used by units in proved state:
mon-lim-filter-count
,
infinite-append
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
size-inf
,
from-inf
,
length-from
,
size-fin
,
from-fin
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
a
nat-inf
/
add-fin
nat-inf
/
less-inf2
nat-inf
/
inf-less
nat-inf
/
addeqinf-cancel
nat-inf-basic
/
disj
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-inf
/
less-fin
nat-basic1
/
ls-02
nat
/
lels-01
nat
/
ls
nat-inf
/
ls-natinf-to-nat-2-1
nat-basic2
/
c