| 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 14999 | . . . 4 ⊢ 〈“𝐴𝐵”〉 = (〈“𝐴”〉 ++ 〈“𝐵”〉) | |
| 2 | df-s2 14999 | . . . 4 ⊢ 〈“𝐶𝐷”〉 = (〈“𝐶”〉 ++ 〈“𝐷”〉) | |
| 3 | 1, 2 | oveq12i 7432 | . . 3 ⊢ (〈“𝐴𝐵”〉 ∘f 𝑅〈“𝐶𝐷”〉) = ((〈“𝐴”〉 ++ 〈“𝐵”〉) ∘f 𝑅(〈“𝐶”〉 ++ 〈“𝐷”〉)) |
| 4 | simpll 779 | . . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 𝐴 ∈ 𝑆) | |
| 5 | 4 | s1cld 14750 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 〈“𝐴”〉 ∈ Word 𝑆) |
| 6 | simplr 781 | . . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 𝐵 ∈ 𝑆) | |
| 7 | 6 | s1cld 14750 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 〈“𝐵”〉 ∈ Word 𝑆) |
| 8 | simprl 783 | . . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 𝐶 ∈ 𝑇) | |
| 9 | 8 | s1cld 14750 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 〈“𝐶”〉 ∈ Word 𝑇) |
| 10 | simprr 785 | . . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 𝐷 ∈ 𝑇) | |
| 11 | 10 | s1cld 14750 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → 〈“𝐷”〉 ∈ Word 𝑇) |
| 12 | s1len 14753 | . . . . . 6 ⊢ (♯‘〈“𝐴”〉) = 1 | |
| 13 | s1len 14753 | . . . . . 6 ⊢ (♯‘〈“𝐶”〉) = 1 | |
| 14 | 12, 13 | eqtr4i 2787 | . . . . 5 ⊢ (♯‘〈“𝐴”〉) = (♯‘〈“𝐶”〉) |
| 15 | 14 | a1i 11 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (♯‘〈“𝐴”〉) = (♯‘〈“𝐶”〉)) |
| 16 | s1len 14753 | . . . . . 6 ⊢ (♯‘〈“𝐵”〉) = 1 | |
| 17 | s1len 14753 | . . . . . 6 ⊢ (♯‘〈“𝐷”〉) = 1 | |
| 18 | 16, 17 | eqtr4i 2787 | . . . . 5 ⊢ (♯‘〈“𝐵”〉) = (♯‘〈“𝐷”〉) |
| 19 | 18 | a1i 11 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (♯‘〈“𝐵”〉) = (♯‘〈“𝐷”〉)) |
| 20 | 5, 7, 9, 11, 15, 19 | ofccat 15122 | . . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → ((〈“𝐴”〉 ++ 〈“𝐵”〉) ∘f 𝑅(〈“𝐶”〉 ++ 〈“𝐷”〉)) = ((〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) ++ (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉))) |
| 21 | 3, 20 | eqtrid 2808 | . 2 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (〈“𝐴𝐵”〉 ∘f 𝑅〈“𝐶𝐷”〉) = ((〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) ++ (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉))) |
| 22 | ofs1 15123 | . . . . 5 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) → (〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) = 〈“(𝐴𝑅𝐶)”〉) | |
| 23 | 4, 8, 22 | syl2anc 596 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) = 〈“(𝐴𝑅𝐶)”〉) |
| 24 | ofs1 15123 | . . . . 5 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐷 ∈ 𝑇) → (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉) = 〈“(𝐵𝑅𝐷)”〉) | |
| 25 | 6, 10, 24 | syl2anc 596 | . . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉) = 〈“(𝐵𝑅𝐷)”〉) |
| 26 | 23, 25 | oveq12d 7438 | . . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → ((〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) ++ (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉)) = (〈“(𝐴𝑅𝐶)”〉 ++ 〈“(𝐵𝑅𝐷)”〉)) |
| 27 | df-s2 14999 | . . 3 ⊢ 〈“(𝐴𝑅𝐶)(𝐵𝑅𝐷)”〉 = (〈“(𝐴𝑅𝐶)”〉 ++ 〈“(𝐵𝑅𝐷)”〉) | |
| 28 | 26, 27 | eqtr4di 2814 | . 2 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → ((〈“𝐴”〉 ∘f 𝑅〈“𝐶”〉) ++ (〈“𝐵”〉 ∘f 𝑅〈“𝐷”〉)) = 〈“(𝐴𝑅𝐶)(𝐵𝑅𝐷)”〉) |
| 29 | 21, 28 | eqtrd 2796 | 1 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇)) → (〈“𝐴𝐵”〉 ∘f 𝑅〈“𝐶𝐷”〉) = 〈“(𝐴𝑅𝐶)(𝐵𝑅𝐷)”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6538 (class class class)co 7420 ∘f cof 7691 1c1 11201 ♯chash 14474 ++ cconcat 14715 〈“cs1 14742 〈“cs2 14992 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 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-of 7693 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-n0 12607 df-z 12694 df-uz 12966 df-fz 13640 df-fzo 13789 df-hash 14475 df-word 14659 df-concat 14716 df-s1 14743 df-s2 14999 |
| This theorem is used by: amgmw2d 50988 |
| Copyright terms: Public domain | W3C validator |