| 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 2736 | . . 3 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 2 | eqid 2736 | . . 3 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 3 | eqid 2736 | . . 3 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 4 | wrd0 14462 | . . . 4 ⊢ ∅ ∈ Word 𝐼 | |
| 5 | frmdmnd.m | . . . . 5 ⊢ 𝑀 = (freeMnd‘𝐼) | |
| 6 | 5, 1 | frmdbas 18777 | . . . 4 ⊢ (𝐼 ∈ V → (Base‘𝑀) = Word 𝐼) |
| 7 | 4, 6 | eleqtrrid 2843 | . . 3 ⊢ (𝐼 ∈ V → ∅ ∈ (Base‘𝑀)) |
| 8 | 5, 1, 3 | frmdadd 18780 | . . . . 5 ⊢ ((∅ ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (∅(+g‘𝑀)𝑥) = (∅ ++ 𝑥)) |
| 9 | 7, 8 | sylan 580 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (∅(+g‘𝑀)𝑥) = (∅ ++ 𝑥)) |
| 10 | 5, 1 | frmdelbas 18778 | . . . . . 6 ⊢ (𝑥 ∈ (Base‘𝑀) → 𝑥 ∈ Word 𝐼) |
| 11 | 10 | adantl 481 | . . . . 5 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → 𝑥 ∈ Word 𝐼) |
| 12 | ccatlid 14510 | . . . . 5 ⊢ (𝑥 ∈ Word 𝐼 → (∅ ++ 𝑥) = 𝑥) | |
| 13 | 11, 12 | syl 17 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (∅ ++ 𝑥) = 𝑥) |
| 14 | 9, 13 | eqtrd 2771 | . . 3 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (∅(+g‘𝑀)𝑥) = 𝑥) |
| 15 | 5, 1, 3 | frmdadd 18780 | . . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝑀) ∧ ∅ ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = (𝑥 ++ ∅)) |
| 16 | 15 | ancoms 458 | . . . . 5 ⊢ ((∅ ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = (𝑥 ++ ∅)) |
| 17 | 7, 16 | sylan 580 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = (𝑥 ++ ∅)) |
| 18 | ccatrid 14511 | . . . . 5 ⊢ (𝑥 ∈ Word 𝐼 → (𝑥 ++ ∅) = 𝑥) | |
| 19 | 11, 18 | syl 17 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥 ++ ∅) = 𝑥) |
| 20 | 17, 19 | eqtrd 2771 | . . 3 ⊢ ((𝐼 ∈ V ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑥(+g‘𝑀)∅) = 𝑥) |
| 21 | 1, 2, 3, 7, 14, 20 | ismgmid2 18593 | . 2 ⊢ (𝐼 ∈ V → ∅ = (0g‘𝑀)) |
| 22 | 0g0 18589 | . . 3 ⊢ ∅ = (0g‘∅) | |
| 23 | fvprc 6826 | . . . . 5 ⊢ (¬ 𝐼 ∈ V → (freeMnd‘𝐼) = ∅) | |
| 24 | 5, 23 | eqtrid 2783 | . . . 4 ⊢ (¬ 𝐼 ∈ V → 𝑀 = ∅) |
| 25 | 24 | fveq2d 6838 | . . 3 ⊢ (¬ 𝐼 ∈ V → (0g‘𝑀) = (0g‘∅)) |
| 26 | 22, 25 | eqtr4id 2790 | . 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 3440 ∅c0 4285 ‘cfv 6492 (class class class)co 7358 Word cword 14436 ++ cconcat 14493 Basecbs 17136 +gcplusg 17177 0gc0g 17359 freeMndcfrmd 18772 |
| 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 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-card 9851 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-n0 12402 df-z 12489 df-uz 12752 df-fz 13424 df-fzo 13571 df-hash 14254 df-word 14437 df-concat 14494 df-struct 17074 df-slot 17109 df-ndx 17121 df-base 17137 df-plusg 17190 df-0g 17361 df-frmd 18774 |
| This theorem is referenced by: frmdsssubm 18786 frmdgsum 18787 frmdup1 18789 frgpmhm 19694 mrsub0 35710 elmrsubrn 35714 |
| Copyright terms: Public domain | W3C validator |