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

Theorem s2eqd 15045
Description: Equality theorem for a doubleton word. (Contributed by Mario Carneiro, 27-Feb-2016.)
Hypotheses
Ref Expression
s2eqd.1 (𝜑 → 𝐴 = 𝑁)
s2eqd.2 (𝜑 → 𝐵 = 𝑂)
Assertion
Ref Expression
s2eqd (𝜑 → ⟨“𝐴𝐵”⟩ = ⟨“𝑁𝑂”⟩)

Proof of Theorem s2eqd
StepHypRef Expression
1 s2eqd.1 . . . 4 (𝜑 → 𝐴 = 𝑁)
21s1eqd 14778 . . 3 (𝜑 → ⟨“𝐴”⟩ = ⟨“𝑁”⟩)
3 s2eqd.2 . . . 4 (𝜑 → 𝐵 = 𝑂)
43s1eqd 14778 . . 3 (𝜑 → ⟨“𝐵”⟩ = ⟨“𝑂”⟩)
52, 4oveq12d 7464 . 2 (𝜑 → (⟨“𝐴”⟩ ++ ⟨“𝐵”⟩) = (⟨“𝑁”⟩ ++ ⟨“𝑂”⟩))
6 df-s2 15030 . 2 ⟨“𝐴𝐵”⟩ = (⟨“𝐴”⟩ ++ ⟨“𝐵”⟩)
7 df-s2 15030 . 2 ⟨“𝑁𝑂”⟩ = (⟨“𝑁”⟩ ++ ⟨“𝑂”⟩)
85, 6, 73eqtr4g 2823 1 (𝜑 → ⟨“𝐴𝐵”⟩ = ⟨“𝑁𝑂”⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570  (class class class)co 7446   ++ cconcat 14745  ⟨“cs1 14772  ⟨“cs2 15023
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6515  df-fv 6569  df-ov 7449  df-s1 14773  df-s2 15030
This theorem is used by:  s3eqd  15046  swrds2m  15124  wrdl2exs2  15129  swrd2lsw  15137  efgi  19966  efgi0  19967  efgi1  19968  efgtf  19969  efgtval  19970  efgval2  19971  frgpuplem  20019  2clwwlk2clwwlklem  30980  wrdt2ind  33589  elrgspnsubrunlem1  33884  elrgspnsubrun  33886  rrx2plordisom  50051
  Copyright terms: Public domain W3C validator