| 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 7089 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵) |
| 3 | ofresid.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵) | |
| 4 | 3 | ffvelcdmda 7089 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) ∈ 𝐵) |
| 5 | 2, 4 | opelxpd 5690 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 〈(𝐹‘𝑥), (𝐺‘𝑥)〉 ∈ (𝐵 × 𝐵)) |
| 6 | 5 | fvresd 6910 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑅 ↾ (𝐵 × 𝐵))‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) = (𝑅‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉)) |
| 7 | 6 | eqcomd 2766 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑅‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) = ((𝑅 ↾ (𝐵 × 𝐵))‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉)) |
| 8 | df-ov 7427 | . . . 4 ⊢ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = (𝑅‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) | |
| 9 | df-ov 7427 | . . . 4 ⊢ ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥)) = ((𝑅 ↾ (𝐵 × 𝐵))‘〈(𝐹‘𝑥), (𝐺‘𝑥)〉) | |
| 10 | 7, 8, 9 | 3eqtr4g 2820 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥))) |
| 11 | 10 | mpteq2dva 5197 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥)))) |
| 12 | 1 | ffnd 6715 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
| 13 | 3 | ffnd 6715 | . . 3 ⊢ (𝜑 → 𝐺 Fn 𝐴) |
| 14 | ofresid.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 15 | inidm 4122 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 16 | eqidd 2761 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 17 | eqidd 2761 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
| 18 | 12, 13, 14, 14, 15, 16, 17 | offval 7706 | . 2 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 19 | 12, 13, 14, 14, 15, 16, 17 | offval 7706 | . 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 1569 ∈ wcel 2144 〈cop 4834 ↦ cmpt 5185 × cxp 5649 ↾ cres 5653 ⟶wf 6539 ‘cfv 6543 (class class class)co 7424 ∘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 |
| 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: sitmcl 35033 |
| Copyright terms: Public domain | W3C validator |