[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 And-discard
⊦ s ≠ ∅ → (λ a. hP) ∧_ s = hP
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: 6
Proof steps: 12
Used lemmas:
And-emp
,
And-ins
,
Used spec theorems:
set-basic
/
Extension
set-basic
/
indef
heap-sep
/
and
Used simplifier rules:
set-basic
/
size-zero
set-basic
/
size-zero-01
set-basic
/
In-empty
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz
set-basic
/
Size-insert
nat-basic
/
s-04
nat-basic
/
refl-nat
set-basic
/
size-zero-02
heap-sep
/
and-com
heap-sep
/
and-ass
heap-sep
/
true-and