MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  2optocl Unicode version

Theorem 2optocl 4765
Description: Implicit substitution of classes for ordered pairs. (Contributed by NM, 12-Mar-1995.)
Hypotheses
Ref Expression
2optocl.1  |-  R  =  ( C  X.  D
)
2optocl.2  |-  ( <.
x ,  y >.  =  A  ->  ( ph  <->  ps ) )
2optocl.3  |-  ( <.
z ,  w >.  =  B  ->  ( ps  <->  ch ) )
2optocl.4  |-  ( ( ( x  e.  C  /\  y  e.  D
)  /\  ( z  e.  C  /\  w  e.  D ) )  ->  ph )
Assertion
Ref Expression
2optocl  |-  ( ( A  e.  R  /\  B  e.  R )  ->  ch )
Distinct variable groups:    x, y,
z, w, A    z, B, w    x, C, y, z, w    x, D, y, z, w    ps, x, y    ch, z, w   
z, R, w
Allowed substitution hints:    ph( x, y, z, w)    ps( z, w)    ch( x, y)    B( x, y)    R( x, y)

Proof of Theorem 2optocl
StepHypRef Expression
1 2optocl.1 . . 3  |-  R  =  ( C  X.  D
)
2 2optocl.3 . . . 4  |-  ( <.
z ,  w >.  =  B  ->  ( ps  <->  ch ) )
32imbi2d 307 . . 3  |-  ( <.
z ,  w >.  =  B  ->  ( ( A  e.  R  ->  ps )  <->  ( A  e.  R  ->  ch )
) )
4 2optocl.2 . . . . . 6  |-  ( <.
x ,  y >.  =  A  ->  ( ph  <->  ps ) )
54imbi2d 307 . . . . 5  |-  ( <.
x ,  y >.  =  A  ->  ( ( ( z  e.  C  /\  w  e.  D
)  ->  ph )  <->  ( (
z  e.  C  /\  w  e.  D )  ->  ps ) ) )
6 2optocl.4 . . . . . 6  |-  ( ( ( x  e.  C  /\  y  e.  D
)  /\  ( z  e.  C  /\  w  e.  D ) )  ->  ph )
76ex 423 . . . . 5  |-  ( ( x  e.  C  /\  y  e.  D )  ->  ( ( z  e.  C  /\  w  e.  D )  ->  ph )
)
81, 5, 7optocl 4764 . . . 4  |-  ( A  e.  R  ->  (
( z  e.  C  /\  w  e.  D
)  ->  ps )
)
98com12 27 . . 3  |-  ( ( z  e.  C  /\  w  e.  D )  ->  ( A  e.  R  ->  ps ) )
101, 3, 9optocl 4764 . 2  |-  ( B  e.  R  ->  ( A  e.  R  ->  ch ) )
1110impcom 419 1  |-  ( ( A  e.  R  /\  B  e.  R )  ->  ch )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1623    e. wcel 1684   <.cop 3643    X. cxp 4687
This theorem is referenced by:  3optocl  4766  ecopovsym  6760  th3qlem2  6765  axaddf  8767  axmulf  8768
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-opab 4078  df-xp 4695
  Copyright terms: Public domain W3C validator