Theorem dfoprab3 6425

Description: Operation class abstraction expressed without existential quantifiers. (Contributed by NM, 16-Dec-2008.)

Hypothesis

Ref	Expression
dfoprab3.1	|- ( w = <. x , y >. -> ( ph <-> ps ) )

Assertion

Ref	Expression
dfoprab3	|- { <. w , z >. | ( w e. ( _V X. _V ) /\ ph ) } = { <. <. x , y >. , z >. | ps }

Distinct variable groups:   x, y, ph   ps, w   x, z, w, y

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

Proof of Theorem dfoprab3

Step	Hyp	Ref	Expression
1		dfoprab3s 6424	. 2 |- { <. <. x , y >. , z >. | ps } = { <. w , z >. | ( w e. ( _V X. _V ) /\ [. ( 1st ` w ) / x ]. [. ( 2nd ` w ) / y ]. ps ) }
2		vex 2824	. . . . . 6 |- w e. _V
3		1stexg 6401	. . . . . 6 |- ( w e. _V -> ( 1st ` w ) e. _V )
4	2, 3	ax-mp 5	. . . . 5 |- ( 1st ` w ) e. _V
5		2ndexg 6402	. . . . . 6 |- ( w e. _V -> ( 2nd ` w ) e. _V )
6	2, 5	ax-mp 5	. . . . 5 |- ( 2nd ` w ) e. _V
7		eqcom 2240	. . . . . . . . . 10 |- ( x = ( 1st ` w ) <-> ( 1st ` w ) = x )
8		eqcom 2240	. . . . . . . . . 10 |- ( y = ( 2nd ` w ) <-> ( 2nd ` w ) = y )
9	7, 8	anbi12i 464	. . . . . . . . 9 |- ( ( x = ( 1st ` w ) /\ y = ( 2nd ` w ) ) <-> ( ( 1st ` w ) = x /\ ( 2nd ` w ) = y ) )
10		eqopi 6406	. . . . . . . . 9 |- ( ( w e. ( _V X. _V ) /\ ( ( 1st ` w ) = x /\ ( 2nd ` w ) = y ) ) -> w = <. x , y >. )
11	9, 10	sylan2b 287	. . . . . . . 8 |- ( ( w e. ( _V X. _V ) /\ ( x = ( 1st ` w ) /\ y = ( 2nd ` w ) ) ) -> w = <. x , y >. )
12		dfoprab3.1	. . . . . . . 8 |- ( w = <. x , y >. -> ( ph <-> ps ) )
13	11, 12	syl 14	. . . . . . 7 |- ( ( w e. ( _V X. _V ) /\ ( x = ( 1st ` w ) /\ y = ( 2nd ` w ) ) ) -> ( ph <-> ps ) )
14	13	bicomd 141	. . . . . 6 |- ( ( w e. ( _V X. _V ) /\ ( x = ( 1st ` w ) /\ y = ( 2nd ` w ) ) ) -> ( ps <-> ph ) )
15	14	ex 115	. . . . 5 |- ( w e. ( _V X. _V ) -> ( ( x = ( 1st ` w ) /\ y = ( 2nd ` w ) ) -> ( ps <-> ph ) ) )
16	4, 6, 15	sbc2iedv 3124	. . . 4 |- ( w e. ( _V X. _V ) -> ( [. ( 1st ` w ) / x ]. [. ( 2nd ` w ) / y ]. ps <-> ph ) )
17	16	pm5.32i 458	. . 3 |- ( ( w e. ( _V X. _V ) /\ [. ( 1st ` w ) / x ]. [. ( 2nd ` w ) / y ]. ps ) <-> ( w e. ( _V X. _V ) /\ ph ) )
18	17	opabbii 4198	. 2 |- { <. w , z >. | ( w e. ( _V X. _V ) /\ [. ( 1st ` w ) / x ]. [. ( 2nd ` w ) / y ]. ps ) } = { <. w , z >. | ( w e. ( _V X. _V ) /\ ph ) }
19	1, 18	eqtr2i 2260	1 |- { <. w , z >. | ( w e. ( _V X. _V ) /\ ph ) } = { <. <. x , y >. , z >. | ps }

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   _Vcvv 2821   [.wsbc 3051   <.cop 3712   {copab 4191   X. cxp 4772   ` cfv 5377   {coprab 6086   1stc1st 6372   2ndc2nd 6373

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  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fo 5383  df-fv 5385  df-oprab 6089  df-1st 6374  df-2nd 6375

This theorem is used by:  dfoprab4  6426  df1st2  6455  df2nd2  6456