Proposition 5.4.
Assuming that:
(
A
j
)
j
∈
J
,
(
B
j
)
j
∈
J
satisfy
B
j
⊆
A
j
for all
j
(
a
j
)
j
∈
J
,
(
b
j
)
j
∈
J
∈
∏
j
∈
J
A
j
satisfying
(
a
j
)
j
∈
J
∼
(
b
j
)
j
∈
J
Then
{
j
∈
J
:
a
j
∈
B
j
}
∈
U
if and only if
{
j
∈
J
:
b
j
∈
B
j
}
∈
U
.