| 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 8001, allowing it to be used as a function or structure argument. By ofmresval 7713, 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 3933 | . . 3 ⊢ 𝐴 ⊆ V | |
| 2 | ssv 3933 | . . 3 ⊢ 𝐵 ⊆ V | |
| 3 | resmpo 7544 | . . 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 7697 | . . 3 ⊢ ∘f 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) | |
| 6 | 5 | reseq1i 5967 | . 2 ⊢ ( ∘f 𝑅 ↾ (𝐴 × 𝐵)) = ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) ↾ (𝐴 × 𝐵)) |
| 7 | eqid 2760 | . . 3 ⊢ 𝐴 = 𝐴 | |
| 8 | eqid 2760 | . . 3 ⊢ 𝐵 = 𝐵 | |
| 9 | vex 3454 | . . . 4 ⊢ 𝑓 ∈ V | |
| 10 | vex 3454 | . . . 4 ⊢ 𝑔 ∈ V | |
| 11 | 9 | dmex 7925 | . . . . . 6 ⊢ dom 𝑓 ∈ V |
| 12 | 11 | inex1 5277 | . . . . 5 ⊢ (dom 𝑓 ∩ dom 𝑔) ∈ V |
| 13 | 12 | mptex 7233 | . . . 4 ⊢ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) ∈ V |
| 14 | 5 | ovmpt4g 7571 | . . . 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 7500 | . 2 ⊢ (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘f 𝑅𝑔)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) |
| 17 | 4, 6, 16 | 3eqtr4i 2793 | 1 ⊢ ( ∘f 𝑅 ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘f 𝑅𝑔)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2144 Vcvv 3450 ⊆ wss 3896 ∩ cin 4088 ↦ cmpt 5185 × cxp 5649 dom cdm 5651 ↾ cres 5653 ‘cfv 6543 (class class class)co 7424 ∈ cmpo 7426 ∘f cof 7695 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7427 df-oprab 7428 df-mpo 7429 df-of 7697 |
| This theorem is used by: mplsubrglem 22320 psrplusgpropd 22562 ofoafg 44465 naddcnff 44473 |
| Copyright terms: Public domain | W3C validator |