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 33303
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 2621 . . . . 5 ran 𝐺 = ran 𝐺
21isgrpo 27197 . . . 4 (𝐺 ∈ GrpOp → (𝐺 ∈ GrpOp ↔ (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑤 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑤𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑤))))
32biimpd 219 . . 3 (𝐺 ∈ GrpOp → (𝐺 ∈ GrpOp → (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑤 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑤𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑤))))
41grpoidinv 27208 . . . . . . . 8 (𝐺 ∈ GrpOp → ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺(((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)))
5 simpl 473 . . . . . . . . . . 11 ((((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)) → ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))
65ralimi 2947 . . . . . . . . . 10 (∀𝑦 ∈ ran 𝐺(((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)) → ∀𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))
76reximi 3005 . . . . . . . . 9 (∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺(((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)) → ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))
81ismndo2 33302 . . . . . . . . . . . . 13 (𝐺 ∈ GrpOp → (𝐺 ∈ MndOp ↔ (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))
98biimprcd 240 . . . . . . . . . . . 12 ((𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)) → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp))
1093exp 1261 . . . . . . . . . . 11 (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) → (∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp))))
1110impcom 446 . . . . . . . . . 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 455 . . . . . 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 1254 . . 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 384  w3a 1036   = wceq 1480  wcel 1987  wral 2907  wrex 2908   × cxp 5072  ran crn 5075  wf 5843  (class class class)co 6604  GrpOpcgr 27189  MndOpcmndo 33294
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pr 4867  ax-un 6902
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-id 4989  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-fo 5853  df-fv 5855  df-ov 6607  df-grpo 27193  df-ass 33271  df-exid 33273  df-mgmOLD 33277  df-sgrOLD 33289  df-mndo 33295
This theorem is referenced by:  isdrngo2  33386
  Copyright terms: Public domain W3C validator