MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  issubmd Structured version   Visualization version   GIF version

Theorem issubmd 19051
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
StepHypRef Expression
1 ssrab2 4008 . . 3 {𝑧 ∈ 𝐵 ∣ 𝜓} ⊆ 𝐵
21a1i 11 . 2 (𝜑 → {𝑧 ∈ 𝐵 ∣ 𝜓} ⊆ 𝐵)
3 issubmd.ch . . 3 (𝑧 = 0 → (𝜓 ↔ 𝜒))
4 issubmd.m . . . 4 (𝜑 → 𝑀 ∈ Mnd)
5 issubmd.b . . . . 5 𝐵 = (Base‘𝑀)
6 issubmd.z . . . . 5 0 = (0g‘𝑀)
75, 6mndidcl 18989 . . . 4 (𝑀 ∈ Mnd → 0 ∈ 𝐵)
84, 7syl 18 . . 3 (𝜑 → 0 ∈ 𝐵)
9 issubmd.cz . . 3 (𝜑 → 𝜒)
103, 8, 9elrabd 3650 . 2 (𝜑 → 0 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
11 issubmd.th . . . . . 6 (𝑧 = 𝑥 → (𝜓 ↔ 𝜃))
1211elrab 3648 . . . . 5 (𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ↔ (𝑥 ∈ 𝐵 ∧ 𝜃))
13 issubmd.ta . . . . . 6 (𝑧 = 𝑦 → (𝜓 ↔ 𝜏))
1413elrab 3648 . . . . 5 (𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ↔ (𝑦 ∈ 𝐵 ∧ 𝜏))
1512, 14anbi12i 640 . . . 4 ((𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ∧ 𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓}) ↔ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏)))
16 issubmd.et . . . . 5 (𝑧 = (𝑥 + 𝑦) → (𝜓 ↔ 𝜂))
174adantr 486 . . . . . 6 ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → 𝑀 ∈ Mnd)
18 simprll 791 . . . . . 6 ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → 𝑥 ∈ 𝐵)
19 simprrl 793 . . . . . 6 ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → 𝑦 ∈ 𝐵)
20 issubmd.p . . . . . . 7 + = (+g‘𝑀)
215, 20mndcl 18981 . . . . . 6 ((𝑀 ∈ Mnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
2217, 18, 19, 21syl3anc 1399 . . . . 5 ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → (𝑥 + 𝑦) ∈ 𝐵)
23 an4 669 . . . . . 6 (((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝜃 ∧ 𝜏)))
24 issubmd.cp . . . . . 6 ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝜃 ∧ 𝜏))) → 𝜂)
2523, 24sylan2b 606 . . . . 5 ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → 𝜂)
2616, 22, 25elrabd 3650 . . . 4 ((𝜑 ∧ ((𝑥 ∈ 𝐵 ∧ 𝜃) ∧ (𝑦 ∈ 𝐵 ∧ 𝜏))) → (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
2715, 26sylan2b 606 . . 3 ((𝜑 ∧ (𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ∧ 𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})) → (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
2827ralrimivva 3209 . 2 (𝜑 → ∀𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓}∀𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})
295, 6, 20issubm 19048 . . 3 (𝑀 ∈ Mnd → ({𝑧 ∈ 𝐵 ∣ 𝜓} ∈ (SubMnd‘𝑀) ↔ ({𝑧 ∈ 𝐵 ∣ 𝜓} ⊆ 𝐵 ∧ 0 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ∧ ∀𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓}∀𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})))
304, 29syl 18 . 2 (𝜑 → ({𝑧 ∈ 𝐵 ∣ 𝜓} ∈ (SubMnd‘𝑀) ↔ ({𝑧 ∈ 𝐵 ∣ 𝜓} ⊆ 𝐵 ∧ 0 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} ∧ ∀𝑥 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓}∀𝑦 ∈ {𝑧 ∈ 𝐵 ∣ 𝜓} (𝑥 + 𝑦) ∈ {𝑧 ∈ 𝐵 ∣ 𝜓})))
312, 10, 28, 30mpbir3and 1361 1 (𝜑 → {𝑧 ∈ 𝐵 ∣ 𝜓} ∈ (SubMnd‘𝑀))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +gcplusg 17472  0gc0g 17660  Mndcmnd 18973  SubMndcsubmnd 19027
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-riota 7408  df-ov 7454  df-0g 17662  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-submnd 19029
This theorem is used by:  mndind  19074
  Copyright terms: Public domain W3C validator