Theorem ov2gf 6145

Description: The value of an operation class abstraction. A version of ovmpog 6155 using bound-variable hypotheses. (Contributed by NM, 17-Aug-2006.) (Revised by Mario Carneiro, 19-Dec-2013.)

Hypotheses

Ref	Expression
ov2gf.a	|- F/_ x A
ov2gf.c	|- F/_ y A
ov2gf.d	|- F/_ y B
ov2gf.1	|- F/_ x G
ov2gf.2	|- F/_ y S
ov2gf.3	|- ( x = A -> R = G )
ov2gf.4	|- ( y = B -> G = S )
ov2gf.5	|- F = ( x e. C , y e. D |-> R )

Assertion

Ref	Expression
ov2gf	|- ( ( A e. C /\ B e. D /\ S e. H ) -> ( A F B ) = S )

Distinct variable groups:   x, y, C   x, D, y

Allowed substitution hints:   A( x, y)   B( x, y)   R( x, y)   S( x, y)   F( x, y)   G( x, y)   H( x, y)

Proof of Theorem ov2gf

Step	Hyp	Ref	Expression
1		elex 2814	. . 3 |- ( S e. H -> S e. _V )
2		ov2gf.a	. . . 4 |- F/_ x A
3		ov2gf.c	. . . 4 |- F/_ y A
4		ov2gf.d	. . . 4 |- F/_ y B
5		ov2gf.1	. . . . . 6 |- F/_ x G
6	5	nfel1 2385	. . . . 5 |- F/ x G e. _V
7		ov2gf.5	. . . . . . . 8 |- F = ( x e. C , y e. D |-> R )
8		nfmpo1 6087	. . . . . . . 8 |- F/_ x ( x e. C , y e. D |-> R )
9	7, 8	nfcxfr 2371	. . . . . . 7 |- F/_ x F
10		nfcv 2374	. . . . . . 7 |- F/_ x y
11	2, 9, 10	nfov 6047	. . . . . 6 |- F/_ x ( A F y )
12	11, 5	nfeq 2382	. . . . 5 |- F/ x ( A F y ) = G
13	6, 12	nfim 1620	. . . 4 |- F/ x ( G e. _V -> ( A F y ) = G )
14		ov2gf.2	. . . . . 6 |- F/_ y S
15	14	nfel1 2385	. . . . 5 |- F/ y S e. _V
16		nfmpo2 6088	. . . . . . . 8 |- F/_ y ( x e. C , y e. D |-> R )
17	7, 16	nfcxfr 2371	. . . . . . 7 |- F/_ y F
18	3, 17, 4	nfov 6047	. . . . . 6 |- F/_ y ( A F B )
19	18, 14	nfeq 2382	. . . . 5 |- F/ y ( A F B ) = S
20	15, 19	nfim 1620	. . . 4 |- F/ y ( S e. _V -> ( A F B ) = S )
21		ov2gf.3	. . . . . 6 |- ( x = A -> R = G )
22	21	eleq1d 2300	. . . . 5 |- ( x = A -> ( R e. _V <-> G e. _V ) )
23		oveq1 6024	. . . . . 6 |- ( x = A -> ( x F y ) = ( A F y ) )
24	23, 21	eqeq12d 2246	. . . . 5 |- ( x = A -> ( ( x F y ) = R <-> ( A F y ) = G ) )
25	22, 24	imbi12d 234	. . . 4 |- ( x = A -> ( ( R e. _V -> ( x F y ) = R ) <-> ( G e. _V -> ( A F y ) = G ) ) )
26		ov2gf.4	. . . . . 6 |- ( y = B -> G = S )
27	26	eleq1d 2300	. . . . 5 |- ( y = B -> ( G e. _V <-> S e. _V ) )
28		oveq2 6025	. . . . . 6 |- ( y = B -> ( A F y ) = ( A F B ) )
29	28, 26	eqeq12d 2246	. . . . 5 |- ( y = B -> ( ( A F y ) = G <-> ( A F B ) = S ) )
30	27, 29	imbi12d 234	. . . 4 |- ( y = B -> ( ( G e. _V -> ( A F y ) = G ) <-> ( S e. _V -> ( A F B ) = S ) ) )
31	7	ovmpt4g 6143	. . . . 5 |- ( ( x e. C /\ y e. D /\ R e. _V ) -> ( x F y ) = R )
32	31	3expia 1231	. . . 4 |- ( ( x e. C /\ y e. D ) -> ( R e. _V -> ( x F y ) = R ) )
33	2, 3, 4, 13, 20, 25, 30, 32	vtocl2gaf 2871	. . 3 |- ( ( A e. C /\ B e. D ) -> ( S e. _V -> ( A F B ) = S ) )
34	1, 33	syl5 32	. 2 |- ( ( A e. C /\ B e. D ) -> ( S e. H -> ( A F B ) = S ) )
35	34	3impia 1226	1 |- ( ( A e. C /\ B e. D /\ S e. H ) -> ( A F B ) = S )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1004   = wceq 1397   e. wcel 2202   F/_wnfc 2361   _Vcvv 2802  (class class class)co 6017   e. cmpo 6019

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-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-setind 4635

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022

This theorem is referenced by: (None)