Theorem resfunexg 7086

Description: The restriction of a function to a set exists. Compare Proposition 6.17 of [TakeutiZaring] p. 28. (Contributed by NM, 7-Apr-1995.) (Revised by Mario Carneiro, 22-Jun-2013.)

Assertion

Ref	Expression
resfunexg	⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) ∈ V)

Proof of Theorem resfunexg

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funres 6473	. . . . . . 7 ⊢ (Fun 𝐴 → Fun (𝐴 ↾ 𝐵))
2	1	adantr 481	. . . . . 6 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → Fun (𝐴 ↾ 𝐵))
3	2	funfnd 6462	. . . . 5 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) Fn dom (𝐴 ↾ 𝐵))
4		dffn5 6823	. . . . 5 ⊢ ((𝐴 ↾ 𝐵) Fn dom (𝐴 ↾ 𝐵) ↔ (𝐴 ↾ 𝐵) = (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ((𝐴 ↾ 𝐵)‘𝑥)))
5	3, 4	sylib 217	. . . 4 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) = (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ((𝐴 ↾ 𝐵)‘𝑥)))
6		fvex 6782	. . . . 5 ⊢ ((𝐴 ↾ 𝐵)‘𝑥) ∈ V
7	6	fnasrn 7012	. . . 4 ⊢ (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ((𝐴 ↾ 𝐵)‘𝑥)) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)
8	5, 7	eqtrdi 2796	. . 3 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩))
9		opex 5382	. . . . . 6 ⊢ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩ ∈ V
10		eqid 2740	. . . . . 6 ⊢ (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) = (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)
11	9, 10	dmmpti 6574	. . . . 5 ⊢ dom (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) = dom (𝐴 ↾ 𝐵)
12	11	imaeq2i 5965	. . . 4 ⊢ ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)) = ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝐴 ↾ 𝐵))
13		imadmrn 5977	. . . 4 ⊢ ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)
14	12, 13	eqtr3i 2770	. . 3 ⊢ ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝐴 ↾ 𝐵)) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)
15	8, 14	eqtr4di 2798	. 2 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) = ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝐴 ↾ 𝐵)))
16		funmpt 6469	. . 3 ⊢ Fun (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)
17		dmresexg 5913	. . . 4 ⊢ (𝐵 ∈ 𝐶 → dom (𝐴 ↾ 𝐵) ∈ V)
18	17	adantl 482	. . 3 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → dom (𝐴 ↾ 𝐵) ∈ V)
19		funimaexg 6517	. . 3 ⊢ ((Fun (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) ∧ dom (𝐴 ↾ 𝐵) ∈ V) → ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝐴 ↾ 𝐵)) ∈ V)
20	16, 18, 19	sylancr 587	. 2 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝐴 ↾ 𝐵)) ∈ V)
21	15, 20	eqeltrd 2841	1 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) ∈ V)

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1542   ∈ wcel 2110  Vcvv 3431  ⟨cop 4573   ↦ cmpt 5162  dom cdm 5589  ran crn 5590   ↾ cres 5591   “ cima 5592  Fun wfun 6425   Fn wfn 6426  ‘cfv 6431

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2015  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2711  ax-rep 5214  ax-sep 5227  ax-nul 5234  ax-pr 5356

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2072  df-mo 2542  df-eu 2571  df-clab 2718  df-cleq 2732  df-clel 2818  df-nfc 2891  df-ne 2946  df-ral 3071  df-rex 3072  df-reu 3073  df-rab 3075  df-v 3433  df-sbc 3721  df-csb 3838  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4846  df-iun 4932  df-br 5080  df-opab 5142  df-mpt 5163  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6389  df-fun 6433  df-fn 6434  df-f 6435  df-f1 6436  df-fo 6437  df-f1o 6438  df-fv 6439

This theorem is referenced by:  resiexd  7087  fnex  7088  ofexg  7530  cofunexg  7783  frrlem13  8103  dfac8alem  9784  dfac12lem1  9898  cfsmolem  10025  alephsing  10031  itunifval  10171  zorn2lem1  10251  ttukeylem3  10266  imadomg  10289  wunex2  10493  inar1  10530  axdc4uzlem  13699  hashf1rn  14063  bpolylem  15754  1stf1  17905  1stf2  17906  2ndf1  17908  2ndf2  17909  1stfcl  17910  2ndfcl  17911  gsumzadd  19519  satf  33309  naddcllem  33825  madeval  34030  negsval  34117  addsval  34120  tendo02  38795  dnnumch1  40864  aomclem6  40879  dfrngc2  45497  dfringc2  45543  rngcresringcat  45555  fdivval  45852