Theorem sbalex 2249

Description: Equivalence of two ways to express proper substitution of a setvar for another setvar disjoint from it in a formula. This proof of their equivalence does not use df-sb 2068.

That both sides of the biconditional express proper substitution is proved by sb5 2282 and sb6 2090. The implication "to the left" is equs4v 2001 and does not require ax-10 2146 nor ax-12 2184. It also holds without disjoint variable condition if we allow more axioms (see equs4 2420). Theorem 6.2 of [Quine] p. 40. Theorem equs5 2464 replaces the disjoint variable condition with a distinctor antecedent. Theorem equs45f 2463 replaces the disjoint variable condition on 𝑥, 𝑡 with the nonfreeness hypothesis of 𝑡 in 𝜑. (Contributed by NM, 14-Apr-2008.) Revised to use equsexv 2275 in place of equsex 2422 in order to remove dependency on ax-13 2376. (Revised by BJ, 20-Dec-2020.) Revise to remove dependency on df-sb 2068. (Revised by BJ, 21-Sep-2024.) (Proof shortened by SN, 14-Aug-2025.)

Assertion

Ref	Expression
sbalex	⊢ (∃𝑥(𝑥 = 𝑡 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑡 → 𝜑))

Distinct variable group:   𝑥,𝑡

Allowed substitution hints:   𝜑(𝑥,𝑡)

Proof of Theorem sbalex

Step	Hyp	Ref	Expression
1		nfe1 2155	. . 3 ⊢ Ⅎ𝑥∃𝑥(𝑥 = 𝑡 ∧ 𝜑)
2		ax12ev2 2187	. . 3 ⊢ (∃𝑥(𝑥 = 𝑡 ∧ 𝜑) → (𝑥 = 𝑡 → 𝜑))
3	1, 2	alrimi 2220	. 2 ⊢ (∃𝑥(𝑥 = 𝑡 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑡 → 𝜑))
4		equs4v 2001	. 2 ⊢ (∀𝑥(𝑥 = 𝑡 → 𝜑) → ∃𝑥(𝑥 = 𝑡 ∧ 𝜑))
5	3, 4	impbii 209	1 ⊢ (∃𝑥(𝑥 = 𝑡 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑡 → 𝜑))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1539  ∃wex 1780

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-10 2146  ax-12 2184

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1781  df-nf 1785

This theorem is referenced by:  sb5  2282  dfsb7  2285  alexeqg  3605  dfdif3OLD  4070  regsfromsetind  36669  pm13.196a  44651