| 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 7077 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵) |
| 3 | ofresid.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵) | |
| 4 | 3 | ffvelcdmda 7077 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) ∈ 𝐵) |
| 5 | 2, 4 | opelxpd 5694 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 〈(𝐹‘𝑥), (𝐺‘𝑥)〉 ∈ (𝐵 × 𝐵)) |
| 6 | 5 | fvresd 6898 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑅 ↾ (𝐵 × 𝐵))‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) = (𝑅‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉)) |
| 7 | 6 | eqcomd 2766 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑅‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) = ((𝑅 ↾ (𝐵 × 𝐵))‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉)) |
| 8 | df-ov 7416 | . . . 4 ⊢ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = (𝑅‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) | |
| 9 | df-ov 7416 | . . . 4 ⊢ ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥)) = ((𝑅 ↾ (𝐵 × 𝐵))‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) | |
| 10 | 7, 8, 9 | 3eqtr4g 2820 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥))) |
| 11 | 10 | mpteq2dva 5198 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥)))) |
| 12 | 1 | ffnd 6703 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
| 13 | 3 | ffnd 6703 | . . 3 ⊢ (𝜑 → 𝐺 Fn 𝐴) |
| 14 | ofresid.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 15 | inidm 4172 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 16 | eqidd 2761 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 17 | eqidd 2761 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
| 18 | 12, 13, 14, 14, 15, 16, 17 | offval 7687 | . 2 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 19 | 12, 13, 14, 14, 15, 16, 17 | offval 7687 | . 2 ⊢ (𝜑 → (𝐹 ∘f (𝑅 ↾ (𝐵 × 𝐵))𝐺) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥)))) |
| 20 | 11, 18, 19 | 3eqtr4d 2805 | 1 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝐹 ∘f (𝑅 ↾ (𝐵 × 𝐵))𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 〈cop 4590 ↦ cmpt 5186 × cxp 5653 ↾ cres 5657 ⟶wf 6529 ‘cfv 6533 (class class class)co 7413 ∘f cof 7676 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 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 2100 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-of 7678 |
| This theorem is used by: sitmcl 34862 |
| Copyright terms: Public domain | W3C validator |