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

Theorem opelopabf 4412
Description: The law of concretion. Theorem 9.5 of [Quine] p. 61. This version of opelopab 4409 uses bound-variable hypotheses in place of distinct variable conditions. (Contributed by NM, 19-Dec-2008.)
Hypotheses
Ref Expression
opelopabf.x  |-  F/ x ps
opelopabf.y  |-  F/ y ch
opelopabf.1  |-  A  e. 
_V
opelopabf.2  |-  B  e. 
_V
opelopabf.3  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
opelopabf.4  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
Assertion
Ref Expression
opelopabf  |-  ( <. A ,  B >.  e. 
{ <. x ,  y
>.  |  ph }  <->  ch )
Distinct variable groups:    x, y, A   
x, B, y
Allowed substitution hints:    ph( x, y)    ps( x, y)    ch( x, y)

Proof of Theorem opelopabf
StepHypRef Expression
1 opelopabsb 4397 . 2  |-  ( <. A ,  B >.  e. 
{ <. x ,  y
>.  |  ph }  <->  [. A  /  x ]. [. B  / 
y ]. ph )
2 opelopabf.1 . . 3  |-  A  e. 
_V
3 nfcv 2392 . . . . 5  |-  F/_ x B
4 opelopabf.x . . . . 5  |-  F/ x ps
53, 4nfsbc 3072 . . . 4  |-  F/ x [. B  /  y ]. ps
6 opelopabf.3 . . . . 5  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
76sbcbidv 3110 . . . 4  |-  ( x  =  A  ->  ( [. B  /  y ]. ph  <->  [. B  /  y ]. ps ) )
85, 7sbciegf 3083 . . 3  |-  ( A  e.  _V  ->  ( [. A  /  x ]. [. B  /  y ]. ph  <->  [. B  /  y ]. ps ) )
92, 8ax-mp 5 . 2  |-  ( [. A  /  x ]. [. B  /  y ]. ph  <->  [. B  / 
y ]. ps )
10 opelopabf.2 . . 3  |-  B  e. 
_V
11 opelopabf.y . . . 4  |-  F/ y ch
12 opelopabf.4 . . . 4  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
1311, 12sbciegf 3083 . . 3  |-  ( B  e.  _V  ->  ( [. B  /  y ]. ps  <->  ch ) )
1410, 13ax-mp 5 . 2  |-  ( [. B  /  y ]. ps  <->  ch )
151, 9, 143bitri 206 1  |-  ( <. A ,  B >.  e. 
{ <. x ,  y
>.  |  ph }  <->  ch )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1402   F/wnf 1513    e. wcel 2209   _Vcvv 2821   [.wsbc 3051   <.cop 3708   {copab 4186
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-opab 4188
This theorem is referenced by:  pofun  4452  fmptco  5865  uchoice  6361
  Copyright terms: Public domain W3C validator