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

Theorem frgpuptf 19756
Description: Any assignment of the generators to target elements can be extended (uniquely) to a homomorphism from a free monoid to an arbitrary other monoid. (Contributed by Mario Carneiro, 2-Oct-2015.)
Hypotheses
Ref Expression
frgpup.b 𝐵 = (Base‘𝐻)
frgpup.n 𝑁 = (invg𝐻)
frgpup.t 𝑇 = (𝑦𝐼, 𝑧 ∈ 2o ↦ if(𝑧 = ∅, (𝐹𝑦), (𝑁‘(𝐹𝑦))))
frgpup.h (𝜑𝐻 ∈ Grp)
frgpup.i (𝜑𝐼𝑉)
frgpup.a (𝜑𝐹:𝐼𝐵)
Assertion
Ref Expression
frgpuptf (𝜑𝑇:(𝐼 × 2o)⟶𝐵)
Distinct variable groups:   𝑦,𝑧,𝐹   𝑦,𝑁,𝑧   𝑦,𝐵,𝑧   𝜑,𝑦,𝑧   𝑦,𝐼,𝑧
Allowed substitution hints:   𝑇(𝑦,𝑧)   𝐻(𝑦,𝑧)   𝑉(𝑦,𝑧)

Proof of Theorem frgpuptf
StepHypRef Expression
1 frgpup.a . . . . . 6 (𝜑𝐹:𝐼𝐵)
21ffvelcdmda 7079 . . . . 5 ((𝜑𝑦𝐼) → (𝐹𝑦) ∈ 𝐵)
32adantrr 717 . . . 4 ((𝜑 ∧ (𝑦𝐼𝑧 ∈ 2o)) → (𝐹𝑦) ∈ 𝐵)
4 frgpup.h . . . . 5 (𝜑𝐻 ∈ Grp)
5 frgpup.b . . . . . 6 𝐵 = (Base‘𝐻)
6 frgpup.n . . . . . 6 𝑁 = (invg𝐻)
75, 6grpinvcl 18975 . . . . 5 ((𝐻 ∈ Grp ∧ (𝐹𝑦) ∈ 𝐵) → (𝑁‘(𝐹𝑦)) ∈ 𝐵)
84, 3, 7syl2an2r 685 . . . 4 ((𝜑 ∧ (𝑦𝐼𝑧 ∈ 2o)) → (𝑁‘(𝐹𝑦)) ∈ 𝐵)
93, 8ifcld 4552 . . 3 ((𝜑 ∧ (𝑦𝐼𝑧 ∈ 2o)) → if(𝑧 = ∅, (𝐹𝑦), (𝑁‘(𝐹𝑦))) ∈ 𝐵)
109ralrimivva 3188 . 2 (𝜑 → ∀𝑦𝐼𝑧 ∈ 2o if(𝑧 = ∅, (𝐹𝑦), (𝑁‘(𝐹𝑦))) ∈ 𝐵)
11 frgpup.t . . 3 𝑇 = (𝑦𝐼, 𝑧 ∈ 2o ↦ if(𝑧 = ∅, (𝐹𝑦), (𝑁‘(𝐹𝑦))))
1211fmpo 8072 . 2 (∀𝑦𝐼𝑧 ∈ 2o if(𝑧 = ∅, (𝐹𝑦), (𝑁‘(𝐹𝑦))) ∈ 𝐵𝑇:(𝐼 × 2o)⟶𝐵)
1310, 12sylib 218 1 (𝜑𝑇:(𝐼 × 2o)⟶𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  wral 3052  c0 4313  ifcif 4505   × cxp 5657  wf 6532  cfv 6536  cmpo 7412  2oc2o 8479  Basecbs 17233  Grpcgrp 18921  invgcminusg 18922
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7993  df-2nd 7994  df-0g 17460  df-mgm 18623  df-sgrp 18702  df-mnd 18718  df-grp 18924  df-minusg 18925
This theorem is referenced by:  frgpuplem  19758  frgpupf  19759  frgpup1  19761  frgpup2  19762  frgpup3lem  19763
  Copyright terms: Public domain W3C validator