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

Theorem dprddisj 15244
Description: The function  S is a family of subgroups. (Contributed by Mario Carneiro, 25-Apr-2016.)
Hypotheses
Ref Expression
dprdcntz.1  |-  ( ph  ->  G dom DProd  S )
dprdcntz.2  |-  ( ph  ->  dom  S  =  I )
dprdcntz.3  |-  ( ph  ->  X  e.  I )
dprddisj.0  |-  .0.  =  ( 0g `  G )
dprddisj.k  |-  K  =  (mrCls `  (SubGrp `  G
) )
Assertion
Ref Expression
dprddisj  |-  ( ph  ->  ( ( S `  X )  i^i  ( K `  U. ( S
" ( I  \  { X } ) ) ) )  =  {  .0.  } )

Proof of Theorem dprddisj
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dprdcntz.3 . 2  |-  ( ph  ->  X  e.  I )
2 dprdcntz.1 . . . . 5  |-  ( ph  ->  G dom DProd  S )
3 dprdcntz.2 . . . . . . 7  |-  ( ph  ->  dom  S  =  I )
4 reldmdprd 15235 . . . . . . . . 9  |-  Rel  dom DProd
54brrelex2i 4730 . . . . . . . 8  |-  ( G dom DProd  S  ->  S  e. 
_V )
6 dmexg 4939 . . . . . . . 8  |-  ( S  e.  _V  ->  dom  S  e.  _V )
72, 5, 63syl 18 . . . . . . 7  |-  ( ph  ->  dom  S  e.  _V )
83, 7eqeltrrd 2358 . . . . . 6  |-  ( ph  ->  I  e.  _V )
9 eqid 2283 . . . . . . 7  |-  (Cntz `  G )  =  (Cntz `  G )
10 dprddisj.0 . . . . . . 7  |-  .0.  =  ( 0g `  G )
11 dprddisj.k . . . . . . 7  |-  K  =  (mrCls `  (SubGrp `  G
) )
129, 10, 11dmdprd 15236 . . . . . 6  |-  ( ( I  e.  _V  /\  dom  S  =  I )  ->  ( G dom DProd  S  <-> 
( G  e.  Grp  /\  S : I --> (SubGrp `  G )  /\  A. x  e.  I  ( A. y  e.  (
I  \  { x } ) ( S `
 x )  C_  ( (Cntz `  G ) `  ( S `  y
) )  /\  (
( S `  x
)  i^i  ( K `  U. ( S "
( I  \  {
x } ) ) ) )  =  {  .0.  } ) ) ) )
138, 3, 12syl2anc 642 . . . . 5  |-  ( ph  ->  ( G dom DProd  S  <->  ( G  e.  Grp  /\  S :
I --> (SubGrp `  G )  /\  A. x  e.  I 
( A. y  e.  ( I  \  {
x } ) ( S `  x ) 
C_  ( (Cntz `  G ) `  ( S `  y )
)  /\  ( ( S `  x )  i^i  ( K `  U. ( S " ( I 
\  { x }
) ) ) )  =  {  .0.  }
) ) ) )
142, 13mpbid 201 . . . 4  |-  ( ph  ->  ( G  e.  Grp  /\  S : I --> (SubGrp `  G )  /\  A. x  e.  I  ( A. y  e.  (
I  \  { x } ) ( S `
 x )  C_  ( (Cntz `  G ) `  ( S `  y
) )  /\  (
( S `  x
)  i^i  ( K `  U. ( S "
( I  \  {
x } ) ) ) )  =  {  .0.  } ) ) )
1514simp3d 969 . . 3  |-  ( ph  ->  A. x  e.  I 
( A. y  e.  ( I  \  {
x } ) ( S `  x ) 
C_  ( (Cntz `  G ) `  ( S `  y )
)  /\  ( ( S `  x )  i^i  ( K `  U. ( S " ( I 
\  { x }
) ) ) )  =  {  .0.  }
) )
16 simpr 447 . . . 4  |-  ( ( A. y  e.  ( I  \  { x } ) ( S `
 x )  C_  ( (Cntz `  G ) `  ( S `  y
) )  /\  (
( S `  x
)  i^i  ( K `  U. ( S "
( I  \  {
x } ) ) ) )  =  {  .0.  } )  ->  (
( S `  x
)  i^i  ( K `  U. ( S "
( I  \  {
x } ) ) ) )  =  {  .0.  } )
1716ralimi 2618 . . 3  |-  ( A. x  e.  I  ( A. y  e.  (
I  \  { x } ) ( S `
 x )  C_  ( (Cntz `  G ) `  ( S `  y
) )  /\  (
( S `  x
)  i^i  ( K `  U. ( S "
( I  \  {
x } ) ) ) )  =  {  .0.  } )  ->  A. x  e.  I  ( ( S `  x )  i^i  ( K `  U. ( S " ( I 
\  { x }
) ) ) )  =  {  .0.  }
)
1815, 17syl 15 . 2  |-  ( ph  ->  A. x  e.  I 
( ( S `  x )  i^i  ( K `  U. ( S
" ( I  \  { x } ) ) ) )  =  {  .0.  } )
19 fveq2 5525 . . . . 5  |-  ( x  =  X  ->  ( S `  x )  =  ( S `  X ) )
20 sneq 3651 . . . . . . . . 9  |-  ( x  =  X  ->  { x }  =  { X } )
2120difeq2d 3294 . . . . . . . 8  |-  ( x  =  X  ->  (
I  \  { x } )  =  ( I  \  { X } ) )
2221imaeq2d 5012 . . . . . . 7  |-  ( x  =  X  ->  ( S " ( I  \  { x } ) )  =  ( S
" ( I  \  { X } ) ) )
2322unieqd 3838 . . . . . 6  |-  ( x  =  X  ->  U. ( S " ( I  \  { x } ) )  =  U. ( S " ( I  \  { X } ) ) )
2423fveq2d 5529 . . . . 5  |-  ( x  =  X  ->  ( K `  U. ( S
" ( I  \  { x } ) ) )  =  ( K `  U. ( S " ( I  \  { X } ) ) ) )
2519, 24ineq12d 3371 . . . 4  |-  ( x  =  X  ->  (
( S `  x
)  i^i  ( K `  U. ( S "
( I  \  {
x } ) ) ) )  =  ( ( S `  X
)  i^i  ( K `  U. ( S "
( I  \  { X } ) ) ) ) )
2625eqeq1d 2291 . . 3  |-  ( x  =  X  ->  (
( ( S `  x )  i^i  ( K `  U. ( S
" ( I  \  { x } ) ) ) )  =  {  .0.  }  <->  ( ( S `  X )  i^i  ( K `  U. ( S " ( I 
\  { X }
) ) ) )  =  {  .0.  }
) )
2726rspcv 2880 . 2  |-  ( X  e.  I  ->  ( A. x  e.  I 
( ( S `  x )  i^i  ( K `  U. ( S
" ( I  \  { x } ) ) ) )  =  {  .0.  }  ->  ( ( S `  X
)  i^i  ( K `  U. ( S "
( I  \  { X } ) ) ) )  =  {  .0.  } ) )
281, 18, 27sylc 56 1  |-  ( ph  ->  ( ( S `  X )  i^i  ( K `  U. ( S
" ( I  \  { X } ) ) ) )  =  {  .0.  } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934    = wceq 1623    e. wcel 1684   A.wral 2543   _Vcvv 2788    \ cdif 3149    i^i cin 3151    C_ wss 3152   {csn 3640   U.cuni 3827   class class class wbr 4023   dom cdm 4689   "cima 4692   -->wf 5251   ` cfv 5255   0gc0g 13400  mrClscmrc 13485   Grpcgrp 14362  SubGrpcsubg 14615  Cntzccntz 14791   DProd cdprd 15231
This theorem is referenced by:  dprdfeq0  15257  dprdres  15263  dprdss  15264  dprdf1o  15267  dprd2da  15277  dmdprdsplit2lem  15280
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-ixp 6818  df-dprd 15233
  Copyright terms: Public domain W3C validator