| 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 2737 | . . 3 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 2 | eqid 2737 | . . 3 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 3 | eqid 2737 | . . 3 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 4 | wrd0 14474 | . . . 4 ⊢ ∅ ∈ Word 𝐼 | |
| 5 | frmdmnd.m | . . . . 5 ⊢ 𝑀 = (freeMnd‘𝐼) | |
| 6 | 5, 1 | frmdbas 18789 | . . . 4 ⊢ (𝐼 ∈ V → (Base‘𝑀) = Word 𝐼) |
| 7 | 4, 6 | eleqtrrid 2844 | . . 3 ⊢ (𝐼 ∈ V → ∅ ∈ (Base‘𝑀)) |
| 8 | 5, 1, 3 | frmdadd 18792 | . . . . 5 ⊢ ((∅ ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (∅(+g‘𝑀)𝑥) = (∅ ++ 𝑥)) |
| 9 | 7, 8 | sylan 581 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (∅(+g‘𝑀)𝑥) = (∅ ++ 𝑥)) |
| 10 | 5, 1 | frmdelbas 18790 | . . . . . 6 ⊢ (𝑥 ∈ (Base‘𝑀) → 𝑥 ∈ Word 𝐼) |
| 11 | 10 | adantl 481 | . . . . 5 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → 𝑥 ∈ Word 𝐼) |
| 12 | ccatlid 14522 | . . . . 5 ⊢ (𝑥 ∈ Word 𝐼 → (∅ ++ 𝑥) = 𝑥) | |
| 13 | 11, 12 | syl 17 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (∅ ++ 𝑥) = 𝑥) |
| 14 | 9, 13 | eqtrd 2772 | . . 3 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (∅(+g‘𝑀)𝑥) = 𝑥) |
| 15 | 5, 1, 3 | frmdadd 18792 | . . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝑀) ∧ ∅ ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = (𝑥 ++ ∅)) |
| 16 | 15 | ancoms 458 | . . . . 5 ⊢ ((∅ ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = (𝑥 ++ ∅)) |
| 17 | 7, 16 | sylan 581 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = (𝑥 ++ ∅)) |
| 18 | ccatrid 14523 | . . . . 5 ⊢ (𝑥 ∈ Word 𝐼 → (𝑥 ++ ∅) = 𝑥) | |
| 19 | 11, 18 | syl 17 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥 ++ ∅) = 𝑥) |
| 20 | 17, 19 | eqtrd 2772 | . . 3 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = 𝑥) |
| 21 | 1, 2, 3, 7, 14, 20 | ismgmid2 18605 | . 2 ⊢ (𝐼 ∈ V → ∅ = (0g‘𝑀)) |
| 22 | 0g0 18601 | . . 3 ⊢ ∅ = (0g‘∅) | |
| 23 | fvprc 6834 | . . . . 5 ⊢ (¬ 𝐼 ∈ V → (freeMnd‘𝐼) = ∅) | |
| 24 | 5, 23 | eqtrid 2784 | . . . 4 ⊢ (¬ 𝐼 ∈ V → 𝑀 = ∅) |
| 25 | 24 | fveq2d 6846 | . . 3 ⊢ (¬ 𝐼 ∈ V → (0g‘𝑀) = (0g‘∅)) |
| 26 | 22, 25 | eqtr4id 2791 | . 2 ⊢ (¬ 𝐼 ∈ V → ∅ = (0g‘𝑀)) |
| 27 | 21, 26 | pm2.61i 182 | 1 ⊢ ∅ = (0g‘𝑀) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ∅c0 4287 ‘cfv 6500 (class class class)co 7368 Word cword 14448 ++ cconcat 14505 Basecbs 17148 +gcplusg 17189 0gc0g 17371 freeMndcfrmd 18784 |
| 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-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 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-nel 3038 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-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 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-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-er 8645 df-map 8777 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-n0 12414 df-z 12501 df-uz 12764 df-fz 13436 df-fzo 13583 df-hash 14266 df-word 14449 df-concat 14506 df-struct 17086 df-slot 17121 df-ndx 17133 df-base 17149 df-plusg 17202 df-0g 17373 df-frmd 18786 |
| This theorem is referenced by: frmdsssubm 18798 frmdgsum 18799 frmdup1 18801 frgpmhm 19706 mrsub0 35732 elmrsubrn 35736 |
| Copyright terms: Public domain | W3C validator |