Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nvmeq0 | Structured version Visualization version GIF version |
Description: The difference between two vectors is zero iff they are equal. (Contributed by NM, 24-Jan-2008.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nvmeq0.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
nvmeq0.3 | ⊢ 𝑀 = ( −𝑣 ‘𝑈) |
nvmeq0.5 | ⊢ 𝑍 = (0vec‘𝑈) |
Ref | Expression |
---|---|
nvmeq0 | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝑀𝐵) = 𝑍 ↔ 𝐴 = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nvmeq0.1 | . . . . . . 7 ⊢ 𝑋 = (BaseSet‘𝑈) | |
2 | nvmeq0.3 | . . . . . . 7 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
3 | 1, 2 | nvmcl 28350 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑀𝐵) ∈ 𝑋) |
4 | 3 | 3expb 1112 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑀𝐵) ∈ 𝑋) |
5 | nvmeq0.5 | . . . . . . 7 ⊢ 𝑍 = (0vec‘𝑈) | |
6 | 1, 5 | nvzcl 28338 | . . . . . 6 ⊢ (𝑈 ∈ NrmCVec → 𝑍 ∈ 𝑋) |
7 | 6 | adantr 481 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝑍 ∈ 𝑋) |
8 | simprr 769 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → 𝐵 ∈ 𝑋) | |
9 | 4, 7, 8 | 3jca 1120 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝑀𝐵) ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) |
10 | eqid 2818 | . . . . 5 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
11 | 1, 10 | nvrcan 28328 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ ((𝐴𝑀𝐵) ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (((𝐴𝑀𝐵)( +𝑣 ‘𝑈)𝐵) = (𝑍( +𝑣 ‘𝑈)𝐵) ↔ (𝐴𝑀𝐵) = 𝑍)) |
12 | 9, 11 | syldan 591 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (((𝐴𝑀𝐵)( +𝑣 ‘𝑈)𝐵) = (𝑍( +𝑣 ‘𝑈)𝐵) ↔ (𝐴𝑀𝐵) = 𝑍)) |
13 | 12 | 3impb 1107 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝐴𝑀𝐵)( +𝑣 ‘𝑈)𝐵) = (𝑍( +𝑣 ‘𝑈)𝐵) ↔ (𝐴𝑀𝐵) = 𝑍)) |
14 | 1, 10, 2 | nvnpcan 28360 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝑀𝐵)( +𝑣 ‘𝑈)𝐵) = 𝐴) |
15 | 1, 10, 5 | nv0lid 28340 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → (𝑍( +𝑣 ‘𝑈)𝐵) = 𝐵) |
16 | 15 | 3adant2 1123 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑍( +𝑣 ‘𝑈)𝐵) = 𝐵) |
17 | 14, 16 | eqeq12d 2834 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝐴𝑀𝐵)( +𝑣 ‘𝑈)𝐵) = (𝑍( +𝑣 ‘𝑈)𝐵) ↔ 𝐴 = 𝐵)) |
18 | 13, 17 | bitr3d 282 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝑀𝐵) = 𝑍 ↔ 𝐴 = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 ‘cfv 6348 (class class class)co 7145 NrmCVeccnv 28288 +𝑣 cpv 28289 BaseSetcba 28290 0veccn0v 28292 −𝑣 cnsb 28293 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-po 5467 df-so 5468 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-1st 7678 df-2nd 7679 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-ltxr 10668 df-sub 10860 df-neg 10861 df-grpo 28197 df-gid 28198 df-ginv 28199 df-gdiv 28200 df-ablo 28249 df-vc 28263 df-nv 28296 df-va 28299 df-ba 28300 df-sm 28301 df-0v 28302 df-vs 28303 df-nmcv 28304 |
This theorem is referenced by: nvmid 28363 ip2eqi 28560 |
Copyright terms: Public domain | W3C validator |