[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 sub-succ
⊦ m0 ≤ n ∧ n ≤ m → m - (n - m0) = (m - n) + m0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
nat-prime
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
sub-add
,
fle
,
ls-03
,
eq-02
,
le-ls-simp
,
lels-01
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
eq-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
l-02
nat-basic1
/
f