| 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 7988, allowing it to be used as a function or structure argument. By ofmresval 7700, 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 3962 | . . 3 ⊢ 𝐴 ⊆ V | |
| 2 | ssv 3962 | . . 3 ⊢ 𝐵 ⊆ V | |
| 3 | resmpo 7539 | . . 3 ⊢ ((𝐴 ⊆ V ∧ 𝐵 ⊆ V) → ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))))) | |
| 4 | 1, 2, 3 | mp2an 705 | . 2 ⊢ ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) |
| 5 | df-of 7684 | . . 3 ⊢ ∘f 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) | |
| 6 | 5 | reseq1i 5976 | . 2 ⊢ ( ∘f 𝑅 ↾ (𝐴 × 𝐵)) = ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) ↾ (𝐴 × 𝐵)) |
| 7 | eqid 2765 | . . 3 ⊢ 𝐴 = 𝐴 | |
| 8 | eqid 2765 | . . 3 ⊢ 𝐵 = 𝐵 | |
| 9 | vex 3461 | . . . 4 ⊢ 𝑓 ∈ V | |
| 10 | vex 3461 | . . . 4 ⊢ 𝑔 ∈ V | |
| 11 | 9 | dmex 7912 | . . . . . 6 ⊢ dom 𝑓 ∈ V |
| 12 | 11 | inex1 5288 | . . . . 5 ⊢ (dom 𝑓 ∩ dom 𝑔) ∈ V |
| 13 | 12 | mptex 7228 | . . . 4 ⊢ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) ∈ V |
| 14 | 5 | ovmpt4g 7566 | . . . 4 ⊢ ((𝑓 ∈ V ∧ 𝑔 ∈ V ∧ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) ∈ V) → (𝑓 ∘f 𝑅𝑔) = (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) |
| 15 | 9, 10, 13, 14 | mp3an 1490 | . . 3 ⊢ (𝑓 ∘f 𝑅𝑔) = (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) |
| 16 | 7, 8, 15 | mpoeq123i 7495 | . 2 ⊢ (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘f 𝑅𝑔)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) |
| 17 | 4, 6, 16 | 3eqtr4i 2798 | 1 ⊢ ( ∘f 𝑅 ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘f 𝑅𝑔)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2146 Vcvv 3457 ∩ cin 3905 ⊆ wss 3906 ↦ cmpt 5194 × cxp 5661 dom cdm 5663 ↾ cres 5665 ‘cfv 6540 (class class class)co 7419 ∈ cmpo 7421 ∘f cof 7682 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7742 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-of 7684 |
| This theorem is used by: mplsubrglem 22203 psrplusgpropd 22445 ofoafg 44139 naddcnff 44147 |
| Copyright terms: Public domain | W3C validator |