| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > smfval | Structured version Visualization version GIF version | ||
| Description: Value of the function for the scalar multiplication operation on a normed complex vector space. (Contributed by NM, 24-Apr-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| smfval.4 | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
| Ref | Expression |
|---|---|
| smfval | ⊢ 𝑆 = (2nd ‘(1st ‘𝑈)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | smfval.4 | . 2 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 2 | df-sm 31181 | . . . . 5 ⊢ ·𝑠OLD = (2nd ∘ 1st ) | |
| 3 | 2 | fveq1i 6878 | . . . 4 ⊢ ( ·𝑠OLD ‘𝑈) = ((2nd ∘ 1st )‘𝑈) |
| 4 | fo1st 8010 | . . . . . 6 ⊢ 1st :V–onto→V | |
| 5 | fof 6788 | . . . . . 6 ⊢ (1st :V–onto→V → 1st :V⟶V) | |
| 6 | 4, 5 | ax-mp 5 | . . . . 5 ⊢ 1st :V⟶V |
| 7 | fvco3 6977 | . . . . 5 ⊢ ((1st :V⟶V ∧ 𝑈 ∈ V) → ((2nd ∘ 1st )‘𝑈) = (2nd ‘(1st ‘𝑈))) | |
| 8 | 6, 7 | mpan 703 | . . . 4 ⊢ (𝑈 ∈ V → ((2nd ∘ 1st )‘𝑈) = (2nd ‘(1st ‘𝑈))) |
| 9 | 3, 8 | eqtrid 2808 | . . 3 ⊢ (𝑈 ∈ V → ( ·𝑠OLD ‘𝑈) = (2nd ‘(1st ‘𝑈))) |
| 10 | fvprc 6869 | . . . 4 ⊢ (¬ 𝑈 ∈ V → ( ·𝑠OLD ‘𝑈) = ∅) | |
| 11 | fvprc 6869 | . . . . . 6 ⊢ (¬ 𝑈 ∈ V → (1st ‘𝑈) = ∅) | |
| 12 | 11 | fveq2d 6881 | . . . . 5 ⊢ (¬ 𝑈 ∈ V → (2nd ‘(1st ‘𝑈)) = (2nd ‘∅)) |
| 13 | 2nd0 7997 | . . . . 5 ⊢ (2nd ‘∅) = ∅ | |
| 14 | 12, 13 | eqtr2di 2813 | . . . 4 ⊢ (¬ 𝑈 ∈ V → ∅ = (2nd ‘(1st ‘𝑈))) |
| 15 | 10, 14 | eqtrd 2796 | . . 3 ⊢ (¬ 𝑈 ∈ V → ( ·𝑠OLD ‘𝑈) = (2nd ‘(1st ‘𝑈))) |
| 16 | 9, 15 | pm2.61i 184 | . 2 ⊢ ( ·𝑠OLD ‘𝑈) = (2nd ‘(1st ‘𝑈)) |
| 17 | 1, 16 | eqtri 2784 | 1 ⊢ 𝑆 = (2nd ‘(1st ‘𝑈)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∈ wcel 2145 Vcvv 3451 ∅c0 4279 ∘ ccom 5655 ⟶wf 6527 –onto→wfo 6529 ‘cfv 6531 1st c1st 7988 2nd c2nd 7989 ·𝑠OLD cns 31171 |
| 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-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7740 |
| 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-rab 3414 df-v 3453 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-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 6487 df-fun 6533 df-fn 6534 df-f 6535 df-fo 6537 df-fv 6539 df-1st 7990 df-2nd 7991 df-sm 31181 |
| This theorem is used by: nvvop 31193 nvsf 31203 nvscl 31210 nvsid 31211 nvsass 31212 nvdi 31214 nvdir 31215 nv2 31216 nv0 31221 nvsz 31222 nvinv 31223 nvtri 31254 cnnvs 31264 phop 31402 ipdirilem 31413 h2hsm 31559 hhsssm 31842 |
| Copyright terms: Public domain | W3C validator |