[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 1 from proof in-01 (conclusion)
⊦ a × d ∈ ax → a ∈ ax
User applied rule insert lemma
And obtained the following new goals
Proof step 2
:
⊦ a ∈ ax ↔ (∃ d. a × d ∈ ax)
Proof step 3
:
a ∈ ax ↔ (∃ d. a × d ∈ ax) ⊦ a × d ∈ ax → a ∈ ax
Rule argument
spec: assoclist inst: name: inassoc seq: ⊦ a ∈ ax ↔ (∃ d. a × d ∈ ax) subst: [a, ax] → [a, ax] flags: current, []
Additional information
Used terms: a, ax