[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 5 from proof vals-in (
previous step
)
val0 ∈ fis0 .vals ↔ (∃ sk. sk × val0 ∈ fis0), val ∈ fis0 .vals, sk × val ∈ fis0, ∀ val. val ∈ fis0 .vals ↔ (∃ sk. sk × val ∈ fis0) ⊦ ∃ sk. sk × val = sk0 × val0 ∨ sk × val ∈ fis0
Heuristic quantifier closing applied rule exists right
And closed the goal!
Rule argument
[EXRARG : pos: right 1, [QUANTTERMLIST : (sk)]]
Additional information
[[CONCRETESIMPRULES : ()], [EXTRATERMS : (sk)]]