NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  dffun6f Unicode version

Theorem dffun6f 5124
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.) (Revised by Scott Fenton, 16-Apr-2021.)
Hypotheses
Ref Expression
dffun6f.1  F/_
dffun6f.2  F/_
Assertion
Ref Expression
dffun6f
Distinct variable group:   ,
Allowed substitution hints:   (,)

Proof of Theorem dffun6f
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dffun3 5121 . 2
2 nfcv 2490 . . . . . 6  F/_
3 dffun6f.2 . . . . . 6  F/_
4 nfcv 2490 . . . . . 6  F/_
52, 3, 4nfbr 4684 . . . . 5  F/
6 nfv 1619 . . . . 5  F/
7 breq2 4644 . . . . 5
85, 6, 7cbvmo 2241 . . . 4
98albii 1566 . . 3
10 nfv 1619 . . . . 5  F/
1110mo2 2233 . . . 4
1211albii 1566 . . 3
13 nfcv 2490 . . . . . 6  F/_
14 dffun6f.1 . . . . . 6  F/_
15 nfcv 2490 . . . . . 6  F/_
1613, 14, 15nfbr 4684 . . . . 5  F/
1716nfmo 2221 . . . 4  F/
18 nfv 1619 . . . 4  F/
19 breq1 4643 . . . . 5
2019mobidv 2239 . . . 4
2117, 18, 20cbval 1984 . . 3
229, 12, 213bitr3ri 267 . 2
231, 22bitr4i 243 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176  wal 1540  wex 1541  wmo 2205   F/_wnfc 2477   class class class wbr 4640   wfun 4776
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-reu 2622  df-rmo 2623  df-rab 2624  df-v 2862  df-sbc 3048  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-pss 3262  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-iota 4340  df-0c 4378  df-addc 4379  df-nnc 4380  df-fin 4381  df-lefin 4441  df-ltfin 4442  df-ncfin 4443  df-tfin 4444  df-evenfin 4445  df-oddfin 4446  df-sfin 4447  df-spfin 4448  df-phi 4566  df-op 4567  df-proj1 4568  df-proj2 4569  df-opab 4624  df-br 4641  df-co 4727  df-id 4768  df-cnv 4786  df-fun 4790
This theorem is referenced by:  dffun6  5125  funopab  5140
  Copyright terms: Public domain W3C validator