Theorem spsbcd 3753

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 2105 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 3752	. 2 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥𝜓 → [𝐴 / 𝑥]𝜓))
4	1, 2, 3	sylc 66	1 ⊢ (𝜑 → [𝐴 / 𝑥]𝜓)

This proof depends on syntax axioms:   → wi 4  ∀wal 1568   ∈ wcel 2145  [wsbc 3739

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-sbc 3740

This theorem is used by:  ovmpodxf  7563  ex-natded9.26  30899  spsbcdi  38866  ovmpordxf  49269