[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 mininv-inverts-inner
⊦ mon<(nσ) ∧ ⌜n⌝ < # nσ → min(nσ, nσ[n]) = n
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
mininv-inverts-weak
,
monls-ls
,
min-empty
,
min-def
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
zero-01
stream
/natstream/
size-empty
nat-inf-basic
/
elim
nat-inf
/
less-fin
nat-inf-basic
/
disj
nat
/
elim-pred-c
nat
/
le-ls-simp
nat-basic2
/
oz
nat-inf
/
add-fin
nat-basic1
/
lf-01
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-inf
/
inf-inseq-reduce
nat-basic2
/
s
nat-basic1
/
ref-1
nat-basic2
/
a
nat-basic2
/
c
nat-basic1
/
ls-02
nat
/
lels
nat
/
anti
nat-basic2
/
eq
nat-basic1
/
f
nat
/
lels-02
nat
/
ler