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

Theorem oprabex3 5995
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 4624 . 2  |-  ( H  X.  H )  e. 
_V
3 moeq 2832 . . . . . 6  |-  E* z 
z  =  R
43mosubop 4575 . . . . 5  |-  E* z E. u E. f ( y  =  <. u ,  f >.  /\  z  =  R )
54mosubop 4575 . . . 4  |-  E* z E. w E. v ( x  =  <. w ,  v >.  /\  E. u E. f ( y  =  <. u ,  f
>.  /\  z  =  R ) )
6 anass 398 . . . . . . . 8  |-  ( ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  R )  <->  ( x  =  <. w ,  v
>.  /\  ( y  = 
<. u ,  f >.  /\  z  =  R
) ) )
762exbii 1570 . . . . . . 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 1865 . . . . . . 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 183 . . . . . 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 1570 . . . . 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 2014 . . . 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 145 . . 3  |-  E* z E. w E. v E. u E. f ( ( x  =  <. w ,  v >.  /\  y  =  <. u ,  f
>. )  /\  z  =  R )
1312a1i 9 . 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 5994 1  |-  F  e. 
_V
Colors of variables: wff set class
Syntax hints:    /\ wa 103    = wceq 1316   E.wex 1453    e. wcel 1465   E*wmo 1978   _Vcvv 2660   <.cop 3500    X. cxp 4507   {coprab 5743
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 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-13 1476  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-coll 4013  ax-sep 4016  ax-pow 4068  ax-pr 4101  ax-un 4325
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rex 2399  df-reu 2400  df-rab 2402  df-v 2662  df-sbc 2883  df-csb 2976  df-un 3045  df-in 3047  df-ss 3054  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-uni 3707  df-iun 3785  df-br 3900  df-opab 3960  df-mpt 3961  df-id 4185  df-xp 4515  df-rel 4516  df-cnv 4517  df-co 4518  df-dm 4519  df-rn 4520  df-res 4521  df-ima 4522  df-iota 5058  df-fun 5095  df-fn 5096  df-f 5097  df-f1 5098  df-fo 5099  df-f1o 5100  df-fv 5101  df-oprab 5746
This theorem is referenced by:  addvalex  7620
  Copyright terms: Public domain W3C validator