[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 relyp-def
⊦ relyp(t, fowl, fowl0) ↔ (∃ fowl1, fowl2. fowl ⊒ fowl1 ∧ fowl0 = fowl1 + fowl2 ∧ fowl2 | t = [])
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
relyp-add-other-fo
,
relyp-add-other-w
,
relyp-fo-follows-w-stable
,
relyp-no-event-added-by-other
,
relyp-no-pending-stable
,
relyp-no-pending-w-stable
,
relyp-one-pending-stable
,
relyp-persist
,
relyp-refl
,
Used by units in proved state:
Proof exists?: No