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 ⊢ Ⅎ _ x A
nfrmow.2 ⊢ Ⅎ x φ
Assertion nfrmow ⊢ Ⅎ x ∃* y ∈ A φ

Proof

Step Hyp Ref Expression
1 nfrmow.1 ⊢ Ⅎ _ x A
2 nfrmow.2 ⊢ Ⅎ x φ
3 df-rmo ⊢ ∃* y ∈ A φ ↔ ∃* y y ∈ A ∧ φ
4 1 nfcri ⊢ Ⅎ x y ∈ A
5 4 2 nfan ⊢ Ⅎ x y ∈ A ∧ φ
6 5 nfmov ⊢ Ⅎ x ∃* y y ∈ A ∧ φ
7 3 6 nfxfr ⊢ Ⅎ x ∃* y ∈ A φ