| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmmod2 | Structured version Visualization version GIF version | ||
| Description: Modular law dual for subgroup sum. Similar to part of Theorem 16.9 of [MaedaMaeda] p. 70. (Contributed by NM, 8-Jan-2015.) (Revised by Mario Carneiro, 21-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmmod.p | ⊢ ⊕ = (LSSum‘𝐺) |
| Ref | Expression |
|---|---|
| lsmmod2 | ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = ((𝑆 ∩ 𝑇) ⊕ 𝑈)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl3 1210 | . . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 2 | eqid 2769 | . . . . . . 7 ⊢ (oppg‘𝐺) = (oppg‘𝐺) | |
| 3 | 2 | oppgsubg 19433 | . . . . . 6 ⊢ (SubGrp‘𝐺) = (SubGrp‘(oppg‘𝐺)) |
| 4 | 1, 3 | eleqtrdi 2879 | . . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑈 ∈ (SubGrp‘(oppg‘𝐺))) |
| 5 | simpl2 1209 | . . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 6 | 5, 3 | eleqtrdi 2879 | . . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑇 ∈ (SubGrp‘(oppg‘𝐺))) |
| 7 | simpl1 1208 | . . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 8 | 7, 3 | eleqtrdi 2879 | . . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑆 ∈ (SubGrp‘(oppg‘𝐺))) |
| 9 | simpr 489 | . . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑈 ⊆ 𝑆) | |
| 10 | eqid 2769 | . . . . . 6 ⊢ (LSSum‘(oppg‘𝐺)) = (LSSum‘(oppg‘𝐺)) | |
| 11 | 10 | lsmmod 19745 | . . . . 5 ⊢ (((𝑈 ∈ (SubGrp‘(oppg‘𝐺)) ∧ 𝑇 ∈ (SubGrp‘(oppg‘𝐺)) ∧ 𝑆 ∈ (SubGrp‘(oppg‘𝐺))) ∧ 𝑈 ⊆ 𝑆) → (𝑈(LSSum‘(oppg‘𝐺))(𝑇 ∩ 𝑆)) = ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆)) |
| 12 | 4, 6, 8, 9, 11 | syl31anc 1398 | . . . 4 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → (𝑈(LSSum‘(oppg‘𝐺))(𝑇 ∩ 𝑆)) = ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆)) |
| 13 | 12 | eqcomd 2775 | . . 3 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = (𝑈(LSSum‘(oppg‘𝐺))(𝑇 ∩ 𝑆))) |
| 14 | incom 4170 | . . 3 ⊢ ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = (𝑆 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑇)) | |
| 15 | incom 4170 | . . . 4 ⊢ (𝑇 ∩ 𝑆) = (𝑆 ∩ 𝑇) | |
| 16 | 15 | oveq2i 7422 | . . 3 ⊢ (𝑈(LSSum‘(oppg‘𝐺))(𝑇 ∩ 𝑆)) = (𝑈(LSSum‘(oppg‘𝐺))(𝑆 ∩ 𝑇)) |
| 17 | 13, 14, 16 | 3eqtr3g 2827 | . 2 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → (𝑆 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑇)) = (𝑈(LSSum‘(oppg‘𝐺))(𝑆 ∩ 𝑇))) |
| 18 | lsmmod.p | . . . 4 ⊢ ⊕ = (LSSum‘𝐺) | |
| 19 | 2, 18 | oppglsm 19712 | . . 3 ⊢ (𝑈(LSSum‘(oppg‘𝐺))𝑇) = (𝑇 ⊕ 𝑈) |
| 20 | 19 | ineq2i 4178 | . 2 ⊢ (𝑆 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑇)) = (𝑆 ∩ (𝑇 ⊕ 𝑈)) |
| 21 | 2, 18 | oppglsm 19712 | . 2 ⊢ (𝑈(LSSum‘(oppg‘𝐺))(𝑆 ∩ 𝑇)) = ((𝑆 ∩ 𝑇) ⊕ 𝑈) |
| 22 | 17, 20, 21 | 3eqtr3g 2827 | 1 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = ((𝑆 ∩ 𝑇) ⊕ 𝑈)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∩ cin 3912 ⊆ wss 3913 ‘cfv 6537 (class class class)co 7411 SubGrpcsubg 19186 oppgcoppg 19415 LSSumclsm 19704 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-tpos 8222 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-ress 17291 df-plusg 17323 df-0g 17494 df-mre 17638 df-mrc 17639 df-acs 17641 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-submnd 18842 df-grp 19003 df-minusg 19004 df-subg 19189 df-oppg 19416 df-lsm 19706 |
| This theorem is referenced by: lcvexchlem3 39700 lcfrlem23 42229 |
| Copyright terms: Public domain | W3C validator |