| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lmodindp1 | GIF version | ||
| Description: Two independent (non-colinear) vectors have nonzero sum. (Contributed by NM, 22-Apr-2015.) |
| Ref | Expression |
|---|---|
| lmodindp1.v | ⊢ 𝑉 = (Base‘𝑊) |
| lmodindp1.p | ⊢ + = (+g‘𝑊) |
| lmodindp1.o | ⊢ 0 = (0g‘𝑊) |
| lmodindp1.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| lmodindp1.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| lmodindp1.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| lmodindp1.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| lmodindp1.q | ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌})) |
| Ref | Expression |
|---|---|
| lmodindp1 | ⊢ (𝜑 → (𝑋 + 𝑌) ≠ 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lmodindp1.q | . 2 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌})) | |
| 2 | lmodindp1.w | . . . . . . . 8 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 3 | lmodindp1.x | . . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 4 | lmodindp1.v | . . . . . . . . 9 ⊢ 𝑉 = (Base‘𝑊) | |
| 5 | eqid 2231 | . . . . . . . . 9 ⊢ (invg‘𝑊) = (invg‘𝑊) | |
| 6 | lmodindp1.n | . . . . . . . . 9 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 7 | 4, 5, 6 | lspsnneg 14433 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑋})) |
| 8 | 2, 3, 7 | syl2anc 411 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑋})) |
| 9 | 8 | eqcomd 2237 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{((invg‘𝑊)‘𝑋)})) |
| 10 | 9 | adantr 276 | . . . . 5 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{𝑋}) = (𝑁‘{((invg‘𝑊)‘𝑋)})) |
| 11 | lmodgrp 14307 | . . . . . . . . . 10 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Grp) | |
| 12 | 2, 11 | syl 14 | . . . . . . . . 9 ⊢ (𝜑 → 𝑊 ∈ Grp) |
| 13 | lmodindp1.y | . . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 14 | lmodindp1.p | . . . . . . . . . 10 ⊢ + = (+g‘𝑊) | |
| 15 | lmodindp1.o | . . . . . . . . . 10 ⊢ 0 = (0g‘𝑊) | |
| 16 | 4, 14, 15, 5 | grpinvid1 13634 | . . . . . . . . 9 ⊢ ((𝑊 ∈ Grp ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (((invg‘𝑊)‘𝑋) = 𝑌 ↔ (𝑋 + 𝑌) = 0 )) |
| 17 | 12, 3, 13, 16 | syl3anc 1273 | . . . . . . . 8 ⊢ (𝜑 → (((invg‘𝑊)‘𝑋) = 𝑌 ↔ (𝑋 + 𝑌) = 0 )) |
| 18 | 17 | biimpar 297 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → ((invg‘𝑊)‘𝑋) = 𝑌) |
| 19 | 18 | sneqd 3682 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → {((invg‘𝑊)‘𝑋)} = {𝑌}) |
| 20 | 19 | fveq2d 5643 | . . . . 5 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑌})) |
| 21 | 10, 20 | eqtrd 2264 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{𝑋}) = (𝑁‘{𝑌})) |
| 22 | 21 | ex 115 | . . 3 ⊢ (𝜑 → ((𝑋 + 𝑌) = 0 → (𝑁‘{𝑋}) = (𝑁‘{𝑌}))) |
| 23 | 22 | necon3d 2446 | . 2 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) → (𝑋 + 𝑌) ≠ 0 )) |
| 24 | 1, 23 | mpd 13 | 1 ⊢ (𝜑 → (𝑋 + 𝑌) ≠ 0 ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2202 ≠ wne 2402 {csn 3669 ‘cfv 5326 (class class class)co 6017 Basecbs 13081 +gcplusg 13159 0gc0g 13338 Grpcgrp 13582 invgcminusg 13583 LModclmod 14300 LSpanclspn 14399 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-pre-ltirr 8143 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-pnf 8215 df-mnf 8216 df-ltxr 8218 df-inn 9143 df-2 9201 df-3 9202 df-4 9203 df-5 9204 df-6 9205 df-ndx 13084 df-slot 13085 df-base 13087 df-sets 13088 df-plusg 13172 df-mulr 13173 df-sca 13175 df-vsca 13176 df-0g 13340 df-mgm 13438 df-sgrp 13484 df-mnd 13499 df-grp 13585 df-minusg 13586 df-sbg 13587 df-mgp 13933 df-ur 13972 df-ring 14010 df-lmod 14302 df-lssm 14366 df-lsp 14400 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |