[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 int-rax
⊦ a ∈ s1 ∩ s2 ↔ ¬ ¬(a ∈ s1 ∧ a ∈ s2)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
diff-int
,
diff-int-01
,
int-a
,
int-c
,
int-del-rew
,
int-empty
,
int-empty-01
,
int-empty-02
,
int-eq
,
int-ins
,
int-inserte
,
int-notempty
,
int-notempty-01
,
int-subs01
,
intdel-empty
,
intexin
,
intu-empty
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
Intersect
,
Used spec theorems:
Used simplifier rules: