Theorem s3eq2 11532

Description: Equality theorem for a length 3 word for the second symbol. (Contributed by AV, 4-Jan-2022.)

Assertion

Ref	Expression
s3eq2	|- ( B = D -> <" A B C "> = <" A D C "> )

Proof of Theorem s3eq2

Step	Hyp	Ref	Expression
1		eqidd 2239	. 2 |- ( B = D -> A = A )
2		id 19	. 2 |- ( B = D -> B = D )
3		eqidd 2239	. 2 |- ( B = D -> C = C )
4	1, 2, 3	s3eqd 11526	1 |- ( B = D -> <" A B C "> = <" A D C "> )

Syntax hints:   -> wi 4   = wceq 1402   <"cs3 11505

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

This theorem is referenced by: (None)