Theorem bj-prexg 15408

Description: Proof of prexg 4240 using only bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-prexg	|- ( ( A e. V /\ B e. W ) -> { A , B } e. _V )

Proof of Theorem bj-prexg

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		preq2 3696	. . . . . 6 |- ( y = B -> { x , y } = { x , B } )
2	1	eleq1d 2262	. . . . 5 |- ( y = B -> ( { x , y } e. _V <-> { x , B } e. _V ) )
3		bj-zfpair2 15407	. . . . 5 |- { x , y } e. _V
4	2, 3	vtoclg 2820	. . . 4 |- ( B e. W -> { x , B } e. _V )
5		preq1 3695	. . . . 5 |- ( x = A -> { x , B } = { A , B } )
6	5	eleq1d 2262	. . . 4 |- ( x = A -> ( { x , B } e. _V <-> { A , B } e. _V ) )
7	4, 6	imbitrid 154	. . 3 |- ( x = A -> ( B e. W -> { A , B } e. _V ) )
8	7	vtocleg 2831	. 2 |- ( A e. V -> ( B e. W -> { A , B } e. _V ) )
9	8	imp 124	1 |- ( ( A e. V /\ B e. W ) -> { A , B } e. _V )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1364   e. wcel 2164   _Vcvv 2760   {cpr 3619

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-pr 4238  ax-bdor 15313  ax-bdeq 15317  ax-bdsep 15381

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-v 2762  df-un 3157  df-sn 3624  df-pr 3625

This theorem is referenced by:  bj-snexg  15409  bj-unex  15416