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

Theorem preqr1g 3605
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 3607. (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 3541 . . . . . . 7  |-  ( A  e.  _V  ->  A  e.  { A ,  C } )
2 eleq2 2151 . . . . . . 7  |-  ( { A ,  C }  =  { B ,  C }  ->  ( A  e. 
{ A ,  C } 
<->  A  e.  { B ,  C } ) )
31, 2syl5ibcom 153 . . . . . 6  |-  ( A  e.  _V  ->  ( { A ,  C }  =  { B ,  C }  ->  A  e.  { B ,  C }
) )
4 elprg 3461 . . . . . 6  |-  ( A  e.  _V  ->  ( A  e.  { B ,  C }  <->  ( A  =  B  \/  A  =  C ) ) )
53, 4sylibd 147 . . . . 5  |-  ( A  e.  _V  ->  ( { A ,  C }  =  { B ,  C }  ->  ( A  =  B  \/  A  =  C ) ) )
65adantr 270 . . . 4  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( { A ,  C }  =  { B ,  C }  ->  ( A  =  B  \/  A  =  C ) ) )
76imp 122 . . 3  |-  ( ( ( A  e.  _V  /\  B  e.  _V )  /\  { A ,  C }  =  { B ,  C } )  -> 
( A  =  B  \/  A  =  C ) )
8 prid1g 3541 . . . . . . 7  |-  ( B  e.  _V  ->  B  e.  { B ,  C } )
9 eleq2 2151 . . . . . . 7  |-  ( { A ,  C }  =  { B ,  C }  ->  ( B  e. 
{ A ,  C } 
<->  B  e.  { B ,  C } ) )
108, 9syl5ibrcom 155 . . . . . 6  |-  ( B  e.  _V  ->  ( { A ,  C }  =  { B ,  C }  ->  B  e.  { A ,  C }
) )
11 elprg 3461 . . . . . 6  |-  ( B  e.  _V  ->  ( B  e.  { A ,  C }  <->  ( B  =  A  \/  B  =  C ) ) )
1210, 11sylibd 147 . . . . 5  |-  ( B  e.  _V  ->  ( { A ,  C }  =  { B ,  C }  ->  ( B  =  A  \/  B  =  C ) ) )
1312adantl 271 . . . 4  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( { A ,  C }  =  { B ,  C }  ->  ( B  =  A  \/  B  =  C ) ) )
1413imp 122 . . 3  |-  ( ( ( A  e.  _V  /\  B  e.  _V )  /\  { A ,  C }  =  { B ,  C } )  -> 
( B  =  A  \/  B  =  C ) )
15 eqcom 2090 . . 3  |-  ( A  =  B  <->  B  =  A )
16 eqeq2 2097 . . 3  |-  ( A  =  C  ->  ( B  =  A  <->  B  =  C ) )
177, 14, 15, 16oplem1 921 . 2  |-  ( ( ( A  e.  _V  /\  B  e.  _V )  /\  { A ,  C }  =  { B ,  C } )  ->  A  =  B )
1817ex 113 1  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( { A ,  C }  =  { B ,  C }  ->  A  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    \/ wo 664    = wceq 1289    e. wcel 1438   _Vcvv 2619   {cpr 3442
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070
This theorem depends on definitions:  df-bi 115  df-tru 1292  df-nf 1395  df-sb 1693  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-v 2621  df-un 3001  df-sn 3447  df-pr 3448
This theorem is referenced by:  preqr2g  3606
  Copyright terms: Public domain W3C validator