Theorem fnmpoovd 6229

Description: A function with a Cartesian product as domain is a mapping with two arguments defined by its operation values. (Contributed by AV, 20-Feb-2019.) (Revised by AV, 3-Jul-2022.)

Hypotheses

Ref	Expression
fnmpoovd.m	|- ( ph -> M Fn ( A X. B ) )
fnmpoovd.s	|- ( ( i = a /\ j = b ) -> D = C )
fnmpoovd.d	|- ( ( ph /\ i e. A /\ j e. B ) -> D e. U )
fnmpoovd.c	|- ( ( ph /\ a e. A /\ b e. B ) -> C e. V )

Assertion

Ref	Expression
fnmpoovd	|- ( ph -> ( M = ( a e. A , b e. B |-> C ) <-> A. i e. A A. j e. B ( i M j ) = D ) )

Distinct variable groups:   A, a, b, i, j   B, a, b, i, j   C, i, j   D, a, b   i, M, j   ph, a, b, i, j

Allowed substitution hints:   C( a, b)   D( i, j)   U( i, j, a, b)   M( a, b)   V( i, j, a, b)

Proof of Theorem fnmpoovd

Step	Hyp	Ref	Expression
1		fnmpoovd.m	. . 3 |- ( ph -> M Fn ( A X. B ) )
2		fnmpoovd.c	. . . . . 6 |- ( ( ph /\ a e. A /\ b e. B ) -> C e. V )
3	2	3expb 1205	. . . . 5 |- ( ( ph /\ ( a e. A /\ b e. B ) ) -> C e. V )
4	3	ralrimivva 2569	. . . 4 |- ( ph -> A. a e. A A. b e. B C e. V )
5		eqid 2187	. . . . 5 |- ( a e. A , b e. B |-> C ) = ( a e. A , b e. B |-> C )
6	5	fnmpo 6216	. . . 4 |- ( A. a e. A A. b e. B C e. V -> ( a e. A , b e. B |-> C ) Fn ( A X. B ) )
7	4, 6	syl 14	. . 3 |- ( ph -> ( a e. A , b e. B |-> C ) Fn ( A X. B ) )
8		eqfnov2 5995	. . 3 |- ( ( M Fn ( A X. B ) /\ ( a e. A , b e. B |-> C ) Fn ( A X. B ) ) -> ( M = ( a e. A , b e. B |-> C ) <-> A. i e. A A. j e. B ( i M j ) = ( i ( a e. A , b e. B |-> C ) j ) ) )
9	1, 7, 8	syl2anc 411	. 2 |- ( ph -> ( M = ( a e. A , b e. B |-> C ) <-> A. i e. A A. j e. B ( i M j ) = ( i ( a e. A , b e. B |-> C ) j ) ) )
10		nfcv 2329	. . . . . . . 8 |- F/_ a D
11		nfcv 2329	. . . . . . . 8 |- F/_ b D
12		nfcv 2329	. . . . . . . 8 |- F/_ i C
13		nfcv 2329	. . . . . . . 8 |- F/_ j C
14		fnmpoovd.s	. . . . . . . 8 |- ( ( i = a /\ j = b ) -> D = C )
15	10, 11, 12, 13, 14	cbvmpo 5967	. . . . . . 7 |- ( i e. A , j e. B |-> D ) = ( a e. A , b e. B |-> C )
16	15	eqcomi 2191	. . . . . 6 |- ( a e. A , b e. B |-> C ) = ( i e. A , j e. B |-> D )
17	16	a1i 9	. . . . 5 |- ( ph -> ( a e. A , b e. B |-> C ) = ( i e. A , j e. B |-> D ) )
18	17	oveqd 5905	. . . 4 |- ( ph -> ( i ( a e. A , b e. B |-> C ) j ) = ( i ( i e. A , j e. B |-> D ) j ) )
19	18	eqeq2d 2199	. . 3 |- ( ph -> ( ( i M j ) = ( i ( a e. A , b e. B |-> C ) j ) <-> ( i M j ) = ( i ( i e. A , j e. B |-> D ) j ) ) )
20	19	2ralbidv 2511	. 2 |- ( ph -> ( A. i e. A A. j e. B ( i M j ) = ( i ( a e. A , b e. B |-> C ) j ) <-> A. i e. A A. j e. B ( i M j ) = ( i ( i e. A , j e. B |-> D ) j ) ) )
21		simprl 529	. . . . 5 |- ( ( ph /\ ( i e. A /\ j e. B ) ) -> i e. A )
22		simprr 531	. . . . 5 |- ( ( ph /\ ( i e. A /\ j e. B ) ) -> j e. B )
23		fnmpoovd.d	. . . . . 6 |- ( ( ph /\ i e. A /\ j e. B ) -> D e. U )
24	23	3expb 1205	. . . . 5 |- ( ( ph /\ ( i e. A /\ j e. B ) ) -> D e. U )
25		eqid 2187	. . . . . 6 |- ( i e. A , j e. B |-> D ) = ( i e. A , j e. B |-> D )
26	25	ovmpt4g 6010	. . . . 5 |- ( ( i e. A /\ j e. B /\ D e. U ) -> ( i ( i e. A , j e. B |-> D ) j ) = D )
27	21, 22, 24, 26	syl3anc 1248	. . . 4 |- ( ( ph /\ ( i e. A /\ j e. B ) ) -> ( i ( i e. A , j e. B |-> D ) j ) = D )
28	27	eqeq2d 2199	. . 3 |- ( ( ph /\ ( i e. A /\ j e. B ) ) -> ( ( i M j ) = ( i ( i e. A , j e. B |-> D ) j ) <-> ( i M j ) = D ) )
29	28	2ralbidva 2509	. 2 |- ( ph -> ( A. i e. A A. j e. B ( i M j ) = ( i ( i e. A , j e. B |-> D ) j ) <-> A. i e. A A. j e. B ( i M j ) = D ) )
30	9, 20, 29	3bitrd 214	1 |- ( ph -> ( M = ( a e. A , b e. B |-> C ) <-> A. i e. A A. j e. B ( i M j ) = D ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 979   = wceq 1363   e. wcel 2158   A.wral 2465   X. cxp 4636   Fn wfn 5223  (class class class)co 5888   e. cmpo 5890

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 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548

This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-ral 2470  df-rex 2471  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-id 4305  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-fv 5236  df-ov 5891  df-oprab 5892  df-mpo 5893  df-1st 6154  df-2nd 6155

This theorem is referenced by: (None)