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

Theorem opthg2 4269
Description: Ordered pair theorem. (Contributed by NM, 14-Oct-2005.) (Revised by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
opthg2  |-  ( ( C  e.  V  /\  D  e.  W )  ->  ( <. A ,  B >.  =  <. C ,  D >.  <-> 
( A  =  C  /\  B  =  D ) ) )

Proof of Theorem opthg2
StepHypRef Expression
1 opthg 4268 . 2  |-  ( ( C  e.  V  /\  D  e.  W )  ->  ( <. C ,  D >.  =  <. A ,  B >.  <-> 
( C  =  A  /\  D  =  B ) ) )
2 eqcom 2195 . 2  |-  ( <. A ,  B >.  = 
<. C ,  D >.  <->  <. C ,  D >.  =  <. A ,  B >. )
3 eqcom 2195 . . 3  |-  ( A  =  C  <->  C  =  A )
4 eqcom 2195 . . 3  |-  ( B  =  D  <->  D  =  B )
53, 4anbi12i 460 . 2  |-  ( ( A  =  C  /\  B  =  D )  <->  ( C  =  A  /\  D  =  B )
)
61, 2, 53bitr4g 223 1  |-  ( ( C  e.  V  /\  D  e.  W )  ->  ( <. A ,  B >.  =  <. C ,  D >.  <-> 
( A  =  C  /\  B  =  D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2164   <.cop 3622
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-v 2762  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628
This theorem is referenced by:  opth2  4270  fliftel  5837  axprecex  7942
  Copyright terms: Public domain W3C validator