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

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

Proof of Theorem preqr1g
StepHypRef Expression
1 prid1g 3597 . . . . . . 7  |-  ( A  e.  _V  ->  A  e.  { A ,  C } )
2 eleq2 2181 . . . . . . 7  |-  ( { A ,  C }  =  { B ,  C }  ->  ( A  e. 
{ A ,  C } 
<->  A  e.  { B ,  C } ) )
31, 2syl5ibcom 154 . . . . . 6  |-  ( A  e.  _V  ->  ( { A ,  C }  =  { B ,  C }  ->  A  e.  { B ,  C }
) )
4 elprg 3517 . . . . . 6  |-  ( A  e.  _V  ->  ( A  e.  { B ,  C }  <->  ( A  =  B  \/  A  =  C ) ) )
53, 4sylibd 148 . . . . 5  |-  ( A  e.  _V  ->  ( { A ,  C }  =  { B ,  C }  ->  ( A  =  B  \/  A  =  C ) ) )
65adantr 274 . . . 4  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( { A ,  C }  =  { B ,  C }  ->  ( A  =  B  \/  A  =  C ) ) )
76imp 123 . . 3  |-  ( ( ( A  e.  _V  /\  B  e.  _V )  /\  { A ,  C }  =  { B ,  C } )  -> 
( A  =  B  \/  A  =  C ) )
8 prid1g 3597 . . . . . . 7  |-  ( B  e.  _V  ->  B  e.  { B ,  C } )
9 eleq2 2181 . . . . . . 7  |-  ( { A ,  C }  =  { B ,  C }  ->  ( B  e. 
{ A ,  C } 
<->  B  e.  { B ,  C } ) )
108, 9syl5ibrcom 156 . . . . . 6  |-  ( B  e.  _V  ->  ( { A ,  C }  =  { B ,  C }  ->  B  e.  { A ,  C }
) )
11 elprg 3517 . . . . . 6  |-  ( B  e.  _V  ->  ( B  e.  { A ,  C }  <->  ( B  =  A  \/  B  =  C ) ) )
1210, 11sylibd 148 . . . . 5  |-  ( B  e.  _V  ->  ( { A ,  C }  =  { B ,  C }  ->  ( B  =  A  \/  B  =  C ) ) )
1312adantl 275 . . . 4  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( { A ,  C }  =  { B ,  C }  ->  ( B  =  A  \/  B  =  C ) ) )
1413imp 123 . . 3  |-  ( ( ( A  e.  _V  /\  B  e.  _V )  /\  { A ,  C }  =  { B ,  C } )  -> 
( B  =  A  \/  B  =  C ) )
15 eqcom 2119 . . 3  |-  ( A  =  B  <->  B  =  A )
16 eqeq2 2127 . . 3  |-  ( A  =  C  ->  ( B  =  A  <->  B  =  C ) )
177, 14, 15, 16oplem1 944 . 2  |-  ( ( ( A  e.  _V  /\  B  e.  _V )  /\  { A ,  C }  =  { B ,  C } )  ->  A  =  B )
1817ex 114 1  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( { A ,  C }  =  { B ,  C }  ->  A  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    \/ wo 682    = wceq 1316    e. wcel 1465   _Vcvv 2660   {cpr 3498
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 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099
This theorem depends on definitions:  df-bi 116  df-tru 1319  df-nf 1422  df-sb 1721  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-v 2662  df-un 3045  df-sn 3503  df-pr 3504
This theorem is referenced by:  preqr2g  3664
  Copyright terms: Public domain W3C validator