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

Theorem s8eqd 11531
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 11530 . . 3  |-  ( ph  ->  <" A B C D E F G ">  =  <" N O P Q R S T "> )
9 s8eqd.6 . . . 4  |-  ( ph  ->  H  =  U )
109s1eqd 11371 . . 3  |-  ( ph  ->  <" H ">  =  <" U "> )
118, 10oveq12d 6097 . 2  |-  ( ph  ->  ( <" A B C D E F G "> ++  <" H "> )  =  (
<" N O P Q R S T "> ++  <" U "> ) )
12 df-s8 11517 . 2  |-  <" A B C D E F G H ">  =  ( <" A B C D E F G "> ++  <" H "> )
13 df-s8 11517 . 2  |-  <" N O P Q R S T U ">  =  ( <" N O P Q R S T "> ++  <" U "> )
1411, 12, 133eqtr4g 2296 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 1402  (class class class)co 6079   ++ cconcat 11341   <"cs1 11366   <"cs7 11509   <"cs8 11510
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-un 3224  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-iota 5335  df-fv 5383  df-ov 6082  df-s1 11367  df-s2 11511  df-s3 11512  df-s4 11513  df-s5 11514  df-s6 11515  df-s7 11516  df-s8 11517
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator