| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ip2eqi | Structured version Visualization version GIF version | ||
| Description: Two vectors are equal iff their inner products with all other vectors are equal. (Contributed by NM, 24-Jan-2008.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ip2eqi.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| ip2eqi.7 | ⊢ 𝑃 = (·𝑖OLD‘𝑈) |
| ip2eqi.u | ⊢ 𝑈 ∈ CPreHilOLD |
| Ref | Expression |
|---|---|
| ip2eqi | ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 (𝑥𝑃𝐴) = (𝑥𝑃𝐵) ↔ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ip2eqi.u | . . . . . 6 ⊢ 𝑈 ∈ CPreHilOLD | |
| 2 | 1 | phnvi 31109 | . . . . 5 ⊢ 𝑈 ∈ NrmCVec |
| 3 | ip2eqi.1 | . . . . . 6 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 4 | eqid 2769 | . . . . . 6 ⊢ ( −𝑣 ‘𝑈) = ( −𝑣 ‘𝑈) | |
| 5 | 3, 4 | nvmcl 30939 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴( −𝑣 ‘𝑈)𝐵) ∈ 𝑋) |
| 6 | 2, 5 | mp3an1 1474 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴( −𝑣 ‘𝑈)𝐵) ∈ 𝑋) |
| 7 | oveq1 7418 | . . . . . 6 ⊢ (𝑥 = (𝐴( −𝑣 ‘𝑈)𝐵) → (𝑥𝑃𝐴) = ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴)) | |
| 8 | oveq1 7418 | . . . . . 6 ⊢ (𝑥 = (𝐴( −𝑣 ‘𝑈)𝐵) → (𝑥𝑃𝐵) = ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵)) | |
| 9 | 7, 8 | eqeq12d 2785 | . . . . 5 ⊢ (𝑥 = (𝐴( −𝑣 ‘𝑈)𝐵) → ((𝑥𝑃𝐴) = (𝑥𝑃𝐵) ↔ ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) = ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵))) |
| 10 | 9 | rspcv 3586 | . . . 4 ⊢ ((𝐴( −𝑣 ‘𝑈)𝐵) ∈ 𝑋 → (∀𝑥 ∈ 𝑋 (𝑥𝑃𝐴) = (𝑥𝑃𝐵) → ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) = ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵))) |
| 11 | 6, 10 | syl 18 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 (𝑥𝑃𝐴) = (𝑥𝑃𝐵) → ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) = ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵))) |
| 12 | simpl 487 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 13 | simpr 489 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋) | |
| 14 | ip2eqi.7 | . . . . . . . . 9 ⊢ 𝑃 = (·𝑖OLD‘𝑈) | |
| 15 | 3, 4, 14 | dipsubdi 31142 | . . . . . . . 8 ⊢ ((𝑈 ∈ CPreHilOLD ∧ ((𝐴( −𝑣 ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃(𝐴( −𝑣 ‘𝑈)𝐵)) = (((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) − ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵))) |
| 16 | 1, 15 | mpan 702 | . . . . . . 7 ⊢ (((𝐴( −𝑣 ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃(𝐴( −𝑣 ‘𝑈)𝐵)) = (((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) − ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵))) |
| 17 | 6, 12, 13, 16 | syl3anc 1396 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃(𝐴( −𝑣 ‘𝑈)𝐵)) = (((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) − ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵))) |
| 18 | 17 | eqeq1d 2771 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝐴( −𝑣 ‘𝑈)𝐵)𝑃(𝐴( −𝑣 ‘𝑈)𝐵)) = 0 ↔ (((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) − ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵)) = 0)) |
| 19 | eqid 2769 | . . . . . . . 8 ⊢ (0vec‘𝑈) = (0vec‘𝑈) | |
| 20 | 3, 19, 14 | ipz 31012 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴( −𝑣 ‘𝑈)𝐵) ∈ 𝑋) → (((𝐴( −𝑣 ‘𝑈)𝐵)𝑃(𝐴( −𝑣 ‘𝑈)𝐵)) = 0 ↔ (𝐴( −𝑣 ‘𝑈)𝐵) = (0vec‘𝑈))) |
| 21 | 2, 20 | mpan 702 | . . . . . 6 ⊢ ((𝐴( −𝑣 ‘𝑈)𝐵) ∈ 𝑋 → (((𝐴( −𝑣 ‘𝑈)𝐵)𝑃(𝐴( −𝑣 ‘𝑈)𝐵)) = 0 ↔ (𝐴( −𝑣 ‘𝑈)𝐵) = (0vec‘𝑈))) |
| 22 | 6, 21 | syl 18 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝐴( −𝑣 ‘𝑈)𝐵)𝑃(𝐴( −𝑣 ‘𝑈)𝐵)) = 0 ↔ (𝐴( −𝑣 ‘𝑈)𝐵) = (0vec‘𝑈))) |
| 23 | 18, 22 | bitr3d 284 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) − ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵)) = 0 ↔ (𝐴( −𝑣 ‘𝑈)𝐵) = (0vec‘𝑈))) |
| 24 | 3, 14 | dipcl 31005 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴( −𝑣 ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) ∈ ℂ) |
| 25 | 2, 24 | mp3an1 1474 | . . . . . 6 ⊢ (((𝐴( −𝑣 ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) ∈ ℂ) |
| 26 | 6, 12, 25 | syl2anc 595 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) ∈ ℂ) |
| 27 | 3, 14 | dipcl 31005 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴( −𝑣 ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵) ∈ ℂ) |
| 28 | 2, 27 | mp3an1 1474 | . . . . . 6 ⊢ (((𝐴( −𝑣 ‘𝑈)𝐵) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵) ∈ ℂ) |
| 29 | 6, 28 | sylancom 599 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵) ∈ ℂ) |
| 30 | 26, 29 | subeq0ad 11579 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) − ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵)) = 0 ↔ ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) = ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵))) |
| 31 | 3, 4, 19 | nvmeq0 30951 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴( −𝑣 ‘𝑈)𝐵) = (0vec‘𝑈) ↔ 𝐴 = 𝐵)) |
| 32 | 2, 31 | mp3an1 1474 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴( −𝑣 ‘𝑈)𝐵) = (0vec‘𝑈) ↔ 𝐴 = 𝐵)) |
| 33 | 23, 30, 32 | 3bitr3d 312 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐴) = ((𝐴( −𝑣 ‘𝑈)𝐵)𝑃𝐵) ↔ 𝐴 = 𝐵)) |
| 34 | 11, 33 | sylibd 242 | . 2 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 (𝑥𝑃𝐴) = (𝑥𝑃𝐵) → 𝐴 = 𝐵)) |
| 35 | oveq2 7419 | . . 3 ⊢ (𝐴 = 𝐵 → (𝑥𝑃𝐴) = (𝑥𝑃𝐵)) | |
| 36 | 35 | ralrimivw 3167 | . 2 ⊢ (𝐴 = 𝐵 → ∀𝑥 ∈ 𝑋 (𝑥𝑃𝐴) = (𝑥𝑃𝐵)) |
| 37 | 34, 36 | impbid1 228 | 1 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 (𝑥𝑃𝐴) = (𝑥𝑃𝐵) ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ‘cfv 6537 (class class class)co 7411 ℂcc 11098 0cc0 11100 − cmin 11441 NrmCVeccnv 30877 BaseSetcba 30879 0veccn0v 30881 −𝑣 cnsb 30882 ·𝑖OLDcdip 30993 CPreHilOLDccphlo 31105 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-inf2 9610 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 ax-pre-sup 11178 ax-addf 11179 ax-mulf 11180 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7675 df-om 7863 df-1st 7986 df-2nd 7987 df-supp 8157 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-er 8694 df-map 8826 df-ixp 8896 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-fsupp 9322 df-fi 9371 df-sup 9402 df-inf 9403 df-oi 9472 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-div 11872 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-z 12592 df-dec 12712 df-uz 12863 df-q 12973 df-rp 13017 df-xneg 13137 df-xadd 13138 df-xmul 13139 df-ioo 13376 df-icc 13379 df-fz 13536 df-fzo 13683 df-seq 14038 df-exp 14098 df-hash 14367 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287 df-clim 15539 df-sum 15738 df-struct 17207 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-ress 17291 df-plusg 17323 df-mulr 17324 df-starv 17325 df-sca 17326 df-vsca 17327 df-ip 17328 df-tset 17329 df-ple 17330 df-ds 17332 df-unif 17333 df-hom 17334 df-cco 17335 df-rest 17475 df-topn 17476 df-0g 17494 df-gsum 17495 df-topgen 17496 df-pt 17497 df-prds 17500 df-xrs 17556 df-qtop 17561 df-imas 17562 df-xps 17564 df-mre 17638 df-mrc 17639 df-acs 17641 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-submnd 18842 df-mulg 19134 df-cntz 19387 df-cmn 19852 df-psmet 21483 df-xmet 21484 df-met 21485 df-bl 21486 df-mopn 21487 df-cnfld 21492 df-top 23020 df-topon 23037 df-topsp 23059 df-bases 23072 df-cld 23145 df-ntr 23146 df-cls 23147 df-cn 23353 df-cnp 23354 df-t1 23440 df-haus 23441 df-tx 23688 df-hmeo 23881 df-xms 24446 df-ms 24447 df-tms 24448 df-grpo 30786 df-gid 30787 df-ginv 30788 df-gdiv 30789 df-ablo 30838 df-vc 30852 df-nv 30885 df-va 30888 df-ba 30889 df-sm 30890 df-0v 30891 df-vs 30892 df-nmcv 30893 df-ims 30894 df-dip 30994 df-ph 31106 |
| This theorem is referenced by: phoeqi 31150 |
| Copyright terms: Public domain | W3C validator |