| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ofmres | Structured version Visualization version GIF version | ||
| Description: Equivalent expressions for a restriction of the function operation map. Unlike ∘f 𝑅 which is a proper class, ( ∘f 𝑅 ↾ (𝐴 × 𝐵)) can be a set by ofmresex 7964, allowing it to be used as a function or structure argument. By ofmresval 7669, the restricted operation map values are the same as the original values, allowing theorems for ∘f 𝑅 to be reused. (Contributed by NM, 20-Oct-2014.) |
| Ref | Expression |
|---|---|
| ofmres | ⊢ ( ∘f 𝑅 ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘f 𝑅𝑔)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssv 3971 | . . 3 ⊢ 𝐴 ⊆ V | |
| 2 | ssv 3971 | . . 3 ⊢ 𝐵 ⊆ V | |
| 3 | resmpo 7509 | . . 3 ⊢ ((𝐴 ⊆ V ∧ 𝐵 ⊆ V) → ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))))) | |
| 4 | 1, 2, 3 | mp2an 692 | . 2 ⊢ ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) |
| 5 | df-of 7653 | . . 3 ⊢ ∘f 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) | |
| 6 | 5 | reseq1i 5946 | . 2 ⊢ ( ∘f 𝑅 ↾ (𝐴 × 𝐵)) = ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) ↾ (𝐴 × 𝐵)) |
| 7 | eqid 2729 | . . 3 ⊢ 𝐴 = 𝐴 | |
| 8 | eqid 2729 | . . 3 ⊢ 𝐵 = 𝐵 | |
| 9 | vex 3451 | . . . 4 ⊢ 𝑓 ∈ V | |
| 10 | vex 3451 | . . . 4 ⊢ 𝑔 ∈ V | |
| 11 | 9 | dmex 7885 | . . . . . 6 ⊢ dom 𝑓 ∈ V |
| 12 | 11 | inex1 5272 | . . . . 5 ⊢ (dom 𝑓 ∩ dom 𝑔) ∈ V |
| 13 | 12 | mptex 7197 | . . . 4 ⊢ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) ∈ V |
| 14 | 5 | ovmpt4g 7536 | . . . 4 ⊢ ((𝑓 ∈ V ∧ 𝑔 ∈ V ∧ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) ∈ V) → (𝑓 ∘f 𝑅𝑔) = (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) |
| 15 | 9, 10, 13, 14 | mp3an 1463 | . . 3 ⊢ (𝑓 ∘f 𝑅𝑔) = (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) |
| 16 | 7, 8, 15 | mpoeq123i 7465 | . 2 ⊢ (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘f 𝑅𝑔)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) |
| 17 | 4, 6, 16 | 3eqtr4i 2762 | 1 ⊢ ( ∘f 𝑅 ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘f 𝑅𝑔)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ∈ wcel 2109 Vcvv 3447 ∩ cin 3913 ⊆ wss 3914 ↦ cmpt 5188 × cxp 5636 dom cdm 5638 ↾ cres 5640 ‘cfv 6511 (class class class)co 7387 ∈ cmpo 7389 ∘f cof 7651 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-of 7653 |
| This theorem is referenced by: mplsubrglem 21913 psrplusgpropd 22120 ofoafg 43343 naddcnff 43351 |
| Copyright terms: Public domain | W3C validator |