| 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 14752 | . . 3 ⊢ (𝜑 → 〈“𝐴”〉 = 〈“𝑁”〉) |
| 3 | s2eqd.2 | . . . 4 ⊢ (𝜑 → 𝐵 = 𝑂) | |
| 4 | 3 | s1eqd 14752 | . . 3 ⊢ (𝜑 → 〈“𝐵”〉 = 〈“𝑂”〉) |
| 5 | 2, 4 | oveq12d 7439 | . 2 ⊢ (𝜑 → (〈“𝐴”〉 ++ 〈“𝐵”〉) = (〈“𝑁”〉 ++ 〈“𝑂”〉)) |
| 6 | df-s2 15004 | . 2 ⊢ 〈“𝐴𝐵”〉 = (〈“𝐴”〉 ++ 〈“𝐵”〉) | |
| 7 | df-s2 15004 | . 2 ⊢ 〈“𝑁𝑂”〉 = (〈“𝑁”〉 ++ 〈“𝑂”〉) | |
| 8 | 5, 6, 7 | 3eqtr4g 2820 | 1 ⊢ (𝜑 → 〈“𝐴𝐵”〉 = 〈“𝑁𝑂”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 (class class class)co 7421 ++ cconcat 14719 〈“cs1 14746 〈“cs2 14997 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-iota 6494 df-fv 6547 df-ov 7424 df-s1 14747 df-s2 15004 |
| This theorem is used by: s3eqd 15020 swrds2m 15098 wrdl2exs2 15103 swrd2lsw 15111 efgi 19939 efgi0 19940 efgi1 19941 efgtf 19942 efgtval 19943 efgval2 19944 frgpuplem 19992 2clwwlk2clwwlklem 30953 wrdt2ind 33563 elrgspnsubrunlem1 33855 elrgspnsubrun 33857 rrx2plordisom 49930 |
| Copyright terms: Public domain | W3C validator |