| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ofmres | GIF version | ||
| Description: Equivalent expressions for a restriction of the function operation map. Unlike ∘𝑓 𝑅 which is a proper class, ( ∘𝑓 𝑅 ↾ (𝐴 × 𝐵)) can be a set by ofmresex 6294, allowing it to be used as a function or structure argument. By ofmresval 6242, the restricted operation map values are the same as the original values, allowing theorems for ∘𝑓 𝑅 to be reused. (Contributed by NM, 20-Oct-2014.) |
| Ref | Expression |
|---|---|
| ofmres | ⊢ ( ∘𝑓 𝑅 ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘𝑓 𝑅𝑔)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssv 3247 | . . 3 ⊢ 𝐴 ⊆ V | |
| 2 | ssv 3247 | . . 3 ⊢ 𝐵 ⊆ V | |
| 3 | resmpo 6114 | . . 3 ⊢ ((𝐴 ⊆ V ∧ 𝐵 ⊆ V) → ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))))) | |
| 4 | 1, 2, 3 | mp2an 426 | . 2 ⊢ ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) |
| 5 | df-of 6230 | . . 3 ⊢ ∘𝑓 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) | |
| 6 | 5 | reseq1i 5007 | . 2 ⊢ ( ∘𝑓 𝑅 ↾ (𝐴 × 𝐵)) = ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) ↾ (𝐴 × 𝐵)) |
| 7 | eqid 2229 | . . 3 ⊢ 𝐴 = 𝐴 | |
| 8 | eqid 2229 | . . 3 ⊢ 𝐵 = 𝐵 | |
| 9 | vex 2803 | . . . 4 ⊢ 𝑓 ∈ V | |
| 10 | vex 2803 | . . . 4 ⊢ 𝑔 ∈ V | |
| 11 | 9 | dmex 4997 | . . . . . 6 ⊢ dom 𝑓 ∈ V |
| 12 | 11 | inex1 4221 | . . . . 5 ⊢ (dom 𝑓 ∩ dom 𝑔) ∈ V |
| 13 | 12 | mptex 5875 | . . . 4 ⊢ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) ∈ V |
| 14 | 5 | ovmpt4g 6139 | . . . 4 ⊢ ((𝑓 ∈ V ∧ 𝑔 ∈ V ∧ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) ∈ V) → (𝑓 ∘𝑓 𝑅𝑔) = (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) |
| 15 | 9, 10, 13, 14 | mp3an 1371 | . . 3 ⊢ (𝑓 ∘𝑓 𝑅𝑔) = (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) |
| 16 | 7, 8, 15 | mpoeq123i 6079 | . 2 ⊢ (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘𝑓 𝑅𝑔)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) |
| 17 | 4, 6, 16 | 3eqtr4i 2260 | 1 ⊢ ( ∘𝑓 𝑅 ↾ (𝐴 × 𝐵)) = (𝑓 ∈ 𝐴, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘𝑓 𝑅𝑔)) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1395 ∈ wcel 2200 Vcvv 2800 ∩ cin 3197 ⊆ wss 3198 ↦ cmpt 4148 × cxp 4721 dom cdm 4723 ↾ cres 4725 ‘cfv 5324 (class class class)co 6013 ∈ cmpo 6015 ∘𝑓 cof 6228 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-ov 6016 df-oprab 6017 df-mpo 6018 df-of 6230 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |