| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > offval3 | Structured version Visualization version GIF version | ||
| Description: General value of (𝐹 ∘f 𝑅𝐺) with no assumptions on functionality of 𝐹 and 𝐺. (Contributed by Stefan O'Rear, 24-Jan-2015.) |
| Ref | Expression |
|---|---|
| offval3 | ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 3475 | . . 3 ⊢ (𝐹 ∈ 𝑉 → 𝐹 ∈ V) | |
| 2 | 1 | adantr 484 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → 𝐹 ∈ V) |
| 3 | elex 3475 | . . 3 ⊢ (𝐺 ∈ 𝑊 → 𝐺 ∈ V) | |
| 4 | 3 | adantl 485 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → 𝐺 ∈ V) |
| 5 | dmexg 7882 | . . . 4 ⊢ (𝐹 ∈ 𝑉 → dom 𝐹 ∈ V) | |
| 6 | inex1g 5275 | . . . 4 ⊢ (dom 𝐹 ∈ V → (dom 𝐹 ∩ dom 𝐺) ∈ V) | |
| 7 | mptexg 7205 | . . . 4 ⊢ ((dom 𝐹 ∩ dom 𝐺) ∈ V → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V) | |
| 8 | 5, 6, 7 | 3syl 18 | . . 3 ⊢ (𝐹 ∈ 𝑉 → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V) |
| 9 | 8 | adantr 484 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V) |
| 10 | dmeq 5879 | . . . . 5 ⊢ (𝑎 = 𝐹 → dom 𝑎 = dom 𝐹) | |
| 11 | dmeq 5879 | . . . . 5 ⊢ (𝑏 = 𝐺 → dom 𝑏 = dom 𝐺) | |
| 12 | 10, 11 | ineqan12d 4174 | . . . 4 ⊢ ((𝑎 = 𝐹 ∧ 𝑏 = 𝐺) → (dom 𝑎 ∩ dom 𝑏) = (dom 𝐹 ∩ dom 𝐺)) |
| 13 | fveq1 6866 | . . . . 5 ⊢ (𝑎 = 𝐹 → (𝑎‘𝑥) = (𝐹‘𝑥)) | |
| 14 | fveq1 6866 | . . . . 5 ⊢ (𝑏 = 𝐺 → (𝑏‘𝑥) = (𝐺‘𝑥)) | |
| 15 | 13, 14 | oveqan12d 7415 | . . . 4 ⊢ ((𝑎 = 𝐹 ∧ 𝑏 = 𝐺) → ((𝑎‘𝑥)𝑅(𝑏‘𝑥)) = ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) |
| 16 | 12, 15 | mpteq12dv 5187 | . . 3 ⊢ ((𝑎 = 𝐹 ∧ 𝑏 = 𝐺) → (𝑥 ∈ (dom 𝑎 ∩ dom 𝑏) ↦ ((𝑎‘𝑥)𝑅(𝑏‘𝑥))) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 17 | df-of 7660 | . . 3 ⊢ ∘f 𝑅 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑥 ∈ (dom 𝑎 ∩ dom 𝑏) ↦ ((𝑎‘𝑥)𝑅(𝑏‘𝑥)))) | |
| 18 | 16, 17 | ovmpoga 7550 | . 2 ⊢ ((𝐹 ∈ V ∧ 𝐺 ∈ V ∧ (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V) → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 19 | 2, 4, 9, 18 | syl3anc 1390 | 1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1560 ∈ wcel 2142 Vcvv 3454 ∩ cin 3903 ↦ cmpt 5181 dom cdm 5647 ‘cfv 6521 (class class class)co 7396 ∘f cof 7658 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pr 5390 ax-un 7718 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-ov 7399 df-oprab 7400 df-mpo 7401 df-of 7660 |
| This theorem is referenced by: offres 7964 offsplitfpar 8098 ofco2 22511 dvsinax 46487 dvcosax 46500 fdivval 49161 |
| Copyright terms: Public domain | W3C validator |