ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  conjnmzb Unicode version

Theorem conjnmzb 14142
Description: Alternative condition for elementhood in the normalizer. (Contributed by Mario Carneiro, 18-Jan-2015.)
Hypotheses
Ref Expression
conjghm.x  |-  X  =  ( Base `  G
)
conjghm.p  |-  .+  =  ( +g  `  G )
conjghm.m  |-  .-  =  ( -g `  G )
conjsubg.f  |-  F  =  ( x  e.  S  |->  ( ( A  .+  x )  .-  A
) )
conjnmz.1  |-  N  =  { y  e.  X  |  A. z  e.  X  ( ( y  .+  z )  e.  S  <->  ( z  .+  y )  e.  S ) }
Assertion
Ref Expression
conjnmzb  |-  ( S  e.  (SubGrp `  G
)  ->  ( A  e.  N  <->  ( A  e.  X  /\  S  =  ran  F ) ) )
Distinct variable groups:    x, y,  .-    x, z,  .+ , y    x, A, y, z    y, F, z    x, N    x, G, y, z    x, S, y, z    x, X, y, z
Allowed substitution hints:    F( x)    .- ( z)    N( y,  z)

Proof of Theorem conjnmzb
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 conjnmz.1 . . . . 5  |-  N  =  { y  e.  X  |  A. z  e.  X  ( ( y  .+  z )  e.  S  <->  ( z  .+  y )  e.  S ) }
21ssrab3 3334 . . . 4  |-  N  C_  X
3 simpr 110 . . . 4  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  N )  ->  A  e.  N )
42, 3sselid 3246 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  N )  ->  A  e.  X )
5 conjghm.x . . . 4  |-  X  =  ( Base `  G
)
6 conjghm.p . . . 4  |-  .+  =  ( +g  `  G )
7 conjghm.m . . . 4  |-  .-  =  ( -g `  G )
8 conjsubg.f . . . 4  |-  F  =  ( x  e.  S  |->  ( ( A  .+  x )  .-  A
) )
95, 6, 7, 8, 1conjnmz 14141 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  N )  ->  S  =  ran  F )
104, 9jca 306 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  N )  ->  ( A  e.  X  /\  S  =  ran  F ) )
11 simprl 535 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  ->  A  e.  X )
12 simplrr 542 . . . . . 6  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  S  =  ran  F )
1312eleq2d 2308 . . . . 5  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  (
( A  .+  w
)  e.  S  <->  ( A  .+  w )  e.  ran  F ) )
14 subgrcl 14041 . . . . . . . . . . . . 13  |-  ( S  e.  (SubGrp `  G
)  ->  G  e.  Grp )
1514ad3antrrr 496 . . . . . . . . . . . 12  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  G  e.  Grp )
16 simpllr 540 . . . . . . . . . . . 12  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  A  e.  X )
175subgss 14036 . . . . . . . . . . . . . 14  |-  ( S  e.  (SubGrp `  G
)  ->  S  C_  X
)
1817ad2antrr 492 . . . . . . . . . . . . 13  |-  ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  /\  w  e.  X )  ->  S  C_  X )
1918sselda 3248 . . . . . . . . . . . 12  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  x  e.  X )
205, 6, 7grpaddsubass 13954 . . . . . . . . . . . 12  |-  ( ( G  e.  Grp  /\  ( A  e.  X  /\  x  e.  X  /\  A  e.  X
) )  ->  (
( A  .+  x
)  .-  A )  =  ( A  .+  ( x  .-  A ) ) )
2115, 16, 19, 16, 20syl13anc 1280 . . . . . . . . . . 11  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( A  .+  x
)  .-  A )  =  ( A  .+  ( x  .-  A ) ) )
2221eqeq1d 2247 . . . . . . . . . 10  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( ( A  .+  x )  .-  A
)  =  ( A 
.+  w )  <->  ( A  .+  ( x  .-  A
) )  =  ( A  .+  w ) ) )
235, 7grpsubcl 13944 . . . . . . . . . . . 12  |-  ( ( G  e.  Grp  /\  x  e.  X  /\  A  e.  X )  ->  ( x  .-  A
)  e.  X )
2415, 19, 16, 23syl3anc 1278 . . . . . . . . . . 11  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
x  .-  A )  e.  X )
25 simplr 533 . . . . . . . . . . 11  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  w  e.  X )
265, 6grplcan 13926 . . . . . . . . . . 11  |-  ( ( G  e.  Grp  /\  ( ( x  .-  A )  e.  X  /\  w  e.  X  /\  A  e.  X
) )  ->  (
( A  .+  (
x  .-  A )
)  =  ( A 
.+  w )  <->  ( x  .-  A )  =  w ) )
2715, 24, 25, 16, 26syl13anc 1280 . . . . . . . . . 10  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( A  .+  (
x  .-  A )
)  =  ( A 
.+  w )  <->  ( x  .-  A )  =  w ) )
285, 6, 7grpsubadd 13952 . . . . . . . . . . 11  |-  ( ( G  e.  Grp  /\  ( x  e.  X  /\  A  e.  X  /\  w  e.  X
) )  ->  (
( x  .-  A
)  =  w  <->  ( w  .+  A )  =  x ) )
2915, 19, 16, 25, 28syl13anc 1280 . . . . . . . . . 10  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( x  .-  A
)  =  w  <->  ( w  .+  A )  =  x ) )
3022, 27, 293bitrd 214 . . . . . . . . 9  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( ( A  .+  x )  .-  A
)  =  ( A 
.+  w )  <->  ( w  .+  A )  =  x ) )
31 eqcom 2240 . . . . . . . . 9  |-  ( ( A  .+  w )  =  ( ( A 
.+  x )  .-  A )  <->  ( ( A  .+  x )  .-  A )  =  ( A  .+  w ) )
32 eqcom 2240 . . . . . . . . 9  |-  ( x  =  ( w  .+  A )  <->  ( w  .+  A )  =  x )
3330, 31, 323bitr4g 223 . . . . . . . 8  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( A  .+  w
)  =  ( ( A  .+  x ) 
.-  A )  <->  x  =  ( w  .+  A ) ) )
3433rexbidva 2547 . . . . . . 7  |-  ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  /\  w  e.  X )  ->  ( E. x  e.  S  ( A  .+  w )  =  ( ( A 
.+  x )  .-  A )  <->  E. x  e.  S  x  =  ( w  .+  A ) ) )
3534adantlrr 487 . . . . . 6  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  ( E. x  e.  S  ( A  .+  w )  =  ( ( A 
.+  x )  .-  A )  <->  E. x  e.  S  x  =  ( w  .+  A ) ) )
3614ad2antrr 492 . . . . . . . 8  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  G  e.  Grp )
37 simplrl 541 . . . . . . . 8  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  A  e.  X )
38 simpr 110 . . . . . . . 8  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  w  e.  X )
395, 6, 36, 37, 38grpcld 13878 . . . . . . 7  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  ( A  .+  w )  e.  X )
408elrnmpt 5033 . . . . . . 7  |-  ( ( A  .+  w )  e.  X  ->  (
( A  .+  w
)  e.  ran  F  <->  E. x  e.  S  ( A  .+  w )  =  ( ( A 
.+  x )  .-  A ) ) )
4139, 40syl 14 . . . . . 6  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  (
( A  .+  w
)  e.  ran  F  <->  E. x  e.  S  ( A  .+  w )  =  ( ( A 
.+  x )  .-  A ) ) )
42 risset 2578 . . . . . . 7  |-  ( ( w  .+  A )  e.  S  <->  E. x  e.  S  x  =  ( w  .+  A ) )
4342a1i 9 . . . . . 6  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  (
( w  .+  A
)  e.  S  <->  E. x  e.  S  x  =  ( w  .+  A ) ) )
4435, 41, 433bitr4d 220 . . . . 5  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  (
( A  .+  w
)  e.  ran  F  <->  ( w  .+  A )  e.  S ) )
4513, 44bitrd 188 . . . 4  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  (
( A  .+  w
)  e.  S  <->  ( w  .+  A )  e.  S
) )
4645ralrimiva 2623 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  ->  A. w  e.  X  ( ( A  .+  w )  e.  S  <->  ( w  .+  A )  e.  S
) )
471elnmz 14070 . . 3  |-  ( A  e.  N  <->  ( A  e.  X  /\  A. w  e.  X  ( ( A  .+  w )  e.  S  <->  ( w  .+  A )  e.  S
) ) )
4811, 46, 47sylanbrc 421 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  ->  A  e.  N )
4910, 48impbida 604 1  |-  ( S  e.  (SubGrp `  G
)  ->  ( A  e.  N  <->  ( A  e.  X  /\  S  =  ran  F ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   {crab 2532    C_ wss 3220    |-> cmpt 4193   ran crn 4777   ` cfv 5380  (class class class)co 6088   Basecbs 13410   +g cplusg 13490   Grpcgrp 13864   -gcsg 13866  SubGrpcsubg 14029
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1re 8279  ax-addrcl 8282
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-inn 9314  df-2 9372  df-ndx 13413  df-slot 13414  df-base 13416  df-plusg 13503  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-minusg 13868  df-sbg 13869  df-subg 14032
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator