[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-def
⊦ bag.exists(p) ↔ (∃ a. a ∈ bag ∧ p(a))
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: 4
Proof steps: 13
Used lemmas:
exists-rec
,
exists-base
,
in
,
Used spec theorems:
Used simplifier rules:
bag-basic
/
count-empty
bag-basic
/
count-insert
nat-basic
/
oz
nat-basic
/
a
nat-basic
/
c
nat-basic
/
add-base
nat-basic
/
z-01