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 33987
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 2813 . . . . 5 ran 𝐺 = ran 𝐺
21isgrpo 27686 . . . 4 (𝐺 ∈ GrpOp → (𝐺 ∈ GrpOp ↔ (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑤 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑤𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑤))))
32biimpd 220 . . 3 (𝐺 ∈ GrpOp → (𝐺 ∈ GrpOp → (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑤 ∈ ran 𝐺𝑥 ∈ ran 𝐺((𝑤𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ ran 𝐺(𝑦𝐺𝑥) = 𝑤))))
41grpoidinv 27697 . . . . . . . 8 (𝐺 ∈ GrpOp → ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺(((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)))
5 simpl 470 . . . . . . . . . . 11 ((((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)) → ((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))
65ralimi 3147 . . . . . . . . . 10 (∀𝑦 ∈ ran 𝐺(((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)) → ∀𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))
76reximi 3205 . . . . . . . . 9 (∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺(((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) ∧ ∃𝑤 ∈ ran 𝐺((𝑤𝐺𝑦) = 𝑥 ∧ (𝑦𝐺𝑤) = 𝑥)) → ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))
81ismndo2 33986 . . . . . . . . . . . . 13 (𝐺 ∈ GrpOp → (𝐺 ∈ MndOp ↔ (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦))))
98biimprcd 241 . . . . . . . . . . . 12 ((𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 ∧ ∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦)) → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp))
1093exp 1141 . . . . . . . . . . 11 (𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → (∀𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺𝑧 ∈ ran 𝐺((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) → (∃𝑥 ∈ ran 𝐺𝑦 ∈ ran 𝐺((𝑥𝐺𝑦) = 𝑦 ∧ (𝑦𝐺𝑥) = 𝑦) → (𝐺 ∈ GrpOp → 𝐺 ∈ MndOp))))
1110impcom 396 . . . . . . . . . 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 401 . . . . . 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 1130 . . 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 1100   = wceq 1637  wcel 2157  wral 3103  wrex 3104   × cxp 5316  ran crn 5319  wf 6100  (class class class)co 6877  GrpOpcgr 27678  MndOpcmndo 33978
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2069  ax-7 2105  ax-8 2159  ax-9 2166  ax-10 2186  ax-11 2202  ax-12 2215  ax-13 2422  ax-ext 2791  ax-sep 4982  ax-nul 4990  ax-pr 5103  ax-un 7182
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2062  df-mo 2635  df-eu 2638  df-clab 2800  df-cleq 2806  df-clel 2809  df-nfc 2944  df-ne 2986  df-ral 3108  df-rex 3109  df-rab 3112  df-v 3400  df-sbc 3641  df-csb 3736  df-dif 3779  df-un 3781  df-in 3783  df-ss 3790  df-nul 4124  df-if 4287  df-sn 4378  df-pr 4380  df-op 4384  df-uni 4638  df-iun 4721  df-br 4852  df-opab 4914  df-mpt 4931  df-id 5226  df-xp 5324  df-rel 5325  df-cnv 5326  df-co 5327  df-dm 5328  df-rn 5329  df-iota 6067  df-fun 6106  df-fn 6107  df-f 6108  df-fo 6110  df-fv 6112  df-ov 6880  df-grpo 27682  df-ass 33955  df-exid 33957  df-mgmOLD 33961  df-sgrOLD 33973  df-mndo 33979
This theorem is referenced by:  isdrngo2  34070
  Copyright terms: Public domain W3C validator