Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  grpomndo Structured version   Visualization version   GIF version

Theorem grpomndo 35960
Description: A group is a monoid. (Contributed by FL, 2-Nov-2009.) (Revised by Mario Carneiro, 22-Dec-2013.) (New usage is discouraged.)
Assertion
Ref Expression
grpomndo (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp)

Proof of Theorem grpomndo
Dummy variables 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2738 . . . . 5 ran 𝐺 = ran 𝐺
21isgrpo 28760 . . . 4 (𝐺 ∈ GrpOp → (𝐺 ∈ GrpOp ↔ (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑤 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑤𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑤))))
32biimpd 228 . . 3 (𝐺 ∈ GrpOp → (𝐺 ∈ GrpOp → (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑤 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑤𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑤))))
41grpoidinv 28771 . . . . . . . 8 (𝐺 ∈ GrpOp → ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺(((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)))
5 simpl 482 . . . . . . . . . . 11 ((((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)) → ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))
65ralimi 3086 . . . . . . . . . 10 (∀𝑦 ∈ ran 𝐺(((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)) → ∀𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))
76reximi 3174 . . . . . . . . 9 (∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺(((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)) → ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))
81ismndo2 35959 . . . . . . . . . . . . 13 (𝐺 ∈ GrpOp → (𝐺 ∈ MndOp ↔ (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))
98biimprcd 249 . . . . . . . . . . . 12 ((𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)) → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp))
1093exp 1117 . . . . . . . . . . 11 (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) → (∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp))))
1110impcom 407 . . . . . . . . . 10 ((∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ 𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺) → (∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp)))
1211com3l 89 . . . . . . . . 9 (∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) → (𝐺 ∈ GrpOp → ((∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ 𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺) → 𝐺 ∈ MndOp)))
137, 12syl 17 . . . . . . . 8 (∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺(((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)) → (𝐺 ∈ GrpOp → ((∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ 𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺) → 𝐺 ∈ MndOp)))
144, 13mpcom 38 . . . . . . 7 (𝐺 ∈ GrpOp → ((∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ 𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺) → 𝐺 ∈ MndOp))
1514expdcom 414 . . . . . 6 (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) → (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp)))
1615a1i 11 . . . . 5 (∃𝑤 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑤𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑤) → (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) → (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp))))
1716com13 88 . . . 4 (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) → (∃𝑤 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑤𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑤) → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp))))
18173imp 1109 . . 3 ((𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑤 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑤𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑤)) → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp))
193, 18syli 39 . 2 (𝐺 ∈ GrpOp → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp))
2019pm2.43i 52 1 (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085   = wceq 1539  wcel 2108  wral 3063  wrex 3064   × cxp 5578  ran crn 5581  wf 6414  (class class class)co 7255  GrpOpcgr 28752  MndOpcmndo 35951
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  ax-un 7566
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-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  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-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fo 6424  df-fv 6426  df-ov 7258  df-grpo 28756  df-ass 35928  df-exid 35930  df-mgmOLD 35934  df-sgrOLD 35946  df-mndo 35952
This theorem is referenced by:  isdrngo2  36043
  Copyright terms: Public domain W3C validator