Theorem pmresg 6957

Description: Elementhood of a restricted function in the set of partial functions. (Contributed by Mario Carneiro, 31-Dec-2013.)

Assertion

Ref	Expression
pmresg	|- ( ( B e. V /\ F e. ( A ^pm C ) ) -> ( F |` B ) e. ( A ^pm B ) )

Proof of Theorem pmresg

Dummy variables x f y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-pm 6925	. . . 4 |- ^pm = ( x e. _V , y e. _V |-> { f e. ~P ( y X. x ) | Fun f } )
2	1	elmpocl1 6285	. . 3 |- ( F e. ( A ^pm C ) -> A e. _V )
3	2	adantl 277	. 2 |- ( ( B e. V /\ F e. ( A ^pm C ) ) -> A e. _V )
4		simpl 109	. 2 |- ( ( B e. V /\ F e. ( A ^pm C ) ) -> B e. V )
5		elpmi 6941	. . . . . 6 |- ( F e. ( A ^pm C ) -> ( F : dom F --> A /\ dom F C_ C ) )
6	5	simpld 112	. . . . 5 |- ( F e. ( A ^pm C ) -> F : dom F --> A )
7	6	adantl 277	. . . 4 |- ( ( B e. V /\ F e. ( A ^pm C ) ) -> F : dom F --> A )
8		inss1 3451	. . . 4 |- ( dom F i^i B ) C_ dom F
9		fssres 5565	. . . 4 |- ( ( F : dom F --> A /\ ( dom F i^i B ) C_ dom F ) -> ( F |` ( dom F i^i B ) ) : ( dom F i^i B ) --> A )
10	7, 8, 9	sylancl 417	. . 3 |- ( ( B e. V /\ F e. ( A ^pm C ) ) -> ( F |` ( dom F i^i B ) ) : ( dom F i^i B ) --> A )
11		ffun 5536	. . . . 5 |- ( F : dom F --> A -> Fun F )
12		resres 5075	. . . . . 6 |- ( ( F |` dom F ) |` B ) = ( F |` ( dom F i^i B ) )
13		funrel 5394	. . . . . . 7 |- ( Fun F -> Rel F )
14		resdm 5102	. . . . . . 7 |- ( Rel F -> ( F |` dom F ) = F )
15		reseq1 5057	. . . . . . 7 |- ( ( F |` dom F ) = F -> ( ( F |` dom F ) |` B ) = ( F |` B ) )
16	13, 14, 15	3syl 17	. . . . . 6 |- ( Fun F -> ( ( F |` dom F ) |` B ) = ( F |` B ) )
17	12, 16	eqtr3id 2285	. . . . 5 |- ( Fun F -> ( F |` ( dom F i^i B ) ) = ( F |` B ) )
18	7, 11, 17	3syl 17	. . . 4 |- ( ( B e. V /\ F e. ( A ^pm C ) ) -> ( F |` ( dom F i^i B ) ) = ( F |` B ) )
19	18	feq1d 5520	. . 3 |- ( ( B e. V /\ F e. ( A ^pm C ) ) -> ( ( F |` ( dom F i^i B ) ) : ( dom F i^i B ) --> A <-> ( F |` B ) : ( dom F i^i B ) --> A ) )
20	10, 19	mpbid 147	. 2 |- ( ( B e. V /\ F e. ( A ^pm C ) ) -> ( F |` B ) : ( dom F i^i B ) --> A )
21		inss2 3452	. . 3 |- ( dom F i^i B ) C_ B
22		elpm2r 6940	. . 3 |- ( ( ( A e. _V /\ B e. V ) /\ ( ( F |` B ) : ( dom F i^i B ) --> A /\ ( dom F i^i B ) C_ B ) ) -> ( F |` B ) e. ( A ^pm B ) )
23	21, 22	mpanr2 442	. 2 |- ( ( ( A e. _V /\ B e. V ) /\ ( F |` B ) : ( dom F i^i B ) --> A ) -> ( F |` B ) e. ( A ^pm B ) )
24	3, 4, 20, 23	syl21anc 1277	1 |- ( ( B e. V /\ F e. ( A ^pm C ) ) -> ( F |` B ) e. ( A ^pm B ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   {crab 2532   _Vcvv 2821   i^i cin 3219   C_ wss 3220   ~Pcpw 3688   X. cxp 4772   dom cdm 4774   |` cres 4776   Rel wrel 4779   Fun wfun 5371   -->wf 5373  (class class class)co 6085   ^pm cpm 6923

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-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-br 4131  df-opab 4193  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-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pm 6925

This theorem is used by:  lmres  15349