[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 fidb-diff-one (conclusion)
⊦ fid0 ∈ fidb ∧ fid0 ≠ fid1 → fid0 ∈ fidb \ {fid1}
System applied rule normalize
And obtained the following new goals
Proof step 2
:
fid0 ∈ fidb ⊦ fid0 = fid1, fid0 ∈ fidb \ {fid1}
Rule argument
Additional information