[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 merge-owned-rewrite (conclusion)
⊦ (a[P] * true)[rs, f, g] ∧ a0 ≠ a → ((a0[P0] * true)[rs, f, g] ↔ (a[P] * a0[P0] * true)[rs, f, g])
System applied rule normalize
And obtained the following new goals
Proof step 2
:
(a[P] * true)[rs, f, g] ⊦ (a0[P0] * true)[rs, f, g] ↔ (a[P] * a0[P0] * true)[rs, f, g], a0 = a
Rule argument
Additional information