![]() |
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 2193 | . . . . . . . . 9 ⊢ (invg‘𝑊) = (invg‘𝑊) | |
6 | lmodindp1.n | . . . . . . . . 9 ⊢ 𝑁 = (LSpan‘𝑊) | |
7 | 4, 5, 6 | lspsnneg 13919 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑋})) |
8 | 2, 3, 7 | syl2anc 411 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑋})) |
9 | 8 | eqcomd 2199 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{((invg‘𝑊)‘𝑋)})) |
10 | 9 | adantr 276 | . . . . 5 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{𝑋}) = (𝑁‘{((invg‘𝑊)‘𝑋)})) |
11 | lmodgrp 13793 | . . . . . . . . . 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 13127 | . . . . . . . . 9 ⊢ ((𝑊 ∈ Grp ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (((invg‘𝑊)‘𝑋) = 𝑌 ↔ (𝑋 + 𝑌) = 0 )) |
17 | 12, 3, 13, 16 | syl3anc 1249 | . . . . . . . 8 ⊢ (𝜑 → (((invg‘𝑊)‘𝑋) = 𝑌 ↔ (𝑋 + 𝑌) = 0 )) |
18 | 17 | biimpar 297 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → ((invg‘𝑊)‘𝑋) = 𝑌) |
19 | 18 | sneqd 3632 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → {((invg‘𝑊)‘𝑋)} = {𝑌}) |
20 | 19 | fveq2d 5559 | . . . . 5 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑌})) |
21 | 10, 20 | eqtrd 2226 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{𝑋}) = (𝑁‘{𝑌})) |
22 | 21 | ex 115 | . . 3 ⊢ (𝜑 → ((𝑋 + 𝑌) = 0 → (𝑁‘{𝑋}) = (𝑁‘{𝑌}))) |
23 | 22 | necon3d 2408 | . 2 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) → (𝑋 + 𝑌) ≠ 0 )) |
24 | 1, 23 | mpd 13 | 1 ⊢ (𝜑 → (𝑋 + 𝑌) ≠ 0 ) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2164 ≠ wne 2364 {csn 3619 ‘cfv 5255 (class class class)co 5919 Basecbs 12621 +gcplusg 12698 0gc0g 12870 Grpcgrp 13075 invgcminusg 13076 LModclmod 13786 LSpanclspn 13885 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-addcom 7974 ax-addass 7976 ax-i2m1 7979 ax-0lt1 7980 ax-0id 7982 ax-rnegex 7983 ax-pre-ltirr 7986 ax-pre-ltadd 7990 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-pnf 8058 df-mnf 8059 df-ltxr 8061 df-inn 8985 df-2 9043 df-3 9044 df-4 9045 df-5 9046 df-6 9047 df-ndx 12624 df-slot 12625 df-base 12627 df-sets 12628 df-plusg 12711 df-mulr 12712 df-sca 12714 df-vsca 12715 df-0g 12872 df-mgm 12942 df-sgrp 12988 df-mnd 13001 df-grp 13078 df-minusg 13079 df-sbg 13080 df-mgp 13420 df-ur 13459 df-ring 13497 df-lmod 13788 df-lssm 13852 df-lsp 13886 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |