[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 switch-aux (conclusion)
⊦ ¬ r ∈ rs → (R[rs, f, g(r; a)] ↔ R[rs, f, g])
System applied rule normalize
And obtained the following new goals
Proof step 2
:
⊦ R[rs, f, g(r; a)] ↔ R[rs, f, g], r ∈ rs
Rule argument
Additional information