| 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 30681 | . . 3 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → 〈𝐺, 𝑆〉 ∈ CVecOLD) | |
| 2 | vcex 30665 | . . 3 ⊢ (〈𝐺, 𝑆〉 ∈ CVecOLD → (𝐺 ∈ V ∧ 𝑆 ∈ V)) | |
| 3 | 1, 2 | syl 17 | . 2 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → (𝐺 ∈ V ∧ 𝑆 ∈ V)) |
| 4 | nvss 30680 | . . . 4 ⊢ NrmCVec ⊆ (CVecOLD × V) | |
| 5 | 4 | sseli 3931 | . . 3 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → 〈〈𝐺, 𝑆〉, 𝑁〉 ∈ (CVecOLD × V)) |
| 6 | opelxp2 5675 | . . 3 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ (CVecOLD × V) → 𝑁 ∈ V) | |
| 7 | 5, 6 | syl 17 | . 2 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → 𝑁 ∈ V) |
| 8 | df-3an 1089 | . 2 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ V ∧ 𝑁 ∈ V) ↔ ((𝐺 ∈ V ∧ 𝑆 ∈ V) ∧ 𝑁 ∈ V)) | |
| 9 | 3, 7, 8 | sylanbrc 584 | 1 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec → (𝐺 ∈ V ∧ 𝑆 ∈ V ∧ 𝑁 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 ∈ wcel 2114 Vcvv 3442 〈cop 4588 × cxp 5630 CVecOLDcvc 30645 NrmCVeccnv 30671 |
| 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-11 2163 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| 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-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5638 df-rel 5639 df-oprab 7372 df-vc 30646 df-nv 30679 |
| This theorem is referenced by: isnv 30699 h2hva 31061 h2hsm 31062 h2hnm 31063 |
| Copyright terms: Public domain | W3C validator |