Theorem inopab 4912

Description: Intersection of two ordered pair class abstractions. (Contributed by NM, 30-Sep-2002.)

Assertion

Ref	Expression
inopab	|- ( { <. x , y >. | ph } i^i { <. x , y >. | ps } ) = { <. x , y >. | ( ph /\ ps ) }

Distinct variable group:   x, y

Allowed substitution hints:   ph( x, y)   ps( x, y)

Proof of Theorem inopab

Dummy variables w z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relopab 4906	. . 3 |- Rel { <. x , y >. | ph }
2		relin1 4895	. . 3 |- ( Rel { <. x , y >. | ph } -> Rel ( { <. x , y >. | ph } i^i { <. x , y >. | ps } ) )
3	1, 2	ax-mp 5	. 2 |- Rel ( { <. x , y >. | ph } i^i { <. x , y >. | ps } )
4		relopab 4906	. 2 |- Rel { <. x , y >. | ( ph /\ ps ) }
5		sban 2015	. . . 4 |- ( [ w / y ] ( [ z / x ] ph /\ [ z / x ] ps ) <-> ( [ w / y ] [ z / x ] ph /\ [ w / y ] [ z / x ] ps ) )
6		sban 2015	. . . . 5 |- ( [ z / x ] ( ph /\ ps ) <-> ( [ z / x ] ph /\ [ z / x ] ps ) )
7	6	sbbii 1818	. . . 4 |- ( [ w / y ] [ z / x ] ( ph /\ ps ) <-> [ w / y ] ( [ z / x ] ph /\ [ z / x ] ps ) )
8		opelopabsbALT 4401	. . . . 5 |- ( <. z , w >. e. { <. x , y >. | ph } <-> [ w / y ] [ z / x ] ph )
9		opelopabsbALT 4401	. . . . 5 |- ( <. z , w >. e. { <. x , y >. | ps } <-> [ w / y ] [ z / x ] ps )
10	8, 9	anbi12i 464	. . . 4 |- ( ( <. z , w >. e. { <. x , y >. | ph } /\ <. z , w >. e. { <. x , y >. | ps } ) <-> ( [ w / y ] [ z / x ] ph /\ [ w / y ] [ z / x ] ps ) )
11	5, 7, 10	3bitr4ri 213	. . 3 |- ( ( <. z , w >. e. { <. x , y >. | ph } /\ <. z , w >. e. { <. x , y >. | ps } ) <-> [ w / y ] [ z / x ] ( ph /\ ps ) )
12		elin 3412	. . 3 |- ( <. z , w >. e. ( { <. x , y >. | ph } i^i { <. x , y >. | ps } ) <-> ( <. z , w >. e. { <. x , y >. | ph } /\ <. z , w >. e. { <. x , y >. | ps } ) )
13		opelopabsbALT 4401	. . 3 |- ( <. z , w >. e. { <. x , y >. | ( ph /\ ps ) } <-> [ w / y ] [ z / x ] ( ph /\ ps ) )
14	11, 12, 13	3bitr4i 212	. 2 |- ( <. z , w >. e. ( { <. x , y >. | ph } i^i { <. x , y >. | ps } ) <-> <. z , w >. e. { <. x , y >. | ( ph /\ ps ) } )
15	3, 4, 14	eqrelriiv 4869	1 |- ( { <. x , y >. | ph } i^i { <. x , y >. | ps } ) = { <. x , y >. | ( ph /\ ps ) }

This proof depends on syntax axioms:   /\ wa 104   = wceq 1402   [wsb 1815   e. wcel 2209   i^i cin 3219   <.cop 3712   {copab 4191   Rel wrel 4779

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-opab 4193  df-xp 4780  df-rel 4781

This theorem is used by:  inxp  4914  resopab  5107  cnvin  5195  fndmin  5816  enq0enq  7798  lgsquadlem3  16198