Theorem s1eqd 11333

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 11332	. 2 |- ( A = B -> <" A "> = <" B "> )
3	1, 2	syl 14	1 |- ( ph -> <" A "> = <" B "> )

Syntax hints:   -> wi 4   = wceq 1398   <"cs1 11328

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-rex 2528  df-v 2817  df-un 3218  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-iota 5317  df-fv 5365  df-s1 11329

This theorem is referenced by:  ccat1st1st  11354  swrds1  11385  swrdlsw  11386  reuccatpfxs1lem  11463  s2eqd  11487  s3eqd  11488  s4eqd  11489  s5eqd  11490  s6eqd  11491  s7eqd  11492  s8eqd  11493