| 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 31086 | . . . . 5 ⊢ ·𝑠OLD = (2nd ∘ 1st ) | |
| 3 | 2 | fveq1i 6883 | . . . 4 ⊢ ( ·𝑠OLD ‘𝑈) = ((2nd ∘ 1st )‘𝑈) |
| 4 | fo1st 8010 | . . . . . 6 ⊢ 1st :V–onto→V | |
| 5 | fof 6793 | . . . . . 6 ⊢ (1st :V–onto→V → 1st :V⟶V) | |
| 6 | 4, 5 | ax-mp 5 | . . . . 5 ⊢ 1st :V⟶V |
| 7 | fvco3 6982 | . . . . 5 ⊢ ((1st :V⟶V ∧ 𝑈 ∈ V) → ((2nd ∘ 1st )‘𝑈) = (2nd ‘(1st ‘𝑈))) | |
| 8 | 6, 7 | mpan 703 | . . . 4 ⊢ (𝑈 ∈ V → ((2nd ∘ 1st )‘𝑈) = (2nd ‘(1st ‘𝑈))) |
| 9 | 3, 8 | eqtrid 2809 | . . 3 ⊢ (𝑈 ∈ V → ( ·𝑠OLD ‘𝑈) = (2nd ‘(1st ‘𝑈))) |
| 10 | fvprc 6874 | . . . 4 ⊢ (¬ 𝑈 ∈ V → ( ·𝑠OLD ‘𝑈) = ∅) | |
| 11 | fvprc 6874 | . . . . . 6 ⊢ (¬ 𝑈 ∈ V → (1st ‘𝑈) = ∅) | |
| 12 | 11 | fveq2d 6886 | . . . . 5 ⊢ (¬ 𝑈 ∈ V → (2nd ‘(1st ‘𝑈)) = (2nd ‘∅)) |
| 13 | 2nd0 7997 | . . . . 5 ⊢ (2nd ‘∅) = ∅ | |
| 14 | 12, 13 | eqtr2di 2814 | . . . 4 ⊢ (¬ 𝑈 ∈ V → ∅ = (2nd ‘(1st ‘𝑈))) |
| 15 | 10, 14 | eqtrd 2797 | . . 3 ⊢ (¬ 𝑈 ∈ V → ( ·𝑠OLD ‘𝑈) = (2nd ‘(1st ‘𝑈))) |
| 16 | 9, 15 | pm2.61i 184 | . 2 ⊢ ( ·𝑠OLD ‘𝑈) = (2nd ‘(1st ‘𝑈)) |
| 17 | 1, 16 | eqtri 2785 | 1 ⊢ 𝑆 = (2nd ‘(1st ‘𝑈)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∈ wcel 2145 Vcvv 3453 ∅c0 4282 ∘ ccom 5663 ⟶wf 6533 –onto→wfo 6535 ‘cfv 6537 1st c1st 7988 2nd c2nd 7989 ·𝑠OLD cns 31076 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fo 6543 df-fv 6545 df-1st 7990 df-2nd 7991 df-sm 31086 |
| This theorem is used by: nvvop 31098 nvsf 31108 nvscl 31115 nvsid 31116 nvsass 31117 nvdi 31119 nvdir 31120 nv2 31121 nv0 31126 nvsz 31127 nvinv 31128 nvtri 31159 cnnvs 31169 phop 31307 ipdirilem 31318 h2hsm 31464 hhsssm 31747 |
| Copyright terms: Public domain | W3C validator |