[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 disj
⊦ disj(T1, T2) ↔ (∀ n, m. n < # T1 ∧ m < # T2 ∧ T1[n] ≠ empty ∧ T2[m] ≠ empty → T1[n].elem ≠ T2[m].elem)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
disj-neq
,
disj-reduce
,
Used by units in proved state:
Proof exists?: No