Theorem fnmpoovd 6451

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 1235	. . . . 5 |- ( ( ph /\ ( a e. A /\ b e. B ) ) -> C e. V )
4	3	ralrimivva 2632	. . . 4 |- ( ph -> A. a e. A A. b e. B C e. V )
5		eqid 2238	. . . . 5 |- ( a e. A , b e. B |-> C ) = ( a e. A , b e. B |-> C )
6	5	fnmpo 6438	. . . 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 6196	. . 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 415	. 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 2392	. . . . . . . 8 |- F/_ a D
11		nfcv 2392	. . . . . . . 8 |- F/_ b D
12		nfcv 2392	. . . . . . . 8 |- F/_ i C
13		nfcv 2392	. . . . . . . 8 |- F/_ j C
14		fnmpoovd.s	. . . . . . . 8 |- ( ( i = a /\ j = b ) -> D = C )
15	10, 11, 12, 13, 14	cbvmpo 6167	. . . . . . 7 |- ( i e. A , j e. B |-> D ) = ( a e. A , b e. B |-> C )
16	15	eqcomi 2242	. . . . . 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 6102	. . . 4 |- ( ph -> ( i ( a e. A , b e. B |-> C ) j ) = ( i ( i e. A , j e. B |-> D ) j ) )
19	18	eqeq2d 2250	. . 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 2574	. 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 535	. . . . 5 |- ( ( ph /\ ( i e. A /\ j e. B ) ) -> i e. A )
22		simprr 537	. . . . 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 1235	. . . . 5 |- ( ( ph /\ ( i e. A /\ j e. B ) ) -> D e. U )
25		eqid 2238	. . . . . 6 |- ( i e. A , j e. B |-> D ) = ( i e. A , j e. B |-> D )
26	25	ovmpt4g 6211	. . . . 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 1278	. . . 4 |- ( ( ph /\ ( i e. A /\ j e. B ) ) -> ( i ( i e. A , j e. B |-> D ) j ) = D )
28	27	eqeq2d 2250	. . 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 2572	. 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 ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   A.wral 2528   X. cxp 4772   Fn wfn 5372  (class class class)co 6085   e. cmpo 6087

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375

This theorem is used by: (None)