| 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 2232 | . . . . . . . . 9 ⊢ (invg‘𝑊) = (invg‘𝑊) | |
| 6 | lmodindp1.n | . . . . . . . . 9 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 7 | 4, 5, 6 | lspsnneg 14568 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑋})) |
| 8 | 2, 3, 7 | syl2anc 411 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑋})) |
| 9 | 8 | eqcomd 2238 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{((invg‘𝑊)‘𝑋)})) |
| 10 | 9 | adantr 276 | . . . . 5 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{𝑋}) = (𝑁‘{((invg‘𝑊)‘𝑋)})) |
| 11 | lmodgrp 14442 | . . . . . . . . . 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 13765 | . . . . . . . . 9 ⊢ ((𝑊 ∈ Grp ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (((invg‘𝑊)‘𝑋) = 𝑌 ↔ (𝑋 + 𝑌) = 0 )) |
| 17 | 12, 3, 13, 16 | syl3anc 1274 | . . . . . . . 8 ⊢ (𝜑 → (((invg‘𝑊)‘𝑋) = 𝑌 ↔ (𝑋 + 𝑌) = 0 )) |
| 18 | 17 | biimpar 297 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → ((invg‘𝑊)‘𝑋) = 𝑌) |
| 19 | 18 | sneqd 3702 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → {((invg‘𝑊)‘𝑋)} = {𝑌}) |
| 20 | 19 | fveq2d 5674 | . . . . 5 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{((invg‘𝑊)‘𝑋)}) = (𝑁‘{𝑌})) |
| 21 | 10, 20 | eqtrd 2265 | . . . 4 ⊢ ((𝜑 ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘{𝑋}) = (𝑁‘{𝑌})) |
| 22 | 21 | ex 115 | . . 3 ⊢ (𝜑 → ((𝑋 + 𝑌) = 0 → (𝑁‘{𝑋}) = (𝑁‘{𝑌}))) |
| 23 | 22 | necon3d 2456 | . 2 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) → (𝑋 + 𝑌) ≠ 0 )) |
| 24 | 1, 23 | mpd 13 | 1 ⊢ (𝜑 → (𝑋 + 𝑌) ≠ 0 ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2203 ≠ wne 2412 {csn 3689 ‘cfv 5352 (class class class)co 6050 Basecbs 13212 +gcplusg 13290 0gc0g 13469 Grpcgrp 13713 invgcminusg 13714 LModclmod 14435 LSpanclspn 14534 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-addcom 8227 ax-addass 8229 ax-i2m1 8232 ax-0lt1 8233 ax-0id 8235 ax-rnegex 8236 ax-pre-ltirr 8239 ax-pre-ltadd 8243 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-id 4414 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-pnf 8310 df-mnf 8311 df-ltxr 8313 df-inn 9238 df-2 9296 df-3 9297 df-4 9298 df-5 9299 df-6 9300 df-ndx 13215 df-slot 13216 df-base 13218 df-sets 13219 df-plusg 13303 df-mulr 13304 df-sca 13306 df-vsca 13307 df-0g 13471 df-mgm 13569 df-sgrp 13615 df-mnd 13630 df-grp 13716 df-minusg 13717 df-sbg 13718 df-mgp 14065 df-ur 14104 df-ring 14142 df-lmod 14437 df-lssm 14501 df-lsp 14535 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |