Metamath Proof Explorer


Theorem nfsbc

Description: Bound-variable hypothesis builder for class substitution. Usage of this theorem is discouraged because it depends on ax-13 . Use the weaker nfsbcw when possible. (Contributed by NM, 7-Sep-2014) (Revised by Mario Carneiro, 12-Oct-2016) (New usage is discouraged.)

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

Proof

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