Theorem oprabex3 6362

Description: Existence of an operation class abstraction (special case). (Contributed by NM, 19-Oct-2004.)

Hypotheses

Ref	Expression
oprabex3.1	|- H e. _V
oprabex3.2	|- F = { <. <. x , y >. , z >. | ( ( x e. ( H X. H ) /\ y e. ( H X. H ) ) /\ E. w E. v E. u E. f ( ( x = <. w , v >. /\ y = <. u , f >. ) /\ z = R ) ) }

Assertion

Ref	Expression
oprabex3	|- F e. _V

Distinct variable groups:   x, y, z, w, v, u, f, H   x, R, y, z

Allowed substitution hints:   R( w, v, u, f)   F( x, y, z, w, v, u, f)

Proof of Theorem oprabex3

Step	Hyp	Ref	Expression
1		oprabex3.1	. . 3 |- H e. _V
2	1, 1	xpex 4891	. 2 |- ( H X. H ) e. _V
3		moeq 3001	. . . . . 6 |- E* z z = R
4	3	mosubop 4841	. . . . 5 |- E* z E. u E. f ( y = <. u , f >. /\ z = R )
5	4	mosubop 4841	. . . 4 |- E* z E. w E. v ( x = <. w , v >. /\ E. u E. f ( y = <. u , f >. /\ z = R ) )
6		anass 405	. . . . . . . 8 |- ( ( ( x = <. w , v >. /\ y = <. u , f >. ) /\ z = R ) <-> ( x = <. w , v >. /\ ( y = <. u , f >. /\ z = R ) ) )
7	6	2exbii 1659	. . . . . . 7 |- ( E. u E. f ( ( x = <. w , v >. /\ y = <. u , f >. ) /\ z = R ) <-> E. u E. f ( x = <. w , v >. /\ ( y = <. u , f >. /\ z = R ) ) )
8		19.42vv 1967	. . . . . . 7 |- ( E. u E. f ( x = <. w , v >. /\ ( y = <. u , f >. /\ z = R ) ) <-> ( x = <. w , v >. /\ E. u E. f ( y = <. u , f >. /\ z = R ) ) )
9	7, 8	bitri 184	. . . . . 6 |- ( E. u E. f ( ( x = <. w , v >. /\ y = <. u , f >. ) /\ z = R ) <-> ( x = <. w , v >. /\ E. u E. f ( y = <. u , f >. /\ z = R ) ) )
10	9	2exbii 1659	. . . . 5 |- ( E. w E. v E. u E. f ( ( x = <. w , v >. /\ y = <. u , f >. ) /\ z = R ) <-> E. w E. v ( x = <. w , v >. /\ E. u E. f ( y = <. u , f >. /\ z = R ) ) )
11	10	mobii 2123	. . . 4 |- ( E* z E. w E. v E. u E. f ( ( x = <. w , v >. /\ y = <. u , f >. ) /\ z = R ) <-> E* z E. w E. v ( x = <. w , v >. /\ E. u E. f ( y = <. u , f >. /\ z = R ) ) )
12	5, 11	mpbir 146	. . 3 |- E* z E. w E. v E. u E. f ( ( x = <. w , v >. /\ y = <. u , f >. ) /\ z = R )
13	12	a1i 9	. 2 |- ( ( x e. ( H X. H ) /\ y e. ( H X. H ) ) -> E* z E. w E. v E. u E. f ( ( x = <. w , v >. /\ y = <. u , f >. ) /\ z = R ) )
14		oprabex3.2	. 2 |- F = { <. <. x , y >. , z >. | ( ( x e. ( H X. H ) /\ y e. ( H X. H ) ) /\ E. w E. v E. u E. f ( ( x = <. w , v >. /\ y = <. u , f >. ) /\ z = R ) ) }
15	2, 2, 13, 14	oprabex 6361	1 |- F e. _V

This proof depends on syntax axioms:   /\ wa 104   = wceq 1402   E.wex 1545   E*wmo 2087   e. wcel 2209   _Vcvv 2821   <.cop 3712   X. cxp 4772   {coprab 6086

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-coll 4246  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-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-iun 4014  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-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-oprab 6089

This theorem is used by:  addvalex  8211