Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfdmf Unicode version

Theorem dfdmf 5201
 Description: Definition of domain, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 8-Mar-1995.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
dfdmf.1
dfdmf.2
Assertion
Ref Expression
dfdmf
Distinct variable group:   ,

Proof of Theorem dfdmf
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-dm 5014 . 2
2 nfcv 2619 . . . . 5
3 dfdmf.2 . . . . 5
4 nfcv 2619 . . . . 5
52, 3, 4nfbr 4496 . . . 4
6 nfv 1707 . . . 4
7 breq2 4456 . . . 4
85, 6, 7cbvex 2022 . . 3
98abbii 2591 . 2
10 nfcv 2619 . . . . 5
11 dfdmf.1 . . . . 5
12 nfcv 2619 . . . . 5
1310, 11, 12nfbr 4496 . . . 4
1413nfex 1948 . . 3
15 nfv 1707 . . 3
16 breq1 4455 . . . 4
1716exbidv 1714 . . 3
1814, 15, 17cbvab 2598 . 2
191, 9, 183eqtri 2490 1
 Colors of variables: wff setvar class Syntax hints:  =wceq 1395  E.wex 1612  {cab 2442  F/_wnfc 2605   class class class wbr 4452  domcdm 5004 This theorem is referenced by:  dmopab  5218 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999  ax-ext 2435 This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1613  df-nf 1617  df-sb 1740  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-rab 2816  df-v 3111  df-dif 3478  df-un 3480  df-in 3482  df-ss 3489  df-nul 3785  df-if 3942  df-sn 4030  df-pr 4032  df-op 4036  df-br 4453  df-dm 5014
 Copyright terms: Public domain W3C validator