| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frmdval | Structured version Visualization version GIF version | ||
| Description: Value of the free monoid construction. (Contributed by Mario Carneiro, 27-Sep-2015.) |
| Ref | Expression |
|---|---|
| frmdval.m | ⊢ 𝑀 = (freeMnd‘𝐼) |
| frmdval.b | ⊢ (𝐼 ∈ 𝑉 → 𝐵 = Word 𝐼) |
| frmdval.p | ⊢ + = ( ++ ↾ (𝐵 × 𝐵)) |
| Ref | Expression |
|---|---|
| frmdval | ⊢ (𝐼 ∈ 𝑉 → 𝑀 = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frmdval.m | . 2 ⊢ 𝑀 = (freeMnd‘𝐼) | |
| 2 | df-frmd 18907 | . . 3 ⊢ freeMnd = (𝑖 ∈ V ↦ {〈(Base‘ndx), Word 𝑖〉, 〈(+g‘ndx), ( ++ ↾ (Word 𝑖 × Word 𝑖))〉}) | |
| 3 | wrdeq 14572 | . . . . . 6 ⊢ (𝑖 = 𝐼 → Word 𝑖 = Word 𝐼) | |
| 4 | frmdval.b | . . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → 𝐵 = Word 𝐼) | |
| 5 | 4 | eqcomd 2775 | . . . . . 6 ⊢ (𝐼 ∈ 𝑉 → Word 𝐼 = 𝐵) |
| 6 | 3, 5 | sylan9eqr 2826 | . . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → Word 𝑖 = 𝐵) |
| 7 | 6 | opeq2d 4849 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → 〈(Base‘ndx), Word 𝑖〉 = 〈(Base‘ndx), 𝐵〉) |
| 8 | 6 | sqxpeqd 5694 | . . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → (Word 𝑖 × Word 𝑖) = (𝐵 × 𝐵)) |
| 9 | 8 | reseq2d 5979 | . . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → ( ++ ↾ (Word 𝑖 × Word 𝑖)) = ( ++ ↾ (𝐵 × 𝐵))) |
| 10 | frmdval.p | . . . . . 6 ⊢ + = ( ++ ↾ (𝐵 × 𝐵)) | |
| 11 | 9, 10 | eqtr4di 2822 | . . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → ( ++ ↾ (Word 𝑖 × Word 𝑖)) = + ) |
| 12 | 11 | opeq2d 4849 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → 〈(+g‘ndx), ( ++ ↾ (Word 𝑖 × Word 𝑖))〉 = 〈(+g‘ndx), + 〉) |
| 13 | 7, 12 | preq12d 4712 | . . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → {〈(Base‘ndx), Word 𝑖〉, 〈(+g‘ndx), ( ++ ↾ (Word 𝑖 × Word 𝑖))〉} = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉}) |
| 14 | elex 3484 | . . 3 ⊢ (𝐼 ∈ 𝑉 → 𝐼 ∈ V) | |
| 15 | prex 5410 | . . . 4 ⊢ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉} ∈ V | |
| 16 | 15 | a1i 11 | . . 3 ⊢ (𝐼 ∈ 𝑉 → {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉} ∈ V) |
| 17 | 2, 13, 14, 16 | fvmptd2 6999 | . 2 ⊢ (𝐼 ∈ 𝑉 → (freeMnd‘𝐼) = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉}) |
| 18 | 1, 17 | eqtrid 2816 | 1 ⊢ (𝐼 ∈ 𝑉 → 𝑀 = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 Vcvv 3463 {cpr 4596 〈cop 4600 × cxp 5660 ↾ cres 5664 ‘cfv 6537 Word cword 14549 ++ cconcat 14606 ndxcnx 17252 Basecbs 17268 +gcplusg 17309 freeMndcfrmd 18905 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-n0 12504 df-z 12591 df-uz 12862 df-fz 13535 df-fzo 13682 df-hash 14366 df-word 14550 df-frmd 18907 |
| This theorem is referenced by: frmdbas 18910 frmdplusg 18912 |
| Copyright terms: Public domain | W3C validator |