Theorem sbalex 2276

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 2090.

That both sides of the biconditional express proper substitution is proved by sb5 2309 and sb6 2117. The implication "to the left" is equs4v 2019 and does not require ax-10 2174 nor ax-12 2211. It also holds without disjoint variable condition if we allow more axioms (see equs4 2446). Theorem 6.2 of [Quine] p. 40. Theorem equs5 2490 replaces the disjoint variable condition with a distinctor antecedent. Theorem equs45f 2489 replaces the disjoint variable condition on 𝑥, 𝑡 with the nonfreeness hypothesis of 𝑡 in 𝜑. (Contributed by NM, 14-Apr-2008.) Revised to use equsexv 2302 in place of equsex 2448 in order to remove dependency on ax-13 2402. (Revised by BJ, 20-Dec-2020.) Revise to remove dependency on df-sb 2090. (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 2183	. . 3 ⊢ Ⅎ𝑥∃𝑥(𝑥 = 𝑡 ∧ 𝜑)
2		ax12ev2 2214	. . 3 ⊢ (∃𝑥(𝑥 = 𝑡 ∧ 𝜑) → (𝑥 = 𝑡 → 𝜑))
3	1, 2	alrimi 2247	. 2 ⊢ (∃𝑥(𝑥 = 𝑡 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑡 → 𝜑))
4		equs4v 2019	. 2 ⊢ (∀𝑥(𝑥 = 𝑡 → 𝜑) → ∃𝑥(𝑥 = 𝑡 ∧ 𝜑))
5	3, 4	impbii 211	1 ⊢ (∃𝑥(𝑥 = 𝑡 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑡 → 𝜑))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399  ∀wal 1557  ∃wex 1798

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-10 2174  ax-12 2211

This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1799  df-nf 1803

This theorem is referenced by:  sb5  2309  dfsb7  2312  alexeqg  3610  dfdif3OLD  4072  regsfromsetind  36863  pm13.196a  44954