[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 1 from proof in-17 (conclusion)
⊦ a ∈ b ' ↔ a = b
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 2
:
⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))
Proof step 3
:
⊦ (∃ y, z. b ' = y + (a + z)) ↔ a = b
Rule argument
spec: list inst: name: In seq: ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)) subst: [x, a] → [b ', a] flags: rewrite, current
Additional information
Used terms: b ', a