Theorem issubmd 13679

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 3322	. . 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 13635	. . . 4 ⊢ (𝑀 ∈ Mnd → 0 ∈ 𝐵)
8	4, 7	syl 14	. . 3 ⊢ (𝜑 → 0 ∈ 𝐵)
9		issubmd.cz	. . 3 ⊢ (𝜑 → 𝜒)
10	3, 8, 9	elrabd 2974	. 2 ⊢ (𝜑 → 0 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
11		issubmd.th	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝜓 ↔ 𝜃))
12	11	elrab 2972	. . . . 5 ⊢ (𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ↔ (𝑥 ∈ 𝐵 ∧ 𝜃))
13		issubmd.ta	. . . . . 6 ⊢ (𝑧 = 𝑦 → (𝜓 ↔ 𝜏))
14	13	elrab 2972	. . . . 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 13628	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
22	17, 18, 19, 21	syl3anc 1274	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → (𝑥 + 𝑦) ∈ 𝐵)
23		an4 588	. . . . . 6 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝜃 ∧ 𝜏)))
24		issubmd.cp	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝜃 ∧ 𝜏))) → 𝜂)
25	23, 24	sylan2b 287	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → 𝜂)
26	16, 22, 25	elrabd 2974	. . . 4 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
27	15, 26	sylan2b 287	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ∧ 𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})) → (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
28	27	ralrimivva 2624	. 2 ⊢ (𝜑 → ∀𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓}∀𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
29	5, 6, 20	issubm 13677	. . 3 ⊢ (𝑀 ∈ Mnd → ({𝑧 ∈ 𝐵 ∣ 𝜓} ∈ (SubMnd‘𝑀) ↔ ({𝑧 ∈ 𝐵 ∣ 𝜓} ⊆ 𝐵 ∧ 0 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ∧ ∀𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓}∀𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})))
30	4, 29	syl 14	. 2 ⊢ (𝜑 → ({𝑧 ∈ 𝐵 ∣ 𝜓} ∈ (SubMnd‘𝑀) ↔ ({𝑧 ∈ 𝐵 ∣ 𝜓} ⊆ 𝐵 ∧ 0 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ∧ ∀𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓}∀𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})))
31	2, 10, 28, 30	mpbir3and 1207	1 ⊢ (𝜑 → {𝑧 ∈ 𝐵 ∣ 𝜓} ∈ (SubMnd‘𝑀))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1005   = wceq 1398   ∈ wcel 2203  ∀wral 2520  {crab 2524   ⊆ wss 3210  ‘cfv 5351  (class class class)co 6049  Basecbs 13204  +_gcplusg 13282  0_gc0g 13461  Mndcmnd 13621  SubMndcsubmnd 13663

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 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 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-cnex 8217  ax-resscn 8218  ax-1re 8220  ax-addrcl 8223

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-iota 5311  df-fun 5353  df-fn 5354  df-fv 5359  df-riota 6002  df-ov 6052  df-inn 9237  df-2 9295  df-ndx 13207  df-slot 13208  df-base 13210  df-plusg 13295  df-0g 13463  df-mgm 13561  df-sgrp 13607  df-mnd 13622  df-submnd 13665

This theorem is referenced by: (None)