Theorem resfunexg 6624

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 6073	. . . . . . 7 ⊢ (Fun 𝐴 → Fun (𝐴 ↾ 𝐵))
2	1	adantr 466	. . . . . 6 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → Fun (𝐴 ↾ 𝐵))
3		funfn 6062	. . . . . 6 ⊢ (Fun (𝐴 ↾ 𝐵) ↔ (𝐴 ↾ 𝐵) Fn dom (𝐴 ↾ 𝐵))
4	2, 3	sylib 208	. . . . 5 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) Fn dom (𝐴 ↾ 𝐵))
5		dffn5 6384	. . . . 5 ⊢ ((𝐴 ↾ 𝐵) Fn dom (𝐴 ↾ 𝐵) ↔ (𝐴 ↾ 𝐵) = (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ((𝐴 ↾ 𝐵)‘𝑥)))
6	4, 5	sylib 208	. . . 4 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) = (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ((𝐴 ↾ 𝐵)‘𝑥)))
7		fvex 6343	. . . . 5 ⊢ ((𝐴 ↾ 𝐵)‘𝑥) ∈ V
8	7	fnasrn 6555	. . . 4 ⊢ (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ((𝐴 ↾ 𝐵)‘𝑥)) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)
9	6, 8	syl6eq 2821	. . 3 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩))
10		opex 5061	. . . . . 6 ⊢ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩ ∈ V
11		eqid 2771	. . . . . 6 ⊢ (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) = (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)
12	10, 11	dmmpti 6164	. . . . 5 ⊢ dom (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) = dom (𝐴 ↾ 𝐵)
13	12	imaeq2i 5606	. . . 4 ⊢ ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)) = ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝐴 ↾ 𝐵))
14		imadmrn 5618	. . . 4 ⊢ ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)
15	13, 14	eqtr3i 2795	. . 3 ⊢ ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝐴 ↾ 𝐵)) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)
16	9, 15	syl6eqr 2823	. 2 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) = ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝐴 ↾ 𝐵)))
17		funmpt 6070	. . 3 ⊢ Fun (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩)
18		dmresexg 5563	. . . 4 ⊢ (𝐵 ∈ 𝐶 → dom (𝐴 ↾ 𝐵) ∈ V)
19	18	adantl 467	. . 3 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → dom (𝐴 ↾ 𝐵) ∈ V)
20		funimaexg 6116	. . 3 ⊢ ((Fun (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) ∧ dom (𝐴 ↾ 𝐵) ∈ V) → ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝐴 ↾ 𝐵)) ∈ V)
21	17, 19, 20	sylancr 569	. 2 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ⟨𝑥, ((𝐴 ↾ 𝐵)‘𝑥)⟩) “ dom (𝐴 ↾ 𝐵)) ∈ V)
22	16, 21	eqeltrd 2850	1 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) ∈ V)

Syntax hints:   → wi 4   ∧ wa 382   = wceq 1631   ∈ wcel 2145  Vcvv 3351  ⟨cop 4323   ↦ cmpt 4864  dom cdm 5250  ran crn 5251   ↾ cres 5252   “ cima 5253  Fun wfun 6026   Fn wfn 6027  ‘cfv 6032

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-rep 4905  ax-sep 4916  ax-nul 4924  ax-pr 5035

This theorem depends on definitions:  df-bi 197  df-an 383  df-or 829  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3353  df-sbc 3589  df-csb 3684  df-dif 3727  df-un 3729  df-in 3731  df-ss 3738  df-nul 4065  df-if 4227  df-sn 4318  df-pr 4320  df-op 4324  df-uni 4576  df-iun 4657  df-br 4788  df-opab 4848  df-mpt 4865  df-id 5158  df-xp 5256  df-rel 5257  df-cnv 5258  df-co 5259  df-dm 5260  df-rn 5261  df-res 5262  df-ima 5263  df-iota 5995  df-fun 6034  df-fn 6035  df-f 6036  df-f1 6037  df-fo 6038  df-f1o 6039  df-fv 6040

This theorem is referenced by:  resiexd  6625  fnex  6626  ofexg  7049  cofunexg  7278  dfac8alem  9053  dfac12lem1  9168  cfsmolem  9295  alephsing  9301  itunifval  9441  zorn2lem1  9521  ttukeylem3  9536  imadomg  9559  wunex2  9763  inar1  9800  axdc4uzlem  12991  hashf1rn  13346  bpolylem  14986  1stf1  17041  1stf2  17042  2ndf1  17044  2ndf2  17045  1stfcl  17046  2ndfcl  17047  gsumzadd  18530  wlkreslem  26802  madeval  32273  tendo02  36597  dnnumch1  38141  aomclem6  38156  dfrngc2  42501  dfringc2  42547  rngcresringcat  42559  fdivval  42862