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

Theorem nfrmo 3362
 Description: Bound-variable hypothesis builder for restricted uniqueness. Usage of this theorem is discouraged because it depends on ax-13 2391. Use the weaker nfrmow 3360 when possible. (Contributed by NM, 16-Jun-2017.) (New usage is discouraged.)
Hypotheses
Ref Expression
nfreu.1 𝑥𝐴
nfreu.2 𝑥𝜑
Assertion
Ref Expression
nfrmo 𝑥∃*𝑦𝐴 𝜑

Proof of Theorem nfrmo
StepHypRef Expression
1 df-rmo 3134 . 2 (∃*𝑦𝐴 𝜑 ↔ ∃*𝑦(𝑦𝐴𝜑))
2 nftru 1806 . . . 4 𝑦
3 nfcvf 3001 . . . . . . 7 (¬ ∀𝑥 𝑥 = 𝑦𝑥𝑦)
4 nfreu.1 . . . . . . . 8 𝑥𝐴
54a1i 11 . . . . . . 7 (¬ ∀𝑥 𝑥 = 𝑦𝑥𝐴)
63, 5nfeld 2985 . . . . . 6 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑦𝐴)
7 nfreu.2 . . . . . . 7 𝑥𝜑
87a1i 11 . . . . . 6 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝜑)
96, 8nfand 1899 . . . . 5 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥(𝑦𝐴𝜑))
109adantl 485 . . . 4 ((⊤ ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥(𝑦𝐴𝜑))
112, 10nfmod2 2642 . . 3 (⊤ → Ⅎ𝑥∃*𝑦(𝑦𝐴𝜑))
1211mptru 1545 . 2 𝑥∃*𝑦(𝑦𝐴𝜑)
131, 12nfxfr 1854 1 𝑥∃*𝑦𝐴 𝜑
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ∧ wa 399  ∀wal 1536  ⊤wtru 1539  Ⅎwnf 1785   ∈ wcel 2115  ∃*wmo 2621  Ⅎwnfc 2958  ∃*wrmo 3129 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 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-13 2391  ax-ext 2793 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-mo 2623  df-cleq 2814  df-clel 2892  df-nfc 2960  df-rmo 3134 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator