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

Theorem nfnfc 2936
Description: Hypothesis builder for 𝑦𝐴. (Contributed by Mario Carneiro, 11-Aug-2016.) Remove dependency on ax-13 2403. (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 2911 . 2 (𝑦𝐴 ↔ ∀𝑧𝑦 𝑧𝐴)
2 nfnfc.1 . . . . . 6 𝑥𝐴
3 df-nfc 2911 . . . . . 6 (𝑥𝐴 ↔ ∀𝑧𝑥 𝑧𝐴)
42, 3mpbi 233 . . . . 5 𝑧𝑥 𝑧𝐴
54spi 2219 . . . 4 𝑥 𝑧𝐴
65nfnf 2358 . . 3 𝑥𝑦 𝑧𝐴
76nfal 2355 . 2 𝑥𝑧𝑦 𝑧𝐴
81, 7nfxfr 1882 1 𝑥𝑦𝐴
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wal 1567  wnf 1812  wcel 2142  wnfc 2909
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-10 2175  ax-11 2191  ax-12 2212
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ex 1809  df-nf 1813  df-nfc 2911
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator