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

Theorem s2eqd 14994
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 14728 . . 3 (𝜑 → ⟨“𝐴”⟩ = ⟨“𝑁”⟩)
3 s2eqd.2 . . . 4 (𝜑 → 𝐵 = 𝑂)
43s1eqd 14728 . . 3 (𝜑 → ⟨“𝐵”⟩ = ⟨“𝑂”⟩)
52, 4oveq12d 7430 . 2 (𝜑 → (⟨“𝐴”⟩ ++ ⟨“𝐵”⟩) = (⟨“𝑁”⟩ ++ ⟨“𝑂”⟩))
6 df-s2 14979 . 2 ⟨“𝐴𝐵”⟩ = (⟨“𝐴”⟩ ++ ⟨“𝐵”⟩)
7 df-s2 14979 . 2 ⟨“𝑁𝑂”⟩ = (⟨“𝑁”⟩ ++ ⟨“𝑂”⟩)
85, 6, 73eqtr4g 2821 1 (𝜑 → ⟨“𝐴𝐵”⟩ = ⟨“𝑁𝑂”⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570  (class class class)co 7412   ++ cconcat 14695  ⟨“cs1 14722  ⟨“cs2 14972
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6487  df-fv 6539  df-ov 7415  df-s1 14723  df-s2 14979
This theorem is used by:  s3eqd  14995  swrds2m  15072  wrdl2exs2  15077  swrd2lsw  15085  efgi  19913  efgi0  19914  efgi1  19915  efgtf  19916  efgtval  19917  efgval2  19918  frgpuplem  19966  2clwwlk2clwwlklem  30929  wrdt2ind  33498  elrgspnsubrunlem1  33790  elrgspnsubrun  33792
  Copyright terms: Public domain W3C validator