Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cats1co | 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 | ⊢ 𝑇 = (𝑆 ++ 〈“𝑋”〉) |
cats1cld.2 | ⊢ (𝜑 → 𝑆 ∈ Word 𝐴) |
cats1cld.3 | ⊢ (𝜑 → 𝑋 ∈ 𝐴) |
cats1co.4 | ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
cats1co.5 | ⊢ (𝜑 → (𝐹 ∘ 𝑆) = 𝑈) |
cats1co.6 | ⊢ 𝑉 = (𝑈 ++ 〈“(𝐹‘𝑋)”〉) |
Ref | Expression |
---|---|
cats1co | ⊢ (𝜑 → (𝐹 ∘ 𝑇) = 𝑉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cats1cld.2 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ Word 𝐴) | |
2 | cats1cld.3 | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐴) | |
3 | 2 | s1cld 13951 | . . . 4 ⊢ (𝜑 → 〈“𝑋”〉 ∈ Word 𝐴) |
4 | cats1co.4 | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) | |
5 | ccatco 14191 | . . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 〈“𝑋”〉 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ (𝑆 ++ 〈“𝑋”〉)) = ((𝐹 ∘ 𝑆) ++ (𝐹 ∘ 〈“𝑋”〉))) | |
6 | 1, 3, 4, 5 | syl3anc 1367 | . . 3 ⊢ (𝜑 → (𝐹 ∘ (𝑆 ++ 〈“𝑋”〉)) = ((𝐹 ∘ 𝑆) ++ (𝐹 ∘ 〈“𝑋”〉))) |
7 | cats1co.5 | . . . 4 ⊢ (𝜑 → (𝐹 ∘ 𝑆) = 𝑈) | |
8 | s1co 14189 | . . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ 〈“𝑋”〉) = 〈“(𝐹‘𝑋)”〉) | |
9 | 2, 4, 8 | syl2anc 586 | . . . 4 ⊢ (𝜑 → (𝐹 ∘ 〈“𝑋”〉) = 〈“(𝐹‘𝑋)”〉) |
10 | 7, 9 | oveq12d 7168 | . . 3 ⊢ (𝜑 → ((𝐹 ∘ 𝑆) ++ (𝐹 ∘ 〈“𝑋”〉)) = (𝑈 ++ 〈“(𝐹‘𝑋)”〉)) |
11 | 6, 10 | eqtrd 2856 | . 2 ⊢ (𝜑 → (𝐹 ∘ (𝑆 ++ 〈“𝑋”〉)) = (𝑈 ++ 〈“(𝐹‘𝑋)”〉)) |
12 | cats1cld.1 | . . 3 ⊢ 𝑇 = (𝑆 ++ 〈“𝑋”〉) | |
13 | 12 | coeq2i 5725 | . 2 ⊢ (𝐹 ∘ 𝑇) = (𝐹 ∘ (𝑆 ++ 〈“𝑋”〉)) |
14 | cats1co.6 | . 2 ⊢ 𝑉 = (𝑈 ++ 〈“(𝐹‘𝑋)”〉) | |
15 | 11, 13, 14 | 3eqtr4g 2881 | 1 ⊢ (𝜑 → (𝐹 ∘ 𝑇) = 𝑉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 ∘ ccom 5553 ⟶wf 6345 ‘cfv 6349 (class class class)co 7150 Word cword 13855 ++ cconcat 13916 〈“cs1 13943 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-n0 11892 df-z 11976 df-uz 12238 df-fz 12887 df-fzo 13028 df-hash 13685 df-word 13856 df-concat 13917 df-s1 13944 |
This theorem is referenced by: s2co 14276 s3co 14277 |
Copyright terms: Public domain | W3C validator |