Proof step 14 from proof ocs-same-length-all (previous step)
∀ b. b = a0 ∨ b ∈ x0 → b = a, x0 = mklist(a, # x0) ↔ (∀ b. b ∈ x0 → b = a), ∀ a. x0 = mklist(a, # x0) ↔ (∀ b. b ∈ x0 → b = a)
⊦ a0 = a ∧ x0 = mklist(a, # x0)
User applied rule all left
And closed the goal!
Rule argument
pos: left 1 terms: a0 abort: F discard: F computed: T