ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  s8eqd Unicode version

Theorem s8eqd 11358
Description: Equality theorem for a length 8 word. (Contributed by Mario Carneiro, 27-Feb-2016.)
Hypotheses
Ref Expression
s2eqd.1  |-  ( ph  ->  A  =  N )
s2eqd.2  |-  ( ph  ->  B  =  O )
s3eqd.3  |-  ( ph  ->  C  =  P )
s4eqd.4  |-  ( ph  ->  D  =  Q )
s5eqd.5  |-  ( ph  ->  E  =  R )
s6eqd.6  |-  ( ph  ->  F  =  S )
s7eqd.6  |-  ( ph  ->  G  =  T )
s8eqd.6  |-  ( ph  ->  H  =  U )
Assertion
Ref Expression
s8eqd  |-  ( ph  ->  <" A B C D E F G H ">  =  <" N O P Q R S T U "> )

Proof of Theorem s8eqd
StepHypRef Expression
1 s2eqd.1 . . . 4  |-  ( ph  ->  A  =  N )
2 s2eqd.2 . . . 4  |-  ( ph  ->  B  =  O )
3 s3eqd.3 . . . 4  |-  ( ph  ->  C  =  P )
4 s4eqd.4 . . . 4  |-  ( ph  ->  D  =  Q )
5 s5eqd.5 . . . 4  |-  ( ph  ->  E  =  R )
6 s6eqd.6 . . . 4  |-  ( ph  ->  F  =  S )
7 s7eqd.6 . . . 4  |-  ( ph  ->  G  =  T )
81, 2, 3, 4, 5, 6, 7s7eqd 11357 . . 3  |-  ( ph  ->  <" A B C D E F G ">  =  <" N O P Q R S T "> )
9 s8eqd.6 . . . 4  |-  ( ph  ->  H  =  U )
109s1eqd 11198 . . 3  |-  ( ph  ->  <" H ">  =  <" U "> )
118, 10oveq12d 6036 . 2  |-  ( ph  ->  ( <" A B C D E F G "> ++  <" H "> )  =  (
<" N O P Q R S T "> ++  <" U "> ) )
12 df-s8 11344 . 2  |-  <" A B C D E F G H ">  =  ( <" A B C D E F G "> ++  <" H "> )
13 df-s8 11344 . 2  |-  <" N O P Q R S T U ">  =  ( <" N O P Q R S T "> ++  <" U "> )
1411, 12, 133eqtr4g 2289 1  |-  ( ph  ->  <" A B C D E F G H ">  =  <" N O P Q R S T U "> )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397  (class class class)co 6018   ++ cconcat 11168   <"cs1 11193   <"cs7 11336   <"cs8 11337
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-ov 6021  df-s1 11194  df-s2 11338  df-s3 11339  df-s4 11340  df-s5 11341  df-s6 11342  df-s7 11343  df-s8 11344
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator