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

Theorem dff3im 5844
Description: Property of a mapping. (Contributed by Jim Kingdon, 4-Jan-2019.)
Assertion
Ref Expression
dff3im  |-  ( F : A --> B  -> 
( F  C_  ( A  X.  B )  /\  A. x  e.  A  E! y  x F y ) )
Distinct variable groups:    x, y, A   
x, B, y    x, F, y

Proof of Theorem dff3im
StepHypRef Expression
1 fssxp 5550 . 2  |-  ( F : A --> B  ->  F  C_  ( A  X.  B ) )
2 ffun 5531 . . . . . . . 8  |-  ( F : A --> B  ->  Fun  F )
32adantr 276 . . . . . . 7  |-  ( ( F : A --> B  /\  x  e.  A )  ->  Fun  F )
4 fdm 5534 . . . . . . . . 9  |-  ( F : A --> B  ->  dom  F  =  A )
54eleq2d 2308 . . . . . . . 8  |-  ( F : A --> B  -> 
( x  e.  dom  F  <-> 
x  e.  A ) )
65biimpar 297 . . . . . . 7  |-  ( ( F : A --> B  /\  x  e.  A )  ->  x  e.  dom  F
)
7 funfvop 5812 . . . . . . 7  |-  ( ( Fun  F  /\  x  e.  dom  F )  ->  <. x ,  ( F `
 x ) >.  e.  F )
83, 6, 7syl2anc 415 . . . . . 6  |-  ( ( F : A --> B  /\  x  e.  A )  -> 
<. x ,  ( F `
 x ) >.  e.  F )
9 df-br 4126 . . . . . 6  |-  ( x F ( F `  x )  <->  <. x ,  ( F `  x
) >.  e.  F )
108, 9sylibr 134 . . . . 5  |-  ( ( F : A --> B  /\  x  e.  A )  ->  x F ( F `
 x ) )
11 funfvex 5707 . . . . . . 7  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( F `  x
)  e.  _V )
12 breq2 4129 . . . . . . . 8  |-  ( y  =  ( F `  x )  ->  (
x F y  <->  x F
( F `  x
) ) )
1312spcegv 2913 . . . . . . 7  |-  ( ( F `  x )  e.  _V  ->  (
x F ( F `
 x )  ->  E. y  x F
y ) )
1411, 13syl 14 . . . . . 6  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( x F ( F `  x )  ->  E. y  x F y ) )
153, 6, 14syl2anc 415 . . . . 5  |-  ( ( F : A --> B  /\  x  e.  A )  ->  ( x F ( F `  x )  ->  E. y  x F y ) )
1610, 15mpd 13 . . . 4  |-  ( ( F : A --> B  /\  x  e.  A )  ->  E. y  x F y )
17 funmo 5387 . . . . . 6  |-  ( Fun 
F  ->  E* y  x F y )
182, 17syl 14 . . . . 5  |-  ( F : A --> B  ->  E* y  x F
y )
1918adantr 276 . . . 4  |-  ( ( F : A --> B  /\  x  e.  A )  ->  E* y  x F y )
20 eu5 2134 . . . 4  |-  ( E! y  x F y  <-> 
( E. y  x F y  /\  E* y  x F y ) )
2116, 19, 20sylanbrc 421 . . 3  |-  ( ( F : A --> B  /\  x  e.  A )  ->  E! y  x F y )
2221ralrimiva 2623 . 2  |-  ( F : A --> B  ->  A. x  e.  A  E! y  x F
y )
231, 22jca 306 1  |-  ( F : A --> B  -> 
( F  C_  ( A  X.  B )  /\  A. x  e.  A  E! y  x F y ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   E.wex 1545   E!weu 2086   E*wmo 2087    e. wcel 2209   A.wral 2528   _Vcvv 2821    C_ wss 3220   <.cop 3708   class class class wbr 4125    X. cxp 4767   dom cdm 4769   Fun wfun 5366   -->wf 5368   ` cfv 5372
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-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fv 5380
This theorem is referenced by:  dff4im  5845
  Copyright terms: Public domain W3C validator