| 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 32583 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 39670 | . . . . 5 ⊢ (𝜑 → (𝑄 ≠ 𝑅 ↔ (𝑄 ∩ 𝑅) = { 0 })) |
| 7 | eqid 2763 | . . . . . 6 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
| 8 | lsatcv0eq.p | . . . . . 6 ⊢ ⊕ = (LSSum‘𝑊) | |
| 9 | lsatcv0eq.c | . . . . . 6 ⊢ 𝐶 = ( ⋖L ‘𝑊) | |
| 10 | lveclmod 21174 | . . . . . . . 8 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
| 11 | 3, 10 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LMod) |
| 12 | 7, 2, 11, 4 | lsatlssel 39622 | . . . . . 6 ⊢ (𝜑 → 𝑄 ∈ (LSubSp‘𝑊)) |
| 13 | 7, 8, 1, 2, 9, 3, 12, 5 | lcvp 39665 | . . . . 5 ⊢ (𝜑 → ((𝑄 ∩ 𝑅) = { 0 } ↔ 𝑄𝐶(𝑄 ⊕ 𝑅))) |
| 14 | 1, 2, 9, 3, 4 | lsatcv0 39656 | . . . . . 6 ⊢ (𝜑 → { 0 }𝐶𝑄) |
| 15 | 14 | biantrurd 540 | . . . . 5 ⊢ (𝜑 → (𝑄𝐶(𝑄 ⊕ 𝑅) ↔ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅)))) |
| 16 | 6, 13, 15 | 3bitrd 307 | . . . 4 ⊢ (𝜑 → (𝑄 ≠ 𝑅 ↔ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅)))) |
| 17 | 3 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → 𝑊 ∈ LVec) |
| 18 | 1, 7 | lsssn0 21016 | . . . . . . . 8 ⊢ (𝑊 ∈ LMod → { 0 } ∈ (LSubSp‘𝑊)) |
| 19 | 11, 18 | syl 17 | . . . . . . 7 ⊢ (𝜑 → { 0 } ∈ (LSubSp‘𝑊)) |
| 20 | 19 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → { 0 } ∈ (LSubSp‘𝑊)) |
| 21 | 12 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → 𝑄 ∈ (LSubSp‘𝑊)) |
| 22 | 7, 2, 11, 5 | lsatlssel 39622 | . . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ (LSubSp‘𝑊)) |
| 23 | 7, 8 | lsmcl 21151 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑄 ∈ (LSubSp‘𝑊) ∧ 𝑅 ∈ (LSubSp‘𝑊)) → (𝑄 ⊕ 𝑅) ∈ (LSubSp‘𝑊)) |
| 24 | 11, 12, 22, 23 | syl3anc 1391 | . . . . . . 7 ⊢ (𝜑 → (𝑄 ⊕ 𝑅) ∈ (LSubSp‘𝑊)) |
| 25 | 24 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → (𝑄 ⊕ 𝑅) ∈ (LSubSp‘𝑊)) |
| 26 | simprl 780 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → { 0 }𝐶𝑄) | |
| 27 | simprr 782 | . . . . . 6 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → 𝑄𝐶(𝑄 ⊕ 𝑅)) | |
| 28 | 7, 9, 17, 20, 21, 25, 26, 27 | lcvntr 39651 | . . . . 5 ⊢ ((𝜑 ∧ ({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅))) → ¬ { 0 }𝐶(𝑄 ⊕ 𝑅)) |
| 29 | 28 | ex 416 | . . . 4 ⊢ (𝜑 → (({ 0 }𝐶𝑄 ∧ 𝑄𝐶(𝑄 ⊕ 𝑅)) → ¬ { 0 }𝐶(𝑄 ⊕ 𝑅))) |
| 30 | 16, 29 | sylbid 242 | . . 3 ⊢ (𝜑 → (𝑄 ≠ 𝑅 → ¬ { 0 }𝐶(𝑄 ⊕ 𝑅))) |
| 31 | 30 | necon4ad 2977 | . 2 ⊢ (𝜑 → ({ 0 }𝐶(𝑄 ⊕ 𝑅) → 𝑄 = 𝑅)) |
| 32 | 7 | lsssssubg 21026 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊)) |
| 33 | 11, 32 | syl 17 | . . . . . 6 ⊢ (𝜑 → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊)) |
| 34 | 33, 12 | sseldd 3938 | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ (SubGrp‘𝑊)) |
| 35 | 8 | lsmidm 19704 | . . . . 5 ⊢ (𝑄 ∈ (SubGrp‘𝑊) → (𝑄 ⊕ 𝑄) = 𝑄) |
| 36 | 34, 35 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑄 ⊕ 𝑄) = 𝑄) |
| 37 | 14, 36 | breqtrrd 5129 | . . 3 ⊢ (𝜑 → { 0 }𝐶(𝑄 ⊕ 𝑄)) |
| 38 | oveq2 7405 | . . . 4 ⊢ (𝑄 = 𝑅 → (𝑄 ⊕ 𝑄) = (𝑄 ⊕ 𝑅)) | |
| 39 | 38 | breq2d 5113 | . . 3 ⊢ (𝑄 = 𝑅 → ({ 0 }𝐶(𝑄 ⊕ 𝑄) ↔ { 0 }𝐶(𝑄 ⊕ 𝑅))) |
| 40 | 37, 39 | syl5ibcom 247 | . 2 ⊢ (𝜑 → (𝑄 = 𝑅 → { 0 }𝐶(𝑄 ⊕ 𝑅))) |
| 41 | 31, 40 | impbid 214 | 1 ⊢ (𝜑 → ({ 0 }𝐶(𝑄 ⊕ 𝑅) ↔ 𝑄 = 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1561 ∈ wcel 2143 ≠ wne 2958 ∩ cin 3904 ⊆ wss 3905 {csn 4583 class class class wbr 5101 ‘cfv 6522 (class class class)co 7397 0gc0g 17469 SubGrpcsubg 19163 LSSumclsm 19675 LModclmod 20928 LSubSpclss 20999 LVecclvec 21170 LSAtomsclsa 39599 ⋖L clcv 39643 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-iin 4953 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6289 df-ord 6350 df-on 6351 df-lim 6352 df-suc 6353 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-riota 7354 df-ov 7400 df-oprab 7401 df-mpo 7402 df-om 7848 df-1st 7971 df-2nd 7972 df-tpos 8207 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8382 df-1o 8438 df-2o 8439 df-er 8679 df-en 8929 df-dom 8930 df-sdom 8931 df-fin 8932 df-pnf 11219 df-mnf 11220 df-xr 11221 df-ltxr 11222 df-le 11223 df-sub 11417 df-neg 11418 df-nn 12212 df-2 12281 df-3 12282 df-sets 17201 df-slot 17219 df-ndx 17231 df-base 17247 df-ress 17268 df-plusg 17300 df-mulr 17301 df-0g 17471 df-mre 17615 df-mrc 17616 df-acs 17618 df-mgm 18675 df-sgrp 18754 df-mnd 18770 df-submnd 18819 df-grp 18979 df-minusg 18980 df-sbg 18981 df-subg 19166 df-cntz 19358 df-oppg 19387 df-lsm 19677 df-cmn 19823 df-abl 19824 df-mgp 20188 df-rng 20200 df-ur 20233 df-ring 20286 df-oppr 20387 df-dvdsr 20407 df-unit 20408 df-invr 20438 df-drng 20782 df-lmod 20930 df-lss 21000 df-lsp 21040 df-lvec 21171 df-lsatoms 39601 df-lcv 39644 |
| This theorem is referenced by: lsatcv1 39673 |
| Copyright terms: Public domain | W3C validator |