Database
BASIC STRUCTURES
Extensible structures
Slot definitions
tsetid
Next ⟩
tsetndxnn
Metamath Proof Explorer
Ascii
Unicode
Theorem
tsetid
Description:
Utility theorem: index-independent form of
df-tset
.
(Contributed by
NM
, 20-Oct-2012)
Ref
Expression
Assertion
tsetid
⊢
TopSet
=
Slot
TopSet
⁡
ndx
Proof
Step
Hyp
Ref
Expression
1
df-tset
⊢
TopSet
=
Slot
9
2
9nn
⊢
9
∈
ℕ
3
1
2
ndxid
⊢
TopSet
=
Slot
TopSet
⁡
ndx