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

Theorem dff3im 5792
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 5502 . 2  |-  ( F : A --> B  ->  F  C_  ( A  X.  B ) )
2 ffun 5485 . . . . . . . 8  |-  ( F : A --> B  ->  Fun  F )
32adantr 276 . . . . . . 7  |-  ( ( F : A --> B  /\  x  e.  A )  ->  Fun  F )
4 fdm 5488 . . . . . . . . 9  |-  ( F : A --> B  ->  dom  F  =  A )
54eleq2d 2301 . . . . . . . 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 5759 . . . . . . 7  |-  ( ( Fun  F  /\  x  e.  dom  F )  ->  <. x ,  ( F `
 x ) >.  e.  F )
83, 6, 7syl2anc 411 . . . . . 6  |-  ( ( F : A --> B  /\  x  e.  A )  -> 
<. x ,  ( F `
 x ) >.  e.  F )
9 df-br 4089 . . . . . 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 5656 . . . . . . 7  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( F `  x
)  e.  _V )
12 breq2 4092 . . . . . . . 8  |-  ( y  =  ( F `  x )  ->  (
x F y  <->  x F
( F `  x
) ) )
1312spcegv 2894 . . . . . . 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 411 . . . . 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 5341 . . . . . 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 2127 . . . 4  |-  ( E! y  x F y  <-> 
( E. y  x F y  /\  E* y  x F y ) )
2116, 19, 20sylanbrc 417 . . 3  |-  ( ( F : A --> B  /\  x  e.  A )  ->  E! y  x F y )
2221ralrimiva 2605 . 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 1540   E!weu 2079   E*wmo 2080    e. wcel 2202   A.wral 2510   _Vcvv 2802    C_ wss 3200   <.cop 3672   class class class wbr 4088    X. cxp 4723   dom cdm 4725   Fun wfun 5320   -->wf 5322   ` cfv 5326
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 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-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  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-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  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-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-fn 5329  df-f 5330  df-fv 5334
This theorem is referenced by:  dff4im  5793
  Copyright terms: Public domain W3C validator