![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > resfunexg | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
resfunexg | ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | funres 6610 | . . . . . . 7 ⊢ (Fun 𝐴 → Fun (𝐴 ↾ 𝐵)) | |
2 | 1 | adantr 480 | . . . . . 6 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → Fun (𝐴 ↾ 𝐵)) |
3 | 2 | funfnd 6599 | . . . . 5 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) Fn dom (𝐴 ↾ 𝐵)) |
4 | dffn5 6967 | . . . . 5 ⊢ ((𝐴 ↾ 𝐵) Fn dom (𝐴 ↾ 𝐵) ↔ (𝐴 ↾ 𝐵) = (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ((𝐴 ↾ 𝐵)‘𝑥))) | |
5 | 3, 4 | sylib 218 | . . . 4 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) = (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ((𝐴 ↾ 𝐵)‘𝑥))) |
6 | fvex 6920 | . . . . 5 ⊢ ((𝐴 ↾ 𝐵)‘𝑥) ∈ V | |
7 | 6 | fnasrn 7165 | . . . 4 ⊢ (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ ((𝐴 ↾ 𝐵)‘𝑥)) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) |
8 | 5, 7 | eqtrdi 2791 | . . 3 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉)) |
9 | opex 5475 | . . . . . 6 ⊢ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉 ∈ V | |
10 | eqid 2735 | . . . . . 6 ⊢ (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) = (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) | |
11 | 9, 10 | dmmpti 6713 | . . . . 5 ⊢ dom (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) = dom (𝐴 ↾ 𝐵) |
12 | 11 | imaeq2i 6078 | . . . 4 ⊢ ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) “ dom (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉)) = ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) “ dom (𝐴 ↾ 𝐵)) |
13 | imadmrn 6090 | . . . 4 ⊢ ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) “ dom (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉)) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) | |
14 | 12, 13 | eqtr3i 2765 | . . 3 ⊢ ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) “ dom (𝐴 ↾ 𝐵)) = ran (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) |
15 | 8, 14 | eqtr4di 2793 | . 2 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) = ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) “ dom (𝐴 ↾ 𝐵))) |
16 | funmpt 6606 | . . 3 ⊢ Fun (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) | |
17 | dmresexg 6034 | . . . 4 ⊢ (𝐵 ∈ 𝐶 → dom (𝐴 ↾ 𝐵) ∈ V) | |
18 | 17 | adantl 481 | . . 3 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → dom (𝐴 ↾ 𝐵) ∈ V) |
19 | funimaexg 6654 | . . 3 ⊢ ((Fun (𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) ∧ dom (𝐴 ↾ 𝐵) ∈ V) → ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) “ dom (𝐴 ↾ 𝐵)) ∈ V) | |
20 | 16, 18, 19 | sylancr 587 | . 2 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → ((𝑥 ∈ dom (𝐴 ↾ 𝐵) ↦ 〈𝑥, ((𝐴 ↾ 𝐵)‘𝑥)〉) “ dom (𝐴 ↾ 𝐵)) ∈ V) |
21 | 15, 20 | eqeltrd 2839 | 1 ⊢ ((Fun 𝐴 ∧ 𝐵 ∈ 𝐶) → (𝐴 ↾ 𝐵) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 Vcvv 3478 〈cop 4637 ↦ cmpt 5231 dom cdm 5689 ran crn 5690 ↾ cres 5691 “ cima 5692 Fun wfun 6557 Fn wfn 6558 ‘cfv 6563 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 |
This theorem is referenced by: resiexd 7236 fnex 7237 ofexg 7702 cofunexg 7972 frrlem13 8322 naddcllem 8713 dfac8alem 10067 dfac12lem1 10182 cfsmolem 10308 alephsing 10314 itunifval 10454 zorn2lem1 10534 ttukeylem3 10549 imadomg 10572 wunex2 10776 inar1 10813 axdc4uzlem 14021 hashf1rn 14388 bpolylem 16081 1stf1 18248 1stf2 18249 2ndf1 18251 2ndf2 18252 1stfcl 18253 2ndfcl 18254 gsumzadd 19955 dfrngc2 20645 dfringc2 20674 rngcresringcat 20686 madeval 27906 addsval 28010 negsval 28072 mulsval 28150 gblacfnacd 35092 satf 35338 tendo02 40770 dnnumch1 43033 aomclem6 43048 grimidvtxedg 47814 uhgrimisgrgric 47837 fdivval 48389 |
Copyright terms: Public domain | W3C validator |