| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ipasslem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for ipassi 30822. 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 12282 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (1 / 𝑁) ∈ ℝ) | |
| 2 | 1 | recnd 11263 | . . . 4 ⊢ (𝑁 ∈ ℕ → (1 / 𝑁) ∈ ℂ) |
| 3 | ip1i.9 | . . . . . 6 ⊢ 𝑈 ∈ CPreHilOLD | |
| 4 | 3 | phnvi 30797 | . . . . 5 ⊢ 𝑈 ∈ NrmCVec |
| 5 | ip1i.1 | . . . . . 6 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 6 | ip1i.4 | . . . . . 6 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 7 | 5, 6 | nvscl 30607 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (1 / 𝑁) ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) |
| 8 | 4, 7 | mp3an1 1450 | . . . 4 ⊢ (((1 / 𝑁) ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) |
| 9 | 2, 8 | sylan 580 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) |
| 10 | ipasslem1.b | . . . 4 ⊢ 𝐵 ∈ 𝑋 | |
| 11 | ip1i.7 | . . . . 5 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
| 12 | 5, 11 | dipcl 30693 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ ((1 / 𝑁)𝑆𝐴) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) ∈ ℂ) |
| 13 | 4, 10, 12 | mp3an13 1454 | . . 3 ⊢ (((1 / 𝑁)𝑆𝐴) ∈ 𝑋 → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) ∈ ℂ) |
| 14 | 9, 13 | syl 17 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) ∈ ℂ) |
| 15 | 5, 11 | dipcl 30693 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑃𝐵) ∈ ℂ) |
| 16 | 4, 10, 15 | mp3an13 1454 | . . 3 ⊢ (𝐴 ∈ 𝑋 → (𝐴𝑃𝐵) ∈ ℂ) |
| 17 | mulcl 11213 | . . 3 ⊢ (((1 / 𝑁) ∈ ℂ ∧ (𝐴𝑃𝐵) ∈ ℂ) → ((1 / 𝑁) · (𝐴𝑃𝐵)) ∈ ℂ) | |
| 18 | 2, 16, 17 | syl2an 596 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((1 / 𝑁) · (𝐴𝑃𝐵)) ∈ ℂ) |
| 19 | nncn 12248 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
| 20 | 19 | adantr 480 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝑁 ∈ ℂ) |
| 21 | nnne0 12274 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0) | |
| 22 | 21 | adantr 480 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝑁 ≠ 0) |
| 23 | 19, 21 | recidd 12012 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (𝑁 · (1 / 𝑁)) = 1) |
| 24 | 23 | oveq1d 7420 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (1 · (𝐴𝑃𝐵))) |
| 25 | 16 | mullidd 11253 | . . . . 5 ⊢ (𝐴 ∈ 𝑋 → (1 · (𝐴𝑃𝐵)) = (𝐴𝑃𝐵)) |
| 26 | 24, 25 | sylan9eq 2790 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (𝐴𝑃𝐵)) |
| 27 | 23 | oveq1d 7420 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → ((𝑁 · (1 / 𝑁))𝑆𝐴) = (1𝑆𝐴)) |
| 28 | 5, 6 | nvsid 30608 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (1𝑆𝐴) = 𝐴) |
| 29 | 4, 28 | mpan 690 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑋 → (1𝑆𝐴) = 𝐴) |
| 30 | 27, 29 | sylan9eq 2790 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁))𝑆𝐴) = 𝐴) |
| 31 | 2 | adantr 480 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (1 / 𝑁) ∈ ℂ) |
| 32 | simpr 484 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 33 | 5, 6 | nvsass 30609 | . . . . . . . 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 2772 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝐴 = (𝑁𝑆((1 / 𝑁)𝑆𝐴))) |
| 37 | 36 | oveq1d 7420 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (𝐴𝑃𝐵) = ((𝑁𝑆((1 / 𝑁)𝑆𝐴))𝑃𝐵)) |
| 38 | nnnn0 12508 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
| 39 | 38 | adantr 480 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → 𝑁 ∈ ℕ0) |
| 40 | ip1i.2 | . . . . . 6 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
| 41 | 5, 40, 6, 11, 3, 10 | ipasslem1 30812 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ ((1 / 𝑁)𝑆𝐴) ∈ 𝑋) → ((𝑁𝑆((1 / 𝑁)𝑆𝐴))𝑃𝐵) = (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵))) |
| 42 | 39, 9, 41 | syl2anc 584 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁𝑆((1 / 𝑁)𝑆𝐴))𝑃𝐵) = (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵))) |
| 43 | 26, 37, 42 | 3eqtrd 2774 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵))) |
| 44 | 16 | adantl 481 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (𝐴𝑃𝐵) ∈ ℂ) |
| 45 | 20, 31, 44 | mulassd 11258 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → ((𝑁 · (1 / 𝑁)) · (𝐴𝑃𝐵)) = (𝑁 · ((1 / 𝑁) · (𝐴𝑃𝐵)))) |
| 46 | 43, 45 | eqtr3d 2772 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (𝑁 · (((1 / 𝑁)𝑆𝐴)𝑃𝐵)) = (𝑁 · ((1 / 𝑁) · (𝐴𝑃𝐵)))) |
| 47 | 14, 18, 20, 22, 46 | mulcanad 11872 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ 𝑋) → (((1 / 𝑁)𝑆𝐴)𝑃𝐵) = ((1 / 𝑁) · (𝐴𝑃𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 ≠ wne 2932 ‘cfv 6531 (class class class)co 7405 ℂcc 11127 0cc0 11129 1c1 11130 · cmul 11134 / cdiv 11894 ℕcn 12240 ℕ0cn0 12501 NrmCVeccnv 30565 +𝑣 cpv 30566 BaseSetcba 30567 ·𝑠OLD cns 30568 ·𝑖OLDcdip 30681 CPreHilOLDccphlo 30793 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-inf2 9655 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-pre-sup 11207 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8719 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-sup 9454 df-oi 9524 df-card 9953 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-2 12303 df-3 12304 df-4 12305 df-n0 12502 df-z 12589 df-uz 12853 df-rp 13009 df-fz 13525 df-fzo 13672 df-seq 14020 df-exp 14080 df-hash 14349 df-cj 15118 df-re 15119 df-im 15120 df-sqrt 15254 df-abs 15255 df-clim 15504 df-sum 15703 df-grpo 30474 df-gid 30475 df-ginv 30476 df-ablo 30526 df-vc 30540 df-nv 30573 df-va 30576 df-ba 30577 df-sm 30578 df-0v 30579 df-nmcv 30581 df-dip 30682 df-ph 30794 |
| This theorem is referenced by: ipasslem5 30816 |
| Copyright terms: Public domain | W3C validator |