![]() |
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 14811 | . . 3 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩ = ⟨“𝑁𝑂𝑃”⟩) |
5 | s4eqd.4 | . . . 4 ⊢ (𝜑 → 𝐷 = 𝑄) | |
6 | 5 | s1eqd 14547 | . . 3 ⊢ (𝜑 → ⟨“𝐷”⟩ = ⟨“𝑄”⟩) |
7 | 4, 6 | oveq12d 7423 | . 2 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩ ++ ⟨“𝐷”⟩) = (⟨“𝑁𝑂𝑃”⟩ ++ ⟨“𝑄”⟩)) |
8 | df-s4 14797 | . 2 ⊢ ⟨“𝐴𝐵𝐶𝐷”⟩ = (⟨“𝐴𝐵𝐶”⟩ ++ ⟨“𝐷”⟩) | |
9 | df-s4 14797 | . 2 ⊢ ⟨“𝑁𝑂𝑃𝑄”⟩ = (⟨“𝑁𝑂𝑃”⟩ ++ ⟨“𝑄”⟩) | |
10 | 7, 8, 9 | 3eqtr4g 2797 | 1 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶𝐷”⟩ = ⟨“𝑁𝑂𝑃𝑄”⟩) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 (class class class)co 7405 ++ cconcat 14516 ⟨“cs1 14541 ⟨“cs3 14789 ⟨“cs4 14790 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-rab 3433 df-v 3476 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-br 5148 df-iota 6492 df-fv 6548 df-ov 7408 df-s1 14542 df-s2 14795 df-s3 14796 df-s4 14797 |
This theorem is referenced by: s5eqd 14813 |
Copyright terms: Public domain | W3C validator |