| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmdisj2r | Structured version Visualization version GIF version | ||
| Description: Association of the disjointness constraint in a subgroup sum. (Contributed by Mario Carneiro, 22-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmcntz.p | ⊢ ⊕ = (LSSum‘𝐺) |
| lsmcntz.s | ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) |
| lsmcntz.t | ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) |
| lsmcntz.u | ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) |
| lsmdisj.o | ⊢ 0 = (0g‘𝐺) |
| lsmdisjr.i | ⊢ (𝜑 → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 }) |
| lsmdisj2r.i | ⊢ (𝜑 → (𝑇 ∩ 𝑈) = { 0 }) |
| Ref | Expression |
|---|---|
| lsmdisj2r | ⊢ (𝜑 → ((𝑆 ⊕ 𝑈) ∩ 𝑇) = { 0 }) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2737 | . . . . 5 ⊢ (oppg‘𝐺) = (oppg‘𝐺) | |
| 2 | lsmcntz.p | . . . . 5 ⊢ ⊕ = (LSSum‘𝐺) | |
| 3 | 1, 2 | oppglsm 19608 | . . . 4 ⊢ (𝑈(LSSum‘(oppg‘𝐺))𝑆) = (𝑆 ⊕ 𝑈) |
| 4 | 3 | ineq2i 4158 | . . 3 ⊢ (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = (𝑇 ∩ (𝑆 ⊕ 𝑈)) |
| 5 | incom 4150 | . . 3 ⊢ (𝑇 ∩ (𝑆 ⊕ 𝑈)) = ((𝑆 ⊕ 𝑈) ∩ 𝑇) | |
| 6 | 4, 5 | eqtri 2760 | . 2 ⊢ (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = ((𝑆 ⊕ 𝑈) ∩ 𝑇) |
| 7 | eqid 2737 | . . 3 ⊢ (LSSum‘(oppg‘𝐺)) = (LSSum‘(oppg‘𝐺)) | |
| 8 | lsmcntz.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 9 | 1 | oppgsubg 19329 | . . . 4 ⊢ (SubGrp‘𝐺) = (SubGrp‘(oppg‘𝐺)) |
| 10 | 8, 9 | eleqtrdi 2847 | . . 3 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘(oppg‘𝐺))) |
| 11 | lsmcntz.t | . . . 4 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 12 | 11, 9 | eleqtrdi 2847 | . . 3 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘(oppg‘𝐺))) |
| 13 | lsmcntz.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 14 | 13, 9 | eleqtrdi 2847 | . . 3 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘(oppg‘𝐺))) |
| 15 | lsmdisj.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 16 | 1, 15 | oppgid 19322 | . . 3 ⊢ 0 = (0g‘(oppg‘𝐺)) |
| 17 | 1, 2 | oppglsm 19608 | . . . . . 6 ⊢ (𝑈(LSSum‘(oppg‘𝐺))𝑇) = (𝑇 ⊕ 𝑈) |
| 18 | 17 | ineq1i 4157 | . . . . 5 ⊢ ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = ((𝑇 ⊕ 𝑈) ∩ 𝑆) |
| 19 | incom 4150 | . . . . 5 ⊢ ((𝑇 ⊕ 𝑈) ∩ 𝑆) = (𝑆 ∩ (𝑇 ⊕ 𝑈)) | |
| 20 | 18, 19 | eqtri 2760 | . . . 4 ⊢ ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = (𝑆 ∩ (𝑇 ⊕ 𝑈)) |
| 21 | lsmdisjr.i | . . . 4 ⊢ (𝜑 → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 }) | |
| 22 | 20, 21 | eqtrid 2784 | . . 3 ⊢ (𝜑 → ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = { 0 }) |
| 23 | incom 4150 | . . . 4 ⊢ (𝑇 ∩ 𝑈) = (𝑈 ∩ 𝑇) | |
| 24 | lsmdisj2r.i | . . . 4 ⊢ (𝜑 → (𝑇 ∩ 𝑈) = { 0 }) | |
| 25 | 23, 24 | eqtr3id 2786 | . . 3 ⊢ (𝜑 → (𝑈 ∩ 𝑇) = { 0 }) |
| 26 | 7, 10, 12, 14, 16, 22, 25 | lsmdisj2 19648 | . 2 ⊢ (𝜑 → (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = { 0 }) |
| 27 | 6, 26 | eqtr3id 2786 | 1 ⊢ (𝜑 → ((𝑆 ⊕ 𝑈) ∩ 𝑇) = { 0 }) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ∩ cin 3889 {csn 4568 ‘cfv 6492 (class class class)co 7360 0gc0g 17393 SubGrpcsubg 19087 oppgcoppg 19311 LSSumclsm 19600 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-tpos 8169 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-submnd 18743 df-grp 18903 df-minusg 18904 df-subg 19090 df-oppg 19312 df-lsm 19602 |
| This theorem is referenced by: lsmdisj3r 19652 lsmdisj2b 19654 |
| Copyright terms: Public domain | W3C validator |