MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfcr Structured version   Visualization version   GIF version

Theorem nfcr 2921
Description: Consequence of the not-free predicate. (Contributed by Mario Carneiro, 11-Aug-2016.) Drop ax-12 2219 but use ax-8 2151, df-clel 2844, and avoid a DV condition on 𝑦, 𝐴. (Revised by SN, 3-Jun-2024.)
Assertion
Ref Expression
nfcr (𝑥𝐴 → Ⅎ𝑥 𝑦𝐴)
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝐴(𝑥,𝑦)

Proof of Theorem nfcr
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-nfc 2918 . 2 (𝑥𝐴 ↔ ∀𝑧𝑥 𝑧𝐴)
2 eleq1w 2852 . . . 4 (𝑧 = 𝑦 → (𝑧𝐴𝑦𝐴))
32nfbidv 1949 . . 3 (𝑧 = 𝑦 → (Ⅎ𝑥 𝑧𝐴 ↔ Ⅎ𝑥 𝑦𝐴))
43spvv 2015 . 2 (∀𝑧𝑥 𝑧𝐴 → Ⅎ𝑥 𝑦𝐴)
51, 4sylbi 220 1 (𝑥𝐴 → Ⅎ𝑥 𝑦𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1565  wnf 1810  wcel 2149  wnfc 2916
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151
This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1807  df-nf 1811  df-clel 2844  df-nfc 2918
This theorem is referenced by:  nfcri  2923  nfcrd  2925  abidnf  3674  csbtt  3878  csbnestgfw  4393  csbnestgf  4398  nfchnd  18666
  Copyright terms: Public domain W3C validator