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

Theorem opcom 4167
Description: An ordered pair commutes iff its members are equal. (Contributed by NM, 28-May-2009.)
Hypotheses
Ref Expression
opcom.1  |-  A  e. 
_V
opcom.2  |-  B  e. 
_V
Assertion
Ref Expression
opcom  |-  ( <. A ,  B >.  = 
<. B ,  A >.  <->  A  =  B )

Proof of Theorem opcom
StepHypRef Expression
1 opcom.1 . . 3  |-  A  e. 
_V
2 opcom.2 . . 3  |-  B  e. 
_V
31, 2opth 4154 . 2  |-  ( <. A ,  B >.  = 
<. B ,  A >.  <->  ( A  =  B  /\  B  =  A )
)
4 eqcom 2139 . . 3  |-  ( B  =  A  <->  A  =  B )
54anbi2i 452 . 2  |-  ( ( A  =  B  /\  B  =  A )  <->  ( A  =  B  /\  A  =  B )
)
6 anidm 393 . 2  |-  ( ( A  =  B  /\  A  =  B )  <->  A  =  B )
73, 5, 63bitri 205 1  |-  ( <. A ,  B >.  = 
<. B ,  A >.  <->  A  =  B )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1331    e. wcel 1480   _Vcvv 2681   <.cop 3525
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator