Theorem issubmd 13562

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	⊢ 𝐵 = (Base‘𝑀)
issubmd.p	⊢ + = (+g‘𝑀)
issubmd.z	⊢ 0 = (0g‘𝑀)
issubmd.m	⊢ (𝜑 → 𝑀 ∈ Mnd)
issubmd.cz	⊢ (𝜑 → 𝜒)
issubmd.cp	⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝜃 ∧ 𝜏))) → 𝜂)
issubmd.ch	⊢ (𝑧 = 0 → (𝜓 ↔ 𝜒))
issubmd.th	⊢ (𝑧 = 𝑥 → (𝜓 ↔ 𝜃))
issubmd.ta	⊢ (𝑧 = 𝑦 → (𝜓 ↔ 𝜏))
issubmd.et	⊢ (𝑧 = (𝑥 + 𝑦) → (𝜓 ↔ 𝜂))

Assertion

Ref	Expression
issubmd	⊢ (𝜑 → {𝑧 ∈ 𝐵 ∣ 𝜓} ∈ (SubMnd‘𝑀))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝑀,𝑦   𝜑,𝑥,𝑦   𝜓,𝑥,𝑦   𝑧, +   𝑧, 0   𝜒,𝑧   𝜂,𝑧   𝜏,𝑧   𝜃,𝑧

Allowed substitution hints:   𝜑(𝑧)   𝜓(𝑧)   𝜒(𝑥,𝑦)   𝜃(𝑥,𝑦)   𝜏(𝑥,𝑦)   𝜂(𝑥,𝑦)   + (𝑥,𝑦)   𝑀(𝑧)   0 (𝑥,𝑦)

Proof of Theorem issubmd

Step	Hyp	Ref	Expression
1		ssrab2 3312	. . 3 ⊢ {𝑧 ∈ 𝐵 ∣ 𝜓} ⊆ 𝐵
2	1	a1i 9	. 2 ⊢ (𝜑 → {𝑧 ∈ 𝐵 ∣ 𝜓} ⊆ 𝐵)
3		issubmd.ch	. . 3 ⊢ (𝑧 = 0 → (𝜓 ↔ 𝜒))
4		issubmd.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ Mnd)
5		issubmd.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑀)
6		issubmd.z	. . . . 5 ⊢ 0 = (0g‘𝑀)
7	5, 6	mndidcl 13518	. . . 4 ⊢ (𝑀 ∈ Mnd → 0 ∈ 𝐵)
8	4, 7	syl 14	. . 3 ⊢ (𝜑 → 0 ∈ 𝐵)
9		issubmd.cz	. . 3 ⊢ (𝜑 → 𝜒)
10	3, 8, 9	elrabd 2964	. 2 ⊢ (𝜑 → 0 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
11		issubmd.th	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝜓 ↔ 𝜃))
12	11	elrab 2962	. . . . 5 ⊢ (𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ↔ (𝑥 ∈ 𝐵 ∧ 𝜃))
13		issubmd.ta	. . . . . 6 ⊢ (𝑧 = 𝑦 → (𝜓 ↔ 𝜏))
14	13	elrab 2962	. . . . 5 ⊢ (𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ↔ (𝑦 ∈ 𝐵 ∧ 𝜏))
15	12, 14	anbi12i 460	. . . 4 ⊢ ((𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ∧ 𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓}) ↔ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏)))
16		issubmd.et	. . . . 5 ⊢ (𝑧 = (𝑥 + 𝑦) → (𝜓 ↔ 𝜂))
17	4	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → 𝑀 ∈ Mnd)
18		simprll 539	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → 𝑥 ∈ 𝐵)
19		simprrl 541	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → 𝑦 ∈ 𝐵)
20		issubmd.p	. . . . . . 7 ⊢ + = (+g‘𝑀)
21	5, 20	mndcl 13511	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
22	17, 18, 19, 21	syl3anc 1273	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → (𝑥 + 𝑦) ∈ 𝐵)
23		an4 588	. . . . . 6 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝜃 ∧ 𝜏)))
24		issubmd.cp	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝜃 ∧ 𝜏))) → 𝜂)
25	23, 24	sylan2b 287	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → 𝜂)
26	16, 22, 25	elrabd 2964	. . . 4 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
27	15, 26	sylan2b 287	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ∧ 𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})) → (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
28	27	ralrimivva 2614	. 2 ⊢ (𝜑 → ∀𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓}∀𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
29	5, 6, 20	issubm 13560	. . 3 ⊢ (𝑀 ∈ Mnd → ({𝑧 ∈ 𝐵 ∣ 𝜓} ∈ (SubMnd‘𝑀) ↔ ({𝑧 ∈ 𝐵 ∣ 𝜓} ⊆ 𝐵 ∧ 0 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ∧ ∀𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓}∀𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})))
30	4, 29	syl 14	. 2 ⊢ (𝜑 → ({𝑧 ∈ 𝐵 ∣ 𝜓} ∈ (SubMnd‘𝑀) ↔ ({𝑧 ∈ 𝐵 ∣ 𝜓} ⊆ 𝐵 ∧ 0 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ∧ ∀𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓}∀𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})))
31	2, 10, 28, 30	mpbir3and 1206	1 ⊢ (𝜑 → {𝑧 ∈ 𝐵 ∣ 𝜓} ∈ (SubMnd‘𝑀))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1004   = wceq 1397   ∈ wcel 2202  ∀wral 2510  {crab 2514   ⊆ wss 3200  ‘cfv 5326  (class class class)co 6018  Basecbs 13087  +_gcplusg 13165  0_gc0g 13344  Mndcmnd 13504  SubMndcsubmnd 13546

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-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8123  ax-resscn 8124  ax-1re 8126  ax-addrcl 8129

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-riota 5971  df-ov 6021  df-inn 9144  df-2 9202  df-ndx 13090  df-slot 13091  df-base 13093  df-plusg 13178  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-submnd 13548

This theorem is referenced by: (None)