| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ipval2lem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for ipval3 31222. (Contributed by NM, 1-Feb-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dipfval.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| dipfval.2 | ⊢ 𝐺 = ( +𝑣 ‘𝑈) |
| dipfval.4 | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
| dipfval.6 | ⊢ 𝑁 = (normCV‘𝑈) |
| dipfval.7 | ⊢ 𝑃 = (·𝑖OLD‘𝑈) |
| Ref | Expression |
|---|---|
| ipval2lem3 | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘(𝐴𝐺𝐵))↑2) ∈ ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dipfval.1 | . . . . . . 7 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 2 | dipfval.4 | . . . . . . 7 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 3 | 1, 2 | nvsid 31140 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → (1𝑆𝐵) = 𝐵) |
| 4 | 3 | oveq2d 7432 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(1𝑆𝐵)) = (𝐴𝐺𝐵)) |
| 5 | 4 | fveq2d 6885 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐺(1𝑆𝐵))) = (𝑁‘(𝐴𝐺𝐵))) |
| 6 | 5 | oveq1d 7431 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → ((𝑁‘(𝐴𝐺(1𝑆𝐵)))↑2) = ((𝑁‘(𝐴𝐺𝐵))↑2)) |
| 7 | 6 | 3adant2 1149 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘(𝐴𝐺(1𝑆𝐵)))↑2) = ((𝑁‘(𝐴𝐺𝐵))↑2)) |
| 8 | ax-1cn 11207 | . . 3 ⊢ 1 ∈ ℂ | |
| 9 | dipfval.2 | . . . 4 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
| 10 | dipfval.6 | . . . 4 ⊢ 𝑁 = (normCV‘𝑈) | |
| 11 | dipfval.7 | . . . 4 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
| 12 | 1, 9, 2, 10, 11 | ipval2lem2 31217 | . . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 1 ∈ ℂ) → ((𝑁‘(𝐴𝐺(1𝑆𝐵)))↑2) ∈ ℝ) |
| 13 | 8, 12 | mpan2 704 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘(𝐴𝐺(1𝑆𝐵)))↑2) ∈ ℝ) |
| 14 | 7, 13 | eqeltrrd 2861 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘(𝐴𝐺𝐵))↑2) ∈ ℝ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ‘cfv 6535 (class class class)co 7416 ℂcc 11147 ℝcr 11148 1c1 11150 2c2 12344 ↑cexp 14150 NrmCVeccnv 31097 +𝑣 cpv 31098 BaseSetcba 31099 ·𝑠OLD cns 31100 normCVcnmcv 31103 ·𝑖OLDcdip 31213 |
| 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 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7742 ax-cnex 11205 ax-resscn 11206 ax-1cn 11207 ax-icn 11208 ax-addcl 11209 ax-addrcl 11210 ax-mulcl 11211 ax-mulrcl 11212 ax-mulcom 11213 ax-addass 11214 ax-mulass 11215 ax-distr 11216 ax-i2m1 11217 ax-1ne0 11218 ax-1rid 11219 ax-rnegex 11220 ax-rrecex 11221 ax-cnre 11222 ax-pre-lttri 11223 ax-pre-lttrn 11224 ax-pre-ltadd 11225 ax-pre-mulgt0 11226 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6301 df-ord 6362 df-on 6363 df-lim 6364 df-suc 6365 df-iota 6491 df-fun 6537 df-fn 6538 df-f 6539 df-f1 6540 df-fo 6541 df-f1o 6542 df-fv 6543 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8285 df-wrecs 8316 df-recs 8365 df-rdg 8404 df-er 8703 df-en 8960 df-dom 8961 df-sdom 8962 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11492 df-neg 11493 df-nn 12283 df-2 12352 df-n0 12554 df-z 12641 df-uz 12913 df-seq 14091 df-exp 14151 df-grpo 31006 df-ablo 31058 df-vc 31072 df-nv 31105 df-va 31108 df-ba 31109 df-sm 31110 df-0v 31111 df-nmcv 31113 |
| This theorem is used by: ipval2 31220 dipcj 31227 dip0r 31230 |
| Copyright terms: Public domain | W3C validator |