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

Theorem preqr2g 3851
Description: Reverse equality lemma for unordered pairs. If two unordered pairs have the same second element, the second elements are equal. Closed form of preqr2 3853. (Contributed by Jim Kingdon, 21-Sep-2018.)
Assertion
Ref Expression
preqr2g  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( { C ,  A }  =  { C ,  B }  ->  A  =  B ) )

Proof of Theorem preqr2g
StepHypRef Expression
1 prcom 3748 . . 3  |-  { C ,  A }  =  { A ,  C }
2 prcom 3748 . . 3  |-  { C ,  B }  =  { B ,  C }
31, 2eqeq12i 2244 . 2  |-  ( { C ,  A }  =  { C ,  B } 
<->  { A ,  C }  =  { B ,  C } )
4 preqr1g 3850 . 2  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( { A ,  C }  =  { B ,  C }  ->  A  =  B ) )
53, 4biimtrid 152 1  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( { C ,  A }  =  { C ,  B }  ->  A  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2201   _Vcvv 2801   {cpr 3671
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2212
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1810  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-v 2803  df-un 3203  df-sn 3676  df-pr 3677
This theorem is referenced by:  opth  4331
  Copyright terms: Public domain W3C validator