Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rnmpt2ss Structured version   Visualization version   Unicode version

Theorem rnmpt2ss 29473
Description: The range of an operation given by the "maps to" notation as a subset. (Contributed by Thierry Arnoux, 23-May-2017.)
Hypothesis
Ref Expression
rnmpt2ss.1  |-  F  =  ( x  e.  A ,  y  e.  B  |->  C )
Assertion
Ref Expression
rnmpt2ss  |-  ( A. x  e.  A  A. y  e.  B  C  e.  D  ->  ran  F  C_  D )
Distinct variable groups:    y, A    x, y, D
Allowed substitution hints:    A( x)    B( x, y)    C( x, y)    F( x, y)

Proof of Theorem rnmpt2ss
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 rnmpt2ss.1 . . . . 5  |-  F  =  ( x  e.  A ,  y  e.  B  |->  C )
21rnmpt2 6770 . . . 4  |-  ran  F  =  { z  |  E. x  e.  A  E. y  e.  B  z  =  C }
32abeq2i 2735 . . 3  |-  ( z  e.  ran  F  <->  E. x  e.  A  E. y  e.  B  z  =  C )
4 simpl 473 . . . . . 6  |-  ( ( A. x  e.  A  A. y  e.  B  C  e.  D  /\  E. x  e.  A  E. y  e.  B  z  =  C )  ->  A. x  e.  A  A. y  e.  B  C  e.  D )
5 simpr 477 . . . . . 6  |-  ( ( A. x  e.  A  A. y  e.  B  C  e.  D  /\  E. x  e.  A  E. y  e.  B  z  =  C )  ->  E. x  e.  A  E. y  e.  B  z  =  C )
64, 5r19.29d2r 3080 . . . . 5  |-  ( ( A. x  e.  A  A. y  e.  B  C  e.  D  /\  E. x  e.  A  E. y  e.  B  z  =  C )  ->  E. x  e.  A  E. y  e.  B  ( C  e.  D  /\  z  =  C ) )
7 eleq1 2689 . . . . . . . 8  |-  ( z  =  C  ->  (
z  e.  D  <->  C  e.  D ) )
87biimparc 504 . . . . . . 7  |-  ( ( C  e.  D  /\  z  =  C )  ->  z  e.  D )
98a1i 11 . . . . . 6  |-  ( ( x  e.  A  /\  y  e.  B )  ->  ( ( C  e.  D  /\  z  =  C )  ->  z  e.  D ) )
109rexlimivv 3036 . . . . 5  |-  ( E. x  e.  A  E. y  e.  B  ( C  e.  D  /\  z  =  C )  ->  z  e.  D )
116, 10syl 17 . . . 4  |-  ( ( A. x  e.  A  A. y  e.  B  C  e.  D  /\  E. x  e.  A  E. y  e.  B  z  =  C )  ->  z  e.  D )
1211ex 450 . . 3  |-  ( A. x  e.  A  A. y  e.  B  C  e.  D  ->  ( E. x  e.  A  E. y  e.  B  z  =  C  ->  z  e.  D ) )
133, 12syl5bi 232 . 2  |-  ( A. x  e.  A  A. y  e.  B  C  e.  D  ->  ( z  e.  ran  F  -> 
z  e.  D ) )
1413ssrdv 3609 1  |-  ( A. x  e.  A  A. y  e.  B  C  e.  D  ->  ran  F  C_  D )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   A.wral 2912   E.wrex 2913    C_ wss 3574   ran crn 5115    |-> cmpt2 6652
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-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
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-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-cnv 5122  df-dm 5124  df-rn 5125  df-oprab 6654  df-mpt2 6655
This theorem is referenced by:  raddcn  29975  br2base  30331  sxbrsiga  30352
  Copyright terms: Public domain W3C validator