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

Theorem lsmdisj2r 16494
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 2462 . . . . 5  |-  (oppg `  G
)  =  (oppg `  G
)
2 lsmcntz.p . . . . 5  |-  .(+)  =  (
LSSum `  G )
31, 2oppglsm 16453 . . . 4  |-  ( U ( LSSum `  (oppg
`  G ) ) S )  =  ( S  .(+)  U )
43ineq2i 3692 . . 3  |-  ( T  i^i  ( U (
LSSum `  (oppg
`  G ) ) S ) )  =  ( T  i^i  ( S  .(+)  U ) )
5 incom 3686 . . 3  |-  ( T  i^i  ( S  .(+)  U ) )  =  ( ( S  .(+)  U )  i^i  T )
64, 5eqtri 2491 . 2  |-  ( T  i^i  ( U (
LSSum `  (oppg
`  G ) ) S ) )  =  ( ( S  .(+)  U )  i^i  T )
7 eqid 2462 . . 3  |-  ( LSSum `  (oppg
`  G ) )  =  ( LSSum `  (oppg `  G
) )
8 lsmcntz.u . . . 4  |-  ( ph  ->  U  e.  (SubGrp `  G ) )
91oppgsubg 16188 . . . 4  |-  (SubGrp `  G )  =  (SubGrp `  (oppg
`  G ) )
108, 9syl6eleq 2560 . . 3  |-  ( ph  ->  U  e.  (SubGrp `  (oppg `  G ) ) )
11 lsmcntz.t . . . 4  |-  ( ph  ->  T  e.  (SubGrp `  G ) )
1211, 9syl6eleq 2560 . . 3  |-  ( ph  ->  T  e.  (SubGrp `  (oppg `  G ) ) )
13 lsmcntz.s . . . 4  |-  ( ph  ->  S  e.  (SubGrp `  G ) )
1413, 9syl6eleq 2560 . . 3  |-  ( ph  ->  S  e.  (SubGrp `  (oppg `  G ) ) )
15 lsmdisj.o . . . 4  |-  .0.  =  ( 0g `  G )
161, 15oppgid 16181 . . 3  |-  .0.  =  ( 0g `  (oppg `  G
) )
171, 2oppglsm 16453 . . . . . 6  |-  ( U ( LSSum `  (oppg
`  G ) ) T )  =  ( T  .(+)  U )
1817ineq1i 3691 . . . . 5  |-  ( ( U ( LSSum `  (oppg `  G
) ) T )  i^i  S )  =  ( ( T  .(+)  U )  i^i  S )
19 incom 3686 . . . . 5  |-  ( ( T  .(+)  U )  i^i  S )  =  ( S  i^i  ( T 
.(+)  U ) )
2018, 19eqtri 2491 . . . 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 2515 . . 3  |-  ( ph  ->  ( ( U (
LSSum `  (oppg
`  G ) ) T )  i^i  S
)  =  {  .0.  } )
23 incom 3686 . . . 4  |-  ( T  i^i  U )  =  ( U  i^i  T
)
24 lsmdisj2r.i . . . 4  |-  ( ph  ->  ( T  i^i  U
)  =  {  .0.  } )
2523, 24syl5eqr 2517 . . 3  |-  ( ph  ->  ( U  i^i  T
)  =  {  .0.  } )
267, 10, 12, 14, 16, 22, 25lsmdisj2 16491 . 2  |-  ( ph  ->  ( T  i^i  ( U ( LSSum `  (oppg `  G
) ) S ) )  =  {  .0.  } )
276, 26syl5eqr 2517 1  |-  ( ph  ->  ( ( S  .(+)  U )  i^i  T )  =  {  .0.  }
)
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1374    e. wcel 1762    i^i cin 3470   {csn 4022   ` cfv 5581  (class class class)co 6277   0gc0g 14686  SubGrpcsubg 15985  oppgcoppg 16170   LSSumclsm 16445
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-8 1764  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1963  ax-ext 2440  ax-rep 4553  ax-sep 4563  ax-nul 4571  ax-pow 4620  ax-pr 4681  ax-un 6569  ax-cnex 9539  ax-resscn 9540  ax-1cn 9541  ax-icn 9542  ax-addcl 9543  ax-addrcl 9544  ax-mulcl 9545  ax-mulrcl 9546  ax-mulcom 9547  ax-addass 9548  ax-mulass 9549  ax-distr 9550  ax-i2m1 9551  ax-1ne0 9552  ax-1rid 9553  ax-rnegex 9554  ax-rrecex 9555  ax-cnre 9556  ax-pre-lttri 9557  ax-pre-lttrn 9558  ax-pre-ltadd 9559  ax-pre-mulgt0 9560
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 969  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2274  df-mo 2275  df-clab 2448  df-cleq 2454  df-clel 2457  df-nfc 2612  df-ne 2659  df-nel 2660  df-ral 2814  df-rex 2815  df-reu 2816  df-rmo 2817  df-rab 2818  df-v 3110  df-sbc 3327  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-pss 3487  df-nul 3781  df-if 3935  df-pw 4007  df-sn 4023  df-pr 4025  df-tp 4027  df-op 4029  df-uni 4241  df-iun 4322  df-br 4443  df-opab 4501  df-mpt 4502  df-tr 4536  df-eprel 4786  df-id 4790  df-po 4795  df-so 4796  df-fr 4833  df-we 4835  df-ord 4876  df-on 4877  df-lim 4878  df-suc 4879  df-xp 5000  df-rel 5001  df-cnv 5002  df-co 5003  df-dm 5004  df-rn 5005  df-res 5006  df-ima 5007  df-iota 5544  df-fun 5583  df-fn 5584  df-f 5585  df-f1 5586  df-fo 5587  df-f1o 5588  df-fv 5589  df-riota 6238  df-ov 6280  df-oprab 6281  df-mpt2 6282  df-om 6674  df-1st 6776  df-2nd 6777  df-tpos 6947  df-recs 7034  df-rdg 7068  df-er 7303  df-en 7509  df-dom 7510  df-sdom 7511  df-pnf 9621  df-mnf 9622  df-xr 9623  df-ltxr 9624  df-le 9625  df-sub 9798  df-neg 9799  df-nn 10528  df-2 10585  df-ndx 14484  df-slot 14485  df-base 14486  df-sets 14487  df-ress 14488  df-plusg 14559  df-0g 14688  df-mnd 15723  df-submnd 15773  df-grp 15853  df-minusg 15854  df-subg 15988  df-oppg 16171  df-lsm 16447
This theorem is referenced by:  lsmdisj3r  16495  lsmdisj2b  16497
  Copyright terms: Public domain W3C validator