Theorem 3optocl 4853

Description: Implicit substitution of classes for ordered pairs. (Contributed by NM, 12-Mar-1995.)

Hypotheses

Ref	Expression
3optocl.1	|- R = ( D X. F )
3optocl.2	|- ( <. x , y >. = A -> ( ph <-> ps ) )
3optocl.3	|- ( <. z , w >. = B -> ( ps <-> ch ) )
3optocl.4	|- ( <. v , u >. = C -> ( ch <-> th ) )
3optocl.5	|- ( ( ( x e. D /\ y e. F ) /\ ( z e. D /\ w e. F ) /\ ( v e. D /\ u e. F ) ) -> ph )

Assertion

Ref	Expression
3optocl	|- ( ( A e. R /\ B e. R /\ C e. R ) -> 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   x, F, y, z, w, v, u   z, R, 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)   R( x, y)

Proof of Theorem 3optocl

Step	Hyp	Ref	Expression
1		3optocl.1	. . . 4 |- R = ( D X. F )
2		3optocl.4	. . . . 5 |- ( <. v , u >. = C -> ( ch <-> th ) )
3	2	imbi2d 230	. . . 4 |- ( <. v , u >. = C -> ( ( ( A e. R /\ B e. R ) -> ch ) <-> ( ( A e. R /\ B e. R ) -> th ) ) )
4		3optocl.2	. . . . . . 7 |- ( <. x , y >. = A -> ( ph <-> ps ) )
5	4	imbi2d 230	. . . . . 6 |- ( <. x , y >. = A -> ( ( ( v e. D /\ u e. F ) -> ph ) <-> ( ( v e. D /\ u e. F ) -> ps ) ) )
6		3optocl.3	. . . . . . 7 |- ( <. z , w >. = B -> ( ps <-> ch ) )
7	6	imbi2d 230	. . . . . 6 |- ( <. z , w >. = B -> ( ( ( v e. D /\ u e. F ) -> ps ) <-> ( ( v e. D /\ u e. F ) -> ch ) ) )
8		3optocl.5	. . . . . . 7 |- ( ( ( x e. D /\ y e. F ) /\ ( z e. D /\ w e. F ) /\ ( v e. D /\ u e. F ) ) -> ph )
9	8	3expia 1236	. . . . . 6 |- ( ( ( x e. D /\ y e. F ) /\ ( z e. D /\ w e. F ) ) -> ( ( v e. D /\ u e. F ) -> ph ) )
10	1, 5, 7, 9	2optocl 4852	. . . . 5 |- ( ( A e. R /\ B e. R ) -> ( ( v e. D /\ u e. F ) -> ch ) )
11	10	com12 30	. . . 4 |- ( ( v e. D /\ u e. F ) -> ( ( A e. R /\ B e. R ) -> ch ) )
12	1, 3, 11	optocl 4851	. . 3 |- ( C e. R -> ( ( A e. R /\ B e. R ) -> th ) )
13	12	impcom 125	. 2 |- ( ( ( A e. R /\ B e. R ) /\ C e. R ) -> th )
14	13	3impa 1225	1 |- ( ( A e. R /\ B e. R /\ C e. R ) -> 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

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-opab 4193  df-xp 4780

This theorem is used by:  ecopovtrn  6906  ecopovtrng  6909