Theorem ov2gf 6178

Description: The value of an operation class abstraction. A version of ovmpog 6188 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 2825	. . 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 2395	. . . . 5 |- F/ x G e. _V
7		ov2gf.5	. . . . . . . 8 |- F = ( x e. C , y e. D |-> R )
8		nfmpo1 6120	. . . . . . . 8 |- F/_ x ( x e. C , y e. D |-> R )
9	7, 8	nfcxfr 2381	. . . . . . 7 |- F/_ x F
10		nfcv 2384	. . . . . . 7 |- F/_ x y
11	2, 9, 10	nfov 6080	. . . . . 6 |- F/_ x ( A F y )
12	11, 5	nfeq 2392	. . . . 5 |- F/ x ( A F y ) = G
13	6, 12	nfim 1621	. . . 4 |- F/ x ( G e. _V -> ( A F y ) = G )
14		ov2gf.2	. . . . . 6 |- F/_ y S
15	14	nfel1 2395	. . . . 5 |- F/ y S e. _V
16		nfmpo2 6121	. . . . . . . 8 |- F/_ y ( x e. C , y e. D |-> R )
17	7, 16	nfcxfr 2381	. . . . . . 7 |- F/_ y F
18	3, 17, 4	nfov 6080	. . . . . 6 |- F/_ y ( A F B )
19	18, 14	nfeq 2392	. . . . 5 |- F/ y ( A F B ) = S
20	15, 19	nfim 1621	. . . 4 |- F/ y ( S e. _V -> ( A F B ) = S )
21		ov2gf.3	. . . . . 6 |- ( x = A -> R = G )
22	21	eleq1d 2301	. . . . 5 |- ( x = A -> ( R e. _V <-> G e. _V ) )
23		oveq1 6057	. . . . . 6 |- ( x = A -> ( x F y ) = ( A F y ) )
24	23, 21	eqeq12d 2247	. . . . 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 2301	. . . . 5 |- ( y = B -> ( G e. _V <-> S e. _V ) )
28		oveq2 6058	. . . . . 6 |- ( y = B -> ( A F y ) = ( A F B ) )
29	28, 26	eqeq12d 2247	. . . . 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 6176	. . . . 5 |- ( ( x e. C /\ y e. D /\ R e. _V ) -> ( x F y ) = R )
32	31	3expia 1232	. . . 4 |- ( ( x e. C /\ y e. D ) -> ( R e. _V -> ( x F y ) = R ) )
33	2, 3, 4, 13, 20, 25, 30, 32	vtocl2gaf 2882	. . 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 1227	1 |- ( ( A e. C /\ B e. D /\ S e. H ) -> ( A F B ) = S )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   e. wcel 2203   F/_wnfc 2371   _Vcvv 2813  (class class class)co 6050   e. cmpo 6052

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-setind 4659

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055

This theorem is referenced by: (None)