[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 le-add-bound
⊦ ns < n ∧ n ≤ m → (ns < m ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
Used spec theorems:
oset
/nat-set/
Greater
Used simplifier rules:
set-basic
/nat-set/
size-zero-01
set-basic
/nat-set/
ne-01
nat
/
let
nat
/
lels
nat
/
le-ls-simp