ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  equncomi Unicode version

Theorem equncomi 3375
Description: Inference form of equncom 3374. (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
StepHypRef Expression
1 equncomi.1 . 2  |-  A  =  ( B  u.  C
)
2 equncom 3374 . 2  |-  ( A  =  ( B  u.  C )  <->  A  =  ( C  u.  B
) )
31, 2mpbi 145 1  |-  A  =  ( C  u.  B
)
Colors of variables: wff set class
Syntax hints:    = wceq 1402    u. cun 3218
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-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224
This theorem is referenced by:  disjssun  3587  difprsn1  3849  unidmrn  5315  phplem1  7143  djucomen  7562
  Copyright terms: Public domain W3C validator