Theorem s1eqd 11148

Description: Equality theorem for a singleton word. (Contributed by Mario Carneiro, 26-Feb-2016.)

Hypothesis

Ref	Expression
s1eqd.1	|- ( ph -> A = B )

Assertion

Ref	Expression
s1eqd	|- ( ph -> <" A "> = <" B "> )

Proof of Theorem s1eqd

Step	Hyp	Ref	Expression
1		s1eqd.1	. 2 |- ( ph -> A = B )
2		s1eq 11147	. 2 |- ( A = B -> <" A "> = <" B "> )
3	1, 2	syl 14	1 |- ( ph -> <" A "> = <" B "> )

Syntax hints:   -> wi 4   = wceq 1395   <"cs1 11143

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-rex 2514  df-v 2801  df-un 3201  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-iota 5277  df-fv 5325  df-s1 11144

This theorem is referenced by:  ccat1st1st  11167  swrds1  11195  swrdlsw  11196  reuccatpfxs1lem  11273  s2eqd  11297  s3eqd  11298  s4eqd  11299  s5eqd  11300  s6eqd  11301  s7eqd  11302  s8eqd  11303