| 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 30927 | . . 3 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → 〈𝐺, 𝑆〉 ∈ CVecOLD) | |
| 2 | vcex 30911 | . . 3 ⊢ (〈𝐺, 𝑆〉 ∈ CVecOLD → (𝐺 ∈ V ∧ 𝑆 ∈ V)) | |
| 3 | 1, 2 | syl 18 | . 2 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → (𝐺 ∈ V ∧ 𝑆 ∈ V)) |
| 4 | nvss 30926 | . . . 4 ⊢ NrmCVec ⊆ (CVecOLD × V) | |
| 5 | 4 | sseli 3934 | . . 3 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → 〈〈𝐺, 𝑆〉, 𝑁〉 ∈ (CVecOLD × V)) |
| 6 | opelxp2 5706 | . . 3 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ (CVecOLD × V) → 𝑁 ∈ V) | |
| 7 | 5, 6 | syl 18 | . 2 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → 𝑁 ∈ V) |
| 8 | df-3an 1105 | . 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 1103 ∈ wcel 2143 Vcvv 3455 〈cop 4596 × cxp 5661 CVecOLDcvc 30891 NrmCVeccnv 30917 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-11 2192 ax-ext 2735 ax-sep 5258 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-br 5111 df-opab 5175 df-xp 5669 df-rel 5670 df-oprab 7416 df-vc 30892 df-nv 30925 |
| This theorem is referenced by: isnv 30945 h2hva 31307 h2hsm 31308 h2hnm 31309 |
| Copyright terms: Public domain | W3C validator |