[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 4 from proof rm-vl-lebrefs-subseteq (
previous step
)
⊦ q - v ⊆ q, (q - v).lebrefs ⊆ q.lebrefs
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 5
:
⊦ q - v ⊆ q
Rule argument
spec: <toplevel> name: rm-v-subseteq seq: ⊦ q - v ⊆ q subst: [v, q] → [v, q] flags: <all paths>
Additional information
Used terms: v, q