| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ofres | Structured version Visualization version GIF version | ||
| Description: Restrict the operands of a function operation to the same domain as that of the operation itself. (Contributed by Mario Carneiro, 15-Sep-2014.) |
| Ref | Expression |
|---|---|
| ofres.1 | ⊢ (𝜑 → 𝐹 Fn 𝐴) |
| ofres.2 | ⊢ (𝜑 → 𝐺 Fn 𝐵) |
| ofres.3 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| ofres.4 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
| ofres.5 | ⊢ (𝐴 ∩ 𝐵) = 𝐶 |
| Ref | Expression |
|---|---|
| ofres | ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = ((𝐹 ↾ 𝐶) ∘f 𝑅(𝐺 ↾ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ofres.1 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) | |
| 2 | ofres.2 | . . 3 ⊢ (𝜑 → 𝐺 Fn 𝐵) | |
| 3 | ofres.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 4 | ofres.4 | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
| 5 | ofres.5 | . . 3 ⊢ (𝐴 ∩ 𝐵) = 𝐶 | |
| 6 | eqidd 2762 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 7 | eqidd 2762 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | offval 7702 | . 2 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝐶 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 9 | inss1 4182 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 10 | 5, 9 | eqsstrri 3978 | . . . 4 ⊢ 𝐶 ⊆ 𝐴 |
| 11 | fnssres 6662 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶) Fn 𝐶) | |
| 12 | 1, 10, 11 | sylancl 598 | . . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐶) Fn 𝐶) |
| 13 | inss2 4183 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
| 14 | 5, 13 | eqsstrri 3978 | . . . 4 ⊢ 𝐶 ⊆ 𝐵 |
| 15 | fnssres 6662 | . . . 4 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐶 ⊆ 𝐵) → (𝐺 ↾ 𝐶) Fn 𝐶) | |
| 16 | 2, 14, 15 | sylancl 598 | . . 3 ⊢ (𝜑 → (𝐺 ↾ 𝐶) Fn 𝐶) |
| 17 | ssexg 5281 | . . . 4 ⊢ ((𝐶 ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐶 ∈ V) | |
| 18 | 10, 3, 17 | sylancr 599 | . . 3 ⊢ (𝜑 → 𝐶 ∈ V) |
| 19 | inidm 4172 | . . 3 ⊢ (𝐶 ∩ 𝐶) = 𝐶 | |
| 20 | fvres 6904 | . . . 4 ⊢ (𝑥 ∈ 𝐶 → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥)) | |
| 21 | 20 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥)) |
| 22 | fvres 6904 | . . . 4 ⊢ (𝑥 ∈ 𝐶 → ((𝐺 ↾ 𝐶)‘𝑥) = (𝐺‘𝑥)) | |
| 23 | 22 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐺 ↾ 𝐶)‘𝑥) = (𝐺‘𝑥)) |
| 24 | 12, 16, 18, 18, 19, 21, 23 | offval 7702 | . 2 ⊢ (𝜑 → ((𝐹 ↾ 𝐶) ∘f 𝑅(𝐺 ↾ 𝐶)) = (𝑥 ∈ 𝐶 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 25 | 8, 24 | eqtr4d 2799 | 1 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = ((𝐹 ↾ 𝐶) ∘f 𝑅(𝐺 ↾ 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3451 ∩ cin 3898 ⊆ wss 3899 ↦ cmpt 5186 ↾ cres 5653 Fn wfn 6533 ‘cfv 6538 (class class class)co 7420 ∘f cof 7691 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 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 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 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-of 7693 |
| This theorem is used by: ofoafg 44355 |
| Copyright terms: Public domain | W3C validator |