Theorem s7eqd 14907

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

Step	Hyp	Ref	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 ⊢ (𝜑 → 𝐹 = 𝑆)
7	1, 2, 3, 4, 5, 6	s6eqd 14906	. . 3 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶𝐷𝐸𝐹”⟩ = ⟨“𝑁𝑂𝑃𝑄𝑅𝑆”⟩)
8		s7eqd.6	. . . 4 ⊢ (𝜑 → 𝐺 = 𝑇)
9	8	s1eqd 14639	. . 3 ⊢ (𝜑 → ⟨“𝐺”⟩ = ⟨“𝑇”⟩)
10	7, 9	oveq12d 7449	. 2 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶𝐷𝐸𝐹”⟩ ++ ⟨“𝐺”⟩) = (⟨“𝑁𝑂𝑃𝑄𝑅𝑆”⟩ ++ ⟨“𝑇”⟩))
11		df-s7 14892	. 2 ⊢ ⟨“𝐴𝐵𝐶𝐷𝐸𝐹𝐺”⟩ = (⟨“𝐴𝐵𝐶𝐷𝐸𝐹”⟩ ++ ⟨“𝐺”⟩)
12		df-s7 14892	. 2 ⊢ ⟨“𝑁𝑂𝑃𝑄𝑅𝑆𝑇”⟩ = (⟨“𝑁𝑂𝑃𝑄𝑅𝑆”⟩ ++ ⟨“𝑇”⟩)
13	10, 11, 12	3eqtr4g 2802	1 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶𝐷𝐸𝐹𝐺”⟩ = ⟨“𝑁𝑂𝑃𝑄𝑅𝑆𝑇”⟩)

Syntax hints:   → wi 4   = wceq 1540  (class class class)co 7431   ++ cconcat 14608  ⟨“cs1 14633  ⟨“cs6 14884  ⟨“cs7 14885

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 2007  ax-8 2110  ax-9 2118  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-iota 6514  df-fv 6569  df-ov 7434  df-s1 14634  df-s2 14887  df-s3 14888  df-s4 14889  df-s5 14890  df-s6 14891  df-s7 14892

This theorem is referenced by:  s8eqd  14908