| 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 2740 | . . . . 5 ⊢ (oppg‘𝐺) = (oppg‘𝐺) | |
| 2 | lsmcntz.p | . . . . 5 ⊢ ⊕ = (LSSum‘𝐺) | |
| 3 | 1, 2 | oppglsm 19615 | . . . 4 ⊢ (𝑈(LSSum‘(oppg‘𝐺))𝑆) = (𝑆 ⊕ 𝑈) |
| 4 | 3 | ineq2i 4153 | . . 3 ⊢ (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = (𝑇 ∩ (𝑆 ⊕ 𝑈)) |
| 5 | incom 4145 | . . 3 ⊢ (𝑇 ∩ (𝑆 ⊕ 𝑈)) = ((𝑆 ⊕ 𝑈) ∩ 𝑇) | |
| 6 | 4, 5 | eqtri 2763 | . 2 ⊢ (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = ((𝑆 ⊕ 𝑈) ∩ 𝑇) |
| 7 | eqid 2740 | . . 3 ⊢ (LSSum‘(oppg‘𝐺)) = (LSSum‘(oppg‘𝐺)) | |
| 8 | lsmcntz.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 9 | 1 | oppgsubg 19336 | . . . 4 ⊢ (SubGrp‘𝐺) = (SubGrp‘(oppg‘𝐺)) |
| 10 | 8, 9 | eleqtrdi 2850 | . . 3 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘(oppg‘𝐺))) |
| 11 | lsmcntz.t | . . . 4 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 12 | 11, 9 | eleqtrdi 2850 | . . 3 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘(oppg‘𝐺))) |
| 13 | lsmcntz.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 14 | 13, 9 | eleqtrdi 2850 | . . 3 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘(oppg‘𝐺))) |
| 15 | lsmdisj.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 16 | 1, 15 | oppgid 19329 | . . 3 ⊢ 0 = (0g‘(oppg‘𝐺)) |
| 17 | 1, 2 | oppglsm 19615 | . . . . . 6 ⊢ (𝑈(LSSum‘(oppg‘𝐺))𝑇) = (𝑇 ⊕ 𝑈) |
| 18 | 17 | ineq1i 4152 | . . . . 5 ⊢ ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = ((𝑇 ⊕ 𝑈) ∩ 𝑆) |
| 19 | incom 4145 | . . . . 5 ⊢ ((𝑇 ⊕ 𝑈) ∩ 𝑆) = (𝑆 ∩ (𝑇 ⊕ 𝑈)) | |
| 20 | 18, 19 | eqtri 2763 | . . . 4 ⊢ ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = (𝑆 ∩ (𝑇 ⊕ 𝑈)) |
| 21 | lsmdisjr.i | . . . 4 ⊢ (𝜑 → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 }) | |
| 22 | 20, 21 | eqtrid 2787 | . . 3 ⊢ (𝜑 → ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = { 0 }) |
| 23 | incom 4145 | . . . 4 ⊢ (𝑇 ∩ 𝑈) = (𝑈 ∩ 𝑇) | |
| 24 | lsmdisj2r.i | . . . 4 ⊢ (𝜑 → (𝑇 ∩ 𝑈) = { 0 }) | |
| 25 | 23, 24 | eqtr3id 2789 | . . 3 ⊢ (𝜑 → (𝑈 ∩ 𝑇) = { 0 }) |
| 26 | 7, 10, 12, 14, 16, 22, 25 | lsmdisj2 19655 | . 2 ⊢ (𝜑 → (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = { 0 }) |
| 27 | 6, 26 | eqtr3id 2789 | 1 ⊢ (𝜑 → ((𝑆 ⊕ 𝑈) ∩ 𝑇) = { 0 }) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∈ wcel 2119 ∩ cin 3889 {csn 4562 ‘cfv 6492 (class class class)co 7363 0gc0g 17400 SubGrpcsubg 19094 oppgcoppg 19318 LSSumclsm 19607 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 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 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-tpos 8173 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17178 df-ress 17199 df-plusg 17231 df-0g 17402 df-mgm 18606 df-sgrp 18685 df-mnd 18701 df-submnd 18750 df-grp 18910 df-minusg 18911 df-subg 19097 df-oppg 19319 df-lsm 19609 |
| This theorem is referenced by: lsmdisj3r 19659 lsmdisj2b 19661 |
| Copyright terms: Public domain | W3C validator |