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

Theorem ecoptocl 6709
Description: Implicit substitution of class for equivalence class of ordered pair. (Contributed by NM, 23-Jul-1995.)
Hypotheses
Ref Expression
ecoptocl.1  |-  S  =  ( ( B  X.  C ) /. R
)
ecoptocl.2  |-  ( [
<. x ,  y >. ] R  =  A  ->  ( ph  <->  ps )
)
ecoptocl.3  |-  ( ( x  e.  B  /\  y  e.  C )  ->  ph )
Assertion
Ref Expression
ecoptocl  |-  ( A  e.  S  ->  ps )
Distinct variable groups:    x, y, A   
x, B, y    x, C, y    x, R, y    ps, x, y
Allowed substitution hints:    ph( x, y)    S( x, y)

Proof of Theorem ecoptocl
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 elqsi 6674 . . 3  |-  ( A  e.  ( ( B  X.  C ) /. R )  ->  E. z  e.  ( B  X.  C
) A  =  [
z ] R )
2 eqid 2205 . . . . 5  |-  ( B  X.  C )  =  ( B  X.  C
)
3 eceq1 6655 . . . . . . 7  |-  ( <.
x ,  y >.  =  z  ->  [ <. x ,  y >. ] R  =  [ z ] R
)
43eqeq2d 2217 . . . . . 6  |-  ( <.
x ,  y >.  =  z  ->  ( A  =  [ <. x ,  y >. ] R  <->  A  =  [ z ] R ) )
54imbi1d 231 . . . . 5  |-  ( <.
x ,  y >.  =  z  ->  ( ( A  =  [ <. x ,  y >. ] R  ->  ps )  <->  ( A  =  [ z ] R  ->  ps ) ) )
6 ecoptocl.3 . . . . . 6  |-  ( ( x  e.  B  /\  y  e.  C )  ->  ph )
7 ecoptocl.2 . . . . . . 7  |-  ( [
<. x ,  y >. ] R  =  A  ->  ( ph  <->  ps )
)
87eqcoms 2208 . . . . . 6  |-  ( A  =  [ <. x ,  y >. ] R  ->  ( ph  <->  ps )
)
96, 8syl5ibcom 155 . . . . 5  |-  ( ( x  e.  B  /\  y  e.  C )  ->  ( A  =  [ <. x ,  y >. ] R  ->  ps )
)
102, 5, 9optocl 4751 . . . 4  |-  ( z  e.  ( B  X.  C )  ->  ( A  =  [ z ] R  ->  ps )
)
1110rexlimiv 2617 . . 3  |-  ( E. z  e.  ( B  X.  C ) A  =  [ z ] R  ->  ps )
121, 11syl 14 . 2  |-  ( A  e.  ( ( B  X.  C ) /. R )  ->  ps )
13 ecoptocl.1 . 2  |-  S  =  ( ( B  X.  C ) /. R
)
1412, 13eleq2s 2300 1  |-  ( A  e.  S  ->  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373    e. wcel 2176   E.wrex 2485   <.cop 3636    X. cxp 4673   [cec 6618   /.cqs 6619
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 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-br 4045  df-opab 4106  df-xp 4681  df-cnv 4683  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-ec 6622  df-qs 6626
This theorem is referenced by:  2ecoptocl  6710  3ecoptocl  6711  mulidnq  7502  recexnq  7503  ltsonq  7511  distrnq0  7572  addassnq0  7575  ltposr  7876  0idsr  7880  1idsr  7881  00sr  7882  recexgt0sr  7886  archsr  7895  srpospr  7896  map2psrprg  7918
  Copyright terms: Public domain W3C validator