[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 6 from proof insfirst (
previous step
)
∀ a, d, ax0, d0. (ax1 + (a × d)' + ax0)[a, d0] = ax1 + (a × d0)' + ax0 ∨ a ∈ ax1 ⊦ a = a0, (ax1 + (a × d)' + ax0)[a, d0] = ax1 + (a × d0)' + ax0, a ∈ ax1
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 1 terms: a, d, ax0, d0
Additional information
Used terms: a, d, ax0, d0