| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lsatcv0eq | Structured version Visualization version GIF version | ||
| Description: If the sum of two atoms cover the zero subspace, they are equal. (atcv0eq 33038 analog.) (Contributed by NM, 10-Jan-2015.) |
| Ref | Expression |
|---|---|
| lsatcv0eq.o | ⊢ 0 = (0g‘𝑊) |
| lsatcv0eq.p | ⊢ ⊕ = (LSSum‘𝑊) |
| lsatcv0eq.a | ⊢ 𝐴 = (LSAtoms‘𝑊) |
| lsatcv0eq.c | ⊢ 𝐶 = ( ⋖L ‘𝑊) |
| lsatcv0eq.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
| lsatcv0eq.q | ⊢ (𝜑 → 𝑄 ∈ 𝐴) |
| lsatcv0eq.r | ⊢ (𝜑 → 𝑅 ∈ 𝐴) |
| Ref | Expression |
|---|---|
| lsatcv0eq | ⊢ (𝜑 → ({ 0 }𝐶(𝑄 ⊕ 𝑅) ↔ 𝑄 = 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lsatcv0eq.o | . . . . . 6 ⊢ 0 = (0g‘𝑊) | |
| 2 | lsatcv0eq.a | . . . . . 6 ⊢ 𝐴 = (LSAtoms‘𝑊) | |
| 3 | lsatcv0eq.w | . . . . . 6 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
| 4 | lsatcv0eq.q | . . . . . 6 ⊢ (𝜑 → 𝑄 ∈ 𝐴) | |
| 5 | lsatcv0eq.r | . . . . . 6 ⊢ (𝜑 → 𝑅 ∈ 𝐴) | |
| 6 | 1, 2, 3, 4, 5 | lsatnem0 40368 | . . . . 5 ⊢ (𝜑 → (𝑄 ≠ 𝑅 ↔ (𝑄 ∩ 𝑅) = { 0 })) |
| 7 | eqid 2763 | . . . . . 6 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
| 8 | lsatcv0eq.p | . . . . . 6 ⊢ ⊕ = (LSSum‘𝑊) | |
| 9 | lsatcv0eq.c | . . . . . 6 ⊢ 𝐶 = ( ⋖L ‘𝑊) | |
| 10 | lveclmod 21432 | . . . . . . . 8 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
| 11 | 3, 10 | syl 18 | . . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LMod) |
| 12 | 7, 2, 11, 4 | lsatlssel 40320 | . . . . . 6 ⊢ (𝜑 → 𝑄 ∈ (LSubSp‘𝑊)) |
| 13 | 7, 8, 1, 2, 9, 3, 12, 5 | lcvp 40363 | . . . . 5 ⊢ (𝜑 → ((𝑄 ∩ 𝑅) = { 0 } ↔ 𝑄𝐶(𝑄 ⊕ 𝑅))) |
| 14 | 1, 2, 9, 3, 4 | lsatcv0 40354 | . . . . . 6 ⊢ (𝜑 → { 0 }𝐶𝑄) |
| 15 | 14 | biantrurd 542 | . . . . 5 ⊢ (𝜑 → (𝑄𝐶(𝑄 ⊕ 𝑅) ↔ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅)))) |
| 16 | 6, 13, 15 | 3bitrd 308 | . . . 4 ⊢ (𝜑 → (𝑄 ≠ 𝑅 ↔ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅)))) |
| 17 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → 𝑊 ∈ LVec) |
| 18 | 1, 7 | lsssn0 21274 | . . . . . . . 8 ⊢ (𝑊 ∈ LMod → { 0 } ∈ (LSubSp‘𝑊)) |
| 19 | 11, 18 | syl 18 | . . . . . . 7 ⊢ (𝜑 → { 0 } ∈ (LSubSp‘𝑊)) |
| 20 | 19 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → { 0 } ∈ (LSubSp‘𝑊)) |
| 21 | 12 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → 𝑄 ∈ (LSubSp‘𝑊)) |
| 22 | 7, 2, 11, 5 | lsatlssel 40320 | . . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ (LSubSp‘𝑊)) |
| 23 | 7, 8 | lsmcl 21409 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑄 ∈ (LSubSp‘𝑊) ∧ 𝑅 ∈ (LSubSp‘𝑊)) → (𝑄 ⊕ 𝑅) ∈ (LSubSp‘𝑊)) |
| 24 | 11, 12, 22, 23 | syl3anc 1399 | . . . . . . 7 ⊢ (𝜑 → (𝑄 ⊕ 𝑅) ∈ (LSubSp‘𝑊)) |
| 25 | 24 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → (𝑄 ⊕ 𝑅) ∈ (LSubSp‘𝑊)) |
| 26 | simprl 783 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → { 0 }𝐶𝑄) | |
| 27 | simprr 785 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → 𝑄𝐶(𝑄 ⊕ 𝑅)) | |
| 28 | 7, 9, 17, 20, 21, 25, 26, 27 | lcvntr 40349 | . . . . 5 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → ¬ { 0 }𝐶(𝑄 ⊕ 𝑅)) |
| 29 | 28 | ex 418 | . . . 4 ⊢ (𝜑 → (({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅)) → ¬ { 0 }𝐶(𝑄 ⊕ 𝑅))) |
| 30 | 16, 29 | sylbid 243 | . . 3 ⊢ (𝜑 → (𝑄 ≠ 𝑅 → ¬ { 0 }𝐶(𝑄 ⊕ 𝑅))) |
| 31 | 30 | necon4ad 2978 | . 2 ⊢ (𝜑 → ({ 0 }𝐶(𝑄 ⊕ 𝑅) → 𝑄 = 𝑅)) |
| 32 | 7 | lsssssubg 21284 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊)) |
| 33 | 11, 32 | syl 18 | . . . . . 6 ⊢ (𝜑 → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊)) |
| 34 | 33, 12 | sseldd 3914 | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ (SubGrp‘𝑊)) |
| 35 | 8 | lsmidm 19928 | . . . . 5 ⊢ (𝑄 ∈ (SubGrp‘𝑊) → (𝑄 ⊕ 𝑄) = 𝑄) |
| 36 | 34, 35 | syl 18 | . . . 4 ⊢ (𝜑 → (𝑄 ⊕ 𝑄) = 𝑄) |
| 37 | 14, 36 | breqtrrd 5139 | . . 3 ⊢ (𝜑 → { 0 }𝐶(𝑄 ⊕ 𝑄)) |
| 38 | oveq2 7459 | . . . 4 ⊢ (𝑄 = 𝑅 → (𝑄 ⊕ 𝑄) = (𝑄 ⊕ 𝑅)) | |
| 39 | 38 | breq2d 5120 | . . 3 ⊢ (𝑄 = 𝑅 → ({ 0 }𝐶(𝑄 ⊕ 𝑄) ↔ { 0 }𝐶(𝑄 ⊕ 𝑅))) |
| 40 | 37, 39 | syl5ibcom 248 | . 2 ⊢ (𝜑 → (𝑄 = 𝑅 → { 0 }𝐶(𝑄 ⊕ 𝑅))) |
| 41 | 31, 40 | impbid 215 | 1 ⊢ (𝜑 → ({ 0 }𝐶(𝑄 ⊕ 𝑅) ↔ 𝑄 = 𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ⊆ wss 3900 ∩ cin 4092 {csn 4588 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 0gc0g 17660 SubGrpcsubg 19380 LSSumclsm 19899 LModclmod 21186 LSubSpclss 21257 LVecclvec 21428 LSAtomsclsa 40297 ⋖L clcv 40341 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-tpos 8281 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-mulr 17487 df-0g 17662 df-mre 17806 df-mrc 17807 df-acs 17809 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-submnd 19029 df-grp 19197 df-minusg 19198 df-sbg 19199 df-subg 19383 df-cntz 19582 df-oppg 19611 df-lsm 19901 df-cmn 20047 df-abl 20048 df-mgp 20412 df-rng 20426 df-ur 20459 df-ring 20512 df-oppr 20618 df-dvdsr 20638 df-unit 20639 df-invr 20669 df-drng 21033 df-lmod 21188 df-lss 21258 df-lsp 21298 df-lvec 21429 df-lsatoms 40299 df-lcv 40342 |
| This theorem is used by: lsatcv1 40371 |
| Copyright terms: Public domain | W3C validator |