Theorem equncomi 3268

Description: Inference form of equncom 3267. (Contributed by Alan Sare, 18-Feb-2012.)

Hypothesis

Ref	Expression
equncomi.1	|- A = ( B u. C )

Assertion

Ref	Expression
equncomi	|- A = ( C u. B )

Proof of Theorem equncomi

Step	Hyp	Ref	Expression
1		equncomi.1	. 2 |- A = ( B u. C )
2		equncom 3267	. 2 |- ( A = ( B u. C ) <-> A = ( C u. B ) )
3	1, 2	mpbi 144	1 |- A = ( C u. B )

Syntax hints:   = wceq 1343   u. cun 3114

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-v 2728  df-un 3120

This theorem is referenced by:  disjssun  3472  difprsn1  3712  unidmrn  5136  phplem1  6818  djucomen  7172