|   | 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 1194 | . . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 2 | eqid 2737 | . . . . . . 7 ⊢ (oppg‘𝐺) = (oppg‘𝐺) | |
| 3 | 2 | oppgsubg 19382 | . . . . . 6 ⊢ (SubGrp‘𝐺) = (SubGrp‘(oppg‘𝐺)) | 
| 4 | 1, 3 | eleqtrdi 2851 | . . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑈 ∈ (SubGrp‘(oppg‘𝐺))) | 
| 5 | simpl2 1193 | . . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 6 | 5, 3 | eleqtrdi 2851 | . . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑇 ∈ (SubGrp‘(oppg‘𝐺))) | 
| 7 | simpl1 1192 | . . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 8 | 7, 3 | eleqtrdi 2851 | . . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑆 ∈ (SubGrp‘(oppg‘𝐺))) | 
| 9 | simpr 484 | . . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → 𝑈 ⊆ 𝑆) | |
| 10 | eqid 2737 | . . . . . 6 ⊢ (LSSum‘(oppg‘𝐺)) = (LSSum‘(oppg‘𝐺)) | |
| 11 | 10 | lsmmod 19693 | . . . . 5 ⊢ (((𝑈 ∈ (SubGrp‘(oppg‘𝐺)) ∧ 𝑇 ∈ (SubGrp‘(oppg‘𝐺)) ∧ 𝑆 ∈ (SubGrp‘(oppg‘𝐺))) ∧ 𝑈 ⊆ 𝑆) → (𝑈(LSSum‘(oppg‘𝐺))(𝑇 ∩ 𝑆)) = ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆)) | 
| 12 | 4, 6, 8, 9, 11 | syl31anc 1375 | . . . 4 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → (𝑈(LSSum‘(oppg‘𝐺))(𝑇 ∩ 𝑆)) = ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆)) | 
| 13 | 12 | eqcomd 2743 | . . 3 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = (𝑈(LSSum‘(oppg‘𝐺))(𝑇 ∩ 𝑆))) | 
| 14 | incom 4209 | . . 3 ⊢ ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = (𝑆 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑇)) | |
| 15 | incom 4209 | . . . 4 ⊢ (𝑇 ∩ 𝑆) = (𝑆 ∩ 𝑇) | |
| 16 | 15 | oveq2i 7442 | . . 3 ⊢ (𝑈(LSSum‘(oppg‘𝐺))(𝑇 ∩ 𝑆)) = (𝑈(LSSum‘(oppg‘𝐺))(𝑆 ∩ 𝑇)) | 
| 17 | 13, 14, 16 | 3eqtr3g 2800 | . 2 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → (𝑆 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑇)) = (𝑈(LSSum‘(oppg‘𝐺))(𝑆 ∩ 𝑇))) | 
| 18 | lsmmod.p | . . . 4 ⊢ ⊕ = (LSSum‘𝐺) | |
| 19 | 2, 18 | oppglsm 19660 | . . 3 ⊢ (𝑈(LSSum‘(oppg‘𝐺))𝑇) = (𝑇 ⊕ 𝑈) | 
| 20 | 19 | ineq2i 4217 | . 2 ⊢ (𝑆 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑇)) = (𝑆 ∩ (𝑇 ⊕ 𝑈)) | 
| 21 | 2, 18 | oppglsm 19660 | . 2 ⊢ (𝑈(LSSum‘(oppg‘𝐺))(𝑆 ∩ 𝑇)) = ((𝑆 ∩ 𝑇) ⊕ 𝑈) | 
| 22 | 17, 20, 21 | 3eqtr3g 2800 | 1 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈 ⊆ 𝑆) → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = ((𝑆 ∩ 𝑇) ⊕ 𝑈)) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ∩ cin 3950 ⊆ wss 3951 ‘cfv 6561 (class class class)co 7431 SubGrpcsubg 19138 oppgcoppg 19363 LSSumclsm 19652 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-int 4947 df-iun 4993 df-iin 4994 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-tpos 8251 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-2o 8507 df-er 8745 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-2 12329 df-sets 17201 df-slot 17219 df-ndx 17231 df-base 17248 df-ress 17275 df-plusg 17310 df-0g 17486 df-mre 17629 df-mrc 17630 df-acs 17632 df-mgm 18653 df-sgrp 18732 df-mnd 18748 df-submnd 18797 df-grp 18954 df-minusg 18955 df-subg 19141 df-oppg 19364 df-lsm 19654 | 
| This theorem is referenced by: lcvexchlem3 39037 lcfrlem23 41567 | 
| Copyright terms: Public domain | W3C validator |