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

Theorem nfcd 2484
Description: Deduce that a class does not have free in it. (Contributed by Mario Carneiro, 11-Aug-2016.)
Hypotheses
Ref Expression
nfcd.1  F/
nfcd.2  F/
Assertion
Ref Expression
nfcd  F/_
Distinct variable groups:   ,   ,
Allowed substitution hints:   (,)   ()

Proof of Theorem nfcd
StepHypRef Expression
1 nfcd.1 . . 3  F/
2 nfcd.2 . . 3  F/
31, 2alrimi 1765 . 2  F/
4 df-nfc 2478 . 2  F/_  F/
53, 4sylibr 203 1  F/_
Colors of variables: wff setvar class
Syntax hints:   wi 4  wal 1540   F/wnf 1544   wcel 1710   F/_wnfc 2476
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-11 1746
This theorem depends on definitions:  df-bi 177  df-ex 1542  df-nf 1545  df-nfc 2478
This theorem is referenced by:  nfabd2  2507  dvelimdc  2509  sbnfc2  3196
  Copyright terms: Public domain W3C validator