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

Theorem ov6g 6152
Description: The value of an operation class abstraction. Special case. (Contributed by NM, 13-Nov-2006.)
Hypotheses
Ref Expression
ov6g.1  |-  ( <.
x ,  y >.  =  <. A ,  B >.  ->  R  =  S )
ov6g.2  |-  F  =  { <. <. x ,  y
>. ,  z >.  |  ( <. x ,  y
>.  e.  C  /\  z  =  R ) }
Assertion
Ref Expression
ov6g  |-  ( ( ( A  e.  G  /\  B  e.  H  /\  <. A ,  B >.  e.  C )  /\  S  e.  J )  ->  ( A F B )  =  S )
Distinct variable groups:    x, y,
z, A    x, B, y, z    x, C, y, z    z, R    x, S, y, z
Allowed substitution hints:    R( x, y)    F( x, y, z)    G( x, y, z)    H( x, y, z)    J( x, y, z)

Proof of Theorem ov6g
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 df-ov 6025 . 2  |-  ( A F B )  =  ( F `  <. A ,  B >. )
2 eqid 2389 . . . . . 6  |-  S  =  S
3 biidd 229 . . . . . . 7  |-  ( ( x  =  A  /\  y  =  B )  ->  ( S  =  S  <-> 
S  =  S ) )
43copsex2g 4387 . . . . . 6  |-  ( ( A  e.  G  /\  B  e.  H )  ->  ( E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  S  =  S )  <->  S  =  S ) )
52, 4mpbiri 225 . . . . 5  |-  ( ( A  e.  G  /\  B  e.  H )  ->  E. x E. y
( <. A ,  B >.  =  <. x ,  y
>.  /\  S  =  S ) )
653adant3 977 . . . 4  |-  ( ( A  e.  G  /\  B  e.  H  /\  <. A ,  B >.  e.  C )  ->  E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  S  =  S ) )
76adantr 452 . . 3  |-  ( ( ( A  e.  G  /\  B  e.  H  /\  <. A ,  B >.  e.  C )  /\  S  e.  J )  ->  E. x E. y
( <. A ,  B >.  =  <. x ,  y
>.  /\  S  =  S ) )
8 eqeq1 2395 . . . . . . . 8  |-  ( w  =  <. A ,  B >.  ->  ( w  = 
<. x ,  y >.  <->  <. A ,  B >.  = 
<. x ,  y >.
) )
98anbi1d 686 . . . . . . 7  |-  ( w  =  <. A ,  B >.  ->  ( ( w  =  <. x ,  y
>.  /\  z  =  R )  <->  ( <. A ,  B >.  =  <. x ,  y >.  /\  z  =  R ) ) )
10 ov6g.1 . . . . . . . . . 10  |-  ( <.
x ,  y >.  =  <. A ,  B >.  ->  R  =  S )
1110eqeq2d 2400 . . . . . . . . 9  |-  ( <.
x ,  y >.  =  <. A ,  B >.  ->  ( z  =  R  <->  z  =  S ) )
1211eqcoms 2392 . . . . . . . 8  |-  ( <. A ,  B >.  = 
<. x ,  y >.  ->  ( z  =  R  <-> 
z  =  S ) )
1312pm5.32i 619 . . . . . . 7  |-  ( (
<. A ,  B >.  = 
<. x ,  y >.  /\  z  =  R
)  <->  ( <. A ,  B >.  =  <. x ,  y >.  /\  z  =  S ) )
149, 13syl6bb 253 . . . . . 6  |-  ( w  =  <. A ,  B >.  ->  ( ( w  =  <. x ,  y
>.  /\  z  =  R )  <->  ( <. A ,  B >.  =  <. x ,  y >.  /\  z  =  S ) ) )
15142exbidv 1635 . . . . 5  |-  ( w  =  <. A ,  B >.  ->  ( E. x E. y ( w  = 
<. x ,  y >.  /\  z  =  R
)  <->  E. x E. y
( <. A ,  B >.  =  <. x ,  y
>.  /\  z  =  S ) ) )
16 eqeq1 2395 . . . . . . 7  |-  ( z  =  S  ->  (
z  =  S  <->  S  =  S ) )
1716anbi2d 685 . . . . . 6  |-  ( z  =  S  ->  (
( <. A ,  B >.  =  <. x ,  y
>.  /\  z  =  S )  <->  ( <. A ,  B >.  =  <. x ,  y >.  /\  S  =  S ) ) )
18172exbidv 1635 . . . . 5  |-  ( z  =  S  ->  ( E. x E. y (
<. A ,  B >.  = 
<. x ,  y >.  /\  z  =  S
)  <->  E. x E. y
( <. A ,  B >.  =  <. x ,  y
>.  /\  S  =  S ) ) )
19 moeq 3055 . . . . . . 7  |-  E* z 
z  =  R
2019mosubop 4398 . . . . . 6  |-  E* z E. x E. y ( w  =  <. x ,  y >.  /\  z  =  R )
2120a1i 11 . . . . 5  |-  ( w  e.  C  ->  E* z E. x E. y
( w  =  <. x ,  y >.  /\  z  =  R ) )
22 ov6g.2 . . . . . 6  |-  F  =  { <. <. x ,  y
>. ,  z >.  |  ( <. x ,  y
>.  e.  C  /\  z  =  R ) }
23 dfoprab2 6062 . . . . . 6  |-  { <. <.
x ,  y >. ,  z >.  |  (
<. x ,  y >.  e.  C  /\  z  =  R ) }  =  { <. w ,  z
>.  |  E. x E. y ( w  = 
<. x ,  y >.  /\  ( <. x ,  y
>.  e.  C  /\  z  =  R ) ) }
24 eleq1 2449 . . . . . . . . . . . 12  |-  ( w  =  <. x ,  y
>.  ->  ( w  e.  C  <->  <. x ,  y
>.  e.  C ) )
2524anbi1d 686 . . . . . . . . . . 11  |-  ( w  =  <. x ,  y
>.  ->  ( ( w  e.  C  /\  z  =  R )  <->  ( <. x ,  y >.  e.  C  /\  z  =  R
) ) )
2625pm5.32i 619 . . . . . . . . . 10  |-  ( ( w  =  <. x ,  y >.  /\  (
w  e.  C  /\  z  =  R )
)  <->  ( w  = 
<. x ,  y >.  /\  ( <. x ,  y
>.  e.  C  /\  z  =  R ) ) )
27 an12 773 . . . . . . . . . 10  |-  ( ( w  =  <. x ,  y >.  /\  (
w  e.  C  /\  z  =  R )
)  <->  ( w  e.  C  /\  ( w  =  <. x ,  y
>.  /\  z  =  R ) ) )
2826, 27bitr3i 243 . . . . . . . . 9  |-  ( ( w  =  <. x ,  y >.  /\  ( <. x ,  y >.  e.  C  /\  z  =  R ) )  <->  ( w  e.  C  /\  (
w  =  <. x ,  y >.  /\  z  =  R ) ) )
29282exbii 1590 . . . . . . . 8  |-  ( E. x E. y ( w  =  <. x ,  y >.  /\  ( <. x ,  y >.  e.  C  /\  z  =  R ) )  <->  E. x E. y ( w  e.  C  /\  ( w  =  <. x ,  y
>.  /\  z  =  R ) ) )
30 19.42vv 1919 . . . . . . . 8  |-  ( E. x E. y ( w  e.  C  /\  ( w  =  <. x ,  y >.  /\  z  =  R ) )  <->  ( w  e.  C  /\  E. x E. y ( w  = 
<. x ,  y >.  /\  z  =  R
) ) )
3129, 30bitri 241 . . . . . . 7  |-  ( E. x E. y ( w  =  <. x ,  y >.  /\  ( <. x ,  y >.  e.  C  /\  z  =  R ) )  <->  ( w  e.  C  /\  E. x E. y ( w  = 
<. x ,  y >.  /\  z  =  R
) ) )
3231opabbii 4215 . . . . . 6  |-  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ( <. x ,  y >.  e.  C  /\  z  =  R
) ) }  =  { <. w ,  z
>.  |  ( w  e.  C  /\  E. x E. y ( w  = 
<. x ,  y >.  /\  z  =  R
) ) }
3322, 23, 323eqtri 2413 . . . . 5  |-  F  =  { <. w ,  z
>.  |  ( w  e.  C  /\  E. x E. y ( w  = 
<. x ,  y >.  /\  z  =  R
) ) }
3415, 18, 21, 33fvopab3ig 5744 . . . 4  |-  ( (
<. A ,  B >.  e.  C  /\  S  e.  J )  ->  ( E. x E. y (
<. A ,  B >.  = 
<. x ,  y >.  /\  S  =  S
)  ->  ( F `  <. A ,  B >. )  =  S ) )
35343ad2antl3 1121 . . 3  |-  ( ( ( A  e.  G  /\  B  e.  H  /\  <. A ,  B >.  e.  C )  /\  S  e.  J )  ->  ( E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  S  =  S )  ->  ( F `  <. A ,  B >. )  =  S ) )
367, 35mpd 15 . 2  |-  ( ( ( A  e.  G  /\  B  e.  H  /\  <. A ,  B >.  e.  C )  /\  S  e.  J )  ->  ( F `  <. A ,  B >. )  =  S )
371, 36syl5eq 2433 1  |-  ( ( ( A  e.  G  /\  B  e.  H  /\  <. A ,  B >.  e.  C )  /\  S  e.  J )  ->  ( A F B )  =  S )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359    /\ w3a 936   E.wex 1547    = wceq 1649    e. wcel 1717   E*wmo 2241   <.cop 3762   {copab 4208   ` cfv 5396  (class class class)co 6022   {coprab 6023
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2370  ax-sep 4273  ax-nul 4281  ax-pr 4346
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2244  df-mo 2245  df-clab 2376  df-cleq 2382  df-clel 2385  df-nfc 2514  df-ne 2554  df-ral 2656  df-rex 2657  df-rab 2660  df-v 2903  df-sbc 3107  df-dif 3268  df-un 3270  df-in 3272  df-ss 3279  df-nul 3574  df-if 3685  df-sn 3765  df-pr 3766  df-op 3768  df-uni 3960  df-br 4156  df-opab 4210  df-id 4441  df-xp 4826  df-rel 4827  df-cnv 4828  df-co 4829  df-dm 4830  df-iota 5360  df-fun 5398  df-fv 5404  df-ov 6025  df-oprab 6026
  Copyright terms: Public domain W3C validator