Theorem mpoxopn0yelv 6297

Description: If there is an element of the value of an operation given by a maps-to rule, where the first argument is a pair and the base set of the second argument is the first component of the first argument, then the second argument is an element of the first component of the first argument. (Contributed by Alexander van der Vekens, 10-Oct-2017.)

Hypothesis

Ref	Expression
mpoxopn0yelv.f	|- F = ( x e. _V , y e. ( 1st ` x ) |-> C )

Assertion

Ref	Expression
mpoxopn0yelv	|- ( ( V e. X /\ W e. Y ) -> ( N e. ( <. V , W >. F K ) -> K e. V ) )

Distinct variable groups:   x, y   x, K   x, V   x, W

Allowed substitution hints:   C( x, y)   F( x, y)   K( y)   N( x, y)   V( y)   W( y)   X( x, y)   Y( x, y)

Proof of Theorem mpoxopn0yelv

Step	Hyp	Ref	Expression
1		mpoxopn0yelv.f	. . . . 5 |- F = ( x e. _V , y e. ( 1st ` x ) |-> C )
2	1	dmmpossx 6257	. . . 4 |- dom F C_ U_ x e. _V ( { x } X. ( 1st ` x ) )
3	1	mpofun 6024	. . . . . . 7 |- Fun F
4		funrel 5275	. . . . . . 7 |- ( Fun F -> Rel F )
5	3, 4	ax-mp 5	. . . . . 6 |- Rel F
6		relelfvdm 5590	. . . . . 6 |- ( ( Rel F /\ N e. ( F ` <. <. V , W >. , K >. ) ) -> <. <. V , W >. , K >. e. dom F )
7	5, 6	mpan 424	. . . . 5 |- ( N e. ( F ` <. <. V , W >. , K >. ) -> <. <. V , W >. , K >. e. dom F )
8		df-ov 5925	. . . . 5 |- ( <. V , W >. F K ) = ( F ` <. <. V , W >. , K >. )
9	7, 8	eleq2s 2291	. . . 4 |- ( N e. ( <. V , W >. F K ) -> <. <. V , W >. , K >. e. dom F )
10	2, 9	sselid 3181	. . 3 |- ( N e. ( <. V , W >. F K ) -> <. <. V , W >. , K >. e. U_ x e. _V ( { x } X. ( 1st ` x ) ) )
11		fveq2 5558	. . . . 5 |- ( x = <. V , W >. -> ( 1st ` x ) = ( 1st ` <. V , W >. ) )
12	11	opeliunxp2 4806	. . . 4 |- ( <. <. V , W >. , K >. e. U_ x e. _V ( { x } X. ( 1st ` x ) ) <-> ( <. V , W >. e. _V /\ K e. ( 1st ` <. V , W >. ) ) )
13	12	simprbi 275	. . 3 |- ( <. <. V , W >. , K >. e. U_ x e. _V ( { x } X. ( 1st ` x ) ) -> K e. ( 1st ` <. V , W >. ) )
14	10, 13	syl 14	. 2 |- ( N e. ( <. V , W >. F K ) -> K e. ( 1st ` <. V , W >. ) )
15		op1stg 6208	. . 3 |- ( ( V e. X /\ W e. Y ) -> ( 1st ` <. V , W >. ) = V )
16	15	eleq2d 2266	. 2 |- ( ( V e. X /\ W e. Y ) -> ( K e. ( 1st ` <. V , W >. ) <-> K e. V ) )
17	14, 16	imbitrid 154	1 |- ( ( V e. X /\ W e. Y ) -> ( N e. ( <. V , W >. F K ) -> K e. V ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1364   e. wcel 2167   _Vcvv 2763   {csn 3622   <.cop 3625   U_ciun 3916   X. cxp 4661   dom cdm 4663   Rel wrel 4668   Fun wfun 5252   ` cfv 5258  (class class class)co 5922   e. cmpo 5924   1stc1st 6196

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fv 5266  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199

This theorem is referenced by:  mpoxopovel  6299