[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 min-skolemf
⊦ mon<(nσ) → (∃ m0. (nσ = [] ⊃ m0 = 0 ;(# nσ ≠ ∞ ∧ nσ[(# nσ).n - 1] < n ⊃ m0 = (# nσ).n ;⌜m0⌝ < # nσ ∧ n ≤ nσ[m0] ∧ (∀ m. ⌜m⌝ < # nσ ∧ n ≤ nσ[m] → m0 ≤ m) ) ))
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: 16
Proof steps: 38
Used lemmas:
monls-def
,
Used spec theorems:
Used simplifier rules:
nat
/
lez
nat-basic
/
less-zero
stream
/
zero-len
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
nat-basic
/
s-04
nat-basic
/
refl-nat
nat
/
lels-02
nat-basic
/
ls-02
nat-basic
/
f
nat
/
le-def
nat
/
lels-03
nat
/
ls-le-simp
nat
/
ler
nat-inf
/
add-fin
nat
/
lels
nat
/
le-ls-simp
nat
/
anti
nat-inf
/
inf-inseq-reduce
nat-inf
/
sum-notinf
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
ls-notlssucc
nat-inf
/
disj-rqui-infty
nat-inf
/
prime-add-fin
nat-inf
/
sel-rqui-dotn
nat
/
add-01
nat-basic
/
add-base