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

Theorem opelopabt 4326
Description: Closed theorem form of opelopab 4336. (Contributed by NM, 19-Feb-2013.)
Assertion
Ref Expression
opelopabt  |-  ( ( A. x A. y
( x  =  A  ->  ( ph  <->  ps )
)  /\  A. x A. y ( y  =  B  ->  ( ps  <->  ch ) )  /\  ( A  e.  V  /\  B  e.  W )
)  ->  ( <. A ,  B >.  e.  { <. x ,  y >.  |  ph }  <->  ch )
)
Distinct variable groups:    x, y, A   
x, B, y    ch, x, y
Allowed substitution hints:    ph( x, y)    ps( x, y)    V( x, y)    W( x, y)

Proof of Theorem opelopabt
StepHypRef Expression
1 elopab 4322 . 2  |-  ( <. A ,  B >.  e. 
{ <. x ,  y
>.  |  ph }  <->  E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) )
2 19.26-2 1506 . . . . 5  |-  ( A. x A. y ( ( x  =  A  -> 
( ph  <->  ps ) )  /\  ( y  =  B  ->  ( ps  <->  ch )
) )  <->  ( A. x A. y ( x  =  A  ->  ( ph 
<->  ps ) )  /\  A. x A. y ( y  =  B  -> 
( ps  <->  ch )
) ) )
3 anim12 344 . . . . . . 7  |-  ( ( ( x  =  A  ->  ( ph  <->  ps )
)  /\  ( y  =  B  ->  ( ps  <->  ch ) ) )  -> 
( ( x  =  A  /\  y  =  B )  ->  (
( ph  <->  ps )  /\  ( ps 
<->  ch ) ) ) )
4 bitr 472 . . . . . . 7  |-  ( ( ( ph  <->  ps )  /\  ( ps  <->  ch )
)  ->  ( ph  <->  ch ) )
53, 4syl6 33 . . . . . 6  |-  ( ( ( x  =  A  ->  ( ph  <->  ps )
)  /\  ( y  =  B  ->  ( ps  <->  ch ) ) )  -> 
( ( x  =  A  /\  y  =  B )  ->  ( ph 
<->  ch ) ) )
652alimi 1480 . . . . 5  |-  ( A. x A. y ( ( x  =  A  -> 
( ph  <->  ps ) )  /\  ( y  =  B  ->  ( ps  <->  ch )
) )  ->  A. x A. y ( ( x  =  A  /\  y  =  B )  ->  ( ph 
<->  ch ) ) )
72, 6sylbir 135 . . . 4  |-  ( ( A. x A. y
( x  =  A  ->  ( ph  <->  ps )
)  /\  A. x A. y ( y  =  B  ->  ( ps  <->  ch ) ) )  ->  A. x A. y ( ( x  =  A  /\  y  =  B )  ->  ( ph  <->  ch ) ) )
8 copsex2t 4307 . . . 4  |-  ( ( A. x A. y
( ( x  =  A  /\  y  =  B )  ->  ( ph 
<->  ch ) )  /\  ( A  e.  V  /\  B  e.  W
) )  ->  ( E. x E. y (
<. A ,  B >.  = 
<. x ,  y >.  /\  ph )  <->  ch )
)
97, 8sylan 283 . . 3  |-  ( ( ( A. x A. y ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x A. y ( y  =  B  ->  ( ps 
<->  ch ) ) )  /\  ( A  e.  V  /\  B  e.  W ) )  -> 
( E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) 
<->  ch ) )
1093impa 1197 . 2  |-  ( ( A. x A. y
( x  =  A  ->  ( ph  <->  ps )
)  /\  A. x A. y ( y  =  B  ->  ( ps  <->  ch ) )  /\  ( A  e.  V  /\  B  e.  W )
)  ->  ( E. x E. y ( <. A ,  B >.  = 
<. x ,  y >.  /\  ph )  <->  ch )
)
111, 10bitrid 192 1  |-  ( ( A. x A. y
( x  =  A  ->  ( ph  <->  ps )
)  /\  A. x A. y ( y  =  B  ->  ( ps  <->  ch ) )  /\  ( A  e.  V  /\  B  e.  W )
)  ->  ( <. A ,  B >.  e.  { <. x ,  y >.  |  ph }  <->  ch )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 981   A.wal 1371    = wceq 1373   E.wex 1516    e. wcel 2178   <.cop 3646   {copab 4120
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-opab 4122
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator