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

Theorem nfreu 3415
Description: Bound-variable hypothesis builder for restricted unique existence. Usage of this theorem is discouraged because it depends on ax-13 2405. Use the weaker nfreuw 3399 when possible. (Contributed by NM, 30-Oct-2010.) (Revised by Mario Carneiro, 8-Oct-2016.) (New usage is discouraged.)
Hypotheses
Ref Expression
nfrmo.1 𝑥𝐴
nfrmo.2 𝑥𝜑
Assertion
Ref Expression
nfreu 𝑥∃!𝑦𝐴 𝜑

Proof of Theorem nfreu
StepHypRef Expression
1 nftru 1826 . . 3 𝑦
2 nfrmo.1 . . . 4 𝑥𝐴
32a1i 11 . . 3 (⊤ → 𝑥𝐴)
4 nfrmo.2 . . . 4 𝑥𝜑
54a1i 11 . . 3 (⊤ → Ⅎ𝑥𝜑)
61, 3, 5nfreud 3413 . 2 (⊤ → Ⅎ𝑥∃!𝑦𝐴 𝜑)
76mptru 1569 1 𝑥∃!𝑦𝐴 𝜑
Colors of variables: wff setvar class
Syntax hints:  wtru 1563  wnf 1805  wnfc 2911  ∃!wreu 3367
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-13 2405  ax-ext 2736
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1565  df-ex 1802  df-nf 1806  df-mo 2568  df-eu 2598  df-cleq 2756  df-clel 2839  df-nfc 2913  df-reu 3370
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator