Definition 5.3.
Let
(
A
j
)
j
∈
J
be a non-empty family of non-empty sets and
U
an
ultrafilter
on
J
.
Write
∏
j
∈
J
A
j
∕
U
to be
∏
j
∈
J
A
j
∕
∼
(where
∼
is defined as in Definition
5.1
).
[
(
a
j
)
j
∈
J
]
U
is the equivalence class of
(
a
j
)
j
∈
J
with respect to
∼
.
Let
B
j
⊆
A
j
for every
j
∈
J
. Then
[
(
B
j
)
j
∈
J
]
U
=
{
[
(
a
j
)
j
∈
J
]
∈
∏
j
∈
J
A
j
∕
U
:
{
j
∈
J
:
a
j
∈
B
j
}
∈
U
}
.