MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lsmdisj2r Unicode version

Theorem lsmdisj2r 15093
Description: Association of the disjointness constraint in a subgroup sum. (Contributed by Mario Carneiro, 22-Apr-2016.)
Hypotheses
Ref Expression
lsmcntz.p  |-  .(+)  =  (
LSSum `  G )
lsmcntz.s  |-  ( ph  ->  S  e.  (SubGrp `  G ) )
lsmcntz.t  |-  ( ph  ->  T  e.  (SubGrp `  G ) )
lsmcntz.u  |-  ( ph  ->  U  e.  (SubGrp `  G ) )
lsmdisj.o  |-  .0.  =  ( 0g `  G )
lsmdisjr.i  |-  ( ph  ->  ( S  i^i  ( T  .(+)  U ) )  =  {  .0.  }
)
lsmdisj2r.i  |-  ( ph  ->  ( T  i^i  U
)  =  {  .0.  } )
Assertion
Ref Expression
lsmdisj2r  |-  ( ph  ->  ( ( S  .(+)  U )  i^i  T )  =  {  .0.  }
)

Proof of Theorem lsmdisj2r
StepHypRef Expression
1 eqid 2358 . . . . 5  |-  (oppg `  G
)  =  (oppg `  G
)
2 lsmcntz.p . . . . 5  |-  .(+)  =  (
LSSum `  G )
31, 2oppglsm 15052 . . . 4  |-  ( U ( LSSum `  (oppg
`  G ) ) S )  =  ( S  .(+)  U )
43ineq2i 3443 . . 3  |-  ( T  i^i  ( U (
LSSum `  (oppg
`  G ) ) S ) )  =  ( T  i^i  ( S  .(+)  U ) )
5 incom 3437 . . 3  |-  ( T  i^i  ( S  .(+)  U ) )  =  ( ( S  .(+)  U )  i^i  T )
64, 5eqtri 2378 . 2  |-  ( T  i^i  ( U (
LSSum `  (oppg
`  G ) ) S ) )  =  ( ( S  .(+)  U )  i^i  T )
7 eqid 2358 . . 3  |-  ( LSSum `  (oppg
`  G ) )  =  ( LSSum `  (oppg `  G
) )
8 lsmcntz.u . . . 4  |-  ( ph  ->  U  e.  (SubGrp `  G ) )
91oppgsubg 14935 . . . 4  |-  (SubGrp `  G )  =  (SubGrp `  (oppg
`  G ) )
108, 9syl6eleq 2448 . . 3  |-  ( ph  ->  U  e.  (SubGrp `  (oppg `  G ) ) )
11 lsmcntz.t . . . 4  |-  ( ph  ->  T  e.  (SubGrp `  G ) )
1211, 9syl6eleq 2448 . . 3  |-  ( ph  ->  T  e.  (SubGrp `  (oppg `  G ) ) )
13 lsmcntz.s . . . 4  |-  ( ph  ->  S  e.  (SubGrp `  G ) )
1413, 9syl6eleq 2448 . . 3  |-  ( ph  ->  S  e.  (SubGrp `  (oppg `  G ) ) )
15 lsmdisj.o . . . 4  |-  .0.  =  ( 0g `  G )
161, 15oppgid 14928 . . 3  |-  .0.  =  ( 0g `  (oppg `  G
) )
171, 2oppglsm 15052 . . . . . 6  |-  ( U ( LSSum `  (oppg
`  G ) ) T )  =  ( T  .(+)  U )
1817ineq1i 3442 . . . . 5  |-  ( ( U ( LSSum `  (oppg `  G
) ) T )  i^i  S )  =  ( ( T  .(+)  U )  i^i  S )
19 incom 3437 . . . . 5  |-  ( ( T  .(+)  U )  i^i  S )  =  ( S  i^i  ( T 
.(+)  U ) )
2018, 19eqtri 2378 . . . 4  |-  ( ( U ( LSSum `  (oppg `  G
) ) T )  i^i  S )  =  ( S  i^i  ( T  .(+)  U ) )
21 lsmdisjr.i . . . 4  |-  ( ph  ->  ( S  i^i  ( T  .(+)  U ) )  =  {  .0.  }
)
2220, 21syl5eq 2402 . . 3  |-  ( ph  ->  ( ( U (
LSSum `  (oppg
`  G ) ) T )  i^i  S
)  =  {  .0.  } )
23 incom 3437 . . . 4  |-  ( T  i^i  U )  =  ( U  i^i  T
)
24 lsmdisj2r.i . . . 4  |-  ( ph  ->  ( T  i^i  U
)  =  {  .0.  } )
2523, 24syl5eqr 2404 . . 3  |-  ( ph  ->  ( U  i^i  T
)  =  {  .0.  } )
267, 10, 12, 14, 16, 22, 25lsmdisj2 15090 . 2  |-  ( ph  ->  ( T  i^i  ( U ( LSSum `  (oppg `  G
) ) S ) )  =  {  .0.  } )
276, 26syl5eqr 2404 1  |-  ( ph  ->  ( ( S  .(+)  U )  i^i  T )  =  {  .0.  }
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1642    e. wcel 1710    i^i cin 3227   {csn 3716   ` cfv 5337  (class class class)co 5945   0gc0g 13499  SubGrpcsubg 14714  oppgcoppg 14917   LSSumclsm 15044
This theorem is referenced by:  lsmdisj3r  15094  lsmdisj2b  15096
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1930  ax-ext 2339  ax-rep 4212  ax-sep 4222  ax-nul 4230  ax-pow 4269  ax-pr 4295  ax-un 4594  ax-cnex 8883  ax-resscn 8884  ax-1cn 8885  ax-icn 8886  ax-addcl 8887  ax-addrcl 8888  ax-mulcl 8889  ax-mulrcl 8890  ax-mulcom 8891  ax-addass 8892  ax-mulass 8893  ax-distr 8894  ax-i2m1 8895  ax-1ne0 8896  ax-1rid 8897  ax-rnegex 8898  ax-rrecex 8899  ax-cnre 8900  ax-pre-lttri 8901  ax-pre-lttrn 8902  ax-pre-ltadd 8903  ax-pre-mulgt0 8904
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2213  df-mo 2214  df-clab 2345  df-cleq 2351  df-clel 2354  df-nfc 2483  df-ne 2523  df-nel 2524  df-ral 2624  df-rex 2625  df-reu 2626  df-rmo 2627  df-rab 2628  df-v 2866  df-sbc 3068  df-csb 3158  df-dif 3231  df-un 3233  df-in 3235  df-ss 3242  df-pss 3244  df-nul 3532  df-if 3642  df-pw 3703  df-sn 3722  df-pr 3723  df-tp 3724  df-op 3725  df-uni 3909  df-iun 3988  df-br 4105  df-opab 4159  df-mpt 4160  df-tr 4195  df-eprel 4387  df-id 4391  df-po 4396  df-so 4397  df-fr 4434  df-we 4436  df-ord 4477  df-on 4478  df-lim 4479  df-suc 4480  df-om 4739  df-xp 4777  df-rel 4778  df-cnv 4779  df-co 4780  df-dm 4781  df-rn 4782  df-res 4783  df-ima 4784  df-iota 5301  df-fun 5339  df-fn 5340  df-f 5341  df-f1 5342  df-fo 5343  df-f1o 5344  df-fv 5345  df-ov 5948  df-oprab 5949  df-mpt2 5950  df-1st 6209  df-2nd 6210  df-tpos 6321  df-riota 6391  df-recs 6475  df-rdg 6510  df-er 6747  df-en 6952  df-dom 6953  df-sdom 6954  df-pnf 8959  df-mnf 8960  df-xr 8961  df-ltxr 8962  df-le 8963  df-sub 9129  df-neg 9130  df-nn 9837  df-2 9894  df-ndx 13248  df-slot 13249  df-base 13250  df-sets 13251  df-ress 13252  df-plusg 13318  df-0g 13503  df-mnd 14466  df-submnd 14515  df-grp 14588  df-minusg 14589  df-subg 14717  df-oppg 14918  df-lsm 15046
  Copyright terms: Public domain W3C validator