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

Theorem 3ecoptocl 6511
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 1184 . . . . . 6  |-  ( ( x  e.  D  /\  y  e.  D )  ->  ( ( ( z  e.  D  /\  w  e.  D )  /\  (
v  e.  D  /\  u  e.  D )
)  ->  ph ) )
101, 7, 9ecoptocl 6509 . . . . 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 6510 . . 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 1179 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 962    = wceq 1331    e. wcel 1480   <.cop 3525    X. cxp 4532   [cec 6420   /.cqs 6421
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-opab 3985  df-xp 4540  df-cnv 4542  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-ec 6424  df-qs 6428
This theorem is referenced by:  ecovass  6531  ecoviass  6532  ecovdi  6533  ecovidi  6534  ltsonq  7199  ltanqg  7201  ltmnqg  7202  lttrsr  7563  ltsosr  7565  ltasrg  7571  mulextsr1  7582
  Copyright terms: Public domain W3C validator