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

Theorem mpoxopoveq 6405
Description: Value of an operation given by a maps-to rule, where the first argument is a pair and the base set of the second argument is the first component of the first argument. (Contributed by Alexander van der Vekens, 11-Oct-2017.)
Hypothesis
Ref Expression
mpoxopoveq.f  |-  F  =  ( x  e.  _V ,  y  e.  ( 1st `  x )  |->  { n  e.  ( 1st `  x )  |  ph } )
Assertion
Ref Expression
mpoxopoveq  |-  ( ( ( V  e.  X  /\  W  e.  Y
)  /\  K  e.  V )  ->  ( <. V ,  W >. F K )  =  {
n  e.  V  |  [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph }
)
Distinct variable groups:    n, K, x, y    n, V, x, y    n, W, x, y    n, X, x, y    n, Y, x, y
Allowed substitution hints:    ph( x, y, n)    F( x, y, n)

Proof of Theorem mpoxopoveq
StepHypRef Expression
1 mpoxopoveq.f . . 3  |-  F  =  ( x  e.  _V ,  y  e.  ( 1st `  x )  |->  { n  e.  ( 1st `  x )  |  ph } )
21a1i 9 . 2  |-  ( ( ( V  e.  X  /\  W  e.  Y
)  /\  K  e.  V )  ->  F  =  ( x  e. 
_V ,  y  e.  ( 1st `  x
)  |->  { n  e.  ( 1st `  x
)  |  ph }
) )
3 fveq2 5639 . . . . 5  |-  ( x  =  <. V ,  W >.  ->  ( 1st `  x
)  =  ( 1st `  <. V ,  W >. ) )
4 op1stg 6312 . . . . . 6  |-  ( ( V  e.  X  /\  W  e.  Y )  ->  ( 1st `  <. V ,  W >. )  =  V )
54adantr 276 . . . . 5  |-  ( ( ( V  e.  X  /\  W  e.  Y
)  /\  K  e.  V )  ->  ( 1st `  <. V ,  W >. )  =  V )
63, 5sylan9eqr 2286 . . . 4  |-  ( ( ( ( V  e.  X  /\  W  e.  Y )  /\  K  e.  V )  /\  x  =  <. V ,  W >. )  ->  ( 1st `  x )  =  V )
76adantrr 479 . . 3  |-  ( ( ( ( V  e.  X  /\  W  e.  Y )  /\  K  e.  V )  /\  (
x  =  <. V ,  W >.  /\  y  =  K ) )  -> 
( 1st `  x
)  =  V )
8 sbceq1a 3041 . . . . . 6  |-  ( y  =  K  ->  ( ph 
<-> 
[. K  /  y ]. ph ) )
98adantl 277 . . . . 5  |-  ( ( x  =  <. V ,  W >.  /\  y  =  K )  ->  ( ph 
<-> 
[. K  /  y ]. ph ) )
109adantl 277 . . . 4  |-  ( ( ( ( V  e.  X  /\  W  e.  Y )  /\  K  e.  V )  /\  (
x  =  <. V ,  W >.  /\  y  =  K ) )  -> 
( ph  <->  [. K  /  y ]. ph ) )
11 sbceq1a 3041 . . . . . 6  |-  ( x  =  <. V ,  W >.  ->  ( [. K  /  y ]. ph  <->  [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph ) )
1211adantr 276 . . . . 5  |-  ( ( x  =  <. V ,  W >.  /\  y  =  K )  ->  ( [. K  /  y ]. ph  <->  [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph )
)
1312adantl 277 . . . 4  |-  ( ( ( ( V  e.  X  /\  W  e.  Y )  /\  K  e.  V )  /\  (
x  =  <. V ,  W >.  /\  y  =  K ) )  -> 
( [. K  /  y ]. ph  <->  [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph )
)
1410, 13bitrd 188 . . 3  |-  ( ( ( ( V  e.  X  /\  W  e.  Y )  /\  K  e.  V )  /\  (
x  =  <. V ,  W >.  /\  y  =  K ) )  -> 
( ph  <->  [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph )
)
157, 14rabeqbidv 2797 . 2  |-  ( ( ( ( V  e.  X  /\  W  e.  Y )  /\  K  e.  V )  /\  (
x  =  <. V ,  W >.  /\  y  =  K ) )  ->  { n  e.  ( 1st `  x )  | 
ph }  =  {
n  e.  V  |  [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph }
)
16 opexg 4320 . . 3  |-  ( ( V  e.  X  /\  W  e.  Y )  -> 
<. V ,  W >.  e. 
_V )
1716adantr 276 . 2  |-  ( ( ( V  e.  X  /\  W  e.  Y
)  /\  K  e.  V )  ->  <. V ,  W >.  e.  _V )
18 simpr 110 . 2  |-  ( ( ( V  e.  X  /\  W  e.  Y
)  /\  K  e.  V )  ->  K  e.  V )
19 rabexg 4233 . . 3  |-  ( V  e.  X  ->  { n  e.  V  |  [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph }  e.  _V )
2019ad2antrr 488 . 2  |-  ( ( ( V  e.  X  /\  W  e.  Y
)  /\  K  e.  V )  ->  { n  e.  V  |  [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph }  e.  _V )
21 equid 1749 . . 3  |-  z  =  z
22 nfvd 1577 . . 3  |-  ( z  =  z  ->  F/ x ( ( V  e.  X  /\  W  e.  Y )  /\  K  e.  V ) )
2321, 22ax-mp 5 . 2  |-  F/ x
( ( V  e.  X  /\  W  e.  Y )  /\  K  e.  V )
24 nfvd 1577 . . 3  |-  ( z  =  z  ->  F/ y ( ( V  e.  X  /\  W  e.  Y )  /\  K  e.  V ) )
2521, 24ax-mp 5 . 2  |-  F/ y ( ( V  e.  X  /\  W  e.  Y )  /\  K  e.  V )
26 nfcv 2374 . 2  |-  F/_ y <. V ,  W >.
27 nfcv 2374 . 2  |-  F/_ x K
28 nfsbc1v 3050 . . 3  |-  F/ x [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph
29 nfcv 2374 . . 3  |-  F/_ x V
3028, 29nfrabw 2714 . 2  |-  F/_ x { n  e.  V  |  [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph }
31 nfsbc1v 3050 . . . 4  |-  F/ y
[. K  /  y ]. ph
3226, 31nfsbc 3052 . . 3  |-  F/ y
[. <. V ,  W >.  /  x ]. [. K  /  y ]. ph
33 nfcv 2374 . . 3  |-  F/_ y V
3432, 33nfrabw 2714 . 2  |-  F/_ y { n  e.  V  |  [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph }
352, 15, 6, 17, 18, 20, 23, 25, 26, 27, 30, 34ovmpodxf 6146 1  |-  ( ( ( V  e.  X  /\  W  e.  Y
)  /\  K  e.  V )  ->  ( <. V ,  W >. F K )  =  {
n  e.  V  |  [. <. V ,  W >.  /  x ]. [. K  /  y ]. ph }
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397   F/wnf 1508    e. wcel 2202   {crab 2514   _Vcvv 2802   [.wsbc 3031   <.cop 3672   ` cfv 5326  (class class class)co 6017    e. cmpo 6019   1stc1st 6300
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-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-iota 5286  df-fun 5328  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302
This theorem is referenced by:  mpoxopovel  6406
  Copyright terms: Public domain W3C validator