| 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 2736 | . . . . 5 ⊢ (oppg‘𝐺) = (oppg‘𝐺) | |
| 2 | lsmcntz.p | . . . . 5 ⊢ ⊕ = (LSSum‘𝐺) | |
| 3 | 1, 2 | oppglsm 19617 | . . . 4 ⊢ (𝑈(LSSum‘(oppg‘𝐺))𝑆) = (𝑆 ⊕ 𝑈) |
| 4 | 3 | ineq2i 4157 | . . 3 ⊢ (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = (𝑇 ∩ (𝑆 ⊕ 𝑈)) |
| 5 | incom 4149 | . . 3 ⊢ (𝑇 ∩ (𝑆 ⊕ 𝑈)) = ((𝑆 ⊕ 𝑈) ∩ 𝑇) | |
| 6 | 4, 5 | eqtri 2759 | . 2 ⊢ (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = ((𝑆 ⊕ 𝑈) ∩ 𝑇) |
| 7 | eqid 2736 | . . 3 ⊢ (LSSum‘(oppg‘𝐺)) = (LSSum‘(oppg‘𝐺)) | |
| 8 | lsmcntz.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 9 | 1 | oppgsubg 19338 | . . . 4 ⊢ (SubGrp‘𝐺) = (SubGrp‘(oppg‘𝐺)) |
| 10 | 8, 9 | eleqtrdi 2846 | . . 3 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘(oppg‘𝐺))) |
| 11 | lsmcntz.t | . . . 4 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 12 | 11, 9 | eleqtrdi 2846 | . . 3 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘(oppg‘𝐺))) |
| 13 | lsmcntz.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 14 | 13, 9 | eleqtrdi 2846 | . . 3 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘(oppg‘𝐺))) |
| 15 | lsmdisj.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 16 | 1, 15 | oppgid 19331 | . . 3 ⊢ 0 = (0g‘(oppg‘𝐺)) |
| 17 | 1, 2 | oppglsm 19617 | . . . . . 6 ⊢ (𝑈(LSSum‘(oppg‘𝐺))𝑇) = (𝑇 ⊕ 𝑈) |
| 18 | 17 | ineq1i 4156 | . . . . 5 ⊢ ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = ((𝑇 ⊕ 𝑈) ∩ 𝑆) |
| 19 | incom 4149 | . . . . 5 ⊢ ((𝑇 ⊕ 𝑈) ∩ 𝑆) = (𝑆 ∩ (𝑇 ⊕ 𝑈)) | |
| 20 | 18, 19 | eqtri 2759 | . . . 4 ⊢ ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = (𝑆 ∩ (𝑇 ⊕ 𝑈)) |
| 21 | lsmdisjr.i | . . . 4 ⊢ (𝜑 → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 }) | |
| 22 | 20, 21 | eqtrid 2783 | . . 3 ⊢ (𝜑 → ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = { 0 }) |
| 23 | incom 4149 | . . . 4 ⊢ (𝑇 ∩ 𝑈) = (𝑈 ∩ 𝑇) | |
| 24 | lsmdisj2r.i | . . . 4 ⊢ (𝜑 → (𝑇 ∩ 𝑈) = { 0 }) | |
| 25 | 23, 24 | eqtr3id 2785 | . . 3 ⊢ (𝜑 → (𝑈 ∩ 𝑇) = { 0 }) |
| 26 | 7, 10, 12, 14, 16, 22, 25 | lsmdisj2 19657 | . 2 ⊢ (𝜑 → (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = { 0 }) |
| 27 | 6, 26 | eqtr3id 2785 | 1 ⊢ (𝜑 → ((𝑆 ⊕ 𝑈) ∩ 𝑇) = { 0 }) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ∩ cin 3888 {csn 4567 ‘cfv 6498 (class class class)co 7367 0gc0g 17402 SubGrpcsubg 19096 oppgcoppg 19320 LSSumclsm 19609 |
| 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 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-tpos 8176 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-0g 17404 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-submnd 18752 df-grp 18912 df-minusg 18913 df-subg 19099 df-oppg 19321 df-lsm 19611 |
| This theorem is referenced by: lsmdisj3r 19661 lsmdisj2b 19663 |
| Copyright terms: Public domain | W3C validator |