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

Theorem frgpuptf 19649
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 7018 . . . . 5 ((𝜑𝑦𝐼) → (𝐹𝑦) ∈ 𝐵)
32adantrr 717 . . . 4 ((𝜑 ∧ (𝑦𝐼𝑧 ∈ 2o)) → (𝐹𝑦) ∈ 𝐵)
4 frgpup.h . . . . 5 (𝜑𝐻 ∈ Grp)
5 frgpup.b . . . . . 6 𝐵 = (Base‘𝐻)
6 frgpup.n . . . . . 6 𝑁 = (invg𝐻)
75, 6grpinvcl 18866 . . . . 5 ((𝐻 ∈ Grp ∧ (𝐹𝑦) ∈ 𝐵) → (𝑁‘(𝐹𝑦)) ∈ 𝐵)
84, 3, 7syl2an2r 685 . . . 4 ((𝜑 ∧ (𝑦𝐼𝑧 ∈ 2o)) → (𝑁‘(𝐹𝑦)) ∈ 𝐵)
93, 8ifcld 4523 . . 3 ((𝜑 ∧ (𝑦𝐼𝑧 ∈ 2o)) → if(𝑧 = ∅, (𝐹𝑦), (𝑁‘(𝐹𝑦))) ∈ 𝐵)
109ralrimivva 3172 . 2 (𝜑 → ∀𝑦𝐼𝑧 ∈ 2o if(𝑧 = ∅, (𝐹𝑦), (𝑁‘(𝐹𝑦))) ∈ 𝐵)
11 frgpup.t . . 3 𝑇 = (𝑦𝐼, 𝑧 ∈ 2o ↦ if(𝑧 = ∅, (𝐹𝑦), (𝑁‘(𝐹𝑦))))
1211fmpo 8003 . 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 3044  c0 4284  ifcif 4476   × cxp 5617  wf 6478  cfv 6482  cmpo 7351  2oc2o 8382  Basecbs 17120  Grpcgrp 18812  invgcminusg 18813
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 2701  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671
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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-1st 7924  df-2nd 7925  df-0g 17345  df-mgm 18514  df-sgrp 18593  df-mnd 18609  df-grp 18815  df-minusg 18816
This theorem is referenced by:  frgpuplem  19651  frgpupf  19652  frgpup1  19654  frgpup2  19655  frgpup3lem  19656
  Copyright terms: Public domain W3C validator