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

Theorem opelopabt 4179
Description: Closed theorem form of opelopab 4188. (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 4175 . 2  |-  ( <. A ,  B >.  e. 
{ <. x ,  y
>.  |  ph }  <->  E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) )
2 19.26-2 1458 . . . . 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 341 . . . . . . 7  |-  ( ( ( x  =  A  ->  ( ph  <->  ps )
)  /\  ( y  =  B  ->  ( ps  <->  ch ) ) )  -> 
( ( x  =  A  /\  y  =  B )  ->  (
( ph  <->  ps )  /\  ( ps 
<->  ch ) ) ) )
4 bitr 463 . . . . . . 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 1432 . . . . 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 134 . . . 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 4162 . . . 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 281 . . 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 1176 . 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, 10syl5bb 191 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 103    <-> wb 104    /\ w3a 962   A.wal 1329    = wceq 1331   E.wex 1468    e. wcel 1480   <.cop 3525   {copab 3983
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-opab 3985
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator