Theorem issubmd 13781

Description: Deduction for proving a submonoid. (Contributed by Stefan O'Rear, 23-Aug-2015.) (Revised by Stefan O'Rear, 5-Sep-2015.)

Hypotheses

Ref	Expression
issubmd.b	|- B = ( Base ` M )
issubmd.p	|- .+ = ( +g ` M )
issubmd.z	|- .0. = ( 0g ` M )
issubmd.m	|- ( ph -> M e. Mnd )
issubmd.cz	|- ( ph -> ch )
issubmd.cp	|- ( ( ph /\ ( ( x e. B /\ y e. B ) /\ ( th /\ ta ) ) ) -> et )
issubmd.ch	|- ( z = .0. -> ( ps <-> ch ) )
issubmd.th	|- ( z = x -> ( ps <-> th ) )
issubmd.ta	|- ( z = y -> ( ps <-> ta ) )
issubmd.et	|- ( z = ( x .+ y ) -> ( ps <-> et ) )

Assertion

Ref	Expression
issubmd	|- ( ph -> { z e. B | ps } e. (SubMnd ` M ) )

Distinct variable groups:   x, y, z, B   x, M, y   ph, x, y   ps, x, y   z, .+   z, .0.   ch, z   et, z   ta, z   th, z

Allowed substitution hints:   ph( z)   ps( z)   ch( x, y)   th( x, y)   ta( x, y)   et( x, y)   .+ ( x, y)   M( z)   .0. ( x, y)

Proof of Theorem issubmd

Step	Hyp	Ref	Expression
1		ssrab2 3333	. . 3 |- { z e. B | ps } C_ B
2	1	a1i 9	. 2 |- ( ph -> { z e. B | ps } C_ B )
3		issubmd.ch	. . 3 |- ( z = .0. -> ( ps <-> ch ) )
4		issubmd.m	. . . 4 |- ( ph -> M e. Mnd )
5		issubmd.b	. . . . 5 |- B = ( Base ` M )
6		issubmd.z	. . . . 5 |- .0. = ( 0g ` M )
7	5, 6	mndidcl 13743	. . . 4 |- ( M e. Mnd -> .0. e. B )
8	4, 7	syl 14	. . 3 |- ( ph -> .0. e. B )
9		issubmd.cz	. . 3 |- ( ph -> ch )
10	3, 8, 9	elrabd 2984	. 2 |- ( ph -> .0. e. { z e. B | ps } )
11		issubmd.th	. . . . . 6 |- ( z = x -> ( ps <-> th ) )
12	11	elrab 2982	. . . . 5 |- ( x e. { z e. B | ps } <-> ( x e. B /\ th ) )
13		issubmd.ta	. . . . . 6 |- ( z = y -> ( ps <-> ta ) )
14	13	elrab 2982	. . . . 5 |- ( y e. { z e. B | ps } <-> ( y e. B /\ ta ) )
15	12, 14	anbi12i 464	. . . 4 |- ( ( x e. { z e. B | ps } /\ y e. { z e. B | ps } ) <-> ( ( x e. B /\ th ) /\ ( y e. B /\ ta ) ) )
16		issubmd.et	. . . . 5 |- ( z = ( x .+ y ) -> ( ps <-> et ) )
17	4	adantr 276	. . . . . 6 |- ( ( ph /\ ( ( x e. B /\ th ) /\ ( y e. B /\ ta ) ) ) -> M e. Mnd )
18		simprll 543	. . . . . 6 |- ( ( ph /\ ( ( x e. B /\ th ) /\ ( y e. B /\ ta ) ) ) -> x e. B )
19		simprrl 545	. . . . . 6 |- ( ( ph /\ ( ( x e. B /\ th ) /\ ( y e. B /\ ta ) ) ) -> y e. B )
20		issubmd.p	. . . . . . 7 |- .+ = ( +g ` M )
21	5, 20	mndcl 13736	. . . . . 6 |- ( ( M e. Mnd /\ x e. B /\ y e. B ) -> ( x .+ y ) e. B )
22	17, 18, 19, 21	syl3anc 1278	. . . . 5 |- ( ( ph /\ ( ( x e. B /\ th ) /\ ( y e. B /\ ta ) ) ) -> ( x .+ y ) e. B )
23		an4 592	. . . . . 6 |- ( ( ( x e. B /\ th ) /\ ( y e. B /\ ta ) ) <-> ( ( x e. B /\ y e. B ) /\ ( th /\ ta ) ) )
24		issubmd.cp	. . . . . 6 |- ( ( ph /\ ( ( x e. B /\ y e. B ) /\ ( th /\ ta ) ) ) -> et )
25	23, 24	sylan2b 287	. . . . 5 |- ( ( ph /\ ( ( x e. B /\ th ) /\ ( y e. B /\ ta ) ) ) -> et )
26	16, 22, 25	elrabd 2984	. . . 4 |- ( ( ph /\ ( ( x e. B /\ th ) /\ ( y e. B /\ ta ) ) ) -> ( x .+ y ) e. { z e. B | ps } )
27	15, 26	sylan2b 287	. . 3 |- ( ( ph /\ ( x e. { z e. B | ps } /\ y e. { z e. B | ps } ) ) -> ( x .+ y ) e. { z e. B | ps } )
28	27	ralrimivva 2632	. 2 |- ( ph -> A. x e. { z e. B | ps } A. y e. { z e. B | ps } ( x .+ y ) e. { z e. B | ps } )
29	5, 6, 20	issubm 13779	. . 3 |- ( M e. Mnd -> ( { z e. B | ps } e. (SubMnd ` M ) <-> ( { z e. B | ps } C_ B /\ .0. e. { z e. B | ps } /\ A. x e. { z e. B | ps } A. y e. { z e. B | ps } ( x .+ y ) e. { z e. B | ps } ) ) )
30	4, 29	syl 14	. 2 |- ( ph -> ( { z e. B | ps } e. (SubMnd ` M ) <-> ( { z e. B | ps } C_ B /\ .0. e. { z e. B | ps } /\ A. x e. { z e. B | ps } A. y e. { z e. B | ps } ( x .+ y ) e. { z e. B | ps } ) ) )
31	2, 10, 28, 30	mpbir3and 1211	1 |- ( ph -> { z e. B | ps } e. (SubMnd ` M ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   A.wral 2528   {crab 2532   C_ wss 3220   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   0gc0g 13610   Mndcmnd 13729  SubMndcsubmnd 13765

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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

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-reu 2535  df-rmo 2536  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 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-riota 6038  df-ov 6088  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-submnd 13767

This theorem is used by: (None)