Theorem ov2gf 6141

Description: The value of an operation class abstraction. A version of ovmpog 6151 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 2812	. . 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 2383	. . . . 5 |- F/ x G e. _V
7		ov2gf.5	. . . . . . . 8 |- F = ( x e. C , y e. D |-> R )
8		nfmpo1 6083	. . . . . . . 8 |- F/_ x ( x e. C , y e. D |-> R )
9	7, 8	nfcxfr 2369	. . . . . . 7 |- F/_ x F
10		nfcv 2372	. . . . . . 7 |- F/_ x y
11	2, 9, 10	nfov 6043	. . . . . 6 |- F/_ x ( A F y )
12	11, 5	nfeq 2380	. . . . 5 |- F/ x ( A F y ) = G
13	6, 12	nfim 1618	. . . 4 |- F/ x ( G e. _V -> ( A F y ) = G )
14		ov2gf.2	. . . . . 6 |- F/_ y S
15	14	nfel1 2383	. . . . 5 |- F/ y S e. _V
16		nfmpo2 6084	. . . . . . . 8 |- F/_ y ( x e. C , y e. D |-> R )
17	7, 16	nfcxfr 2369	. . . . . . 7 |- F/_ y F
18	3, 17, 4	nfov 6043	. . . . . 6 |- F/_ y ( A F B )
19	18, 14	nfeq 2380	. . . . 5 |- F/ y ( A F B ) = S
20	15, 19	nfim 1618	. . . 4 |- F/ y ( S e. _V -> ( A F B ) = S )
21		ov2gf.3	. . . . . 6 |- ( x = A -> R = G )
22	21	eleq1d 2298	. . . . 5 |- ( x = A -> ( R e. _V <-> G e. _V ) )
23		oveq1 6020	. . . . . 6 |- ( x = A -> ( x F y ) = ( A F y ) )
24	23, 21	eqeq12d 2244	. . . . 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 2298	. . . . 5 |- ( y = B -> ( G e. _V <-> S e. _V ) )
28		oveq2 6021	. . . . . 6 |- ( y = B -> ( A F y ) = ( A F B ) )
29	28, 26	eqeq12d 2244	. . . . 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 6139	. . . . 5 |- ( ( x e. C /\ y e. D /\ R e. _V ) -> ( x F y ) = R )
32	31	3expia 1229	. . . 4 |- ( ( x e. C /\ y e. D ) -> ( R e. _V -> ( x F y ) = R ) )
33	2, 3, 4, 13, 20, 25, 30, 32	vtocl2gaf 2869	. . 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 1224	1 |- ( ( A e. C /\ B e. D /\ S e. H ) -> ( A F B ) = S )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1002   = wceq 1395   e. wcel 2200   F/_wnfc 2359   _Vcvv 2800  (class class class)co 6013   e. cmpo 6015

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 617  ax-in2 618  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 4205  ax-pow 4262  ax-pr 4297  ax-setind 4633

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  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-ne 2401  df-ral 2513  df-rex 2514  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018

This theorem is referenced by: (None)