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

Theorem ecoptocl 6732
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 6697 . . 3  |-  ( A  e.  ( ( B  X.  C ) /. R )  ->  E. z  e.  ( B  X.  C
) A  =  [
z ] R )
2 eqid 2207 . . . . 5  |-  ( B  X.  C )  =  ( B  X.  C
)
3 eceq1 6678 . . . . . . 7  |-  ( <.
x ,  y >.  =  z  ->  [ <. x ,  y >. ] R  =  [ z ] R
)
43eqeq2d 2219 . . . . . 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 2210 . . . . . 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 4769 . . . 4  |-  ( z  e.  ( B  X.  C )  ->  ( A  =  [ z ] R  ->  ps )
)
1110rexlimiv 2619 . . 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 2302 1  |-  ( A  e.  S  ->  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373    e. wcel 2178   E.wrex 2487   <.cop 3646    X. cxp 4691   [cec 6641   /.cqs 6642
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-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  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-br 4060  df-opab 4122  df-xp 4699  df-cnv 4701  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-ec 6645  df-qs 6649
This theorem is referenced by:  2ecoptocl  6733  3ecoptocl  6734  mulidnq  7537  recexnq  7538  ltsonq  7546  distrnq0  7607  addassnq0  7610  ltposr  7911  0idsr  7915  1idsr  7916  00sr  7917  recexgt0sr  7921  archsr  7930  srpospr  7931  map2psrprg  7953
  Copyright terms: Public domain W3C validator