Metamath Proof Explorer


Theorem nfrmow

Description: Bound-variable hypothesis builder for restricted uniqueness. Version of nfrmo with a disjoint variable condition, which does not require ax-13 . (Contributed by NM, 16-Jun-2017) Avoid ax-13 . (Revised by GG, 10-Jan-2024) Avoid ax-9 , ax-ext . (Revised by Wolf Lammen, 21-Nov-2024)

Ref Expression
Hypotheses nfrmow.1 ⊢ Ⅎ 𝑥 𝐴
nfrmow.2 ⊢ Ⅎ 𝑥 𝜑
Assertion nfrmow Ⅎ 𝑥 ∃* 𝑦 ∈ 𝐴 𝜑

Proof

Step Hyp Ref Expression
1 nfrmow.1 ⊢ Ⅎ 𝑥 𝐴
2 nfrmow.2 ⊢ Ⅎ 𝑥 𝜑
3 df-rmo ⊢ ( ∃* 𝑦 ∈ 𝐴 𝜑 ↔ ∃* 𝑦 ( 𝑦 ∈ 𝐴 ∧ 𝜑 ) )
4 1 nfcri ⊢ Ⅎ 𝑥 𝑦 ∈ 𝐴
5 4 2 nfan ⊢ Ⅎ 𝑥 ( 𝑦 ∈ 𝐴 ∧ 𝜑 )
6 5 nfmov ⊢ Ⅎ 𝑥 ∃* 𝑦 ( 𝑦 ∈ 𝐴 ∧ 𝜑 )
7 3 6 nfxfr ⊢ Ⅎ 𝑥 ∃* 𝑦 ∈ 𝐴 𝜑