| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > s2eqd | Structured version Visualization version GIF version | ||
| Description: Equality theorem for a doubleton word. (Contributed by Mario Carneiro, 27-Feb-2016.) |
| Ref | Expression |
|---|---|
| s2eqd.1 | ⊢ (𝜑 → 𝐴 = 𝑁) |
| s2eqd.2 | ⊢ (𝜑 → 𝐵 = 𝑂) |
| Ref | Expression |
|---|---|
| s2eqd | ⊢ (𝜑 → 〈“𝐴𝐵”〉 = 〈“𝑁𝑂”〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | s2eqd.1 | . . . 4 ⊢ (𝜑 → 𝐴 = 𝑁) | |
| 2 | 1 | s1eqd 14672 | . . 3 ⊢ (𝜑 → 〈“𝐴”〉 = 〈“𝑁”〉) |
| 3 | s2eqd.2 | . . . 4 ⊢ (𝜑 → 𝐵 = 𝑂) | |
| 4 | 3 | s1eqd 14672 | . . 3 ⊢ (𝜑 → 〈“𝐵”〉 = 〈“𝑂”〉) |
| 5 | 2, 4 | oveq12d 7435 | . 2 ⊢ (𝜑 → (〈“𝐴”〉 ++ 〈“𝐵”〉) = (〈“𝑁”〉 ++ 〈“𝑂”〉)) |
| 6 | df-s2 14923 | . 2 ⊢ 〈“𝐴𝐵”〉 = (〈“𝐴”〉 ++ 〈“𝐵”〉) | |
| 7 | df-s2 14923 | . 2 ⊢ 〈“𝑁𝑂”〉 = (〈“𝑁”〉 ++ 〈“𝑂”〉) | |
| 8 | 5, 6, 7 | 3eqtr4g 2822 | 1 ⊢ (𝜑 → 〈“𝐴𝐵”〉 = 〈“𝑁𝑂”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 (class class class)co 7417 ++ cconcat 14639 〈“cs1 14666 〈“cs2 14916 |
| 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-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-iota 6493 df-fv 6545 df-ov 7420 df-s1 14667 df-s2 14923 |
| This theorem is used by: s3eqd 14939 swrds2m 15016 wrdl2exs2 15021 swrd2lsw 15029 efgi 19852 efgi0 19853 efgi1 19854 efgtf 19855 efgtval 19856 efgval2 19857 frgpuplem 19905 2clwwlk2clwwlklem 30834 wrdt2ind 33403 elrgspnsubrunlem1 33695 elrgspnsubrun 33697 |
| Copyright terms: Public domain | W3C validator |