Theorem fnmpoovd 6183

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 1194	. . . . 5 |- ( ( ph /\ ( a e. A /\ b e. B ) ) -> C e. V )
4	3	ralrimivva 2548	. . . 4 |- ( ph -> A. a e. A A. b e. B C e. V )
5		eqid 2165	. . . . 5 |- ( a e. A , b e. B |-> C ) = ( a e. A , b e. B |-> C )
6	5	fnmpo 6170	. . . 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 5949	. . 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 409	. 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 2308	. . . . . . . 8 |- F/_ a D
11		nfcv 2308	. . . . . . . 8 |- F/_ b D
12		nfcv 2308	. . . . . . . 8 |- F/_ i C
13		nfcv 2308	. . . . . . . 8 |- F/_ j C
14		fnmpoovd.s	. . . . . . . 8 |- ( ( i = a /\ j = b ) -> D = C )
15	10, 11, 12, 13, 14	cbvmpo 5921	. . . . . . 7 |- ( i e. A , j e. B |-> D ) = ( a e. A , b e. B |-> C )
16	15	eqcomi 2169	. . . . . 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 5859	. . . 4 |- ( ph -> ( i ( a e. A , b e. B |-> C ) j ) = ( i ( i e. A , j e. B |-> D ) j ) )
19	18	eqeq2d 2177	. . 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 2490	. 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 521	. . . . 5 |- ( ( ph /\ ( i e. A /\ j e. B ) ) -> i e. A )
22		simprr 522	. . . . 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 1194	. . . . 5 |- ( ( ph /\ ( i e. A /\ j e. B ) ) -> D e. U )
25		eqid 2165	. . . . . 6 |- ( i e. A , j e. B |-> D ) = ( i e. A , j e. B |-> D )
26	25	ovmpt4g 5964	. . . . 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 1228	. . . 4 |- ( ( ph /\ ( i e. A /\ j e. B ) ) -> ( i ( i e. A , j e. B |-> D ) j ) = D )
28	27	eqeq2d 2177	. . 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 2488	. 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 213	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 103   <-> wb 104   /\ w3a 968   = wceq 1343   e. wcel 2136   A.wral 2444   X. cxp 4602   Fn wfn 5183  (class class class)co 5842   e. cmpo 5844

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109

This theorem is referenced by: (None)