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

Theorem 3ecoptocl 6590
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 229 . . . 4  |-  ( [
<. z ,  w >. ] R  =  B  -> 
( ( A  e.  S  ->  ps )  <->  ( A  e.  S  ->  ch ) ) )
4 3ecoptocl.4 . . . . 5  |-  ( [
<. v ,  u >. ] R  =  C  -> 
( ch  <->  th )
)
54imbi2d 229 . . . 4  |-  ( [
<. v ,  u >. ] R  =  C  -> 
( ( A  e.  S  ->  ch )  <->  ( A  e.  S  ->  th ) ) )
6 3ecoptocl.2 . . . . . . 7  |-  ( [
<. x ,  y >. ] R  =  A  ->  ( ph  <->  ps )
)
76imbi2d 229 . . . . . 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 1196 . . . . . 6  |-  ( ( x  e.  D  /\  y  e.  D )  ->  ( ( ( z  e.  D  /\  w  e.  D )  /\  (
v  e.  D  /\  u  e.  D )
)  ->  ph ) )
101, 7, 9ecoptocl 6588 . . . . 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 6589 . . 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 1191 1  |-  ( ( A  e.  S  /\  B  e.  S  /\  C  e.  S )  ->  th )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 968    = wceq 1343    e. wcel 2136   <.cop 3579    X. cxp 4602   [cec 6499   /.cqs 6500
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 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983  df-opab 4044  df-xp 4610  df-cnv 4612  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-ec 6503  df-qs 6507
This theorem is referenced by:  ecovass  6610  ecoviass  6611  ecovdi  6612  ecovidi  6613  ltsonq  7339  ltanqg  7341  ltmnqg  7342  lttrsr  7703  ltsosr  7705  ltasrg  7711  mulextsr1  7722
  Copyright terms: Public domain W3C validator