| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ofval | Structured version Visualization version GIF version | ||
| Description: Evaluate a function operation at a point. (Contributed by Mario Carneiro, 20-Jul-2014.) |
| Ref | Expression |
|---|---|
| offval.1 | ⊢ (𝜑 → 𝐹 Fn 𝐴) |
| offval.2 | ⊢ (𝜑 → 𝐺 Fn 𝐵) |
| offval.3 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| offval.4 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
| offval.5 | ⊢ (𝐴 ∩ 𝐵) = 𝑆 |
| ofval.6 | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶) |
| ofval.7 | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷) |
| Ref | Expression |
|---|---|
| ofval | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹 ∘f 𝑅𝐺)‘𝑋) = (𝐶𝑅𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | offval.1 | . . . . 5 ⊢ (𝜑 → 𝐹 Fn 𝐴) | |
| 2 | offval.2 | . . . . 5 ⊢ (𝜑 → 𝐺 Fn 𝐵) | |
| 3 | offval.3 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 4 | offval.4 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
| 5 | offval.5 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) = 𝑆 | |
| 6 | eqidd 2738 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 7 | eqidd 2738 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | offval 7633 | . . . 4 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 9 | 8 | fveq1d 6836 | . . 3 ⊢ (𝜑 → ((𝐹 ∘f 𝑅𝐺)‘𝑋) = ((𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))‘𝑋)) |
| 10 | 9 | adantr 480 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹 ∘f 𝑅𝐺)‘𝑋) = ((𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))‘𝑋)) |
| 11 | fveq2 6834 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
| 12 | fveq2 6834 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋)) | |
| 13 | 11, 12 | oveq12d 7378 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = ((𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
| 14 | eqid 2737 | . . . 4 ⊢ (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) | |
| 15 | ovex 7393 | . . . 4 ⊢ ((𝐹‘𝑋)𝑅(𝐺‘𝑋)) ∈ V | |
| 16 | 13, 14, 15 | fvmpt 6941 | . . 3 ⊢ (𝑋 ∈ 𝑆 → ((𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))‘𝑋) = ((𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
| 17 | 16 | adantl 481 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))‘𝑋) = ((𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
| 18 | inss1 4178 | . . . . . 6 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 19 | 5, 18 | eqsstrri 3970 | . . . . 5 ⊢ 𝑆 ⊆ 𝐴 |
| 20 | 19 | sseli 3918 | . . . 4 ⊢ (𝑋 ∈ 𝑆 → 𝑋 ∈ 𝐴) |
| 21 | ofval.6 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶) | |
| 22 | 20, 21 | sylan2 594 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) = 𝐶) |
| 23 | inss2 4179 | . . . . . 6 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
| 24 | 5, 23 | eqsstrri 3970 | . . . . 5 ⊢ 𝑆 ⊆ 𝐵 |
| 25 | 24 | sseli 3918 | . . . 4 ⊢ (𝑋 ∈ 𝑆 → 𝑋 ∈ 𝐵) |
| 26 | ofval.7 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷) | |
| 27 | 25, 26 | sylan2 594 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → (𝐺‘𝑋) = 𝐷) |
| 28 | 22, 27 | oveq12d 7378 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹‘𝑋)𝑅(𝐺‘𝑋)) = (𝐶𝑅𝐷)) |
| 29 | 10, 17, 28 | 3eqtrd 2776 | 1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹 ∘f 𝑅𝐺)‘𝑋) = (𝐶𝑅𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∩ cin 3889 ↦ cmpt 5167 Fn wfn 6487 ‘cfv 6492 (class class class)co 7360 ∘f cof 7622 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7363 df-oprab 7364 df-mpo 7365 df-of 7624 |
| This theorem is referenced by: fnfvof 7641 offveq 7650 ofc1 7652 ofc2 7653 suppofss1d 8147 suppofss2d 8148 ofsubeq0 12147 ofnegsub 12148 ofsubge0 12149 seqof 14012 o1of2 15566 mndpsuppss 18724 gsumzaddlem 19887 pwspjmhmmgpd 20298 psrbagcon 21915 psrbagleadd1 21918 psrbagconf1o 21919 psrdi 21953 psrdir 21954 mplsubglem 21987 psdmplcl 22138 psdadd 22139 psdmul 22142 psdmvr 22145 matplusgcell 22408 matsubgcell 22409 rrxcph 25369 mbfaddlem 25637 i1faddlem 25670 i1fmullem 25671 itg1lea 25689 mbfi1flimlem 25699 itg2split 25726 itg2monolem1 25727 itg2addlem 25735 dvaddbr 25915 dvmulbr 25916 plyaddlem1 26188 coeeulem 26199 coeaddlem 26224 dgradd2 26243 dgrcolem2 26249 ofmulrt 26258 plydivlem3 26272 plydivlem4 26273 plydiveu 26275 plyrem 26282 vieta1lem2 26288 elqaalem3 26298 qaa 26300 basellem7 27064 basellem9 27066 elrgspnlem1 33318 ply1degltdimlem 33782 circlemethhgt 34803 poimirlem1 37956 poimirlem2 37957 poimirlem6 37961 poimirlem7 37962 poimirlem10 37965 poimirlem11 37966 poimirlem12 37967 poimirlem17 37972 poimirlem20 37975 poimirlem23 37978 poimirlem29 37984 poimirlem31 37986 poimirlem32 37987 broucube 37989 itg2addnclem3 38008 itg2addnc 38009 ftc1anclem5 38032 lfladdcl 39531 ldualvaddval 39591 ofun 42691 mplmapghm 43011 fsuppind 43037 dgrsub2 43581 mpaaeu 43596 caofcan 44768 ofmul12 44770 ofdivrec 44771 ofdivcan4 44772 ofdivdiv2 44773 binomcxplemrat 44795 binomcxplemnotnn0 44801 amgmwlem 50289 |
| Copyright terms: Public domain | W3C validator |