ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  qusinv Unicode version
Theorem qusinv 13989
Description: Value of the group inverse operation in a quotient group. (Contributed by Mario Carneiro, 18-Sep-2015.)
Hypotheses
Ref Expression
qusgrp.h |- H = ( G /.s ( G ~QG S ) )
qusinv.v |- V = ( Base ` G )
qusinv.i |- I = ( invg ` G )
qusinv.n |- N = ( invg ` H )
Assertion
Ref Expression
qusinv |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> ( N ` [ X ] ( G ~QG S ) ) = [ ( I ` X ) ] ( G ~QG S ) )
Proof of Theorem qusinv
StepHypRef Expression
1 nsgsubg 13958 . . . . . 6 |- ( S e. (NrmSGrp ` G ) -> S e. (SubGrp ` G ) )
2 subgrcl 13932 . . . . . 6 |- ( S e. (SubGrp ` G ) -> G e. Grp )
31, 2syl 14 . . . . 5 |- ( S e. (NrmSGrp ` G ) -> G e. Grp )
4 qusinv.v . . . . . 6 |- V = ( Base ` G )
5 qusinv.i . . . . . 6 |- I = ( invg ` G )
64, 5grpinvcl 13803 . . . . 5 |- ( ( G e. Grp /\ X e. V ) -> ( I ` X ) e. V )
73, 6sylan 283 . . . 4 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> ( I ` X ) e. V )
8 qusgrp.h . . . . 5 |- H = ( G /.s ( G ~QG S ) )
9 eqid 2234 . . . . 5 |- ( +g ` G ) = ( +g ` G )
10 eqid 2234 . . . . 5 |- ( +g ` H ) = ( +g ` H )
118, 4, 9, 10qusadd 13987 . . . 4 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V /\ ( I ` X ) e. V ) -> ( [ X ] ( G ~QG S ) ( +g ` H ) [ ( I ` X ) ] ( G ~QG S ) ) = [ ( X ( +g ` G ) ( I ` X ) ) ] ( G ~QG S ) )
127, 11mpd3an3 1375 . . 3 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> ( [ X ] ( G ~QG S ) ( +g ` H ) [ ( I ` X ) ] ( G ~QG S ) ) = [ ( X ( +g ` G ) ( I ` X ) ) ] ( G ~QG S ) )
13 eqid 2234 . . . . . 6 |- ( 0g ` G ) = ( 0g ` G )
144, 9, 13, 5grprinv 13806 . . . . 5 |- ( ( G e. Grp /\ X e. V ) -> ( X ( +g ` G ) ( I ` X ) ) = ( 0g ` G ) )
153, 14sylan 283 . . . 4 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> ( X ( +g ` G ) ( I ` X ) ) = ( 0g ` G ) )
1615eceq1d 6816 . . 3 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> [ ( X ( +g ` G ) ( I ` X ) ) ] ( G ~QG S ) = [ ( 0g ` G ) ] ( G ~QG S ) )
178, 13qus0 13988 . . . 4 |- ( S e. (NrmSGrp ` G ) -> [ ( 0g ` G ) ] ( G ~QG S ) = ( 0g ` H ) )
1817adantr 276 . . 3 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> [ ( 0g ` G ) ] ( G ~QG S ) = ( 0g ` H ) )
1912, 16, 183eqtrd 2271 . 2 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> ( [ X ] ( G ~QG S ) ( +g ` H ) [ ( I ` X ) ] ( G ~QG S ) ) = ( 0g ` H ) )
208qusgrp 13985 . . . 4 |- ( S e. (NrmSGrp ` G ) -> H e. Grp )
2120adantr 276 . . 3 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> H e. Grp )
22 eqid 2234 . . . 4 |- ( Base ` H ) = ( Base ` H )
238, 4, 22quseccl 13986 . . 3 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> [ X ] ( G ~QG S ) e. ( Base ` H ) )
248, 4, 22quseccl 13986 . . . 4 |- ( ( S e. (NrmSGrp ` G ) /\ ( I ` X ) e. V ) -> [ ( I ` X ) ] ( G ~QG S ) e. ( Base ` H ) )
257, 24syldan 282 . . 3 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> [ ( I ` X ) ] ( G ~QG S ) e. ( Base ` H ) )
26 eqid 2234 . . . 4 |- ( 0g ` H ) = ( 0g ` H )
27 qusinv.n . . . 4 |- N = ( invg ` H )
2822, 10, 26, 27grpinvid1 13807 . . 3 |- ( ( H e. Grp /\ [ X ] ( G ~QG S ) e. ( Base ` H ) /\ [ ( I ` X ) ] ( G ~QG S ) e. ( Base ` H ) ) -> ( ( N ` [ X ] ( G ~QG S ) ) = [ ( I ` X ) ] ( G ~QG S ) <-> ( [ X ] ( G ~QG S ) ( +g ` H ) [ ( I ` X ) ] ( G ~QG S ) ) = ( 0g ` H ) ) )
2921, 23, 25, 28syl3anc 1274 . 2 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> ( ( N ` [ X ] ( G ~QG S ) ) = [ ( I ` X ) ] ( G ~QG S ) <-> ( [ X ] ( G ~QG S ) ( +g ` H ) [ ( I ` X ) ] ( G ~QG S ) ) = ( 0g ` H ) ) )
3019, 29mpbird 167 1 |- ( ( S e. (NrmSGrp ` G ) /\ X e. V ) -> ( N ` [ X ] ( G ~QG S ) ) = [ ( I ` X ) ] ( G ~QG S ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   e. wcel 2205   ` cfv 5357  (class class class)co 6058   [cec 6778   Basecbs 13296   +g cplusg 13374   0gc0g 13553   /.s cqus 13566   Grpcgrp 13755   invgcminusg 13756  SubGrpcsubg 13920  NrmSGrpcnsg 13921   ~QG cqg 13922
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-lttrn 8257  ax-pre-ltadd 8259
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-tp 3702  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-er 6780  df-ec 6782  df-qs 6786  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9255  df-2 9313  df-3 9314  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-iress 13304  df-plusg 13387  df-mulr 13388  df-0g 13555  df-iimas 13567  df-qus 13568  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-grp 13758  df-minusg 13759  df-subg 13923  df-nsg 13924  df-eqg 13925
This theorem is referenced by:  qussub  13990
  Copyright terms: Public domain W3C validator