[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 exists-max1column-ind
n < #c mx ⊦ ∃ c. c ≤ n ∧ (∀ c0. c0 ≤ n → count(mx[c0]c, λ j. ¬ j < i) ≤ count(mx[c]c, λ j. ¬ j < i))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
exists-max1column
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
Used spec theorems:
Used simplifier rules:
nat-basic
/
zero
nat
/
lez-01
nat
/
ler
nat-basic
/
f
nat-basic
/
succ
nat
/
fle-01
nat-basic
/
c
nat-basic
/
a
nat-basic
/
nls-fst
nat
/
lels-03
nat
/
le-one
nat
/
le-def
nat
/
lep-02
nat-basic
/
l-02
nat-basic
/
trans-nat
nat
/
fle
nat-basic
/
lf
nat-basic
/
refl-nat
nat-basic
/
s-04
nat
/
le-ls-simp
nat-basic
/
oz
nat-basic
/
lf-02
nat-basic
/
lf-01
nat
/
eqle-one
nat
/
les
nat
/
ls-le-simp