Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > s3eqs2s1eq | Structured version Visualization version GIF version |
Description: Two length 3 words are equal iff the corresponding length 2 words and singleton words consisting of their symbols are equal. (Contributed by AV, 4-Jan-2022.) |
Ref | Expression |
---|---|
s3eqs2s1eq | ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ (𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉 ∧ 𝐹 ∈ 𝑉)) → (〈“𝐴𝐵𝐶”〉 = 〈“𝐷𝐸𝐹”〉 ↔ (〈“𝐴𝐵”〉 = 〈“𝐷𝐸”〉 ∧ 〈“𝐶”〉 = 〈“𝐹”〉))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-s3 14210 | . . . 4 ⊢ 〈“𝐴𝐵𝐶”〉 = (〈“𝐴𝐵”〉 ++ 〈“𝐶”〉) | |
2 | 1 | a1i 11 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ (𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉 ∧ 𝐹 ∈ 𝑉)) → 〈“𝐴𝐵𝐶”〉 = (〈“𝐴𝐵”〉 ++ 〈“𝐶”〉)) |
3 | df-s3 14210 | . . . 4 ⊢ 〈“𝐷𝐸𝐹”〉 = (〈“𝐷𝐸”〉 ++ 〈“𝐹”〉) | |
4 | 3 | a1i 11 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ (𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉 ∧ 𝐹 ∈ 𝑉)) → 〈“𝐷𝐸𝐹”〉 = (〈“𝐷𝐸”〉 ++ 〈“𝐹”〉)) |
5 | 2, 4 | eqeq12d 2837 | . 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ (𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉 ∧ 𝐹 ∈ 𝑉)) → (〈“𝐴𝐵𝐶”〉 = 〈“𝐷𝐸𝐹”〉 ↔ (〈“𝐴𝐵”〉 ++ 〈“𝐶”〉) = (〈“𝐷𝐸”〉 ++ 〈“𝐹”〉))) |
6 | s2cl 14239 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 〈“𝐴𝐵”〉 ∈ Word 𝑉) | |
7 | s1cl 13955 | . . . . . 6 ⊢ (𝐶 ∈ 𝑉 → 〈“𝐶”〉 ∈ Word 𝑉) | |
8 | 6, 7 | anim12i 614 | . . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐶 ∈ 𝑉) → (〈“𝐴𝐵”〉 ∈ Word 𝑉 ∧ 〈“𝐶”〉 ∈ Word 𝑉)) |
9 | 8 | 3impa 1106 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (〈“𝐴𝐵”〉 ∈ Word 𝑉 ∧ 〈“𝐶”〉 ∈ Word 𝑉)) |
10 | 9 | adantr 483 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ (𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉 ∧ 𝐹 ∈ 𝑉)) → (〈“𝐴𝐵”〉 ∈ Word 𝑉 ∧ 〈“𝐶”〉 ∈ Word 𝑉)) |
11 | s2cl 14239 | . . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉) → 〈“𝐷𝐸”〉 ∈ Word 𝑉) | |
12 | s1cl 13955 | . . . . . 6 ⊢ (𝐹 ∈ 𝑉 → 〈“𝐹”〉 ∈ Word 𝑉) | |
13 | 11, 12 | anim12i 614 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉) ∧ 𝐹 ∈ 𝑉) → (〈“𝐷𝐸”〉 ∈ Word 𝑉 ∧ 〈“𝐹”〉 ∈ Word 𝑉)) |
14 | 13 | 3impa 1106 | . . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉 ∧ 𝐹 ∈ 𝑉) → (〈“𝐷𝐸”〉 ∈ Word 𝑉 ∧ 〈“𝐹”〉 ∈ Word 𝑉)) |
15 | 14 | adantl 484 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ (𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉 ∧ 𝐹 ∈ 𝑉)) → (〈“𝐷𝐸”〉 ∈ Word 𝑉 ∧ 〈“𝐹”〉 ∈ Word 𝑉)) |
16 | s2len 14250 | . . . . 5 ⊢ (♯‘〈“𝐴𝐵”〉) = 2 | |
17 | s2len 14250 | . . . . 5 ⊢ (♯‘〈“𝐷𝐸”〉) = 2 | |
18 | 16, 17 | eqtr4i 2847 | . . . 4 ⊢ (♯‘〈“𝐴𝐵”〉) = (♯‘〈“𝐷𝐸”〉) |
19 | 18 | a1i 11 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ (𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉 ∧ 𝐹 ∈ 𝑉)) → (♯‘〈“𝐴𝐵”〉) = (♯‘〈“𝐷𝐸”〉)) |
20 | ccatopth 14077 | . . 3 ⊢ (((〈“𝐴𝐵”〉 ∈ Word 𝑉 ∧ 〈“𝐶”〉 ∈ Word 𝑉) ∧ (〈“𝐷𝐸”〉 ∈ Word 𝑉 ∧ 〈“𝐹”〉 ∈ Word 𝑉) ∧ (♯‘〈“𝐴𝐵”〉) = (♯‘〈“𝐷𝐸”〉)) → ((〈“𝐴𝐵”〉 ++ 〈“𝐶”〉) = (〈“𝐷𝐸”〉 ++ 〈“𝐹”〉) ↔ (〈“𝐴𝐵”〉 = 〈“𝐷𝐸”〉 ∧ 〈“𝐶”〉 = 〈“𝐹”〉))) | |
21 | 10, 15, 19, 20 | syl3anc 1367 | . 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ (𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉 ∧ 𝐹 ∈ 𝑉)) → ((〈“𝐴𝐵”〉 ++ 〈“𝐶”〉) = (〈“𝐷𝐸”〉 ++ 〈“𝐹”〉) ↔ (〈“𝐴𝐵”〉 = 〈“𝐷𝐸”〉 ∧ 〈“𝐶”〉 = 〈“𝐹”〉))) |
22 | 5, 21 | bitrd 281 | 1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ (𝐷 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉 ∧ 𝐹 ∈ 𝑉)) → (〈“𝐴𝐵𝐶”〉 = 〈“𝐷𝐸𝐹”〉 ↔ (〈“𝐴𝐵”〉 = 〈“𝐷𝐸”〉 ∧ 〈“𝐶”〉 = 〈“𝐹”〉))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ‘cfv 6354 (class class class)co 7155 2c2 11691 ♯chash 13689 Word cword 13860 ++ cconcat 13921 〈“cs1 13948 〈“cs2 14202 〈“cs3 14203 |
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 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
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 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-1o 8101 df-oadd 8105 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-card 9367 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-2 11699 df-n0 11897 df-z 11981 df-uz 12243 df-fz 12892 df-fzo 13033 df-hash 13690 df-word 13861 df-concat 13922 df-s1 13949 df-substr 14002 df-pfx 14032 df-s2 14209 df-s3 14210 |
This theorem is referenced by: s3eq3seq 14300 |
Copyright terms: Public domain | W3C validator |