[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 3 from proof uniquelen (
previous step
)
unique_al(ay), ∀ a. ¬ a ∈ ay ⊦ ay = []
User applied rule all left
And obtained the following new goals
Proof step 4
:
unique_al(ay), ¬ ay.first.1 ∈ ay, ∀ a. ¬ a ∈ ay ⊦ ay = []
Rule argument
pos: left 2 terms: ay.first.1 abort: F discard: F computed: F
Additional information
Used terms: ay.first.1