[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 4 from proof mk-exists (
previous step
)
H = ∅, ∀ H0. # H0 < # H → true → (∃ rs, f. H0 = mk(rs, f)) ⊦ ∃ rs, f. H = mk(rs, f)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 5
:
∀ H0. # H0 < # ∅ → true → (∃ rs, f. H0 = mk(rs, f)) ⊦ ∃ rs, f. ∅ = mk(rs, f)
Rule argument
Additional information