| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ofresid | Structured version Visualization version GIF version | ||
| Description: Applying an operation restricted to the range of the functions does not change the function operation. (Contributed by Thierry Arnoux, 14-Feb-2018.) |
| Ref | Expression |
|---|---|
| ofresid.1 | ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
| ofresid.2 | ⊢ (𝜑 → 𝐺:𝐴⟶𝐵) |
| ofresid.3 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| ofresid | ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝐹 ∘f (𝑅 ↾ (𝐵 × 𝐵))𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ofresid.1 | . . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) | |
| 2 | 1 | ffvelcdmda 7116 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵) |
| 3 | ofresid.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵) | |
| 4 | 3 | ffvelcdmda 7116 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) ∈ 𝐵) |
| 5 | 2, 4 | opelxpd 5697 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 〈(𝐹‘𝑥), (𝐺‘𝑥)〉 ∈ (𝐵 × 𝐵)) |
| 6 | 5 | fvresd 6936 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑅 ↾ (𝐵 × 𝐵))‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) = (𝑅‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉)) |
| 7 | 6 | eqcomd 2769 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑅‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) = ((𝑅 ↾ (𝐵 × 𝐵))‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉)) |
| 8 | df-ov 7454 | . . . 4 ⊢ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = (𝑅‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) | |
| 9 | df-ov 7454 | . . . 4 ⊢ ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥)) = ((𝑅 ↾ (𝐵 × 𝐵))‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) | |
| 10 | 7, 8, 9 | 3eqtr4g 2823 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥))) |
| 11 | 10 | mpteq2dva 5204 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥)))) |
| 12 | 1 | ffnd 6740 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
| 13 | 3 | ffnd 6740 | . . 3 ⊢ (𝜑 → 𝐺 Fn 𝐴) |
| 14 | ofresid.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 15 | inidm 4126 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 16 | eqidd 2764 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 17 | eqidd 2764 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
| 18 | 12, 13, 14, 14, 15, 16, 17 | offval 7734 | . 2 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 19 | 12, 13, 14, 14, 15, 16, 17 | offval 7734 | . 2 ⊢ (𝜑 → (𝐹 ∘f (𝑅 ↾ (𝐵 × 𝐵))𝐺) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥)))) |
| 20 | 11, 18, 19 | 3eqtr4d 2808 | 1 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝐹 ∘f (𝑅 ↾ (𝐵 × 𝐵))𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 〈cop 4840 ↦ cmpt 5192 × cxp 5656 ↾ cres 5660 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 ∘f cof 7723 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-of 7725 |
| This theorem is used by: sitmcl 35094 |
| Copyright terms: Public domain | W3C validator |