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

Theorem dminss 5197
Description: An upper bound for intersection with a domain. Theorem 40 of [Suppes] p. 66, who calls it "somewhat surprising". (Contributed by NM, 11-Aug-2004.)
Assertion
Ref Expression
dminss  |-  ( dom 
R  i^i  A )  C_  ( `' R "
( R " A
) )

Proof of Theorem dminss
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 19.8a 1643 . . . . . . 7  |-  ( ( x  e.  A  /\  x R y )  ->  E. x ( x  e.  A  /\  x R y ) )
21ancoms 268 . . . . . 6  |-  ( ( x R y  /\  x  e.  A )  ->  E. x ( x  e.  A  /\  x R y ) )
3 vex 2824 . . . . . . 7  |-  y  e. 
_V
43elima2 5127 . . . . . 6  |-  ( y  e.  ( R " A )  <->  E. x
( x  e.  A  /\  x R y ) )
52, 4sylibr 134 . . . . 5  |-  ( ( x R y  /\  x  e.  A )  ->  y  e.  ( R
" A ) )
6 simpl 109 . . . . . 6  |-  ( ( x R y  /\  x  e.  A )  ->  x R y )
7 vex 2824 . . . . . . 7  |-  x  e. 
_V
83, 7brcnv 4958 . . . . . 6  |-  ( y `' R x  <->  x R
y )
96, 8sylibr 134 . . . . 5  |-  ( ( x R y  /\  x  e.  A )  ->  y `' R x )
105, 9jca 306 . . . 4  |-  ( ( x R y  /\  x  e.  A )  ->  ( y  e.  ( R " A )  /\  y `' R x ) )
1110eximi 1653 . . 3  |-  ( E. y ( x R y  /\  x  e.  A )  ->  E. y
( y  e.  ( R " A )  /\  y `' R x ) )
127eldm 4973 . . . . 5  |-  ( x  e.  dom  R  <->  E. y  x R y )
1312anbi1i 462 . . . 4  |-  ( ( x  e.  dom  R  /\  x  e.  A
)  <->  ( E. y  x R y  /\  x  e.  A ) )
14 elin 3412 . . . 4  |-  ( x  e.  ( dom  R  i^i  A )  <->  ( x  e.  dom  R  /\  x  e.  A ) )
15 19.41v 1958 . . . 4  |-  ( E. y ( x R y  /\  x  e.  A )  <->  ( E. y  x R y  /\  x  e.  A )
)
1613, 14, 153bitr4i 212 . . 3  |-  ( x  e.  ( dom  R  i^i  A )  <->  E. y
( x R y  /\  x  e.  A
) )
177elima2 5127 . . 3  |-  ( x  e.  ( `' R " ( R " A
) )  <->  E. y
( y  e.  ( R " A )  /\  y `' R x ) )
1811, 16, 173imtr4i 201 . 2  |-  ( x  e.  ( dom  R  i^i  A )  ->  x  e.  ( `' R "
( R " A
) ) )
1918ssriv 3252 1  |-  ( dom 
R  i^i  A )  C_  ( `' R "
( R " A
) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104   E.wex 1545    e. wcel 2209    i^i cin 3219    C_ wss 3220   class class class wbr 4125   `'ccnv 4768   dom cdm 4769   "cima 4772
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-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-xp 4775  df-cnv 4777  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator