| 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 2207 | . . . . . . . . 9 ⊢ (invg‘𝑊) = (invg‘𝑊) | |
| 6 | lmodindp1.n | . . . . . . . . 9 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 7 | 4, 5, 6 | lspsnneg 14297 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑋})) |
| 8 | 2, 3, 7 | syl2anc 411 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑋})) |
| 9 | 8 | eqcomd 2213 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{((invg‘𝑊)‘𝑋)})) |
| 10 | 9 | adantr 276 | . . . . 5 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{𝑋}) = (𝑁‘{((invg‘𝑊)‘𝑋)})) |
| 11 | lmodgrp 14171 | . . . . . . . . . 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 13499 | . . . . . . . . 9 ⊢ ((𝑊 ∈ Grp ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (((invg‘𝑊)‘𝑋) = 𝑌 ↔ (𝑋 + 𝑌) = 0 )) |
| 17 | 12, 3, 13, 16 | syl3anc 1250 | . . . . . . . 8 ⊢ (𝜑 → (((invg‘𝑊)‘𝑋) = 𝑌 ↔ (𝑋 + 𝑌) = 0 )) |
| 18 | 17 | biimpar 297 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → ((invg‘𝑊)‘𝑋) = 𝑌) |
| 19 | 18 | sneqd 3656 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → {((invg‘𝑊)‘𝑋)} = {𝑌}) |
| 20 | 19 | fveq2d 5603 | . . . . 5 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑌})) |
| 21 | 10, 20 | eqtrd 2240 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{𝑋}) = (𝑁‘{𝑌})) |
| 22 | 21 | ex 115 | . . 3 ⊢ (𝜑 → ((𝑋 + 𝑌) = 0 → (𝑁‘{𝑋}) = (𝑁‘{𝑌}))) |
| 23 | 22 | necon3d 2422 | . 2 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) → (𝑋 + 𝑌) ≠ 0 )) |
| 24 | 1, 23 | mpd 13 | 1 ⊢ (𝜑 → (𝑋 + 𝑌) ≠ 0 ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1373 ∈ wcel 2178 ≠ wne 2378 {csn 3643 ‘cfv 5290 (class class class)co 5967 Basecbs 12947 +gcplusg 13024 0gc0g 13203 Grpcgrp 13447 invgcminusg 13448 LModclmod 14164 LSpanclspn 14263 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-coll 4175 ax-sep 4178 ax-pow 4234 ax-pr 4269 ax-un 4498 ax-setind 4603 ax-cnex 8051 ax-resscn 8052 ax-1cn 8053 ax-1re 8054 ax-icn 8055 ax-addcl 8056 ax-addrcl 8057 ax-mulcl 8058 ax-addcom 8060 ax-addass 8062 ax-i2m1 8065 ax-0lt1 8066 ax-0id 8068 ax-rnegex 8069 ax-pre-ltirr 8072 ax-pre-ltadd 8076 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-nel 2474 df-ral 2491 df-rex 2492 df-reu 2493 df-rmo 2494 df-rab 2495 df-v 2778 df-sbc 3006 df-csb 3102 df-dif 3176 df-un 3178 df-in 3180 df-ss 3187 df-nul 3469 df-pw 3628 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-int 3900 df-iun 3943 df-br 4060 df-opab 4122 df-mpt 4123 df-id 4358 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-rn 4704 df-res 4705 df-ima 4706 df-iota 5251 df-fun 5292 df-fn 5293 df-f 5294 df-f1 5295 df-fo 5296 df-f1o 5297 df-fv 5298 df-riota 5922 df-ov 5970 df-oprab 5971 df-mpo 5972 df-1st 6249 df-2nd 6250 df-pnf 8144 df-mnf 8145 df-ltxr 8147 df-inn 9072 df-2 9130 df-3 9131 df-4 9132 df-5 9133 df-6 9134 df-ndx 12950 df-slot 12951 df-base 12953 df-sets 12954 df-plusg 13037 df-mulr 13038 df-sca 13040 df-vsca 13041 df-0g 13205 df-mgm 13303 df-sgrp 13349 df-mnd 13364 df-grp 13450 df-minusg 13451 df-sbg 13452 df-mgp 13798 df-ur 13837 df-ring 13875 df-lmod 14166 df-lssm 14230 df-lsp 14264 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |