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

Theorem ovmptss 6862
Description: If all the values of the mapping are subsets of a class  X, then so is any evaluation of the mapping. (Contributed by Mario Carneiro, 24-Dec-2016.)
Hypothesis
Ref Expression
ovmptss.1  |-  F  =  ( x  e.  A ,  y  e.  B  |->  C )
Assertion
Ref Expression
ovmptss  |-  ( A. x  e.  A  A. y  e.  B  C  C_  X  ->  ( E F G )  C_  X
)
Distinct variable groups:    x, y, A    y, B    x, X, y
Allowed substitution hints:    B( x)    C( x, y)    E( x, y)    F( x, y)    G( x, y)

Proof of Theorem ovmptss
Dummy variables  v  u  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ovmptss.1 . . . 4  |-  F  =  ( x  e.  A ,  y  e.  B  |->  C )
2 mpt2mptsx 6844 . . . 4  |-  ( x  e.  A ,  y  e.  B  |->  C )  =  ( z  e. 
U_ x  e.  A  ( { x }  X.  B )  |->  [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  /  y ]_ C )
31, 2eqtri 2470 . . 3  |-  F  =  ( z  e.  U_ x  e.  A  ( { x }  X.  B )  |->  [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  /  y ]_ C )
43fvmptss 5945 . 2  |-  ( A. z  e.  U_  x  e.  A  ( { x }  X.  B ) [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  / 
y ]_ C  C_  X  ->  ( F `  <. E ,  G >. )  C_  X )
5 vex 3096 . . . . . . . 8  |-  u  e. 
_V
6 vex 3096 . . . . . . . 8  |-  v  e. 
_V
75, 6op1std 6791 . . . . . . 7  |-  ( z  =  <. u ,  v
>.  ->  ( 1st `  z
)  =  u )
87csbeq1d 3424 . . . . . 6  |-  ( z  =  <. u ,  v
>.  ->  [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C  =  [_ u  /  x ]_ [_ ( 2nd `  z )  /  y ]_ C )
95, 6op2ndd 6792 . . . . . . . 8  |-  ( z  =  <. u ,  v
>.  ->  ( 2nd `  z
)  =  v )
109csbeq1d 3424 . . . . . . 7  |-  ( z  =  <. u ,  v
>.  ->  [_ ( 2nd `  z
)  /  y ]_ C  =  [_ v  / 
y ]_ C )
1110csbeq2dv 3817 . . . . . 6  |-  ( z  =  <. u ,  v
>.  ->  [_ u  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C  =  [_ u  /  x ]_ [_ v  / 
y ]_ C )
128, 11eqtrd 2482 . . . . 5  |-  ( z  =  <. u ,  v
>.  ->  [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C  =  [_ u  /  x ]_ [_ v  / 
y ]_ C )
1312sseq1d 3513 . . . 4  |-  ( z  =  <. u ,  v
>.  ->  ( [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  /  y ]_ C  C_  X  <->  [_ u  /  x ]_ [_ v  / 
y ]_ C  C_  X
) )
1413raliunxp 5128 . . 3  |-  ( A. z  e.  U_  u  e.  A  ( { u }  X.  [_ u  /  x ]_ B ) [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  / 
y ]_ C  C_  X  <->  A. u  e.  A  A. v  e.  [_  u  /  x ]_ B [_ u  /  x ]_ [_ v  /  y ]_ C  C_  X )
15 nfcv 2603 . . . . 5  |-  F/_ u
( { x }  X.  B )
16 nfcv 2603 . . . . . 6  |-  F/_ x { u }
17 nfcsb1v 3433 . . . . . 6  |-  F/_ x [_ u  /  x ]_ B
1816, 17nfxp 5012 . . . . 5  |-  F/_ x
( { u }  X.  [_ u  /  x ]_ B )
19 sneq 4020 . . . . . 6  |-  ( x  =  u  ->  { x }  =  { u } )
20 csbeq1a 3426 . . . . . 6  |-  ( x  =  u  ->  B  =  [_ u  /  x ]_ B )
2119, 20xpeq12d 5010 . . . . 5  |-  ( x  =  u  ->  ( { x }  X.  B )  =  ( { u }  X.  [_ u  /  x ]_ B ) )
2215, 18, 21cbviun 4348 . . . 4  |-  U_ x  e.  A  ( {
x }  X.  B
)  =  U_ u  e.  A  ( {
u }  X.  [_ u  /  x ]_ B
)
2322raleqi 3042 . . 3  |-  ( A. z  e.  U_  x  e.  A  ( { x }  X.  B ) [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  / 
y ]_ C  C_  X  <->  A. z  e.  U_  u  e.  A  ( {
u }  X.  [_ u  /  x ]_ B
) [_ ( 1st `  z
)  /  x ]_ [_ ( 2nd `  z
)  /  y ]_ C  C_  X )
24 nfv 1692 . . . 4  |-  F/ u A. y  e.  B  C  C_  X
25 nfcsb1v 3433 . . . . . 6  |-  F/_ x [_ u  /  x ]_ [_ v  /  y ]_ C
26 nfcv 2603 . . . . . 6  |-  F/_ x X
2725, 26nfss 3479 . . . . 5  |-  F/ x [_ u  /  x ]_ [_ v  /  y ]_ C  C_  X
2817, 27nfral 2827 . . . 4  |-  F/ x A. v  e.  [_  u  /  x ]_ B [_ u  /  x ]_ [_ v  /  y ]_ C  C_  X
29 nfv 1692 . . . . . 6  |-  F/ v  C  C_  X
30 nfcsb1v 3433 . . . . . . 7  |-  F/_ y [_ v  /  y ]_ C
31 nfcv 2603 . . . . . . 7  |-  F/_ y X
3230, 31nfss 3479 . . . . . 6  |-  F/ y
[_ v  /  y ]_ C  C_  X
33 csbeq1a 3426 . . . . . . 7  |-  ( y  =  v  ->  C  =  [_ v  /  y ]_ C )
3433sseq1d 3513 . . . . . 6  |-  ( y  =  v  ->  ( C  C_  X  <->  [_ v  / 
y ]_ C  C_  X
) )
3529, 32, 34cbvral 3064 . . . . 5  |-  ( A. y  e.  B  C  C_  X  <->  A. v  e.  B  [_ v  /  y ]_ C  C_  X )
36 csbeq1a 3426 . . . . . . 7  |-  ( x  =  u  ->  [_ v  /  y ]_ C  =  [_ u  /  x ]_ [_ v  /  y ]_ C )
3736sseq1d 3513 . . . . . 6  |-  ( x  =  u  ->  ( [_ v  /  y ]_ C  C_  X  <->  [_ u  /  x ]_ [_ v  / 
y ]_ C  C_  X
) )
3820, 37raleqbidv 3052 . . . . 5  |-  ( x  =  u  ->  ( A. v  e.  B  [_ v  /  y ]_ C  C_  X  <->  A. v  e.  [_  u  /  x ]_ B [_ u  /  x ]_ [_ v  / 
y ]_ C  C_  X
) )
3935, 38syl5bb 257 . . . 4  |-  ( x  =  u  ->  ( A. y  e.  B  C  C_  X  <->  A. v  e.  [_  u  /  x ]_ B [_ u  /  x ]_ [_ v  / 
y ]_ C  C_  X
) )
4024, 28, 39cbvral 3064 . . 3  |-  ( A. x  e.  A  A. y  e.  B  C  C_  X  <->  A. u  e.  A  A. v  e.  [_  u  /  x ]_ B [_ u  /  x ]_ [_ v  /  y ]_ C  C_  X )
4114, 23, 403bitr4ri 278 . 2  |-  ( A. x  e.  A  A. y  e.  B  C  C_  X  <->  A. z  e.  U_  x  e.  A  ( { x }  X.  B ) [_ ( 1st `  z )  /  x ]_ [_ ( 2nd `  z )  /  y ]_ C  C_  X )
42 df-ov 6280 . . 3  |-  ( E F G )  =  ( F `  <. E ,  G >. )
4342sseq1i 3510 . 2  |-  ( ( E F G ) 
C_  X  <->  ( F `  <. E ,  G >. )  C_  X )
444, 41, 433imtr4i 266 1  |-  ( A. x  e.  A  A. y  e.  B  C  C_  X  ->  ( E F G )  C_  X
)
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1381   A.wral 2791   [_csb 3417    C_ wss 3458   {csn 4010   <.cop 4016   U_ciun 4311    |-> cmpt 4491    X. cxp 4983   ` cfv 5574  (class class class)co 6277    |-> cmpt2 6279   1stc1st 6779   2ndc2nd 6780
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1603  ax-4 1616  ax-5 1689  ax-6 1732  ax-7 1774  ax-8 1804  ax-9 1806  ax-10 1821  ax-11 1826  ax-12 1838  ax-13 1983  ax-ext 2419  ax-sep 4554  ax-nul 4562  ax-pow 4611  ax-pr 4672  ax-un 6573
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 974  df-tru 1384  df-ex 1598  df-nf 1602  df-sb 1725  df-eu 2270  df-mo 2271  df-clab 2427  df-cleq 2433  df-clel 2436  df-nfc 2591  df-ne 2638  df-ral 2796  df-rex 2797  df-rab 2800  df-v 3095  df-sbc 3312  df-csb 3418  df-dif 3461  df-un 3463  df-in 3465  df-ss 3472  df-nul 3768  df-if 3923  df-sn 4011  df-pr 4013  df-op 4017  df-uni 4231  df-iun 4313  df-br 4434  df-opab 4492  df-mpt 4493  df-id 4781  df-xp 4991  df-rel 4992  df-cnv 4993  df-co 4994  df-dm 4995  df-rn 4996  df-res 4997  df-ima 4998  df-iota 5537  df-fun 5576  df-fv 5582  df-ov 6280  df-oprab 6281  df-mpt2 6282  df-1st 6781  df-2nd 6782
This theorem is referenced by:  relmpt2opab  6863  relxpchom  15319  reldv  22140
  Copyright terms: Public domain W3C validator