Theorem issubg 14035

Description: The subgroup predicate. (Contributed by Mario Carneiro, 2-Dec-2014.)

Hypothesis

Ref	Expression
issubg.b	|- B = ( Base ` G )

Assertion

Ref	Expression
issubg	|- ( S e. (SubGrp ` G ) <-> ( G e. Grp /\ S C_ B /\ ( G ↾s S ) e. Grp ) )

Proof of Theorem issubg

Dummy variables w s are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-subg 14032	. . 3 |- SubGrp = ( w e. Grp |-> { s e. ~P ( Base ` w ) | ( w ↾s s ) e. Grp } )
2	1	mptrcl 5791	. 2 |- ( S e. (SubGrp ` G ) -> G e. Grp )
3		simp1 1028	. 2 |- ( ( G e. Grp /\ S C_ B /\ ( G ↾s S ) e. Grp ) -> G e. Grp )
4		fveq2 5698	. . . . . . . . 9 |- ( w = G -> ( Base ` w ) = ( Base ` G ) )
5		issubg.b	. . . . . . . . 9 |- B = ( Base ` G )
6	4, 5	eqtr4di 2289	. . . . . . . 8 |- ( w = G -> ( Base ` w ) = B )
7	6	pweqd 3693	. . . . . . 7 |- ( w = G -> ~P ( Base ` w ) = ~P B )
8		oveq1 6095	. . . . . . . 8 |- ( w = G -> ( w ↾s s ) = ( G ↾s s ) )
9	8	eleq1d 2307	. . . . . . 7 |- ( w = G -> ( ( w ↾s s ) e. Grp <-> ( G ↾s s ) e. Grp ) )
10	7, 9	rabeqbidv 2816	. . . . . 6 |- ( w = G -> { s e. ~P ( Base ` w ) | ( w ↾s s ) e. Grp } = { s e. ~P B | ( G ↾s s ) e. Grp } )
11		id 19	. . . . . 6 |- ( G e. Grp -> G e. Grp )
12		basfn 13469	. . . . . . . . . 10 |- Base Fn _V
13		elex 2833	. . . . . . . . . 10 |- ( G e. Grp -> G e. _V )
14		funfvex 5715	. . . . . . . . . . 11 |- ( ( Fun Base /\ G e. dom Base ) -> ( Base ` G ) e. _V )
15	14	funfni 5486	. . . . . . . . . 10 |- ( ( Base Fn _V /\ G e. _V ) -> ( Base ` G ) e. _V )
16	12, 13, 15	sylancr 418	. . . . . . . . 9 |- ( G e. Grp -> ( Base ` G ) e. _V )
17	5, 16	eqeltrid 2325	. . . . . . . 8 |- ( G e. Grp -> B e. _V )
18	17	pwexd 4320	. . . . . . 7 |- ( G e. Grp -> ~P B e. _V )
19		rabexg 4281	. . . . . . 7 |- ( ~P B e. _V -> { s e. ~P B | ( G ↾s s ) e. Grp } e. _V )
20	18, 19	syl 14	. . . . . 6 |- ( G e. Grp -> { s e. ~P B | ( G ↾s s ) e. Grp } e. _V )
21	1, 10, 11, 20	fvmptd3 5802	. . . . 5 |- ( G e. Grp -> (SubGrp ` G ) = { s e. ~P B | ( G ↾s s ) e. Grp } )
22	21	eleq2d 2308	. . . 4 |- ( G e. Grp -> ( S e. (SubGrp ` G ) <-> S e. { s e. ~P B | ( G ↾s s ) e. Grp } ) )
23		oveq2 6096	. . . . . . 7 |- ( s = S -> ( G ↾s s ) = ( G ↾s S ) )
24	23	eleq1d 2307	. . . . . 6 |- ( s = S -> ( ( G ↾s s ) e. Grp <-> ( G ↾s S ) e. Grp ) )
25	24	elrab 2982	. . . . 5 |- ( S e. { s e. ~P B | ( G ↾s s ) e. Grp } <-> ( S e. ~P B /\ ( G ↾s S ) e. Grp ) )
26		elpw2g 4294	. . . . . . 7 |- ( B e. _V -> ( S e. ~P B <-> S C_ B ) )
27	17, 26	syl 14	. . . . . 6 |- ( G e. Grp -> ( S e. ~P B <-> S C_ B ) )
28	27	anbi1d 469	. . . . 5 |- ( G e. Grp -> ( ( S e. ~P B /\ ( G ↾s S ) e. Grp ) <-> ( S C_ B /\ ( G ↾s S ) e. Grp ) ) )
29	25, 28	bitrid 192	. . . 4 |- ( G e. Grp -> ( S e. { s e. ~P B | ( G ↾s s ) e. Grp } <-> ( S C_ B /\ ( G ↾s S ) e. Grp ) ) )
30		ibar 301	. . . 4 |- ( G e. Grp -> ( ( S C_ B /\ ( G ↾s S ) e. Grp ) <-> ( G e. Grp /\ ( S C_ B /\ ( G ↾s S ) e. Grp ) ) ) )
31	22, 29, 30	3bitrd 214	. . 3 |- ( G e. Grp -> ( S e. (SubGrp ` G ) <-> ( G e. Grp /\ ( S C_ B /\ ( G ↾s S ) e. Grp ) ) ) )
32		3anass 1013	. . 3 |- ( ( G e. Grp /\ S C_ B /\ ( G ↾s S ) e. Grp ) <-> ( G e. Grp /\ ( S C_ B /\ ( G ↾s S ) e. Grp ) ) )
33	31, 32	bitr4di 198	. 2 |- ( G e. Grp -> ( S e. (SubGrp ` G ) <-> ( G e. Grp /\ S C_ B /\ ( G ↾s S ) e. Grp ) ) )
34	2, 3, 33	pm5.21nii 716	1 |- ( S e. (SubGrp ` G ) <-> ( G e. Grp /\ S C_ B /\ ( G ↾s S ) e. Grp ) )

This proof depends on syntax axioms:   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   {crab 2532   _Vcvv 2821   C_ wss 3220   ~Pcpw 3688   Fn wfn 5375   ` cfv 5380  (class class class)co 6088   Basecbs 13410   ↾_s cress 13411   Grpcgrp 13864  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-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-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  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-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-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-fv 5388  df-ov 6091  df-inn 9314  df-ndx 13413  df-slot 13414  df-base 13416  df-subg 14032

This theorem is used by:  subgss  14036  subgid  14037  subggrp  14039  subgbas  14040  subgrcl  14041  issubg2m  14051  resgrpisgrp  14057  subsubg  14059  opprsubgg  14499  subrngsubg  14621  subrgsubg  14644