Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ipasslem4 | Structured version Visualization version GIF version |
Description: Lemma for ipassi 28876. 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 11837 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (1 / 𝑁) ∈ ℝ) | |
2 | 1 | recnd 10826 | . . . 4 ⊢ (𝑁 ∈ ℕ → (1 / 𝑁) ∈ ℂ) |
3 | ip1i.9 | . . . . . 6 ⊢ 𝑈 ∈ CPreHilOLD | |
4 | 3 | phnvi 28851 | . . . . 5 ⊢ 𝑈 ∈ NrmCVec |
5 | ip1i.1 | . . . . . 6 ⊢ 𝑋 = (BaseSet‘𝑈) | |
6 | ip1i.4 | . . . . . 6 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
7 | 5, 6 | nvscl 28661 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (1 / 𝑁) ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) |
8 | 4, 7 | mp3an1 1450 | . . . 4 ⊢ (((1 / 𝑁) ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) |
9 | 2, 8 | sylan 583 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) |
10 | ipasslem1.b | . . . 4 ⊢ 𝐵 ∈ 𝑋 | |
11 | ip1i.7 | . . . . 5 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
12 | 5, 11 | dipcl 28747 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ ((1 / 𝑁)𝑆𝐴) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) ∈ ℂ) |
13 | 4, 10, 12 | mp3an13 1454 | . . 3 ⊢ (((1 / 𝑁)𝑆𝐴) ∈ 𝑋 → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) ∈ ℂ) |
14 | 9, 13 | syl 17 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) ∈ ℂ) |
15 | 5, 11 | dipcl 28747 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑃𝐵) ∈ ℂ) |
16 | 4, 10, 15 | mp3an13 1454 | . . 3 ⊢ (𝐴 ∈ 𝑋 → (𝐴𝑃𝐵) ∈ ℂ) |
17 | mulcl 10778 | . . 3 ⊢ (((1 / 𝑁) ∈ ℂ ∧ (𝐴𝑃𝐵) ∈ ℂ) → ((1 / 𝑁) · (𝐴𝑃𝐵)) ∈ ℂ) | |
18 | 2, 16, 17 | syl2an 599 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁) · (𝐴𝑃𝐵)) ∈ ℂ) |
19 | nncn 11803 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
20 | 19 | adantr 484 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝑁 ∈ ℂ) |
21 | nnne0 11829 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0) | |
22 | 21 | adantr 484 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝑁 ≠ 0) |
23 | 19, 21 | recidd 11568 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (𝑁 · (1 / 𝑁)) = 1) |
24 | 23 | oveq1d 7206 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (1 · (𝐴𝑃𝐵))) |
25 | 16 | mulid2d 10816 | . . . . 5 ⊢ (𝐴 ∈ 𝑋 → (1 · (𝐴𝑃𝐵)) = (𝐴𝑃𝐵)) |
26 | 24, 25 | sylan9eq 2791 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (𝐴𝑃𝐵)) |
27 | 23 | oveq1d 7206 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → ((𝑁 · (1 / 𝑁))𝑆𝐴) = (1𝑆𝐴)) |
28 | 5, 6 | nvsid 28662 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (1𝑆𝐴) = 𝐴) |
29 | 4, 28 | mpan 690 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑋 → (1𝑆𝐴) = 𝐴) |
30 | 27, 29 | sylan9eq 2791 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁))𝑆𝐴) = 𝐴) |
31 | 2 | adantr 484 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (1 / 𝑁) ∈ ℂ) |
32 | simpr 488 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
33 | 5, 6 | nvsass 28663 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝑁 ∈ ℂ ∧ (1 / 𝑁) ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → ((𝑁 · (1 / 𝑁))𝑆𝐴) = (𝑁𝑆((1 / 𝑁)𝑆𝐴))) |
34 | 4, 33 | mpan 690 | . . . . . . 7 ⊢ ((𝑁 ∈ ℂ ∧ (1 / 𝑁) ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁))𝑆𝐴) = (𝑁𝑆((1 / 𝑁)𝑆𝐴))) |
35 | 20, 31, 32, 34 | syl3anc 1373 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁))𝑆𝐴) = (𝑁𝑆((1 / 𝑁)𝑆𝐴))) |
36 | 30, 35 | eqtr3d 2773 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝐴 = (𝑁𝑆((1 / 𝑁)𝑆𝐴))) |
37 | 36 | oveq1d 7206 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (𝐴𝑃𝐵) = ((𝑁𝑆((1 / 𝑁)𝑆𝐴))𝑃𝐵)) |
38 | nnnn0 12062 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
39 | 38 | adantr 484 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝑁 ∈ ℕ0) |
40 | ip1i.2 | . . . . . 6 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
41 | 5, 40, 6, 11, 3, 10 | ipasslem1 28866 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) → ((𝑁𝑆((1 / 𝑁)𝑆𝐴))𝑃𝐵) = (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵))) |
42 | 39, 9, 41 | syl2anc 587 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁𝑆((1 / 𝑁)𝑆𝐴))𝑃𝐵) = (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵))) |
43 | 26, 37, 42 | 3eqtrd 2775 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵))) |
44 | 16 | adantl 485 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (𝐴𝑃𝐵) ∈ ℂ) |
45 | 20, 31, 44 | mulassd 10821 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (𝑁 · ((1 / 𝑁) · (𝐴𝑃𝐵)))) |
46 | 43, 45 | eqtr3d 2773 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵)) = (𝑁 · ((1 / 𝑁) · (𝐴𝑃𝐵)))) |
47 | 14, 18, 20, 22, 46 | mulcanad 11432 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) = ((1 / 𝑁) · (𝐴𝑃𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2112 ≠ wne 2932 ‘cfv 6358 (class class class)co 7191 ℂcc 10692 0cc0 10694 1c1 10695 · cmul 10699 / cdiv 11454 ℕcn 11795 ℕ0cn0 12055 NrmCVeccnv 28619 +𝑣 cpv 28620 BaseSetcba 28621 ·𝑠OLD cns 28622 ·𝑖OLDcdip 28735 CPreHilOLDccphlo 28847 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-rep 5164 ax-sep 5177 ax-nul 5184 ax-pow 5243 ax-pr 5307 ax-un 7501 ax-inf2 9234 ax-cnex 10750 ax-resscn 10751 ax-1cn 10752 ax-icn 10753 ax-addcl 10754 ax-addrcl 10755 ax-mulcl 10756 ax-mulrcl 10757 ax-mulcom 10758 ax-addass 10759 ax-mulass 10760 ax-distr 10761 ax-i2m1 10762 ax-1ne0 10763 ax-1rid 10764 ax-rnegex 10765 ax-rrecex 10766 ax-cnre 10767 ax-pre-lttri 10768 ax-pre-lttrn 10769 ax-pre-ltadd 10770 ax-pre-mulgt0 10771 ax-pre-sup 10772 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-nel 3037 df-ral 3056 df-rex 3057 df-reu 3058 df-rmo 3059 df-rab 3060 df-v 3400 df-sbc 3684 df-csb 3799 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-pss 3872 df-nul 4224 df-if 4426 df-pw 4501 df-sn 4528 df-pr 4530 df-tp 4532 df-op 4534 df-uni 4806 df-int 4846 df-iun 4892 df-br 5040 df-opab 5102 df-mpt 5121 df-tr 5147 df-id 5440 df-eprel 5445 df-po 5453 df-so 5454 df-fr 5494 df-se 5495 df-we 5496 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-pred 6140 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6316 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-isom 6367 df-riota 7148 df-ov 7194 df-oprab 7195 df-mpo 7196 df-om 7623 df-1st 7739 df-2nd 7740 df-wrecs 8025 df-recs 8086 df-rdg 8124 df-1o 8180 df-er 8369 df-en 8605 df-dom 8606 df-sdom 8607 df-fin 8608 df-sup 9036 df-oi 9104 df-card 9520 df-pnf 10834 df-mnf 10835 df-xr 10836 df-ltxr 10837 df-le 10838 df-sub 11029 df-neg 11030 df-div 11455 df-nn 11796 df-2 11858 df-3 11859 df-4 11860 df-n0 12056 df-z 12142 df-uz 12404 df-rp 12552 df-fz 13061 df-fzo 13204 df-seq 13540 df-exp 13601 df-hash 13862 df-cj 14627 df-re 14628 df-im 14629 df-sqrt 14763 df-abs 14764 df-clim 15014 df-sum 15215 df-grpo 28528 df-gid 28529 df-ginv 28530 df-ablo 28580 df-vc 28594 df-nv 28627 df-va 28630 df-ba 28631 df-sm 28632 df-0v 28633 df-nmcv 28635 df-dip 28736 df-ph 28848 |
This theorem is referenced by: ipasslem5 28870 |
Copyright terms: Public domain | W3C validator |