[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 10 from proof size-one (
previous step
)
⊦ ∃ a0. ∀ a1. a1 = a ↔ a1 = a0
User applied rule exists right
And closed the goal!
Rule argument
pos: right 1 terms: a abort: F discard: T computed: T
Additional information
Used terms: a