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

Theorem oteqex 4964
Description: Equivalence of existence implied by equality of ordered triples. (Contributed by NM, 28-May-2008.) (Revised by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
oteqex  |-  ( <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >.  ->  ( ( A  e.  _V  /\  B  e.  _V  /\  C  e.  _V )  <->  ( R  e.  _V  /\  S  e. 
_V  /\  T  e.  _V ) ) )

Proof of Theorem oteqex
StepHypRef Expression
1 simp3 1063 . . 3  |-  ( ( A  e.  _V  /\  B  e.  _V  /\  C  e.  _V )  ->  C  e.  _V )
21a1i 11 . 2  |-  ( <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >.  ->  ( ( A  e.  _V  /\  B  e.  _V  /\  C  e.  _V )  ->  C  e.  _V ) )
3 simp3 1063 . . 3  |-  ( ( R  e.  _V  /\  S  e.  _V  /\  T  e.  _V )  ->  T  e.  _V )
4 oteqex2 4963 . . 3  |-  ( <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >.  ->  ( C  e.  _V  <->  T  e.  _V ) )
53, 4syl5ibr 236 . 2  |-  ( <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >.  ->  ( ( R  e.  _V  /\  S  e.  _V  /\  T  e.  _V )  ->  C  e.  _V ) )
6 opex 4932 . . . . . . . 8  |-  <. A ,  B >.  e.  _V
7 opthg 4946 . . . . . . . 8  |-  ( (
<. A ,  B >.  e. 
_V  /\  C  e.  _V )  ->  ( <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >.  <->  ( <. A ,  B >.  =  <. R ,  S >.  /\  C  =  T ) ) )
86, 7mpan 706 . . . . . . 7  |-  ( C  e.  _V  ->  ( <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >.  <->  ( <. A ,  B >.  =  <. R ,  S >.  /\  C  =  T ) ) )
98simprbda 653 . . . . . 6  |-  ( ( C  e.  _V  /\  <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >. )  ->  <. A ,  B >.  =  <. R ,  S >. )
10 opeqex 4962 . . . . . 6  |-  ( <. A ,  B >.  = 
<. R ,  S >.  -> 
( ( A  e. 
_V  /\  B  e.  _V )  <->  ( R  e. 
_V  /\  S  e.  _V ) ) )
119, 10syl 17 . . . . 5  |-  ( ( C  e.  _V  /\  <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >. )  ->  (
( A  e.  _V  /\  B  e.  _V )  <->  ( R  e.  _V  /\  S  e.  _V )
) )
124adantl 482 . . . . 5  |-  ( ( C  e.  _V  /\  <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >. )  ->  ( C  e.  _V  <->  T  e.  _V ) )
1311, 12anbi12d 747 . . . 4  |-  ( ( C  e.  _V  /\  <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >. )  ->  (
( ( A  e. 
_V  /\  B  e.  _V )  /\  C  e. 
_V )  <->  ( ( R  e.  _V  /\  S  e.  _V )  /\  T  e.  _V ) ) )
14 df-3an 1039 . . . 4  |-  ( ( A  e.  _V  /\  B  e.  _V  /\  C  e.  _V )  <->  ( ( A  e.  _V  /\  B  e.  _V )  /\  C  e.  _V ) )
15 df-3an 1039 . . . 4  |-  ( ( R  e.  _V  /\  S  e.  _V  /\  T  e.  _V )  <->  ( ( R  e.  _V  /\  S  e.  _V )  /\  T  e.  _V ) )
1613, 14, 153bitr4g 303 . . 3  |-  ( ( C  e.  _V  /\  <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >. )  ->  (
( A  e.  _V  /\  B  e.  _V  /\  C  e.  _V )  <->  ( R  e.  _V  /\  S  e.  _V  /\  T  e.  _V ) ) )
1716expcom 451 . 2  |-  ( <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >.  ->  ( C  e.  _V  ->  (
( A  e.  _V  /\  B  e.  _V  /\  C  e.  _V )  <->  ( R  e.  _V  /\  S  e.  _V  /\  T  e.  _V ) ) ) )
182, 5, 17pm5.21ndd 369 1  |-  ( <. <. A ,  B >. ,  C >.  =  <. <. R ,  S >. ,  T >.  ->  ( ( A  e.  _V  /\  B  e.  _V  /\  C  e.  _V )  <->  ( R  e.  _V  /\  S  e. 
_V  /\  T  e.  _V ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990   _Vcvv 3200   <.cop 4183
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  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  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-ne 2795  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator