[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 13 from proof lenequal (
previous step
)
# ax0 = # ay0 + # az, unique_al(ay0 + (a × d)' + az), unique_al(ax0), a0 ∈ ax0 → a0 ∈ az ∨ a0 ∈ ay0 ⊦ b = a, a ∈ ax0, b ∈ ax0, a ∈ ay0, a ∈ az, ¬ b ∈ az ∧ ¬ b ∈ ay0, (a0 ∈ ax0 → a0 ∈ ay0 ∨ a0 ∈ az) ∧ (b ∈ ay0 ∨ b ∈ az)
User applied rule case distinction
And closed the goal!
Rule argument
pos: right 7
Additional information