[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 9 from proof exists-shift (
previous step
)
∃ H0, H1. H0 ⊥ H1 ∧ H = H0 ∪ H1 ∧ Pa(a)(H0) ∧ P(H1) ⊦ ((_∃ Pa * P))(H)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 10
:
P(H0), Pa(a)(H1), H1 ⊥ H0 ⊦ ((_∃ Pa * P))(H1 ∪ H0)
Rule argument
Additional information