Metamath Proof Explorer


Theorem nfsbcw

Description: Bound-variable hypothesis builder for class substitution. Version of nfsbc with a disjoint variable condition, which does not require ax-13 . (Contributed by NM, 7-Sep-2014) Avoid ax-13 . (Revised by GG, 10-Jan-2024)

Ref Expression
Hypotheses nfsbcw.1 ⊢ Ⅎ _ x A
nfsbcw.2 ⊢ Ⅎ x φ
Assertion nfsbcw ⊢ Ⅎ x [˙A / y]˙ φ

Proof

Step Hyp Ref Expression
1 nfsbcw.1 ⊢ Ⅎ _ x A
2 nfsbcw.2 ⊢ Ⅎ x φ
3 nftru ⊢ Ⅎ y ⊤
4 1 a1i ⊢ ⊤ → Ⅎ _ x A
5 2 a1i ⊢ ⊤ → Ⅎ x φ
6 3 4 5 nfsbcdw ⊢ ⊤ → Ⅎ x [˙A / y]˙ φ
7 6 mptru ⊢ Ⅎ x [˙A / y]˙ φ