[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 9 from proof put-in (
previous step
)
∀ a1, d1, a2, d2. (a1 × d1 ∈ ax0[a2, d2] ↔ a1 = a2 ∧ d1 = d2) ∨ a1 × d1 ∈ ax0 ⊦ a0 × d0 = a1 × d1, a = a1, a0 × d0 ∈ ax0[a, d] ↔ a0 × d0 = a × d, a0 × d0 ∈ ax0
User applied rule all left
And closed the goal!
Rule argument
pos: left 1 terms: a0, d0, a, d abort: F discard: T computed: T
Additional information
Used simplifier rules: ⊦ a × d = a0 × d0 ↔ a = a0 ∧ d = d0; Used terms: a0, d0, a, d