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

Theorem s7eqd 15061
Description: Equality theorem for a length 7 word. (Contributed by Mario Carneiro, 27-Feb-2016.)
Hypotheses
Ref Expression
s2eqd.1 (𝜑 → 𝐴 = 𝑁)
s2eqd.2 (𝜑 → 𝐵 = 𝑂)
s3eqd.3 (𝜑 → 𝐶 = 𝑃)
s4eqd.4 (𝜑 → 𝐷 = 𝑄)
s5eqd.5 (𝜑 → 𝐸 = 𝑅)
s6eqd.6 (𝜑 → 𝐹 = 𝑆)
s7eqd.6 (𝜑 → 𝐺 = 𝑇)
Assertion
Ref Expression
s7eqd (𝜑 → ⟨“𝐴𝐵𝐶𝐷𝐸𝐹𝐺”⟩ = ⟨“𝑁𝑂𝑃𝑄𝑅𝑆𝑇”⟩)

Proof of Theorem s7eqd
StepHypRef Expression
1 s2eqd.1 . . . 4 (𝜑 → 𝐴 = 𝑁)
2 s2eqd.2 . . . 4 (𝜑 → 𝐵 = 𝑂)
3 s3eqd.3 . . . 4 (𝜑 → 𝐶 = 𝑃)
4 s4eqd.4 . . . 4 (𝜑 → 𝐷 = 𝑄)
5 s5eqd.5 . . . 4 (𝜑 → 𝐸 = 𝑅)
6 s6eqd.6 . . . 4 (𝜑 → 𝐹 = 𝑆)
71, 2, 3, 4, 5, 6s6eqd 15060 . . 3 (𝜑 → ⟨“𝐴𝐵𝐶𝐷𝐸𝐹”⟩ = ⟨“𝑁𝑂𝑃𝑄𝑅𝑆”⟩)
8 s7eqd.6 . . . 4 (𝜑 → 𝐺 = 𝑇)
98s1eqd 14789 . . 3 (𝜑 → ⟨“𝐺”⟩ = ⟨“𝑇”⟩)
107, 9oveq12d 7469 . 2 (𝜑 → (⟨“𝐴𝐵𝐶𝐷𝐸𝐹”⟩ ++ ⟨“𝐺”⟩) = (⟨“𝑁𝑂𝑃𝑄𝑅𝑆”⟩ ++ ⟨“𝑇”⟩))
11 df-s7 15046 . 2 ⟨“𝐴𝐵𝐶𝐷𝐸𝐹𝐺”⟩ = (⟨“𝐴𝐵𝐶𝐷𝐸𝐹”⟩ ++ ⟨“𝐺”⟩)
12 df-s7 15046 . 2 ⟨“𝑁𝑂𝑃𝑄𝑅𝑆𝑇”⟩ = (⟨“𝑁𝑂𝑃𝑄𝑅𝑆”⟩ ++ ⟨“𝑇”⟩)
1310, 11, 123eqtr4g 2823 1 (𝜑 → ⟨“𝐴𝐵𝐶𝐷𝐸𝐹𝐺”⟩ = ⟨“𝑁𝑂𝑃𝑄𝑅𝑆𝑇”⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570  (class class class)co 7451   ++ cconcat 14756  ⟨“cs1 14783  ⟨“cs6 15038  ⟨“cs7 15039
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 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-ov 7454  df-s1 14784  df-s2 15041  df-s3 15042  df-s4 15043  df-s5 15044  df-s6 15045  df-s7 15046
This theorem is used by:  s8eqd  15062
  Copyright terms: Public domain W3C validator