| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frgpuptf | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| frgpup.b | ⊢ 𝐵 = (Base‘𝐻) |
| frgpup.n | ⊢ 𝑁 = (invg‘𝐻) |
| frgpup.t | ⊢ 𝑇 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦)))) |
| frgpup.h | ⊢ (𝜑 → 𝐻 ∈ Grp) |
| frgpup.i | ⊢ (𝜑 → 𝐼 ∈ 𝑉) |
| frgpup.a | ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) |
| Ref | Expression |
|---|---|
| frgpuptf | ⊢ (𝜑 → 𝑇:(𝐼 × 2o)⟶𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frgpup.a | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) | |
| 2 | 1 | ffvelcdmda 7038 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ 𝐵) |
| 3 | 2 | adantrr 718 | . . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐼 ∧ 𝑧 ∈ 2o)) → (𝐹‘𝑦) ∈ 𝐵) |
| 4 | frgpup.h | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ Grp) | |
| 5 | frgpup.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐻) | |
| 6 | frgpup.n | . . . . . 6 ⊢ 𝑁 = (invg‘𝐻) | |
| 7 | 5, 6 | grpinvcl 18929 | . . . . 5 ⊢ ((𝐻 ∈ Grp ∧ (𝐹‘𝑦) ∈ 𝐵) → (𝑁‘(𝐹‘𝑦)) ∈ 𝐵) |
| 8 | 4, 3, 7 | syl2an2r 686 | . . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐼 ∧ 𝑧 ∈ 2o)) → (𝑁‘(𝐹‘𝑦)) ∈ 𝐵) |
| 9 | 3, 8 | ifcld 4528 | . . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐼 ∧ 𝑧 ∈ 2o)) → if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) ∈ 𝐵) |
| 10 | 9 | ralrimivva 3181 | . 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐼 ∀𝑧 ∈ 2o if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) ∈ 𝐵) |
| 11 | frgpup.t | . . 3 ⊢ 𝑇 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦)))) | |
| 12 | 11 | fmpo 8022 | . 2 ⊢ (∀𝑦 ∈ 𝐼 ∀𝑧 ∈ 2o if(𝑧 = ∅, (𝐹‘𝑦), (𝑁‘(𝐹‘𝑦))) ∈ 𝐵 ↔ 𝑇:(𝐼 × 2o)⟶𝐵) |
| 13 | 10, 12 | sylib 218 | 1 ⊢ (𝜑 → 𝑇:(𝐼 × 2o)⟶𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∅c0 4287 ifcif 4481 × cxp 5630 ⟶wf 6496 ‘cfv 6500 ∈ cmpo 7370 2oc2o 8401 Basecbs 17148 Grpcgrp 18875 invgcminusg 18876 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-0g 17373 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-grp 18878 df-minusg 18879 |
| This theorem is referenced by: frgpuplem 19713 frgpupf 19714 frgpup1 19716 frgpup2 19717 frgpup3lem 19718 |
| Copyright terms: Public domain | W3C validator |