| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cats1cat | Structured version Visualization version GIF version | ||
| Description: Closure of concatenation with a singleton word. (Contributed by Mario Carneiro, 26-Feb-2016.) |
| Ref | Expression |
|---|---|
| cats1cld.1 | ⊢ 𝑇 = (𝑆 ++ 〈“𝑋”〉) |
| cats1cat.2 | ⊢ 𝐴 ∈ Word V |
| cats1cat.3 | ⊢ 𝑆 ∈ Word V |
| cats1cat.4 | ⊢ 𝐶 = (𝐵 ++ 〈“𝑋”〉) |
| cats1cat.5 | ⊢ 𝐵 = (𝐴 ++ 𝑆) |
| Ref | Expression |
|---|---|
| cats1cat | ⊢ 𝐶 = (𝐴 ++ 𝑇) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cats1cat.5 | . . . 4 ⊢ 𝐵 = (𝐴 ++ 𝑆) | |
| 2 | 1 | oveq1i 7430 | . . 3 ⊢ (𝐵 ++ 〈“𝑋”〉) = ((𝐴 ++ 𝑆) ++ 〈“𝑋”〉) |
| 3 | cats1cat.2 | . . . 4 ⊢ 𝐴 ∈ Word V | |
| 4 | cats1cat.3 | . . . 4 ⊢ 𝑆 ∈ Word V | |
| 5 | s1cli 14755 | . . . 4 ⊢ 〈“𝑋”〉 ∈ Word V | |
| 6 | ccatass 14737 | . . . 4 ⊢ ((𝐴 ∈ Word V ∧ 𝑆 ∈ Word V ∧ 〈“𝑋”〉 ∈ Word V) → ((𝐴 ++ 𝑆) ++ 〈“𝑋”〉) = (𝐴 ++ (𝑆 ++ 〈“𝑋”〉))) | |
| 7 | 3, 4, 5, 6 | mp3an 1490 | . . 3 ⊢ ((𝐴 ++ 𝑆) ++ 〈“𝑋”〉) = (𝐴 ++ (𝑆 ++ 〈“𝑋”〉)) |
| 8 | 2, 7 | eqtri 2783 | . 2 ⊢ (𝐵 ++ 〈“𝑋”〉) = (𝐴 ++ (𝑆 ++ 〈“𝑋”〉)) |
| 9 | cats1cat.4 | . 2 ⊢ 𝐶 = (𝐵 ++ 〈“𝑋”〉) | |
| 10 | cats1cld.1 | . . 3 ⊢ 𝑇 = (𝑆 ++ 〈“𝑋”〉) | |
| 11 | 10 | oveq2i 7431 | . 2 ⊢ (𝐴 ++ 𝑇) = (𝐴 ++ (𝑆 ++ 〈“𝑋”〉)) |
| 12 | 8, 9, 11 | 3eqtr4i 2793 | 1 ⊢ 𝐶 = (𝐴 ++ 𝑇) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2144 Vcvv 3450 (class class class)co 7420 Word cword 14661 ++ cconcat 14718 〈“cs1 14745 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-card 10023 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-nn 12339 df-n0 12610 df-z 12697 df-uz 12969 df-fz 13643 df-fzo 13792 df-hash 14478 df-word 14662 df-concat 14719 df-s1 14746 |
| This theorem is used by: s1s2 15079 s1s3 15080 s1s4 15081 s1s5 15082 s1s6 15083 s1s7 15084 s2s2 15085 s4s2 15086 s4s3 15087 s4s4 15088 |
| Copyright terms: Public domain | W3C validator |