Metamath Proof Explorer


Theorem opabresex0d

Description: A collection of ordered pairs, the class of all possible second components being a set, with a restriction of a binary relation is a set. (Contributed by Alexander van der Vekens, 1-Nov-2017) (Revised by AV, 1-Jan-2021)

Ref Expression
Hypotheses opabresex0d.x φxRyxC
opabresex0d.t φxRyθ
opabresex0d.y φxCy|θV
opabresex0d.c φCW
Assertion opabresex0d φxy|xRyψV

Proof

Step Hyp Ref Expression
1 opabresex0d.x φxRyxC
2 opabresex0d.t φxRyθ
3 opabresex0d.y φxCy|θV
4 opabresex0d.c φCW
5 1 2 jca φxRyxCθ
6 5 ex φxRyxCθ
7 6 alrimivv φxyxRyxCθ
8 3 elexd φxCy|θV
9 4 8 opabex3d φxy|xCθV
10 opabbrex xyxRyxCθxy|xCθVxy|xRyψV
11 7 9 10 syl2anc φxy|xRyψV