Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ipasslem4 | Structured version Visualization version GIF version |
Description: Lemma for ipassi 28617. Show the inner product associative law for positive integer reciprocals. (Contributed by NM, 27-Apr-2007.) (New usage is discouraged.) |
Ref | Expression |
---|---|
ip1i.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
ip1i.2 | ⊢ 𝐺 = ( +𝑣 ‘𝑈) |
ip1i.4 | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
ip1i.7 | ⊢ 𝑃 = (·𝑖OLD‘𝑈) |
ip1i.9 | ⊢ 𝑈 ∈ CPreHilOLD |
ipasslem1.b | ⊢ 𝐵 ∈ 𝑋 |
Ref | Expression |
---|---|
ipasslem4 | ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) = ((1 / 𝑁) · (𝐴𝑃𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnrecre 11678 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (1 / 𝑁) ∈ ℝ) | |
2 | 1 | recnd 10668 | . . . 4 ⊢ (𝑁 ∈ ℕ → (1 / 𝑁) ∈ ℂ) |
3 | ip1i.9 | . . . . . 6 ⊢ 𝑈 ∈ CPreHilOLD | |
4 | 3 | phnvi 28592 | . . . . 5 ⊢ 𝑈 ∈ NrmCVec |
5 | ip1i.1 | . . . . . 6 ⊢ 𝑋 = (BaseSet‘𝑈) | |
6 | ip1i.4 | . . . . . 6 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
7 | 5, 6 | nvscl 28402 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (1 / 𝑁) ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) |
8 | 4, 7 | mp3an1 1444 | . . . 4 ⊢ (((1 / 𝑁) ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) |
9 | 2, 8 | sylan 582 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) |
10 | ipasslem1.b | . . . 4 ⊢ 𝐵 ∈ 𝑋 | |
11 | ip1i.7 | . . . . 5 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
12 | 5, 11 | dipcl 28488 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ ((1 / 𝑁)𝑆𝐴) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) ∈ ℂ) |
13 | 4, 10, 12 | mp3an13 1448 | . . 3 ⊢ (((1 / 𝑁)𝑆𝐴) ∈ 𝑋 → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) ∈ ℂ) |
14 | 9, 13 | syl 17 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) ∈ ℂ) |
15 | 5, 11 | dipcl 28488 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑃𝐵) ∈ ℂ) |
16 | 4, 10, 15 | mp3an13 1448 | . . 3 ⊢ (𝐴 ∈ 𝑋 → (𝐴𝑃𝐵) ∈ ℂ) |
17 | mulcl 10620 | . . 3 ⊢ (((1 / 𝑁) ∈ ℂ ∧ (𝐴𝑃𝐵) ∈ ℂ) → ((1 / 𝑁) · (𝐴𝑃𝐵)) ∈ ℂ) | |
18 | 2, 16, 17 | syl2an 597 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁) · (𝐴𝑃𝐵)) ∈ ℂ) |
19 | nncn 11645 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
20 | 19 | adantr 483 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝑁 ∈ ℂ) |
21 | nnne0 11670 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0) | |
22 | 21 | adantr 483 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝑁 ≠ 0) |
23 | 19, 21 | recidd 11410 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (𝑁 · (1 / 𝑁)) = 1) |
24 | 23 | oveq1d 7170 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (1 · (𝐴𝑃𝐵))) |
25 | 16 | mulid2d 10658 | . . . . 5 ⊢ (𝐴 ∈ 𝑋 → (1 · (𝐴𝑃𝐵)) = (𝐴𝑃𝐵)) |
26 | 24, 25 | sylan9eq 2876 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (𝐴𝑃𝐵)) |
27 | 23 | oveq1d 7170 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → ((𝑁 · (1 / 𝑁))𝑆𝐴) = (1𝑆𝐴)) |
28 | 5, 6 | nvsid 28403 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (1𝑆𝐴) = 𝐴) |
29 | 4, 28 | mpan 688 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑋 → (1𝑆𝐴) = 𝐴) |
30 | 27, 29 | sylan9eq 2876 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁))𝑆𝐴) = 𝐴) |
31 | 2 | adantr 483 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (1 / 𝑁) ∈ ℂ) |
32 | simpr 487 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
33 | 5, 6 | nvsass 28404 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝑁 ∈ ℂ ∧ (1 / 𝑁) ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → ((𝑁 · (1 / 𝑁))𝑆𝐴) = (𝑁𝑆((1 / 𝑁)𝑆𝐴))) |
34 | 4, 33 | mpan 688 | . . . . . . 7 ⊢ ((𝑁 ∈ ℂ ∧ (1 / 𝑁) ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁))𝑆𝐴) = (𝑁𝑆((1 / 𝑁)𝑆𝐴))) |
35 | 20, 31, 32, 34 | syl3anc 1367 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁))𝑆𝐴) = (𝑁𝑆((1 / 𝑁)𝑆𝐴))) |
36 | 30, 35 | eqtr3d 2858 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝐴 = (𝑁𝑆((1 / 𝑁)𝑆𝐴))) |
37 | 36 | oveq1d 7170 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (𝐴𝑃𝐵) = ((𝑁𝑆((1 / 𝑁)𝑆𝐴))𝑃𝐵)) |
38 | nnnn0 11903 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
39 | 38 | adantr 483 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝑁 ∈ ℕ0) |
40 | ip1i.2 | . . . . . 6 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
41 | 5, 40, 6, 11, 3, 10 | ipasslem1 28607 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) → ((𝑁𝑆((1 / 𝑁)𝑆𝐴))𝑃𝐵) = (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵))) |
42 | 39, 9, 41 | syl2anc 586 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁𝑆((1 / 𝑁)𝑆𝐴))𝑃𝐵) = (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵))) |
43 | 26, 37, 42 | 3eqtrd 2860 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵))) |
44 | 16 | adantl 484 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (𝐴𝑃𝐵) ∈ ℂ) |
45 | 20, 31, 44 | mulassd 10663 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (𝑁 · ((1 / 𝑁) · (𝐴𝑃𝐵)))) |
46 | 43, 45 | eqtr3d 2858 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵)) = (𝑁 · ((1 / 𝑁) · (𝐴𝑃𝐵)))) |
47 | 14, 18, 20, 22, 46 | mulcanad 11274 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) = ((1 / 𝑁) · (𝐴𝑃𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 ‘cfv 6354 (class class class)co 7155 ℂcc 10534 0cc0 10536 1c1 10537 · cmul 10541 / cdiv 11296 ℕcn 11637 ℕ0cn0 11896 NrmCVeccnv 28360 +𝑣 cpv 28361 BaseSetcba 28362 ·𝑠OLD cns 28363 ·𝑖OLDcdip 28476 CPreHilOLDccphlo 28588 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-inf2 9103 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 ax-pre-sup 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-fal 1546 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-se 5514 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-isom 6363 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-1o 8101 df-oadd 8105 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-sup 8905 df-oi 8973 df-card 9367 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-div 11297 df-nn 11638 df-2 11699 df-3 11700 df-4 11701 df-n0 11897 df-z 11981 df-uz 12243 df-rp 12389 df-fz 12892 df-fzo 13033 df-seq 13369 df-exp 13429 df-hash 13690 df-cj 14457 df-re 14458 df-im 14459 df-sqrt 14593 df-abs 14594 df-clim 14844 df-sum 15042 df-grpo 28269 df-gid 28270 df-ginv 28271 df-ablo 28321 df-vc 28335 df-nv 28368 df-va 28371 df-ba 28372 df-sm 28373 df-0v 28374 df-nmcv 28376 df-dip 28477 df-ph 28589 |
This theorem is referenced by: ipasslem5 28611 |
Copyright terms: Public domain | W3C validator |