Theorem mpoexw 6422

Description: Weak version of mpoex 6423 that holds without ax-coll 4230. If the domain and codomain of an operation given by maps-to notation are sets, the operation is a set. (Contributed by Rohan Ridenour, 14-Aug-2023.)

Hypotheses

Ref	Expression
mpoexw.1	|- A e. _V
mpoexw.2	|- B e. _V
mpoexw.3	|- D e. _V
mpoexw.4	|- A. x e. A A. y e. B C e. D

Assertion

Ref	Expression
mpoexw	|- ( x e. A , y e. B |-> C ) e. _V

Distinct variable groups:   x, y, A   x, B, y   x, D, y

Allowed substitution hints:   C( x, y)

Proof of Theorem mpoexw

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2234	. . 3 |- ( x e. A , y e. B |-> C ) = ( x e. A , y e. B |-> C )
2	1	mpofun 6163	. 2 |- Fun ( x e. A , y e. B |-> C )
3		mpoexw.4	. . . 4 |- A. x e. A A. y e. B C e. D
4	1	dmmpoga 6417	. . . 4 |- ( A. x e. A A. y e. B C e. D -> dom ( x e. A , y e. B |-> C ) = ( A X. B ) )
5	3, 4	ax-mp 5	. . 3 |- dom ( x e. A , y e. B |-> C ) = ( A X. B )
6		mpoexw.1	. . . 4 |- A e. _V
7		mpoexw.2	. . . 4 |- B e. _V
8	6, 7	xpex 4871	. . 3 |- ( A X. B ) e. _V
9	5, 8	eqeltri 2307	. 2 |- dom ( x e. A , y e. B |-> C ) e. _V
10	1	rnmpo 6172	. . 3 |- ran ( x e. A , y e. B |-> C ) = { z | E. x e. A E. y e. B z = C }
11		mpoexw.3	. . . 4 |- D e. _V
12	3	rspec 2596	. . . . . . . . 9 |- ( x e. A -> A. y e. B C e. D )
13	12	r19.21bi 2632	. . . . . . . 8 |- ( ( x e. A /\ y e. B ) -> C e. D )
14		eleq1a 2306	. . . . . . . 8 |- ( C e. D -> ( z = C -> z e. D ) )
15	13, 14	syl 14	. . . . . . 7 |- ( ( x e. A /\ y e. B ) -> ( z = C -> z e. D ) )
16	15	rexlimdva 2662	. . . . . 6 |- ( x e. A -> ( E. y e. B z = C -> z e. D ) )
17	16	rexlimiv 2656	. . . . 5 |- ( E. x e. A E. y e. B z = C -> z e. D )
18	17	abssi 3317	. . . 4 |- { z | E. x e. A E. y e. B z = C } C_ D
19	11, 18	ssexi 4253	. . 3 |- { z | E. x e. A E. y e. B z = C } e. _V
20	10, 19	eqeltri 2307	. 2 |- ran ( x e. A , y e. B |-> C ) e. _V
21		funexw 6314	. 2 |- ( ( Fun ( x e. A , y e. B |-> C ) /\ dom ( x e. A , y e. B |-> C ) e. _V /\ ran ( x e. A , y e. B |-> C ) e. _V ) -> ( x e. A , y e. B |-> C ) e. _V )
22	2, 9, 20, 21	mp3an 1374	1 |- ( x e. A , y e. B |-> C ) e. _V

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   e. wcel 2205   {cab 2220   A.wral 2522   E.wrex 2523   _Vcvv 2815   X. cxp 4752   dom cdm 4754   ran crn 4755   Fun wfun 5351   e. cmpo 6060

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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348

This theorem is referenced by:  prdsvallem  13564