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 2404. 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 1837 . . 3 Ⅎ𝑦⊤
2 nfrmo.1 . . . 4 Ⅎ𝑥𝐴
32a1i 11 . . 3 (⊤ → Ⅎ𝑥𝐴)
4 nfrmo.2 . . . 4 Ⅎ𝑥𝜑
54a1i 11 . . 3 (⊤ → Ⅎ𝑥𝜑)
61, 3, 5nfreud 3413 . 2 (⊤ → Ⅎ𝑥∃!𝑦 ∈ 𝐴 𝜑)
76mptru 1577 1 Ⅎ𝑥∃!𝑦 ∈ 𝐴 𝜑
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ⊤wtru 1571  Ⅎwnf 1816  Ⅎwnfc 2911  ∃!wreu 3367
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-13 2404  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-mo 2567  df-eu 2597  df-cleq 2755  df-clel 2839  df-nfc 2913  df-reu 3370
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator