Theorem 3ecoptocl 6898

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

Step	Hyp	Ref	Expression
1		3ecoptocl.1	. . . 4 |- S = ( ( D X. D ) /. R )
2		3ecoptocl.3	. . . . 5 |- ( [ <. z , w >. ] R = B -> ( ps <-> ch ) )
3	2	imbi2d 230	. . . 4 |- ( [ <. z , w >. ] R = B -> ( ( A e. S -> ps ) <-> ( A e. S -> ch ) ) )
4		3ecoptocl.4	. . . . 5 |- ( [ <. v , u >. ] R = C -> ( ch <-> th ) )
5	4	imbi2d 230	. . . 4 |- ( [ <. v , u >. ] R = C -> ( ( A e. S -> ch ) <-> ( A e. S -> th ) ) )
6		3ecoptocl.2	. . . . . . 7 |- ( [ <. x , y >. ] R = A -> ( ph <-> ps ) )
7	6	imbi2d 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 )
9	8	3expib 1237	. . . . . 6 |- ( ( x e. D /\ y e. D ) -> ( ( ( z e. D /\ w e. D ) /\ ( v e. D /\ u e. D ) ) -> ph ) )
10	1, 7, 9	ecoptocl 6896	. . . . 5 |- ( A e. S -> ( ( ( z e. D /\ w e. D ) /\ ( v e. D /\ u e. D ) ) -> ps ) )
11	10	com12 30	. . . 4 |- ( ( ( z e. D /\ w e. D ) /\ ( v e. D /\ u e. D ) ) -> ( A e. S -> ps ) )
12	1, 3, 5, 11	2ecoptocl 6897	. . 3 |- ( ( B e. S /\ C e. S ) -> ( A e. S -> th ) )
13	12	com12 30	. 2 |- ( A e. S -> ( ( B e. S /\ C e. S ) -> th ) )
14	13	3impib 1232	1 |- ( ( A e. S /\ B e. S /\ C e. S ) -> th )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   <.cop 3712   X. cxp 4772   [cec 6805   /.cqs 6806

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-cnv 4782  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-ec 6809  df-qs 6813

This theorem is used by:  ecovass  6918  ecoviass  6919  ecovdi  6920  ecovidi  6921  ltsonq  7765  ltanqg  7767  ltmnqg  7768  lttrsr  8129  ltsosr  8131  ltasrg  8137  mulextsr1  8148