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

Theorem opabid 4242
Description: The law of concretion. Special case of Theorem 9.5 of [Quine] p. 61. (Contributed by NM, 14-Apr-1995.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
opabid  |-  ( <.
x ,  y >.  e.  { <. x ,  y
>.  |  ph }  <->  ph )

Proof of Theorem opabid
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 vex 2733 . . 3  |-  x  e. 
_V
2 vex 2733 . . 3  |-  y  e. 
_V
31, 2opex 4214 . 2  |-  <. x ,  y >.  e.  _V
4 copsexg 4229 . . 3  |-  ( z  =  <. x ,  y
>.  ->  ( ph  <->  E. x E. y ( z  = 
<. x ,  y >.  /\  ph ) ) )
54bicomd 140 . 2  |-  ( z  =  <. x ,  y
>.  ->  ( E. x E. y ( z  = 
<. x ,  y >.  /\  ph )  <->  ph ) )
6 df-opab 4051 . 2  |-  { <. x ,  y >.  |  ph }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ph ) }
73, 5, 6elab2 2878 1  |-  ( <.
x ,  y >.  e.  { <. x ,  y
>.  |  ph }  <->  ph )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1348   E.wex 1485    e. wcel 2141   <.cop 3586   {copab 4049
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-opab 4051
This theorem is referenced by:  opelopabsb  4245  ssopab2b  4261  dmopab  4822  rnopab  4858  funopab  5233  funco  5238  fvmptss2  5571  f1ompt  5647  ovid  5969  enssdom  6740
  Copyright terms: Public domain W3C validator