[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 14 from proof embed-and (
previous step
)
⊦ P0(mk(rs, f)) ∧ P1(mk(rs, f)) ∧ (∀ r. r ∈ rs → g(r) = a) ↔ (P0(mk(rs, f)) ∧ (∀ r. r ∈ rs → g(r) = a)) ∧ a[P1](mk(rs, f, g))
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 15
:
P0(mk(rs, f)), ∀ r. r ∈ rs → g(r) = a ⊦ P1(mk(rs, f)) ↔ a[P1](mk(rs, f, g))
Rule argument
Additional information