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

Theorem ismndd 18322
Description: Deduce a monoid from its properties. (Contributed by Mario Carneiro, 6-Jan-2015.)
Hypotheses
Ref Expression
ismndd.b (𝜑𝐵 = (Base‘𝐺))
ismndd.p (𝜑+ = (+g𝐺))
ismndd.c ((𝜑𝑥𝐵𝑦𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
ismndd.a ((𝜑 ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
ismndd.z (𝜑0𝐵)
ismndd.i ((𝜑𝑥𝐵) → ( 0 + 𝑥) = 𝑥)
ismndd.j ((𝜑𝑥𝐵) → (𝑥 + 0 ) = 𝑥)
Assertion
Ref Expression
ismndd (𝜑𝐺 ∈ Mnd)
Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝐺,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥, 0
Allowed substitution hints:   + (𝑥,𝑦,𝑧)   0 (𝑦,𝑧)

Proof of Theorem ismndd
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 ismndd.c . . . . . 6 ((𝜑𝑥𝐵𝑦𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
213expb 1118 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥 + 𝑦) ∈ 𝐵)
3 simpll 763 . . . . . . 7 (((𝜑 ∧ (𝑥𝐵𝑦𝐵)) ∧ 𝑧𝐵) → 𝜑)
4 simplrl 773 . . . . . . 7 (((𝜑 ∧ (𝑥𝐵𝑦𝐵)) ∧ 𝑧𝐵) → 𝑥𝐵)
5 simplrr 774 . . . . . . 7 (((𝜑 ∧ (𝑥𝐵𝑦𝐵)) ∧ 𝑧𝐵) → 𝑦𝐵)
6 simpr 484 . . . . . . 7 (((𝜑 ∧ (𝑥𝐵𝑦𝐵)) ∧ 𝑧𝐵) → 𝑧𝐵)
7 ismndd.a . . . . . . 7 ((𝜑 ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
83, 4, 5, 6, 7syl13anc 1370 . . . . . 6 (((𝜑 ∧ (𝑥𝐵𝑦𝐵)) ∧ 𝑧𝐵) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
98ralrimiva 3107 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ∀𝑧𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
102, 9jca 511 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))))
1110ralrimivva 3114 . . 3 (𝜑 → ∀𝑥𝐵𝑦𝐵 ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))))
12 ismndd.b . . . 4 (𝜑𝐵 = (Base‘𝐺))
13 ismndd.p . . . . . . . 8 (𝜑+ = (+g𝐺))
1413oveqd 7272 . . . . . . 7 (𝜑 → (𝑥 + 𝑦) = (𝑥(+g𝐺)𝑦))
1514, 12eleq12d 2833 . . . . . 6 (𝜑 → ((𝑥 + 𝑦) ∈ 𝐵 ↔ (𝑥(+g𝐺)𝑦) ∈ (Base‘𝐺)))
16 eqidd 2739 . . . . . . . . 9 (𝜑𝑧 = 𝑧)
1713, 14, 16oveq123d 7276 . . . . . . . 8 (𝜑 → ((𝑥 + 𝑦) + 𝑧) = ((𝑥(+g𝐺)𝑦)(+g𝐺)𝑧))
18 eqidd 2739 . . . . . . . . 9 (𝜑𝑥 = 𝑥)
1913oveqd 7272 . . . . . . . . 9 (𝜑 → (𝑦 + 𝑧) = (𝑦(+g𝐺)𝑧))
2013, 18, 19oveq123d 7276 . . . . . . . 8 (𝜑 → (𝑥 + (𝑦 + 𝑧)) = (𝑥(+g𝐺)(𝑦(+g𝐺)𝑧)))
2117, 20eqeq12d 2754 . . . . . . 7 (𝜑 → (((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)) ↔ ((𝑥(+g𝐺)𝑦)(+g𝐺)𝑧) = (𝑥(+g𝐺)(𝑦(+g𝐺)𝑧))))
2212, 21raleqbidv 3327 . . . . . 6 (𝜑 → (∀𝑧𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)) ↔ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g𝐺)𝑦)(+g𝐺)𝑧) = (𝑥(+g𝐺)(𝑦(+g𝐺)𝑧))))
2315, 22anbi12d 630 . . . . 5 (𝜑 → (((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) ↔ ((𝑥(+g𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g𝐺)𝑦)(+g𝐺)𝑧) = (𝑥(+g𝐺)(𝑦(+g𝐺)𝑧)))))
2412, 23raleqbidv 3327 . . . 4 (𝜑 → (∀𝑦𝐵 ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) ↔ ∀𝑦 ∈ (Base‘𝐺)((𝑥(+g𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g𝐺)𝑦)(+g𝐺)𝑧) = (𝑥(+g𝐺)(𝑦(+g𝐺)𝑧)))))
2512, 24raleqbidv 3327 . . 3 (𝜑 → (∀𝑥𝐵𝑦𝐵 ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) ↔ ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)((𝑥(+g𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g𝐺)𝑦)(+g𝐺)𝑧) = (𝑥(+g𝐺)(𝑦(+g𝐺)𝑧)))))
2611, 25mpbid 231 . 2 (𝜑 → ∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)((𝑥(+g𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g𝐺)𝑦)(+g𝐺)𝑧) = (𝑥(+g𝐺)(𝑦(+g𝐺)𝑧))))
27 ismndd.z . . . 4 (𝜑0𝐵)
2827, 12eleqtrd 2841 . . 3 (𝜑0 ∈ (Base‘𝐺))
2912eleq2d 2824 . . . . . 6 (𝜑 → (𝑥𝐵𝑥 ∈ (Base‘𝐺)))
3029biimpar 477 . . . . 5 ((𝜑𝑥 ∈ (Base‘𝐺)) → 𝑥𝐵)
3113adantr 480 . . . . . . . 8 ((𝜑𝑥𝐵) → + = (+g𝐺))
3231oveqd 7272 . . . . . . 7 ((𝜑𝑥𝐵) → ( 0 + 𝑥) = ( 0 (+g𝐺)𝑥))
33 ismndd.i . . . . . . 7 ((𝜑𝑥𝐵) → ( 0 + 𝑥) = 𝑥)
3432, 33eqtr3d 2780 . . . . . 6 ((𝜑𝑥𝐵) → ( 0 (+g𝐺)𝑥) = 𝑥)
3531oveqd 7272 . . . . . . 7 ((𝜑𝑥𝐵) → (𝑥 + 0 ) = (𝑥(+g𝐺) 0 ))
36 ismndd.j . . . . . . 7 ((𝜑𝑥𝐵) → (𝑥 + 0 ) = 𝑥)
3735, 36eqtr3d 2780 . . . . . 6 ((𝜑𝑥𝐵) → (𝑥(+g𝐺) 0 ) = 𝑥)
3834, 37jca 511 . . . . 5 ((𝜑𝑥𝐵) → (( 0 (+g𝐺)𝑥) = 𝑥 ∧ (𝑥(+g𝐺) 0 ) = 𝑥))
3930, 38syldan 590 . . . 4 ((𝜑𝑥 ∈ (Base‘𝐺)) → (( 0 (+g𝐺)𝑥) = 𝑥 ∧ (𝑥(+g𝐺) 0 ) = 𝑥))
4039ralrimiva 3107 . . 3 (𝜑 → ∀𝑥 ∈ (Base‘𝐺)(( 0 (+g𝐺)𝑥) = 𝑥 ∧ (𝑥(+g𝐺) 0 ) = 𝑥))
41 oveq1 7262 . . . . . 6 (𝑢 = 0 → (𝑢(+g𝐺)𝑥) = ( 0 (+g𝐺)𝑥))
4241eqeq1d 2740 . . . . 5 (𝑢 = 0 → ((𝑢(+g𝐺)𝑥) = 𝑥 ↔ ( 0 (+g𝐺)𝑥) = 𝑥))
4342ovanraleqv 7279 . . . 4 (𝑢 = 0 → (∀𝑥 ∈ (Base‘𝐺)((𝑢(+g𝐺)𝑥) = 𝑥 ∧ (𝑥(+g𝐺)𝑢) = 𝑥) ↔ ∀𝑥 ∈ (Base‘𝐺)(( 0 (+g𝐺)𝑥) = 𝑥 ∧ (𝑥(+g𝐺) 0 ) = 𝑥)))
4443rspcev 3552 . . 3 (( 0 ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ (Base‘𝐺)(( 0 (+g𝐺)𝑥) = 𝑥 ∧ (𝑥(+g𝐺) 0 ) = 𝑥)) → ∃𝑢 ∈ (Base‘𝐺)∀𝑥 ∈ (Base‘𝐺)((𝑢(+g𝐺)𝑥) = 𝑥 ∧ (𝑥(+g𝐺)𝑢) = 𝑥))
4528, 40, 44syl2anc 583 . 2 (𝜑 → ∃𝑢 ∈ (Base‘𝐺)∀𝑥 ∈ (Base‘𝐺)((𝑢(+g𝐺)𝑥) = 𝑥 ∧ (𝑥(+g𝐺)𝑢) = 𝑥))
46 eqid 2738 . . 3 (Base‘𝐺) = (Base‘𝐺)
47 eqid 2738 . . 3 (+g𝐺) = (+g𝐺)
4846, 47ismnd 18303 . 2 (𝐺 ∈ Mnd ↔ (∀𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)((𝑥(+g𝐺)𝑦) ∈ (Base‘𝐺) ∧ ∀𝑧 ∈ (Base‘𝐺)((𝑥(+g𝐺)𝑦)(+g𝐺)𝑧) = (𝑥(+g𝐺)(𝑦(+g𝐺)𝑧))) ∧ ∃𝑢 ∈ (Base‘𝐺)∀𝑥 ∈ (Base‘𝐺)((𝑢(+g𝐺)𝑥) = 𝑥 ∧ (𝑥(+g𝐺)𝑢) = 𝑥)))
4926, 45, 48sylanbrc 582 1 (𝜑𝐺 ∈ Mnd)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085   = wceq 1539  wcel 2108  wral 3063  wrex 3064  cfv 6418  (class class class)co 7255  Basecbs 16840  +gcplusg 16888  Mndcmnd 18300
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-iota 6376  df-fv 6426  df-ov 7258  df-mgm 18241  df-sgrp 18290  df-mnd 18301
This theorem is referenced by:  issubmnd  18327  prdsmndd  18333  imasmnd2  18337  frmdmnd  18413  isgrpde  18515  oppgmnd  18876  isringd  19739  iscrngd  19740  xrsmcmn  20533  xrs1mnd  20548  idlsrgmnd  31561  bj-endmnd  35416  endmndlem  46184
  Copyright terms: Public domain W3C validator