MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  preqsnOLD Structured version   Visualization version   Unicode version

Theorem preqsnOLD 4394
Description: Obsolete proof of preqsn 4393 as of 23-Jul-2021. (Contributed by NM, 3-Jun-2008.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
preqsn.1  |-  A  e. 
_V
preqsn.2  |-  B  e. 
_V
preqsn.3  |-  C  e. 
_V
Assertion
Ref Expression
preqsnOLD  |-  ( { A ,  B }  =  { C }  <->  ( A  =  B  /\  B  =  C ) )

Proof of Theorem preqsnOLD
StepHypRef Expression
1 dfsn2 4190 . . 3  |-  { C }  =  { C ,  C }
21eqeq2i 2634 . 2  |-  ( { A ,  B }  =  { C }  <->  { A ,  B }  =  { C ,  C }
)
3 preqsn.1 . . . 4  |-  A  e. 
_V
4 preqsn.2 . . . 4  |-  B  e. 
_V
5 preqsn.3 . . . 4  |-  C  e. 
_V
63, 4, 5, 5preq12b 4382 . . 3  |-  ( { A ,  B }  =  { C ,  C } 
<->  ( ( A  =  C  /\  B  =  C )  \/  ( A  =  C  /\  B  =  C )
) )
7 oridm 536 . . . 4  |-  ( ( ( A  =  C  /\  B  =  C )  \/  ( A  =  C  /\  B  =  C ) )  <->  ( A  =  C  /\  B  =  C ) )
8 eqtr3 2643 . . . . . 6  |-  ( ( A  =  C  /\  B  =  C )  ->  A  =  B )
9 simpr 477 . . . . . 6  |-  ( ( A  =  C  /\  B  =  C )  ->  B  =  C )
108, 9jca 554 . . . . 5  |-  ( ( A  =  C  /\  B  =  C )  ->  ( A  =  B  /\  B  =  C ) )
11 eqtr 2641 . . . . . 6  |-  ( ( A  =  B  /\  B  =  C )  ->  A  =  C )
12 simpr 477 . . . . . 6  |-  ( ( A  =  B  /\  B  =  C )  ->  B  =  C )
1311, 12jca 554 . . . . 5  |-  ( ( A  =  B  /\  B  =  C )  ->  ( A  =  C  /\  B  =  C ) )
1410, 13impbii 199 . . . 4  |-  ( ( A  =  C  /\  B  =  C )  <->  ( A  =  B  /\  B  =  C )
)
157, 14bitri 264 . . 3  |-  ( ( ( A  =  C  /\  B  =  C )  \/  ( A  =  C  /\  B  =  C ) )  <->  ( A  =  B  /\  B  =  C ) )
166, 15bitri 264 . 2  |-  ( { A ,  B }  =  { C ,  C } 
<->  ( A  =  B  /\  B  =  C ) )
172, 16bitri 264 1  |-  ( { A ,  B }  =  { C }  <->  ( A  =  B  /\  B  =  C ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196    \/ wo 383    /\ wa 384    = wceq 1483    e. wcel 1990   _Vcvv 3200   {csn 4177   {cpr 4179
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-v 3202  df-un 3579  df-sn 4178  df-pr 4180
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator