| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ofs2 | Structured version Visualization version GIF version | ||
| Description: Letterwise operations on a double letter word. (Contributed by Thierry Arnoux, 7-Oct-2018.) |
| Ref | Expression |
|---|---|
| ofs2 | ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (〈“𝐴𝐵”〉 ∘f 𝑅〈“𝐶𝐷”〉) = 〈“(𝐴𝑅𝐶)(𝐵𝑅𝐷)”〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-s2 15010 | . . . 4 ⊢ 〈“𝐴𝐵”〉 = (〈“𝐴”〉 ++ 〈“𝐵”〉) | |
| 2 | df-s2 15010 | . . . 4 ⊢ 〈“𝐶𝐷”〉 = (〈“𝐶”〉 ++ 〈“𝐷”〉) | |
| 3 | 1, 2 | oveq12i 7439 | . . 3 ⊢ (〈“𝐴𝐵”〉 ∘f 𝑅〈“𝐶𝐷”〉) = ((〈“𝐴”〉 ++ 〈“𝐵”〉) ∘f 𝑅(〈“𝐶”〉 ++ 〈“𝐷”〉)) |
| 4 | simpll 779 | . . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 𝐴 ∈ 𝑆) | |
| 5 | 4 | s1cld 14760 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 〈“𝐴”〉 ∈ Word 𝑆) |
| 6 | simplr 781 | . . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 𝐵 ∈ 𝑆) | |
| 7 | 6 | s1cld 14760 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 〈“𝐵”〉 ∈ Word 𝑆) |
| 8 | simprl 783 | . . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 𝐶 ∈ 𝑇) | |
| 9 | 8 | s1cld 14760 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 〈“𝐶”〉 ∈ Word 𝑇) |
| 10 | simprr 785 | . . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 𝐷 ∈ 𝑇) | |
| 11 | 10 | s1cld 14760 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 〈“𝐷”〉 ∈ Word 𝑇) |
| 12 | s1len 14763 | . . . . . 6 ⊢ (♯‘〈“𝐴”〉) = 1 | |
| 13 | s1len 14763 | . . . . . 6 ⊢ (♯‘〈“𝐶”〉) = 1 | |
| 14 | 12, 13 | eqtr4i 2789 | . . . . 5 ⊢ (♯‘〈“𝐴”〉) = (♯‘〈“𝐶”〉) |
| 15 | 14 | a1i 11 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (♯‘〈“𝐴”〉) = (♯‘〈“𝐶”〉)) |
| 16 | s1len 14763 | . . . . . 6 ⊢ (♯‘〈“𝐵”〉) = 1 | |
| 17 | s1len 14763 | . . . . . 6 ⊢ (♯‘〈“𝐷”〉) = 1 | |
| 18 | 16, 17 | eqtr4i 2789 | . . . . 5 ⊢ (♯‘〈“𝐵”〉) = (♯‘〈“𝐷”〉) |
| 19 | 18 | a1i 11 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (♯‘〈“𝐵”〉) = (♯‘〈“𝐷”〉)) |
| 20 | 5, 7, 9, 11, 15, 19 | ofccat 15134 | . . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → ((〈“𝐴”〉 ++ 〈“𝐵”〉) ∘f 𝑅(〈“𝐶”〉 ++ 〈“𝐷”〉)) = ((〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) ++ (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉))) |
| 21 | 3, 20 | eqtrid 2810 | . 2 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (〈“𝐴𝐵”〉 ∘f 𝑅〈“𝐶𝐷”〉) = ((〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) ++ (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉))) |
| 22 | ofs1 15135 | . . . . 5 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) → (〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) = 〈“(𝐴𝑅𝐶)”〉) | |
| 23 | 4, 8, 22 | syl2anc 596 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) = 〈“(𝐴𝑅𝐶)”〉) |
| 24 | ofs1 15135 | . . . . 5 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐷 ∈ 𝑇) → (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉) = 〈“(𝐵𝑅𝐷)”〉) | |
| 25 | 6, 10, 24 | syl2anc 596 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉) = 〈“(𝐵𝑅𝐷)”〉) |
| 26 | 23, 25 | oveq12d 7445 | . . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → ((〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) ++ (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉)) = (〈“(𝐴𝑅𝐶)”〉 ++ 〈“(𝐵𝑅𝐷)”〉)) |
| 27 | df-s2 15010 | . . 3 ⊢ 〈“(𝐴𝑅𝐶)(𝐵𝑅𝐷)”〉 = (〈“(𝐴𝑅𝐶)”〉 ++ 〈“(𝐵𝑅𝐷)”〉) | |
| 28 | 26, 27 | eqtr4di 2816 | . 2 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → ((〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) ++ (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉)) = 〈“(𝐴𝑅𝐶)(𝐵𝑅𝐷)”〉) |
| 29 | 21, 28 | eqtrd 2798 | 1 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (〈“𝐴𝐵”〉 ∘f 𝑅〈“𝐶𝐷”〉) = 〈“(𝐴𝑅𝐶)(𝐵𝑅𝐷)”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 ‘cfv 6546 (class class class)co 7427 ∘f cof 7698 1c1 11211 ♯chash 14484 ++ cconcat 14725 〈“cs1 14752 〈“cs2 15003 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 |
| 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 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-int 4910 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-of 7700 df-om 7885 df-1st 8008 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-1o 8487 df-er 8728 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-card 10030 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-nn 12346 df-n0 12617 df-z 12704 df-uz 12976 df-fz 13650 df-fzo 13799 df-hash 14485 df-word 14669 df-concat 14726 df-s1 14753 df-s2 15010 |
| This theorem is used by: amgmw2d 51203 |
| Copyright terms: Public domain | W3C validator |