Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > s4eqd | Structured version Visualization version GIF version |
Description: Equality theorem for a length 4 word. (Contributed by Mario Carneiro, 27-Feb-2016.) |
Ref | Expression |
---|---|
s2eqd.1 | ⊢ (𝜑 → 𝐴 = 𝑁) |
s2eqd.2 | ⊢ (𝜑 → 𝐵 = 𝑂) |
s3eqd.3 | ⊢ (𝜑 → 𝐶 = 𝑃) |
s4eqd.4 | ⊢ (𝜑 → 𝐷 = 𝑄) |
Ref | Expression |
---|---|
s4eqd | ⊢ (𝜑 → 〈“𝐴𝐵𝐶𝐷”〉 = 〈“𝑁𝑂𝑃𝑄”〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | s2eqd.1 | . . . 4 ⊢ (𝜑 → 𝐴 = 𝑁) | |
2 | s2eqd.2 | . . . 4 ⊢ (𝜑 → 𝐵 = 𝑂) | |
3 | s3eqd.3 | . . . 4 ⊢ (𝜑 → 𝐶 = 𝑃) | |
4 | 1, 2, 3 | s3eqd 14214 | . . 3 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉 = 〈“𝑁𝑂𝑃”〉) |
5 | s4eqd.4 | . . . 4 ⊢ (𝜑 → 𝐷 = 𝑄) | |
6 | 5 | s1eqd 13943 | . . 3 ⊢ (𝜑 → 〈“𝐷”〉 = 〈“𝑄”〉) |
7 | 4, 6 | oveq12d 7163 | . 2 ⊢ (𝜑 → (〈“𝐴𝐵𝐶”〉 ++ 〈“𝐷”〉) = (〈“𝑁𝑂𝑃”〉 ++ 〈“𝑄”〉)) |
8 | df-s4 14200 | . 2 ⊢ 〈“𝐴𝐵𝐶𝐷”〉 = (〈“𝐴𝐵𝐶”〉 ++ 〈“𝐷”〉) | |
9 | df-s4 14200 | . 2 ⊢ 〈“𝑁𝑂𝑃𝑄”〉 = (〈“𝑁𝑂𝑃”〉 ++ 〈“𝑄”〉) | |
10 | 7, 8, 9 | 3eqtr4g 2878 | 1 ⊢ (𝜑 → 〈“𝐴𝐵𝐶𝐷”〉 = 〈“𝑁𝑂𝑃𝑄”〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1528 (class class class)co 7145 ++ cconcat 13910 〈“cs1 13937 〈“cs3 14192 〈“cs4 14193 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-rex 3141 df-rab 3144 df-v 3494 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-iota 6307 df-fv 6356 df-ov 7148 df-s1 13938 df-s2 14198 df-s3 14199 df-s4 14200 |
This theorem is referenced by: s5eqd 14216 |
Copyright terms: Public domain | W3C validator |