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

Theorem 3ecoptocl 6627
Description: Implicit substitution of classes for equivalence classes of ordered pairs. (Contributed by NM, 9-Aug-1995.)
Hypotheses
Ref Expression
3ecoptocl.1  |-  S  =  ( ( D  X.  D ) /. R
)
3ecoptocl.2  |-  ( [
<. x ,  y >. ] R  =  A  ->  ( ph  <->  ps )
)
3ecoptocl.3  |-  ( [
<. z ,  w >. ] R  =  B  -> 
( ps  <->  ch )
)
3ecoptocl.4  |-  ( [
<. v ,  u >. ] R  =  C  -> 
( ch  <->  th )
)
3ecoptocl.5  |-  ( ( ( x  e.  D  /\  y  e.  D
)  /\  ( z  e.  D  /\  w  e.  D )  /\  (
v  e.  D  /\  u  e.  D )
)  ->  ph )
Assertion
Ref Expression
3ecoptocl  |-  ( ( A  e.  S  /\  B  e.  S  /\  C  e.  S )  ->  th )
Distinct variable groups:    x, y, z, w, v, u, A   
z, B, w, v, u    v, C, u   
x, D, y, z, w, v, u    z, S, w, v, u    x, R, y, z, w, v, u    ps, x, y    ch, z, w    th, v, u
Allowed substitution hints:    ph( x, y, z, w, v, u)    ps( z, w, v, u)    ch( x, y, v, u)    th( x, y, z, w)    B( x, y)    C( x, y, z, w)    S( x, y)

Proof of Theorem 3ecoptocl
StepHypRef Expression
1 3ecoptocl.1 . . . 4  |-  S  =  ( ( D  X.  D ) /. R
)
2 3ecoptocl.3 . . . . 5  |-  ( [
<. z ,  w >. ] R  =  B  -> 
( ps  <->  ch )
)
32imbi2d 230 . . . 4  |-  ( [
<. z ,  w >. ] R  =  B  -> 
( ( A  e.  S  ->  ps )  <->  ( A  e.  S  ->  ch ) ) )
4 3ecoptocl.4 . . . . 5  |-  ( [
<. v ,  u >. ] R  =  C  -> 
( ch  <->  th )
)
54imbi2d 230 . . . 4  |-  ( [
<. v ,  u >. ] R  =  C  -> 
( ( A  e.  S  ->  ch )  <->  ( A  e.  S  ->  th ) ) )
6 3ecoptocl.2 . . . . . . 7  |-  ( [
<. x ,  y >. ] R  =  A  ->  ( ph  <->  ps )
)
76imbi2d 230 . . . . . 6  |-  ( [
<. x ,  y >. ] R  =  A  ->  ( ( ( ( z  e.  D  /\  w  e.  D )  /\  ( v  e.  D  /\  u  e.  D
) )  ->  ph )  <->  ( ( ( z  e.  D  /\  w  e.  D )  /\  (
v  e.  D  /\  u  e.  D )
)  ->  ps )
) )
8 3ecoptocl.5 . . . . . . 7  |-  ( ( ( x  e.  D  /\  y  e.  D
)  /\  ( z  e.  D  /\  w  e.  D )  /\  (
v  e.  D  /\  u  e.  D )
)  ->  ph )
983expib 1206 . . . . . 6  |-  ( ( x  e.  D  /\  y  e.  D )  ->  ( ( ( z  e.  D  /\  w  e.  D )  /\  (
v  e.  D  /\  u  e.  D )
)  ->  ph ) )
101, 7, 9ecoptocl 6625 . . . . 5  |-  ( A  e.  S  ->  (
( ( z  e.  D  /\  w  e.  D )  /\  (
v  e.  D  /\  u  e.  D )
)  ->  ps )
)
1110com12 30 . . . 4  |-  ( ( ( z  e.  D  /\  w  e.  D
)  /\  ( v  e.  D  /\  u  e.  D ) )  -> 
( A  e.  S  ->  ps ) )
121, 3, 5, 112ecoptocl 6626 . . 3  |-  ( ( B  e.  S  /\  C  e.  S )  ->  ( A  e.  S  ->  th ) )
1312com12 30 . 2  |-  ( A  e.  S  ->  (
( B  e.  S  /\  C  e.  S
)  ->  th )
)
14133impib 1201 1  |-  ( ( A  e.  S  /\  B  e.  S  /\  C  e.  S )  ->  th )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 978    = wceq 1353    e. wcel 2148   <.cop 3597    X. cxp 4626   [cec 6536   /.cqs 6537
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-br 4006  df-opab 4067  df-xp 4634  df-cnv 4636  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-ec 6540  df-qs 6544
This theorem is referenced by:  ecovass  6647  ecoviass  6648  ecovdi  6649  ecovidi  6650  ltsonq  7400  ltanqg  7402  ltmnqg  7403  lttrsr  7764  ltsosr  7766  ltasrg  7772  mulextsr1  7783
  Copyright terms: Public domain W3C validator