MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lsmmod2 Structured version   Visualization version   GIF version

Theorem lsmmod2 19741
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.)
Hypothesis
Ref Expression
lsmmod.p = (LSSum‘𝐺)
Assertion
Ref Expression
lsmmod2 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → (𝑆 ∩ (𝑇 𝑈)) = ((𝑆𝑇) 𝑈))

Proof of Theorem lsmmod2
StepHypRef Expression
1 simpl3 1212 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → 𝑈 ∈ (SubGrp‘𝐺))
2 eqid 2763 . . . . . . 7 (oppg𝐺) = (oppg𝐺)
32oppgsubg 19428 . . . . . 6 (SubGrp‘𝐺) = (SubGrp‘(oppg𝐺))
41, 3eleqtrdi 2873 . . . . 5 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → 𝑈 ∈ (SubGrp‘(oppg𝐺)))
5 simpl2 1211 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → 𝑇 ∈ (SubGrp‘𝐺))
65, 3eleqtrdi 2873 . . . . 5 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → 𝑇 ∈ (SubGrp‘(oppg𝐺)))
7 simpl1 1210 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
87, 3eleqtrdi 2873 . . . . 5 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → 𝑆 ∈ (SubGrp‘(oppg𝐺)))
9 simpr 489 . . . . 5 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → 𝑈𝑆)
10 eqid 2763 . . . . . 6 (LSSum‘(oppg𝐺)) = (LSSum‘(oppg𝐺))
1110lsmmod 19740 . . . . 5 (((𝑈 ∈ (SubGrp‘(oppg𝐺)) ∧ 𝑇 ∈ (SubGrp‘(oppg𝐺)) ∧ 𝑆 ∈ (SubGrp‘(oppg𝐺))) ∧ 𝑈𝑆) → (𝑈(LSSum‘(oppg𝐺))(𝑇𝑆)) = ((𝑈(LSSum‘(oppg𝐺))𝑇) ∩ 𝑆))
124, 6, 8, 9, 11syl31anc 1400 . . . 4 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → (𝑈(LSSum‘(oppg𝐺))(𝑇𝑆)) = ((𝑈(LSSum‘(oppg𝐺))𝑇) ∩ 𝑆))
1312eqcomd 2769 . . 3 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → ((𝑈(LSSum‘(oppg𝐺))𝑇) ∩ 𝑆) = (𝑈(LSSum‘(oppg𝐺))(𝑇𝑆)))
14 incom 4162 . . 3 ((𝑈(LSSum‘(oppg𝐺))𝑇) ∩ 𝑆) = (𝑆 ∩ (𝑈(LSSum‘(oppg𝐺))𝑇))
15 incom 4162 . . . 4 (𝑇𝑆) = (𝑆𝑇)
1615oveq2i 7421 . . 3 (𝑈(LSSum‘(oppg𝐺))(𝑇𝑆)) = (𝑈(LSSum‘(oppg𝐺))(𝑆𝑇))
1713, 14, 163eqtr3g 2821 . 2 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → (𝑆 ∩ (𝑈(LSSum‘(oppg𝐺))𝑇)) = (𝑈(LSSum‘(oppg𝐺))(𝑆𝑇)))
18 lsmmod.p . . . 4 = (LSSum‘𝐺)
192, 18oppglsm 19707 . . 3 (𝑈(LSSum‘(oppg𝐺))𝑇) = (𝑇 𝑈)
2019ineq2i 4170 . 2 (𝑆 ∩ (𝑈(LSSum‘(oppg𝐺))𝑇)) = (𝑆 ∩ (𝑇 𝑈))
212, 18oppglsm 19707 . 2 (𝑈(LSSum‘(oppg𝐺))(𝑆𝑇)) = ((𝑆𝑇) 𝑈)
2217, 20, 213eqtr3g 2821 1 (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) ∧ 𝑈𝑆) → (𝑆 ∩ (𝑇 𝑈)) = ((𝑆𝑇) 𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1103   = wceq 1570  wcel 2143  cin 3904  wss 3905  cfv 6536  (class class class)co 7410  SubGrpcsubg 19181  oppgcoppg 19410  LSSumclsm 19699
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11151  ax-resscn 11152  ax-1cn 11153  ax-icn 11154  ax-addcl 11155  ax-addrcl 11156  ax-mulcl 11157  ax-mulrcl 11158  ax-mulcom 11159  ax-addass 11160  ax-mulass 11161  ax-distr 11162  ax-i2m1 11163  ax-1ne0 11164  ax-1rid 11165  ax-rnegex 11166  ax-rrecex 11167  ax-cnre 11168  ax-pre-lttri 11169  ax-pre-lttrn 11170  ax-pre-ltadd 11171  ax-pre-mulgt0 11172
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-tpos 8218  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-2o 8450  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-pnf 11240  df-mnf 11241  df-xr 11242  df-ltxr 11243  df-le 11244  df-sub 11438  df-neg 11439  df-nn 12229  df-2 12298  df-sets 17219  df-slot 17237  df-ndx 17249  df-base 17265  df-ress 17286  df-plusg 17318  df-0g 17489  df-mre 17633  df-mrc 17634  df-acs 17636  df-mgm 18693  df-sgrp 18772  df-mnd 18788  df-submnd 18837  df-grp 18998  df-minusg 18999  df-subg 19184  df-oppg 19411  df-lsm 19701
This theorem is referenced by:  lcvexchlem3  39830  lcfrlem23  42359
  Copyright terms: Public domain W3C validator