Theorem equncomi 3367

Description: Inference form of equncom 3366. (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 3366	. 2 |- ( A = ( B u. C ) <-> A = ( C u. B ) )
3	1, 2	mpbi 145	1 |- A = ( C u. B )

Syntax hints:   = wceq 1398   u. cun 3211

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-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-un 3217

This theorem is referenced by:  disjssun  3574  difprsn1  3835  unidmrn  5297  phplem1  7108  djucomen  7525