Theorem 3ecoptocl 6771

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 1230	. . . . . 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 6769	. . . . 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 6770	. . 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 1225	1 |- ( ( A e. S /\ B e. S /\ C e. S ) -> th )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1002   = wceq 1395   e. wcel 2200   <.cop 3669   X. cxp 4717   [cec 6678   /.cqs 6679

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-xp 4725  df-cnv 4727  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-ec 6682  df-qs 6686

This theorem is referenced by:  ecovass  6791  ecoviass  6792  ecovdi  6793  ecovidi  6794  ltsonq  7585  ltanqg  7587  ltmnqg  7588  lttrsr  7949  ltsosr  7951  ltasrg  7957  mulextsr1  7968