Users' Mathboxes Mathbox for Giovanni Mascellani < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  oprabbi Structured version   Unicode version

Theorem oprabbi 30813
Description: Equality deduction for class abstraction of nested ordered pairs. (Contributed by Giovanni Mascellani, 10-Apr-2018.)
Assertion
Ref Expression
oprabbi  |-  ( A. x A. y A. z
( ph  <->  ps )  ->  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. x ,  y >. ,  z
>.  |  ps } )

Proof of Theorem oprabbi
StepHypRef Expression
1 eqoprab2b 6328 . 2  |-  ( {
<. <. x ,  y
>. ,  z >.  | 
ph }  =  { <. <. x ,  y
>. ,  z >.  |  ps }  <->  A. x A. y A. z (
ph 
<->  ps ) )
21biimpri 206 1  |-  ( A. x A. y A. z
( ph  <->  ps )  ->  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. x ,  y >. ,  z
>.  |  ps } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184   A.wal 1396    = wceq 1398   {coprab 6271
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-sep 4560  ax-nul 4568  ax-pr 4676
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 973  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-ral 2809  df-rab 2813  df-v 3108  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-nul 3784  df-if 3930  df-sn 4017  df-pr 4019  df-op 4023  df-oprab 6274
This theorem is referenced by:  mpt2bi123f  30814
  Copyright terms: Public domain W3C validator