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

Theorem ffnfvf 5806
Description: A function maps to a class to which all values belong. This version of ffnfv 5805 uses bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 28-Sep-2006.)
Hypotheses
Ref Expression
ffnfvf.1  |-  F/_ x A
ffnfvf.2  |-  F/_ x B
ffnfvf.3  |-  F/_ x F
Assertion
Ref Expression
ffnfvf  |-  ( F : A --> B  <->  ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B
) )

Proof of Theorem ffnfvf
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 ffnfv 5805 . 2  |-  ( F : A --> B  <->  ( F  Fn  A  /\  A. z  e.  A  ( F `  z )  e.  B
) )
2 nfcv 2374 . . . 4  |-  F/_ z A
3 ffnfvf.1 . . . 4  |-  F/_ x A
4 ffnfvf.3 . . . . . 6  |-  F/_ x F
5 nfcv 2374 . . . . . 6  |-  F/_ x
z
64, 5nffv 5649 . . . . 5  |-  F/_ x
( F `  z
)
7 ffnfvf.2 . . . . 5  |-  F/_ x B
86, 7nfel 2383 . . . 4  |-  F/ x
( F `  z
)  e.  B
9 nfv 1576 . . . 4  |-  F/ z ( F `  x
)  e.  B
10 fveq2 5639 . . . . 5  |-  ( z  =  x  ->  ( F `  z )  =  ( F `  x ) )
1110eleq1d 2300 . . . 4  |-  ( z  =  x  ->  (
( F `  z
)  e.  B  <->  ( F `  x )  e.  B
) )
122, 3, 8, 9, 11cbvralf 2758 . . 3  |-  ( A. z  e.  A  ( F `  z )  e.  B  <->  A. x  e.  A  ( F `  x )  e.  B )
1312anbi2i 457 . 2  |-  ( ( F  Fn  A  /\  A. z  e.  A  ( F `  z )  e.  B )  <->  ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B
) )
141, 13bitri 184 1  |-  ( F : A --> B  <->  ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B
) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    e. wcel 2202   F/_wnfc 2361   A.wral 2510    Fn wfn 5321   -->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-mpt 4152  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:  ixpf  6888  cc4f  7487
  Copyright terms: Public domain W3C validator