[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
,
Proof step 7 from proof une-01 (
previous step
)
∀ a. ¬ a ∈ s1 ∧ ¬ a ∈ s2 ⊦ a ∈ s2, ¬ a ∈ s1 ∧ ¬ a0 ∈ s2
User applied rule all left
And obtained the following new goals
Proof step 8
:
¬ a ∈ s1 ∧ ¬ a ∈ s2, ∀ a. ¬ a ∈ s1 ∧ ¬ a ∈ s2 ⊦ a ∈ s2, ¬ a ∈ s1 ∧ ¬ a0 ∈ s2
Rule argument
pos: left 1 terms: a abort: F discard: F computed: T
Additional information
Used terms: a