[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-less-leftsucc
⊦ n∞ < n∞0 → (n∞ + ⌜1⌝ < n∞0 ↔ ¬(n∞ + ⌜1⌝ = n∞0 ∧ n∞ ≠ ∞))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
stut-mon
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 5
Used lemmas:
add-fin
,
ls-natinf-to-nat-2-1
,
less-fin
,
disj-rqui-infty
,
inf-less
,
gen
,
add-comm
,
add-assoc
,
inj-rqui
,
add-less
,
lsle-trans
,
ls-irref
,
Used spec theorems:
Used simplifier rules:
nat
/
lels
nat
/
les
nat
/
eqle-one
nat-basic
/
f
nat-basic
/
lf-01
nat-basic
/
oz
nat-basic
/
a
nat-basic
/
c