| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nvex | Structured version Visualization version GIF version | ||
| Description: The components of a normed complex vector space are sets. (Contributed by NM, 5-Jun-2008.) (Revised by Mario Carneiro, 1-May-2015.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nvex | ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → (𝐺 ∈ V ∧ 𝑆 ∈ V ∧ 𝑁 ∈ V)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nvvcop 30887 | . . 3 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → 〈𝐺, 𝑆〉 ∈ CVecOLD) | |
| 2 | vcex 30871 | . . 3 ⊢ (〈𝐺, 𝑆〉 ∈ CVecOLD → (𝐺 ∈ V ∧ 𝑆 ∈ V)) | |
| 3 | 1, 2 | syl 18 | . 2 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → (𝐺 ∈ V ∧ 𝑆 ∈ V)) |
| 4 | nvss 30886 | . . . 4 ⊢ NrmCVec ⊆ (CVecOLD × V) | |
| 5 | 4 | sseli 3939 | . . 3 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → 〈〈𝐺, 𝑆〉, 𝑁〉 ∈ (CVecOLD × V)) |
| 6 | opelxp2 5705 | . . 3 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ (CVecOLD × V) → 𝑁 ∈ V) | |
| 7 | 5, 6 | syl 18 | . 2 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → 𝑁 ∈ V) |
| 8 | df-3an 1103 | . 2 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ V ∧ 𝑁 ∈ V) ↔ ((𝐺 ∈ V ∧ 𝑆 ∈ V) ∧ 𝑁 ∈ V)) | |
| 9 | 3, 7, 8 | sylanbrc 594 | 1 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → (𝐺 ∈ V ∧ 𝑆 ∈ V ∧ 𝑁 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 ∈ wcel 2149 Vcvv 3461 〈cop 4598 × cxp 5660 CVecOLDcvc 30851 NrmCVeccnv 30877 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-11 2198 ax-ext 2741 ax-sep 5259 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rex 3096 df-rab 3423 df-v 3463 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4491 df-sn 4593 df-pr 4595 df-op 4599 df-br 5112 df-opab 5176 df-xp 5668 df-rel 5669 df-oprab 7415 df-vc 30852 df-nv 30885 |
| This theorem is referenced by: isnv 30905 h2hva 31267 h2hsm 31268 h2hnm 31269 |
| Copyright terms: Public domain | W3C validator |