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

Theorem nfrald 2665
 Description: Deduction version of nfral 2667. (Contributed by NM, 15-Feb-2013.) (Revised by Mario Carneiro, 7-Oct-2016.)
Hypotheses
Ref Expression
nfrald.2
nfrald.3
nfrald.4
Assertion
Ref Expression
nfrald

Proof of Theorem nfrald
StepHypRef Expression
1 df-ral 2619 . 2
2 nfrald.2 . . 3
3 nfcvf 2511 . . . . . 6
43adantl 452 . . . . 5
5 nfrald.3 . . . . . 6
65adantr 451 . . . . 5
74, 6nfeld 2504 . . . 4
8 nfrald.4 . . . . 5
98adantr 451 . . . 4
107, 9nfimd 1808 . . 3
112, 10nfald2 1972 . 2
121, 11nfxfrd 1571 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4   wa 358  wal 1540  wnf 1544   wceq 1642   wcel 1710  wnfc 2476  wral 2614 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-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ral 2619 This theorem is referenced by:  nfrexd  2666  nfral  2667
 Copyright terms: Public domain W3C validator