MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  s4eqd Structured version   Visualization version   GIF version

Theorem s4eqd 14838
Description: Equality theorem for a length 4 word. (Contributed by Mario Carneiro, 27-Feb-2016.)
Hypotheses
Ref Expression
s2eqd.1 (𝜑𝐴 = 𝑁)
s2eqd.2 (𝜑𝐵 = 𝑂)
s3eqd.3 (𝜑𝐶 = 𝑃)
s4eqd.4 (𝜑𝐷 = 𝑄)
Assertion
Ref Expression
s4eqd (𝜑 → ⟨“𝐴𝐵𝐶𝐷”⟩ = ⟨“𝑁𝑂𝑃𝑄”⟩)

Proof of Theorem s4eqd
StepHypRef Expression
1 s2eqd.1 . . . 4 (𝜑𝐴 = 𝑁)
2 s2eqd.2 . . . 4 (𝜑𝐵 = 𝑂)
3 s3eqd.3 . . . 4 (𝜑𝐶 = 𝑃)
41, 2, 3s3eqd 14837 . . 3 (𝜑 → ⟨“𝐴𝐵𝐶”⟩ = ⟨“𝑁𝑂𝑃”⟩)
5 s4eqd.4 . . . 4 (𝜑𝐷 = 𝑄)
65s1eqd 14573 . . 3 (𝜑 → ⟨“𝐷”⟩ = ⟨“𝑄”⟩)
74, 6oveq12d 7408 . 2 (𝜑 → (⟨“𝐴𝐵𝐶”⟩ ++ ⟨“𝐷”⟩) = (⟨“𝑁𝑂𝑃”⟩ ++ ⟨“𝑄”⟩))
8 df-s4 14823 . 2 ⟨“𝐴𝐵𝐶𝐷”⟩ = (⟨“𝐴𝐵𝐶”⟩ ++ ⟨“𝐷”⟩)
9 df-s4 14823 . 2 ⟨“𝑁𝑂𝑃𝑄”⟩ = (⟨“𝑁𝑂𝑃”⟩ ++ ⟨“𝑄”⟩)
107, 8, 93eqtr4g 2790 1 (𝜑 → ⟨“𝐴𝐵𝐶𝐷”⟩ = ⟨“𝑁𝑂𝑃𝑄”⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  (class class class)co 7390   ++ cconcat 14542  ⟨“cs1 14567  ⟨“cs3 14815  ⟨“cs4 14816
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-iota 6467  df-fv 6522  df-ov 7393  df-s1 14568  df-s2 14821  df-s3 14822  df-s4 14823
This theorem is referenced by:  s5eqd  14839
  Copyright terms: Public domain W3C validator