[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 mod-other-both (conclusion)
⊦ g(r) ≠ a ∧ (a[P] * R)[rs, f, g] → (a[P] * true)[rs, f(r; o), g(r; a0)]
System applied rule normalize
And obtained the following new goals
Proof step 2
:
(a[P] * R)[rs, f, g] ⊦ g(r) = a, (a[P] * true)[rs, f(r; o), g(r; a0)]
Rule argument
Additional information