![]() |
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 2733 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
7 | eqidd 2733 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
8 | 1, 2, 3, 4, 5, 6, 7 | offval 7678 | . 2 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝐶 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
9 | inss1 4228 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
10 | 5, 9 | eqsstrri 4017 | . . . 4 ⊢ 𝐶 ⊆ 𝐴 |
11 | fnssres 6673 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶) Fn 𝐶) | |
12 | 1, 10, 11 | sylancl 586 | . . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐶) Fn 𝐶) |
13 | inss2 4229 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
14 | 5, 13 | eqsstrri 4017 | . . . 4 ⊢ 𝐶 ⊆ 𝐵 |
15 | fnssres 6673 | . . . 4 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐶 ⊆ 𝐵) → (𝐺 ↾ 𝐶) Fn 𝐶) | |
16 | 2, 14, 15 | sylancl 586 | . . 3 ⊢ (𝜑 → (𝐺 ↾ 𝐶) Fn 𝐶) |
17 | ssexg 5323 | . . . 4 ⊢ ((𝐶 ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐶 ∈ V) | |
18 | 10, 3, 17 | sylancr 587 | . . 3 ⊢ (𝜑 → 𝐶 ∈ V) |
19 | inidm 4218 | . . 3 ⊢ (𝐶 ∩ 𝐶) = 𝐶 | |
20 | fvres 6910 | . . . 4 ⊢ (𝑥 ∈ 𝐶 → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥)) | |
21 | 20 | adantl 482 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥)) |
22 | fvres 6910 | . . . 4 ⊢ (𝑥 ∈ 𝐶 → ((𝐺 ↾ 𝐶)‘𝑥) = (𝐺‘𝑥)) | |
23 | 22 | adantl 482 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐺 ↾ 𝐶)‘𝑥) = (𝐺‘𝑥)) |
24 | 12, 16, 18, 18, 19, 21, 23 | offval 7678 | . 2 ⊢ (𝜑 → ((𝐹 ↾ 𝐶) ∘f 𝑅(𝐺 ↾ 𝐶)) = (𝑥 ∈ 𝐶 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
25 | 8, 24 | eqtr4d 2775 | 1 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = ((𝐹 ↾ 𝐶) ∘f 𝑅(𝐺 ↾ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 Vcvv 3474 ∩ cin 3947 ⊆ wss 3948 ↦ cmpt 5231 ↾ cres 5678 Fn wfn 6538 ‘cfv 6543 (class class class)co 7408 ∘f cof 7667 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7411 df-oprab 7412 df-mpo 7413 df-of 7669 |
This theorem is referenced by: ofoafg 42094 |
Copyright terms: Public domain | W3C validator |