Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ofexg | GIF version |
Description: A function operation restricted to a set is a set. (Contributed by NM, 28-Jul-2014.) |
Ref | Expression |
---|---|
ofexg | ⊢ (𝐴 ∈ 𝑉 → ( ∘𝑓 𝑅 ↾ 𝐴) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-of 5732 | . . 3 ⊢ ∘𝑓 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) | |
2 | 1 | mpt2fun 5623 | . 2 ⊢ Fun ∘𝑓 𝑅 |
3 | resfunexg 5403 | . 2 ⊢ ((Fun ∘𝑓 𝑅 ∧ 𝐴 ∈ 𝑉) → ( ∘𝑓 𝑅 ↾ 𝐴) ∈ V) | |
4 | 2, 3 | mpan 414 | 1 ⊢ (𝐴 ∈ 𝑉 → ( ∘𝑓 𝑅 ↾ 𝐴) ∈ V) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∈ wcel 1433 Vcvv 2601 ∩ cin 2972 ↦ cmpt 3839 dom cdm 4363 ↾ cres 4365 Fun wfun 4916 ‘cfv 4922 (class class class)co 5532 ∘𝑓 cof 5730 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-coll 3893 ax-sep 3896 ax-pow 3948 ax-pr 3964 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-rex 2354 df-reu 2355 df-rab 2357 df-v 2603 df-sbc 2816 df-csb 2909 df-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-id 4048 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-res 4375 df-ima 4376 df-iota 4887 df-fun 4924 df-fn 4925 df-f 4926 df-f1 4927 df-fo 4928 df-f1o 4929 df-fv 4930 df-oprab 5536 df-mpt2 5537 df-of 5732 |
This theorem is referenced by: ofmresex 5784 |
Copyright terms: Public domain | W3C validator |