| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frmd0 | Structured version Visualization version GIF version | ||
| Description: The identity of the free monoid is the empty word. (Contributed by Mario Carneiro, 27-Sep-2015.) |
| Ref | Expression |
|---|---|
| frmdmnd.m | ⊢ 𝑀 = (freeMnd‘𝐼) |
| Ref | Expression |
|---|---|
| frmd0 | ⊢ ∅ = (0g‘𝑀) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2733 | . . 3 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 2 | eqid 2733 | . . 3 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 3 | eqid 2733 | . . 3 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 4 | wrd0 14448 | . . . 4 ⊢ ∅ ∈ Word 𝐼 | |
| 5 | frmdmnd.m | . . . . 5 ⊢ 𝑀 = (freeMnd‘𝐼) | |
| 6 | 5, 1 | frmdbas 18762 | . . . 4 ⊢ (𝐼 ∈ V → (Base‘𝑀) = Word 𝐼) |
| 7 | 4, 6 | eleqtrrid 2840 | . . 3 ⊢ (𝐼 ∈ V → ∅ ∈ (Base‘𝑀)) |
| 8 | 5, 1, 3 | frmdadd 18765 | . . . . 5 ⊢ ((∅ ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (∅(+g‘𝑀)𝑥) = (∅ ++ 𝑥)) |
| 9 | 7, 8 | sylan 580 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (∅(+g‘𝑀)𝑥) = (∅ ++ 𝑥)) |
| 10 | 5, 1 | frmdelbas 18763 | . . . . . 6 ⊢ (𝑥 ∈ (Base‘𝑀) → 𝑥 ∈ Word 𝐼) |
| 11 | 10 | adantl 481 | . . . . 5 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → 𝑥 ∈ Word 𝐼) |
| 12 | ccatlid 14496 | . . . . 5 ⊢ (𝑥 ∈ Word 𝐼 → (∅ ++ 𝑥) = 𝑥) | |
| 13 | 11, 12 | syl 17 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (∅ ++ 𝑥) = 𝑥) |
| 14 | 9, 13 | eqtrd 2768 | . . 3 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (∅(+g‘𝑀)𝑥) = 𝑥) |
| 15 | 5, 1, 3 | frmdadd 18765 | . . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝑀) ∧ ∅ ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = (𝑥 ++ ∅)) |
| 16 | 15 | ancoms 458 | . . . . 5 ⊢ ((∅ ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = (𝑥 ++ ∅)) |
| 17 | 7, 16 | sylan 580 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = (𝑥 ++ ∅)) |
| 18 | ccatrid 14497 | . . . . 5 ⊢ (𝑥 ∈ Word 𝐼 → (𝑥 ++ ∅) = 𝑥) | |
| 19 | 11, 18 | syl 17 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥 ++ ∅) = 𝑥) |
| 20 | 17, 19 | eqtrd 2768 | . . 3 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = 𝑥) |
| 21 | 1, 2, 3, 7, 14, 20 | ismgmid2 18578 | . 2 ⊢ (𝐼 ∈ V → ∅ = (0g‘𝑀)) |
| 22 | 0g0 18574 | . . 3 ⊢ ∅ = (0g‘∅) | |
| 23 | fvprc 6820 | . . . . 5 ⊢ (¬ 𝐼 ∈ V → (freeMnd‘𝐼) = ∅) | |
| 24 | 5, 23 | eqtrid 2780 | . . . 4 ⊢ (¬ 𝐼 ∈ V → 𝑀 = ∅) |
| 25 | 24 | fveq2d 6832 | . . 3 ⊢ (¬ 𝐼 ∈ V → (0g‘𝑀) = (0g‘∅)) |
| 26 | 22, 25 | eqtr4id 2787 | . 2 ⊢ (¬ 𝐼 ∈ V → ∅ = (0g‘𝑀)) |
| 27 | 21, 26 | pm2.61i 182 | 1 ⊢ ∅ = (0g‘𝑀) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∧ wa 395 = wceq 1541 ∈ wcel 2113 Vcvv 3437 ∅c0 4282 ‘cfv 6486 (class class class)co 7352 Word cword 14422 ++ cconcat 14479 Basecbs 17122 +gcplusg 17163 0gc0g 17345 freeMndcfrmd 18757 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-cnex 11069 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-int 4898 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 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-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-1st 7927 df-2nd 7928 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-1o 8391 df-er 8628 df-map 8758 df-en 8876 df-dom 8877 df-sdom 8878 df-fin 8879 df-card 9839 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-nn 12133 df-2 12195 df-n0 12389 df-z 12476 df-uz 12739 df-fz 13410 df-fzo 13557 df-hash 14240 df-word 14423 df-concat 14480 df-struct 17060 df-slot 17095 df-ndx 17107 df-base 17123 df-plusg 17176 df-0g 17347 df-frmd 18759 |
| This theorem is referenced by: frmdsssubm 18771 frmdgsum 18772 frmdup1 18774 frgpmhm 19679 mrsub0 35581 elmrsubrn 35585 |
| Copyright terms: Public domain | W3C validator |