| 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 2764 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 7 | eqidd 2764 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | offval 7734 | . 2 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝐶 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 9 | inss1 4136 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 10 | 5, 9 | eqsstrri 3960 | . . . 4 ⊢ 𝐶 ⊆ 𝐴 |
| 11 | fnssres 6692 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶) Fn 𝐶) | |
| 12 | 1, 10, 11 | sylancl 598 | . . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐶) Fn 𝐶) |
| 13 | inss2 4137 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
| 14 | 5, 13 | eqsstrri 3960 | . . . 4 ⊢ 𝐶 ⊆ 𝐵 |
| 15 | fnssres 6692 | . . . 4 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐶 ⊆ 𝐵) → (𝐺 ↾ 𝐶) Fn 𝐶) | |
| 16 | 2, 14, 15 | sylancl 598 | . . 3 ⊢ (𝜑 → (𝐺 ↾ 𝐶) Fn 𝐶) |
| 17 | ssexg 5288 | . . . 4 ⊢ ((𝐶 ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐶 ∈ V) | |
| 18 | 10, 3, 17 | sylancr 599 | . . 3 ⊢ (𝜑 → 𝐶 ∈ V) |
| 19 | inidm 4126 | . . 3 ⊢ (𝐶 ∩ 𝐶) = 𝐶 | |
| 20 | fvres 6935 | . . . 4 ⊢ (𝑥 ∈ 𝐶 → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥)) | |
| 21 | 20 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥)) |
| 22 | fvres 6935 | . . . 4 ⊢ (𝑥 ∈ 𝐶 → ((𝐺 ↾ 𝐶)‘𝑥) = (𝐺‘𝑥)) | |
| 23 | 22 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐺 ↾ 𝐶)‘𝑥) = (𝐺‘𝑥)) |
| 24 | 12, 16, 18, 18, 19, 21, 23 | offval 7734 | . 2 ⊢ (𝜑 → ((𝐹 ↾ 𝐶) ∘f 𝑅(𝐺 ↾ 𝐶)) = (𝑥 ∈ 𝐶 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 25 | 8, 24 | eqtr4d 2801 | 1 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = ((𝐹 ↾ 𝐶) ∘f 𝑅(𝐺 ↾ 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ⊆ wss 3900 ∩ cin 4092 ↦ cmpt 5192 ↾ cres 5660 Fn wfn 6561 ‘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: ofoafg 44678 |
| Copyright terms: Public domain | W3C validator |