Theorem ovig 6136

Description: The value of an operation class abstraction (weak version). (Unnecessary distinct variable restrictions were removed by David Abernethy, 19-Jun-2012.) (Contributed by NM, 14-Sep-1999.) (Revised by Mario Carneiro, 19-Dec-2013.)

Hypotheses

Ref	Expression
ovig.1	|- ( ( x = A /\ y = B /\ z = C ) -> ( ph <-> ps ) )
ovig.2	|- ( ( x e. R /\ y e. S ) -> E* z ph )
ovig.3	|- F = { <. <. x , y >. , z >. | ( ( x e. R /\ y e. S ) /\ ph ) }

Assertion

Ref	Expression
ovig	|- ( ( A e. R /\ B e. S /\ C e. D ) -> ( ps -> ( A F B ) = C ) )

Distinct variable groups:   x, y, z, A   x, B, y, z   x, C, y, z   x, R, y, z   x, S, y, z   ps, x, y, z

Allowed substitution hints:   ph( x, y, z)   D( x, y, z)   F( x, y, z)

Proof of Theorem ovig

Step	Hyp	Ref	Expression
1		3simpa 1018	. 2 |- ( ( A e. R /\ B e. S /\ C e. D ) -> ( A e. R /\ B e. S ) )
2		eleq1 2292	. . . . . 6 |- ( x = A -> ( x e. R <-> A e. R ) )
3		eleq1 2292	. . . . . 6 |- ( y = B -> ( y e. S <-> B e. S ) )
4	2, 3	bi2anan9 608	. . . . 5 |- ( ( x = A /\ y = B ) -> ( ( x e. R /\ y e. S ) <-> ( A e. R /\ B e. S ) ) )
5	4	3adant3 1041	. . . 4 |- ( ( x = A /\ y = B /\ z = C ) -> ( ( x e. R /\ y e. S ) <-> ( A e. R /\ B e. S ) ) )
6		ovig.1	. . . 4 |- ( ( x = A /\ y = B /\ z = C ) -> ( ph <-> ps ) )
7	5, 6	anbi12d 473	. . 3 |- ( ( x = A /\ y = B /\ z = C ) -> ( ( ( x e. R /\ y e. S ) /\ ph ) <-> ( ( A e. R /\ B e. S ) /\ ps ) ) )
8		ovig.2	. . . 4 |- ( ( x e. R /\ y e. S ) -> E* z ph )
9		moanimv 2153	. . . 4 |- ( E* z ( ( x e. R /\ y e. S ) /\ ph ) <-> ( ( x e. R /\ y e. S ) -> E* z ph ) )
10	8, 9	mpbir 146	. . 3 |- E* z ( ( x e. R /\ y e. S ) /\ ph )
11		ovig.3	. . 3 |- F = { <. <. x , y >. , z >. | ( ( x e. R /\ y e. S ) /\ ph ) }
12	7, 10, 11	ovigg 6135	. 2 |- ( ( A e. R /\ B e. S /\ C e. D ) -> ( ( ( A e. R /\ B e. S ) /\ ps ) -> ( A F B ) = C ) )
13	1, 12	mpand 429	1 |- ( ( A e. R /\ B e. S /\ C e. D ) -> ( ps -> ( A F B ) = C ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1002   = wceq 1395   E*wmo 2078   e. wcel 2200  (class class class)co 6011   {coprab 6012

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4203  ax-pow 4260  ax-pr 4295

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-sbc 3030  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3890  df-br 4085  df-opab 4147  df-id 4386  df-xp 4727  df-rel 4728  df-cnv 4729  df-co 4730  df-dm 4731  df-iota 5282  df-fun 5324  df-fv 5330  df-ov 6014  df-oprab 6015

This theorem is referenced by:  th3q  6802  addnnnq0  7657  mulnnnq0  7658  addsrpr  7953  mulsrpr  7954