MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  oprabex3 Structured version   Visualization version   Unicode version

Theorem oprabex3 7157
Description: Existence of an operation class abstraction (special case). (Contributed by NM, 19-Oct-2004.)
Hypotheses
Ref Expression
oprabex3.1  |-  H  e. 
_V
oprabex3.2  |-  F  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  ( H  X.  H
)  /\  y  e.  ( H  X.  H
) )  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v
>.  /\  y  =  <. u ,  f >. )  /\  z  =  R
) ) }
Assertion
Ref Expression
oprabex3  |-  F  e. 
_V
Distinct variable groups:    x, y,
z, w, v, u, f, H    x, R, y, z
Allowed substitution hints:    R( w, v, u, f)    F( x, y, z, w, v, u, f)

Proof of Theorem oprabex3
StepHypRef Expression
1 oprabex3.1 . . 3  |-  H  e. 
_V
21, 1xpex 6962 . 2  |-  ( H  X.  H )  e. 
_V
3 moeq 3382 . . . . . 6  |-  E* z 
z  =  R
43mosubop 4973 . . . . 5  |-  E* z E. u E. f ( y  =  <. u ,  f >.  /\  z  =  R )
54mosubop 4973 . . . 4  |-  E* z E. w E. v ( x  =  <. w ,  v >.  /\  E. u E. f ( y  =  <. u ,  f
>.  /\  z  =  R ) )
6 anass 681 . . . . . . . 8  |-  ( ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  R )  <->  ( x  =  <. w ,  v
>.  /\  ( y  = 
<. u ,  f >.  /\  z  =  R
) ) )
762exbii 1775 . . . . . . 7  |-  ( E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  R )  <->  E. u E. f ( x  = 
<. w ,  v >.  /\  ( y  =  <. u ,  f >.  /\  z  =  R ) ) )
8 19.42vv 1920 . . . . . . 7  |-  ( E. u E. f ( x  =  <. w ,  v >.  /\  (
y  =  <. u ,  f >.  /\  z  =  R ) )  <->  ( x  =  <. w ,  v
>.  /\  E. u E. f ( y  = 
<. u ,  f >.  /\  z  =  R
) ) )
97, 8bitri 264 . . . . . 6  |-  ( E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  R )  <->  ( x  =  <. w ,  v
>.  /\  E. u E. f ( y  = 
<. u ,  f >.  /\  z  =  R
) ) )
1092exbii 1775 . . . . 5  |-  ( E. w E. v E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  R )  <->  E. w E. v ( x  = 
<. w ,  v >.  /\  E. u E. f
( y  =  <. u ,  f >.  /\  z  =  R ) ) )
1110mobii 2493 . . . 4  |-  ( E* z E. w E. v E. u E. f
( ( x  = 
<. w ,  v >.  /\  y  =  <. u ,  f >. )  /\  z  =  R
)  <->  E* z E. w E. v ( x  = 
<. w ,  v >.  /\  E. u E. f
( y  =  <. u ,  f >.  /\  z  =  R ) ) )
125, 11mpbir 221 . . 3  |-  E* z E. w E. v E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  R )
1312a1i 11 . 2  |-  ( ( x  e.  ( H  X.  H )  /\  y  e.  ( H  X.  H ) )  ->  E* z E. w E. v E. u E. f
( ( x  = 
<. w ,  v >.  /\  y  =  <. u ,  f >. )  /\  z  =  R
) )
14 oprabex3.2 . 2  |-  F  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  ( H  X.  H
)  /\  y  e.  ( H  X.  H
) )  /\  E. w E. v E. u E. f ( ( x  =  <. w ,  v
>.  /\  y  =  <. u ,  f >. )  /\  z  =  R
) ) }
152, 2, 13, 14oprabex 7156 1  |-  F  e. 
_V
Colors of variables: wff setvar class
Syntax hints:    /\ wa 384    = wceq 1483   E.wex 1704    e. wcel 1990   E*wmo 2471   _Vcvv 3200   <.cop 4183    X. cxp 5112   {coprab 6651
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-oprab 6654
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator