[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 28 from proof down-except-refsize (
previous step
)
gstore1 ↓[n] = groupblock(gndx, lax, m), gstore0[n] = groupblock(gndx0, lax0, m0), n ∈ gstore0, ∀ n. (n ∈ gstore1 ↔ n ∈ gstore0) ∧ gstore1[n].gndlist = gstore0[n].gndlist ∧ gstore1[n].ladrlist = gstore0[n].ladrlist ⊦ n ∈ gstore1
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 4 terms: n
Additional information
Used terms: n