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

Theorem nfnfc 2910
Description: Hypothesis builder for 𝑦𝐴. (Contributed by Mario Carneiro, 11-Aug-2016.) Remove dependency on ax-13 2375. (Revised by Wolf Lammen, 10-Dec-2019.)
Hypothesis
Ref Expression
nfnfc.1 𝑥𝐴
Assertion
Ref Expression
nfnfc 𝑥𝑦𝐴

Proof of Theorem nfnfc
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-nfc 2884 . 2 (𝑦𝐴 ↔ ∀𝑧𝑦 𝑧𝐴)
2 nfnfc.1 . . . . . 6 𝑥𝐴
3 df-nfc 2884 . . . . . 6 (𝑥𝐴 ↔ ∀𝑧𝑥 𝑧𝐴)
42, 3mpbi 230 . . . . 5 𝑧𝑥 𝑧𝐴
54spi 2190 . . . 4 𝑥 𝑧𝐴
65nfnf 2330 . . 3 𝑥𝑦 𝑧𝐴
76nfal 2327 . 2 𝑥𝑧𝑦 𝑧𝐴
81, 7nfxfr 1855 1 𝑥𝑦𝐴
Colors of variables: wff setvar class
Syntax hints:  wal 1540  wnf 1785  wcel 2114  wnfc 2882
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-10 2147  ax-11 2163  ax-12 2183
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-ex 1782  df-nf 1786  df-nfc 2884
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator