Theorem spsbcd 3751

Description: Specialization: if a formula is true for all sets, it is true for any class which is a set. Similar to Theorem 6.11 of [Quine] p. 44. See also stdpc4 2073 and rspsbc 3826. (Contributed by Mario Carneiro, 9-Feb-2017.)

Hypotheses

Ref	Expression
spsbcd.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
spsbcd.2	⊢ (𝜑 → ∀𝑥𝜓)

Assertion

Ref	Expression
spsbcd	⊢ (𝜑 → [𝐴 / 𝑥]𝜓)

Proof of Theorem spsbcd

Step	Hyp	Ref	Expression
1		spsbcd.1	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2		spsbcd.2	. 2 ⊢ (𝜑 → ∀𝑥𝜓)
3		spsbc 3750	. 2 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥𝜓 → [𝐴 / 𝑥]𝜓))
4	1, 2, 3	sylc 65	1 ⊢ (𝜑 → [𝐴 / 𝑥]𝜓)

Syntax hints:   → wi 4  ∀wal 1539   ∈ wcel 2113  [wsbc 3737

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-sbc 3738

This theorem is referenced by:  ovmpodxf  7505  ex-natded9.26  30420  spsbcdi  38231  ovmpordxf  48501