Theorem sb56 2307

Description: Two equivalent ways of expressing the proper substitution of 𝑦 for 𝑥 in 𝜑, when 𝑥 and 𝑦 are distinct. Theorem 6.2 of [Quine] p. 40. The proof does not involve df-sb 2070. The implication "to the left" is equs4 2437 and does not require any disjoint variable condition (but the version with a disjoint variable condition, equs4v 2109, requires fewer axioms). Theorem equs45f 2480 replaces the disjoint variable condition with a non-freeness hypothesis and equs5 2481 replaces it with a distinctor as antecedent. (Contributed by NM, 14-Apr-2008.) Revised to use equsexv 2301 in place of equsex 2439 in order to remove dependency on ax-13 2391. (Revised by BJ, 20-Dec-2020.)

Assertion

Ref	Expression
sb56	⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem sb56

Step	Hyp	Ref	Expression
1		nfa1 2204	. 2 ⊢ Ⅎ𝑥∀𝑥(𝑥 = 𝑦 → 𝜑)
2		ax12v2 2224	. . 3 ⊢ (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))
3		sp 2226	. . . 4 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → (𝑥 = 𝑦 → 𝜑))
4	3	com12 32	. . 3 ⊢ (𝑥 = 𝑦 → (∀𝑥(𝑥 = 𝑦 → 𝜑) → 𝜑))
5	2, 4	impbid 204	. 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)))
6	1, 5	equsexv 2301	1 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))

Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 386  ∀wal 1656  ∃wex 1880

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-10 2194  ax-12 2222

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-ex 1881  df-nf 1885

This theorem is referenced by:  sb4v  2308  sb5  2310  sb6OLD  2561  mopick  2715  alexeqg  3550  dfdif3  3947  bj-sb3v  33287  pm13.196a  39454