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

Theorem dffun6f 5228
Description: Definition of function, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 9-Mar-1995.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
dffun6f.1  |-  F/_ x A
dffun6f.2  |-  F/_ y A
Assertion
Ref Expression
dffun6f  |-  ( Fun 
A  <->  ( Rel  A  /\  A. x E* y  x A y ) )
Distinct variable group:    x, y
Allowed substitution hints:    A( x, y)

Proof of Theorem dffun6f
Dummy variables  w  v  u are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dffun2 5225 . 2  |-  ( Fun 
A  <->  ( Rel  A  /\  A. w A. v A. u ( ( w A v  /\  w A u )  -> 
v  =  u ) ) )
2 nfcv 2319 . . . . . . 7  |-  F/_ y
w
3 dffun6f.2 . . . . . . 7  |-  F/_ y A
4 nfcv 2319 . . . . . . 7  |-  F/_ y
v
52, 3, 4nfbr 4048 . . . . . 6  |-  F/ y  w A v
6 nfv 1528 . . . . . 6  |-  F/ v  w A y
7 breq2 4006 . . . . . 6  |-  ( v  =  y  ->  (
w A v  <->  w A
y ) )
85, 6, 7cbvmo 2066 . . . . 5  |-  ( E* v  w A v  <->  E* y  w A
y )
98albii 1470 . . . 4  |-  ( A. w E* v  w A v  <->  A. w E* y  w A y )
10 breq2 4006 . . . . . 6  |-  ( v  =  u  ->  (
w A v  <->  w A u ) )
1110mo4 2087 . . . . 5  |-  ( E* v  w A v  <->  A. v A. u ( ( w A v  /\  w A u )  ->  v  =  u ) )
1211albii 1470 . . . 4  |-  ( A. w E* v  w A v  <->  A. w A. v A. u ( ( w A v  /\  w A u )  -> 
v  =  u ) )
13 nfcv 2319 . . . . . . 7  |-  F/_ x w
14 dffun6f.1 . . . . . . 7  |-  F/_ x A
15 nfcv 2319 . . . . . . 7  |-  F/_ x
y
1613, 14, 15nfbr 4048 . . . . . 6  |-  F/ x  w A y
1716nfmo 2046 . . . . 5  |-  F/ x E* y  w A
y
18 nfv 1528 . . . . 5  |-  F/ w E* y  x A
y
19 breq1 4005 . . . . . 6  |-  ( w  =  x  ->  (
w A y  <->  x A
y ) )
2019mobidv 2062 . . . . 5  |-  ( w  =  x  ->  ( E* y  w A
y  <->  E* y  x A y ) )
2117, 18, 20cbval 1754 . . . 4  |-  ( A. w E* y  w A y  <->  A. x E* y  x A y )
229, 12, 213bitr3ri 211 . . 3  |-  ( A. x E* y  x A y  <->  A. w A. v A. u ( ( w A v  /\  w A u )  -> 
v  =  u ) )
2322anbi2i 457 . 2  |-  ( ( Rel  A  /\  A. x E* y  x A y )  <->  ( Rel  A  /\  A. w A. v A. u ( ( w A v  /\  w A u )  -> 
v  =  u ) ) )
241, 23bitr4i 187 1  |-  ( Fun 
A  <->  ( Rel  A  /\  A. x E* y  x A y ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1351   E*wmo 2027   F/_wnfc 2306   class class class wbr 4002   Rel wrel 4630   Fun wfun 5209
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4120  ax-pow 4173  ax-pr 4208
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-br 4003  df-opab 4064  df-id 4292  df-cnv 4633  df-co 4634  df-fun 5217
This theorem is referenced by:  dffun6  5229  dffun4f  5231  funopab  5250
  Copyright terms: Public domain W3C validator