Theorem ov2gf 6001

Description: The value of an operation class abstraction. A version of ovmpog 6011 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 2750	. . 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 2330	. . . . 5 |- F/ x G e. _V
7		ov2gf.5	. . . . . . . 8 |- F = ( x e. C , y e. D |-> R )
8		nfmpo1 5944	. . . . . . . 8 |- F/_ x ( x e. C , y e. D |-> R )
9	7, 8	nfcxfr 2316	. . . . . . 7 |- F/_ x F
10		nfcv 2319	. . . . . . 7 |- F/_ x y
11	2, 9, 10	nfov 5907	. . . . . 6 |- F/_ x ( A F y )
12	11, 5	nfeq 2327	. . . . 5 |- F/ x ( A F y ) = G
13	6, 12	nfim 1572	. . . 4 |- F/ x ( G e. _V -> ( A F y ) = G )
14		ov2gf.2	. . . . . 6 |- F/_ y S
15	14	nfel1 2330	. . . . 5 |- F/ y S e. _V
16		nfmpo2 5945	. . . . . . . 8 |- F/_ y ( x e. C , y e. D |-> R )
17	7, 16	nfcxfr 2316	. . . . . . 7 |- F/_ y F
18	3, 17, 4	nfov 5907	. . . . . 6 |- F/_ y ( A F B )
19	18, 14	nfeq 2327	. . . . 5 |- F/ y ( A F B ) = S
20	15, 19	nfim 1572	. . . 4 |- F/ y ( S e. _V -> ( A F B ) = S )
21		ov2gf.3	. . . . . 6 |- ( x = A -> R = G )
22	21	eleq1d 2246	. . . . 5 |- ( x = A -> ( R e. _V <-> G e. _V ) )
23		oveq1 5884	. . . . . 6 |- ( x = A -> ( x F y ) = ( A F y ) )
24	23, 21	eqeq12d 2192	. . . . 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 2246	. . . . 5 |- ( y = B -> ( G e. _V <-> S e. _V ) )
28		oveq2 5885	. . . . . 6 |- ( y = B -> ( A F y ) = ( A F B ) )
29	28, 26	eqeq12d 2192	. . . . 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 5999	. . . . 5 |- ( ( x e. C /\ y e. D /\ R e. _V ) -> ( x F y ) = R )
32	31	3expia 1205	. . . 4 |- ( ( x e. C /\ y e. D ) -> ( R e. _V -> ( x F y ) = R ) )
33	2, 3, 4, 13, 20, 25, 30, 32	vtocl2gaf 2806	. . 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 1200	1 |- ( ( A e. C /\ B e. D /\ S e. H ) -> ( A F B ) = S )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 978   = wceq 1353   e. wcel 2148   F/_wnfc 2306   _Vcvv 2739  (class class class)co 5877   e. cmpo 5879

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-setind 4538

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-v 2741  df-sbc 2965  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-iota 5180  df-fun 5220  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882

This theorem is referenced by: (None)