| 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 18862 | . . 3 ⊢ freeMnd = (𝑖 ∈ V ↦ {〈(Base‘ndx), Word 𝑖〉, 〈(+g‘ndx), ( ++ ↾ (Word 𝑖 × Word 𝑖))〉}) | |
| 3 | wrdeq 14574 | . . . . . 6 ⊢ (𝑖 = 𝐼 → Word 𝑖 = Word 𝐼) | |
| 4 | frmdval.b | . . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → 𝐵 = Word 𝐼) | |
| 5 | 4 | eqcomd 2743 | . . . . . 6 ⊢ (𝐼 ∈ 𝑉 → Word 𝐼 = 𝐵) |
| 6 | 3, 5 | sylan9eqr 2799 | . . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → Word 𝑖 = 𝐵) |
| 7 | 6 | opeq2d 4880 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → 〈(Base‘ndx), Word 𝑖〉 = 〈(Base‘ndx), 𝐵〉) |
| 8 | 6 | sqxpeqd 5717 | . . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → (Word 𝑖 × Word 𝑖) = (𝐵 × 𝐵)) |
| 9 | 8 | reseq2d 5997 | . . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → ( ++ ↾ (Word 𝑖 × Word 𝑖)) = ( ++ ↾ (𝐵 × 𝐵))) |
| 10 | frmdval.p | . . . . . 6 ⊢ + = ( ++ ↾ (𝐵 × 𝐵)) | |
| 11 | 9, 10 | eqtr4di 2795 | . . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → ( ++ ↾ (Word 𝑖 × Word 𝑖)) = + ) |
| 12 | 11 | opeq2d 4880 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → 〈(+g‘ndx), ( ++ ↾ (Word 𝑖 × Word 𝑖))〉 = 〈(+g‘ndx), + 〉) |
| 13 | 7, 12 | preq12d 4741 | . . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑖 = 𝐼) → {〈(Base‘ndx), Word 𝑖〉, 〈(+g‘ndx), ( ++ ↾ (Word 𝑖 × Word 𝑖))〉} = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉}) |
| 14 | elex 3501 | . . 3 ⊢ (𝐼 ∈ 𝑉 → 𝐼 ∈ V) | |
| 15 | prex 5437 | . . . 4 ⊢ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉} ∈ V | |
| 16 | 15 | a1i 11 | . . 3 ⊢ (𝐼 ∈ 𝑉 → {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉} ∈ V) |
| 17 | 2, 13, 14, 16 | fvmptd2 7024 | . 2 ⊢ (𝐼 ∈ 𝑉 → (freeMnd‘𝐼) = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉}) |
| 18 | 1, 17 | eqtrid 2789 | 1 ⊢ (𝐼 ∈ 𝑉 → 𝑀 = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 Vcvv 3480 {cpr 4628 〈cop 4632 × cxp 5683 ↾ cres 5687 ‘cfv 6561 Word cword 14552 ++ cconcat 14608 ndxcnx 17230 Basecbs 17247 +gcplusg 17297 freeMndcfrmd 18860 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-int 4947 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-card 9979 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-n0 12527 df-z 12614 df-uz 12879 df-fz 13548 df-fzo 13695 df-hash 14370 df-word 14553 df-frmd 18862 |
| This theorem is referenced by: frmdbas 18865 frmdplusg 18867 |
| Copyright terms: Public domain | W3C validator |