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

Theorem nfnfc 2934
Description: Hypothesis builder for Ⅎ𝑦𝐴. (Contributed by Mario Carneiro, 11-Aug-2016.) Remove dependency on ax-13 2401. (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 2909 . 2 (Ⅎ𝑦𝐴 ↔ ∀𝑧Ⅎ𝑦 𝑧 ∈ 𝐴)
2 nfnfc.1 . . . . . 6 Ⅎ𝑥𝐴
3 df-nfc 2909 . . . . . 6 (Ⅎ𝑥𝐴 ↔ ∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴)
42, 3mpbi 233 . . . . 5 ∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴
54spi 2220 . . . 4 Ⅎ𝑥 𝑧 ∈ 𝐴
65nfnf 2356 . . 3 Ⅎ𝑥Ⅎ𝑦 𝑧 ∈ 𝐴
76nfal 2353 . 2 Ⅎ𝑥∀𝑧Ⅎ𝑦 𝑧 ∈ 𝐴
81, 7nfxfr 1885 1 Ⅎ𝑥Ⅎ𝑦𝐴
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ∀wal 1567  Ⅎwnf 1815   ∈ wcel 2144  Ⅎwnfc 2907
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-11 2193  ax-12 2212
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-nf 1816  df-nfc 2909
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator