[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 rtc+-unfold-last (conclusion)
⊦ p+(a, b) ↔ (∃ c. p*(a, c) ∧ p(c, b))
User applied rule case distinction
And obtained the following new goals
Proof step 2
:
p+(a, b) ⊦ ∃ c. p*(a, c) ∧ p(c, b)
Proof step 17
:
∃ c. p*(a, c) ∧ p(c, b) ⊦ p+(a, b)
Rule argument
pos: right 1
Additional information